$ /nix/store/rry6qingvsrqmc7ll7jgaqpybcbdgf5v-coreutils-9.7/bin/timeout --kill-after=15s 1800s /nix/store/mycbwkcm1jzjgsaiydvzib9phmzfz9vx-nix-2.31.1/bin/nix --extra-experimental-features nix-command --extra-experimental-features flakes --extra-substituters https://sellout.cachix.org --extra-trusted-public-keys sellout.cachix.org-1:v37cTpWBEycnYxSPAgSQ57Wiqd3wjljni2aC0Xry1DE= --netrc-file /tmp/nix-ci-worker-074367c4b0003c7f/cachix-c37d752b8ba623cf/netrc --extra-substituters https://cache.nix-ci.com --extra-trusted-public-keys nix-ci-staging:Q5+aawDG0LPCgu1fP9e+9hktvsfSyvu/Xe5PvzTLRVs= --netrc-file /tmp/nix-ci-worker-074367c4b0003c7f/nix-ci-cache-f01a4f62dd35995e/netrc --extra-substituters ssh-ng://worker.nix-ci.com?ssh-key=/tmp/nix-ci-worker-074367c4b0003c7f/ssh-key-15798e67d87acaeb/ssh.key&remote-store=/cache/nix-ci/&base64-ssh-public-host-key=c3NoLWVkMjU1MTkgQUFBQUMzTnphQzFsWkRJMU5URTVBQUFBSU9EQXdicHlRaVYwb2lyakhxbHIwbitnWDNNVjQwbDBKTmlKdVNDZHdoZ1o= --extra-trusted-public-keys nix-ci-staging:Q5+aawDG0LPCgu1fP9e+9hktvsfSyvu/Xe5PvzTLRVs= --print-build-logs build --no-link git+https://x-access-token:<REDACTED:GITHUB_ACCESS_TOKEN>@github.com/sellout/duoids?ref=renovate%2Flock-file-maintenance&rev=86e5cce6ed1d4413db707a535c16e7239b9cfaf0#devShells.x86_64-linux.ghc981 --post-build-hook /tmp/nix-ci-worker-074367c4b0003c7f/nix-ci-cache-upload.sh
warning: ignoring untrusted flake configuration setting 'allow-import-from-derivation'.
Pass '--accept-flake-config' to trust it
warning: ignoring untrusted flake configuration setting 'extra-experimental-features'.
Pass '--accept-flake-config' to trust it
warning: ignoring untrusted flake configuration setting 'extra-substituters'.
Pass '--accept-flake-config' to trust it
warning: ignoring untrusted flake configuration setting 'extra-trusted-public-keys'.
Pass '--accept-flake-config' to trust it
warning: ignoring untrusted flake configuration setting 'sandbox'.
Pass '--accept-flake-config' to trust it
warning: ignoring untrusted flake configuration setting 'use-registries'.
Pass '--accept-flake-config' to trust it
building '/nix/store/qwwm1495k4zawnvnc8fl4i27fm1rz5wg-cabal2nix-algebraic-graph-duoids.drv'...
cabal2nix-algebraic-graph-duoids (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/i4jd9h34hpznsmzfg3wdg9myf7aycim8-cabal2nix-algebraic-graph-duoids
cabal2nix-algebraic-graph-duoids (post)> Nothing to push - all store paths are already on Cachix.
cabal2nix-algebraic-graph-duoids (post)> added 1 signatures
cabal2nix-algebraic-graph-duoids (post)> added 1 signatures
cabal2nix-algebraic-graph-duoids (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/i4jd9h34hpznsmzfg3wdg9myf7aycim8-cabal2nix-algebraic-graph-duoids
cabal2nix-algebraic-graph-duoids (post)> copying 1 paths...
cabal2nix-algebraic-graph-duoids (post)> copying path '/nix/store/i4jd9h34hpznsmzfg3wdg9myf7aycim8-cabal2nix-algebraic-graph-duoids' to 'https://cache.nix-ci.com'...
cabal2nix-algebraic-graph-duoids (post)> copying 0 paths...
cabal2nix-algebraic-graph-duoids (post)> added 0 signatures
cabal2nix-algebraic-graph-duoids (post)> added 0 signatures
cabal2nix-algebraic-graph-duoids (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/i4jd9h34hpznsmzfg3wdg9myf7aycim8-cabal2nix-algebraic-graph-duoids
cabal2nix-algebraic-graph-duoids (post)> copying 0 paths...
cabal2nix-algebraic-graph-duoids (post)> copying 0 paths...
building '/nix/store/83mnzxm9nxw8k7bm61zsyc42zys3d6an-cabal2nix-duoidal-transformers.drv'...
cabal2nix-duoidal-transformers (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/9ijqqwbzii6rmydsiyqqi8l51mchvg0s-cabal2nix-duoidal-transformers
cabal2nix-duoidal-transformers (post)> Nothing to push - all store paths are already on Cachix.
cabal2nix-duoidal-transformers (post)> added 1 signatures
cabal2nix-duoidal-transformers (post)> added 1 signatures
cabal2nix-duoidal-transformers (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/9ijqqwbzii6rmydsiyqqi8l51mchvg0s-cabal2nix-duoidal-transformers
cabal2nix-duoidal-transformers (post)> copying 1 paths...
cabal2nix-duoidal-transformers (post)> copying path '/nix/store/9ijqqwbzii6rmydsiyqqi8l51mchvg0s-cabal2nix-duoidal-transformers' to 'https://cache.nix-ci.com'...
cabal2nix-duoidal-transformers (post)> copying 0 paths...
cabal2nix-duoidal-transformers (post)> added 0 signatures
cabal2nix-duoidal-transformers (post)> added 0 signatures
cabal2nix-duoidal-transformers (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/9ijqqwbzii6rmydsiyqqi8l51mchvg0s-cabal2nix-duoidal-transformers
cabal2nix-duoidal-transformers (post)> copying 0 paths...
cabal2nix-duoidal-transformers (post)> copying 0 paths...
building '/nix/store/38zr5xgfspzna6iyzrig98f48hvpxz89-cabal2nix-duoids.drv'...
cabal2nix-duoids (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/s84703lam5334alhwm4jm8k00slzv455-cabal2nix-duoids
cabal2nix-duoids (post)> Nothing to push - all store paths are already on Cachix.
cabal2nix-duoids (post)> added 1 signatures
cabal2nix-duoids (post)> added 1 signatures
cabal2nix-duoids (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/s84703lam5334alhwm4jm8k00slzv455-cabal2nix-duoids
cabal2nix-duoids (post)> copying 1 paths...
cabal2nix-duoids (post)> copying path '/nix/store/s84703lam5334alhwm4jm8k00slzv455-cabal2nix-duoids' to 'https://cache.nix-ci.com'...
cabal2nix-duoids (post)> copying 0 paths...
cabal2nix-duoids (post)> added 0 signatures
cabal2nix-duoids (post)> added 0 signatures
cabal2nix-duoids (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/s84703lam5334alhwm4jm8k00slzv455-cabal2nix-duoids
cabal2nix-duoids (post)> copying 0 paths...
cabal2nix-duoids (post)> copying 0 paths...
building '/nix/store/0d7j05bbd09n9aszwgfnhijrwl88zwpz-cabal2nix-duoids-hedgehog.drv'...
cabal2nix-duoids-hedgehog (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/mivnn69ay6ajhb0filq718zgnw038xy3-cabal2nix-duoids-hedgehog
cabal2nix-duoids-hedgehog (post)> Nothing to push - all store paths are already on Cachix.
cabal2nix-duoids-hedgehog (post)> added 1 signatures
cabal2nix-duoids-hedgehog (post)> added 1 signatures
cabal2nix-duoids-hedgehog (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/mivnn69ay6ajhb0filq718zgnw038xy3-cabal2nix-duoids-hedgehog
cabal2nix-duoids-hedgehog (post)> copying 1 paths...
cabal2nix-duoids-hedgehog (post)> copying path '/nix/store/mivnn69ay6ajhb0filq718zgnw038xy3-cabal2nix-duoids-hedgehog' to 'https://cache.nix-ci.com'...
cabal2nix-duoids-hedgehog (post)> copying 0 paths...
cabal2nix-duoids-hedgehog (post)> added 0 signatures
cabal2nix-duoids-hedgehog (post)> added 0 signatures
cabal2nix-duoids-hedgehog (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/mivnn69ay6ajhb0filq718zgnw038xy3-cabal2nix-duoids-hedgehog
cabal2nix-duoids-hedgehog (post)> copying 0 paths...
cabal2nix-duoids-hedgehog (post)> copying 0 paths...
building '/nix/store/8rnp72nfxki0k4kc5iab10nl7sd0sx9w-cabal2nix-no-recursion.drv'...
cabal2nix-no-recursion (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/1d5z11ni3b38nfcvsl5n70h25c4cxpnj-cabal2nix-no-recursion
cabal2nix-no-recursion (post)> Pushing 1 paths (1 are already present) using zstd to cache sellout ⏳
cabal2nix-no-recursion (post)> 
cabal2nix-no-recursion (post)> Pushing /nix/store/1d5z11ni3b38nfcvsl5n70h25c4cxpnj-cabal2nix-no-recursion (848.00 B)
cabal2nix-no-recursion (post)> 
cabal2nix-no-recursion (post)> All done.
cabal2nix-no-recursion (post)> added 1 signatures
cabal2nix-no-recursion (post)> added 1 signatures
cabal2nix-no-recursion (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/1d5z11ni3b38nfcvsl5n70h25c4cxpnj-cabal2nix-no-recursion
cabal2nix-no-recursion (post)> copying 1 paths...
cabal2nix-no-recursion (post)> copying path '/nix/store/1d5z11ni3b38nfcvsl5n70h25c4cxpnj-cabal2nix-no-recursion' to 'https://cache.nix-ci.com'...
cabal2nix-no-recursion (post)> copying 1 paths...
cabal2nix-no-recursion (post)> copying path '/nix/store/8rnp72nfxki0k4kc5iab10nl7sd0sx9w-cabal2nix-no-recursion.drv' to 'https://cache.nix-ci.com'...
cabal2nix-no-recursion (post)> added 0 signatures
cabal2nix-no-recursion (post)> added 0 signatures
cabal2nix-no-recursion (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/1d5z11ni3b38nfcvsl5n70h25c4cxpnj-cabal2nix-no-recursion
cabal2nix-no-recursion (post)> copying 1 paths...
cabal2nix-no-recursion (post)> copying path '/nix/store/1d5z11ni3b38nfcvsl5n70h25c4cxpnj-cabal2nix-no-recursion' to 'ssh-ng://worker.nix-ci.com'...
cabal2nix-no-recursion (post)> copying 1 paths...
cabal2nix-no-recursion (post)> copying path '/nix/store/8rnp72nfxki0k4kc5iab10nl7sd0sx9w-cabal2nix-no-recursion.drv' to 'ssh-ng://worker.nix-ci.com'...
these 14 derivations will be built:
  /nix/store/53mlbn192ckdzwrkvmhx342vkvbpbv6q-Cabal-syntax-3.12.1.0.drv
  /nix/store/f4bz5nlf69zgfxikc7w98m13q3ysmw66-Cabal-3.12.1.0.drv
  /nix/store/yzvldx7zq7xlxqcbswr3f2208k08raiy-ghc-paths-0.1.0.12.drv
  /nix/store/989y2cvpp3g59xj466p6na2advd2r3jb-doctest-0.22.6.drv
  /nix/store/lfh0jnlpg0pcc0148b781bizlqm7s68m-cabal-doctest-1.0.11.drv
  /nix/store/1pq12dx42mf5sam3hkb11ddyl1rqzlm0-no-recursion-0.3.0.0.drv
  /nix/store/2arh61w9mwa0zd7rw90cl46s5agma11k-vector-0.13.2.0.drv
  /nix/store/f4j26b5i6a9d3qcvfadkl4jqpf5w9cvv-nothunks-0.3.0.0.drv
  /nix/store/8vllyaka6r2ssb8x8whnn3sl3aif235b-unordered-containers-0.2.20.drv
  /nix/store/rkks937kacssls70fwmdpr1784pgjz85-quickcheck-instances-0.3.32.drv
  /nix/store/kbkly0bgcxjqkwvwxci02z8fvkrzvaka-extra-1.7.16.drv
  /nix/store/zf0xsjlpw0xhpkk7wdrsqp2ag77ycx2a-algebraic-graphs-0.7.drv
  /nix/store/1lydjvm5kqkgnn8qfywwbpl8wqc16mr6-ghc-9.8.1-with-packages.drv
  /nix/store/rbw99i2mvf33z5rhxga3awd4q3cvpa4r-ghc-shell-for-packages-0.drv
these 573 paths will be fetched (520.20 MiB download, 6891.07 MiB unpacked):
  /nix/store/jw7qsv9kf3siqzbikpm7xxx8b3hrvq7s-ChasingBottoms-1.3.1.15
  /nix/store/821y4y75yjq86by11r0wjm04dx0wlmyh-ChasingBottoms-1.3.1.15-doc
  /nix/store/wy695nkv8xyl12pk8hpfgb5bnn464zd5-Diff-0.5
  /nix/store/1ql42c2mg8rgkwk0ckyil3n2143j0mnr-Diff-0.5-doc
  /nix/store/ca03pjdnbzls40vndpsx6vqrbf01b6fn-Glob-0.10.2
  /nix/store/xs1yq6zcvzq0xxxi28p002n5ync7z1aa-Glob-0.10.2-doc
  /nix/store/p7nky91j7npsmg4x0nzxz8x033g8mjcs-HUnit-1.6.2.0
  /nix/store/14q9xwdzlngm40420snava2z822zjsz1-HUnit-1.6.2.0-doc
  /nix/store/8p6zbx9avnqdr3n73pff594bhkzgm433-HsYAML-0.2.1.5
  /nix/store/dsriaxx4r9671nyfqjd8vhwbg0i8z7ld-HsYAML-0.2.1.5-doc
  /nix/store/mys707lrrd8ax7jh8hb2azwx8ymhaqyk-HsYAML-aeson-0.2.0.2
  /nix/store/mmbcq4hm4qrm9b4r0746669saw1pxgn1-HsYAML-aeson-0.2.0.2-doc
  /nix/store/rc3xdxjalh8kz50bkak8lyjdznyh1fbj-ListLike-4.7.8.3
  /nix/store/4lfbqjrn2asf80x6gpifvgs5p649nfcd-ListLike-4.7.8.3-doc
  /nix/store/xq7wjyx5awvh1c9l0w2ls4jfnwlck06d-MemoTrie-0.6.11
  /nix/store/ipafyk50vi2wm01yrisza0vn1l5cgdbv-MemoTrie-0.6.11-doc
  /nix/store/51vm0m8j14k8jas21aiy14f34cfxafpl-MonadRandom-0.6.2
  /nix/store/zbi6jnp538zd0iqrh6rvb6fgv83b2p8m-MonadRandom-0.6.2-doc
  /nix/store/qxfz3j9zja9rkv6j2xx5smab84ljfbxy-OneTuple-0.4.2
  /nix/store/xia6lcjp10i2i6a6i6n3rs9c1vf8q5gr-OneTuple-0.4.2-doc
  /nix/store/vi3n5m5ymwfhqw91y3qfs242i46lnxds-Only-0.1
  /nix/store/m8b7fl9h7vxc5plspy33wvw4i752lvw5-Only-0.1-doc
  /nix/store/r41wcm29lgz928p3wp5pi4mz9ra1ijm3-QuickCheck-2.14.3
  /nix/store/7k14i8qz0802ahiin9pqd7jkr9vpw90x-QuickCheck-2.14.3-doc
  /nix/store/133ga3bxw7rv5yrzl6x18c0vl2ip6725-StateVar-1.2.2
  /nix/store/pl6qqi9k5ki0iv1v8drq0iijjsilpq3q-StateVar-1.2.2-doc
  /nix/store/wf3b7dr84bgxd29kif0ak56f4hgccf40-adjunctions-4.4.3
  /nix/store/a3jdq40w1blpmq0zy26sdynrqffb1cma-adjunctions-4.4.3-doc
  /nix/store/qw3rnj9jwiygc05nryk6z6nz4ml4f814-aeson-2.2.3.0
  /nix/store/c9d3q6lqk9ihh29sm762zf4nhlbjvybh-aeson-2.2.3.0-doc
  /nix/store/8kida4jwgjdwsz2iiyr6wqmwpff25xss-aeson-pretty-0.8.10
  /nix/store/6g46dawn1mv7zk8pv1hpvdygln96kkg9-aeson-pretty-0.8.10-doc
  /nix/store/whdwmjaiqdrd3y3pms6a2p80i6ai01yi-alex-3.5.3.0
  /nix/store/zl5wibaqbz9wd005h7zjf436bx2044y6-alex-3.5.3.0-data
  /nix/store/cykclhmq1bpcc3d7ka5gdirvb3vrdnzn-algebraic-graphs-0.7
  /nix/store/0idwg26gnmhp8vf1k4930xvwbnplwzsc-algebraic-graphs-0.7-doc
  /nix/store/9wbynvackkyl229j9b7gqpll26c8gjb8-ansi-terminal-1.1.2
  /nix/store/67v8zp8y2cnbglih2d8vip1vw31i2757-ansi-terminal-1.1.2-doc
  /nix/store/z3vdwn9rw36p4ks9dgafi3l3ksg39byc-ansi-terminal-types-1.1
  /nix/store/am5gv87dj5g43bwghgsp1hd32gibna14-ansi-terminal-types-1.1-doc
  /nix/store/88by3lwrgdfgxw8snipq8snd5sv43cnz-ansi-wl-pprint-1.0.2
  /nix/store/k14h73fvfpya997cwkxvy1d04p8r5gxk-ansi-wl-pprint-1.0.2-doc
  /nix/store/4ngpqprygjy125a52y0xpk2gcn4ifhgv-apply-refact-0.14.0.0
  /nix/store/hig7in7xjzvp40dxly17i3kj19x736bm-apply-refact-0.14.0.0-doc
  /nix/store/j204hrw1c43fxa6f1i3vxfldqmq36j0a-assoc-1.1.1
  /nix/store/smbg5s9ac0phpz3d39i5b07lmnsbix5w-assoc-1.1.1-doc
  /nix/store/gd36qyhrj8p1k7dyx5yl1a3w7x72jmif-async-2.2.5
  /nix/store/sy1j5crsqw8sirywiis72cckw7n68m44-async-2.2.5-doc
  /nix/store/6gl4cbdy13kzi27w5y27cfxy76v30xyw-attoparsec-0.14.4
  /nix/store/rwvkax5jp95bsz8faacqyn6s72mh0cs6-attoparsec-aeson-2.2.2.0
  /nix/store/5klnvsv389p177hm8abrkbv18a34viiy-attoparsec-aeson-2.2.2.0-doc
  /nix/store/bjfaw2nyc4kxmqfjkfyhw4sp0js11yjc-barbies-2.1.1.0
  /nix/store/rx3nydsrpj0gyzk8khvj7sxkrcb9z50l-barbies-2.1.1.0-doc
  /nix/store/qij6jdlk99hj9xwpwixkgpn84zd4ni4x-base-compat-0.13.1
  /nix/store/j8vggajz8bs3sgkwdn99079fvvqdbl6w-base-compat-0.13.1-doc
  /nix/store/fcqmf9ncpk35y6kfq54wjgjm76vkxxh8-base-orphans-0.9.3
  /nix/store/l92zbxx9ldnyrfki5ggdbxsszla4jvcr-base-orphans-0.9.3-doc
  /nix/store/6hlnl5iwbzwfdi8ppahqamg6h39x6gv3-base16-bytestring-1.0.2.0
  /nix/store/w0zkvyk8vhb9gfv9fpm2clfmmxnm66m2-base16-bytestring-1.0.2.0-doc
  /nix/store/yga3whg6jdmx2sl0dr4mz9anxwv1qd77-base64-1.0
  /nix/store/jk2w5dy1pw0f5m25l1wg11lnj2q51y2r-base64-1.0-doc
  /nix/store/qq8a8063yfv1rp8yf4gl11qfb60cf6fb-bifunctors-5.6.2
  /nix/store/ihds4j9mmdqjc2gxrgzlm1ygzaddmwxr-bifunctors-5.6.2-doc
  /nix/store/1690y2d9ynl8m9hjaif19xwyp1k86ml3-binary-instances-1.0.6
  /nix/store/9gx41irn9f6cbx2i59amcrdizi2y8rc8-binary-instances-1.0.6-doc
  /nix/store/09wscm0jvl7bf4s8h8649r305sy66bzq-binary-orphans-1.0.5
  /nix/store/pf89rjhp9s4ahv6fhwjpdhw11nz4kh5l-binary-orphans-1.0.5-doc
  /nix/store/72amq1zjkj644gqm4cfpqzhscy5663fy-bitvec-1.1.5.0
  /nix/store/8qy4fc5bx2m4xn5m2n3kdag8zjlhq6kp-bitvec-1.1.5.0-doc
  /nix/store/8bq4pr5vwg3l5z99w8vh2lg5sljr7z31-blaze-builder-0.4.2.3
  /nix/store/hdk32fkar7p46pvyz9ala9602ah7bm1a-blaze-builder-0.4.2.3-doc
  /nix/store/lw71ay1i4yghkw175wrfp1cd5ix0n3wd-blaze-html-0.9.2.0
  /nix/store/53b31hbz191slz6rv9nzcbk3v8l54mp2-blaze-html-0.9.2.0-doc
  /nix/store/hdr22ahx56l1bj8finc9pr21d4vwjmbi-blaze-markup-0.8.3.0
  /nix/store/6rjjzjmv2mdz44fzw8qk94vpcnph8pl2-blaze-markup-0.8.3.0-doc
  /nix/store/yh4m2xi9zx4hpp0jjnqg0h25ngrpdmrv-blaze-textual-0.2.3.1
  /nix/store/8h5snzjjm762317azvsk81llxkll05sv-blaze-textual-0.2.3.1-doc
  /nix/store/cxxdapxw2x92hdr8x73p5gl9w2xdpsd7-boring-0.2.2
  /nix/store/2bf1blfz4hliwnl311i5yvgdaih1jn7a-boring-0.2.2-doc
  /nix/store/zy38m8wznzsfl1g3fkh2vyaa5whk9sx8-cabal-add-0.1
  /nix/store/78mzhjjarncpmf0i778x7a9zmsw8y4cc-cabal-add-0.1-doc
  /nix/store/d4bp9f7c3fk4y0aqpmisqwlmp1y7lc8s-cabal-install-parsers-0.6.1.1
  /nix/store/5nhn46c153rdznmd4wbg0igwgak83fhj-cabal-install-parsers-0.6.1.1-doc
  /nix/store/8pagg233m92a7x4fqan7jhq56h1qnzjh-call-stack-0.4.0
  /nix/store/np72w3c0v1sjs1mxivrlpymds7z1qqal-call-stack-0.4.0-doc
  /nix/store/q3iwixlv274c8ivnbfc6dp6sqgz3whl7-case-insensitive-1.2.1.0
  /nix/store/hpnh169cvr6silp91rk2hbvbqzspfhi0-case-insensitive-1.2.1.0-doc
  /nix/store/46hwkjngvwzgf52xgkzcl3fjxl8s4v86-cereal-0.5.8.3
  /nix/store/p5hv3is7zr38w16r6gaydv06jj12saz9-cereal-0.5.8.3-doc
  /nix/store/lwybghcg0lc29pbnsm29klaby26xaq9j-character-ps-0.1
  /nix/store/blqgy45h759lyaw2byas6kgj75ijlbar-character-ps-0.1-doc
  /nix/store/yflinmbdb0hjp3fdyr4308h94d0br165-charset-0.3.12
  /nix/store/hwg74ika6yf7gpifjr2mvqfazzlrr933-charset-0.3.12-doc
  /nix/store/gcmirsm19vysrfzqg0f80f33fd7nr0a8-clay-0.15.0
  /nix/store/707n9xvfhdizfi8154viz145v8ly4qsc-clay-0.15.0-doc
  /nix/store/nrhlwdip4prr2n54y171vbxk9km0qxn9-clock-0.8.4
  /nix/store/h10s79qr69gnfmsrrw8mdshdfiyh254s-clock-0.8.4-doc
  /nix/store/a5ii8i70w6mgh8kimk42y8sdii43gn14-cmdargs-0.10.22
  /nix/store/zimd14kamvqhlsfma8irfks6bib0kmad-cmdargs-0.10.22-doc
  /nix/store/01pnh8n3w1lwbsx81r595yakrfdi2iaz-co-log-core-0.3.2.5
  /nix/store/sgs55m0wk08q8iwq89d033583vswfrhl-co-log-core-0.3.2.5-doc
  /nix/store/2adpbjg747rbnc28ps5cli6g3m5cz62y-code-page-0.2.1
  /nix/store/62ipmfvi5faijhkxmg86b8p35s98m6rz-code-page-0.2.1-doc
  /nix/store/lqk1m7ghy524xgdb9vpx8q8pwc5vxkc7-colour-2.3.6
  /nix/store/3d0wy5p9m1b54dqgypbs3vf7pyp7pkr7-colour-2.3.6-data
  /nix/store/4w95w4s290mg19433arsdddrw8isg16z-colour-2.3.6-doc
  /nix/store/vsb1vj407f3lvzmj38vf6kwz6wx0gw5h-colourista-0.1.0.2
  /nix/store/w3ypcimh0kcfjj209qsk1hmhw5qigcxw-colourista-0.1.0.2-doc
  /nix/store/j8r3jv47fj3nca5mw6x3dr8mf66azdwv-commutative-semigroups-0.2.0.2
  /nix/store/gpd67jvqyx61r92yc4yfknwaimbgpfrm-commutative-semigroups-0.2.0.2-doc
  /nix/store/ybhd6i9a9zz5rzzvifbz7lpxgn9hx3x4-comonad-5.0.9
  /nix/store/97rx3ms11dqx69nib1idmd4xq9sfa9px-comonad-5.0.9-doc
  /nix/store/gy08isrfll06yd3q7y8ih05pz00plx2z-concurrent-output-1.10.21
  /nix/store/hz8fzmwmbbcnqba2j5liv43vcpkp5va3-concurrent-output-1.10.21-doc
  /nix/store/ximzqmp5mam31h35rcdkxiklxkzqwdxf-conduit-1.3.6.1
  /nix/store/xpkrfzhc4hwqcnix9j82i48iv7fbqwv5-conduit-1.3.6.1-doc
  /nix/store/rgvwq6b5wpkcc3mi4w1iglc84vv4mk38-conduit-extra-1.3.7
  /nix/store/ag3ghjj1rpav8d3i7nwrh008vblhl967-conduit-extra-1.3.7-doc
  /nix/store/nil691wr5ic0nrncvvg8qysz4b02flhn-conduit-parse-0.2.1.1
  /nix/store/vvpvc6bqj42rjwjjsgcwccqb0895gr51-conduit-parse-0.2.1.1-doc
  /nix/store/mijgh91mfn9pg257cl90kqxm50glgkbg-constraints-0.14.2
  /nix/store/6hd0arkkjd0zrm43cfflqd93wm8p3grd-constraints-0.14.2-doc
  /nix/store/jfxd585w0msljl5201w7bz8l7wzzz28m-constraints-extras-0.4.0.2
  /nix/store/qhfqgnj00vf9a8z2grxpwskzkzl9vp28-constraints-extras-0.4.0.2-doc
  /nix/store/jj6jf40vli22vvv6mmbww8fhrxlxc7pk-contravariant-1.5.5
  /nix/store/v4rz81s2dwfzvgxw2xmmrg8a5pkvh5ni-contravariant-1.5.5-doc
  /nix/store/v81zi8dgm8d6635cj6lmx2d2m376afsv-cpphs-1.20.9.1
  /nix/store/nh9b44sjwyilblpbg9kcidcgl19yzr2r-cpphs-1.20.9.1-doc
  /nix/store/fvd5vyx5acy5zrcs6dj03jgiaqfmmkdb-cryptohash-sha1-0.11.101.0
  /nix/store/mxcgn6jqz79f9jxcr5v5gx5asnfsacxf-cryptohash-sha1-0.11.101.0-doc
  /nix/store/h8fis2rkpmnf59pxj1gqqa8i836fxds3-cryptohash-sha256-0.11.102.1
  /nix/store/cfi2a8xvv22a7mj9gz9839hi9ijncl8k-cryptohash-sha256-0.11.102.1-doc
  /nix/store/ck793ddc9yyi61bjafpzrfmph3sxcaq2-data-default-0.7.1.3
  /nix/store/w07ky81y25ramhb1krbl69286f8n6baq-data-default-0.7.1.3-doc
  /nix/store/7iraps06g34xnk5lcjs8101kb06jf4ph-data-default-class-0.1.2.2
  /nix/store/4sxbgbwixfg0rgbxga443scqy633hjc2-data-default-class-0.1.2.2-doc
  /nix/store/3m6hypz5hxa1n72mhvndd0pv2jhf07v6-data-default-instances-containers-0.1.0.3
  /nix/store/h9n07rnm7m933593fk7msyln31iggndh-data-default-instances-containers-0.1.0.3-doc
  /nix/store/zsc29221ksxazjiyz906c482qrdfppvq-data-default-instances-dlist-0.0.1.2
  /nix/store/qrpymlbzj07k6hpf4il6wv6p6yn8fqgl-data-default-instances-dlist-0.0.1.2-doc
  /nix/store/ldp4yjlk9m6pilkqryaii9bpqm6mz9y6-data-default-instances-old-locale-0.0.1.2
  /nix/store/hj44n3l526vh1sh33q4qwaixdhn9wzvk-data-default-instances-old-locale-0.0.1.2-doc
  /nix/store/lzh773h21y9j8akfk0c2wfgdlgqq9jy0-data-fix-0.3.4
  /nix/store/ygza57c9mpmp7y7pnwglcp4z94jfrnfz-data-fix-0.3.4-doc
  /nix/store/qghbybs2aw6lp8lvygxsk6sgl8vlxnmc-deferred-folds-0.9.18.7
  /nix/store/2hjka0lmflyprhnl36lndx5wn5zsbd2y-deferred-folds-0.9.18.7-doc
  /nix/store/1fwqb3d4drmwh13a86iky5y0j2brsz0h-dependent-map-0.4.0.0
  /nix/store/yk3f90kxd3icl226vak5wmb5225bh1cb-dependent-map-0.4.0.0-doc
  /nix/store/pv15gl27da4dqn466zl8m0xzcikrf68v-dependent-sum-0.7.2.0
  /nix/store/x03i324pvnyfyggl6znlmxxangzj0xsq-dependent-sum-0.7.2.0-doc
  /nix/store/s9sphajm9piw4il6lbfgz0kf6ml5yrfx-deriving-aeson-0.2.10
  /nix/store/bh83rqkks9fn4djf9wz99qjmk2xig7fd-deriving-aeson-0.2.10-doc
  /nix/store/810q3nf1304iq7ja0912ia5aad0qwr4k-dir-traverse-0.2.3.0
  /nix/store/6r2d99lndlbiji51yg5ph4klzrnghv5i-dir-traverse-0.2.3.0-doc
  /nix/store/59pzhpkc3qz9zkx9pj9jjgiy98ikjnlw-direct-sqlite-2.3.29
  /nix/store/pki5096qkgpvqqv5wl4mq94fzm56kby7-direct-sqlite-2.3.29-doc
  /nix/store/l6ippx0jyqb2cygzxkh7a34649jnx47a-distributive-0.6.2.1
  /nix/store/c9j8hmsl2whg742803gw85rdjddrz3ms-distributive-0.6.2.1-doc
  /nix/store/1kday2w56cckykpw26zn9sy654rkw3dl-dlist-1.0
  /nix/store/nx1kyizqb6p5kxr1c8508ffl4p0v09y0-dlist-1.0-doc
  /nix/store/1kzcr6x52gfk9rbs3yci6wambrs00kpn-enummapset-0.7.3.0
  /nix/store/hfxhx7mlfqz5fm99wfjq7fdkcsyags2c-enummapset-0.7.3.0-doc
  /nix/store/2dib1k5pp2j7qf885jglj9gaz074jgjm-erf-2.0.0.0
  /nix/store/yrq8pwjwfr980hl39vhfb844zsx82f1g-erf-2.0.0.0-doc
  /nix/store/cgnnyxdb2rjlksiqzjvp5wpjzskprzgy-extensions-0.1.0.1
  /nix/store/s9ydrpd0vf15lal2nwg179gy1bxv7dpz-extensions-0.1.0.1-doc
  /nix/store/g9nrp0brpl11300g1wa7a1w4mh9kbfsf-extra-1.7.16
  /nix/store/wdla2kl3nfwsn2qlcmsvfdx5sschf6r5-extra-1.7.16-doc
  /nix/store/rmkj1va9yf7knzjrxpmymycbhh3jzxbw-fail-4.9.0.0
  /nix/store/4am1q49h73xshk82fqicwpfxfv44zdqb-file-embed-0.0.16.0
  /nix/store/0i2vkgasifhidl26y3hqsrdkmdwv7wg7-file-embed-0.0.16.0-doc
  /nix/store/bapdhz3m96ciwj2y2x4hg28vmzdib6kg-filemanip-0.3.6.3
  /nix/store/bkva29akzg7zdfbrarw8ylln99bp6v99-filemanip-0.3.6.3-doc
  /nix/store/nrvfnmgjvziw2xbgsr3z57dzdk41hhaj-filepattern-0.1.3
  /nix/store/pa5c795v8pfs7c31rs4xhrzpr87329jq-filepattern-0.1.3-doc
  /nix/store/5ny4fws3gcm2fsilwgndjcj9p714f3wj-filtrable-0.1.6.0
  /nix/store/9jkk7cpyhdlrnksk8rk8w25hzhya6akp-filtrable-0.1.6.0-doc
  /nix/store/448ig19rqv03bmdrc4ghllm845w3jzbi-fingertree-0.1.5.0
  /nix/store/n502y0rkxqwr4v1712fpbf1qlzvmxipf-fingertree-0.1.5.0-doc
  /nix/store/sb3ylvxk1jvxqwqhslywdassijps9p3y-floskell-0.11.1
  /nix/store/i354kjrag7k8z7hzby419xrx2q079klp-floskell-0.11.1-data
  /nix/store/yrmrnvyc2d91fi733pr80ai06963qz22-floskell-0.11.1-doc
  /nix/store/m7xnyfj701wbkwswfhmgc42nvh9xv747-fmlist-0.9.4
  /nix/store/gsdlmrrpv3lvb2j44b01m136sh7ndnc2-fmlist-0.9.4-doc
  /nix/store/0qmyjnd23p309j3gx2ckm5djly96cpa8-focus-1.0.3.2
  /nix/store/aqnzsx58l85399gq908w080r9jqmka61-focus-1.0.3.2-doc
  /nix/store/0rss619asdshcks36w8015g3xsnlqpjk-foldl-1.4.18
  /nix/store/94bms4vzf4mvdlcyk5w11ksi2jy6hpaz-foldl-1.4.18-doc
  /nix/store/d17k6irk68q9wrsq0z3wq6vn4v76l67n-fourmolu-0.15.0.0
  /nix/store/kfv65q0zv5lbpg6ai0mi982nazws552h-fourmolu-0.15.0.0-doc
  /nix/store/jshwsc5c7vz14gpc12fbdsbnfix5kqbx-free-5.2
  /nix/store/wyvzq15a4kbkm8wa5973xgx21j8w1x30-free-5.2-doc
  /nix/store/4l14k4w45lxflaryh3x1y0mqk2sdrwfa-fuzzy-0.1.1.0
  /nix/store/8pa9jwqiikixffmpj5wc044c9mj1j9yw-fuzzy-0.1.1.0-doc
  /nix/store/w7ndwqda2dwalbfwnsxvb3nnnfw8l46s-generic-arbitrary-1.0.1.2
  /nix/store/s9za9ag62q1rh4lq2g9rrxgss63dpfm0-generic-arbitrary-1.0.1.2-doc
  /nix/store/zlr31n03vlf2xykjkarbgrdp8491mkn1-generic-deriving-1.14.6
  /nix/store/yybip4y0slxc9zpbx5i8f5nfmd5ljz1q-generic-deriving-1.14.6-doc
  /nix/store/w6k2653j3bg6gfcvrr5m270xal80syha-generic-lens-2.2.2.0
  /nix/store/6rga899jhpfmdz08i5d8x39h88sjyf2s-generic-lens-2.2.2.0-doc
  /nix/store/rax0znskh57bg8vlzx7qy7fzhm4p546c-generic-lens-core-2.2.1.0
  /nix/store/67181bixvm97345flcpx7y4zkvvcyw1x-generic-lens-core-2.2.1.0-doc
  /nix/store/klrvqqi9i93in6336gnsygf2160rs07f-generically-0.1.1
  /nix/store/aarv4jl074q5in6l8vd4i5az0gn3xsyx-generically-0.1.1-doc
  /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1
  /nix/store/9n6znhba74nhkv9fyjipv7pw6sjbshs3-ghc-9.8.1-doc
  /nix/store/xw15plg31ygcawvagjn221qg84dk0bzh-ghc-exactprint-1.8.0.0
  /nix/store/69qp4xa4m3q6x6aga34aa3i21acnivlq-ghc-exactprint-1.8.0.0-doc
  /nix/store/dzjm5464iv9kajxq7vj09l1j4kdilw2a-ghc-lib-parser-9.8.5.20250214
  /nix/store/ky8gc60x86vv5hy117985srsplmbwzaw-ghc-lib-parser-9.8.5.20250214-data
  /nix/store/4ha8aihi2jmwfpd4fzvf05ds1as1ax3a-ghc-lib-parser-9.8.5.20250214-doc
  /nix/store/cynycn22p3k3psq2asv48zqdh4rgh5yh-ghc-lib-parser-ex-9.8.0.2
  /nix/store/6ma8w7vn3inlq3rd84sfhap3xglprwkz-ghc-lib-parser-ex-9.8.0.2-doc
  /nix/store/y9s0bg4w09ksy787ryfm9cycn1qgh999-ghc-paths-0.1.0.12
  /nix/store/sik3albbr8j35wakjg2xn25hl947np1b-ghc-paths-0.1.0.12-doc
  /nix/store/0lj67xqan50p81b3c17brfl030x4v7cl-ghc-trace-events-0.1.2.10
  /nix/store/qhl9f444d1ylndr8dq3f3a9r6b9z0z5y-ghc-trace-events-0.1.2.10-doc
  /nix/store/sx29pc0ishafpy0ml6s4zdqjp8i6wh94-ghcide-2.10.0.0
  /nix/store/15m68rziry2agy0v3c9qwf8pyjfg3710-ghcide-2.10.0.0-doc
  /nix/store/nn41wa9026jyks5ibss0dkwpx3fixmcy-githash-0.1.7.0
  /nix/store/xdf6kklcp6n4aysh2iy3mvqijpi32b17-githash-0.1.7.0-doc
  /nix/store/9shg7hv5fv0b2iwlxdp9m48dyh3g7bvm-gitrev-1.3.1
  /nix/store/flgqiz2vi7x12hr9pr3h7lmhyj8gdz3j-gitrev-1.3.1-doc
  /nix/store/x98g6zb2s5fph1iz08i9d8jclynjansr-haddock-library-1.11.0
  /nix/store/0xyxpqz3bzxdks43nmi9jldpj577lwh1-haddock-library-1.11.0-doc
  /nix/store/9saapzad9jxpcvag8b447k05pjir991v-hashable-1.4.7.0
  /nix/store/r96fdlf8b4yvc9f7frrvvc9rznjanww1-hashable-1.4.7.0-doc
  /nix/store/accvvhaqlfwvsgmhnjkmih7wlrxgjh4z-haskell-language-server-2.10.0.0
  /nix/store/3iacw420iq872rvsk6213f310k7gm0gx-haskell-lexer-1.1.2
  /nix/store/fiakn03f3k025ljv019kpzl4n7nr4w2i-haskell-lexer-1.1.2-doc
  /nix/store/wlk8lc6llva7lqwh3nsxhhr4c9qvlgb4-haskell-src-exts-1.23.1
  /nix/store/pp6p2inpvd1vfv3kgwlq8n7p73fngf8h-haskell-src-exts-1.23.1-doc
  /nix/store/ngd5m2syds6c6vd2rn2anv92zl3znxmd-heaps-0.4.1
  /nix/store/lzd6afjgbydkjj5x96q33w6zp7vqy1d3-heaps-0.4.1-doc
  /nix/store/mnr6szf70187dfx62d6x5jcavlz70z1w-hedgehog-1.5
  /nix/store/f6p6bx2a5z17p5fcwlpn3gffdmbx0hrl-hedgehog-1.5-doc
  /nix/store/s44wifbww8am1ynm1diggggmjhbpmxlg-hie-bios-0.14.0
  /nix/store/cj1wn0yp4vhnpgx78r3msc7hsd1wrd1h-hie-bios-0.14.0-doc
  /nix/store/34pqlmcdbg5lgv34xn2j9niqfhg3kjcn-hie-compat-0.3.1.2
  /nix/store/qmx86jz0rvmvkdjgxc85mwdf3n5gpgx5-hie-compat-0.3.1.2-doc
  /nix/store/5bn2ha5fn2wacqi7bjnbk79a9n30mmg6-hiedb-0.6.0.2
  /nix/store/1s6721rc9azld7jrgihr5j0437gzay5a-hiedb-0.6.0.2-doc
  /nix/store/52m7mxzb986a78zrmgjf1hb040lwlqi7-hlint-3.8
  /nix/store/3g6w0xd2vq4kn3q6x5j91vgi1i3n9p2g-hlint-3.8-data
  /nix/store/n0giqxpp2914lr0fyyv032n1w13zjpcw-hlint-3.8-doc
  /nix/store/ahhhvqz17f1pgza5c3j8cq13nd427i7x-hls-graph-2.10.0.0
  /nix/store/j5l3y6cbq7adxssyhjj4h8pqmksklq1z-hls-graph-2.10.0.0-data
  /nix/store/f4g58x961gpwhfaizii1dnsmiyg2n80k-hls-graph-2.10.0.0-doc
  /nix/store/6bg8v6yx5iqgrxs17dmd2pg55ynkqq98-hls-plugin-api-2.10.0.0
  /nix/store/b1s3rlg155xkdhxvfwppbwir9pf3a1k6-hls-plugin-api-2.10.0.0-doc
  /nix/store/0xfhkbmr0fnxhmsfjzjypdh96n2vny11-hls-test-utils-2.10.0.0
  /nix/store/p4z1q08x0ns667hw2g9pq7525ii4i369-hls-test-utils-2.10.0.0-doc
  /nix/store/13rj75karm6rqpdvskdahzma1nq6fvcf-hscolour-1.25
  /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25
  /nix/store/qqzydclxyz3mrs801pdh3rb2q41ygl2r-hscolour-1.25-data
  /nix/store/chl375acjx0a9cf5mdcwwgsf4ixxl9zm-hscolour-1.25-doc
  /nix/store/d5jkjvhinvmhnl2dijk4n69rwf8cqlhs-hspec-2.11.12
  /nix/store/0drp4wahmfvkh0zg7abaqk0h5d6gs3ib-hspec-2.11.12-doc
  /nix/store/lm9xiilgj7bacbd1r1mw10246qsj14kg-hspec-core-2.11.12
  /nix/store/9g4spilb34ip88ylv3jf6yx8506h2icb-hspec-core-2.11.12-doc
  /nix/store/cqjs7jkgypsamndx82x2lvg7l4jp5sbw-hspec-discover-2.11.12
  /nix/store/92isar9krqgd2gfrzlsrz061n110pw06-hspec-discover-2.11.12-doc
  /nix/store/4ja266dbllmxfz1c92s1cl2kyxjkmjlc-hspec-expectations-0.8.4
  /nix/store/3p82fjp6bhad33yjiq68n86krg0zwpg2-hspec-expectations-0.8.4-doc
  /nix/store/q3fgz13jcwb1sn0lxvavkhgrb22vw8jc-hw-fingertree-0.1.2.1
  /nix/store/6vsxz592zssh7mdafkan8srb38cviix3-hw-fingertree-0.1.2.1-doc
  /nix/store/mm0v3c0prij81wk33q1ra5jg05av0nfc-hw-prim-0.6.3.2
  /nix/store/cfz2l2gi5a31r8fmk19kljnkmgcfjmkp-hw-prim-0.6.3.2-doc
  /nix/store/yy4wbx1g6lpiasqdhwla12jxx5q5alv5-implicit-hie-0.1.4.0
  /nix/store/hdyqi67wpwp3rjf6jk59izwykq76fnps-implicit-hie-0.1.4.0-doc
  /nix/store/d71w1zn747fkna1z76hx6pl60d0y6m6k-indexed-profunctors-0.1.1.1
  /nix/store/6hrfa7kdpfxsxbxq9fwdp4pzy554vlxq-indexed-profunctors-0.1.1.1-doc
  /nix/store/yg403g15w5ksyrlzbyhhpbff5nwciwag-indexed-traversable-0.1.4
  /nix/store/g9h6m0day3r1hrgj7rnrbvanxyk6i7lh-indexed-traversable-0.1.4-doc
  /nix/store/7zws4nk0wkqfjp5c3mi0csh4bnksmc8p-indexed-traversable-instances-0.1.2
  /nix/store/vj55madwlaylp9rixk3b6slk0mx60bpn-indexed-traversable-instances-0.1.2-doc
  /nix/store/46bls9f6gnsmss41qa9dgfyy8zxagb87-inspection-testing-0.5.0.3
  /nix/store/1w46fz54l88lzr3fayidcmm1f1n39gim-inspection-testing-0.5.0.3-doc
  /nix/store/m1mck81brw39sb7p63q0b5syfzykfjrc-integer-conversion-0.1.1
  /nix/store/qnp2b581j4s4bjax7blbycqzj7vxfd4m-integer-conversion-0.1.1-doc
  /nix/store/1nnl03i6nqv79036lidf2a9qhd0bl2rf-integer-logarithms-1.0.4
  /nix/store/9dzfxpi0f8wlq4d979fcmvqgpgkn03as-integer-logarithms-1.0.4-doc
  /nix/store/lnfzq07fpj9p7n14ybkcp2bi4dqjk3xq-invariant-0.6.4
  /nix/store/41j47gjjxmsxwyx4i9v0v9irrxs8w3gs-invariant-0.6.4-doc
  /nix/store/x2nk93fi59jg4qaj3zx6p8i2m5fm33kd-jailbreak-cabal-1.4.1
  /nix/store/0k789617alx3kvr1pzjv69qdmawrn5p4-js-dgtable-0.5.2
  /nix/store/82zv2lz9fwyq6pz688qrm7jw63j9j48d-js-dgtable-0.5.2-data
  /nix/store/raa640hmy9ym4vip2wr0yplqwyj0affr-js-dgtable-0.5.2-doc
  /nix/store/37qkpv7v9kb93hrbsil1pln8q89wv6zi-js-flot-0.8.3
  /nix/store/x7r1wqaiamlyzpqmdmmvd4zd9lrw1cip-js-flot-0.8.3-data
  /nix/store/s8aia0bnpwgasd8zmbjj91sh4lq2q7sc-js-flot-0.8.3-doc
  /nix/store/w3hrz5nfi3rgwhjl02cm0fwg5n17m0cg-js-jquery-3.3.1
  /nix/store/1gygzf2q3z61y5v8kfy4il3c4pya33x9-js-jquery-3.3.1-data
  /nix/store/zqzfi6s09n6v3kxda5k21cjc30lsrllx-js-jquery-3.3.1-doc
  /nix/store/3h2kkscfjwlwrdzzgzgnjk5bvf3yqxb2-kan-extensions-5.2.6
  /nix/store/j1yxah1ywaxiaa9099544mdfv1vlpmgp-kan-extensions-5.2.6-doc
  /nix/store/13pcd315cqamav07rpdyfrfxji9v6s64-lens-5.3.4
  /nix/store/hylzksn7d0as62q3i9jz1w4zrljxyr5m-lens-5.3.4-doc
  /nix/store/iy9ma9swv83g6cm3pzfikiy4qp8lj4qs-lens-aeson-1.2.3
  /nix/store/58rplssr2bsibwh2mq2nd09aim0ai5ks-lens-aeson-1.2.3-doc
  /nix/store/9nikaiv9s6nw95ns7494vrbwn4ixd73a-libyaml-0.1.4
  /nix/store/9q985x38cfdh1l7633xfzcgk6i1g9z9s-libyaml-0.1.4-doc
  /nix/store/rpfpgxblqrpbz06sryvg5r1z14sr7x2f-libyaml-clib-0.2.5
  /nix/store/nshyh2llqc5fydy1a32ml5lpqnyr7z7h-lifted-async-0.10.2.7
  /nix/store/5brjm6vwxzvpp72wabi0027cfvlk059d-lifted-async-0.10.2.7-doc
  /nix/store/4wsbky707b4zg2n9ry8yswyvgd13dyrh-lifted-base-0.2.3.12
  /nix/store/d9kj2vv2m8pphhgffh87vmslam40ikc0-lifted-base-0.2.3.12-doc
  /nix/store/2ylzvrdqybdxmdzyhvkp79hnqnviqzcj-list-t-1.0.5.7
  /nix/store/l7v5m0cdd51yv1fxvp209wk3lgzb0fhn-list-t-1.0.5.7-doc
  /nix/store/vg7l7v338nhp74zsf2i5cimkqq4ln923-logging-facade-0.3.1
  /nix/store/4kbs2qb8cv2cfagf8nbdkisw5kdjqrfh-logging-facade-0.3.1-doc
  /nix/store/px0053nhxwcd3ay7g217rifvzxmyjxsi-logict-0.8.2.0
  /nix/store/2cd4mna9dvp8j2nc8cqinzvnghi788p5-logict-0.8.2.0-doc
  /nix/store/ikm5wq0s27f3172bhjsd7lq74ps3vqrl-lsp-2.7.0.1
  /nix/store/gp642dzmnv77b6p4kpnnssp54486vsdc-lsp-2.7.0.1-doc
  /nix/store/kg3gdvcyd52qmdn3xdz5xfw19qjmalw6-lsp-test-0.17.1.1
  /nix/store/p9222yvxyz9vwpn0s5iigm3r3r4icwck-lsp-test-0.17.1.1-doc
  /nix/store/2jrfw8q09yl3am3cf8wd39sf661ndlj9-lsp-types-2.3.0.1
  /nix/store/pb0i2x1lkwwfya03jmdvr1vsj75yzd17-lucid-2.11.20250303
  /nix/store/5ira1iahf6nps2d53j93msacq0xh4xl6-lucid-2.11.20250303-doc
  /nix/store/96nyvh869a6953q230svd18jj0yrssmz-lukko-0.1.2
  /nix/store/yyzr6klbp9j558bqnnvmdj0xzgqbp5ps-lukko-0.1.2-doc
  /nix/store/5vva9vfyv4djbzibgn8cqmbzxf70lw02-megaparsec-9.7.0
  /nix/store/5j4sb5xnixjg6hlfbbwcp3gsi55ahz3f-megaparsec-9.7.0-doc
  /nix/store/c8mb7k969d90hwnv47pbrjv4nswrvh96-microaeson-0.1.0.2
  /nix/store/nylz75r7jyvcvxsm83rhpfzyqb3hxr1k-microaeson-0.1.0.2-doc
  /nix/store/58xwhv69m4f30j3s8why5a2r1ay56niv-mmap-0.5.9
  /nix/store/rib19p0ivp6vrhqnp44s48scyswp175k-mmap-0.5.9-doc
  /nix/store/3spsgba5l1aa2zg8dn7qi4kw4ffk9gp9-mmorph-1.2.0
  /nix/store/54vvxgxbpkpyszspyqq9nx0zpk6jqp49-mmorph-1.2.0-doc
  /nix/store/2pg37qyndgfqi23h9dwmdx5pgpg2x305-mockery-0.3.5
  /nix/store/2d2jp2jdsr5mrms5lr4bzimdmqn9yks0-mockery-0.3.5-doc
  /nix/store/1b01f10fwifz7zgj6abr91qhqbaa0886-mod-0.2.0.1
  /nix/store/2wys4lcydd8hcn8z1wf0mnniy4241r5n-mod-0.2.0.1-doc
  /nix/store/rv8k0dkrks1f05mb33qpjhcbvi9il2f1-monad-control-1.0.3.1
  /nix/store/pbiqj2489grxa4dqzspr481lghy22gsv-monad-control-1.0.3.1-doc
  /nix/store/c0cnkcnx445hfnv8wlic0m6d3xqd4y9b-monad-dijkstra-0.1.1.5
  /nix/store/ra3zbf6710hyz5m85fmhr4cdkiknf7bf-monad-dijkstra-0.1.1.5-doc
  /nix/store/y8wdi7qyzsd1fj5h6gf8w8i0n336fh8v-mono-traversable-1.0.21.0
  /nix/store/vhqlgzx5pya0lam4igqdhwllcgb5klf2-mono-traversable-1.0.21.0-doc
  /nix/store/y9009gpd3kwyyy2nzagpmrhga8bs9qkb-monoid-subclasses-1.2.6
  /nix/store/gax50fhwvc74x040pwq68ccn78yajivd-monoid-subclasses-1.2.6-doc
  /nix/store/41p6gbj1r67iznaww6fhz1phnl09w4bm-neat-interpolation-0.5.1.4
  /nix/store/0wwc0hv367l8fzxzhxagfnl9m2pc8gx5-neat-interpolation-0.5.1.4-doc
  /nix/store/jyv3pcxh8hvngc7i34i9dhnz91k9qkak-network-3.2.7.0
  /nix/store/mcdy746707f3agig9chsf3zqa16vkyak-network-3.2.7.0-doc
  /nix/store/93sb7vmy446nd6l6i67sp4x6bp6j7ljq-network-uri-2.6.4.2
  /nix/store/c9776xc51dwdz6nm01aia6q5xpbkygq2-network-uri-2.6.4.2-doc
  /nix/store/1mks2q1s5lzcwndrdayx07v5w0xjvw50-newtype-generics-0.6.2
  /nix/store/kw6bxs6lcwc42f9lg1v5gdbj0k6n8nf9-newtype-generics-0.6.2-doc
  /nix/store/20kcmc3php1xniq7xd0m3wj4aagg5n0q-old-locale-1.0.0.7
  /nix/store/wclwy1yaxlr51vbcjclg2nvrv5jys84n-old-locale-1.0.0.7-doc
  /nix/store/m6z8rna5dsw2jcg309py6szv75aszpk7-old-time-1.1.0.4
  /nix/store/nn620ddf72vslnmg3fd9pyzq3grmgrw0-old-time-1.1.0.4-doc
  /nix/store/9cycg3nzpsa95vk8105bq3apmk4ka6yl-opentelemetry-0.8.0
  /nix/store/8zz057izqj5kc80ndg638f5nsfr1r6r1-opentelemetry-0.8.0-doc
  /nix/store/vsfkc3rwwp58y7x5my5qlfch9c4i2a72-optparse-applicative-0.18.1.0
  /nix/store/f5nlixzhrfpyc8c9xm0agbyv2czs39ca-optparse-applicative-0.18.1.0-doc
  /nix/store/asf97z44ia70qgidrdx0piim0vqv276f-optparse-simple-0.1.1.4
  /nix/store/br006bzxh0ji9s612nsm3a2yv1za5d5h-optparse-simple-0.1.1.4-doc
  /nix/store/f0wh5r54wsqbms8cqrg1548n53vpp9r5-ordered-containers-0.2.4
  /nix/store/nxwsczmmg3s6q9sh969g865b3rha9v6h-ordered-containers-0.2.4-doc
  /nix/store/x9l4fm23ff8h1k4h19zlqsc4ib5d8xrm-ormolu-0.7.4.0
  /nix/store/0sa3flglz0zb0jcz1v72jggjshiixp1h-ormolu-0.7.4.0-bin
  /nix/store/x7k8rwa5hvbdjf5qy8mfbr6krnq93xp2-ormolu-0.7.4.0-doc
  /nix/store/2g7p0mgagawhsmawrx6gmigx8r5lylmb-os-string-2.0.7
  /nix/store/lx2rjpnzkjdncvlh71acvwvvz48m1kxv-os-string-2.0.7-doc
  /nix/store/qbyr9a9bv5pwppk559aamwixk5zhmwkk-parallel-3.2.2.0
  /nix/store/c8ihz0bv5cgy0q2x35z69h96zkfn3209-parallel-3.2.2.0-doc
  /nix/store/inahhjp13ykq2hlqpljjvcy5j8na9j5v-parser-combinators-1.3.0
  /nix/store/h92hfjpqwvppmhqm1vwkrkc3a3c0a150-parser-combinators-1.3.0-doc
  /nix/store/g79l9v82h97dz7gri560r5a3gn0n40ja-parsers-0.12.12
  /nix/store/0yk3vppi69y2iabg0sgk6nv817q3hx62-parsers-0.12.12-doc
  /nix/store/fzc2dgaf9p42fx2nch4q9865m4bsnyra-polyparse-1.13
  /nix/store/1yr3grgiv8adqyz6y0djzfvvr6v1wh7r-polyparse-1.13-doc
  /nix/store/8hfj49l4q4gsp6jwxx10zafmzak0xw05-pretty-show-1.10
  /nix/store/3503yi45wl6mm0ncnk5n3a1gvlmsqxzx-pretty-show-1.10-data
  /nix/store/y3xg1gn900w6w7l1cs34mi5v2igyv3gs-pretty-show-1.10-doc
  /nix/store/aj3wxsaxda25lh0pfv92fqikbk2j9ln1-pretty-simple-4.1.3.0
  /nix/store/lfjs5qr7gmmkfqan5nhb0b62gyyvji1i-pretty-simple-4.1.3.0-doc
  /nix/store/y42g0cbrr0qfgdf833rfjwilz8kdaw1v-prettyprinter-1.7.1
  /nix/store/prm39wvpp5d71m786id01ygvgsaszg11-prettyprinter-1.7.1-doc
  /nix/store/3kjsykmv9gnryxc0zvj3ik7yrwq0ydbg-prettyprinter-ansi-terminal-1.1.3
  /nix/store/dmq8asby7vcycmkhfrzl10rm8jbq7p5f-prettyprinter-ansi-terminal-1.1.3-doc
  /nix/store/15zdby2idn9nyx7gnylgxqy52pvm3piv-prettyprinter-compat-ansi-wl-pprint-1.0.2
  /nix/store/5kyj95s7k5b650r6pj9ydkfrxg1cgbff-prettyprinter-compat-ansi-wl-pprint-1.0.2-doc
  /nix/store/10rs52049rf4haljgszj1l6jx8052s9m-primes-0.2.1.0
  /nix/store/0w22a65y8yg6wn4jwiz7m0zc0kpf8s3b-primes-0.2.1.0-doc
  /nix/store/bzblizfbnqmz08kq2q5s9r71z5mn5c4r-primitive-0.9.1.0
  /nix/store/np5fqv7lm09c6xs9r92nax78j8ifr7gd-primitive-0.9.1.0-doc
  /nix/store/y3g37naa01dy4ypn381inak7lz440y2v-primitive-extras-0.10.2.2
  /nix/store/56nlawhnfknjw5328da1sh6f8sa0w1jj-primitive-extras-0.10.2.2-doc
  /nix/store/vf56fmwixbddky7f3x55fx9sjzb8z1fr-primitive-unlifted-2.1.0.0
  /nix/store/r1043v0yik97pc6yvf9q4zn3s8193wx1-primitive-unlifted-2.1.0.0-doc
  /nix/store/jvfpadxcsjw0rjkxysqhy4pigidhl621-process-extras-0.7.4
  /nix/store/jxby6zhnrw3b8m8y2fqpl1963jzz3d5w-process-extras-0.7.4-doc
  /nix/store/69591cp018772bv94wxgqpakp8whgmj5-profunctors-5.6.2
  /nix/store/41jsyixah3rrc29dh8hc542vslyxywl5-profunctors-5.6.2-doc
  /nix/store/rzassp22xjch5c60yyajyhalk3wxsi68-psqueues-0.2.8.1
  /nix/store/rp02j565i50sqprw7fx5rgnh2rrvw69q-psqueues-0.2.8.1-doc
  /nix/store/nybqx0xvzv6ql77zhgjffqgm6nymwnni-quickcheck-instances-0.3.32
  /nix/store/lvav9r0hkd5580mdlwqjmaw0jgbmqs2f-quickcheck-instances-0.3.32-doc
  /nix/store/86ksydx1y83db7jpzdr7lm96aijnpa64-quickcheck-io-0.2.0
  /nix/store/hcvcp3kx8413hm9cmc18067xdykn9855-quickcheck-io-0.2.0-doc
  /nix/store/fd49rmwxx3wha0x3lvzjam0amfq3dviw-random-1.2.1.3
  /nix/store/q05bh1vzg01s0xk67y19hga076aqd321-random-1.2.1.3-doc
  /nix/store/2izq449xrjg026vdiqvcl6irarnnm5d0-random-shuffle-0.0.4
  /nix/store/gjqlvzxrp4qcvrann713jnb207yily5j-random-shuffle-0.0.4-doc
  /nix/store/9mnh20gmm89ip42wxacdgm0z05c8379z-refact-0.3.0.2
  /nix/store/4hk3f0hy1alxpa65dpq7cx1qh9drxklk-refact-0.3.0.2-doc
  /nix/store/scqa9mf0q4il4nifxqr5iqqvi4cy6bxb-reflection-2.1.9
  /nix/store/gqm0zz36q6i3cvcmyk4x469cpfyccqq1-reflection-2.1.9-doc
  /nix/store/yg0wzy6r9aqfijnvwnj8v8ni6fhz9mgx-regex-1.1.0.2
  /nix/store/hhhdc57wxsxkfagnxr0xnyrcbd94xqyv-regex-1.1.0.2-doc
  /nix/store/52xmvw12jkprl8prcq9r9lmfxhlfnaz3-regex-applicative-0.3.4
  /nix/store/yhwls2brr71infvs2ajlfzd84na1cq9h-regex-applicative-0.3.4-doc
  /nix/store/h0s7yrx8wkhlp280j9sy7yh2zwmb6xvk-regex-base-0.94.0.3
  /nix/store/k7d7w9d0iv3qwancinm51awr1lcqxcyh-regex-base-0.94.0.3-doc
  /nix/store/kf16zz3xhmlrf2i22piqbcj1jyx73jpi-regex-pcre-builtin-0.95.2.3.8.44
  /nix/store/l4zjz3y9yx8xplrk4zw934ffb70sm4r5-regex-pcre-builtin-0.95.2.3.8.44-doc
  /nix/store/fgzc2z6d3dkkidpqx30qb35s9hvzzwcb-regex-tdfa-1.3.2.3
  /nix/store/wna0zk2jlkqhjdy73dljc1bx4n14nsj9-regex-tdfa-1.3.2.3-doc
  /nix/store/yss0cv2abl7iwgqliqv4ixsw8ghk40lk-relude-1.2.2.0
  /nix/store/cz9y4dpk09f68zdm4fpklwhflxr1i710-relude-1.2.2.0-doc
  /nix/store/anngnqci3b293h2rr4rbikr5ap8jwm6r-resourcet-1.3.0
  /nix/store/n9yqfig2m7sm650127nmdk25h8rvz3hw-resourcet-1.3.0-doc
  /nix/store/nggadzfc18lkmm7fkz48411jmvjgn5jh-retrie-1.2.3
  /nix/store/rp0b7qijw37xh1y59jjqcg65171ksc2z-retrie-1.2.3-doc
  /nix/store/vsyfdhw40x6ikcnx3z3zspyq1gwji8f4-row-types-1.0.1.2
  /nix/store/fg0qv4ja4zbpx3p33gcchy94lf36avf0-row-types-1.0.1.2-doc
  /nix/store/v98gv88w4iadhdnxdrlsk48bawag5jr0-safe-0.3.21
  /nix/store/3vhxhbc58wjggimyxfzz755q9pqqzyd1-safe-0.3.21-doc
  /nix/store/358g1pjwcbi9xsd3kxxnhi2q7q3jbrrj-safe-exceptions-0.1.7.4
  /nix/store/yndcxi2vdrybsgs8m0gbzjlnydrf9h68-safe-exceptions-0.1.7.4-doc
  /nix/store/930fhvx7x5qk37r48a5gw5wk9lbqhn1y-scientific-0.3.8.0
  /nix/store/jiylg8qhj4328qg1pn5pkdh1cc1lanj8-scientific-0.3.8.0-doc
  /nix/store/9yilb5wcg0xx0cnsykkak5b56r3f2phy-selective-0.7.0.1
  /nix/store/wznblq88pyb7q7dj929sc59dvcpizgms-selective-0.7.0.1-doc
  /nix/store/gffsqiffax08vf9mrp44v542kbdfml8i-semialign-1.3.1
  /nix/store/3c7ikvmkh22xlr4mc7xrvi3ixgzxl1g7-semialign-1.3.1-doc
  /nix/store/msbfary87qrzvfy535a0xb9bwi269qds-semigroupoids-6.0.1
  /nix/store/v7pw2ji5jksaf25qgx65inclrxxnvs4m-semigroupoids-6.0.1-doc
  /nix/store/7glpzg93h2y86ff7vgnl584dnfyh3idl-semigroups-0.20
  /nix/store/q162vdm3yx1zcpn1xwkww8s6d7z4bxzk-semigroups-0.20-doc
  /nix/store/7pcfdhxawawdmbkvhp6j75fwd7bp1kib-semirings-0.7
  /nix/store/f1a61hxm1a73dqw0m7c6nhspzbrm6dn7-semirings-0.7-doc
  /nix/store/k0my1b4nz9p3gdww2jj5h1xjycbi87w4-shake-0.19.8
  /nix/store/73x2vwydr86m5104f0q6l35c0nx80nm6-shake-0.19.8-data
  /nix/store/wbp8s7kp5y4jx5vdlg1ssjsgq3qqbmcq-shake-0.19.8-doc
  /nix/store/d51zqccfj2f3ymnlbqqxg460yhr388dq-silently-1.2.5.4
  /nix/store/0v9k3y2g473zz56cf26116faznl6w9vz-silently-1.2.5.4-doc
  /nix/store/dvdl4gwacy37gxykff2bm0bqy4nbhby2-slist-0.2.1.0
  /nix/store/zk9zfv1gy3b6d8jv819m2yhw1lcflj0j-slist-0.2.1.0-doc
  /nix/store/lxfnx7y8wxxg36ipg8lgm3806lx84acf-some-1.0.6
  /nix/store/bjd32ns1nqs9dbwrxx6sa5c2wzkhk10m-some-1.0.6-doc
  /nix/store/ff4zydiyv4qbwish0rv79q8n4xiw111d-sorted-list-0.2.3.1
  /nix/store/084dzahzinrf90kxq25xl4b3nkr1pzmz-sorted-list-0.2.3.1-doc
  /nix/store/dd45grxnnr2y6247wmidyw1m3bc9vly6-split-0.2.5
  /nix/store/j0zha53pg9yyzcvnlp1f6wjlizb2jykv-split-0.2.5-doc
  /nix/store/si0fbklc2x6qv458pf79v35mrj517r69-splitmix-0.1.1
  /nix/store/mc93fpsygihpd3nc1xvy6m0939r7dcvr-splitmix-0.1.1-doc
  /nix/store/q8rkxxk3nfw3gpbfsyw60jwn4ndl3sha-sqlite-simple-0.4.19.0
  /nix/store/5lfya44a2k5c7jfjq2c9d17p15rx14qz-sqlite-simple-0.4.19.0-doc
  /nix/store/xdxjj6krbi8wdcj3fy7an1x6pywkxih4-stan-0.2.0.0
  /nix/store/q1wljd0wmv4b9426mmn1psxf0gi9j26m-stm-containers-1.2.1.1
  /nix/store/799c01s2bfg37myxn8c9kq5cnm6b4sin-stm-containers-1.2.1.1-doc
  /nix/store/6s6qbr6nnzlfd0004vk0iivnjp9yn6y3-stm-hamt-1.2.1.1
  /nix/store/r8xykd6hspcqr3xa965rsfj4cvppds9p-stm-hamt-1.2.1.1-doc
  /nix/store/839dqk3i5b3k9jml53f5a7gniqkr8znq-streaming-commons-0.2.3.0
  /nix/store/xa2g73y2smzhf0i585cs31lv90lnndmj-streaming-commons-0.2.3.0-doc
  /nix/store/pj8ykq44wm9kwl2qiillrhdczcfivwyb-strict-0.5.1
  /nix/store/yn78sy207wsdxcwxv6v2kqpfi6kmi3wa-strict-0.5.1-doc
  /nix/store/m33jk984zqc31v9pdshkcjyxahab7zvv-stringbuilder-0.5.1
  /nix/store/4wx8m9kibh5ybkam06pxkgw742fhhx6x-stringbuilder-0.5.1-doc
  /nix/store/09abq6p995ykpnkq67a0rpyv2zsi0b1d-stylish-haskell-0.14.6.0
  /nix/store/4x6d265ac51ij40hfh6szgpphw45c163-stylish-haskell-0.14.6.0-doc
  /nix/store/nngkdk9h57zp286pmaafp1winmb89glx-syb-0.7.2.4
  /nix/store/wamh6zlvwdr4nbskaw6biajpz05677dn-syb-0.7.2.4-doc
  /nix/store/64vq09zv1v1wvqg7aixllflkib1xvcxi-tagged-0.8.8
  /nix/store/k2kp9hrw5jbf6g9376r3qldnr0i9rkg4-tagged-0.8.8-doc
  /nix/store/b9naagvs1vyrmmqxi2hzlbwq1nkja074-tar-0.6.3.0
  /nix/store/xnyna8l1aw5vmm80znvqw8sihc72451b-tasty-1.5.3
  /nix/store/wp6q7kpx1w01h054wkdjblksbw4phqh9-tasty-1.5.3-doc
  /nix/store/84qx55m2l842j1kw8f5rvq0igw1mmfda-tasty-expected-failure-0.12.3
  /nix/store/i2cjrd8jm7rpgm2ngvp9r55y81jv7c44-tasty-expected-failure-0.12.3-doc
  /nix/store/gid9j5rd5k4ncsv7d695xwd7n64cav8r-tasty-golden-2.3.5
  /nix/store/1733632jz61n97f3173h6bnxn8s58yg7-tasty-golden-2.3.5-doc
  /nix/store/kcafj0mnmash1pssc9mfz06657nwgyhf-tasty-hedgehog-1.4.0.2
  /nix/store/p3vhrvzxyrji3y66p6ybcz36d2qhlb7v-tasty-hedgehog-1.4.0.2-doc
  /nix/store/4p5gwzmclh5l1ssbf8c8bwrr57kr9qfk-tasty-hunit-0.10.2
  /nix/store/fdw1wrmcjfnl2vsqcdkgxcgq5zsj2qqy-tasty-hunit-0.10.2-doc
  /nix/store/7hy79z6vd3n5d5dsw9bbxjfqmwrf03nx-tasty-inspection-testing-0.2.1
  /nix/store/jlawm4cchxhlyl2vq6adi70dnbv58dpr-tasty-inspection-testing-0.2.1-doc
  /nix/store/k7bgrwljsgzppwn0z54ylmfkfwixfi9p-tasty-quickcheck-0.11
  /nix/store/pb18bn51c0scn9s5az9gnnjjpqa7bpgh-tasty-quickcheck-0.11-doc
  /nix/store/f26rf4vfa78xmk0zsw3lga49ghlxssqv-tasty-rerun-1.1.20
  /nix/store/0m8xiws30x8ysjrndyf5qb9gz5k37pda-tasty-rerun-1.1.20-doc
  /nix/store/s2yad4gfa0wssw7baps8njnfq41va7vx-temporary-1.3
  /nix/store/zvy1mly978h3c47141185lckxy577xb1-temporary-1.3-doc
  /nix/store/2dg9fi4dapgbjym0kjvps8k8cnq1nfaw-terminal-size-0.3.4
  /nix/store/ba971plmdq9pzw5y4j4wmm19mqrgm87f-terminal-size-0.3.4-doc
  /nix/store/yns2bp9ph72cbpkc8jqqf3cmiqwknqg2-text-iso8601-0.1.1
  /nix/store/h0qabvran88qmba3s615qlkf5bp091n6-text-iso8601-0.1.1-doc
  /nix/store/9qxdh25gfxxm08nd2biq5qil2rdw3ifb-text-rope-0.2
  /nix/store/rm3z850js0zzmxby18ymw2gad6k2wymp-text-rope-0.2-data
  /nix/store/85a31pflg1zb00xp8sp955h9chdfg1yy-text-rope-0.2-doc
  /nix/store/7blgw29lmg07sri2934ia4g71rra6r7s-text-short-0.1.6
  /nix/store/a8nxm4i230amskbpq2vqmzxf7rcqi076-text-short-0.1.6-doc
  /nix/store/zrnrfdk71nisamll0h1g8ppq43fbm3jk-tf-random-0.5
  /nix/store/q70i1prf1bmkkbivyirv46chkm1492kd-tf-random-0.5-doc
  /nix/store/7cawa9h7as0d1z9rhwcvd4kg23qiikzx-th-abstraction-0.7.1.0
  /nix/store/pw2rm1axx8glvfjffldch09v867kp2b9-th-abstraction-0.7.1.0-doc
  /nix/store/4yx9489rjmy6gg4sqxpmbfkarnklfccg-th-compat-0.1.6
  /nix/store/kfd6lp109n56wgks0f7ydm06sssfw824-th-compat-0.1.6-doc
  /nix/store/aw5la0g1ma3lljcgc3491qgbxzg5krdv-th-env-0.1.1
  /nix/store/4884wvmmvgk8p158ijfhgsjsgbqkq7dx-th-env-0.1.1-doc
  /nix/store/ysfymf9y565zfqh5mnlpbhmc0mzcnksa-these-1.2.1
  /nix/store/nxw6h0vgy1vmd3pg1hdbm04y0jpzady8-these-1.2.1-doc
  /nix/store/71gbrb2jd79gyn2c8128k0sfkswfjmzm-time-compat-1.9.7
  /nix/store/rsmll3a5cawblg8nw1xrcpmk71y8s6jc-time-compat-1.9.7-doc
  /nix/store/vg0b7qkf4013vgf2mzaadlnlqxrhsw1a-time-locale-compat-0.1.1.5
  /nix/store/fia23lf0hm023fx0rjdnvv0wb73g9g3b-time-locale-compat-0.1.1.5-doc
  /nix/store/kbq498q091ialznflr45s3ick1nbd0ki-tomland-1.3.3.3
  /nix/store/qi27qwc29i3gr8a0qrlw04jmxlgkpjcv-tomland-1.3.3.3-doc
  /nix/store/1409cg04vadnh2zwm2zixdsqia12rbr5-transformers-base-0.4.6
  /nix/store/mllqgs3hm3km5hi9qclax7d3p1nd488p-transformers-base-0.4.6-doc
  /nix/store/k65nixclvpfan7ycg778l80grjmqdrmp-transformers-compat-0.7.2
  /nix/store/59mi65rx4q3mdzh8sm3308camydrmj37-transformers-compat-0.7.2-doc
  /nix/store/31xpiix1byzn4b61lcr8dgr0h9gfyyz1-trial-0.0.0.0
  /nix/store/2rhiksczv2jsd0zc1skdjcrmwblw3kp1-trial-0.0.0.0-doc
  /nix/store/q0x6fxb5qiv808sc7lja6xxxhlkmjn5n-trial-optparse-applicative-0.0.0.0
  /nix/store/8z3r70a2ylxp35ngmhqrbhp2zgayy5yj-trial-optparse-applicative-0.0.0.0-doc
  /nix/store/sv2xyrpkjh8d7cvyf88s8qdjwhv747lm-trial-tomland-0.0.0.0
  /nix/store/dyf4ylizzzdhqqyljc4vlcs47ijnymsk-trial-tomland-0.0.0.0-doc
  /nix/store/fisj2k9g9ca36qxv0jszjyn9dlqxgh8h-typed-process-0.2.13.0
  /nix/store/lv4bnria5rrd8q7hvvv3m65gazsw6bj5-typed-process-0.2.13.0-doc
  /nix/store/05amxljwzzjmk7005w7z3imapjccakci-unbounded-delays-0.1.1.1
  /nix/store/z18qjyh0vn0pl9hzrlw2qjqqnf2a877i-unbounded-delays-0.1.1.1-doc
  /nix/store/milz4rrxcdndkp1xkb2zp8gps4ka13ga-uniplate-1.6.13
  /nix/store/vc9hsxz05s9pczn3dbpgjv14bjwc0q70-uniplate-1.6.13-doc
  /nix/store/kswcxi2gmxl7vglnpkid84xpwzdnihsi-unix-compat-0.7.4
  /nix/store/ndazfmsp62xsf1gjd4wbf8n11zf81cdy-unix-compat-0.7.4-doc
  /nix/store/qrizwdap9gfrp84wryxnvbrmjqljh2gs-unliftio-0.2.25.1
  /nix/store/x6cg2qf6975458w7mmb7i1lrmiziqh7x-unliftio-0.2.25.1-doc
  /nix/store/dgfiq4pnvyqaclyi71nz5b1liz88gc1r-unliftio-core-0.2.1.0
  /nix/store/jbwhb7q7kb5m4chx26acp8b295rbvp40-unliftio-core-0.2.1.0-doc
  /nix/store/9502j1yrcr37x46fbgrz0s7whq5mh9bk-unordered-containers-0.2.20
  /nix/store/pl89jq90v9ydisbxgn15fxy429f1q2kv-unordered-containers-0.2.20-doc
  /nix/store/frxfhjlp9zgi4vaylqfkspl000njgdhd-utf8-string-1.0.2
  /nix/store/3lfdn4b64alii2a83cp79rawkmgbh9jy-utf8-string-1.0.2-doc
  /nix/store/3zwrvza13frmjx4162bksx97kqljzdsq-uuid-types-1.0.6
  /nix/store/y0w8fmzc1sikglb78y1j49fwpxmdzjv0-uuid-types-1.0.6-doc
  /nix/store/1jlpd8h4p42fjl0x6v2w8whq7zf6clcc-validation-selective-0.2.0.0
  /nix/store/zj206s8k36p4m8ssw3hknx7xzl6szv7y-validation-selective-0.2.0.0-doc
  /nix/store/3yjannn2s9fvsqfagpxn1xyg0ygb80ip-vector-0.13.2.0
  /nix/store/ijnywb5xa7lc07pb1vd7r2xkyajpkwap-vector-algorithms-0.9.1.0
  /nix/store/xjwj8z9mg2ma2dr1lkmsxh3fl3rr1kdq-vector-algorithms-0.9.1.0-doc
  /nix/store/xvdkjlylkcr0jaxhjh0p5g38ia331d8j-vector-binary-instances-0.2.5.2
  /nix/store/bq6azvsang9yx15jn1i4b8apibvm0gyc-vector-binary-instances-0.2.5.2-doc
  /nix/store/573bnyii92qjsp4qsgv4h1yrbpr4cr1x-vector-stream-0.1.0.1
  /nix/store/hamvgmagri0aphlc50lkjis1q46qi19r-vector-stream-0.1.0.1-doc
  /nix/store/kig3gfc89b25ijk30d0d86aaph4mgxmp-void-0.7.3
  /nix/store/0r0ma0iyln55sxrqr7rn5j7l4jfs2hiv-void-0.7.3-doc
  /nix/store/3v8r2mxz1ilbhy6c64qwzh585g4nr0nx-wherefrom-compat-0.1.1.1
  /nix/store/wiinarfxkp48inhbvmyjvy4m05bg4l8j-wherefrom-compat-0.1.1.1-doc
  /nix/store/apm6vba2nsbdnf3z0ppwk4lz5idiyn0y-witherable-0.5
  /nix/store/fvamn3czr01vr8lipxzsr37086dy19sr-witherable-0.5-doc
  /nix/store/grygy90rwvpc8vf2mdn4i9fs8jiy1ya1-wl-pprint-annotated-0.1.0.1
  /nix/store/1155yikdfh1piiyyhvqj142j91zzqwgk-wl-pprint-annotated-0.1.0.1-doc
  /nix/store/ha48cn9rvx020w7dgqkyc9b4w3zichmm-yaml-0.11.11.2
  /nix/store/ky9nc32j37xg5pgsgi310x7lkxd9gavj-yaml-0.11.11.2-doc
  /nix/store/3gh3lpmrlnigwdw5ird6xqgmahpns419-zlib-0.7.1.0
  /nix/store/xzm2mbq1ws13ybhzw0qgdm9dp2775j35-zlib-0.7.1.0-doc
copying path '/nix/store/3d0wy5p9m1b54dqgypbs3vf7pyp7pkr7-colour-2.3.6-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/i354kjrag7k8z7hzby419xrx2q079klp-floskell-0.11.1-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ky8gc60x86vv5hy117985srsplmbwzaw-ghc-lib-parser-9.8.5.20250214-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3g6w0xd2vq4kn3q6x5j91vgi1i3n9p2g-hlint-3.8-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/j5l3y6cbq7adxssyhjj4h8pqmksklq1z-hls-graph-2.10.0.0-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qqzydclxyz3mrs801pdh3rb2q41ygl2r-hscolour-1.25-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/82zv2lz9fwyq6pz688qrm7jw63j9j48d-js-dgtable-0.5.2-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/x7r1wqaiamlyzpqmdmmvd4zd9lrw1cip-js-flot-0.8.3-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1gygzf2q3z61y5v8kfy4il3c4pya33x9-js-jquery-3.3.1-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/73x2vwydr86m5104f0q6l35c0nx80nm6-shake-0.19.8-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rm3z850js0zzmxby18ymw2gad6k2wymp-text-rope-0.2-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rpfpgxblqrpbz06sryvg5r1z14sr7x2f-libyaml-clib-0.2.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rmkj1va9yf7knzjrxpmymycbhh3jzxbw-fail-4.9.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9n6znhba74nhkv9fyjipv7pw6sjbshs3-ghc-9.8.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3503yi45wl6mm0ncnk5n3a1gvlmsqxzx-pretty-show-1.10-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0sa3flglz0zb0jcz1v72jggjshiixp1h-ormolu-0.7.4.0-bin' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zl5wibaqbz9wd005h7zjf436bx2044y6-alex-3.5.3.0-data' from 'https://cache.nix-ci.com'...
copying path '/nix/store/x2nk93fi59jg4qaj3zx6p8i2m5fm33kd-jailbreak-cabal-1.4.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25' from 'https://cache.nix-ci.com'...
copying path '/nix/store/whdwmjaiqdrd3y3pms6a2p80i6ai01yi-alex-3.5.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1ql42c2mg8rgkwk0ckyil3n2143j0mnr-Diff-0.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xia6lcjp10i2i6a6i6n3rs9c1vf8q5gr-OneTuple-0.4.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/m8b7fl9h7vxc5plspy33wvw4i752lvw5-Only-0.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pl6qqi9k5ki0iv1v8drq0iijjsilpq3q-StateVar-1.2.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dsriaxx4r9671nyfqjd8vhwbg0i8z7ld-HsYAML-0.2.1.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0idwg26gnmhp8vf1k4930xvwbnplwzsc-algebraic-graphs-0.7-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/w0zkvyk8vhb9gfv9fpm2clfmmxnm66m2-base16-bytestring-1.0.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/smbg5s9ac0phpz3d39i5b07lmnsbix5w-assoc-1.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/j8vggajz8bs3sgkwdn99079fvvqdbl6w-base-compat-0.13.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pf89rjhp9s4ahv6fhwjpdhw11nz4kh5l-binary-orphans-1.0.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hdk32fkar7p46pvyz9ala9602ah7bm1a-blaze-builder-0.4.2.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/l92zbxx9ldnyrfki5ggdbxsszla4jvcr-base-orphans-0.9.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/78mzhjjarncpmf0i778x7a9zmsw8y4cc-cabal-add-0.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/np72w3c0v1sjs1mxivrlpymds7z1qqal-call-stack-0.4.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/blqgy45h759lyaw2byas6kgj75ijlbar-character-ps-0.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/p5hv3is7zr38w16r6gaydv06jj12saz9-cereal-0.5.8.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/707n9xvfhdizfi8154viz145v8ly4qsc-clay-0.15.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/h10s79qr69gnfmsrrw8mdshdfiyh254s-clock-0.8.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/sgs55m0wk08q8iwq89d033583vswfrhl-co-log-core-0.3.2.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zimd14kamvqhlsfma8irfks6bib0kmad-cmdargs-0.10.22-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/62ipmfvi5faijhkxmg86b8p35s98m6rz-code-page-0.2.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4w95w4s290mg19433arsdddrw8isg16z-colour-2.3.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gpd67jvqyx61r92yc4yfknwaimbgpfrm-commutative-semigroups-0.2.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/v4rz81s2dwfzvgxw2xmmrg8a5pkvh5ni-contravariant-1.5.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/14q9xwdzlngm40420snava2z822zjsz1-HUnit-1.6.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/mxcgn6jqz79f9jxcr5v5gx5asnfsacxf-cryptohash-sha1-0.11.101.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cfi2a8xvv22a7mj9gz9839hi9ijncl8k-cryptohash-sha256-0.11.102.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6rjjzjmv2mdz44fzw8qk94vpcnph8pl2-blaze-markup-0.8.3.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8h5snzjjm762317azvsk81llxkll05sv-blaze-textual-0.2.3.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4sxbgbwixfg0rgbxga443scqy633hjc2-data-default-class-0.1.2.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6r2d99lndlbiji51yg5ph4klzrnghv5i-dir-traverse-0.2.3.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pki5096qkgpvqqv5wl4mq94fzm56kby7-direct-sqlite-2.3.29-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nx1kyizqb6p5kxr1c8508ffl4p0v09y0-dlist-1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yrq8pwjwfr980hl39vhfb844zsx82f1g-erf-2.0.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/s9ydrpd0vf15lal2nwg179gy1bxv7dpz-extensions-0.1.0.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wdla2kl3nfwsn2qlcmsvfdx5sschf6r5-extra-1.7.16-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0i2vkgasifhidl26y3hqsrdkmdwv7wg7-file-embed-0.0.16.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9jkk7cpyhdlrnksk8rk8w25hzhya6akp-filtrable-0.1.6.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/n502y0rkxqwr4v1712fpbf1qlzvmxipf-fingertree-0.1.5.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gsdlmrrpv3lvb2j44b01m136sh7ndnc2-fmlist-0.9.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/53b31hbz191slz6rv9nzcbk3v8l54mp2-blaze-html-0.9.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/am5gv87dj5g43bwghgsp1hd32gibna14-ansi-terminal-types-1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/h9n07rnm7m933593fk7msyln31iggndh-data-default-instances-containers-0.1.0.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/aqnzsx58l85399gq908w080r9jqmka61-focus-1.0.3.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xs1yq6zcvzq0xxxi28p002n5ync7z1aa-Glob-0.10.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qrpymlbzj07k6hpf4il6wv6p6yn8fqgl-data-default-instances-dlist-0.0.1.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/aarv4jl074q5in6l8vd4i5az0gn3xsyx-generically-0.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4ha8aihi2jmwfpd4fzvf05ds1as1ax3a-ghc-lib-parser-9.8.5.20250214-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/sik3albbr8j35wakjg2xn25hl947np1b-ghc-paths-0.1.0.12-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qhl9f444d1ylndr8dq3f3a9r6b9z0z5y-ghc-trace-events-0.1.2.10-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/flgqiz2vi7x12hr9pr3h7lmhyj8gdz3j-gitrev-1.3.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0xyxpqz3bzxdks43nmi9jldpj577lwh1-haddock-library-1.11.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fiakn03f3k025ljv019kpzl4n7nr4w2i-haskell-lexer-1.1.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/67v8zp8y2cnbglih2d8vip1vw31i2757-ansi-terminal-1.1.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pp6p2inpvd1vfv3kgwlq8n7p73fngf8h-haskell-src-exts-1.23.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lzd6afjgbydkjj5x96q33w6zp7vqy1d3-heaps-0.4.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qmx86jz0rvmvkdjgxc85mwdf3n5gpgx5-hie-compat-0.3.1.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/chl375acjx0a9cf5mdcwwgsf4ixxl9zm-hscolour-1.25-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/92isar9krqgd2gfrzlsrz061n110pw06-hspec-discover-2.11.12-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3p82fjp6bhad33yjiq68n86krg0zwpg2-hspec-expectations-0.8.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6hrfa7kdpfxsxbxq9fwdp4pzy554vlxq-indexed-profunctors-0.1.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pa5c795v8pfs7c31rs4xhrzpr87329jq-filepattern-0.1.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/g9h6m0day3r1hrgj7rnrbvanxyk6i7lh-indexed-traversable-0.1.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1w46fz54l88lzr3fayidcmm1f1n39gim-inspection-testing-0.5.0.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9dzfxpi0f8wlq4d979fcmvqgpgkn03as-integer-logarithms-1.0.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/raa640hmy9ym4vip2wr0yplqwyj0affr-js-dgtable-0.5.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/w3ypcimh0kcfjj209qsk1hmhw5qigcxw-colourista-0.1.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/s8aia0bnpwgasd8zmbjj91sh4lq2q7sc-js-flot-0.8.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zqzfi6s09n6v3kxda5k21cjc30lsrllx-js-jquery-3.3.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4kbs2qb8cv2cfagf8nbdkisw5kdjqrfh-logging-facade-0.3.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2cd4mna9dvp8j2nc8cqinzvnghi788p5-logict-0.8.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yyzr6klbp9j558bqnnvmdj0xzgqbp5ps-lukko-0.1.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nylz75r7jyvcvxsm83rhpfzyqb3hxr1k-microaeson-0.1.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rib19p0ivp6vrhqnp44s48scyswp175k-mmap-0.5.9-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/67181bixvm97345flcpx7y4zkvvcyw1x-generic-lens-core-2.2.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/54vvxgxbpkpyszspyqq9nx0zpk6jqp49-mmorph-1.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/mcdy746707f3agig9chsf3zqa16vkyak-network-3.2.7.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/kw6bxs6lcwc42f9lg1v5gdbj0k6n8nf9-newtype-generics-0.6.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wclwy1yaxlr51vbcjclg2nvrv5jys84n-old-locale-1.0.0.7-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lx2rjpnzkjdncvlh71acvwvvz48m1kxv-os-string-2.0.7-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/c8ihz0bv5cgy0q2x35z69h96zkfn3209-parallel-3.2.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/h92hfjpqwvppmhqm1vwkrkc3a3c0a150-parser-combinators-1.3.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1yr3grgiv8adqyz6y0djzfvvr6v1wh7r-polyparse-1.13-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/y3xg1gn900w6w7l1cs34mi5v2igyv3gs-pretty-show-1.10-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/prm39wvpp5d71m786id01ygvgsaszg11-prettyprinter-1.7.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0w22a65y8yg6wn4jwiz7m0zc0kpf8s3b-primes-0.2.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/np5fqv7lm09c6xs9r92nax78j8ifr7gd-primitive-0.9.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4hk3f0hy1alxpa65dpq7cx1qh9drxklk-refact-0.3.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gqm0zz36q6i3cvcmyk4x469cpfyccqq1-reflection-2.1.9-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hj44n3l526vh1sh33q4qwaixdhn9wzvk-data-default-instances-old-locale-0.0.1.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ipafyk50vi2wm01yrisza0vn1l5cgdbv-MemoTrie-0.6.11-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nn620ddf72vslnmg3fd9pyzq3grmgrw0-old-time-1.1.0.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yhwls2brr71infvs2ajlfzd84na1cq9h-regex-applicative-0.3.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/k7d7w9d0iv3qwancinm51awr1lcqxcyh-regex-base-0.94.0.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gax50fhwvc74x040pwq68ccn78yajivd-monoid-subclasses-1.2.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/w07ky81y25ramhb1krbl69286f8n6baq-data-default-0.7.1.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3vhxhbc58wjggimyxfzz755q9pqqzyd1-safe-0.3.21-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/r96fdlf8b4yvc9f7frrvvc9rznjanww1-hashable-1.4.7.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yndcxi2vdrybsgs8m0gbzjlnydrf9h68-safe-exceptions-0.1.7.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wznblq88pyb7q7dj929sc59dvcpizgms-selective-0.7.0.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/q162vdm3yx1zcpn1xwkww8s6d7z4bxzk-semigroups-0.20-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nh9b44sjwyilblpbg9kcidcgl19yzr2r-cpphs-1.20.9.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0v9k3y2g473zz56cf26116faznl6w9vz-silently-1.2.5.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zk9zfv1gy3b6d8jv819m2yhw1lcflj0j-slist-0.2.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dmq8asby7vcycmkhfrzl10rm8jbq7p5f-prettyprinter-ansi-terminal-1.1.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/bjd32ns1nqs9dbwrxx6sa5c2wzkhk10m-some-1.0.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/l4zjz3y9yx8xplrk4zw934ffb70sm4r5-regex-pcre-builtin-0.95.2.3.8.44-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wna0zk2jlkqhjdy73dljc1bx4n14nsj9-regex-tdfa-1.3.2.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/084dzahzinrf90kxq25xl4b3nkr1pzmz-sorted-list-0.2.3.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/j0zha53pg9yyzcvnlp1f6wjlizb2jykv-split-0.2.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/mc93fpsygihpd3nc1xvy6m0939r7dcvr-splitmix-0.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qnp2b581j4s4bjax7blbycqzj7vxfd4m-integer-conversion-0.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/sy1j5crsqw8sirywiis72cckw7n68m44-async-2.2.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hpnh169cvr6silp91rk2hbvbqzspfhi0-case-insensitive-1.2.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ygza57c9mpmp7y7pnwglcp4z94jfrnfz-data-fix-0.3.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5ira1iahf6nps2d53j93msacq0xh4xl6-lucid-2.11.20250303-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8zz057izqj5kc80ndg638f5nsfr1r6r1-opentelemetry-0.8.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/f5nlixzhrfpyc8c9xm0agbyv2czs39ca-optparse-applicative-0.18.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nxwsczmmg3s6q9sh969g865b3rha9v6h-ordered-containers-0.2.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lfjs5qr7gmmkfqan5nhb0b62gyyvji1i-pretty-simple-4.1.3.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5kyj95s7k5b650r6pj9ydkfrxg1cgbff-prettyprinter-compat-ansi-wl-pprint-1.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rp02j565i50sqprw7fx5rgnh2rrvw69q-psqueues-0.2.8.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/q05bh1vzg01s0xk67y19hga076aqd321-random-1.2.1.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jiylg8qhj4328qg1pn5pkdh1cc1lanj8-scientific-0.3.8.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5lfya44a2k5c7jfjq2c9d17p15rx14qz-sqlite-simple-0.4.19.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4wx8m9kibh5ybkam06pxkgw742fhhx6x-stringbuilder-0.5.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8pa9jwqiikixffmpj5wc044c9mj1j9yw-fuzzy-0.1.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wamh6zlvwdr4nbskaw6biajpz05677dn-syb-0.7.2.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/k2kp9hrw5jbf6g9376r3qldnr0i9rkg4-tagged-0.8.8-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/k14h73fvfpya997cwkxvy1d04p8r5gxk-ansi-wl-pprint-1.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ba971plmdq9pzw5y4j4wmm19mqrgm87f-terminal-size-0.3.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/85a31pflg1zb00xp8sp955h9chdfg1yy-text-rope-0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/a8nxm4i230amskbpq2vqmzxf7rcqi076-text-short-0.1.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pw2rm1axx8glvfjffldch09v867kp2b9-th-abstraction-0.7.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/kfd6lp109n56wgks0f7ydm06sssfw824-th-compat-0.1.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nxw6h0vgy1vmd3pg1hdbm04y0jpzady8-these-1.2.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5j4sb5xnixjg6hlfbbwcp3gsi55ahz3f-megaparsec-9.7.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rsmll3a5cawblg8nw1xrcpmk71y8s6jc-time-compat-1.9.7-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zbi6jnp538zd0iqrh6rvb6fgv83b2p8m-MonadRandom-0.6.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7k14i8qz0802ahiin9pqd7jkr9vpw90x-QuickCheck-2.14.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2bf1blfz4hliwnl311i5yvgdaih1jn7a-boring-0.2.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/c9j8hmsl2whg742803gw85rdjddrz3ms-distributive-0.6.2.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wp6q7kpx1w01h054wkdjblksbw4phqh9-tasty-1.5.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zvy1mly978h3c47141185lckxy577xb1-temporary-1.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hz8fzmwmbbcnqba2j5liv43vcpkp5va3-concurrent-output-1.10.21-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/69qp4xa4m3q6x6aga34aa3i21acnivlq-ghc-exactprint-1.8.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xdf6kklcp6n4aysh2iy3mvqijpi32b17-githash-0.1.7.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1s6721rc9azld7jrgihr5j0437gzay5a-hiedb-0.6.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jk2w5dy1pw0f5m25l1wg11lnj2q51y2r-base64-1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/c9776xc51dwdz6nm01aia6q5xpbkygq2-network-uri-2.6.4.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rx3nydsrpj0gyzk8khvj7sxkrcb9z50l-barbies-2.1.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/97rx3ms11dqx69nib1idmd4xq9sfa9px-comonad-5.0.9-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6hd0arkkjd0zrm43cfflqd93wm8p3grd-constraints-0.14.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yybip4y0slxc9zpbx5i8f5nfmd5ljz1q-generic-deriving-1.14.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2d2jp2jdsr5mrms5lr4bzimdmqn9yks0-mockery-0.3.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/r1043v0yik97pc6yvf9q4zn3s8193wx1-primitive-unlifted-2.1.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gjqlvzxrp4qcvrann713jnb207yily5j-random-shuffle-0.0.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/br006bzxh0ji9s612nsm3a2yv1za5d5h-optparse-simple-0.1.1.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yn78sy207wsdxcwxv6v2kqpfi6kmi3wa-strict-0.5.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/h0qabvran88qmba3s615qlkf5bp091n6-text-iso8601-0.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/q70i1prf1bmkkbivyirv46chkm1492kd-tf-random-0.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0wwc0hv367l8fzxzhxagfnl9m2pc8gx5-neat-interpolation-0.5.1.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fdw1wrmcjfnl2vsqcdkgxcgq5zsj2qqy-tasty-hunit-0.10.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ihds4j9mmdqjc2gxrgzlm1ygzaddmwxr-bifunctors-5.6.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jlawm4cchxhlyl2vq6adi70dnbv58dpr-tasty-inspection-testing-0.2.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0m8xiws30x8ysjrndyf5qb9gz5k37pda-tasty-rerun-1.1.20-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/821y4y75yjq86by11r0wjm04dx0wlmyh-ChasingBottoms-1.3.1.15-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qhfqgnj00vf9a8z2grxpwskzkzl9vp28-constraints-extras-0.4.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/s9za9ag62q1rh4lq2g9rrxgss63dpfm0-generic-arbitrary-1.0.1.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hcvcp3kx8413hm9cmc18067xdykn9855-quickcheck-io-0.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pb18bn51c0scn9s5az9gnnjjpqa7bpgh-tasty-quickcheck-0.11-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4884wvmmvgk8p158ijfhgsjsgbqkq7dx-th-env-0.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fia23lf0hm023fx0rjdnvv0wb73g9g3b-time-locale-compat-0.1.1.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/mllqgs3hm3km5hi9qclax7d3p1nd488p-transformers-base-0.4.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/59mi65rx4q3mdzh8sm3308camydrmj37-transformers-compat-0.7.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2rhiksczv2jsd0zc1skdjcrmwblw3kp1-trial-0.0.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/z18qjyh0vn0pl9hzrlw2qjqqnf2a877i-unbounded-delays-0.1.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ndazfmsp62xsf1gjd4wbf8n11zf81cdy-unix-compat-0.7.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jbwhb7q7kb5m4chx26acp8b295rbvp40-unliftio-core-0.2.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pl89jq90v9ydisbxgn15fxy429f1q2kv-unordered-containers-0.2.20-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3lfdn4b64alii2a83cp79rawkmgbh9jy-utf8-string-1.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/x03i324pvnyfyggl6znlmxxangzj0xsq-dependent-sum-0.7.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/y0w8fmzc1sikglb78y1j49fwpxmdzjv0-uuid-types-1.0.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/41jsyixah3rrc29dh8hc542vslyxywl5-profunctors-5.6.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9g4spilb34ip88ylv3jf6yx8506h2icb-hspec-core-2.11.12-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zj206s8k36p4m8ssw3hknx7xzl6szv7y-validation-selective-0.2.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/bq6azvsang9yx15jn1i4b8apibvm0gyc-vector-binary-instances-0.2.5.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pbiqj2489grxa4dqzspr481lghy22gsv-monad-control-1.0.3.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/i2cjrd8jm7rpgm2ngvp9r55y81jv7c44-tasty-expected-failure-0.12.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cfz2l2gi5a31r8fmk19kljnkmgcfjmkp-hw-prim-0.6.3.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/n9yqfig2m7sm650127nmdk25h8rvz3hw-resourcet-1.3.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/bkva29akzg7zdfbrarw8ylln99bp6v99-filemanip-0.3.6.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8z3r70a2ylxp35ngmhqrbhp2zgayy5yj-trial-optparse-applicative-0.0.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lv4bnria5rrd8q7hvvv3m65gazsw6bj5-typed-process-0.2.13.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yk3f90kxd3icl226vak5wmb5225bh1cb-dependent-map-0.4.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4lfbqjrn2asf80x6gpifvgs5p649nfcd-ListLike-4.7.8.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/x6cg2qf6975458w7mmb7i1lrmiziqh7x-unliftio-0.2.25.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hamvgmagri0aphlc50lkjis1q46qi19r-vector-stream-0.1.0.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0r0ma0iyln55sxrqr7rn5j7l4jfs2hiv-void-0.7.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wiinarfxkp48inhbvmyjvy4m05bg4l8j-wherefrom-compat-0.1.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/d9kj2vv2m8pphhgffh87vmslam40ikc0-lifted-base-0.2.3.12-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1155yikdfh1piiyyhvqj142j91zzqwgk-wl-pprint-annotated-0.1.0.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xzm2mbq1ws13ybhzw0qgdm9dp2775j35-zlib-0.7.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hwg74ika6yf7gpifjr2mvqfazzlrr933-charset-0.3.12-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vj55madwlaylp9rixk3b6slk0mx60bpn-indexed-traversable-instances-0.1.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lvav9r0hkd5580mdlwqjmaw0jgbmqs2f-quickcheck-instances-0.3.32-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6rga899jhpfmdz08i5d8x39h88sjyf2s-generic-lens-2.2.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/41j47gjjxmsxwyx4i9v0v9irrxs8w3gs-invariant-0.6.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hhhdc57wxsxkfagnxr0xnyrcbd94xqyv-regex-1.1.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6vsxz592zssh7mdafkan8srb38cviix3-hw-fingertree-0.1.2.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cz9y4dpk09f68zdm4fpklwhflxr1i710-relude-1.2.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8qy4fc5bx2m4xn5m2n3kdag8zjlhq6kp-bitvec-1.1.5.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/v7pw2ji5jksaf25qgx65inclrxxnvs4m-semigroupoids-6.0.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5brjm6vwxzvpp72wabi0027cfvlk059d-lifted-async-0.10.2.7-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/f1a61hxm1a73dqw0m7c6nhspzbrm6dn7-semirings-0.7-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0drp4wahmfvkh0zg7abaqk0h5d6gs3ib-hspec-2.11.12-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jxby6zhnrw3b8m8y2fqpl1963jzz3d5w-process-extras-0.7.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wbp8s7kp5y4jx5vdlg1ssjsgq3qqbmcq-shake-0.19.8-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0yk3vppi69y2iabg0sgk6nv817q3hx62-parsers-0.12.12-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xa2g73y2smzhf0i585cs31lv90lnndmj-streaming-commons-0.2.3.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fg0qv4ja4zbpx3p33gcchy94lf36avf0-row-types-1.0.1.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1733632jz61n97f3173h6bnxn8s58yg7-tasty-golden-2.3.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qi27qwc29i3gr8a0qrlw04jmxlgkpjcv-tomland-1.3.3.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vc9hsxz05s9pczn3dbpgjv14bjwc0q70-uniplate-1.6.13-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/f6p6bx2a5z17p5fcwlpn3gffdmbx0hrl-hedgehog-1.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xjwj8z9mg2ma2dr1lkmsxh3fl3rr1kdq-vector-algorithms-0.9.1.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fvamn3czr01vr8lipxzsr37086dy19sr-witherable-0.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2wys4lcydd8hcn8z1wf0mnniy4241r5n-mod-0.2.0.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/94bms4vzf4mvdlcyk5w11ksi2jy6hpaz-foldl-1.4.18-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wyvzq15a4kbkm8wa5973xgx21j8w1x30-free-5.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3c7ikvmkh22xlr4mc7xrvi3ixgzxl1g7-semialign-1.3.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vhqlgzx5pya0lam4igqdhwllcgb5klf2-mono-traversable-1.0.21.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hig7in7xjzvp40dxly17i3kj19x736bm-apply-refact-0.14.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dyf4ylizzzdhqqyljc4vlcs47ijnymsk-trial-tomland-0.0.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/c9d3q6lqk9ihh29sm762zf4nhlbjvybh-aeson-2.2.3.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2hjka0lmflyprhnl36lndx5wn5zsbd2y-deferred-folds-0.9.18.7-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/l7v5m0cdd51yv1fxvp209wk3lgzb0fhn-list-t-1.0.5.7-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/a3jdq40w1blpmq0zy26sdynrqffb1cma-adjunctions-4.4.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ra3zbf6710hyz5m85fmhr4cdkiknf7bf-monad-dijkstra-0.1.1.5-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xpkrfzhc4hwqcnix9j82i48iv7fbqwv5-conduit-1.3.6.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rp0b7qijw37xh1y59jjqcg65171ksc2z-retrie-1.2.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/56nlawhnfknjw5328da1sh6f8sa0w1jj-primitive-extras-0.10.2.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/j1yxah1ywaxiaa9099544mdfv1vlpmgp-kan-extensions-5.2.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/r8xykd6hspcqr3xa965rsfj4cvppds9p-stm-hamt-1.2.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/p3vhrvzxyrji3y66p6ybcz36d2qhlb7v-tasty-hedgehog-1.4.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hylzksn7d0as62q3i9jz1w4zrljxyr5m-lens-5.3.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/799c01s2bfg37myxn8c9kq5cnm6b4sin-stm-containers-1.2.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/mmbcq4hm4qrm9b4r0746669saw1pxgn1-HsYAML-aeson-0.2.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5klnvsv389p177hm8abrkbv18a34viiy-attoparsec-aeson-2.2.2.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6g46dawn1mv7zk8pv1hpvdygln96kkg9-aeson-pretty-0.8.10-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9gx41irn9f6cbx2i59amcrdizi2y8rc8-binary-instances-1.0.6-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/bh83rqkks9fn4djf9wz99qjmk2xig7fd-deriving-aeson-0.2.10-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hfxhx7mlfqz5fm99wfjq7fdkcsyags2c-enummapset-0.7.3.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ag3ghjj1rpav8d3i7nwrh008vblhl967-conduit-extra-1.3.7-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vvpvc6bqj42rjwjjsgcwccqb0895gr51-conduit-parse-0.2.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9q985x38cfdh1l7633xfzcgk6i1g9z9s-libyaml-0.1.4-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/f4g58x961gpwhfaizii1dnsmiyg2n80k-hls-graph-2.10.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yrmrnvyc2d91fi733pr80ai06963qz22-floskell-0.11.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ky9nc32j37xg5pgsgi310x7lkxd9gavj-yaml-0.11.11.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5nhn46c153rdznmd4wbg0igwgak83fhj-cabal-install-parsers-0.6.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cj1wn0yp4vhnpgx78r3msc7hsd1wrd1h-hie-bios-0.14.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hdyqi67wpwp3rjf6jk59izwykq76fnps-implicit-hie-0.1.4.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/58rplssr2bsibwh2mq2nd09aim0ai5ks-lens-aeson-1.2.3-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gp642dzmnv77b6p4kpnnssp54486vsdc-lsp-2.7.0.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/b1s3rlg155xkdhxvfwppbwir9pf3a1k6-hls-plugin-api-2.10.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/p9222yvxyz9vwpn0s5iigm3r3r4icwck-lsp-test-0.17.1.1-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/15m68rziry2agy0v3c9qwf8pyjfg3710-ghcide-2.10.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/p4z1q08x0ns667hw2g9pq7525ii4i369-hls-test-utils-2.10.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/kfv65q0zv5lbpg6ai0mi982nazws552h-fourmolu-0.15.0.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6ma8w7vn3inlq3rd84sfhap3xglprwkz-ghc-lib-parser-ex-9.8.0.2-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/x7k8rwa5hvbdjf5qy8mfbr6krnq93xp2-ormolu-0.7.4.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/n0giqxpp2914lr0fyyv032n1w13zjpcw-hlint-3.8-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4x6d265ac51ij40hfh6szgpphw45c163-stylish-haskell-0.14.6.0-doc' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wy695nkv8xyl12pk8hpfgb5bnn464zd5-Diff-0.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8p6zbx9avnqdr3n73pff594bhkzgm433-HsYAML-0.2.1.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vi3n5m5ymwfhqw91y3qfs242i46lnxds-Only-0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qxfz3j9zja9rkv6j2xx5smab84ljfbxy-OneTuple-0.4.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/133ga3bxw7rv5yrzl6x18c0vl2ip6725-StateVar-1.2.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cykclhmq1bpcc3d7ka5gdirvb3vrdnzn-algebraic-graphs-0.7' from 'https://cache.nix-ci.com'...
copying path '/nix/store/j204hrw1c43fxa6f1i3vxfldqmq36j0a-assoc-1.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qij6jdlk99hj9xwpwixkgpn84zd4ni4x-base-compat-0.13.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fcqmf9ncpk35y6kfq54wjgjm76vkxxh8-base-orphans-0.9.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8bq4pr5vwg3l5z99w8vh2lg5sljr7z31-blaze-builder-0.4.2.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/09wscm0jvl7bf4s8h8649r305sy66bzq-binary-orphans-1.0.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/46hwkjngvwzgf52xgkzcl3fjxl8s4v86-cereal-0.5.8.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6hlnl5iwbzwfdi8ppahqamg6h39x6gv3-base16-bytestring-1.0.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8pagg233m92a7x4fqan7jhq56h1qnzjh-call-stack-0.4.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lwybghcg0lc29pbnsm29klaby26xaq9j-character-ps-0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gcmirsm19vysrfzqg0f80f33fd7nr0a8-clay-0.15.0' from 'https://cache.nix-ci.com'...
building '/nix/store/53mlbn192ckdzwrkvmhx342vkvbpbv6q-Cabal-syntax-3.12.1.0.drv'...
copying path '/nix/store/nrhlwdip4prr2n54y171vbxk9km0qxn9-clock-0.8.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/a5ii8i70w6mgh8kimk42y8sdii43gn14-cmdargs-0.10.22' from 'https://cache.nix-ci.com'...
copying path '/nix/store/01pnh8n3w1lwbsx81r595yakrfdi2iaz-co-log-core-0.3.2.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2adpbjg747rbnc28ps5cli6g3m5cz62y-code-page-0.2.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lqk1m7ghy524xgdb9vpx8q8pwc5vxkc7-colour-2.3.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4am1q49h73xshk82fqicwpfxfv44zdqb-file-embed-0.0.16.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fvd5vyx5acy5zrcs6dj03jgiaqfmmkdb-cryptohash-sha1-0.11.101.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/h8fis2rkpmnf59pxj1gqqa8i836fxds3-cryptohash-sha256-0.11.102.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7iraps06g34xnk5lcjs8101kb06jf4ph-data-default-class-0.1.2.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/810q3nf1304iq7ja0912ia5aad0qwr4k-dir-traverse-0.2.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/59pzhpkc3qz9zkx9pj9jjgiy98ikjnlw-direct-sqlite-2.3.29' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1kday2w56cckykpw26zn9sy654rkw3dl-dlist-1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2dib1k5pp2j7qf885jglj9gaz074jgjm-erf-2.0.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/j8r3jv47fj3nca5mw6x3dr8mf66azdwv-commutative-semigroups-0.2.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5ny4fws3gcm2fsilwgndjcj9p714f3wj-filtrable-0.1.6.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/448ig19rqv03bmdrc4ghllm845w3jzbi-fingertree-0.1.5.0' from 'https://cache.nix-ci.com'...
Cabal-syntax> Running phase: setupCompilerEnvironmentPhase
Cabal-syntax> Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
Cabal-syntax> Running phase: unpackPhase
Cabal-syntax> unpacking source archive /nix/store/1wglr52h7wrxw0bfz83n455zaczgfvsj-Cabal-syntax-3.12.1.0.tar.gz
Cabal-syntax> source root is Cabal-syntax-3.12.1.0
Cabal-syntax> setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "Cabal-syntax-3.12.1.0/src/Language/Haskell/Extension.hs"
Cabal-syntax> Running phase: patchPhase
Cabal-syntax> Running phase: compileBuildDriverPhase
Cabal-syntax> setupCompileFlags: -package-db=/build/tmp.srnorWRK8r/setup-package.conf.d -threaded
Cabal-syntax> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.srnorWRK8r/Main.o )
Cabal-syntax> [2 of 2] Linking Setup
copying path '/nix/store/p7nky91j7npsmg4x0nzxz8x033g8mjcs-HUnit-1.6.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/hdr22ahx56l1bj8finc9pr21d4vwjmbi-blaze-markup-0.8.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jj6jf40vli22vvv6mmbww8fhrxlxc7pk-contravariant-1.5.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/m7xnyfj701wbkwswfhmgc42nvh9xv747-fmlist-0.9.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3m6hypz5hxa1n72mhvndd0pv2jhf07v6-data-default-instances-containers-0.1.0.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0qmyjnd23p309j3gx2ckm5djly96cpa8-focus-1.0.3.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/klrvqqi9i93in6336gnsygf2160rs07f-generically-0.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dzjm5464iv9kajxq7vj09l1j4kdilw2a-ghc-lib-parser-9.8.5.20250214' from 'https://cache.nix-ci.com'...
copying path '/nix/store/y9s0bg4w09ksy787ryfm9cycn1qgh999-ghc-paths-0.1.0.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0lj67xqan50p81b3c17brfl030x4v7cl-ghc-trace-events-0.1.2.10' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zsc29221ksxazjiyz906c482qrdfppvq-data-default-instances-dlist-0.0.1.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9shg7hv5fv0b2iwlxdp9m48dyh3g7bvm-gitrev-1.3.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/g9nrp0brpl11300g1wa7a1w4mh9kbfsf-extra-1.7.16' from 'https://cache.nix-ci.com'...
copying path '/nix/store/x98g6zb2s5fph1iz08i9d8jclynjansr-haddock-library-1.11.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3iacw420iq872rvsk6213f310k7gm0gx-haskell-lexer-1.1.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wlk8lc6llva7lqwh3nsxhhr4c9qvlgb4-haskell-src-exts-1.23.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/34pqlmcdbg5lgv34xn2j9niqfhg3kjcn-hie-compat-0.3.1.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ngd5m2syds6c6vd2rn2anv92zl3znxmd-heaps-0.4.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cqjs7jkgypsamndx82x2lvg7l4jp5sbw-hspec-discover-2.11.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/13rj75karm6rqpdvskdahzma1nq6fvcf-hscolour-1.25' from 'https://cache.nix-ci.com'...
copying path '/nix/store/d71w1zn747fkna1z76hx6pl60d0y6m6k-indexed-profunctors-0.1.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yg403g15w5ksyrlzbyhhpbff5nwciwag-indexed-traversable-0.1.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4ja266dbllmxfz1c92s1cl2kyxjkmjlc-hspec-expectations-0.8.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/z3vdwn9rw36p4ks9dgafi3l3ksg39byc-ansi-terminal-types-1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/46bls9f6gnsmss41qa9dgfyy8zxagb87-inspection-testing-0.5.0.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lw71ay1i4yghkw175wrfp1cd5ix0n3wd-blaze-html-0.9.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1nnl03i6nqv79036lidf2a9qhd0bl2rf-integer-logarithms-1.0.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0k789617alx3kvr1pzjv69qdmawrn5p4-js-dgtable-0.5.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rax0znskh57bg8vlzx7qy7fzhm4p546c-generic-lens-core-2.2.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/37qkpv7v9kb93hrbsil1pln8q89wv6zi-js-flot-0.8.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nrvfnmgjvziw2xbgsr3z57dzdk41hhaj-filepattern-0.1.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9wbynvackkyl229j9b7gqpll26c8gjb8-ansi-terminal-1.1.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/w3hrz5nfi3rgwhjl02cm0fwg5n17m0cg-js-jquery-3.3.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vg7l7v338nhp74zsf2i5cimkqq4ln923-logging-facade-0.3.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/px0053nhxwcd3ay7g217rifvzxmyjxsi-logict-0.8.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/96nyvh869a6953q230svd18jj0yrssmz-lukko-0.1.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/c8mb7k969d90hwnv47pbrjv4nswrvh96-microaeson-0.1.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/58xwhv69m4f30j3s8why5a2r1ay56niv-mmap-0.5.9' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jyv3pcxh8hvngc7i34i9dhnz91k9qkak-network-3.2.7.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1mks2q1s5lzcwndrdayx07v5w0xjvw50-newtype-generics-0.6.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/20kcmc3php1xniq7xd0m3wj4aagg5n0q-old-locale-1.0.0.7' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2g7p0mgagawhsmawrx6gmigx8r5lylmb-os-string-2.0.7' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qbyr9a9bv5pwppk559aamwixk5zhmwkk-parallel-3.2.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vsb1vj407f3lvzmj38vf6kwz6wx0gw5h-colourista-0.1.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/inahhjp13ykq2hlqpljjvcy5j8na9j5v-parser-combinators-1.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fzc2dgaf9p42fx2nch4q9865m4bsnyra-polyparse-1.13' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8hfj49l4q4gsp6jwxx10zafmzak0xw05-pretty-show-1.10' from 'https://cache.nix-ci.com'...
copying path '/nix/store/y42g0cbrr0qfgdf833rfjwilz8kdaw1v-prettyprinter-1.7.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/10rs52049rf4haljgszj1l6jx8052s9m-primes-0.2.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ldp4yjlk9m6pilkqryaii9bpqm6mz9y6-data-default-instances-old-locale-0.0.1.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/m6z8rna5dsw2jcg309py6szv75aszpk7-old-time-1.1.0.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/bzblizfbnqmz08kq2q5s9r71z5mn5c4r-primitive-0.9.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xq7wjyx5awvh1c9l0w2ls4jfnwlck06d-MemoTrie-0.6.11' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9mnh20gmm89ip42wxacdgm0z05c8379z-refact-0.3.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/scqa9mf0q4il4nifxqr5iqqvi4cy6bxb-reflection-2.1.9' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ck793ddc9yyi61bjafpzrfmph3sxcaq2-data-default-0.7.1.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/52xmvw12jkprl8prcq9r9lmfxhlfnaz3-regex-applicative-0.3.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/h0s7yrx8wkhlp280j9sy7yh2zwmb6xvk-regex-base-0.94.0.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/v98gv88w4iadhdnxdrlsk48bawag5jr0-safe-0.3.21' from 'https://cache.nix-ci.com'...
copying path '/nix/store/358g1pjwcbi9xsd3kxxnhi2q7q3jbrrj-safe-exceptions-0.1.7.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9yilb5wcg0xx0cnsykkak5b56r3f2phy-selective-0.7.0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9saapzad9jxpcvag8b447k05pjir991v-hashable-1.4.7.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/d51zqccfj2f3ymnlbqqxg460yhr388dq-silently-1.2.5.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7glpzg93h2y86ff7vgnl584dnfyh3idl-semigroups-0.20' from 'https://cache.nix-ci.com'...
copying path '/nix/store/kf16zz3xhmlrf2i22piqbcj1jyx73jpi-regex-pcre-builtin-0.95.2.3.8.44' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fgzc2z6d3dkkidpqx30qb35s9hvzzwcb-regex-tdfa-1.3.2.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dvdl4gwacy37gxykff2bm0bqy4nbhby2-slist-0.2.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lxfnx7y8wxxg36ipg8lgm3806lx84acf-some-1.0.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ff4zydiyv4qbwish0rv79q8n4xiw111d-sorted-list-0.2.3.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dd45grxnnr2y6247wmidyw1m3bc9vly6-split-0.2.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/si0fbklc2x6qv458pf79v35mrj517r69-splitmix-0.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/m33jk984zqc31v9pdshkcjyxahab7zvv-stringbuilder-0.5.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nngkdk9h57zp286pmaafp1winmb89glx-syb-0.7.2.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/v81zi8dgm8d6635cj6lmx2d2m376afsv-cpphs-1.20.9.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/64vq09zv1v1wvqg7aixllflkib1xvcxi-tagged-0.8.8' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2dg9fi4dapgbjym0kjvps8k8cnq1nfaw-terminal-size-0.3.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/m1mck81brw39sb7p63q0b5syfzykfjrc-integer-conversion-0.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/b9naagvs1vyrmmqxi2hzlbwq1nkja074-tar-0.6.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3kjsykmv9gnryxc0zvj3ik7yrwq0ydbg-prettyprinter-ansi-terminal-1.1.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7cawa9h7as0d1z9rhwcvd4kg23qiikzx-th-abstraction-0.7.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gd36qyhrj8p1k7dyx5yl1a3w7x72jmif-async-2.2.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/q3iwixlv274c8ivnbfc6dp6sqgz3whl7-case-insensitive-1.2.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lzh773h21y9j8akfk0c2wfgdlgqq9jy0-data-fix-0.3.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9cycg3nzpsa95vk8105bq3apmk4ka6yl-opentelemetry-0.8.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/f0wh5r54wsqbms8cqrg1548n53vpp9r5-ordered-containers-0.2.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rzassp22xjch5c60yyajyhalk3wxsi68-psqueues-0.2.8.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fd49rmwxx3wha0x3lvzjam0amfq3dviw-random-1.2.1.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/930fhvx7x5qk37r48a5gw5wk9lbqhn1y-scientific-0.3.8.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cxxdapxw2x92hdr8x73p5gl9w2xdpsd7-boring-0.2.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/l6ippx0jyqb2cygzxkh7a34649jnx47a-distributive-0.6.2.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7blgw29lmg07sri2934ia4g71rra6r7s-text-short-0.1.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4yx9489rjmy6gg4sqxpmbfkarnklfccg-th-compat-0.1.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gy08isrfll06yd3q7y8ih05pz00plx2z-concurrent-output-1.10.21' from 'https://cache.nix-ci.com'...
copying path '/nix/store/15zdby2idn9nyx7gnylgxqy52pvm3piv-prettyprinter-compat-ansi-wl-pprint-1.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ysfymf9y565zfqh5mnlpbhmc0mzcnksa-these-1.2.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/mijgh91mfn9pg257cl90kqxm50glgkbg-constraints-0.14.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zlr31n03vlf2xykjkarbgrdp8491mkn1-generic-deriving-1.14.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nn41wa9026jyks5ibss0dkwpx3fixmcy-githash-0.1.7.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/93sb7vmy446nd6l6i67sp4x6bp6j7ljq-network-uri-2.6.4.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/bjfaw2nyc4kxmqfjkfyhw4sp0js11yjc-barbies-2.1.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6gl4cbdy13kzi27w5y27cfxy76v30xyw-attoparsec-0.14.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/aw5la0g1ma3lljcgc3491qgbxzg5krdv-th-env-0.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/88by3lwrgdfgxw8snipq8snd5sv43cnz-ansi-wl-pprint-1.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yga3whg6jdmx2sl0dr4mz9anxwv1qd77-base64-1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5vva9vfyv4djbzibgn8cqmbzxf70lw02-megaparsec-9.7.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vf56fmwixbddky7f3x55fx9sjzb8z1fr-primitive-unlifted-2.1.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/71gbrb2jd79gyn2c8128k0sfkswfjmzm-time-compat-1.9.7' from 'https://cache.nix-ci.com'...
copying path '/nix/store/r41wcm29lgz928p3wp5pi4mz9ra1ijm3-QuickCheck-2.14.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/s2yad4gfa0wssw7baps8njnfq41va7vx-temporary-1.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zrnrfdk71nisamll0h1g8ppq43fbm3jk-tf-random-0.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pj8ykq44wm9kwl2qiillrhdczcfivwyb-strict-0.5.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vg0b7qkf4013vgf2mzaadlnlqxrhsw1a-time-locale-compat-0.1.1.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/k65nixclvpfan7ycg778l80grjmqdrmp-transformers-compat-0.7.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/31xpiix1byzn4b61lcr8dgr0h9gfyyz1-trial-0.0.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/05amxljwzzjmk7005w7z3imapjccakci-unbounded-delays-0.1.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/kswcxi2gmxl7vglnpkid84xpwzdnihsi-unix-compat-0.7.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2pg37qyndgfqi23h9dwmdx5pgpg2x305-mockery-0.3.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/dgfiq4pnvyqaclyi71nz5b1liz88gc1r-unliftio-core-0.2.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9502j1yrcr37x46fbgrz0s7whq5mh9bk-unordered-containers-0.2.20' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yns2bp9ph72cbpkc8jqqf3cmiqwknqg2-text-iso8601-0.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/frxfhjlp9zgi4vaylqfkspl000njgdhd-utf8-string-1.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3zwrvza13frmjx4162bksx97kqljzdsq-uuid-types-1.0.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1jlpd8h4p42fjl0x6v2w8whq7zf6clcc-validation-selective-0.2.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ca03pjdnbzls40vndpsx6vqrbf01b6fn-Glob-0.10.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/51vm0m8j14k8jas21aiy14f34cfxafpl-MonadRandom-0.6.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ybhd6i9a9zz5rzzvifbz7lpxgn9hx3x4-comonad-5.0.9' from 'https://cache.nix-ci.com'...
copying path '/nix/store/bapdhz3m96ciwj2y2x4hg28vmzdib6kg-filemanip-0.3.6.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3spsgba5l1aa2zg8dn7qi4kw4ffk9gp9-mmorph-1.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/vsfkc3rwwp58y7x5my5qlfch9c4i2a72-optparse-applicative-0.18.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/anngnqci3b293h2rr4rbikr5ap8jwm6r-resourcet-1.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/41p6gbj1r67iznaww6fhz1phnl09w4bm-neat-interpolation-0.5.1.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1409cg04vadnh2zwm2zixdsqia12rbr5-transformers-base-0.4.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/fisj2k9g9ca36qxv0jszjyn9dlqxgh8h-typed-process-0.2.13.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qrizwdap9gfrp84wryxnvbrmjqljh2gs-unliftio-0.2.25.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/573bnyii92qjsp4qsgv4h1yrbpr4cr1x-vector-stream-0.1.0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/kig3gfc89b25ijk30d0d86aaph4mgxmp-void-0.7.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pb0i2x1lkwwfya03jmdvr1vsj75yzd17-lucid-2.11.20250303' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2izq449xrjg026vdiqvcl6irarnnm5d0-random-shuffle-0.0.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rv8k0dkrks1f05mb33qpjhcbvi9il2f1-monad-control-1.0.3.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3v8r2mxz1ilbhy6c64qwzh585g4nr0nx-wherefrom-compat-0.1.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/grygy90rwvpc8vf2mdn4i9fs8jiy1ya1-wl-pprint-annotated-0.1.0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3gh3lpmrlnigwdw5ird6xqgmahpns419-zlib-0.7.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yflinmbdb0hjp3fdyr4308h94d0br165-charset-0.3.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yg0wzy6r9aqfijnvwnj8v8ni6fhz9mgx-regex-1.1.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qq8a8063yfv1rp8yf4gl11qfb60cf6fb-bifunctors-5.6.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yss0cv2abl7iwgqliqv4ixsw8ghk40lk-relude-1.2.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7pcfdhxawawdmbkvhp6j75fwd7bp1kib-semirings-0.7' from 'https://cache.nix-ci.com'...
copying path '/nix/store/k0my1b4nz9p3gdww2jj5h1xjycbi87w4-shake-0.19.8' from 'https://cache.nix-ci.com'...
copying path '/nix/store/kbq498q091ialznflr45s3ick1nbd0ki-tomland-1.3.3.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/milz4rrxcdndkp1xkb2zp8gps4ka13ga-uniplate-1.6.13' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4wsbky707b4zg2n9ry8yswyvgd13dyrh-lifted-base-0.2.3.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jw7qsv9kf3siqzbikpm7xxx8b3hrvq7s-ChasingBottoms-1.3.1.15' from 'https://cache.nix-ci.com'...
copying path '/nix/store/86ksydx1y83db7jpzdr7lm96aijnpa64-quickcheck-io-0.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/w7ndwqda2dwalbfwnsxvb3nnnfw8l46s-generic-arbitrary-1.0.1.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/asf97z44ia70qgidrdx0piim0vqv276f-optparse-simple-0.1.1.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cgnnyxdb2rjlksiqzjvp5wpjzskprzgy-extensions-0.1.0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/aj3wxsaxda25lh0pfv92fqikbk2j9ln1-pretty-simple-4.1.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nshyh2llqc5fydy1a32ml5lpqnyr7z7h-lifted-async-0.10.2.7' from 'https://cache.nix-ci.com'...
copying path '/nix/store/g79l9v82h97dz7gri560r5a3gn0n40ja-parsers-0.12.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/839dqk3i5b3k9jml53f5a7gniqkr8znq-streaming-commons-0.2.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lm9xiilgj7bacbd1r1mw10246qsj14kg-hspec-core-2.11.12' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xnyna8l1aw5vmm80znvqw8sihc72451b-tasty-1.5.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/q0x6fxb5qiv808sc7lja6xxxhlkmjn5n-trial-optparse-applicative-0.0.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/mnr6szf70187dfx62d6x5jcavlz70z1w-hedgehog-1.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/69591cp018772bv94wxgqpakp8whgmj5-profunctors-5.6.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/msbfary87qrzvfy535a0xb9bwi269qds-semigroupoids-6.0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/sv2xyrpkjh8d7cvyf88s8qdjwhv747lm-trial-tomland-0.0.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xdxjj6krbi8wdcj3fy7an1x6pywkxih4-stan-0.2.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gid9j5rd5k4ncsv7d695xwd7n64cav8r-tasty-golden-2.3.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7hy79z6vd3n5d5dsw9bbxjfqmwrf03nx-tasty-inspection-testing-0.2.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/84qx55m2l842j1kw8f5rvq0igw1mmfda-tasty-expected-failure-0.12.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/k7bgrwljsgzppwn0z54ylmfkfwixfi9p-tasty-quickcheck-0.11' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4p5gwzmclh5l1ssbf8c8bwrr57kr9qfk-tasty-hunit-0.10.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3yjannn2s9fvsqfagpxn1xyg0ygb80ip-vector-0.13.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/f26rf4vfa78xmk0zsw3lga49ghlxssqv-tasty-rerun-1.1.20' from 'https://cache.nix-ci.com'...
copying path '/nix/store/w6k2653j3bg6gfcvrr5m270xal80syha-generic-lens-2.2.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/lnfzq07fpj9p7n14ybkcp2bi4dqjk3xq-invariant-0.6.4' from 'https://cache.nix-ci.com'...
Cabal-syntax> Running phase: updateAutotoolsGnuConfigScriptsPhase
copying path '/nix/store/jshwsc5c7vz14gpc12fbdsbnfix5kqbx-free-5.2' from 'https://cache.nix-ci.com'...
Cabal-syntax> Running phase: configurePhase
copying path '/nix/store/vsyfdhw40x6ikcnx3z3zspyq1gwji8f4-row-types-1.0.1.2' from 'https://cache.nix-ci.com'...
Cabal-syntax> configureFlags: --verbose --prefix=/nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/px1i8v7rxcyjqmckridiwqgca8a9hsd7-Cabal-syntax-3.12.1.0-doc/share/doc/Cabal-syntax-3.12.1.0 --with-gcc=gcc --package-db=/build/tmp.srnorWRK8r/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
copying path '/nix/store/d5jkjvhinvmhnl2dijk4n69rwf8cqlhs-hspec-2.11.12' from 'https://cache.nix-ci.com'...
Cabal-syntax> Using Parsec parser
Cabal-syntax> Configuring Cabal-syntax-3.12.1.0...
copying path '/nix/store/kcafj0mnmash1pssc9mfz06657nwgyhf-tasty-hedgehog-1.4.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/wf3b7dr84bgxd29kif0ak56f4hgccf40-adjunctions-4.4.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xw15plg31ygcawvagjn221qg84dk0bzh-ghc-exactprint-1.8.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/c0cnkcnx445hfnv8wlic0m6d3xqd4y9b-monad-dijkstra-0.1.1.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/3h2kkscfjwlwrdzzgzgnjk5bvf3yqxb2-kan-extensions-5.2.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0rss619asdshcks36w8015g3xsnlqpjk-foldl-1.4.18' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rc3xdxjalh8kz50bkak8lyjdznyh1fbj-ListLike-4.7.8.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yh4m2xi9zx4hpp0jjnqg0h25ngrpdmrv-blaze-textual-0.2.3.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/72amq1zjkj644gqm4cfpqzhscy5663fy-bitvec-1.1.5.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1b01f10fwifz7zgj6abr91qhqbaa0886-mod-0.2.0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/7zws4nk0wkqfjp5c3mi0csh4bnksmc8p-indexed-traversable-instances-0.1.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nybqx0xvzv6ql77zhgjffqgm6nymwnni-quickcheck-instances-0.3.32' from 'https://cache.nix-ci.com'...
copying path '/nix/store/y9009gpd3kwyyy2nzagpmrhga8bs9qkb-monoid-subclasses-1.2.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/mm0v3c0prij81wk33q1ra5jg05av0nfc-hw-prim-0.6.3.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9qxdh25gfxxm08nd2biq5qil2rdw3ifb-text-rope-0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/xvdkjlylkcr0jaxhjh0p5g38ia331d8j-vector-binary-instances-0.2.5.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/13pcd315cqamav07rpdyfrfxji9v6s64-lens-5.3.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/gffsqiffax08vf9mrp44v542kbdfml8i-semialign-1.3.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/apm6vba2nsbdnf3z0ppwk4lz5idiyn0y-witherable-0.5' from 'https://cache.nix-ci.com'...
copying path '/nix/store/q8rkxxk3nfw3gpbfsyw60jwn4ndl3sha-sqlite-simple-0.4.19.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qghbybs2aw6lp8lvygxsk6sgl8vlxnmc-deferred-folds-0.9.18.7' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2ylzvrdqybdxmdzyhvkp79hnqnviqzcj-list-t-1.0.5.7' from 'https://cache.nix-ci.com'...
copying path '/nix/store/qw3rnj9jwiygc05nryk6z6nz4ml4f814-aeson-2.2.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ijnywb5xa7lc07pb1vd7r2xkyajpkwap-vector-algorithms-0.9.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/5bn2ha5fn2wacqi7bjnbk79a9n30mmg6-hiedb-0.6.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/q3fgz13jcwb1sn0lxvavkhgrb22vw8jc-hw-fingertree-0.1.2.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/y3g37naa01dy4ypn381inak7lz440y2v-primitive-extras-0.10.2.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4ngpqprygjy125a52y0xpk2gcn4ifhgv-apply-refact-0.14.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nggadzfc18lkmm7fkz48411jmvjgn5jh-retrie-1.2.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6s6qbr6nnzlfd0004vk0iivnjp9yn6y3-stm-hamt-1.2.1.1' from 'https://cache.nix-ci.com'...
Cabal-syntax> Dependency array >=0.4.0.1 && <0.6: using array-0.5.6.0
Cabal-syntax> Dependency base >=4.11 && <5: using base-4.19.0.0
Cabal-syntax> Dependency binary >=0.7 && <0.9: using binary-0.8.9.1
Cabal-syntax> Dependency bytestring >=0.10.0.0 && <0.13: using bytestring-0.12.0.2
Cabal-syntax> Dependency containers >=0.5.0.0 && <0.8: using containers-0.6.8
Cabal-syntax> Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
Cabal-syntax> Dependency directory >=1.2 && <1.4: using directory-1.3.8.1
Cabal-syntax> Dependency filepath >=1.3.0.1 && <1.6: using filepath-1.4.100.4
Cabal-syntax> Dependency mtl >=2.1 && <2.4: using mtl-2.3.1
Cabal-syntax> Dependency parsec >=3.1.13.0 && <3.2: using parsec-3.1.17.0
Cabal-syntax> Dependency pretty >=1.1.1 && <1.2: using pretty-1.1.3.6
Cabal-syntax> Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1
Cabal-syntax> Dependency time >=1.4.0.1 && <1.15: using time-1.12.2
Cabal-syntax> Dependency transformers >=0.3 && <0.4 || >=0.4.1.0 && <0.7: using
Cabal-syntax> transformers-0.6.1.0
copying path '/nix/store/q1wljd0wmv4b9426mmn1psxf0gi9j26m-stm-containers-1.2.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/4l14k4w45lxflaryh3x1y0mqk2sdrwfa-fuzzy-0.1.1.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/y8wdi7qyzsd1fj5h6gf8w8i0n336fh8v-mono-traversable-1.0.21.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jvfpadxcsjw0rjkxysqhy4pigidhl621-process-extras-0.7.4' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ximzqmp5mam31h35rcdkxiklxkzqwdxf-conduit-1.3.6.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/mys707lrrd8ax7jh8hb2azwx8ymhaqyk-HsYAML-aeson-0.2.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1690y2d9ynl8m9hjaif19xwyp1k86ml3-binary-instances-1.0.6' from 'https://cache.nix-ci.com'...
copying path '/nix/store/jfxd585w0msljl5201w7bz8l7wzzz28m-constraints-extras-0.4.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rwvkax5jp95bsz8faacqyn6s72mh0cs6-attoparsec-aeson-2.2.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/s9sphajm9piw4il6lbfgz0kf6ml5yrfx-deriving-aeson-0.2.10' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1kzcr6x52gfk9rbs3yci6wambrs00kpn-enummapset-0.7.3.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ahhhvqz17f1pgza5c3j8cq13nd427i7x-hls-graph-2.10.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/d4bp9f7c3fk4y0aqpmisqwlmp1y7lc8s-cabal-install-parsers-0.6.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/pv15gl27da4dqn466zl8m0xzcikrf68v-dependent-sum-0.7.2.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/8kida4jwgjdwsz2iiyr6wqmwpff25xss-aeson-pretty-0.8.10' from 'https://cache.nix-ci.com'...
copying path '/nix/store/iy9ma9swv83g6cm3pzfikiy4qp8lj4qs-lens-aeson-1.2.3' from 'https://cache.nix-ci.com'...
copying path '/nix/store/2jrfw8q09yl3am3cf8wd39sf661ndlj9-lsp-types-2.3.0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/1fwqb3d4drmwh13a86iky5y0j2brsz0h-dependent-map-0.4.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/rgvwq6b5wpkcc3mi4w1iglc84vv4mk38-conduit-extra-1.3.7' from 'https://cache.nix-ci.com'...
copying path '/nix/store/nil691wr5ic0nrncvvg8qysz4b02flhn-conduit-parse-0.2.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/9nikaiv9s6nw95ns7494vrbwn4ixd73a-libyaml-0.1.4' from 'https://cache.nix-ci.com'...
Cabal-syntax> Source component graph: component lib
Cabal-syntax> Configured component graph:
Cabal-syntax>     component Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA
Cabal-syntax>         include array-0.5.6.0-dc89
Cabal-syntax>         include base-4.19.0.0-b960
Cabal-syntax>         include binary-0.8.9.1-0e3e
Cabal-syntax>         include bytestring-0.12.0.2-4690
Cabal-syntax>         include containers-0.6.8-4775
Cabal-syntax>         include deepseq-1.5.0.0-412f
Cabal-syntax>         include directory-1.3.8.1-6a8e
Cabal-syntax>         include filepath-1.4.100.4-fa1c
Cabal-syntax>         include mtl-2.3.1-63a4
Cabal-syntax>         include parsec-3.1.17.0-389e
Cabal-syntax>         include pretty-1.1.3.6-0c70
Cabal-syntax>         include text-2.1-c36a
Cabal-syntax>         include time-1.12.2-d26d
Cabal-syntax>         include transformers-0.6.1.0-c3ec
Cabal-syntax> Linked component graph:
Cabal-syntax>     unit Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA
Cabal-syntax>         include array-0.5.6.0-dc89
Cabal-syntax>         include base-4.19.0.0-b960
Cabal-syntax>         include binary-0.8.9.1-0e3e
Cabal-syntax>         include bytestring-0.12.0.2-4690
Cabal-syntax>         include containers-0.6.8-4775
Cabal-syntax>         include deepseq-1.5.0.0-412f
Cabal-syntax>         include directory-1.3.8.1-6a8e
Cabal-syntax>         include filepath-1.4.100.4-fa1c
Cabal-syntax>         include mtl-2.3.1-63a4
Cabal-syntax>         include parsec-3.1.17.0-389e
Cabal-syntax>         include pretty-1.1.3.6-0c70
Cabal-syntax>         include text-2.1-c36a
Cabal-syntax>         include time-1.12.2-d26d
Cabal-syntax>         include transformers-0.6.1.0-c3ec
Cabal-syntax>         Distribution.Backpack=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Backpack,Distribution.CabalSpecVersion=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.CabalSpecVersion,Distribution.Compat.Binary=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.Binary,Distribution.Compat.CharParsing=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.CharParsing,Distribution.Compat.DList=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.DList,Distribution.Compat.Exception=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.Exception,Distribution.Compat.Graph=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.Graph,Distribution.Compat.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.Lens,Distribution.Compat.MonadFail=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.MonadFail,Distribution.Compat.Newtype=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.Newtype,Distribution.Compat.NonEmptySet=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.NonEmptySet,Distribution.Compat.Parsing=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.Parsing,Distribution.Compat.Prelude=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.Prelude,Distribution.Compat.Semigroup=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.Semigroup,Distribution.Compat.Typeable=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.Typeable,Distribution.Compiler=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compiler,Distribution.FieldGrammar=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.FieldGrammar,Distribution.FieldGrammar.Class=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.FieldGrammar.Class,Distribution.FieldGrammar.FieldDescrs=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.FieldGrammar.FieldDescrs,Distribution.FieldGrammar.Newtypes=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.FieldGrammar.Newtypes,Distribution.FieldGrammar.Parsec=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.FieldGrammar.Parsec,Distribution.FieldGrammar.Pretty=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.FieldGrammar.Pretty,Distribution.Fields=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Fields,Distribution.Fields.ConfVar=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Fields.ConfVar,Distribution.Fields.Field=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Fields.Field,Distribution.Fields.Lexer=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Fields.Lexer,Distribution.Fields.LexerMonad=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Fields.LexerMonad,Distribution.Fields.ParseResult=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Fields.ParseResult,Distribution.Fields.Parser=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Fields.Parser,Distribution.Fields.Pretty=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Fields.Pretty,Distribution.InstalledPackageInfo=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.InstalledPackageInfo,Distribution.License=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.License,Distribution.ModuleName=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.ModuleName,Distribution.Package=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Package,Distribution.PackageDescription=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.PackageDescription,Distribution.PackageDescription.Configuration=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.PackageDescription.Configuration,Distribution.PackageDescription.FieldGrammar=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.PackageDescription.FieldGrammar,Distribution.PackageDescription.Parsec=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.PackageDescription.Parsec,Distribution.PackageDescription.PrettyPrint=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.PackageDescription.PrettyPrint,Distribution.PackageDescription.Quirks=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.PackageDescription.Quirks,Distribution.PackageDescription.Utils=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.PackageDescription.Utils,Distribution.Parsec=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Parsec,Distribution.Parsec.Error=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Parsec.Error,Distribution.Parsec.FieldLineStream=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Parsec.FieldLineStream,Distribution.Parsec.Position=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Parsec.Position,Distribution.Parsec.Warning=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Parsec.Warning,Distribution.Pretty=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Pretty,Distribution.SPDX=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.SPDX,Distribution.SPDX.License=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.SPDX.License,Distribution.SPDX.LicenseExceptionId=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.SPDX.LicenseExceptionId,Distribution.SPDX.LicenseExpression=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.SPDX.LicenseExpression,Distribution.SPDX.LicenseId=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.SPDX.LicenseId,Distribution.SPDX.LicenseListVersion=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.SPDX.LicenseListVersion,Distribution.SPDX.LicenseReference=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.SPDX.LicenseReference,Distribution.System=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.System,Distribution.Text=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Text,Distribution.Types.AbiDependency=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.AbiDependency,Distribution.Types.AbiHash=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.AbiHash,Distribution.Types.Benchmark=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Benchmark,Distribution.Types.Benchmark.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Benchmark.Lens,Distribution.Types.BenchmarkInterface=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.BenchmarkInterface,Distribution.Types.BenchmarkType=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.BenchmarkType,Distribution.Types.BuildInfo=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.BuildInfo,Distribution.Types.BuildInfo.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.BuildInfo.Lens,Distribution.Types.BuildType=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.BuildType,Distribution.Types.Component=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Component,Distribution.Types.ComponentId=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ComponentId,Distribution.Types.ComponentName=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ComponentName,Distribution.Types.ComponentRequestedSpec=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ComponentRequestedSpec,Distribution.Types.CondTree=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.CondTree,Distribution.Types.Condition=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Condition,Distribution.Types.ConfVar=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ConfVar,Distribution.Types.Dependency=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Dependency,Distribution.Types.DependencyMap=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.DependencyMap,Distribution.Types.ExeDependency=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ExeDependency,Distribution.Types.Executable=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Executable,Distribution.Types.Executable.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Executable.Lens,Distribution.Types.ExecutableScope=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ExecutableScope,Distribution.Types.ExposedModule=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ExposedModule,Distribution.Types.Flag=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Flag,Distribution.Types.ForeignLib=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ForeignLib,Distribution.Types.ForeignLib.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ForeignLib.Lens,Distribution.Types.ForeignLibOption=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ForeignLibOption,Distribution.Types.ForeignLibType=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ForeignLibType,Distribution.Types.GenericPackageDescription=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.GenericPackageDescription,Distribution.Types.GenericPackageDescription.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.GenericPackageDescription.Lens,Distribution.Types.HookedBuildInfo=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.HookedBuildInfo,Distribution.Types.IncludeRenaming=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.IncludeRenaming,Distribution.Types.InstalledPackageInfo=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.InstalledPackageInfo,Distribution.Types.InstalledPackageInfo.FieldGrammar=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.InstalledPackageInfo.FieldGrammar,Distribution.Types.InstalledPackageInfo.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.InstalledPackageInfo.Lens,Distribution.Types.LegacyExeDependency=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.LegacyExeDependency,Distribution.Types.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Lens,Distribution.Types.Library=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Library,Distribution.Types.Library.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Library.Lens,Distribution.Types.LibraryName=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.LibraryName,Distribution.Types.LibraryVisibility=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.LibraryVisibility,Distribution.Types.Mixin=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Mixin,Distribution.Types.Module=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Module,Distribution.Types.ModuleReexport=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ModuleReexport,Distribution.Types.ModuleRenaming=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ModuleRenaming,Distribution.Types.MungedPackageId=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.MungedPackageId,Distribution.Types.MungedPackageName=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.MungedPackageName,Distribution.Types.PackageDescription=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PackageDescription,Distribution.Types.PackageDescription.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PackageDescription.Lens,Distribution.Types.PackageId=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PackageId,Distribution.Types.PackageId.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PackageId.Lens,Distribution.Types.PackageName=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PackageName,Distribution.Types.PackageVersionConstraint=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PackageVersionConstraint,Distribution.Types.PkgconfigDependency=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PkgconfigDependency,Distribution.Types.PkgconfigName=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PkgconfigName,Distribution.Types.PkgconfigVersion=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PkgconfigVersion,Distribution.Types.PkgconfigVersionRange=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PkgconfigVersionRange,Distribution.Types.SetupBuildInfo=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.SetupBuildInfo,Distribution.Types.SetupBuildInfo.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.SetupBuildInfo.Lens,Distribution.Types.SourceRepo=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.SourceRepo,Distribution.Types.SourceRepo.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.SourceRepo.Lens,Distribution.Types.TestSuite=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.TestSuite,Distribution.Types.TestSuite.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.TestSuite.Lens,Distribution.Types.TestSuiteInterface=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.TestSuiteInterface,Distribution.Types.TestType=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.TestType,Distribution.Types.UnitId=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.UnitId,Distribution.Types.UnqualComponentName=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.UnqualComponentName,Distribution.Types.Version=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Version,Distribution.Types.VersionInterval=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.VersionInterval,Distribution.Types.VersionInterval.Legacy=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.VersionInterval.Legacy,Distribution.Types.VersionRange=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.VersionRange,Distribution.Types.VersionRange.Internal=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.VersionRange.Internal,Distribution.Utils.Base62=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Utils.Base62,Distribution.Utils.Generic=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Utils.Generic,Distribution.Utils.MD5=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Utils.MD5,Distribution.Utils.Path=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Utils.Path,Distribution.Utils.ShortText=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Utils.ShortText,Distribution.Utils.String=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Utils.String,Distribution.Utils.Structured=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Utils.Structured,Distribution.Version=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Version,Language.Haskell.Extension=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Language.Haskell.Extension
Cabal-syntax> Ready component graph:
Cabal-syntax>     definite Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA
Cabal-syntax>         depends array-0.5.6.0-dc89
Cabal-syntax>         depends base-4.19.0.0-b960
Cabal-syntax>         depends binary-0.8.9.1-0e3e
Cabal-syntax>         depends bytestring-0.12.0.2-4690
Cabal-syntax>         depends containers-0.6.8-4775
Cabal-syntax>         depends deepseq-1.5.0.0-412f
Cabal-syntax>         depends directory-1.3.8.1-6a8e
Cabal-syntax>         depends filepath-1.4.100.4-fa1c
Cabal-syntax>         depends mtl-2.3.1-63a4
Cabal-syntax>         depends parsec-3.1.17.0-389e
Cabal-syntax>         depends pretty-1.1.3.6-0c70
Cabal-syntax>         depends text-2.1-c36a
Cabal-syntax>         depends time-1.12.2-d26d
Cabal-syntax>         depends transformers-0.6.1.0-c3ec
Cabal-syntax> Using Cabal-3.10.2.0 compiled by ghc-9.8
Cabal-syntax> Using compiler: ghc-9.8.1
Cabal-syntax> Using install prefix:
Cabal-syntax> /nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0
Cabal-syntax> Executables installed in:
Cabal-syntax> /nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0/bin
Cabal-syntax> Libraries installed in:
Cabal-syntax> /nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA
Cabal-syntax> Dynamic Libraries installed in:
Cabal-syntax> /nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
Cabal-syntax> Private executables installed in:
Cabal-syntax> /nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0/libexec/x86_64-linux-ghc-9.8.1/Cabal-syntax-3.12.1.0
Cabal-syntax> Data files installed in:
Cabal-syntax> /nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0/share/x86_64-linux-ghc-9.8.1/Cabal-syntax-3.12.1.0
Cabal-syntax> Documentation installed in:
Cabal-syntax> /nix/store/px1i8v7rxcyjqmckridiwqgca8a9hsd7-Cabal-syntax-3.12.1.0-doc/share/doc/Cabal-syntax-3.12.1.0
Cabal-syntax> Configuration files installed in:
Cabal-syntax> /nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0/etc
Cabal-syntax> Using alex version 3.5.3.0 found on system at:
Cabal-syntax> /nix/store/whdwmjaiqdrd3y3pms6a2p80i6ai01yi-alex-3.5.3.0/bin/alex
Cabal-syntax> Using ar found on system at:
Cabal-syntax> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
Cabal-syntax> No c2hs found
Cabal-syntax> No cpphs found
Cabal-syntax> No doctest found
Cabal-syntax> Using gcc version 14.3.0 given by user at:
Cabal-syntax> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
Cabal-syntax> Using ghc version 9.8.1 found on system at:
Cabal-syntax> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
Cabal-syntax> Using ghc-pkg version 9.8.1 found on system at:
Cabal-syntax> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
Cabal-syntax> No ghcjs found
Cabal-syntax> No ghcjs-pkg found
Cabal-syntax> No greencard found
Cabal-syntax> Using haddock version 2.30.0 found on system at:
Cabal-syntax> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
Cabal-syntax> No happy found
Cabal-syntax> Using haskell-suite found on system at: haskell-suite-dummy-location
Cabal-syntax> Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
Cabal-syntax> No hmake found
Cabal-syntax> Using hpc version 0.69 found on system at:
Cabal-syntax> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
Cabal-syntax> Using hsc2hs version 0.68.10 found on system at:
Cabal-syntax> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
Cabal-syntax> Using hscolour version 1.25 found on system at:
Cabal-syntax> /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
Cabal-syntax> No jhc found
Cabal-syntax> Using ld found on system at:
Cabal-syntax> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
Cabal-syntax> No pkg-config found
Cabal-syntax> Using runghc version 9.8.1 found on system at:
Cabal-syntax> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
Cabal-syntax> Using strip version 2.44 found on system at:
Cabal-syntax> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
Cabal-syntax> Using tar found on system at:
Cabal-syntax> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
Cabal-syntax> No uhc found
Cabal-syntax> Running phase: buildPhase
Cabal-syntax> Preprocessing library for Cabal-syntax-3.12.1.0..
Cabal-syntax> Building library for Cabal-syntax-3.12.1.0..
copying path '/nix/store/sb3ylvxk1jvxqwqhslywdassijps9p3y-floskell-0.11.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/zy38m8wznzsfl1g3fkh2vyaa5whk9sx8-cabal-add-0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/ha48cn9rvx020w7dgqkyc9b4w3zichmm-yaml-0.11.11.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/s44wifbww8am1ynm1diggggmjhbpmxlg-hie-bios-0.14.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/yy4wbx1g6lpiasqdhwla12jxx5q5alv5-implicit-hie-0.1.4.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/d17k6irk68q9wrsq0z3wq6vn4v76l67n-fourmolu-0.15.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/cynycn22p3k3psq2asv48zqdh4rgh5yh-ghc-lib-parser-ex-9.8.0.2' from 'https://cache.nix-ci.com'...
copying path '/nix/store/x9l4fm23ff8h1k4h19zlqsc4ib5d8xrm-ormolu-0.7.4.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/52m7mxzb986a78zrmgjf1hb040lwlqi7-hlint-3.8' from 'https://cache.nix-ci.com'...
copying path '/nix/store/09abq6p995ykpnkq67a0rpyv2zsi0b1d-stylish-haskell-0.14.6.0' from 'https://cache.nix-ci.com'...
Cabal-syntax> [  1 of 137] Compiling Distribution.Compat.Binary ( src/Distribution/Compat/Binary.hs, dist/build/Distribution/Compat/Binary.o, dist/build/Distribution/Compat/Binary.dyn_o )
Cabal-syntax> [  2 of 137] Compiling Distribution.Compat.Exception ( src/Distribution/Compat/Exception.hs, dist/build/Distribution/Compat/Exception.o, dist/build/Distribution/Compat/Exception.dyn_o )
Cabal-syntax> [  3 of 137] Compiling Distribution.Compat.MonadFail ( src/Distribution/Compat/MonadFail.hs, dist/build/Distribution/Compat/MonadFail.o, dist/build/Distribution/Compat/MonadFail.dyn_o )
Cabal-syntax> [  4 of 137] Compiling Distribution.Compat.Newtype ( src/Distribution/Compat/Newtype.hs, dist/build/Distribution/Compat/Newtype.o, dist/build/Distribution/Compat/Newtype.dyn_o )
Cabal-syntax> [  5 of 137] Compiling Distribution.Compat.Typeable ( src/Distribution/Compat/Typeable.hs, dist/build/Distribution/Compat/Typeable.o, dist/build/Distribution/Compat/Typeable.dyn_o )
Cabal-syntax> [  6 of 137] Compiling Distribution.PackageDescription.Utils ( src/Distribution/PackageDescription/Utils.hs, dist/build/Distribution/PackageDescription/Utils.o, dist/build/Distribution/PackageDescription/Utils.dyn_o )
Cabal-syntax> [  7 of 137] Compiling Distribution.Utils.Base62 ( src/Distribution/Utils/Base62.hs, dist/build/Distribution/Utils/Base62.o, dist/build/Distribution/Utils/Base62.dyn_o )
Cabal-syntax> [  8 of 137] Compiling Distribution.Utils.MD5 ( src/Distribution/Utils/MD5.hs, dist/build/Distribution/Utils/MD5.o, dist/build/Distribution/Utils/MD5.dyn_o )
Cabal-syntax> [  9 of 137] Compiling Distribution.Utils.String ( src/Distribution/Utils/String.hs, dist/build/Distribution/Utils/String.o, dist/build/Distribution/Utils/String.dyn_o )
Cabal-syntax> [ 10 of 137] Compiling Distribution.Utils.Structured ( src/Distribution/Utils/Structured.hs, dist/build/Distribution/Utils/Structured.o, dist/build/Distribution/Utils/Structured.dyn_o )
copying path '/nix/store/ikm5wq0s27f3172bhjsd7lq74ps3vqrl-lsp-2.7.0.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/6bg8v6yx5iqgrxs17dmd2pg55ynkqq98-hls-plugin-api-2.10.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/kg3gdvcyd52qmdn3xdz5xfw19qjmalw6-lsp-test-0.17.1.1' from 'https://cache.nix-ci.com'...
copying path '/nix/store/sx29pc0ishafpy0ml6s4zdqjp8i6wh94-ghcide-2.10.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/0xfhkbmr0fnxhmsfjzjypdh96n2vny11-hls-test-utils-2.10.0.0' from 'https://cache.nix-ci.com'...
copying path '/nix/store/accvvhaqlfwvsgmhnjkmih7wlrxgjh4z-haskell-language-server-2.10.0.0' from 'https://cache.nix-ci.com'...
Cabal-syntax> [ 11 of 137] Compiling Distribution.Compat.Semigroup ( src/Distribution/Compat/Semigroup.hs, dist/build/Distribution/Compat/Semigroup.o, dist/build/Distribution/Compat/Semigroup.dyn_o )
Cabal-syntax> [ 12 of 137] Compiling Distribution.Compat.NonEmptySet ( src/Distribution/Compat/NonEmptySet.hs, dist/build/Distribution/Compat/NonEmptySet.o, dist/build/Distribution/Compat/NonEmptySet.dyn_o )
Cabal-syntax> [ 13 of 137] Compiling Distribution.Compat.Prelude ( src/Distribution/Compat/Prelude.hs, dist/build/Distribution/Compat/Prelude.o, dist/build/Distribution/Compat/Prelude.dyn_o )
Cabal-syntax> [ 14 of 137] Compiling Distribution.Utils.ShortText ( src/Distribution/Utils/ShortText.hs, dist/build/Distribution/Utils/ShortText.o, dist/build/Distribution/Utils/ShortText.dyn_o )
Cabal-syntax> [ 15 of 137] Compiling Distribution.Utils.Generic ( src/Distribution/Utils/Generic.hs, dist/build/Distribution/Utils/Generic.o, dist/build/Distribution/Utils/Generic.dyn_o )
Cabal-syntax> [ 16 of 137] Compiling Distribution.Types.Condition ( src/Distribution/Types/Condition.hs, dist/build/Distribution/Types/Condition.o, dist/build/Distribution/Types/Condition.dyn_o )
Cabal-syntax> [ 17 of 137] Compiling Distribution.Parsec.Position ( src/Distribution/Parsec/Position.hs, dist/build/Distribution/Parsec/Position.o, dist/build/Distribution/Parsec/Position.dyn_o )
Cabal-syntax> [ 18 of 137] Compiling Distribution.Parsec.Warning ( src/Distribution/Parsec/Warning.hs, dist/build/Distribution/Parsec/Warning.o, dist/build/Distribution/Parsec/Warning.dyn_o )
Cabal-syntax> [ 19 of 137] Compiling Distribution.Parsec.FieldLineStream ( src/Distribution/Parsec/FieldLineStream.hs, dist/build/Distribution/Parsec/FieldLineStream.o, dist/build/Distribution/Parsec/FieldLineStream.dyn_o )
Cabal-syntax> [ 20 of 137] Compiling Distribution.Parsec.Error ( src/Distribution/Parsec/Error.hs, dist/build/Distribution/Parsec/Error.o, dist/build/Distribution/Parsec/Error.dyn_o )
Cabal-syntax> [ 21 of 137] Compiling Distribution.PackageDescription.Quirks ( src/Distribution/PackageDescription/Quirks.hs, dist/build/Distribution/PackageDescription/Quirks.o, dist/build/Distribution/PackageDescription/Quirks.dyn_o )
Cabal-syntax> [ 22 of 137] Compiling Distribution.Fields.LexerMonad ( src/Distribution/Fields/LexerMonad.hs, dist/build/Distribution/Fields/LexerMonad.o, dist/build/Distribution/Fields/LexerMonad.dyn_o )
Cabal-syntax> [ 23 of 137] Compiling Distribution.Fields.Lexer ( dist/build/Distribution/Fields/Lexer.hs, dist/build/Distribution/Fields/Lexer.o, dist/build/Distribution/Fields/Lexer.dyn_o )
Cabal-syntax> [ 24 of 137] Compiling Distribution.Compat.Parsing ( src/Distribution/Compat/Parsing.hs, dist/build/Distribution/Compat/Parsing.o, dist/build/Distribution/Compat/Parsing.dyn_o )
Cabal-syntax> [ 25 of 137] Compiling Distribution.Compat.DList ( src/Distribution/Compat/DList.hs, dist/build/Distribution/Compat/DList.o, dist/build/Distribution/Compat/DList.dyn_o )
Cabal-syntax> [ 26 of 137] Compiling Distribution.Compat.Lens ( src/Distribution/Compat/Lens.hs, dist/build/Distribution/Compat/Lens.o, dist/build/Distribution/Compat/Lens.dyn_o )
Cabal-syntax> [ 27 of 137] Compiling Distribution.Types.CondTree ( src/Distribution/Types/CondTree.hs, dist/build/Distribution/Types/CondTree.o, dist/build/Distribution/Types/CondTree.dyn_o )
Cabal-syntax> [ 28 of 137] Compiling Distribution.Compat.CharParsing ( src/Distribution/Compat/CharParsing.hs, dist/build/Distribution/Compat/CharParsing.o, dist/build/Distribution/Compat/CharParsing.dyn_o )
Cabal-syntax> [ 29 of 137] Compiling Distribution.CabalSpecVersion ( src/Distribution/CabalSpecVersion.hs, dist/build/Distribution/CabalSpecVersion.o, dist/build/Distribution/CabalSpecVersion.dyn_o )
Cabal-syntax> [ 30 of 137] Compiling Distribution.SPDX.LicenseListVersion ( src/Distribution/SPDX/LicenseListVersion.hs, dist/build/Distribution/SPDX/LicenseListVersion.o, dist/build/Distribution/SPDX/LicenseListVersion.dyn_o )
Cabal-syntax> [ 31 of 137] Compiling Distribution.Pretty ( src/Distribution/Pretty.hs, dist/build/Distribution/Pretty.o, dist/build/Distribution/Pretty.dyn_o )
Cabal-syntax> [ 32 of 137] Compiling Distribution.Fields.Field ( src/Distribution/Fields/Field.hs, dist/build/Distribution/Fields/Field.o, dist/build/Distribution/Fields/Field.dyn_o )
Cabal-syntax> [ 33 of 137] Compiling Distribution.Fields.Parser ( src/Distribution/Fields/Parser.hs, dist/build/Distribution/Fields/Parser.o, dist/build/Distribution/Fields/Parser.dyn_o )
Cabal-syntax> [ 34 of 137] Compiling Distribution.Fields.Pretty ( src/Distribution/Fields/Pretty.hs, dist/build/Distribution/Fields/Pretty.o, dist/build/Distribution/Fields/Pretty.dyn_o )
Cabal-syntax> [ 35 of 137] Compiling Distribution.Parsec ( src/Distribution/Parsec.hs, dist/build/Distribution/Parsec.o, dist/build/Distribution/Parsec.dyn_o )
Cabal-syntax> [ 36 of 137] Compiling Distribution.Utils.Path ( src/Distribution/Utils/Path.hs, dist/build/Distribution/Utils/Path.o, dist/build/Distribution/Utils/Path.dyn_o )
Cabal-syntax> [ 37 of 137] Compiling Distribution.Types.Version ( src/Distribution/Types/Version.hs, dist/build/Distribution/Types/Version.o, dist/build/Distribution/Types/Version.dyn_o )
Cabal-syntax> [ 38 of 137] Compiling Distribution.Types.VersionRange.Internal ( src/Distribution/Types/VersionRange/Internal.hs, dist/build/Distribution/Types/VersionRange/Internal.o, dist/build/Distribution/Types/VersionRange/Internal.dyn_o )
Cabal-syntax> [ 39 of 137] Compiling Distribution.Types.VersionInterval.Legacy ( src/Distribution/Types/VersionInterval/Legacy.hs, dist/build/Distribution/Types/VersionInterval/Legacy.o, dist/build/Distribution/Types/VersionInterval/Legacy.dyn_o )
Cabal-syntax> [ 40 of 137] Compiling Distribution.Types.VersionInterval ( src/Distribution/Types/VersionInterval.hs, dist/build/Distribution/Types/VersionInterval.o, dist/build/Distribution/Types/VersionInterval.dyn_o )
Cabal-syntax> [ 41 of 137] Compiling Distribution.Types.VersionRange ( src/Distribution/Types/VersionRange.hs, dist/build/Distribution/Types/VersionRange.o, dist/build/Distribution/Types/VersionRange.dyn_o )
Cabal-syntax> [ 42 of 137] Compiling Distribution.Types.SourceRepo ( src/Distribution/Types/SourceRepo.hs, dist/build/Distribution/Types/SourceRepo.o, dist/build/Distribution/Types/SourceRepo.dyn_o )
Cabal-syntax> [ 43 of 137] Compiling Distribution.Types.SourceRepo.Lens ( src/Distribution/Types/SourceRepo/Lens.hs, dist/build/Distribution/Types/SourceRepo/Lens.o, dist/build/Distribution/Types/SourceRepo/Lens.dyn_o )
Cabal-syntax> [ 44 of 137] Compiling Distribution.Types.PkgconfigVersion ( src/Distribution/Types/PkgconfigVersion.hs, dist/build/Distribution/Types/PkgconfigVersion.o, dist/build/Distribution/Types/PkgconfigVersion.dyn_o )
Cabal-syntax> [ 45 of 137] Compiling Distribution.Types.PkgconfigVersionRange ( src/Distribution/Types/PkgconfigVersionRange.hs, dist/build/Distribution/Types/PkgconfigVersionRange.o, dist/build/Distribution/Types/PkgconfigVersionRange.dyn_o )
Cabal-syntax> [ 46 of 137] Compiling Distribution.Types.PkgconfigName ( src/Distribution/Types/PkgconfigName.hs, dist/build/Distribution/Types/PkgconfigName.o, dist/build/Distribution/Types/PkgconfigName.dyn_o )
Cabal-syntax> [ 47 of 137] Compiling Distribution.Types.PkgconfigDependency ( src/Distribution/Types/PkgconfigDependency.hs, dist/build/Distribution/Types/PkgconfigDependency.o, dist/build/Distribution/Types/PkgconfigDependency.dyn_o )
Cabal-syntax> [ 48 of 137] Compiling Distribution.Types.PackageName ( src/Distribution/Types/PackageName.hs, dist/build/Distribution/Types/PackageName.o, dist/build/Distribution/Types/PackageName.dyn_o )
Cabal-syntax> [ 49 of 137] Compiling Distribution.Types.UnqualComponentName ( src/Distribution/Types/UnqualComponentName.hs, dist/build/Distribution/Types/UnqualComponentName.o, dist/build/Distribution/Types/UnqualComponentName.dyn_o )
Cabal-syntax> [ 50 of 137] Compiling Distribution.Types.LibraryVisibility ( src/Distribution/Types/LibraryVisibility.hs, dist/build/Distribution/Types/LibraryVisibility.o, dist/build/Distribution/Types/LibraryVisibility.dyn_o )
Cabal-syntax> [ 51 of 137] Compiling Distribution.Types.LibraryName ( src/Distribution/Types/LibraryName.hs, dist/build/Distribution/Types/LibraryName.o, dist/build/Distribution/Types/LibraryName.dyn_o )
Cabal-syntax> [ 52 of 137] Compiling Distribution.Types.MungedPackageName ( src/Distribution/Types/MungedPackageName.hs, dist/build/Distribution/Types/MungedPackageName.o, dist/build/Distribution/Types/MungedPackageName.dyn_o )
Cabal-syntax> [ 53 of 137] Compiling Distribution.Types.ForeignLibType ( src/Distribution/Types/ForeignLibType.hs, dist/build/Distribution/Types/ForeignLibType.o, dist/build/Distribution/Types/ForeignLibType.dyn_o )
Cabal-syntax> [ 54 of 137] Compiling Distribution.Types.ForeignLibOption ( src/Distribution/Types/ForeignLibOption.hs, dist/build/Distribution/Types/ForeignLibOption.o, dist/build/Distribution/Types/ForeignLibOption.dyn_o )
Cabal-syntax> [ 55 of 137] Compiling Distribution.Types.Flag ( src/Distribution/Types/Flag.hs, dist/build/Distribution/Types/Flag.o, dist/build/Distribution/Types/Flag.dyn_o )
Cabal-syntax> [ 56 of 137] Compiling Distribution.Types.ExecutableScope ( src/Distribution/Types/ExecutableScope.hs, dist/build/Distribution/Types/ExecutableScope.o, dist/build/Distribution/Types/ExecutableScope.dyn_o )
Cabal-syntax> [ 57 of 137] Compiling Distribution.Types.ComponentName ( src/Distribution/Types/ComponentName.hs, dist/build/Distribution/Types/ComponentName.o, dist/build/Distribution/Types/ComponentName.dyn_o )
Cabal-syntax> [ 58 of 137] Compiling Distribution.Types.ComponentId ( src/Distribution/Types/ComponentId.hs, dist/build/Distribution/Types/ComponentId.o, dist/build/Distribution/Types/ComponentId.dyn_o )
Cabal-syntax> [ 59 of 137] Compiling Distribution.Types.BuildType ( src/Distribution/Types/BuildType.hs, dist/build/Distribution/Types/BuildType.o, dist/build/Distribution/Types/BuildType.dyn_o )
Cabal-syntax> [ 60 of 137] Compiling Distribution.Types.AbiHash ( src/Distribution/Types/AbiHash.hs, dist/build/Distribution/Types/AbiHash.o, dist/build/Distribution/Types/AbiHash.dyn_o )
Cabal-syntax> [ 61 of 137] Compiling Distribution.Text ( src/Distribution/Text.hs, dist/build/Distribution/Text.o, dist/build/Distribution/Text.dyn_o )
Cabal-syntax> [ 62 of 137] Compiling Distribution.System ( src/Distribution/System.hs, dist/build/Distribution/System.o, dist/build/Distribution/System.dyn_o )
Cabal-syntax> [ 63 of 137] Compiling Distribution.SPDX.LicenseReference ( src/Distribution/SPDX/LicenseReference.hs, dist/build/Distribution/SPDX/LicenseReference.o, dist/build/Distribution/SPDX/LicenseReference.dyn_o )
Cabal-syntax> [ 64 of 137] Compiling Distribution.SPDX.LicenseId ( src/Distribution/SPDX/LicenseId.hs, dist/build/Distribution/SPDX/LicenseId.o, dist/build/Distribution/SPDX/LicenseId.dyn_o )
Cabal-syntax> [ 65 of 137] Compiling Distribution.SPDX.LicenseExceptionId ( src/Distribution/SPDX/LicenseExceptionId.hs, dist/build/Distribution/SPDX/LicenseExceptionId.o, dist/build/Distribution/SPDX/LicenseExceptionId.dyn_o )
Cabal-syntax> [ 66 of 137] Compiling Distribution.SPDX.LicenseExpression ( src/Distribution/SPDX/LicenseExpression.hs, dist/build/Distribution/SPDX/LicenseExpression.o, dist/build/Distribution/SPDX/LicenseExpression.dyn_o )
Cabal-syntax> [ 67 of 137] Compiling Distribution.SPDX.License ( src/Distribution/SPDX/License.hs, dist/build/Distribution/SPDX/License.o, dist/build/Distribution/SPDX/License.dyn_o )
Cabal-syntax> [ 68 of 137] Compiling Distribution.SPDX ( src/Distribution/SPDX.hs, dist/build/Distribution/SPDX.o, dist/build/Distribution/SPDX.dyn_o )
Cabal-syntax> [ 69 of 137] Compiling Distribution.ModuleName ( src/Distribution/ModuleName.hs, dist/build/Distribution/ModuleName.o, dist/build/Distribution/ModuleName.dyn_o )
Cabal-syntax> [ 70 of 137] Compiling Distribution.Types.ModuleRenaming ( src/Distribution/Types/ModuleRenaming.hs, dist/build/Distribution/Types/ModuleRenaming.o, dist/build/Distribution/Types/ModuleRenaming.dyn_o )
Cabal-syntax> [ 71 of 137] Compiling Distribution.Types.IncludeRenaming ( src/Distribution/Types/IncludeRenaming.hs, dist/build/Distribution/Types/IncludeRenaming.o, dist/build/Distribution/Types/IncludeRenaming.dyn_o )
Cabal-syntax> [ 72 of 137] Compiling Distribution.Types.Mixin ( src/Distribution/Types/Mixin.hs, dist/build/Distribution/Types/Mixin.o, dist/build/Distribution/Types/Mixin.dyn_o )
Cabal-syntax> [ 73 of 137] Compiling Distribution.Types.ModuleReexport ( src/Distribution/Types/ModuleReexport.hs, dist/build/Distribution/Types/ModuleReexport.o, dist/build/Distribution/Types/ModuleReexport.dyn_o )
Cabal-syntax> [ 74 of 137] Compiling Distribution.Compat.Graph ( src/Distribution/Compat/Graph.hs, dist/build/Distribution/Compat/Graph.o, dist/build/Distribution/Compat/Graph.dyn_o )
Cabal-syntax> [ 75 of 137] Compiling Distribution.Version ( src/Distribution/Version.hs, dist/build/Distribution/Version.o, dist/build/Distribution/Version.dyn_o )
Cabal-syntax> [ 76 of 137] Compiling Distribution.Types.TestType ( src/Distribution/Types/TestType.hs, dist/build/Distribution/Types/TestType.o, dist/build/Distribution/Types/TestType.dyn_o )
Cabal-syntax> [ 77 of 137] Compiling Distribution.Types.TestSuiteInterface ( src/Distribution/Types/TestSuiteInterface.hs, dist/build/Distribution/Types/TestSuiteInterface.o, dist/build/Distribution/Types/TestSuiteInterface.dyn_o )
Cabal-syntax> [ 78 of 137] Compiling Distribution.Types.PackageId ( src/Distribution/Types/PackageId.hs, dist/build/Distribution/Types/PackageId.o, dist/build/Distribution/Types/PackageId.dyn_o )
Cabal-syntax> [ 79 of 137] Compiling Distribution.Types.UnitId ( src/Distribution/Types/UnitId.hs, dist/build/Distribution/Types/UnitId.o, dist/build/Distribution/Types/UnitId.dyn_o )
Cabal-syntax> [ 80 of 137] Compiling Distribution.Types.Module ( src/Distribution/Types/Module.hs, dist/build/Distribution/Types/Module.o, dist/build/Distribution/Types/Module.dyn_o )
Cabal-syntax> [ 81 of 137] Compiling Distribution.Backpack ( src/Distribution/Backpack.hs, dist/build/Distribution/Backpack.o, dist/build/Distribution/Backpack.dyn_o )
Cabal-syntax> [ 82 of 137] Compiling Distribution.Types.ExposedModule ( src/Distribution/Types/ExposedModule.hs, dist/build/Distribution/Types/ExposedModule.o, dist/build/Distribution/Types/ExposedModule.dyn_o )
Cabal-syntax> [ 83 of 137] Compiling Distribution.Types.PackageVersionConstraint ( src/Distribution/Types/PackageVersionConstraint.hs, dist/build/Distribution/Types/PackageVersionConstraint.o, dist/build/Distribution/Types/PackageVersionConstraint.dyn_o )
Cabal-syntax> [ 84 of 137] Compiling Distribution.Types.PackageId.Lens ( src/Distribution/Types/PackageId/Lens.hs, dist/build/Distribution/Types/PackageId/Lens.o, dist/build/Distribution/Types/PackageId/Lens.dyn_o )
Cabal-syntax> [ 85 of 137] Compiling Distribution.Types.MungedPackageId ( src/Distribution/Types/MungedPackageId.hs, dist/build/Distribution/Types/MungedPackageId.o, dist/build/Distribution/Types/MungedPackageId.dyn_o )
Cabal-syntax> [ 86 of 137] Compiling Distribution.Types.LegacyExeDependency ( src/Distribution/Types/LegacyExeDependency.hs, dist/build/Distribution/Types/LegacyExeDependency.o, dist/build/Distribution/Types/LegacyExeDependency.dyn_o )
Cabal-syntax> [ 87 of 137] Compiling Distribution.Types.ExeDependency ( src/Distribution/Types/ExeDependency.hs, dist/build/Distribution/Types/ExeDependency.o, dist/build/Distribution/Types/ExeDependency.dyn_o )
Cabal-syntax> [ 88 of 137] Compiling Distribution.Types.Dependency ( src/Distribution/Types/Dependency.hs, dist/build/Distribution/Types/Dependency.o, dist/build/Distribution/Types/Dependency.dyn_o )
Cabal-syntax> [ 89 of 137] Compiling Distribution.Types.SetupBuildInfo ( src/Distribution/Types/SetupBuildInfo.hs, dist/build/Distribution/Types/SetupBuildInfo.o, dist/build/Distribution/Types/SetupBuildInfo.dyn_o )
Cabal-syntax> [ 90 of 137] Compiling Distribution.Types.SetupBuildInfo.Lens ( src/Distribution/Types/SetupBuildInfo/Lens.hs, dist/build/Distribution/Types/SetupBuildInfo/Lens.o, dist/build/Distribution/Types/SetupBuildInfo/Lens.dyn_o )
Cabal-syntax> [ 91 of 137] Compiling Distribution.Types.DependencyMap ( src/Distribution/Types/DependencyMap.hs, dist/build/Distribution/Types/DependencyMap.o, dist/build/Distribution/Types/DependencyMap.dyn_o )
Cabal-syntax> [ 92 of 137] Compiling Distribution.Types.BenchmarkType ( src/Distribution/Types/BenchmarkType.hs, dist/build/Distribution/Types/BenchmarkType.o, dist/build/Distribution/Types/BenchmarkType.dyn_o )
Cabal-syntax> [ 93 of 137] Compiling Distribution.Types.BenchmarkInterface ( src/Distribution/Types/BenchmarkInterface.hs, dist/build/Distribution/Types/BenchmarkInterface.o, dist/build/Distribution/Types/BenchmarkInterface.dyn_o )
Cabal-syntax> [ 94 of 137] Compiling Distribution.Package ( src/Distribution/Package.hs, dist/build/Distribution/Package.o, dist/build/Distribution/Package.dyn_o )
Cabal-syntax> [ 95 of 137] Compiling Distribution.Types.AbiDependency ( src/Distribution/Types/AbiDependency.hs, dist/build/Distribution/Types/AbiDependency.o, dist/build/Distribution/Types/AbiDependency.dyn_o )
Cabal-syntax> [ 96 of 137] Compiling Distribution.License ( src/Distribution/License.hs, dist/build/Distribution/License.o, dist/build/Distribution/License.dyn_o )
Cabal-syntax> [ 97 of 137] Compiling Distribution.Types.InstalledPackageInfo ( src/Distribution/Types/InstalledPackageInfo.hs, dist/build/Distribution/Types/InstalledPackageInfo.o, dist/build/Distribution/Types/InstalledPackageInfo.dyn_o )
Cabal-syntax> [ 98 of 137] Compiling Distribution.Types.InstalledPackageInfo.Lens ( src/Distribution/Types/InstalledPackageInfo/Lens.hs, dist/build/Distribution/Types/InstalledPackageInfo/Lens.o, dist/build/Distribution/Types/InstalledPackageInfo/Lens.dyn_o )
Cabal-syntax> [ 99 of 137] Compiling Distribution.Fields.ParseResult ( src/Distribution/Fields/ParseResult.hs, dist/build/Distribution/Fields/ParseResult.o, dist/build/Distribution/Fields/ParseResult.dyn_o )
Cabal-syntax> [100 of 137] Compiling Distribution.Fields ( src/Distribution/Fields.hs, dist/build/Distribution/Fields.o, dist/build/Distribution/Fields.dyn_o )
Cabal-syntax> [101 of 137] Compiling Language.Haskell.Extension ( src/Language/Haskell/Extension.hs, dist/build/Language/Haskell/Extension.o, dist/build/Language/Haskell/Extension.dyn_o )
Cabal-syntax> [102 of 137] Compiling Distribution.Compiler ( src/Distribution/Compiler.hs, dist/build/Distribution/Compiler.o, dist/build/Distribution/Compiler.dyn_o )
Cabal-syntax> [103 of 137] Compiling Distribution.Types.ConfVar ( src/Distribution/Types/ConfVar.hs, dist/build/Distribution/Types/ConfVar.o, dist/build/Distribution/Types/ConfVar.dyn_o )
Cabal-syntax> [104 of 137] Compiling Distribution.Fields.ConfVar ( src/Distribution/Fields/ConfVar.hs, dist/build/Distribution/Fields/ConfVar.o, dist/build/Distribution/Fields/ConfVar.dyn_o )
Cabal-syntax> [105 of 137] Compiling Distribution.Types.BuildInfo ( src/Distribution/Types/BuildInfo.hs, dist/build/Distribution/Types/BuildInfo.o, dist/build/Distribution/Types/BuildInfo.dyn_o )
Cabal-syntax> [106 of 137] Compiling Distribution.Types.HookedBuildInfo ( src/Distribution/Types/HookedBuildInfo.hs, dist/build/Distribution/Types/HookedBuildInfo.o, dist/build/Distribution/Types/HookedBuildInfo.dyn_o )
Cabal-syntax> [107 of 137] Compiling Distribution.Types.BuildInfo.Lens ( src/Distribution/Types/BuildInfo/Lens.hs, dist/build/Distribution/Types/BuildInfo/Lens.o, dist/build/Distribution/Types/BuildInfo/Lens.dyn_o )
Cabal-syntax> [108 of 137] Compiling Distribution.Types.TestSuite ( src/Distribution/Types/TestSuite.hs, dist/build/Distribution/Types/TestSuite.o, dist/build/Distribution/Types/TestSuite.dyn_o )
Cabal-syntax> [109 of 137] Compiling Distribution.Types.TestSuite.Lens ( src/Distribution/Types/TestSuite/Lens.hs, dist/build/Distribution/Types/TestSuite/Lens.o, dist/build/Distribution/Types/TestSuite/Lens.dyn_o )
Cabal-syntax> [110 of 137] Compiling Distribution.Types.Library ( src/Distribution/Types/Library.hs, dist/build/Distribution/Types/Library.o, dist/build/Distribution/Types/Library.dyn_o )
Cabal-syntax> [111 of 137] Compiling Distribution.Types.Library.Lens ( src/Distribution/Types/Library/Lens.hs, dist/build/Distribution/Types/Library/Lens.o, dist/build/Distribution/Types/Library/Lens.dyn_o )
Cabal-syntax> [112 of 137] Compiling Distribution.Types.ForeignLib ( src/Distribution/Types/ForeignLib.hs, dist/build/Distribution/Types/ForeignLib.o, dist/build/Distribution/Types/ForeignLib.dyn_o )
Cabal-syntax> [113 of 137] Compiling Distribution.Types.ForeignLib.Lens ( src/Distribution/Types/ForeignLib/Lens.hs, dist/build/Distribution/Types/ForeignLib/Lens.o, dist/build/Distribution/Types/ForeignLib/Lens.dyn_o )
Cabal-syntax> [114 of 137] Compiling Distribution.Types.Executable ( src/Distribution/Types/Executable.hs, dist/build/Distribution/Types/Executable.o, dist/build/Distribution/Types/Executable.dyn_o )
Cabal-syntax> [115 of 137] Compiling Distribution.Types.Executable.Lens ( src/Distribution/Types/Executable/Lens.hs, dist/build/Distribution/Types/Executable/Lens.o, dist/build/Distribution/Types/Executable/Lens.dyn_o )
Cabal-syntax> [116 of 137] Compiling Distribution.Types.Benchmark ( src/Distribution/Types/Benchmark.hs, dist/build/Distribution/Types/Benchmark.o, dist/build/Distribution/Types/Benchmark.dyn_o )
Cabal-syntax> [117 of 137] Compiling Distribution.Types.Component ( src/Distribution/Types/Component.hs, dist/build/Distribution/Types/Component.o, dist/build/Distribution/Types/Component.dyn_o )
Cabal-syntax> [118 of 137] Compiling Distribution.Types.ComponentRequestedSpec ( src/Distribution/Types/ComponentRequestedSpec.hs, dist/build/Distribution/Types/ComponentRequestedSpec.o, dist/build/Distribution/Types/ComponentRequestedSpec.dyn_o )
Cabal-syntax> [119 of 137] Compiling Distribution.Types.PackageDescription ( src/Distribution/Types/PackageDescription.hs, dist/build/Distribution/Types/PackageDescription.o, dist/build/Distribution/Types/PackageDescription.dyn_o )
Cabal-syntax> [120 of 137] Compiling Distribution.Types.GenericPackageDescription ( src/Distribution/Types/GenericPackageDescription.hs, dist/build/Distribution/Types/GenericPackageDescription.o, dist/build/Distribution/Types/GenericPackageDescription.dyn_o )
Cabal-syntax> [121 of 137] Compiling Distribution.Types.GenericPackageDescription.Lens ( src/Distribution/Types/GenericPackageDescription/Lens.hs, dist/build/Distribution/Types/GenericPackageDescription/Lens.o, dist/build/Distribution/Types/GenericPackageDescription/Lens.dyn_o )
Cabal-syntax> [122 of 137] Compiling Distribution.Types.Benchmark.Lens ( src/Distribution/Types/Benchmark/Lens.hs, dist/build/Distribution/Types/Benchmark/Lens.o, dist/build/Distribution/Types/Benchmark/Lens.dyn_o )
Cabal-syntax> [123 of 137] Compiling Distribution.Types.PackageDescription.Lens ( src/Distribution/Types/PackageDescription/Lens.hs, dist/build/Distribution/Types/PackageDescription/Lens.o, dist/build/Distribution/Types/PackageDescription/Lens.dyn_o )
Cabal-syntax> [124 of 137] Compiling Distribution.Types.Lens ( src/Distribution/Types/Lens.hs, dist/build/Distribution/Types/Lens.o, dist/build/Distribution/Types/Lens.dyn_o )
Cabal-syntax> [125 of 137] Compiling Distribution.PackageDescription ( src/Distribution/PackageDescription.hs, dist/build/Distribution/PackageDescription.o, dist/build/Distribution/PackageDescription.dyn_o )
Cabal-syntax> [126 of 137] Compiling Distribution.PackageDescription.Configuration ( src/Distribution/PackageDescription/Configuration.hs, dist/build/Distribution/PackageDescription/Configuration.o, dist/build/Distribution/PackageDescription/Configuration.dyn_o )
Cabal-syntax> [127 of 137] Compiling Distribution.FieldGrammar.Newtypes ( src/Distribution/FieldGrammar/Newtypes.hs, dist/build/Distribution/FieldGrammar/Newtypes.o, dist/build/Distribution/FieldGrammar/Newtypes.dyn_o )
Cabal-syntax> [128 of 137] Compiling Distribution.FieldGrammar.Class ( src/Distribution/FieldGrammar/Class.hs, dist/build/Distribution/FieldGrammar/Class.o, dist/build/Distribution/FieldGrammar/Class.dyn_o )
Cabal-syntax> [129 of 137] Compiling Distribution.FieldGrammar.Pretty ( src/Distribution/FieldGrammar/Pretty.hs, dist/build/Distribution/FieldGrammar/Pretty.o, dist/build/Distribution/FieldGrammar/Pretty.dyn_o )
Cabal-syntax> [130 of 137] Compiling Distribution.FieldGrammar.Parsec ( src/Distribution/FieldGrammar/Parsec.hs, dist/build/Distribution/FieldGrammar/Parsec.o, dist/build/Distribution/FieldGrammar/Parsec.dyn_o )
Cabal-syntax> [131 of 137] Compiling Distribution.FieldGrammar ( src/Distribution/FieldGrammar.hs, dist/build/Distribution/FieldGrammar.o, dist/build/Distribution/FieldGrammar.dyn_o )
Cabal-syntax> [132 of 137] Compiling Distribution.PackageDescription.FieldGrammar ( src/Distribution/PackageDescription/FieldGrammar.hs, dist/build/Distribution/PackageDescription/FieldGrammar.o, dist/build/Distribution/PackageDescription/FieldGrammar.dyn_o )
Cabal-syntax> [133 of 137] Compiling Distribution.PackageDescription.PrettyPrint ( src/Distribution/PackageDescription/PrettyPrint.hs, dist/build/Distribution/PackageDescription/PrettyPrint.o, dist/build/Distribution/PackageDescription/PrettyPrint.dyn_o )
Cabal-syntax> [134 of 137] Compiling Distribution.PackageDescription.Parsec ( src/Distribution/PackageDescription/Parsec.hs, dist/build/Distribution/PackageDescription/Parsec.o, dist/build/Distribution/PackageDescription/Parsec.dyn_o )
Cabal-syntax> [135 of 137] Compiling Distribution.FieldGrammar.FieldDescrs ( src/Distribution/FieldGrammar/FieldDescrs.hs, dist/build/Distribution/FieldGrammar/FieldDescrs.o, dist/build/Distribution/FieldGrammar/FieldDescrs.dyn_o )
Cabal-syntax> [136 of 137] Compiling Distribution.Types.InstalledPackageInfo.FieldGrammar ( src/Distribution/Types/InstalledPackageInfo/FieldGrammar.hs, dist/build/Distribution/Types/InstalledPackageInfo/FieldGrammar.o, dist/build/Distribution/Types/InstalledPackageInfo/FieldGrammar.dyn_o )
Cabal-syntax> [137 of 137] Compiling Distribution.InstalledPackageInfo ( src/Distribution/InstalledPackageInfo.hs, dist/build/Distribution/InstalledPackageInfo.o, dist/build/Distribution/InstalledPackageInfo.dyn_o )
Cabal-syntax> [  1 of 137] Compiling Distribution.Compat.Binary ( src/Distribution/Compat/Binary.hs, dist/build/Distribution/Compat/Binary.p_o )
Cabal-syntax> [  2 of 137] Compiling Distribution.Compat.Exception ( src/Distribution/Compat/Exception.hs, dist/build/Distribution/Compat/Exception.p_o )
Cabal-syntax> [  3 of 137] Compiling Distribution.Compat.MonadFail ( src/Distribution/Compat/MonadFail.hs, dist/build/Distribution/Compat/MonadFail.p_o )
Cabal-syntax> [  4 of 137] Compiling Distribution.Compat.Newtype ( src/Distribution/Compat/Newtype.hs, dist/build/Distribution/Compat/Newtype.p_o )
Cabal-syntax> [  5 of 137] Compiling Distribution.Compat.Typeable ( src/Distribution/Compat/Typeable.hs, dist/build/Distribution/Compat/Typeable.p_o )
Cabal-syntax> [  6 of 137] Compiling Distribution.PackageDescription.Utils ( src/Distribution/PackageDescription/Utils.hs, dist/build/Distribution/PackageDescription/Utils.p_o )
Cabal-syntax> [  7 of 137] Compiling Distribution.Utils.Base62 ( src/Distribution/Utils/Base62.hs, dist/build/Distribution/Utils/Base62.p_o )
Cabal-syntax> [  8 of 137] Compiling Distribution.Utils.MD5 ( src/Distribution/Utils/MD5.hs, dist/build/Distribution/Utils/MD5.p_o )
Cabal-syntax> [  9 of 137] Compiling Distribution.Utils.String ( src/Distribution/Utils/String.hs, dist/build/Distribution/Utils/String.p_o )
Cabal-syntax> [ 10 of 137] Compiling Distribution.Utils.Structured ( src/Distribution/Utils/Structured.hs, dist/build/Distribution/Utils/Structured.p_o )
Cabal-syntax> [ 11 of 137] Compiling Distribution.Compat.Semigroup ( src/Distribution/Compat/Semigroup.hs, dist/build/Distribution/Compat/Semigroup.p_o )
Cabal-syntax> [ 12 of 137] Compiling Distribution.Compat.NonEmptySet ( src/Distribution/Compat/NonEmptySet.hs, dist/build/Distribution/Compat/NonEmptySet.p_o )
Cabal-syntax> [ 13 of 137] Compiling Distribution.Compat.Prelude ( src/Distribution/Compat/Prelude.hs, dist/build/Distribution/Compat/Prelude.p_o )
Cabal-syntax> [ 14 of 137] Compiling Distribution.Utils.ShortText ( src/Distribution/Utils/ShortText.hs, dist/build/Distribution/Utils/ShortText.p_o )
Cabal-syntax> [ 15 of 137] Compiling Distribution.Utils.Generic ( src/Distribution/Utils/Generic.hs, dist/build/Distribution/Utils/Generic.p_o )
Cabal-syntax> [ 16 of 137] Compiling Distribution.Types.Condition ( src/Distribution/Types/Condition.hs, dist/build/Distribution/Types/Condition.p_o )
Cabal-syntax> [ 17 of 137] Compiling Distribution.Parsec.Position ( src/Distribution/Parsec/Position.hs, dist/build/Distribution/Parsec/Position.p_o )
Cabal-syntax> [ 18 of 137] Compiling Distribution.Parsec.Warning ( src/Distribution/Parsec/Warning.hs, dist/build/Distribution/Parsec/Warning.p_o )
Cabal-syntax> [ 19 of 137] Compiling Distribution.Parsec.FieldLineStream ( src/Distribution/Parsec/FieldLineStream.hs, dist/build/Distribution/Parsec/FieldLineStream.p_o )
Cabal-syntax> [ 20 of 137] Compiling Distribution.Parsec.Error ( src/Distribution/Parsec/Error.hs, dist/build/Distribution/Parsec/Error.p_o )
Cabal-syntax> [ 21 of 137] Compiling Distribution.PackageDescription.Quirks ( src/Distribution/PackageDescription/Quirks.hs, dist/build/Distribution/PackageDescription/Quirks.p_o )
Cabal-syntax> [ 22 of 137] Compiling Distribution.Fields.LexerMonad ( src/Distribution/Fields/LexerMonad.hs, dist/build/Distribution/Fields/LexerMonad.p_o )
Cabal-syntax> [ 23 of 137] Compiling Distribution.Fields.Lexer ( dist/build/Distribution/Fields/Lexer.hs, dist/build/Distribution/Fields/Lexer.p_o )
Cabal-syntax> [ 24 of 137] Compiling Distribution.Compat.Parsing ( src/Distribution/Compat/Parsing.hs, dist/build/Distribution/Compat/Parsing.p_o )
Cabal-syntax> [ 25 of 137] Compiling Distribution.Compat.DList ( src/Distribution/Compat/DList.hs, dist/build/Distribution/Compat/DList.p_o )
Cabal-syntax> [ 26 of 137] Compiling Distribution.Compat.Lens ( src/Distribution/Compat/Lens.hs, dist/build/Distribution/Compat/Lens.p_o )
Cabal-syntax> [ 27 of 137] Compiling Distribution.Types.CondTree ( src/Distribution/Types/CondTree.hs, dist/build/Distribution/Types/CondTree.p_o )
Cabal-syntax> [ 28 of 137] Compiling Distribution.Compat.CharParsing ( src/Distribution/Compat/CharParsing.hs, dist/build/Distribution/Compat/CharParsing.p_o )
Cabal-syntax> [ 29 of 137] Compiling Distribution.CabalSpecVersion ( src/Distribution/CabalSpecVersion.hs, dist/build/Distribution/CabalSpecVersion.p_o )
Cabal-syntax> [ 30 of 137] Compiling Distribution.SPDX.LicenseListVersion ( src/Distribution/SPDX/LicenseListVersion.hs, dist/build/Distribution/SPDX/LicenseListVersion.p_o )
Cabal-syntax> [ 31 of 137] Compiling Distribution.Pretty ( src/Distribution/Pretty.hs, dist/build/Distribution/Pretty.p_o )
Cabal-syntax> [ 32 of 137] Compiling Distribution.Fields.Field ( src/Distribution/Fields/Field.hs, dist/build/Distribution/Fields/Field.p_o )
Cabal-syntax> [ 33 of 137] Compiling Distribution.Fields.Parser ( src/Distribution/Fields/Parser.hs, dist/build/Distribution/Fields/Parser.p_o )
Cabal-syntax> [ 34 of 137] Compiling Distribution.Fields.Pretty ( src/Distribution/Fields/Pretty.hs, dist/build/Distribution/Fields/Pretty.p_o )
Cabal-syntax> [ 35 of 137] Compiling Distribution.Parsec ( src/Distribution/Parsec.hs, dist/build/Distribution/Parsec.p_o )
Cabal-syntax> [ 36 of 137] Compiling Distribution.Utils.Path ( src/Distribution/Utils/Path.hs, dist/build/Distribution/Utils/Path.p_o )
Cabal-syntax> [ 37 of 137] Compiling Distribution.Types.Version ( src/Distribution/Types/Version.hs, dist/build/Distribution/Types/Version.p_o )
Cabal-syntax> [ 38 of 137] Compiling Distribution.Types.VersionRange.Internal ( src/Distribution/Types/VersionRange/Internal.hs, dist/build/Distribution/Types/VersionRange/Internal.p_o )
Cabal-syntax> [ 39 of 137] Compiling Distribution.Types.VersionInterval.Legacy ( src/Distribution/Types/VersionInterval/Legacy.hs, dist/build/Distribution/Types/VersionInterval/Legacy.p_o )
Cabal-syntax> [ 40 of 137] Compiling Distribution.Types.VersionInterval ( src/Distribution/Types/VersionInterval.hs, dist/build/Distribution/Types/VersionInterval.p_o )
Cabal-syntax> [ 41 of 137] Compiling Distribution.Types.VersionRange ( src/Distribution/Types/VersionRange.hs, dist/build/Distribution/Types/VersionRange.p_o )
Cabal-syntax> [ 42 of 137] Compiling Distribution.Types.SourceRepo ( src/Distribution/Types/SourceRepo.hs, dist/build/Distribution/Types/SourceRepo.p_o )
Cabal-syntax> [ 43 of 137] Compiling Distribution.Types.SourceRepo.Lens ( src/Distribution/Types/SourceRepo/Lens.hs, dist/build/Distribution/Types/SourceRepo/Lens.p_o )
Cabal-syntax> [ 44 of 137] Compiling Distribution.Types.PkgconfigVersion ( src/Distribution/Types/PkgconfigVersion.hs, dist/build/Distribution/Types/PkgconfigVersion.p_o )
Cabal-syntax> [ 45 of 137] Compiling Distribution.Types.PkgconfigVersionRange ( src/Distribution/Types/PkgconfigVersionRange.hs, dist/build/Distribution/Types/PkgconfigVersionRange.p_o )
Cabal-syntax> [ 46 of 137] Compiling Distribution.Types.PkgconfigName ( src/Distribution/Types/PkgconfigName.hs, dist/build/Distribution/Types/PkgconfigName.p_o )
Cabal-syntax> [ 47 of 137] Compiling Distribution.Types.PkgconfigDependency ( src/Distribution/Types/PkgconfigDependency.hs, dist/build/Distribution/Types/PkgconfigDependency.p_o )
Cabal-syntax> [ 48 of 137] Compiling Distribution.Types.PackageName ( src/Distribution/Types/PackageName.hs, dist/build/Distribution/Types/PackageName.p_o )
Cabal-syntax> [ 49 of 137] Compiling Distribution.Types.UnqualComponentName ( src/Distribution/Types/UnqualComponentName.hs, dist/build/Distribution/Types/UnqualComponentName.p_o )
Cabal-syntax> [ 50 of 137] Compiling Distribution.Types.LibraryVisibility ( src/Distribution/Types/LibraryVisibility.hs, dist/build/Distribution/Types/LibraryVisibility.p_o )
Cabal-syntax> [ 51 of 137] Compiling Distribution.Types.LibraryName ( src/Distribution/Types/LibraryName.hs, dist/build/Distribution/Types/LibraryName.p_o )
Cabal-syntax> [ 52 of 137] Compiling Distribution.Types.MungedPackageName ( src/Distribution/Types/MungedPackageName.hs, dist/build/Distribution/Types/MungedPackageName.p_o )
Cabal-syntax> [ 53 of 137] Compiling Distribution.Types.ForeignLibType ( src/Distribution/Types/ForeignLibType.hs, dist/build/Distribution/Types/ForeignLibType.p_o )
Cabal-syntax> [ 54 of 137] Compiling Distribution.Types.ForeignLibOption ( src/Distribution/Types/ForeignLibOption.hs, dist/build/Distribution/Types/ForeignLibOption.p_o )
Cabal-syntax> [ 55 of 137] Compiling Distribution.Types.Flag ( src/Distribution/Types/Flag.hs, dist/build/Distribution/Types/Flag.p_o )
Cabal-syntax> [ 56 of 137] Compiling Distribution.Types.ExecutableScope ( src/Distribution/Types/ExecutableScope.hs, dist/build/Distribution/Types/ExecutableScope.p_o )
Cabal-syntax> [ 57 of 137] Compiling Distribution.Types.ComponentName ( src/Distribution/Types/ComponentName.hs, dist/build/Distribution/Types/ComponentName.p_o )
Cabal-syntax> [ 58 of 137] Compiling Distribution.Types.ComponentId ( src/Distribution/Types/ComponentId.hs, dist/build/Distribution/Types/ComponentId.p_o )
Cabal-syntax> [ 59 of 137] Compiling Distribution.Types.BuildType ( src/Distribution/Types/BuildType.hs, dist/build/Distribution/Types/BuildType.p_o )
Cabal-syntax> [ 60 of 137] Compiling Distribution.Types.AbiHash ( src/Distribution/Types/AbiHash.hs, dist/build/Distribution/Types/AbiHash.p_o )
Cabal-syntax> [ 61 of 137] Compiling Distribution.Text ( src/Distribution/Text.hs, dist/build/Distribution/Text.p_o )
Cabal-syntax> [ 62 of 137] Compiling Distribution.System ( src/Distribution/System.hs, dist/build/Distribution/System.p_o )
Cabal-syntax> [ 63 of 137] Compiling Distribution.SPDX.LicenseReference ( src/Distribution/SPDX/LicenseReference.hs, dist/build/Distribution/SPDX/LicenseReference.p_o )
Cabal-syntax> [ 64 of 137] Compiling Distribution.SPDX.LicenseId ( src/Distribution/SPDX/LicenseId.hs, dist/build/Distribution/SPDX/LicenseId.p_o )
Cabal-syntax> [ 65 of 137] Compiling Distribution.SPDX.LicenseExceptionId ( src/Distribution/SPDX/LicenseExceptionId.hs, dist/build/Distribution/SPDX/LicenseExceptionId.p_o )
Cabal-syntax> [ 66 of 137] Compiling Distribution.SPDX.LicenseExpression ( src/Distribution/SPDX/LicenseExpression.hs, dist/build/Distribution/SPDX/LicenseExpression.p_o )
Cabal-syntax> [ 67 of 137] Compiling Distribution.SPDX.License ( src/Distribution/SPDX/License.hs, dist/build/Distribution/SPDX/License.p_o )
Cabal-syntax> [ 68 of 137] Compiling Distribution.SPDX ( src/Distribution/SPDX.hs, dist/build/Distribution/SPDX.p_o )
Cabal-syntax> [ 69 of 137] Compiling Distribution.ModuleName ( src/Distribution/ModuleName.hs, dist/build/Distribution/ModuleName.p_o )
Cabal-syntax> [ 70 of 137] Compiling Distribution.Types.ModuleRenaming ( src/Distribution/Types/ModuleRenaming.hs, dist/build/Distribution/Types/ModuleRenaming.p_o )
Cabal-syntax> [ 71 of 137] Compiling Distribution.Types.IncludeRenaming ( src/Distribution/Types/IncludeRenaming.hs, dist/build/Distribution/Types/IncludeRenaming.p_o )
Cabal-syntax> [ 72 of 137] Compiling Distribution.Types.Mixin ( src/Distribution/Types/Mixin.hs, dist/build/Distribution/Types/Mixin.p_o )
Cabal-syntax> [ 73 of 137] Compiling Distribution.Types.ModuleReexport ( src/Distribution/Types/ModuleReexport.hs, dist/build/Distribution/Types/ModuleReexport.p_o )
Cabal-syntax> [ 74 of 137] Compiling Distribution.Compat.Graph ( src/Distribution/Compat/Graph.hs, dist/build/Distribution/Compat/Graph.p_o )
Cabal-syntax> [ 75 of 137] Compiling Distribution.Version ( src/Distribution/Version.hs, dist/build/Distribution/Version.p_o )
Cabal-syntax> [ 76 of 137] Compiling Distribution.Types.TestType ( src/Distribution/Types/TestType.hs, dist/build/Distribution/Types/TestType.p_o )
Cabal-syntax> [ 77 of 137] Compiling Distribution.Types.TestSuiteInterface ( src/Distribution/Types/TestSuiteInterface.hs, dist/build/Distribution/Types/TestSuiteInterface.p_o )
Cabal-syntax> [ 78 of 137] Compiling Distribution.Types.PackageId ( src/Distribution/Types/PackageId.hs, dist/build/Distribution/Types/PackageId.p_o )
Cabal-syntax> [ 79 of 137] Compiling Distribution.Types.UnitId ( src/Distribution/Types/UnitId.hs, dist/build/Distribution/Types/UnitId.p_o )
Cabal-syntax> [ 80 of 137] Compiling Distribution.Types.Module ( src/Distribution/Types/Module.hs, dist/build/Distribution/Types/Module.p_o )
Cabal-syntax> [ 81 of 137] Compiling Distribution.Backpack ( src/Distribution/Backpack.hs, dist/build/Distribution/Backpack.p_o )
Cabal-syntax> [ 82 of 137] Compiling Distribution.Types.ExposedModule ( src/Distribution/Types/ExposedModule.hs, dist/build/Distribution/Types/ExposedModule.p_o )
Cabal-syntax> [ 83 of 137] Compiling Distribution.Types.PackageVersionConstraint ( src/Distribution/Types/PackageVersionConstraint.hs, dist/build/Distribution/Types/PackageVersionConstraint.p_o )
Cabal-syntax> [ 84 of 137] Compiling Distribution.Types.PackageId.Lens ( src/Distribution/Types/PackageId/Lens.hs, dist/build/Distribution/Types/PackageId/Lens.p_o )
Cabal-syntax> [ 85 of 137] Compiling Distribution.Types.MungedPackageId ( src/Distribution/Types/MungedPackageId.hs, dist/build/Distribution/Types/MungedPackageId.p_o )
Cabal-syntax> [ 86 of 137] Compiling Distribution.Types.LegacyExeDependency ( src/Distribution/Types/LegacyExeDependency.hs, dist/build/Distribution/Types/LegacyExeDependency.p_o )
Cabal-syntax> [ 87 of 137] Compiling Distribution.Types.ExeDependency ( src/Distribution/Types/ExeDependency.hs, dist/build/Distribution/Types/ExeDependency.p_o )
Cabal-syntax> [ 88 of 137] Compiling Distribution.Types.Dependency ( src/Distribution/Types/Dependency.hs, dist/build/Distribution/Types/Dependency.p_o )
Cabal-syntax> [ 89 of 137] Compiling Distribution.Types.SetupBuildInfo ( src/Distribution/Types/SetupBuildInfo.hs, dist/build/Distribution/Types/SetupBuildInfo.p_o )
Cabal-syntax> [ 90 of 137] Compiling Distribution.Types.SetupBuildInfo.Lens ( src/Distribution/Types/SetupBuildInfo/Lens.hs, dist/build/Distribution/Types/SetupBuildInfo/Lens.p_o )
Cabal-syntax> [ 91 of 137] Compiling Distribution.Types.DependencyMap ( src/Distribution/Types/DependencyMap.hs, dist/build/Distribution/Types/DependencyMap.p_o )
Cabal-syntax> [ 92 of 137] Compiling Distribution.Types.BenchmarkType ( src/Distribution/Types/BenchmarkType.hs, dist/build/Distribution/Types/BenchmarkType.p_o )
Cabal-syntax> [ 93 of 137] Compiling Distribution.Types.BenchmarkInterface ( src/Distribution/Types/BenchmarkInterface.hs, dist/build/Distribution/Types/BenchmarkInterface.p_o )
Cabal-syntax> [ 94 of 137] Compiling Distribution.Package ( src/Distribution/Package.hs, dist/build/Distribution/Package.p_o )
Cabal-syntax> [ 95 of 137] Compiling Distribution.Types.AbiDependency ( src/Distribution/Types/AbiDependency.hs, dist/build/Distribution/Types/AbiDependency.p_o )
Cabal-syntax> [ 96 of 137] Compiling Distribution.License ( src/Distribution/License.hs, dist/build/Distribution/License.p_o )
Cabal-syntax> [ 97 of 137] Compiling Distribution.Types.InstalledPackageInfo ( src/Distribution/Types/InstalledPackageInfo.hs, dist/build/Distribution/Types/InstalledPackageInfo.p_o )
Cabal-syntax> [ 98 of 137] Compiling Distribution.Types.InstalledPackageInfo.Lens ( src/Distribution/Types/InstalledPackageInfo/Lens.hs, dist/build/Distribution/Types/InstalledPackageInfo/Lens.p_o )
Cabal-syntax> [ 99 of 137] Compiling Distribution.Fields.ParseResult ( src/Distribution/Fields/ParseResult.hs, dist/build/Distribution/Fields/ParseResult.p_o )
Cabal-syntax> [100 of 137] Compiling Distribution.Fields ( src/Distribution/Fields.hs, dist/build/Distribution/Fields.p_o )
Cabal-syntax> [101 of 137] Compiling Language.Haskell.Extension ( src/Language/Haskell/Extension.hs, dist/build/Language/Haskell/Extension.p_o )
Cabal-syntax> [102 of 137] Compiling Distribution.Compiler ( src/Distribution/Compiler.hs, dist/build/Distribution/Compiler.p_o )
Cabal-syntax> [103 of 137] Compiling Distribution.Types.ConfVar ( src/Distribution/Types/ConfVar.hs, dist/build/Distribution/Types/ConfVar.p_o )
Cabal-syntax> [104 of 137] Compiling Distribution.Fields.ConfVar ( src/Distribution/Fields/ConfVar.hs, dist/build/Distribution/Fields/ConfVar.p_o )
Cabal-syntax> [105 of 137] Compiling Distribution.Types.BuildInfo ( src/Distribution/Types/BuildInfo.hs, dist/build/Distribution/Types/BuildInfo.p_o )
Cabal-syntax> [106 of 137] Compiling Distribution.Types.HookedBuildInfo ( src/Distribution/Types/HookedBuildInfo.hs, dist/build/Distribution/Types/HookedBuildInfo.p_o )
Cabal-syntax> [107 of 137] Compiling Distribution.Types.BuildInfo.Lens ( src/Distribution/Types/BuildInfo/Lens.hs, dist/build/Distribution/Types/BuildInfo/Lens.p_o )
Cabal-syntax> [108 of 137] Compiling Distribution.Types.TestSuite ( src/Distribution/Types/TestSuite.hs, dist/build/Distribution/Types/TestSuite.p_o )
Cabal-syntax> [109 of 137] Compiling Distribution.Types.TestSuite.Lens ( src/Distribution/Types/TestSuite/Lens.hs, dist/build/Distribution/Types/TestSuite/Lens.p_o )
Cabal-syntax> [110 of 137] Compiling Distribution.Types.Library ( src/Distribution/Types/Library.hs, dist/build/Distribution/Types/Library.p_o )
Cabal-syntax> [111 of 137] Compiling Distribution.Types.Library.Lens ( src/Distribution/Types/Library/Lens.hs, dist/build/Distribution/Types/Library/Lens.p_o )
Cabal-syntax> [112 of 137] Compiling Distribution.Types.ForeignLib ( src/Distribution/Types/ForeignLib.hs, dist/build/Distribution/Types/ForeignLib.p_o )
Cabal-syntax> [113 of 137] Compiling Distribution.Types.ForeignLib.Lens ( src/Distribution/Types/ForeignLib/Lens.hs, dist/build/Distribution/Types/ForeignLib/Lens.p_o )
Cabal-syntax> [114 of 137] Compiling Distribution.Types.Executable ( src/Distribution/Types/Executable.hs, dist/build/Distribution/Types/Executable.p_o )
Cabal-syntax> [115 of 137] Compiling Distribution.Types.Executable.Lens ( src/Distribution/Types/Executable/Lens.hs, dist/build/Distribution/Types/Executable/Lens.p_o )
Cabal-syntax> [116 of 137] Compiling Distribution.Types.Benchmark ( src/Distribution/Types/Benchmark.hs, dist/build/Distribution/Types/Benchmark.p_o )
Cabal-syntax> [117 of 137] Compiling Distribution.Types.Component ( src/Distribution/Types/Component.hs, dist/build/Distribution/Types/Component.p_o )
Cabal-syntax> [118 of 137] Compiling Distribution.Types.ComponentRequestedSpec ( src/Distribution/Types/ComponentRequestedSpec.hs, dist/build/Distribution/Types/ComponentRequestedSpec.p_o )
Cabal-syntax> [119 of 137] Compiling Distribution.Types.PackageDescription ( src/Distribution/Types/PackageDescription.hs, dist/build/Distribution/Types/PackageDescription.p_o )
Cabal-syntax> [120 of 137] Compiling Distribution.Types.GenericPackageDescription ( src/Distribution/Types/GenericPackageDescription.hs, dist/build/Distribution/Types/GenericPackageDescription.p_o )
Cabal-syntax> [121 of 137] Compiling Distribution.Types.GenericPackageDescription.Lens ( src/Distribution/Types/GenericPackageDescription/Lens.hs, dist/build/Distribution/Types/GenericPackageDescription/Lens.p_o )
Cabal-syntax> [122 of 137] Compiling Distribution.Types.Benchmark.Lens ( src/Distribution/Types/Benchmark/Lens.hs, dist/build/Distribution/Types/Benchmark/Lens.p_o )
Cabal-syntax> [123 of 137] Compiling Distribution.Types.PackageDescription.Lens ( src/Distribution/Types/PackageDescription/Lens.hs, dist/build/Distribution/Types/PackageDescription/Lens.p_o )
Cabal-syntax> [124 of 137] Compiling Distribution.Types.Lens ( src/Distribution/Types/Lens.hs, dist/build/Distribution/Types/Lens.p_o )
Cabal-syntax> [125 of 137] Compiling Distribution.PackageDescription ( src/Distribution/PackageDescription.hs, dist/build/Distribution/PackageDescription.p_o )
Cabal-syntax> [126 of 137] Compiling Distribution.PackageDescription.Configuration ( src/Distribution/PackageDescription/Configuration.hs, dist/build/Distribution/PackageDescription/Configuration.p_o )
Cabal-syntax> [127 of 137] Compiling Distribution.FieldGrammar.Newtypes ( src/Distribution/FieldGrammar/Newtypes.hs, dist/build/Distribution/FieldGrammar/Newtypes.p_o )
Cabal-syntax> [128 of 137] Compiling Distribution.FieldGrammar.Class ( src/Distribution/FieldGrammar/Class.hs, dist/build/Distribution/FieldGrammar/Class.p_o )
Cabal-syntax> [129 of 137] Compiling Distribution.FieldGrammar.Pretty ( src/Distribution/FieldGrammar/Pretty.hs, dist/build/Distribution/FieldGrammar/Pretty.p_o )
Cabal-syntax> [130 of 137] Compiling Distribution.FieldGrammar.Parsec ( src/Distribution/FieldGrammar/Parsec.hs, dist/build/Distribution/FieldGrammar/Parsec.p_o )
Cabal-syntax> [131 of 137] Compiling Distribution.FieldGrammar ( src/Distribution/FieldGrammar.hs, dist/build/Distribution/FieldGrammar.p_o )
Cabal-syntax> [132 of 137] Compiling Distribution.PackageDescription.FieldGrammar ( src/Distribution/PackageDescription/FieldGrammar.hs, dist/build/Distribution/PackageDescription/FieldGrammar.p_o )
Cabal-syntax> [133 of 137] Compiling Distribution.PackageDescription.PrettyPrint ( src/Distribution/PackageDescription/PrettyPrint.hs, dist/build/Distribution/PackageDescription/PrettyPrint.p_o )
Cabal-syntax> [134 of 137] Compiling Distribution.PackageDescription.Parsec ( src/Distribution/PackageDescription/Parsec.hs, dist/build/Distribution/PackageDescription/Parsec.p_o )
Cabal-syntax> [135 of 137] Compiling Distribution.FieldGrammar.FieldDescrs ( src/Distribution/FieldGrammar/FieldDescrs.hs, dist/build/Distribution/FieldGrammar/FieldDescrs.p_o )
Cabal-syntax> [136 of 137] Compiling Distribution.Types.InstalledPackageInfo.FieldGrammar ( src/Distribution/Types/InstalledPackageInfo/FieldGrammar.hs, dist/build/Distribution/Types/InstalledPackageInfo/FieldGrammar.p_o )
Cabal-syntax> [137 of 137] Compiling Distribution.InstalledPackageInfo ( src/Distribution/InstalledPackageInfo.hs, dist/build/Distribution/InstalledPackageInfo.p_o )
Cabal-syntax> buildPhase completed in 59 seconds
Cabal-syntax> Running phase: checkPhase
Cabal-syntax> Package has no test suites.
Cabal-syntax> Running phase: haddockPhase
Cabal-syntax> Preprocessing library for Cabal-syntax-3.12.1.0..
Cabal-syntax> Running Haddock on library for Cabal-syntax-3.12.1.0..
Cabal-syntax> Warning: --source-* options are ignored when --hyperlinked-source is enabled.
Cabal-syntax> [  1 of 137] Compiling Distribution.Compat.Binary ( src/Distribution/Compat/Binary.hs, nothing )
Cabal-syntax> [  2 of 137] Compiling Distribution.Compat.Exception ( src/Distribution/Compat/Exception.hs, nothing )
Cabal-syntax> [  3 of 137] Compiling Distribution.Compat.MonadFail ( src/Distribution/Compat/MonadFail.hs, nothing )
Cabal-syntax> [  4 of 137] Compiling Distribution.Compat.Newtype ( src/Distribution/Compat/Newtype.hs, nothing )
Cabal-syntax> [  5 of 137] Compiling Distribution.Compat.Typeable ( src/Distribution/Compat/Typeable.hs, nothing )
Cabal-syntax> [  6 of 137] Compiling Distribution.PackageDescription.Utils ( src/Distribution/PackageDescription/Utils.hs, nothing )
Cabal-syntax> [  7 of 137] Compiling Distribution.Utils.Base62 ( src/Distribution/Utils/Base62.hs, nothing )
Cabal-syntax> [  8 of 137] Compiling Distribution.Utils.MD5 ( src/Distribution/Utils/MD5.hs, nothing )
Cabal-syntax> [  9 of 137] Compiling Distribution.Utils.String ( src/Distribution/Utils/String.hs, nothing )
Cabal-syntax> [ 10 of 137] Compiling Distribution.Utils.Structured ( src/Distribution/Utils/Structured.hs, nothing )
Cabal-syntax> [ 11 of 137] Compiling Distribution.Compat.Semigroup ( src/Distribution/Compat/Semigroup.hs, nothing )
Cabal-syntax> [ 12 of 137] Compiling Distribution.Compat.NonEmptySet ( src/Distribution/Compat/NonEmptySet.hs, nothing )
Cabal-syntax> [ 13 of 137] Compiling Distribution.Compat.Prelude ( src/Distribution/Compat/Prelude.hs, nothing )
Cabal-syntax> [ 14 of 137] Compiling Distribution.Utils.ShortText ( src/Distribution/Utils/ShortText.hs, nothing )
Cabal-syntax> [ 15 of 137] Compiling Distribution.Utils.Generic ( src/Distribution/Utils/Generic.hs, nothing )
Cabal-syntax> [ 16 of 137] Compiling Distribution.Types.Condition ( src/Distribution/Types/Condition.hs, nothing )
Cabal-syntax> [ 17 of 137] Compiling Distribution.Parsec.Position ( src/Distribution/Parsec/Position.hs, nothing )
Cabal-syntax> [ 18 of 137] Compiling Distribution.Parsec.Warning ( src/Distribution/Parsec/Warning.hs, nothing )
Cabal-syntax> [ 19 of 137] Compiling Distribution.Parsec.FieldLineStream ( src/Distribution/Parsec/FieldLineStream.hs, nothing )
Cabal-syntax> [ 20 of 137] Compiling Distribution.Parsec.Error ( src/Distribution/Parsec/Error.hs, nothing )
Cabal-syntax> [ 21 of 137] Compiling Distribution.PackageDescription.Quirks ( src/Distribution/PackageDescription/Quirks.hs, nothing )
Cabal-syntax> [ 22 of 137] Compiling Distribution.Fields.LexerMonad ( src/Distribution/Fields/LexerMonad.hs, nothing )
Cabal-syntax> [ 23 of 137] Compiling Distribution.Fields.Lexer ( dist/build/Distribution/Fields/Lexer.hs, nothing )
Cabal-syntax> [ 24 of 137] Compiling Distribution.Compat.Parsing ( src/Distribution/Compat/Parsing.hs, nothing )
Cabal-syntax> [ 25 of 137] Compiling Distribution.Compat.DList ( src/Distribution/Compat/DList.hs, nothing )
Cabal-syntax> [ 26 of 137] Compiling Distribution.Compat.Lens ( src/Distribution/Compat/Lens.hs, nothing )
Cabal-syntax> [ 27 of 137] Compiling Distribution.Types.CondTree ( src/Distribution/Types/CondTree.hs, nothing )
Cabal-syntax> [ 28 of 137] Compiling Distribution.Compat.CharParsing ( src/Distribution/Compat/CharParsing.hs, nothing )
Cabal-syntax> [ 29 of 137] Compiling Distribution.CabalSpecVersion ( src/Distribution/CabalSpecVersion.hs, nothing )
Cabal-syntax> [ 30 of 137] Compiling Distribution.SPDX.LicenseListVersion ( src/Distribution/SPDX/LicenseListVersion.hs, nothing )
Cabal-syntax> [ 31 of 137] Compiling Distribution.Pretty ( src/Distribution/Pretty.hs, nothing )
Cabal-syntax> [ 32 of 137] Compiling Distribution.Fields.Field ( src/Distribution/Fields/Field.hs, nothing )
Cabal-syntax> [ 33 of 137] Compiling Distribution.Fields.Parser ( src/Distribution/Fields/Parser.hs, nothing )
Cabal-syntax> [ 34 of 137] Compiling Distribution.Fields.Pretty ( src/Distribution/Fields/Pretty.hs, nothing )
Cabal-syntax> [ 35 of 137] Compiling Distribution.Parsec ( src/Distribution/Parsec.hs, nothing )
Cabal-syntax> [ 36 of 137] Compiling Distribution.Utils.Path ( src/Distribution/Utils/Path.hs, nothing )
Cabal-syntax> [ 37 of 137] Compiling Distribution.Types.Version ( src/Distribution/Types/Version.hs, nothing )
Cabal-syntax> [ 38 of 137] Compiling Distribution.Types.VersionRange.Internal ( src/Distribution/Types/VersionRange/Internal.hs, nothing )
Cabal-syntax> [ 39 of 137] Compiling Distribution.Types.VersionInterval.Legacy ( src/Distribution/Types/VersionInterval/Legacy.hs, nothing )
Cabal-syntax> [ 40 of 137] Compiling Distribution.Types.VersionInterval ( src/Distribution/Types/VersionInterval.hs, nothing )
Cabal-syntax> [ 41 of 137] Compiling Distribution.Types.VersionRange ( src/Distribution/Types/VersionRange.hs, nothing )
Cabal-syntax> [ 42 of 137] Compiling Distribution.Types.SourceRepo ( src/Distribution/Types/SourceRepo.hs, nothing )
Cabal-syntax> [ 43 of 137] Compiling Distribution.Types.SourceRepo.Lens ( src/Distribution/Types/SourceRepo/Lens.hs, nothing )
Cabal-syntax> [ 44 of 137] Compiling Distribution.Types.PkgconfigVersion ( src/Distribution/Types/PkgconfigVersion.hs, nothing )
Cabal-syntax> [ 45 of 137] Compiling Distribution.Types.PkgconfigVersionRange ( src/Distribution/Types/PkgconfigVersionRange.hs, nothing )
Cabal-syntax> [ 46 of 137] Compiling Distribution.Types.PkgconfigName ( src/Distribution/Types/PkgconfigName.hs, nothing )
Cabal-syntax> [ 47 of 137] Compiling Distribution.Types.PkgconfigDependency ( src/Distribution/Types/PkgconfigDependency.hs, nothing )
Cabal-syntax> [ 48 of 137] Compiling Distribution.Types.PackageName ( src/Distribution/Types/PackageName.hs, nothing )
Cabal-syntax> [ 49 of 137] Compiling Distribution.Types.UnqualComponentName ( src/Distribution/Types/UnqualComponentName.hs, nothing )
Cabal-syntax> [ 50 of 137] Compiling Distribution.Types.LibraryVisibility ( src/Distribution/Types/LibraryVisibility.hs, nothing )
Cabal-syntax> [ 51 of 137] Compiling Distribution.Types.LibraryName ( src/Distribution/Types/LibraryName.hs, nothing )
Cabal-syntax> [ 52 of 137] Compiling Distribution.Types.MungedPackageName ( src/Distribution/Types/MungedPackageName.hs, nothing )
Cabal-syntax> [ 53 of 137] Compiling Distribution.Types.ForeignLibType ( src/Distribution/Types/ForeignLibType.hs, nothing )
Cabal-syntax> [ 54 of 137] Compiling Distribution.Types.ForeignLibOption ( src/Distribution/Types/ForeignLibOption.hs, nothing )
Cabal-syntax> [ 55 of 137] Compiling Distribution.Types.Flag ( src/Distribution/Types/Flag.hs, nothing )
Cabal-syntax> [ 56 of 137] Compiling Distribution.Types.ExecutableScope ( src/Distribution/Types/ExecutableScope.hs, nothing )
Cabal-syntax> [ 57 of 137] Compiling Distribution.Types.ComponentName ( src/Distribution/Types/ComponentName.hs, nothing )
Cabal-syntax> [ 58 of 137] Compiling Distribution.Types.ComponentId ( src/Distribution/Types/ComponentId.hs, nothing )
Cabal-syntax> [ 59 of 137] Compiling Distribution.Types.BuildType ( src/Distribution/Types/BuildType.hs, nothing )
Cabal-syntax> [ 60 of 137] Compiling Distribution.Types.AbiHash ( src/Distribution/Types/AbiHash.hs, nothing )
Cabal-syntax> [ 61 of 137] Compiling Distribution.Text ( src/Distribution/Text.hs, nothing )
Cabal-syntax> [ 62 of 137] Compiling Distribution.System ( src/Distribution/System.hs, nothing )
Cabal-syntax> [ 63 of 137] Compiling Distribution.SPDX.LicenseReference ( src/Distribution/SPDX/LicenseReference.hs, nothing )
Cabal-syntax> [ 64 of 137] Compiling Distribution.SPDX.LicenseId ( src/Distribution/SPDX/LicenseId.hs, nothing )
Cabal-syntax> [ 65 of 137] Compiling Distribution.SPDX.LicenseExceptionId ( src/Distribution/SPDX/LicenseExceptionId.hs, nothing )
Cabal-syntax> [ 66 of 137] Compiling Distribution.SPDX.LicenseExpression ( src/Distribution/SPDX/LicenseExpression.hs, nothing )
Cabal-syntax> [ 67 of 137] Compiling Distribution.SPDX.License ( src/Distribution/SPDX/License.hs, nothing )
Cabal-syntax> [ 68 of 137] Compiling Distribution.SPDX ( src/Distribution/SPDX.hs, nothing )
Cabal-syntax> [ 69 of 137] Compiling Distribution.ModuleName ( src/Distribution/ModuleName.hs, nothing )
Cabal-syntax> [ 70 of 137] Compiling Distribution.Types.ModuleRenaming ( src/Distribution/Types/ModuleRenaming.hs, nothing )
Cabal-syntax> [ 71 of 137] Compiling Distribution.Types.IncludeRenaming ( src/Distribution/Types/IncludeRenaming.hs, nothing )
Cabal-syntax> [ 72 of 137] Compiling Distribution.Types.Mixin ( src/Distribution/Types/Mixin.hs, nothing )
Cabal-syntax> [ 73 of 137] Compiling Distribution.Types.ModuleReexport ( src/Distribution/Types/ModuleReexport.hs, nothing )
Cabal-syntax> [ 74 of 137] Compiling Distribution.Compat.Graph ( src/Distribution/Compat/Graph.hs, nothing )
Cabal-syntax> [ 75 of 137] Compiling Distribution.Version ( src/Distribution/Version.hs, nothing )
Cabal-syntax> [ 76 of 137] Compiling Distribution.Types.TestType ( src/Distribution/Types/TestType.hs, nothing )
Cabal-syntax> [ 77 of 137] Compiling Distribution.Types.TestSuiteInterface ( src/Distribution/Types/TestSuiteInterface.hs, nothing )
Cabal-syntax> [ 78 of 137] Compiling Distribution.Types.PackageId ( src/Distribution/Types/PackageId.hs, nothing )
Cabal-syntax> [ 79 of 137] Compiling Distribution.Types.UnitId ( src/Distribution/Types/UnitId.hs, nothing )
Cabal-syntax> [ 80 of 137] Compiling Distribution.Types.Module ( src/Distribution/Types/Module.hs, nothing )
Cabal-syntax> [ 81 of 137] Compiling Distribution.Backpack ( src/Distribution/Backpack.hs, nothing )
Cabal-syntax> [ 82 of 137] Compiling Distribution.Types.ExposedModule ( src/Distribution/Types/ExposedModule.hs, nothing )
Cabal-syntax> [ 83 of 137] Compiling Distribution.Types.PackageVersionConstraint ( src/Distribution/Types/PackageVersionConstraint.hs, nothing )
Cabal-syntax> [ 84 of 137] Compiling Distribution.Types.PackageId.Lens ( src/Distribution/Types/PackageId/Lens.hs, nothing )
Cabal-syntax> [ 85 of 137] Compiling Distribution.Types.MungedPackageId ( src/Distribution/Types/MungedPackageId.hs, nothing )
Cabal-syntax> [ 86 of 137] Compiling Distribution.Types.LegacyExeDependency ( src/Distribution/Types/LegacyExeDependency.hs, nothing )
Cabal-syntax> [ 87 of 137] Compiling Distribution.Types.ExeDependency ( src/Distribution/Types/ExeDependency.hs, nothing )
Cabal-syntax> [ 88 of 137] Compiling Distribution.Types.Dependency ( src/Distribution/Types/Dependency.hs, nothing )
Cabal-syntax> [ 89 of 137] Compiling Distribution.Types.SetupBuildInfo ( src/Distribution/Types/SetupBuildInfo.hs, nothing )
Cabal-syntax> [ 90 of 137] Compiling Distribution.Types.SetupBuildInfo.Lens ( src/Distribution/Types/SetupBuildInfo/Lens.hs, nothing )
Cabal-syntax> [ 91 of 137] Compiling Distribution.Types.DependencyMap ( src/Distribution/Types/DependencyMap.hs, nothing )
Cabal-syntax> [ 92 of 137] Compiling Distribution.Types.BenchmarkType ( src/Distribution/Types/BenchmarkType.hs, nothing )
Cabal-syntax> [ 93 of 137] Compiling Distribution.Types.BenchmarkInterface ( src/Distribution/Types/BenchmarkInterface.hs, nothing )
Cabal-syntax> [ 94 of 137] Compiling Distribution.Package ( src/Distribution/Package.hs, nothing )
Cabal-syntax> [ 95 of 137] Compiling Distribution.Types.AbiDependency ( src/Distribution/Types/AbiDependency.hs, nothing )
Cabal-syntax> [ 96 of 137] Compiling Distribution.License ( src/Distribution/License.hs, nothing )
Cabal-syntax> [ 97 of 137] Compiling Distribution.Types.InstalledPackageInfo ( src/Distribution/Types/InstalledPackageInfo.hs, nothing )
Cabal-syntax> [ 98 of 137] Compiling Distribution.Types.InstalledPackageInfo.Lens ( src/Distribution/Types/InstalledPackageInfo/Lens.hs, nothing )
Cabal-syntax> [ 99 of 137] Compiling Distribution.Fields.ParseResult ( src/Distribution/Fields/ParseResult.hs, nothing )
Cabal-syntax> [100 of 137] Compiling Distribution.Fields ( src/Distribution/Fields.hs, nothing )
Cabal-syntax> [101 of 137] Compiling Language.Haskell.Extension ( src/Language/Haskell/Extension.hs, nothing )
Cabal-syntax> [102 of 137] Compiling Distribution.Compiler ( src/Distribution/Compiler.hs, nothing )
Cabal-syntax> [103 of 137] Compiling Distribution.Types.ConfVar ( src/Distribution/Types/ConfVar.hs, nothing )
Cabal-syntax> [104 of 137] Compiling Distribution.Fields.ConfVar ( src/Distribution/Fields/ConfVar.hs, nothing )
Cabal-syntax> [105 of 137] Compiling Distribution.Types.BuildInfo ( src/Distribution/Types/BuildInfo.hs, nothing )
Cabal-syntax> [106 of 137] Compiling Distribution.Types.HookedBuildInfo ( src/Distribution/Types/HookedBuildInfo.hs, nothing )
Cabal-syntax> [107 of 137] Compiling Distribution.Types.BuildInfo.Lens ( src/Distribution/Types/BuildInfo/Lens.hs, nothing )
Cabal-syntax> [108 of 137] Compiling Distribution.Types.TestSuite ( src/Distribution/Types/TestSuite.hs, nothing )
Cabal-syntax> [109 of 137] Compiling Distribution.Types.TestSuite.Lens ( src/Distribution/Types/TestSuite/Lens.hs, nothing )
Cabal-syntax> [110 of 137] Compiling Distribution.Types.Library ( src/Distribution/Types/Library.hs, nothing )
Cabal-syntax> [111 of 137] Compiling Distribution.Types.Library.Lens ( src/Distribution/Types/Library/Lens.hs, nothing )
Cabal-syntax> [112 of 137] Compiling Distribution.Types.ForeignLib ( src/Distribution/Types/ForeignLib.hs, nothing )
Cabal-syntax> [113 of 137] Compiling Distribution.Types.ForeignLib.Lens ( src/Distribution/Types/ForeignLib/Lens.hs, nothing )
Cabal-syntax> [114 of 137] Compiling Distribution.Types.Executable ( src/Distribution/Types/Executable.hs, nothing )
Cabal-syntax> [115 of 137] Compiling Distribution.Types.Executable.Lens ( src/Distribution/Types/Executable/Lens.hs, nothing )
Cabal-syntax> [116 of 137] Compiling Distribution.Types.Benchmark ( src/Distribution/Types/Benchmark.hs, nothing )
Cabal-syntax> [117 of 137] Compiling Distribution.Types.Component ( src/Distribution/Types/Component.hs, nothing )
Cabal-syntax> [118 of 137] Compiling Distribution.Types.ComponentRequestedSpec ( src/Distribution/Types/ComponentRequestedSpec.hs, nothing )
Cabal-syntax> [119 of 137] Compiling Distribution.Types.PackageDescription ( src/Distribution/Types/PackageDescription.hs, nothing )
Cabal-syntax> [120 of 137] Compiling Distribution.Types.GenericPackageDescription ( src/Distribution/Types/GenericPackageDescription.hs, nothing )
Cabal-syntax> [121 of 137] Compiling Distribution.Types.GenericPackageDescription.Lens ( src/Distribution/Types/GenericPackageDescription/Lens.hs, nothing )
Cabal-syntax> [122 of 137] Compiling Distribution.Types.Benchmark.Lens ( src/Distribution/Types/Benchmark/Lens.hs, nothing )
Cabal-syntax> [123 of 137] Compiling Distribution.Types.PackageDescription.Lens ( src/Distribution/Types/PackageDescription/Lens.hs, nothing )
Cabal-syntax> [124 of 137] Compiling Distribution.Types.Lens ( src/Distribution/Types/Lens.hs, nothing )
Cabal-syntax> [125 of 137] Compiling Distribution.PackageDescription ( src/Distribution/PackageDescription.hs, nothing )
Cabal-syntax> [126 of 137] Compiling Distribution.PackageDescription.Configuration ( src/Distribution/PackageDescription/Configuration.hs, nothing )
Cabal-syntax> [127 of 137] Compiling Distribution.FieldGrammar.Newtypes ( src/Distribution/FieldGrammar/Newtypes.hs, nothing )
Cabal-syntax> [128 of 137] Compiling Distribution.FieldGrammar.Class ( src/Distribution/FieldGrammar/Class.hs, nothing )
Cabal-syntax> [129 of 137] Compiling Distribution.FieldGrammar.Pretty ( src/Distribution/FieldGrammar/Pretty.hs, nothing )
Cabal-syntax> [130 of 137] Compiling Distribution.FieldGrammar.Parsec ( src/Distribution/FieldGrammar/Parsec.hs, nothing )
Cabal-syntax> [131 of 137] Compiling Distribution.FieldGrammar ( src/Distribution/FieldGrammar.hs, nothing )
Cabal-syntax> [132 of 137] Compiling Distribution.PackageDescription.FieldGrammar ( src/Distribution/PackageDescription/FieldGrammar.hs, nothing )
Cabal-syntax> [133 of 137] Compiling Distribution.PackageDescription.PrettyPrint ( src/Distribution/PackageDescription/PrettyPrint.hs, nothing )
Cabal-syntax> [134 of 137] Compiling Distribution.PackageDescription.Parsec ( src/Distribution/PackageDescription/Parsec.hs, nothing )
Cabal-syntax> [135 of 137] Compiling Distribution.FieldGrammar.FieldDescrs ( src/Distribution/FieldGrammar/FieldDescrs.hs, nothing )
Cabal-syntax> [136 of 137] Compiling Distribution.Types.InstalledPackageInfo.FieldGrammar ( src/Distribution/Types/InstalledPackageInfo/FieldGrammar.hs, nothing )
Cabal-syntax> [137 of 137] Compiling Distribution.InstalledPackageInfo ( src/Distribution/InstalledPackageInfo.hs, nothing )
Cabal-syntax> Haddock coverage:
Cabal-syntax>   50% (  2 /  4) in 'Distribution.Compat.Binary'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     decodeOrFailIO (src/Distribution/Compat/Binary.hs:20)
Cabal-syntax>   80% (  4 /  5) in 'Distribution.Compat.Exception'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>  100% (  2 /  2) in 'Distribution.Compat.MonadFail'
Cabal-syntax>  100% (  6 /  6) in 'Distribution.Compat.Newtype'
Cabal-syntax>   75% (  3 /  4) in 'Distribution.Compat.Typeable'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   33% (  1 /  3) in 'Distribution.PackageDescription.Utils'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     cabalBug (src/Distribution/PackageDescription/Utils.hs:22)
Cabal-syntax>     userBug (src/Distribution/PackageDescription/Utils.hs:19)
Cabal-syntax>  100% (  2 /  2) in 'Distribution.Utils.Base62'
Cabal-syntax>   77% (  7 /  9) in 'Distribution.Utils.MD5'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     MD5 (src/Distribution/Utils/MD5.hs:26)
Cabal-syntax> Warning: 'decodeUtf8' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   60% (  3 /  5) in 'Distribution.Utils.String'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     trim (src/Distribution/Utils/String.hs:110)
Cabal-syntax> Warning: 'Structure' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Utils/Structured.hs:138:5
Cabal-syntax>     * at src/Distribution/Utils/Structured.hs:132:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Utils/Structured.hs:132:1
Cabal-syntax>   74% ( 20 / 27) in 'Distribution.Utils.Structured'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     structuredDecodeOrFailIO (src/Distribution/Utils/Structured.hs:276)
Cabal-syntax>     MD5 (src/Distribution/Utils/MD5.hs:26)
Cabal-syntax>     containerStructure (src/Distribution/Utils/Structured.hs:322)
Cabal-syntax>     Tag (src/Distribution/Utils/Structured.hs:289)
Cabal-syntax>     TypeName (src/Distribution/Utils/Structured.hs:122)
Cabal-syntax>     ConstructorName (src/Distribution/Utils/Structured.hs:123)
Cabal-syntax>     SopStructure (src/Distribution/Utils/Structured.hs:141)
Cabal-syntax>  100% ( 10 / 10) in 'Distribution.Compat.Semigroup'
Cabal-syntax>   41% (  7 / 17) in 'Distribution.Compat.NonEmptySet'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     singleton (src/Distribution/Compat/NonEmptySet.hs:102)
Cabal-syntax>     insert (src/Distribution/Compat/NonEmptySet.hs:109)
Cabal-syntax>     delete (src/Distribution/Compat/NonEmptySet.hs:116)
Cabal-syntax>     toNonEmpty (src/Distribution/Compat/NonEmptySet.hs:130)
Cabal-syntax>     fromNonEmpty (src/Distribution/Compat/NonEmptySet.hs:127)
Cabal-syntax>     toList (src/Distribution/Compat/NonEmptySet.hs:135)
Cabal-syntax>     toSet (src/Distribution/Compat/NonEmptySet.hs:138)
Cabal-syntax>     member (src/Distribution/Compat/NonEmptySet.hs:145)
Cabal-syntax>     map (src/Distribution/Compat/NonEmptySet.hs:159)
Cabal-syntax>   96% (266 /277) in 'Distribution.Compat.Prelude'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Bool
Cabal-syntax>     Ordering
Cabal-syntax>     even
Cabal-syntax>     odd
Cabal-syntax>     foldl1 (src/Distribution/Compat/Prelude.hs:330)
Cabal-syntax>     foldr1 (src/Distribution/Compat/Prelude.hs:326)
Cabal-syntax>     trace (src/Distribution/Compat/Prelude.hs:340)
Cabal-syntax>     traceShow (src/Distribution/Compat/Prelude.hs:348)
Cabal-syntax>     traceShowId (src/Distribution/Compat/Prelude.hs:344)
Cabal-syntax>     traceM (src/Distribution/Compat/Prelude.hs:352)
Cabal-syntax>     traceShowM (src/Distribution/Compat/Prelude.hs:356)
Cabal-syntax> Warning: 'Strings' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'PackageName' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>  100% ( 12 / 12) in 'Distribution.Utils.ShortText'
Cabal-syntax> Warning: 'ByteString' is ambiguous. It is defined
Cabal-syntax>     * in ‘Data.ByteString.Internal.Type’
Cabal-syntax>     * in ‘Data.ByteString.Lazy.Internal’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined in ‘Data.ByteString.Lazy.Internal’
Cabal-syntax> Warning: 'readFile' is ambiguous. It is defined
Cabal-syntax>     * in ‘System.IO’
Cabal-syntax>     * in ‘Data.ByteString’
Cabal-syntax>     * in ‘Data.ByteString.Lazy’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined in ‘Data.ByteString.Lazy’
Cabal-syntax> Warning: 'head' is ambiguous. It is defined
Cabal-syntax>     * in ‘Data.List.NonEmpty’
Cabal-syntax>     * in ‘Data.ByteString’
Cabal-syntax>     * in ‘Data.ByteString.Lazy’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined in ‘Data.ByteString.Lazy’
Cabal-syntax> Warning: 'tail' is ambiguous. It is defined
Cabal-syntax>     * in ‘Data.List.NonEmpty’
Cabal-syntax>     * in ‘Data.ByteString’
Cabal-syntax>     * in ‘Data.ByteString.Lazy’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined in ‘Data.ByteString.Lazy’
Cabal-syntax> Warning: 'last' is ambiguous. It is defined
Cabal-syntax>     * in ‘Data.List.NonEmpty’
Cabal-syntax>     * in ‘Data.ByteString’
Cabal-syntax>     * in ‘Data.ByteString.Lazy’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined in ‘Data.ByteString.Lazy’
Cabal-syntax> Warning: 'init' is ambiguous. It is defined
Cabal-syntax>     * in ‘Data.List.NonEmpty’
Cabal-syntax>     * in ‘Data.ByteString’
Cabal-syntax>     * in ‘Data.ByteString.Lazy’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined in ‘Data.ByteString.Lazy’
Cabal-syntax> Warning: 'break' is ambiguous. It is defined
Cabal-syntax>     * in ‘GHC.List’
Cabal-syntax>     * in ‘Data.ByteString’
Cabal-syntax>     * in ‘Data.ByteString.Lazy’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined in ‘Data.ByteString.Lazy’
Cabal-syntax> Warning: 'span' is ambiguous. It is defined
Cabal-syntax>     * in ‘GHC.List’
Cabal-syntax>     * in ‘Data.ByteString’
Cabal-syntax>     * in ‘Data.ByteString.Lazy’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined in ‘Data.ByteString.Lazy’
Cabal-syntax> Warning: 'unfoldr' is ambiguous. It is defined
Cabal-syntax>     * in ‘Data.OldList’
Cabal-syntax>     * in ‘Data.ByteString’
Cabal-syntax>     * in ‘Data.ByteString.Lazy’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined in ‘Data.ByteString.Lazy’
Cabal-syntax> Warning: 'snoc' is ambiguous. It is defined
Cabal-syntax>     * in ‘Data.ByteString’
Cabal-syntax>     * in ‘Data.ByteString.Lazy’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined in ‘Data.ByteString.Lazy’
Cabal-syntax> Warning: 'cons' is ambiguous. It is defined
Cabal-syntax>     * in ‘Data.ByteString’
Cabal-syntax>     * in ‘Data.ByteString.Lazy’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined in ‘Data.ByteString.Lazy’
Cabal-syntax> Warning: 'unsnoc' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Utils/Generic.hs:511:1
Cabal-syntax>     * in ‘Data.ByteString’
Cabal-syntax>     * in ‘Data.ByteString.Lazy’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Utils/Generic.hs:511:1
Cabal-syntax>   96% ( 52 / 54) in 'Distribution.Utils.Generic'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     equating (src/Distribution/Utils/Generic.hs:414)
Cabal-syntax>     unintersperse (src/Distribution/Utils/Generic.hs:444)
Cabal-syntax>   83% (  5 /  6) in 'Distribution.Types.Condition'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   62% (  5 /  8) in 'Distribution.Parsec.Position'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     showPos (src/Distribution/Parsec/Position.hs:35)
Cabal-syntax>     zeroPos (src/Distribution/Parsec/Position.hs:38)
Cabal-syntax>   50% (  2 /  4) in 'Distribution.Parsec.Warning'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     showPWarning (src/Distribution/Parsec/Warning.hs:77)
Cabal-syntax>   40% (  2 /  5) in 'Distribution.Parsec.FieldLineStream'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     fieldLineStreamFromBS (src/Distribution/Parsec/FieldLineStream.hs:39)
Cabal-syntax>     fieldLineStreamEnd (src/Distribution/Parsec/FieldLineStream.hs:30)
Cabal-syntax>   33% (  1 /  3) in 'Distribution.Parsec.Error'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     showPError (src/Distribution/Parsec/Error.hs:21)
Cabal-syntax>  100% (  2 /  2) in 'Distribution.PackageDescription.Quirks'
Cabal-syntax>   22% (  4 / 18) in 'Distribution.Fields.LexerMonad'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     InputStream (src/Distribution/Fields/LexerMonad.hs:124)
Cabal-syntax>     LexState (src/Distribution/Fields/LexerMonad.hs:102)
Cabal-syntax>     LexResult (src/Distribution/Fields/LexerMonad.hs:61)
Cabal-syntax>     Lex (src/Distribution/Fields/LexerMonad.hs:48)
Cabal-syntax>     getPos (src/Distribution/Fields/LexerMonad.hs:158)
Cabal-syntax>     setPos (src/Distribution/Fields/LexerMonad.hs:155)
Cabal-syntax>     adjustPos (src/Distribution/Fields/LexerMonad.hs:161)
Cabal-syntax>     getInput (src/Distribution/Fields/LexerMonad.hs:164)
Cabal-syntax>     setInput (src/Distribution/Fields/LexerMonad.hs:167)
Cabal-syntax>     getStartCode (src/Distribution/Fields/LexerMonad.hs:170)
Cabal-syntax>     setStartCode (src/Distribution/Fields/LexerMonad.hs:173)
Cabal-syntax>     LexWarning (src/Distribution/Fields/LexerMonad.hs:76)
Cabal-syntax>     LexWarningType (src/Distribution/Fields/LexerMonad.hs:63)
Cabal-syntax>     toPWarnings (src/Distribution/Fields/LexerMonad.hs:83)
Cabal-syntax>   20% (  2 / 10) in 'Distribution.Fields.Lexer'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     ltest (dist/build/Distribution/Fields/Lexer.hs:546)
Cabal-syntax>     lexToken (src/Distribution/Fields/Lexer.x:209)
Cabal-syntax>     LToken (src/Distribution/Fields/Lexer.x:166)
Cabal-syntax>     bol_section (dist/build/Distribution/Fields/Lexer.hs:159)
Cabal-syntax>     in_section (dist/build/Distribution/Fields/Lexer.hs:162)
Cabal-syntax>     in_field_layout (dist/build/Distribution/Fields/Lexer.hs:161)
Cabal-syntax>     in_field_braces (dist/build/Distribution/Fields/Lexer.hs:160)
Cabal-syntax>     mkLexState (dist/build/Distribution/Fields/Lexer.hs:552)
Cabal-syntax> Warning: 'notFollowedBy' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Compat/Parsing.hs:253:3
Cabal-syntax>     * in ‘Text.Parsec.Combinator’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Compat/Parsing.hs:253:3
Cabal-syntax> Warning: 'try' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Compat/Parsing.hs:218:3
Cabal-syntax>     * in ‘Text.Parsec.Prim’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Compat/Parsing.hs:218:3
Cabal-syntax>  100% ( 23 / 23) in 'Distribution.Compat.Parsing'
Cabal-syntax> Warning: 'DList' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Compat/DList.hs:27:19
Cabal-syntax>     * at src/Distribution/Compat/DList.hs:27:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Compat/DList.hs:27:1
Cabal-syntax>   50% (  4 /  8) in 'Distribution.Compat.DList'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     runDList (src/Distribution/Compat/DList.hs:30)
Cabal-syntax>     fromList (src/Distribution/Compat/DList.hs:41)
Cabal-syntax>     toList (src/Distribution/Compat/DList.hs:44)
Cabal-syntax>     snoc (src/Distribution/Compat/DList.hs:47)
Cabal-syntax>   33% ( 16 / 48) in 'Distribution.Compat.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Lens (src/Distribution/Compat/Lens.hs:82)
Cabal-syntax>     Lens' (src/Distribution/Compat/Lens.hs:85)
Cabal-syntax>     Traversal (src/Distribution/Compat/Lens.hs:83)
Cabal-syntax>     Traversal' (src/Distribution/Compat/Lens.hs:86)
Cabal-syntax>     LensLike (src/Distribution/Compat/Lens.hs:79)
Cabal-syntax>     LensLike' (src/Distribution/Compat/Lens.hs:80)
Cabal-syntax>     Getting (src/Distribution/Compat/Lens.hs:88)
Cabal-syntax>     AGetter (src/Distribution/Compat/Lens.hs:90)
Cabal-syntax>     ASetter (src/Distribution/Compat/Lens.hs:91)
Cabal-syntax>     ALens (src/Distribution/Compat/Lens.hs:92)
Cabal-syntax>     ALens' (src/Distribution/Compat/Lens.hs:94)
Cabal-syntax>     view (src/Distribution/Compat/Lens.hs:101)
Cabal-syntax>     use (src/Distribution/Compat/Lens.hs:105)
Cabal-syntax>     set (src/Distribution/Compat/Lens.hs:121)
Cabal-syntax>     over (src/Distribution/Compat/Lens.hs:124)
Cabal-syntax>     toDListOf (src/Distribution/Compat/Lens.hs:131)
Cabal-syntax>     toListOf (src/Distribution/Compat/Lens.hs:134)
Cabal-syntax>     toSetOf (src/Distribution/Compat/Lens.hs:137)
Cabal-syntax>     cloneLens (src/Distribution/Compat/Lens.hs:234)
Cabal-syntax>     aview (src/Distribution/Compat/Lens.hs:144)
Cabal-syntax>     _1 (src/Distribution/Compat/Lens.hs:157)
Cabal-syntax>     _2 (src/Distribution/Compat/Lens.hs:160)
Cabal-syntax>     ^. (src/Distribution/Compat/Lens.hs:179)
Cabal-syntax>     .~ (src/Distribution/Compat/Lens.hs:183)
Cabal-syntax>     ?~ (src/Distribution/Compat/Lens.hs:187)
Cabal-syntax>     %~ (src/Distribution/Compat/Lens.hs:191)
Cabal-syntax>     .= (src/Distribution/Compat/Lens.hs:195)
Cabal-syntax>     ?= (src/Distribution/Compat/Lens.hs:199)
Cabal-syntax>     %= (src/Distribution/Compat/Lens.hs:203)
Cabal-syntax>     ^# (src/Distribution/Compat/Lens.hs:207)
Cabal-syntax>     #~ (src/Distribution/Compat/Lens.hs:210)
Cabal-syntax>     #%~ (src/Distribution/Compat/Lens.hs:214)
Cabal-syntax> Warning: 'CondBranch' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/CondTree.hs:80:25
Cabal-syntax>     * at src/Distribution/Types/CondTree.hs:80:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/CondTree.hs:80:1
Cabal-syntax> Warning: 'ConfVar' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'Dependency' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'BuildInfo' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'targetBuildInfo' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   61% ( 11 / 18) in 'Distribution.Types.CondTree'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     condIfThen (src/Distribution/Types/CondTree.hs:99)
Cabal-syntax>     condIfThenElse (src/Distribution/Types/CondTree.hs:102)
Cabal-syntax>     mapCondTree (src/Distribution/Types/CondTree.hs:110)
Cabal-syntax>     mapTreeConstrs (src/Distribution/Types/CondTree.hs:120)
Cabal-syntax>     mapTreeConds (src/Distribution/Types/CondTree.hs:123)
Cabal-syntax>     mapTreeData (src/Distribution/Types/CondTree.hs:126)
Cabal-syntax> Warning: 'char' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Compat/CharParsing.hs:162:3
Cabal-syntax>     * in ‘Text.Parsec.Char’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Compat/CharParsing.hs:162:3
Cabal-syntax> Warning: 'satisfy' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Compat/CharParsing.hs:154:3
Cabal-syntax>     * in ‘Text.Parsec.Char’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Compat/CharParsing.hs:154:3
Cabal-syntax> Warning: 'oneOf' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Compat/CharParsing.hs:76:1
Cabal-syntax>     * in ‘Text.Parsec.Char’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Compat/CharParsing.hs:76:1
Cabal-syntax> Warning: 'skipMany' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Compat/Parsing.hs:225:3
Cabal-syntax>     * in ‘Text.Parsec.Prim’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Compat/Parsing.hs:225:3
Cabal-syntax>   88% ( 22 / 25) in 'Distribution.Compat.CharParsing'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     satisfyRange (src/Distribution/Compat/CharParsing.hs:148)
Cabal-syntax>     integral (src/Distribution/Compat/CharParsing.hs:321)
Cabal-syntax>     skipSpaces1 (src/Distribution/Compat/CharParsing.hs:359)
Cabal-syntax>   41% (  5 / 12) in 'Distribution.CabalSpecVersion'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     cabalSpecLatest (src/Distribution/CabalSpecVersion.hs:68)
Cabal-syntax>     specHasCommonStanzas (src/Distribution/CabalSpecVersion.hs:138)
Cabal-syntax>     specHasElif (src/Distribution/CabalSpecVersion.hs:144)
Cabal-syntax>     HasElif (src/Distribution/CabalSpecVersion.hs:154)
Cabal-syntax>     HasCommonStanzas (src/Distribution/CabalSpecVersion.hs:157)
Cabal-syntax>     HasGlobstar (src/Distribution/CabalSpecVersion.hs:160)
Cabal-syntax>   33% (  1 /  3) in 'Distribution.SPDX.LicenseListVersion'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     cabalSpecVersionToSPDXListVersion (src/Distribution/SPDX/LicenseListVersion.hs:20)
Cabal-syntax>   46% (  6 / 13) in 'Distribution.Pretty'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     Pretty (src/Distribution/Pretty.hs:24)
Cabal-syntax>     prettyShow (src/Distribution/Pretty.hs:44)
Cabal-syntax>     showFilePath (src/Distribution/Pretty.hs:82)
Cabal-syntax>     showToken (src/Distribution/Pretty.hs:85)
Cabal-syntax>     showTokenStr (src/Distribution/Pretty.hs:88)
Cabal-syntax>     Separator (src/Distribution/Pretty.hs:79)
Cabal-syntax> Warning: 'Field' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:51:5
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:50:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Fields/Field.hs:50:1
Cabal-syntax> Warning: 'FieldLine' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:77:22
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:77:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Fields/Field.hs:77:1
Cabal-syntax>   75% ( 15 / 20) in 'Distribution.Fields.Field'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     fieldAnn (src/Distribution/Fields/Field.hs:64)
Cabal-syntax>     FieldName (src/Distribution/Fields/Field.hs:114)
Cabal-syntax>     mkName (src/Distribution/Fields/Field.hs:126)
Cabal-syntax>     getName (src/Distribution/Fields/Field.hs:129)
Cabal-syntax>     nameAnn (src/Distribution/Fields/Field.hs:132)
Cabal-syntax> Warning: 'LexState'' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Fields/Parser.hs:66:18
Cabal-syntax>     * at src/Distribution/Fields/Parser.hs:66:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Fields/Parser.hs:66:1
Cabal-syntax> Warning: 'LexState' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Fields/LexerMonad.hs:102:17
Cabal-syntax>     * at src/Distribution/Fields/LexerMonad.hs:102:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Fields/LexerMonad.hs:102:1
Cabal-syntax> Warning: 'Field' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:51:5
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:50:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Fields/Field.hs:50:1
Cabal-syntax> Warning: ':' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>  100% ( 10 / 10) in 'Distribution.Fields.Parser'
Cabal-syntax> Warning: 'Field' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:51:5
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:50:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Fields/Field.hs:50:1
Cabal-syntax> Warning: 'genericFromParsecField' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   81% (  9 / 11) in 'Distribution.Fields.Pretty'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     PrettyField (src/Distribution/Fields/Pretty.hs:44)
Cabal-syntax>     genericFromParsecFields (src/Distribution/Fields/Pretty.hs:184)
Cabal-syntax> Warning: 'sepBy' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Compat/Parsing.hs:100:1
Cabal-syntax>     * in ‘Text.Parsec.Combinator’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Compat/Parsing.hs:100:1
Cabal-syntax>   73% ( 31 / 42) in 'Distribution.Parsec'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     ParsecParser (src/Distribution/Parsec.hs:101)
Cabal-syntax>     showPWarning (src/Distribution/Parsec/Warning.hs:77)
Cabal-syntax>     showPError (src/Distribution/Parsec/Error.hs:21)
Cabal-syntax>     showPos (src/Distribution/Parsec/Position.hs:35)
Cabal-syntax>     zeroPos (src/Distribution/Parsec/Position.hs:38)
Cabal-syntax>     parsecFilePath (src/Distribution/Parsec.hs:284)
Cabal-syntax>     parsecCommaList (src/Distribution/Parsec.hs:302)
Cabal-syntax>     parsecCommaNonEmpty (src/Distribution/Parsec.hs:305)
Cabal-syntax>     parsecOptCommaList (src/Distribution/Parsec.hs:338)
Cabal-syntax>     parsecUnqualComponentName (src/Distribution/Parsec.hs:381)
Cabal-syntax> Warning: 'SymbolicPath' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Utils/Path.hs:41:32
Cabal-syntax>     * at src/Distribution/Utils/Path.hs:41:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Utils/Path.hs:41:1
Cabal-syntax>   54% (  6 / 11) in 'Distribution.Utils.Path'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     sameDirectory (src/Distribution/Utils/Path.hs:55)
Cabal-syntax>     PackageDir (src/Distribution/Utils/Path.hs:104)
Cabal-syntax>     SourceDir (src/Distribution/Utils/Path.hs:105)
Cabal-syntax>     LicenseFile (src/Distribution/Utils/Path.hs:107)
Cabal-syntax> Warning: 'Version' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Version.hs:42:1
Cabal-syntax>     * in ‘Data.Version’
Cabal-syntax>     * in ‘Data.Version’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Version.hs:42:1
Cabal-syntax>   83% ( 10 / 12) in 'Distribution.Types.Version'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     validVersion (src/Distribution/Types/Version.hs:261)
Cabal-syntax> Warning: 'PkgConfigVersionRange' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   95% ( 22 / 23) in 'Distribution.Types.VersionRange.Internal'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     VersionRange (src/Distribution/Types/VersionRange/Internal.hs:52)
Cabal-syntax> Warning: 'foldVersionRange' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'VersionIntervals' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/VersionInterval/Legacy.hs:98:28
Cabal-syntax>     * at src/Distribution/Types/VersionInterval/Legacy.hs:98:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/VersionInterval/Legacy.hs:98:1
Cabal-syntax>   84% ( 16 / 19) in 'Distribution.Types.VersionInterval.Legacy'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     LowerBound (src/Distribution/Types/VersionInterval/Legacy.hs:115)
Cabal-syntax>     UpperBound (src/Distribution/Types/VersionInterval/Legacy.hs:120)
Cabal-syntax>     Bound (src/Distribution/Types/VersionInterval/Legacy.hs:127)
Cabal-syntax> Warning: 'VersionIntervals' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/VersionInterval.hs:67:28
Cabal-syntax>     * at src/Distribution/Types/VersionInterval.hs:67:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/VersionInterval.hs:67:1
Cabal-syntax> Warning: 'foldVersionRange' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   71% ( 15 / 21) in 'Distribution.Types.VersionInterval'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     relaxLastInterval (src/Distribution/Types/VersionInterval.hs:334)
Cabal-syntax>     relaxHeadInterval (src/Distribution/Types/VersionInterval.hs:341)
Cabal-syntax>     VersionInterval (src/Distribution/Types/VersionInterval.hs:80)
Cabal-syntax>     LowerBound (src/Distribution/Types/VersionInterval.hs:81)
Cabal-syntax>     UpperBound (src/Distribution/Types/VersionInterval.hs:82)
Cabal-syntax>     Bound (src/Distribution/Types/VersionInterval.hs:83)
Cabal-syntax> Warning: 'VersionRangeParens' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'AnyVersion' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   89% ( 33 / 37) in 'Distribution.Types.VersionRange'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     VersionRange (src/Distribution/Types/VersionRange/Internal.hs:52)
Cabal-syntax>     isAnyVersionLight (src/Distribution/Types/VersionRange.hs:158)
Cabal-syntax>     isWildcardRange (src/Distribution/Types/VersionRange.hs:166)
Cabal-syntax> Warning: 'SourceRepo' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/SourceRepo.hs:48:19
Cabal-syntax>     * at src/Distribution/Types/SourceRepo.hs:48:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/SourceRepo.hs:48:1
Cabal-syntax> Warning: 'ReopKind' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   33% (  3 /  9) in 'Distribution.Types.SourceRepo'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     RepoType (src/Distribution/Types/SourceRepo.hs:146)
Cabal-syntax>     knownRepoTypes (src/Distribution/Types/SourceRepo.hs:156)
Cabal-syntax>     emptySourceRepo (src/Distribution/Types/SourceRepo.hs:83)
Cabal-syntax>     classifyRepoType (src/Distribution/Types/SourceRepo.hs:186)
Cabal-syntax>     classifyRepoKind (src/Distribution/Types/SourceRepo.hs:173)
Cabal-syntax> Warning: Distribution.Types.SourceRepo.Lens: Could not find documentation for exported module: Distribution.Types.SourceRepo.Lens
Cabal-syntax>   11% (  1 /  9) in 'Distribution.Types.SourceRepo.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     repoKind (src/Distribution/Types/SourceRepo/Lens.hs:14)
Cabal-syntax>     repoType (src/Distribution/Types/SourceRepo/Lens.hs:18)
Cabal-syntax>     repoLocation (src/Distribution/Types/SourceRepo/Lens.hs:22)
Cabal-syntax>     repoModule (src/Distribution/Types/SourceRepo/Lens.hs:26)
Cabal-syntax>     repoBranch (src/Distribution/Types/SourceRepo/Lens.hs:30)
Cabal-syntax>     repoTag (src/Distribution/Types/SourceRepo/Lens.hs:34)
Cabal-syntax>     repoSubdir (src/Distribution/Types/SourceRepo/Lens.hs:38)
Cabal-syntax>   66% (  2 /  3) in 'Distribution.Types.PkgconfigVersion'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   37% (  3 /  8) in 'Distribution.Types.PkgconfigVersionRange'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     anyPkgconfigVersion (src/Distribution/Types/PkgconfigVersionRange.hs:125)
Cabal-syntax>     withinPkgconfigVersionRange (src/Distribution/Types/PkgconfigVersionRange.hs:132)
Cabal-syntax>     versionToPkgconfigVersion (src/Distribution/Types/PkgconfigVersionRange.hs:148)
Cabal-syntax>     versionRangeToPkgconfigVersionRange (src/Distribution/Types/PkgconfigVersionRange.hs:151)
Cabal-syntax> Warning: 'PkgconfigName' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/PkgconfigName.hs:26:25
Cabal-syntax>     * at src/Distribution/Types/PkgconfigName.hs:26:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/PkgconfigName.hs:26:1
Cabal-syntax>   75% (  3 /  4) in 'Distribution.Types.PkgconfigName'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   50% (  1 /  2) in 'Distribution.Types.PkgconfigDependency'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'PackageName' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/PackageName.hs:29:23
Cabal-syntax>     * at src/Distribution/Types/PackageName.hs:29:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/PackageName.hs:29:1
Cabal-syntax>   83% (  5 /  6) in 'Distribution.Types.PackageName'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'ComponentName' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'ComponentId' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'UnqualComponentName' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/UnqualComponentName.hs:29:31
Cabal-syntax>     * at src/Distribution/Types/UnqualComponentName.hs:29:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/UnqualComponentName.hs:29:1
Cabal-syntax>   87% (  7 /  8) in 'Distribution.Types.UnqualComponentName'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   50% (  1 /  2) in 'Distribution.Types.LibraryVisibility'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   30% (  3 / 10) in 'Distribution.Types.LibraryName'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     LibraryName (src/Distribution/Types/LibraryName.hs:27)
Cabal-syntax>     defaultLibName (src/Distribution/Types/LibraryName.hs:56)
Cabal-syntax>     showLibraryName (src/Distribution/Types/LibraryName.hs:59)
Cabal-syntax>     libraryNameStanza (src/Distribution/Types/LibraryName.hs:63)
Cabal-syntax>     libraryNameString (src/Distribution/Types/LibraryName.hs:67)
Cabal-syntax>     parsecLibraryNameComponent (src/Distribution/Types/LibraryName.hs:46)
Cabal-syntax> Warning: 'MungedPackageId' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'UnitId' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'mkMungedPackageName' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'unMungedPackageName' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'foo' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   75% (  3 /  4) in 'Distribution.Types.MungedPackageName'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   25% (  1 /  4) in 'Distribution.Types.ForeignLibType'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     knownForeignLibTypes (src/Distribution/Types/ForeignLibType.hs:59)
Cabal-syntax>     foreignLibTypeIsShared (src/Distribution/Types/ForeignLibType.hs:65)
Cabal-syntax>    0% (  0 /  2) in 'Distribution.Types.ForeignLibOption'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     ForeignLibOption (src/Distribution/Types/ForeignLibOption.hs:18)
Cabal-syntax> Warning: 'FlagAssignment' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Flag.hs:129:26
Cabal-syntax>     * at src/Distribution/Types/Flag.hs:129:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Flag.hs:129:1
Cabal-syntax> Warning: 'FlagName' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Flag.hs:82:20
Cabal-syntax>     * at src/Distribution/Types/Flag.hs:82:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Flag.hs:82:1
Cabal-syntax> Warning: 'null' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Utils/ShortText.hs:115:1
Cabal-syntax>     * in ‘Data.Foldable’
Cabal-syntax>     * in ‘Data.Map.Internal’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Utils/ShortText.hs:115:1
Cabal-syntax>   96% ( 25 / 26) in 'Distribution.Types.Flag'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'Any' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>    0% (  0 /  2) in 'Distribution.Types.ExecutableScope'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     ExecutableScope (src/Distribution/Types/ExecutableScope.hs:18)
Cabal-syntax>   16% (  1 /  6) in 'Distribution.Types.ComponentName'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     ComponentName (src/Distribution/Types/ComponentName.hs:25)
Cabal-syntax>     showComponentName (src/Distribution/Types/ComponentName.hs:80)
Cabal-syntax>     componentNameRaw (src/Distribution/Types/ComponentName.hs:87)
Cabal-syntax>     componentNameStanza (src/Distribution/Types/ComponentName.hs:91)
Cabal-syntax> Warning: 'ComponentId' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/ComponentId.hs:34:23
Cabal-syntax>     * at src/Distribution/Types/ComponentId.hs:34:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/ComponentId.hs:34:1
Cabal-syntax> Warning: 'UnitId' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   75% (  3 /  4) in 'Distribution.Types.ComponentId'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   33% (  1 /  3) in 'Distribution.Types.BuildType'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     knownBuildTypes (src/Distribution/Types/BuildType.hs:39)
Cabal-syntax> Warning: 'AbiHash' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/AbiHash.hs:29:19
Cabal-syntax>     * at src/Distribution/Types/AbiHash.hs:29:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/AbiHash.hs:29:1
Cabal-syntax>   75% (  3 /  4) in 'Distribution.Types.AbiHash'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>    0% (  0 /  3) in 'Distribution.Text'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     display (src/Distribution/Text.hs:10)
Cabal-syntax>     simpleParse (src/Distribution/Text.hs:13)
Cabal-syntax>   55% ( 10 / 18) in 'Distribution.System'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     buildOS (src/Distribution/System.hs:176)
Cabal-syntax>     buildArch (src/Distribution/System.hs:282)
Cabal-syntax>     Platform (src/Distribution/System.hs:290)
Cabal-syntax>     platformFromTriple (src/Distribution/System.hs:336)
Cabal-syntax>     knownOSs (src/Distribution/System.hs:124)
Cabal-syntax>     knownArches (src/Distribution/System.hs:227)
Cabal-syntax>     classifyOS (src/Distribution/System.hs:166)
Cabal-syntax>     classifyArch (src/Distribution/System.hs:272)
Cabal-syntax> Warning: 'LicenseRef' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/SPDX/LicenseReference.hs:23:19
Cabal-syntax>     * at src/Distribution/SPDX/LicenseReference.hs:23:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/SPDX/LicenseReference.hs:23:1
Cabal-syntax>   83% (  5 /  6) in 'Distribution.SPDX.LicenseReference'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'License' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'BSD2' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'BSD3' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'OtherLicense' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'AllRightsReserved' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'PublicDomain' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   80% (  8 / 10) in 'Distribution.SPDX.LicenseId'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     licenseIdList (src/Distribution/SPDX/LicenseId.hs:2216)
Cabal-syntax>   66% (  4 /  6) in 'Distribution.SPDX.LicenseExceptionId'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     licenseExceptionIdList (src/Distribution/SPDX/LicenseExceptionId.hs:278)
Cabal-syntax>   50% (  2 /  4) in 'Distribution.SPDX.LicenseExpression'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     simpleLicenseExpression (src/Distribution/SPDX/LicenseExpression.hs:59)
Cabal-syntax> Warning: 'License' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/SPDX/License.hs:43:5
Cabal-syntax>     * at src/Distribution/SPDX/License.hs:39:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/SPDX/License.hs:39:1
Cabal-syntax> Warning: 'LicenseRef' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   50% (  1 /  2) in 'Distribution.SPDX.License'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   86% ( 25 / 29) in 'Distribution.SPDX'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     simpleLicenseExpression (src/Distribution/SPDX/LicenseExpression.hs:59)
Cabal-syntax>     licenseIdList (src/Distribution/SPDX/LicenseId.hs:2216)
Cabal-syntax>     licenseExceptionIdList (src/Distribution/SPDX/LicenseExceptionId.hs:278)
Cabal-syntax>     cabalSpecVersionToSPDXListVersion (src/Distribution/SPDX/LicenseListVersion.hs:20)
Cabal-syntax> Warning: 'ModuleName' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/ModuleName.hs:42:22
Cabal-syntax>     * at src/Distribution/ModuleName.hs:42:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/ModuleName.hs:42:1
Cabal-syntax>   77% (  7 /  9) in 'Distribution.ModuleName'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     fromString
Cabal-syntax>     validModuleComponent (src/Distribution/ModuleName.hs:91)
Cabal-syntax> Warning: 'ModuleRenaming' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/ModuleRenaming.hs:36:5
Cabal-syntax>     * at src/Distribution/Types/ModuleRenaming.hs:33:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/ModuleRenaming.hs:33:1
Cabal-syntax>   80% (  4 /  5) in 'Distribution.Types.ModuleRenaming'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'IncludeRenaming' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/IncludeRenaming.hs:25:24
Cabal-syntax>     * at src/Distribution/Types/IncludeRenaming.hs:25:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/IncludeRenaming.hs:25:1
Cabal-syntax>   75% (  3 /  4) in 'Distribution.Types.IncludeRenaming'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'Dependency' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'Mixin' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Mixin.hs:29:14
Cabal-syntax>     * at src/Distribution/Types/Mixin.hs:29:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Mixin.hs:29:1
Cabal-syntax>   75% (  3 /  4) in 'Distribution.Types.Mixin'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>    0% (  0 /  2) in 'Distribution.Types.ModuleReexport'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     ModuleReexport (src/Distribution/Types/ModuleReexport.hs:22)
Cabal-syntax> Warning: 'Node' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Compat/Graph.hs:200:1
Cabal-syntax>     * in ‘Data.Tree’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Compat/Graph.hs:200:1
Cabal-syntax> Warning: 'fromList' is ambiguous. It is defined
Cabal-syntax>     * in ‘Data.Map.Strict.Internal’
Cabal-syntax>     * in ‘Data.Set.Internal’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined in ‘Data.Set.Internal’
Cabal-syntax>  100% ( 42 / 42) in 'Distribution.Compat.Graph'
Cabal-syntax> Warning: 'VersionInterval' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/VersionInterval.hs:80:24
Cabal-syntax>     * at src/Distribution/Types/VersionInterval.hs:80:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/VersionInterval.hs:80:1
Cabal-syntax>   92% ( 58 / 63) in 'Distribution.Version'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     VersionRange (src/Distribution/Types/VersionRange/Internal.hs:52)
Cabal-syntax>     VersionInterval (src/Distribution/Types/VersionInterval.hs:80)
Cabal-syntax>     LowerBound (src/Distribution/Types/VersionInterval.hs:81)
Cabal-syntax>     UpperBound (src/Distribution/Types/VersionInterval.hs:82)
Cabal-syntax>     Bound (src/Distribution/Types/VersionInterval.hs:83)
Cabal-syntax>   20% (  1 /  5) in 'Distribution.Types.TestType'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     knownTestTypes (src/Distribution/Types/TestType.hs:36)
Cabal-syntax>     testTypeExe (src/Distribution/Types/TestType.hs:42)
Cabal-syntax>     testTypeLib (src/Distribution/Types/TestType.hs:45)
Cabal-syntax>   50% (  1 /  2) in 'Distribution.Types.TestSuiteInterface'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'Text' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   66% (  2 /  3) in 'Distribution.Types.PackageId'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'UnitId' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/UnitId.hs:66:18
Cabal-syntax>     * at src/Distribution/Types/UnitId.hs:66:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/UnitId.hs:66:1
Cabal-syntax> Warning: 'DefUnitId' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/UnitId.hs:120:21
Cabal-syntax>     * at src/Distribution/Types/UnitId.hs:120:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/UnitId.hs:120:1
Cabal-syntax> Warning: 'unitIdHash' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'OpenUnitId' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'display' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   70% (  7 / 10) in 'Distribution.Types.UnitId'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     mkUnitId (src/Distribution/Types/UnitId.hs:95)
Cabal-syntax>     unDefUnitId
Cabal-syntax> Warning: 'InstalledPackageInfo' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   50% (  1 /  2) in 'Distribution.Types.Module'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'Module' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Module.hs:28:5
Cabal-syntax>     * at src/Distribution/Types/Module.hs:27:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Module.hs:27:1
Cabal-syntax> Warning: 'OpenModule' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Backpack.hs:166:5
Cabal-syntax>     * at src/Distribution/Backpack.hs:165:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Backpack.hs:165:1
Cabal-syntax> Warning: 'ModuleSubst' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'ModuleVar' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'dispModSubst' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'dispModSubstEntry' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   95% ( 21 / 22) in 'Distribution.Backpack'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     unDefUnitId
Cabal-syntax>    0% (  0 /  2) in 'Distribution.Types.ExposedModule'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     ExposedModule (src/Distribution/Types/ExposedModule.hs:17)
Cabal-syntax> Warning: 'ExeDependency' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'Dependency' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'PackageVersionConstraint' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/PackageVersionConstraint.hs:28:33
Cabal-syntax>     * at src/Distribution/Types/PackageVersionConstraint.hs:28:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/PackageVersionConstraint.hs:28:1
Cabal-syntax>   75% (  3 /  4) in 'Distribution.Types.PackageVersionConstraint'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: Distribution.Types.PackageId.Lens: Could not find documentation for exported module: Distribution.Types.PackageId.Lens
Cabal-syntax>   25% (  1 /  4) in 'Distribution.Types.PackageId.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     pkgName (src/Distribution/Types/PackageId/Lens.hs:17)
Cabal-syntax>     pkgVersion (src/Distribution/Types/PackageId/Lens.hs:21)
Cabal-syntax> Warning: 'MungedPackageName' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/MungedPackageName.hs:33:26
Cabal-syntax>     * at src/Distribution/Types/MungedPackageName.hs:33:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/MungedPackageName.hs:33:1
Cabal-syntax> Warning: 'MungedPackageId' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/MungedPackageId.hs:24:24
Cabal-syntax>     * at src/Distribution/Types/MungedPackageId.hs:24:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/MungedPackageId.hs:24:1
Cabal-syntax> Warning: 'PackageName' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   33% (  1 /  3) in 'Distribution.Types.MungedPackageId'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     computeCompatPackageId (src/Distribution/Types/MungedPackageId.hs:76)
Cabal-syntax>   50% (  1 /  2) in 'Distribution.Types.LegacyExeDependency'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   33% (  1 /  3) in 'Distribution.Types.ExeDependency'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     qualifiedExeName (src/Distribution/Types/ExeDependency.hs:72)
Cabal-syntax> Warning: 'Dependency' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Dependency.hs:44:5
Cabal-syntax>     * at src/Distribution/Types/Dependency.hs:40:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Dependency.hs:40:1
Cabal-syntax> Warning: 'DependencyMap' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   50% (  4 /  8) in 'Distribution.Types.Dependency'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     depPkgName (src/Distribution/Types/Dependency.hs:51)
Cabal-syntax>     depVerRange (src/Distribution/Types/Dependency.hs:54)
Cabal-syntax>     depLibraries (src/Distribution/Types/Dependency.hs:57)
Cabal-syntax>    0% (  0 /  2) in 'Distribution.Types.SetupBuildInfo'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     SetupBuildInfo (src/Distribution/Types/SetupBuildInfo.hs:20)
Cabal-syntax> Warning: Distribution.Types.SetupBuildInfo.Lens: Could not find documentation for exported module: Distribution.Types.SetupBuildInfo.Lens
Cabal-syntax>    0% (  0 /  4) in 'Distribution.Types.SetupBuildInfo.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     SetupBuildInfo (src/Distribution/Types/SetupBuildInfo.hs:20)
Cabal-syntax>     setupDepends (src/Distribution/Types/SetupBuildInfo/Lens.hs:16)
Cabal-syntax>     defaultSetupDepends (src/Distribution/Types/SetupBuildInfo/Lens.hs:20)
Cabal-syntax>   20% (  1 /  5) in 'Distribution.Types.DependencyMap'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     toDepMap (src/Distribution/Types/DependencyMap.hs:40)
Cabal-syntax>     fromDepMap (src/Distribution/Types/DependencyMap.hs:44)
Cabal-syntax>     constrainBy (src/Distribution/Types/DependencyMap.hs:54)
Cabal-syntax>   25% (  1 /  4) in 'Distribution.Types.BenchmarkType'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     knownBenchmarkTypes (src/Distribution/Types/BenchmarkType.hs:32)
Cabal-syntax>     benchmarkTypeExe (src/Distribution/Types/BenchmarkType.hs:35)
Cabal-syntax>   50% (  1 /  2) in 'Distribution.Types.BenchmarkInterface'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'PackageIdentifier' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/PackageId.hs:25:26
Cabal-syntax>     * at src/Distribution/Types/PackageId.hs:25:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/PackageId.hs:25:1
Cabal-syntax> Warning: 'Dependency' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Dependency.hs:44:5
Cabal-syntax>     * at src/Distribution/Types/Dependency.hs:40:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Dependency.hs:40:1
Cabal-syntax> Warning: 'InstalledPackageInfo' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   70% ( 12 / 17) in 'Distribution.Package'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     packageName (src/Distribution/Package.hs:81)
Cabal-syntax>     packageVersion (src/Distribution/Package.hs:84)
Cabal-syntax>     HasMungedPackageId (src/Distribution/Package.hs:74)
Cabal-syntax>     mungedName' (src/Distribution/Package.hs:69)
Cabal-syntax>     mungedVersion' (src/Distribution/Package.hs:72)
Cabal-syntax> Warning: 'abiHash' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   50% (  1 /  2) in 'Distribution.Types.AbiDependency'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'License' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/License.hs:67:1
Cabal-syntax>     * at src/Distribution/SPDX/License.hs:43:5
Cabal-syntax>     * at src/Distribution/SPDX/License.hs:39:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/SPDX/License.hs:39:1
Cabal-syntax>  100% (  5 /  5) in 'Distribution.License'
Cabal-syntax>   28% (  2 /  7) in 'Distribution.Types.InstalledPackageInfo'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     InstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:40)
Cabal-syntax>     emptyInstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:132)
Cabal-syntax>     mungedPackageId (src/Distribution/Types/InstalledPackageInfo.hs:123)
Cabal-syntax>     ExposedModule (src/Distribution/Types/ExposedModule.hs:17)
Cabal-syntax> Warning: Distribution.Types.InstalledPackageInfo.Lens: Could not find documentation for exported module: Distribution.Types.InstalledPackageInfo.Lens
Cabal-syntax>    0% (  0 / 46) in 'Distribution.Types.InstalledPackageInfo.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     InstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:40)
Cabal-syntax>     installedUnitId (src/Distribution/Types/InstalledPackageInfo/Lens.hs:27)
Cabal-syntax>     sourcePackageId (src/Distribution/Types/InstalledPackageInfo/Lens.hs:23)
Cabal-syntax>     license (src/Distribution/Types/InstalledPackageInfo/Lens.hs:47)
Cabal-syntax>     abiHash (src/Distribution/Types/InstalledPackageInfo/Lens.hs:87)
Cabal-syntax>     sourceLibName (src/Distribution/Types/InstalledPackageInfo/Lens.hs:39)
Cabal-syntax>     installedComponentId_ (src/Distribution/Types/InstalledPackageInfo/Lens.hs:31)
Cabal-syntax>     libVisibility (src/Distribution/Types/InstalledPackageInfo/Lens.hs:195)
Cabal-syntax>     instantiatedWith (src/Distribution/Types/InstalledPackageInfo/Lens.hs:35)
Cabal-syntax>     compatPackageKey (src/Distribution/Types/InstalledPackageInfo/Lens.hs:43)
Cabal-syntax>     copyright (src/Distribution/Types/InstalledPackageInfo/Lens.hs:51)
Cabal-syntax>     maintainer (src/Distribution/Types/InstalledPackageInfo/Lens.hs:55)
Cabal-syntax>     author (src/Distribution/Types/InstalledPackageInfo/Lens.hs:59)
Cabal-syntax>     stability (src/Distribution/Types/InstalledPackageInfo/Lens.hs:63)
Cabal-syntax>     homepage (src/Distribution/Types/InstalledPackageInfo/Lens.hs:67)
Cabal-syntax>     pkgUrl (src/Distribution/Types/InstalledPackageInfo/Lens.hs:71)
Cabal-syntax>     synopsis (src/Distribution/Types/InstalledPackageInfo/Lens.hs:75)
Cabal-syntax>     description (src/Distribution/Types/InstalledPackageInfo/Lens.hs:79)
Cabal-syntax>     category (src/Distribution/Types/InstalledPackageInfo/Lens.hs:83)
Cabal-syntax>     indefinite (src/Distribution/Types/InstalledPackageInfo/Lens.hs:91)
Cabal-syntax>     exposed (src/Distribution/Types/InstalledPackageInfo/Lens.hs:95)
Cabal-syntax>     exposedModules (src/Distribution/Types/InstalledPackageInfo/Lens.hs:99)
Cabal-syntax>     hiddenModules (src/Distribution/Types/InstalledPackageInfo/Lens.hs:103)
Cabal-syntax>     trusted (src/Distribution/Types/InstalledPackageInfo/Lens.hs:107)
Cabal-syntax>     importDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:111)
Cabal-syntax>     libraryDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:115)
Cabal-syntax>     libraryDirsStatic (src/Distribution/Types/InstalledPackageInfo/Lens.hs:119)
Cabal-syntax>     libraryDynDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:123)
Cabal-syntax>     dataDir (src/Distribution/Types/InstalledPackageInfo/Lens.hs:127)
Cabal-syntax>     hsLibraries (src/Distribution/Types/InstalledPackageInfo/Lens.hs:131)
Cabal-syntax>     extraLibraries (src/Distribution/Types/InstalledPackageInfo/Lens.hs:135)
Cabal-syntax>     extraLibrariesStatic (src/Distribution/Types/InstalledPackageInfo/Lens.hs:139)
Cabal-syntax>     extraGHCiLibraries (src/Distribution/Types/InstalledPackageInfo/Lens.hs:143)
Cabal-syntax>     includeDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:147)
Cabal-syntax>     includes (src/Distribution/Types/InstalledPackageInfo/Lens.hs:151)
Cabal-syntax>     depends (src/Distribution/Types/InstalledPackageInfo/Lens.hs:155)
Cabal-syntax>     abiDepends (src/Distribution/Types/InstalledPackageInfo/Lens.hs:159)
Cabal-syntax>     ccOptions (src/Distribution/Types/InstalledPackageInfo/Lens.hs:163)
Cabal-syntax>     cxxOptions (src/Distribution/Types/InstalledPackageInfo/Lens.hs:167)
Cabal-syntax>     ldOptions (src/Distribution/Types/InstalledPackageInfo/Lens.hs:171)
Cabal-syntax>     frameworkDirs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:175)
Cabal-syntax>     frameworks (src/Distribution/Types/InstalledPackageInfo/Lens.hs:179)
Cabal-syntax>     haddockInterfaces (src/Distribution/Types/InstalledPackageInfo/Lens.hs:183)
Cabal-syntax>     haddockHTMLs (src/Distribution/Types/InstalledPackageInfo/Lens.hs:187)
Cabal-syntax>     pkgRoot (src/Distribution/Types/InstalledPackageInfo/Lens.hs:191)
Cabal-syntax>  100% ( 12 / 12) in 'Distribution.Fields.ParseResult'
Cabal-syntax>   83% ( 26 / 31) in 'Distribution.Fields'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     FieldName (src/Distribution/Fields/Field.hs:114)
Cabal-syntax>     showPWarning (src/Distribution/Parsec/Warning.hs:77)
Cabal-syntax>     showPError (src/Distribution/Parsec/Error.hs:21)
Cabal-syntax>     PrettyField (src/Distribution/Fields/Pretty.hs:44)
Cabal-syntax>     genericFromParsecFields (src/Distribution/Fields/Pretty.hs:184)
Cabal-syntax> Warning: 'IsList' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'A' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'Z' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   66% (  6 /  9) in 'Language.Haskell.Extension'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     classifyLanguage (src/Language/Haskell/Extension.hs:81)
Cabal-syntax>     classifyExtension (src/Language/Haskell/Extension.hs:585)
Cabal-syntax>     knownExtensions (src/Language/Haskell/Extension.hs:623)
Cabal-syntax> Warning: 'Compiler' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'UserHooks' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'PerCompilerFlavor' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Compiler.hs:139:28
Cabal-syntax>     * at src/Distribution/Compiler.hs:139:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Compiler.hs:139:1
Cabal-syntax>   50% (  9 / 18) in 'Distribution.Compiler'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     CompilerFlavor (src/Distribution/Compiler.hs:66)
Cabal-syntax>     buildCompilerId (src/Distribution/Compiler.hs:120)
Cabal-syntax>     buildCompilerFlavor (src/Distribution/Compiler.hs:114)
Cabal-syntax>     classifyCompilerFlavor (src/Distribution/Compiler.hs:105)
Cabal-syntax>     knownCompilerFlavors (src/Distribution/Compiler.hs:88)
Cabal-syntax>     perCompilerFlavorToList (src/Distribution/Compiler.hs:158)
Cabal-syntax>     CompilerId (src/Distribution/Compiler.hs:176)
Cabal-syntax>     AbiTag (src/Distribution/Compiler.hs:224)
Cabal-syntax>     abiTagString (src/Distribution/Compiler.hs:242)
Cabal-syntax>   50% (  1 /  2) in 'Distribution.Types.ConfVar'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   33% (  1 /  3) in 'Distribution.Fields.ConfVar'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     parseConditionConfVarFromClause (src/Distribution/Fields/ConfVar.hs:36)
Cabal-syntax> Warning: 'rts' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'Extensions' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   45% (  5 / 11) in 'Distribution.Types.BuildInfo'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     BuildInfo (src/Distribution/Types/BuildInfo.hs:32)
Cabal-syntax>     emptyBuildInfo (src/Distribution/Types/BuildInfo.hs:256)
Cabal-syntax>     hcProfOptions (src/Distribution/Types/BuildInfo.hs:290)
Cabal-syntax>     hcSharedOptions (src/Distribution/Types/BuildInfo.hs:293)
Cabal-syntax>     hcStaticOptions (src/Distribution/Types/BuildInfo.hs:296)
Cabal-syntax> Warning: 'BuildInfo' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/BuildInfo.hs:32:18
Cabal-syntax>     * at src/Distribution/Types/BuildInfo.hs:32:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/BuildInfo.hs:32:1
Cabal-syntax> Warning: 'PackageDescription' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'sanityCheckHookedBuildInfo' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'LocalBuildInfo' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'updatePackageDescription' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'localPkgDescr' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'confHook' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   33% (  1 /  3) in 'Distribution.Types.HookedBuildInfo'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     emptyHookedBuildInfo (src/Distribution/Types/HookedBuildInfo.hs:66)
Cabal-syntax> Warning: 'BuildInfo' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/BuildInfo.hs:32:18
Cabal-syntax>     * at src/Distribution/Types/BuildInfo.hs:32:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/BuildInfo.hs:32:1
Cabal-syntax>   25% (  1 /  4) in 'Distribution.Types.BuildInfo.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     BuildInfo (src/Distribution/Types/BuildInfo.hs:32)
Cabal-syntax>     HasBuildInfos (src/Distribution/Types/BuildInfo/Lens.hs:354)
Cabal-syntax>   50% (  3 /  6) in 'Distribution.Types.TestSuite'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     emptyTestSuite (src/Distribution/Types/TestSuite.hs:63)
Cabal-syntax>     testType (src/Distribution/Types/TestSuite.hs:66)
Cabal-syntax> Warning: Distribution.Types.TestSuite.Lens: Could not find documentation for exported module: Distribution.Types.TestSuite.Lens
Cabal-syntax>   20% (  1 /  5) in 'Distribution.Types.TestSuite.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     testBuildInfo (src/Distribution/Types/TestSuite/Lens.hs:26)
Cabal-syntax>     testName (src/Distribution/Types/TestSuite/Lens.hs:18)
Cabal-syntax>     testInterface (src/Distribution/Types/TestSuite/Lens.hs:22)
Cabal-syntax> Warning: 'libModules' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'addBuildableCondition' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   40% (  2 /  5) in 'Distribution.Types.Library'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     Library (src/Distribution/Types/Library.hs:22)
Cabal-syntax>     emptyLibrary (src/Distribution/Types/Library.hs:44)
Cabal-syntax> Warning: Distribution.Types.Library.Lens: Could not find documentation for exported module: Distribution.Types.Library.Lens
Cabal-syntax>    0% (  0 /  9) in 'Distribution.Types.Library.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     Library (src/Distribution/Types/Library.hs:22)
Cabal-syntax>     libName (src/Distribution/Types/Library/Lens.hs:20)
Cabal-syntax>     libBuildInfo (src/Distribution/Types/Library/Lens.hs:44)
Cabal-syntax>     libVisibility (src/Distribution/Types/Library/Lens.hs:40)
Cabal-syntax>     exposedModules (src/Distribution/Types/Library/Lens.hs:24)
Cabal-syntax>     reexportedModules (src/Distribution/Types/Library/Lens.hs:28)
Cabal-syntax>     signatures (src/Distribution/Types/Library/Lens.hs:32)
Cabal-syntax>     libExposed (src/Distribution/Types/Library/Lens.hs:36)
Cabal-syntax> Warning: 'LibVersionInfo' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/ForeignLib.hs:64:23
Cabal-syntax>     * at src/Distribution/Types/ForeignLib.hs:64:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/ForeignLib.hs:64:1
Cabal-syntax> Warning: 'String' is ambiguous. It is defined
Cabal-syntax>     * in ‘Text.Read.Lex’
Cabal-syntax>     * in ‘GHC.Base’
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined in ‘GHC.Base’
Cabal-syntax>   83% ( 10 / 12) in 'Distribution.Types.ForeignLib'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     LibVersionInfo (src/Distribution/Types/ForeignLib.hs:64)
Cabal-syntax> Warning: Distribution.Types.ForeignLib.Lens: Could not find documentation for exported module: Distribution.Types.ForeignLib.Lens
Cabal-syntax>   11% (  1 /  9) in 'Distribution.Types.ForeignLib.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     foreignLibName (src/Distribution/Types/ForeignLib/Lens.hs:20)
Cabal-syntax>     foreignLibBuildInfo (src/Distribution/Types/ForeignLib/Lens.hs:32)
Cabal-syntax>     foreignLibType (src/Distribution/Types/ForeignLib/Lens.hs:24)
Cabal-syntax>     foreignLibOptions (src/Distribution/Types/ForeignLib/Lens.hs:28)
Cabal-syntax>     foreignLibVersionInfo (src/Distribution/Types/ForeignLib/Lens.hs:36)
Cabal-syntax>     foreignLibVersionLinux (src/Distribution/Types/ForeignLib/Lens.hs:40)
Cabal-syntax>     foreignLibModDefFile (src/Distribution/Types/ForeignLib/Lens.hs:44)
Cabal-syntax>   40% (  2 /  5) in 'Distribution.Types.Executable'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     Executable (src/Distribution/Types/Executable.hs:21)
Cabal-syntax>     emptyExecutable (src/Distribution/Types/Executable.hs:52)
Cabal-syntax> Warning: Distribution.Types.Executable.Lens: Could not find documentation for exported module: Distribution.Types.Executable.Lens
Cabal-syntax>    0% (  0 /  6) in 'Distribution.Types.Executable.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     Executable (src/Distribution/Types/Executable.hs:21)
Cabal-syntax>     exeName (src/Distribution/Types/Executable/Lens.hs:18)
Cabal-syntax>     exeBuildInfo (src/Distribution/Types/Executable/Lens.hs:30)
Cabal-syntax>     modulePath (src/Distribution/Types/Executable/Lens.hs:22)
Cabal-syntax>     exeScope (src/Distribution/Types/Executable/Lens.hs:26)
Cabal-syntax>   50% (  3 /  6) in 'Distribution.Types.Benchmark'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     emptyBenchmark (src/Distribution/Types/Benchmark.hs:59)
Cabal-syntax>     benchmarkType (src/Distribution/Types/Benchmark.hs:62)
Cabal-syntax>   14% (  1 /  7) in 'Distribution.Types.Component'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     Component (src/Distribution/Types/Component.hs:26)
Cabal-syntax>     foldComponent (src/Distribution/Types/Component.hs:60)
Cabal-syntax>     componentBuildInfo (src/Distribution/Types/Component.hs:67)
Cabal-syntax>     componentName (src/Distribution/Types/Component.hs:79)
Cabal-syntax>     partitionComponents (src/Distribution/Types/Component.hs:90)
Cabal-syntax> Warning: 'PackageDescription' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'ComponentRequestedSpec' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/ComponentRequestedSpec.hs:65:5
Cabal-syntax>     * at src/Distribution/Types/ComponentRequestedSpec.hs:64:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/ComponentRequestedSpec.hs:64:1
Cabal-syntax> Warning: 'LocalBuildInfo' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'flattenPD' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   87% (  7 /  8) in 'Distribution.Types.ComponentRequestedSpec'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax> Warning: 'Library' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Library.hs:22:16
Cabal-syntax>     * at src/Distribution/Types/Library.hs:22:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Library.hs:22:1
Cabal-syntax> Warning: 'Executable' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Executable.hs:21:19
Cabal-syntax>     * at src/Distribution/Types/Executable.hs:21:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Executable.hs:21:1
Cabal-syntax> Warning: 'TestSuite' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/TestSuite.hs:25:18
Cabal-syntax>     * at src/Distribution/Types/TestSuite.hs:25:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/TestSuite.hs:25:1
Cabal-syntax> Warning: 'Benchmark' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Benchmark.hs:25:18
Cabal-syntax>     * at src/Distribution/Types/Benchmark.hs:25:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Benchmark.hs:25:1
Cabal-syntax> Warning: 'BuildInfo' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/BuildInfo.hs:32:18
Cabal-syntax>     * at src/Distribution/Types/BuildInfo.hs:32:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/BuildInfo.hs:32:1
Cabal-syntax> Warning: 'PackageDescription' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/PackageDescription.hs:104:27
Cabal-syntax>     * at src/Distribution/Types/PackageDescription.hs:104:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/PackageDescription.hs:104:1
Cabal-syntax> Warning: 'GenericPackageDescription' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'withLibLBI' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'LocalBuildInfo' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'withExeLBI' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'withTestLBI' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'withBenchLBI' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'ForeignLib' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/ForeignLib.hs:40:19
Cabal-syntax>     * at src/Distribution/Types/ForeignLib.hs:40:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/ForeignLib.hs:40:1
Cabal-syntax>   82% ( 23 / 28) in 'Distribution.Types.PackageDescription'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     emptyPackageDescription (src/Distribution/Types/PackageDescription.hs:200)
Cabal-syntax>     allLibraries (src/Distribution/Types/PackageDescription.hs:252)
Cabal-syntax>     updatePackageDescription (src/Distribution/Types/PackageDescription.hs:371)
Cabal-syntax>     lookupComponent (src/Distribution/Types/PackageDescription.hs:431)
Cabal-syntax>     getComponent (src/Distribution/Types/PackageDescription.hs:443)
Cabal-syntax>    0% (  0 /  3) in 'Distribution.Types.GenericPackageDescription'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     GenericPackageDescription (src/Distribution/Types/GenericPackageDescription.hs:35)
Cabal-syntax>     emptyGenericPackageDescription (src/Distribution/Types/GenericPackageDescription.hs:84)
Cabal-syntax> Warning: Distribution.Types.GenericPackageDescription.Lens: Could not find documentation for exported module: Distribution.Types.GenericPackageDescription.Lens
Cabal-syntax>   13% (  3 / 23) in 'Distribution.Types.GenericPackageDescription.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     GenericPackageDescription (src/Distribution/Types/GenericPackageDescription.hs:35)
Cabal-syntax>     packageDescription (src/Distribution/Types/GenericPackageDescription/Lens.hs:41)
Cabal-syntax>     flagName (src/Distribution/Types/GenericPackageDescription/Lens.hs:101)
Cabal-syntax>     flagDescription (src/Distribution/Types/GenericPackageDescription/Lens.hs:105)
Cabal-syntax>     flagDefault (src/Distribution/Types/GenericPackageDescription/Lens.hs:109)
Cabal-syntax>     flagManual (src/Distribution/Types/GenericPackageDescription/Lens.hs:113)
Cabal-syntax>     gpdScannedVersion (src/Distribution/Types/GenericPackageDescription/Lens.hs:45)
Cabal-syntax>     genPackageFlags (src/Distribution/Types/GenericPackageDescription/Lens.hs:49)
Cabal-syntax>     condLibrary (src/Distribution/Types/GenericPackageDescription/Lens.hs:53)
Cabal-syntax>     condSubLibraries (src/Distribution/Types/GenericPackageDescription/Lens.hs:57)
Cabal-syntax>     condForeignLibs (src/Distribution/Types/GenericPackageDescription/Lens.hs:61)
Cabal-syntax>     condExecutables (src/Distribution/Types/GenericPackageDescription/Lens.hs:65)
Cabal-syntax>     condTestSuites (src/Distribution/Types/GenericPackageDescription/Lens.hs:69)
Cabal-syntax>     condBenchmarks (src/Distribution/Types/GenericPackageDescription/Lens.hs:73)
Cabal-syntax>     allCondTrees (src/Distribution/Types/GenericPackageDescription/Lens.hs:84)
Cabal-syntax>     _OS (src/Distribution/Types/GenericPackageDescription/Lens.hs:121)
Cabal-syntax>     _Arch (src/Distribution/Types/GenericPackageDescription/Lens.hs:125)
Cabal-syntax>     _PackageFlag (src/Distribution/Types/GenericPackageDescription/Lens.hs:129)
Cabal-syntax>     _Impl (src/Distribution/Types/GenericPackageDescription/Lens.hs:133)
Cabal-syntax> Warning: Distribution.Types.Benchmark.Lens: Could not find documentation for exported module: Distribution.Types.Benchmark.Lens
Cabal-syntax>   20% (  1 /  5) in 'Distribution.Types.Benchmark.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     benchmarkName (src/Distribution/Types/Benchmark/Lens.hs:18)
Cabal-syntax>     benchmarkBuildInfo (src/Distribution/Types/Benchmark/Lens.hs:26)
Cabal-syntax>     benchmarkInterface (src/Distribution/Types/Benchmark/Lens.hs:22)
Cabal-syntax> Warning: Distribution.Types.PackageDescription.Lens: Could not find documentation for exported module: Distribution.Types.PackageDescription.Lens
Cabal-syntax>   11% (  4 / 35) in 'Distribution.Types.PackageDescription.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     package (src/Distribution/Types/PackageDescription/Lens.hs:42)
Cabal-syntax>     copyright (src/Distribution/Types/PackageDescription/Lens.hs:54)
Cabal-syntax>     maintainer (src/Distribution/Types/PackageDescription/Lens.hs:58)
Cabal-syntax>     author (src/Distribution/Types/PackageDescription/Lens.hs:62)
Cabal-syntax>     stability (src/Distribution/Types/PackageDescription/Lens.hs:66)
Cabal-syntax>     homepage (src/Distribution/Types/PackageDescription/Lens.hs:74)
Cabal-syntax>     pkgUrl (src/Distribution/Types/PackageDescription/Lens.hs:78)
Cabal-syntax>     synopsis (src/Distribution/Types/PackageDescription/Lens.hs:90)
Cabal-syntax>     description (src/Distribution/Types/PackageDescription/Lens.hs:94)
Cabal-syntax>     category (src/Distribution/Types/PackageDescription/Lens.hs:98)
Cabal-syntax>     dataDir (src/Distribution/Types/PackageDescription/Lens.hs:146)
Cabal-syntax>     specVersion (src/Distribution/Types/PackageDescription/Lens.hs:106)
Cabal-syntax>     licenseRaw (src/Distribution/Types/PackageDescription/Lens.hs:46)
Cabal-syntax>     licenseFiles (src/Distribution/Types/PackageDescription/Lens.hs:50)
Cabal-syntax>     testedWith (src/Distribution/Types/PackageDescription/Lens.hs:70)
Cabal-syntax>     bugReports (src/Distribution/Types/PackageDescription/Lens.hs:82)
Cabal-syntax>     sourceRepos (src/Distribution/Types/PackageDescription/Lens.hs:86)
Cabal-syntax>     customFieldsPD (src/Distribution/Types/PackageDescription/Lens.hs:102)
Cabal-syntax>     buildTypeRaw (src/Distribution/Types/PackageDescription/Lens.hs:110)
Cabal-syntax>     setupBuildInfo (src/Distribution/Types/PackageDescription/Lens.hs:114)
Cabal-syntax>     library (src/Distribution/Types/PackageDescription/Lens.hs:118)
Cabal-syntax>     subLibraries (src/Distribution/Types/PackageDescription/Lens.hs:122)
Cabal-syntax>     executables (src/Distribution/Types/PackageDescription/Lens.hs:126)
Cabal-syntax>     foreignLibs (src/Distribution/Types/PackageDescription/Lens.hs:130)
Cabal-syntax>     testSuites (src/Distribution/Types/PackageDescription/Lens.hs:134)
Cabal-syntax>     benchmarks (src/Distribution/Types/PackageDescription/Lens.hs:138)
Cabal-syntax>     dataFiles (src/Distribution/Types/PackageDescription/Lens.hs:142)
Cabal-syntax>     extraSrcFiles (src/Distribution/Types/PackageDescription/Lens.hs:150)
Cabal-syntax>     extraTmpFiles (src/Distribution/Types/PackageDescription/Lens.hs:154)
Cabal-syntax>     extraDocFiles (src/Distribution/Types/PackageDescription/Lens.hs:158)
Cabal-syntax>   91% ( 11 / 12) in 'Distribution.Types.Lens'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>  100% ( 56 / 56) in 'Distribution.PackageDescription'
Cabal-syntax> Warning: 'GenericPackageDescription' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/GenericPackageDescription.hs:35:34
Cabal-syntax>     * at src/Distribution/Types/GenericPackageDescription.hs:35:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/GenericPackageDescription.hs:35:1
Cabal-syntax> Warning: 'PackageDescription' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/PackageDescription.hs:104:27
Cabal-syntax>     * at src/Distribution/Types/PackageDescription.hs:104:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/PackageDescription.hs:104:1
Cabal-syntax> Warning: 'Arch' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/System.hs:195:1
Cabal-syntax>     * at src/Distribution/Types/ConfVar.hs:19:5
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/System.hs:195:1
Cabal-syntax> Warning: 'OS' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/System.hs:97:1
Cabal-syntax>     * at src/Distribution/Types/ConfVar.hs:18:5
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/System.hs:97:1
Cabal-syntax>   62% ( 10 / 16) in 'Distribution.PackageDescription.Configuration'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     freeVars (src/Distribution/PackageDescription/Configuration.hs:348)
Cabal-syntax>     mapCondTree (src/Distribution/Types/CondTree.hs:110)
Cabal-syntax>     mapTreeData (src/Distribution/Types/CondTree.hs:126)
Cabal-syntax>     mapTreeConds (src/Distribution/Types/CondTree.hs:123)
Cabal-syntax>     mapTreeConstrs (src/Distribution/Types/CondTree.hs:120)
Cabal-syntax>     transformAllBuildInfos (src/Distribution/PackageDescription/Configuration.hs:644)
Cabal-syntax> Warning: 'Token' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/FieldGrammar/Newtypes.hs:233:17
Cabal-syntax>     * at src/Distribution/FieldGrammar/Newtypes.hs:233:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/FieldGrammar/Newtypes.hs:233:1
Cabal-syntax> Warning: 'List' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/FieldGrammar/Newtypes.hs:132:24
Cabal-syntax>     * at src/Distribution/FieldGrammar/Newtypes.hs:132:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/FieldGrammar/Newtypes.hs:132:1
Cabal-syntax> Warning: 'Set'' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/FieldGrammar/Newtypes.hs:162:24
Cabal-syntax>     * at src/Distribution/FieldGrammar/Newtypes.hs:162:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/FieldGrammar/Newtypes.hs:162:1
Cabal-syntax> Warning: 'NonEmpty'' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/FieldGrammar/Newtypes.hs:199:29
Cabal-syntax>     * at src/Distribution/FieldGrammar/Newtypes.hs:199:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/FieldGrammar/Newtypes.hs:199:1
Cabal-syntax>   96% ( 29 / 30) in 'Distribution.FieldGrammar.Newtypes'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Sep (src/Distribution/FieldGrammar/Newtypes.hs:91)
Cabal-syntax> Warning: 'Last' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'pack' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax>   85% (  6 /  7) in 'Distribution.FieldGrammar.Class'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>   33% (  1 /  3) in 'Distribution.FieldGrammar.Pretty'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     PrettyFieldGrammar (src/Distribution/FieldGrammar/Pretty.hs:23)
Cabal-syntax> Warning: 'FieldGrammarParser' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'GeneralPackageDescription' is out of scope.
Cabal-syntax>     If you qualify the identifier, haddock can try to link it anyway.
Cabal-syntax> Warning: 'Field' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:51:5
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:50:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Fields/Field.hs:50:1
Cabal-syntax> Warning: 'Section' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/FieldGrammar/Parsec.hs:105:1
Cabal-syntax>     * at src/Distribution/Fields/Field.hs:52:5
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/FieldGrammar/Parsec.hs:105:1
Cabal-syntax>   33% (  4 / 12) in 'Distribution.FieldGrammar.Parsec'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     ParsecFieldGrammar (src/Distribution/FieldGrammar/Parsec.hs:112)
Cabal-syntax>     parseFieldGrammar (src/Distribution/FieldGrammar/Parsec.hs:120)
Cabal-syntax>     fieldGrammarKnownFieldList (src/Distribution/FieldGrammar/Parsec.hs:135)
Cabal-syntax>     Fields (src/Distribution/FieldGrammar/Parsec.hs:95)
Cabal-syntax>     namelessFieldAnn (src/Distribution/FieldGrammar/Parsec.hs:102)
Cabal-syntax>     runFieldParser (src/Distribution/FieldGrammar/Parsec.hs:382)
Cabal-syntax>     runFieldParser' (src/Distribution/FieldGrammar/Parsec.hs:353)
Cabal-syntax>     fieldLinesToStream (src/Distribution/FieldGrammar/Parsec.hs:442)
Cabal-syntax>   65% ( 17 / 26) in 'Distribution.FieldGrammar'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     ParsecFieldGrammar (src/Distribution/FieldGrammar/Parsec.hs:112)
Cabal-syntax>     ParsecFieldGrammar' (src/Distribution/FieldGrammar.hs:49)
Cabal-syntax>     parseFieldGrammar (src/Distribution/FieldGrammar/Parsec.hs:120)
Cabal-syntax>     fieldGrammarKnownFieldList (src/Distribution/FieldGrammar/Parsec.hs:135)
Cabal-syntax>     PrettyFieldGrammar (src/Distribution/FieldGrammar/Pretty.hs:23)
Cabal-syntax>     PrettyFieldGrammar' (src/Distribution/FieldGrammar.hs:50)
Cabal-syntax>     Fields (src/Distribution/FieldGrammar/Parsec.hs:95)
Cabal-syntax>     runFieldParser (src/Distribution/FieldGrammar/Parsec.hs:382)
Cabal-syntax>     runFieldParser' (src/Distribution/FieldGrammar/Parsec.hs:353)
Cabal-syntax> Warning: 'GenericPackageDescription' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/GenericPackageDescription.hs:35:34
Cabal-syntax>     * at src/Distribution/Types/GenericPackageDescription.hs:35:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/GenericPackageDescription.hs:35:1
Cabal-syntax> Warning: 'Benchmark' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/Benchmark.hs:25:18
Cabal-syntax>     * at src/Distribution/Types/Benchmark.hs:25:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/Benchmark.hs:25:1
Cabal-syntax> Warning: 'TestSuite' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/TestSuite.hs:25:18
Cabal-syntax>     * at src/Distribution/Types/TestSuite.hs:25:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/TestSuite.hs:25:1
Cabal-syntax>   36% ( 17 / 47) in 'Distribution.PackageDescription.FieldGrammar'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     packageDescriptionFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:114)
Cabal-syntax>     CompatLicenseFile (src/Distribution/PackageDescription/FieldGrammar.hs:852)
Cabal-syntax>     libraryFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:192)
Cabal-syntax>     foreignLibFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:242)
Cabal-syntax>     executableFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:280)
Cabal-syntax>     testSuiteFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:351)
Cabal-syntax>     validateTestSuite (src/Distribution/PackageDescription/FieldGrammar.hs:361)
Cabal-syntax>     unvalidateTestSuite (src/Distribution/PackageDescription/FieldGrammar.hs:425)
Cabal-syntax>     testStanzaTestType (src/Distribution/PackageDescription/FieldGrammar.hs:308)
Cabal-syntax>     testStanzaMainIs (src/Distribution/PackageDescription/FieldGrammar.hs:312)
Cabal-syntax>     testStanzaTestModule (src/Distribution/PackageDescription/FieldGrammar.hs:316)
Cabal-syntax>     testStanzaBuildInfo (src/Distribution/PackageDescription/FieldGrammar.hs:320)
Cabal-syntax>     benchmarkFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:494)
Cabal-syntax>     validateBenchmark (src/Distribution/PackageDescription/FieldGrammar.hs:502)
Cabal-syntax>     unvalidateBenchmark (src/Distribution/PackageDescription/FieldGrammar.hs:555)
Cabal-syntax>     formatDependencyList (src/Distribution/PackageDescription/FieldGrammar.hs:795)
Cabal-syntax>     formatExposedModules (src/Distribution/PackageDescription/FieldGrammar.hs:804)
Cabal-syntax>     formatExtraSourceFiles (src/Distribution/PackageDescription/FieldGrammar.hs:801)
Cabal-syntax>     formatHsSourceDirs (src/Distribution/PackageDescription/FieldGrammar.hs:807)
Cabal-syntax>     formatMixinList (src/Distribution/PackageDescription/FieldGrammar.hs:798)
Cabal-syntax>     formatOtherExtensions (src/Distribution/PackageDescription/FieldGrammar.hs:810)
Cabal-syntax>     formatOtherModules (src/Distribution/PackageDescription/FieldGrammar.hs:813)
Cabal-syntax>     benchmarkStanzaBenchmarkType (src/Distribution/PackageDescription/FieldGrammar.hs:456)
Cabal-syntax>     benchmarkStanzaMainIs (src/Distribution/PackageDescription/FieldGrammar.hs:460)
Cabal-syntax>     benchmarkStanzaBenchmarkModule (src/Distribution/PackageDescription/FieldGrammar.hs:464)
Cabal-syntax>     benchmarkStanzaBuildInfo (src/Distribution/PackageDescription/FieldGrammar.hs:468)
Cabal-syntax>     flagFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:749)
Cabal-syntax>     sourceRepoFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:765)
Cabal-syntax>     setupBInfoFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:784)
Cabal-syntax>     buildInfoFieldGrammar (src/Distribution/PackageDescription/FieldGrammar.hs:592)
Cabal-syntax> Warning: 'PrettyField' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Fields/Pretty.hs:45:5
Cabal-syntax>     * at src/Distribution/Fields/Pretty.hs:44:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Fields/Pretty.hs:44:1
Cabal-syntax>  100% ( 11 / 11) in 'Distribution.PackageDescription.PrettyPrint'
Cabal-syntax> Warning: 'BuildInfo' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/BuildInfo.hs:32:18
Cabal-syntax>     * at src/Distribution/Types/BuildInfo.hs:32:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/BuildInfo.hs:32:1
Cabal-syntax> Warning: 'GenericPackageDescription' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/GenericPackageDescription.hs:35:34
Cabal-syntax>     * at src/Distribution/Types/GenericPackageDescription.hs:35:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/GenericPackageDescription.hs:35:1
Cabal-syntax>   90% ( 10 / 11) in 'Distribution.PackageDescription.Parsec'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     parseHookedBuildInfo (src/Distribution/PackageDescription/Parsec.hs:926)
Cabal-syntax>   60% (  3 /  5) in 'Distribution.FieldGrammar.FieldDescrs'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     fieldDescrsToList (src/Distribution/FieldGrammar/FieldDescrs.hs:58)
Cabal-syntax> Warning: 'InstalledPackageInfo' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/InstalledPackageInfo.hs:40:29
Cabal-syntax>     * at src/Distribution/Types/InstalledPackageInfo.hs:40:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/InstalledPackageInfo.hs:40:1
Cabal-syntax>    0% (  0 /  2) in 'Distribution.Types.InstalledPackageInfo.FieldGrammar'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     Module header
Cabal-syntax>     ipiFieldGrammar (src/Distribution/Types/InstalledPackageInfo/FieldGrammar.hs:78)
Cabal-syntax> Warning: 'InstalledPackageInfo' is ambiguous. It is defined
Cabal-syntax>     * at src/Distribution/Types/InstalledPackageInfo.hs:40:29
Cabal-syntax>     * at src/Distribution/Types/InstalledPackageInfo.hs:40:1
Cabal-syntax>     You may be able to disambiguate the identifier by qualifying it or
Cabal-syntax>     by specifying the type/value namespace explicitly.
Cabal-syntax>     Defaulting to the one defined at src/Distribution/Types/InstalledPackageInfo.hs:40:1
Cabal-syntax>   57% (  8 / 14) in 'Distribution.InstalledPackageInfo'
Cabal-syntax>   Missing documentation for:
Cabal-syntax>     InstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:40)
Cabal-syntax>     installedComponentId (src/Distribution/InstalledPackageInfo.hs:66)
Cabal-syntax>     sourceComponentName (src/Distribution/InstalledPackageInfo.hs:89)
Cabal-syntax>     ExposedModule (src/Distribution/Types/ExposedModule.hs:17)
Cabal-syntax>     emptyInstalledPackageInfo (src/Distribution/Types/InstalledPackageInfo.hs:132)
Cabal-syntax>     showSimpleInstalledPackageInfoField (src/Distribution/InstalledPackageInfo.hs:138)
Cabal-syntax> Warning: Distribution.Compat.MonadFail: could not find link destinations for:
Cabal-syntax>   - Text.ParserCombinators.ReadP.P
Cabal-syntax> Warning: Distribution.Utils.Structured: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.GStructuredSum
Cabal-syntax>   - Distribution.Utils.Structured.gstructured
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Rep_Structure
Cabal-syntax> Warning: Distribution.Compat.Semigroup: could not find link destinations for:
Cabal-syntax>   - Data.Semigroup.Internal.Rep_Any
Cabal-syntax>   - Data.Semigroup.Internal.Rep_All
Cabal-syntax>   - Data.Foldable1.JoinWith
Cabal-syntax>   - Data.Foldable1.FromMaybe
Cabal-syntax>   - Data.Foldable1.NonEmptyDList
Cabal-syntax>   - Data.Set.Internal.MergeSet
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Compat.Semigroup.GMonoid
Cabal-syntax>   - Distribution.Compat.Semigroup.GSemigroup
Cabal-syntax>   - Distribution.Compat.Semigroup.Rep_Option'
Cabal-syntax>   - Distribution.Compat.Semigroup.Rep_Last'
Cabal-syntax> Warning: Distribution.Compat.NonEmptySet: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax> Warning: Distribution.Compat.Prelude: could not find link destinations for:
Cabal-syntax>   - GHC.Prim.~#
Cabal-syntax>   - GHC.Generics.SingKind
Cabal-syntax>   - GHC.Generics.DemoteRep
Cabal-syntax>   - GHC.Generics.fromSing
Cabal-syntax>   - GHC.Generics.SingI
Cabal-syntax>   - GHC.Generics.sing
Cabal-syntax>   - GHC.Generics.Sing
Cabal-syntax>   - GHC.Generics.D:R:UReckWordp0
Cabal-syntax>   - GHC.Generics.D:R:UReckIntp0
Cabal-syntax>   - GHC.Generics.D:R:UReckFloatp0
Cabal-syntax>   - GHC.Generics.D:R:UReckDoublep0
Cabal-syntax>   - GHC.Generics.D:R:UReckCharp0
Cabal-syntax>   - GHC.Generics.Rep1_Proxy
Cabal-syntax>   - GHC.Generics.Rep1_Either
Cabal-syntax>   - GHC.Generics.Rep1_Maybe
Cabal-syntax>   - GHC.Generics.Rep1_NonEmpty
Cabal-syntax>   - GHC.Generics.Rep_Fingerprint
Cabal-syntax>   - GHC.Generics.Rep_GeneralCategory
Cabal-syntax>   - GHC.Generics.Rep_SrcLoc
Cabal-syntax>   - GHC.Generics.Rep_Down
Cabal-syntax>   - GHC.Generics.Rep_Tuple15
Cabal-syntax>   - GHC.Generics.Rep_Tuple14
Cabal-syntax>   - GHC.Generics.Rep_Tuple13
Cabal-syntax>   - GHC.Generics.Rep_Tuple12
Cabal-syntax>   - GHC.Generics.Rep_Tuple11
Cabal-syntax>   - GHC.Generics.Rep_Tuple10
Cabal-syntax>   - GHC.Generics.Rep_Tuple9
Cabal-syntax>   - GHC.Generics.Rep_Tuple8
Cabal-syntax>   - GHC.Generics.Rep_Tuple7
Cabal-syntax>   - GHC.Generics.Rep_Tuple6
Cabal-syntax>   - GHC.Generics.Rep_Tuple5
Cabal-syntax>   - GHC.Generics.Rep_Tuple4
Cabal-syntax>   - GHC.Generics.Rep_Tuple3
Cabal-syntax>   - GHC.Generics.Rep_Tuple2
Cabal-syntax>   - GHC.Generics.Rep_Solo
Cabal-syntax>   - GHC.Generics.Rep_Unit
Cabal-syntax>   - GHC.Generics.Rep_Proxy
Cabal-syntax>   - GHC.Generics.Rep_Ordering
Cabal-syntax>   - GHC.Generics.Rep_Bool
Cabal-syntax>   - GHC.Generics.Rep_Either
Cabal-syntax>   - GHC.Generics.Rep_Maybe
Cabal-syntax>   - GHC.Generics.Rep_NonEmpty
Cabal-syntax>   - GHC.Generics.Rep_List
Cabal-syntax>   - GHC.Generics.Rep_Void
Cabal-syntax>   - GHC.Generics.Rep_M1
Cabal-syntax>   - GHC.Generics.Rep_V1
Cabal-syntax>   - GHC.Generics.Rep_U1
Cabal-syntax>   - GHC.Generics.Rep_Par1
Cabal-syntax>   - GHC.Generics.Rep_Rec1
Cabal-syntax>   - GHC.Generics.Rep_K1
Cabal-syntax>   - GHC.Generics.Rep_:+:
Cabal-syntax>   - GHC.Generics.Rep_:*:
Cabal-syntax>   - GHC.Generics.Rep_:.:
Cabal-syntax>   - GHC.Generics.Rep_R:UReckWordp
Cabal-syntax>   - GHC.Generics.Rep1_R:UReckWordp
Cabal-syntax>   - GHC.Generics.Rep_R:UReckIntp
Cabal-syntax>   - GHC.Generics.Rep1_R:UReckIntp
Cabal-syntax>   - GHC.Generics.Rep1_R:UReckFloatp
Cabal-syntax>   - GHC.Generics.Rep_R:UReckDoublep
Cabal-syntax>   - GHC.Generics.Rep1_R:UReckDoublep
Cabal-syntax>   - GHC.Generics.Rep_R:UReckCharp
Cabal-syntax>   - GHC.Generics.Rep1_R:UReckCharp
Cabal-syntax>   - GHC.Generics.Rep_R:UReckPtrp
Cabal-syntax>   - GHC.Generics.Rep_Fixity
Cabal-syntax>   - GHC.Generics.Rep_Associativity
Cabal-syntax>   - GHC.Generics.Rep_SourceUnpackedness
Cabal-syntax>   - GHC.Generics.Rep_SourceStrictness
Cabal-syntax>   - GHC.Generics.Rep_DecidedStrictness
Cabal-syntax>   - Data.Semigroup.Internal.Rep_Alt
Cabal-syntax>   - Data.Semigroup.Internal.Rep_Product
Cabal-syntax>   - Data.Semigroup.Internal.Rep_Sum
Cabal-syntax>   - Data.Semigroup.Internal.Rep_Any
Cabal-syntax>   - Data.Semigroup.Internal.Rep_All
Cabal-syntax>   - Data.Semigroup.Internal.Rep_Endo
Cabal-syntax>   - Data.Semigroup.Internal.Rep_Dual
Cabal-syntax>   - Data.Monoid.Rep_Ap
Cabal-syntax>   - Data.Monoid.Rep_Last
Cabal-syntax>   - Data.Monoid.Rep_First
Cabal-syntax>   - Data.Functor.Const.Rep_Const
Cabal-syntax>   - Data.Functor.Const.Rep1_Const
Cabal-syntax>   - GHC.IOPort.IOPort
Cabal-syntax>   - GHC.RTS.Flags.Rep_RTSFlags
Cabal-syntax>   - GHC.RTS.Flags.Rep_ParFlags
Cabal-syntax>   - GHC.RTS.Flags.Rep_TickyFlags
Cabal-syntax>   - GHC.RTS.Flags.Rep_TraceFlags
Cabal-syntax>   - GHC.RTS.Flags.Rep_DoTrace
Cabal-syntax>   - GHC.RTS.Flags.Rep_ProfFlags
Cabal-syntax>   - GHC.RTS.Flags.Rep_DoHeapProfile
Cabal-syntax>   - GHC.RTS.Flags.Rep_CCFlags
Cabal-syntax>   - GHC.RTS.Flags.Rep_DoCostCentres
Cabal-syntax>   - GHC.RTS.Flags.Rep_DebugFlags
Cabal-syntax>   - GHC.RTS.Flags.Rep_MiscFlags
Cabal-syntax>   - GHC.RTS.Flags.Rep_ConcFlags
Cabal-syntax>   - GHC.RTS.Flags.Rep_GCFlags
Cabal-syntax>   - GHC.RTS.Flags.Rep_GiveGCStats
Cabal-syntax>   - Data.Functor.Identity.Rep_Identity
Cabal-syntax>   - Data.Functor.Identity.Rep1_Identity
Cabal-syntax>   - Control.Arrow.Rep_Kleisli
Cabal-syntax>   - Control.Applicative.Rep_ZipList
Cabal-syntax>   - Control.Applicative.Rep_WrappedArrow
Cabal-syntax>   - Control.Applicative.Rep_WrappedMonad
Cabal-syntax>   - Data.Version.Rep_Version
Cabal-syntax>   - GHC.ByteOrder.Rep_ByteOrder
Cabal-syntax>   - GHC.Stats.Rep_RTSStats
Cabal-syntax>   - GHC.Stats.Rep_GCDetails
Cabal-syntax>   - Data.Semigroup.Rep_WrappedMonoid
Cabal-syntax>   - Data.Semigroup.Rep_Last
Cabal-syntax>   - Data.Semigroup.Rep_First
Cabal-syntax>   - Data.Semigroup.Rep_Arg
Cabal-syntax>   - Data.Semigroup.Rep_Max
Cabal-syntax>   - Data.Semigroup.Rep_Min
Cabal-syntax>   - Data.Complex.Rep_Complex
Cabal-syntax>   - Data.Functor.Sum.Rep_Sum
Cabal-syntax>   - Data.Functor.Product.Rep_Product
Cabal-syntax>   - Data.Functor.Compose.Rep_Compose
Cabal-syntax>   - Data.Foldable1.JoinWith
Cabal-syntax>   - Data.Foldable1.FromMaybe
Cabal-syntax>   - Data.Foldable1.NonEmptyDList
Cabal-syntax>   - Data.ByteString.Builder.RealFloat.FormatMode
Cabal-syntax>   - Data.Sequence.Internal.Rep_ViewR
Cabal-syntax>   - Data.Sequence.Internal.Rep_ViewL
Cabal-syntax>   - Data.Sequence.Internal.Rep_Elem
Cabal-syntax>   - Data.Sequence.Internal.Rep_Node
Cabal-syntax>   - Data.Sequence.Internal.Rep_Digit
Cabal-syntax>   - Data.Sequence.Internal.Rep_FingerTree
Cabal-syntax>   - Data.Tree.Rep_Tree
Cabal-syntax>   - Data.Graph.Rep_SCC
Cabal-syntax>   - Control.DeepSeq.GNFData
Cabal-syntax>   - Data.Text.Internal.Encoding.PartialUtf8CodePoint
Cabal-syntax>   - Text.ParserCombinators.ReadP.P
Cabal-syntax>   - GHC.IO.Exception.Rep_ExitCode
Cabal-syntax>   - Control.Monad.Trans.State.Strict.Rep_StateT
Cabal-syntax>   - GHC.Generics.D:R:SingBoola0
Cabal-syntax>   - GHC.Generics.STrue
Cabal-syntax>   - GHC.Generics.D:R:DemoteRepBool
Cabal-syntax>   - GHC.Generics.SFalse
Cabal-syntax>   - GHC.Generics.Rep_R:UReckFloatp
Cabal-syntax>   - GHC.Generics.D:R:SingMaybeb0
Cabal-syntax>   - GHC.Generics.SNothing
Cabal-syntax>   - GHC.Generics.SJust
Cabal-syntax>   - GHC.Generics.D:R:DemoteRepMaybe
Cabal-syntax>   - GHC.IsList.D:R:ItemNonEmpty
Cabal-syntax>   - Data.Map.Internal.D:R:ItemMap
Cabal-syntax>   - Data.Set.Internal.D:R:ItemSet
Cabal-syntax>   - Data.Set.Internal.MergeSet
Cabal-syntax>   - Control.DeepSeq.Zero
Cabal-syntax>   - GHC.ForeignSrcLang.Type.Rep_ForeignSrcLang
Cabal-syntax>   - GHC.LanguageExtensions.Type.Rep_Extension
Cabal-syntax>   - Text.PrettyPrint.Annotated.HughesPJ.Rep_Doc
Cabal-syntax>   - Text.PrettyPrint.Annotated.HughesPJ.Rep_Mode
Cabal-syntax>   - Text.PrettyPrint.Annotated.HughesPJ.Rep_Style
Cabal-syntax>   - Text.PrettyPrint.Annotated.HughesPJ.Rep_TextDetails
Cabal-syntax>   - Text.PrettyPrint.HughesPJ.Rep_Doc
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_AnnLookup
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_AnnTarget
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Bang
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_BndrVis
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Body
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Bytes
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Callconv
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Clause
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Con
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Dec
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_DecidedStrictness
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_DerivClause
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_DerivStrategy
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_DocLoc
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Exp
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_FamilyResultSig
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_FixityDirection
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Fixity
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Foreign
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_FunDep
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Guard
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Info
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_InjectivityAnn
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Inline
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Lit
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Loc
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Match
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_ModName
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_ModuleInfo
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Module
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_NameFlavour
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_NameSpace
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Name
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_OccName
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Overlap
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Pat
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_PatSynArgs
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_PatSynDir
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Phases
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_PkgName
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Pragma
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Range
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Role
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_RuleBndr
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_RuleMatch
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Safety
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_SourceStrictness
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_SourceUnpackedness
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Specificity
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Stmt
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_TyLit
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_TySynEqn
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_TyVarBndr
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_Type
Cabal-syntax>   - Language.Haskell.TH.Syntax.Rep_TypeFamilyHead
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Structured.Rep_Structure
Cabal-syntax>   - Distribution.Compat.Semigroup.GMonoid
Cabal-syntax>   - Distribution.Compat.Semigroup.GSemigroup
Cabal-syntax>   - Distribution.Compat.Semigroup.Rep_Option'
Cabal-syntax>   - Distribution.Compat.Semigroup.Rep_Last'
Cabal-syntax>   - Distribution.Compat.Prelude.GNFData
Cabal-syntax>   - Distribution.Utils.ShortText.Rep_ShortText
Cabal-syntax>   - System.OsString.Internal.Types.Rep_OsChar
Cabal-syntax>   - System.OsString.Internal.Types.Rep_OsString
Cabal-syntax>   - System.OsString.Internal.Types.Rep_PosixChar
Cabal-syntax>   - System.OsString.Internal.Types.Rep_PosixString
Cabal-syntax>   - System.OsString.Internal.Types.Rep_WindowsChar
Cabal-syntax>   - System.OsString.Internal.Types.Rep_WindowsString
Cabal-syntax>   - Control.Monad.Trans.Cont.Rep_ContT
Cabal-syntax>   - Control.Monad.Trans.Except.Rep_ExceptT
Cabal-syntax>   - Control.Monad.Trans.Identity.Rep_IdentityT
Cabal-syntax>   - Control.Monad.Trans.Maybe.Rep_MaybeT
Cabal-syntax>   - Control.Monad.Trans.RWS.Lazy.Rep_RWST
Cabal-syntax>   - Control.Monad.Trans.RWS.Strict.Rep_RWST
Cabal-syntax>   - Control.Monad.Trans.Reader.Rep_ReaderT
Cabal-syntax>   - Control.Monad.Trans.State.Lazy.Rep_StateT
Cabal-syntax>   - Control.Monad.Trans.Writer.Lazy.Rep_WriterT
Cabal-syntax>   - Control.Monad.Trans.Writer.Strict.Rep_WriterT
Cabal-syntax>   - Distribution.Types.Condition.Rep_Condition
Cabal-syntax>   - Distribution.Parsec.Position.Rep_Position
Cabal-syntax>   - Distribution.Parsec.Warning.Rep_PWarning
Cabal-syntax>   - Distribution.Parsec.Warning.Rep_PWarnType
Cabal-syntax>   - Control.Monad.Trans.Accum.Rep_AccumT
Cabal-syntax>   - Control.Monad.Trans.RWS.CPS.Rep_RWST
Cabal-syntax>   - Control.Monad.Trans.Select.Rep_SelectT
Cabal-syntax>   - Control.Monad.Trans.Writer.CPS.Rep_WriterT
Cabal-syntax>   - Distribution.Parsec.Error.Rep_PError
Cabal-syntax>   - Distribution.Types.CondTree.Rep_CondBranch
Cabal-syntax>   - Distribution.Types.CondTree.Rep_CondTree
Cabal-syntax>   - Distribution.CabalSpecVersion.Rep_CabalSpecVersion
Cabal-syntax>   - Distribution.Utils.Path.Rep_SymbolicPath
Cabal-syntax>   - Distribution.Types.Version.Rep_Version
Cabal-syntax>   - Distribution.Types.VersionRange.Internal.Rep_VersionRangeF
Cabal-syntax>   - Distribution.Types.VersionRange.Internal.Rep_VersionRange
Cabal-syntax>   - Distribution.Types.SourceRepo.Rep_SourceRepo
Cabal-syntax>   - Distribution.Types.SourceRepo.Rep_RepoType
Cabal-syntax>   - Distribution.Types.SourceRepo.Rep_KnownRepoType
Cabal-syntax>   - Distribution.Types.SourceRepo.Rep_RepoKind
Cabal-syntax>   - Distribution.Types.PkgconfigVersion.Rep_PkgconfigVersion
Cabal-syntax>   - Distribution.Types.PkgconfigVersionRange.Rep_PkgconfigVersionRange
Cabal-syntax>   - Distribution.Types.PkgconfigName.Rep_PkgconfigName
Cabal-syntax>   - Distribution.Types.PkgconfigDependency.Rep_PkgconfigDependency
Cabal-syntax>   - Distribution.Types.PackageName.Rep_PackageName
Cabal-syntax>   - Distribution.Types.UnqualComponentName.Rep_UnqualComponentName
Cabal-syntax>   - Distribution.Types.LibraryVisibility.Rep_LibraryVisibility
Cabal-syntax>   - Distribution.Types.LibraryName.Rep_LibraryName
Cabal-syntax>   - Distribution.Types.MungedPackageName.Rep_MungedPackageName
Cabal-syntax>   - Distribution.Types.ForeignLibType.Rep_ForeignLibType
Cabal-syntax>   - Distribution.Types.ForeignLibOption.Rep_ForeignLibOption
Cabal-syntax>   - Distribution.Types.Flag.Rep_FlagAssignment
Cabal-syntax>   - Distribution.Types.Flag.Rep_PackageFlag
Cabal-syntax>   - Distribution.Types.Flag.Rep_FlagName
Cabal-syntax>   - Distribution.Types.ExecutableScope.Rep_ExecutableScope
Cabal-syntax>   - Distribution.Types.ComponentName.Rep_ComponentName
Cabal-syntax>   - Distribution.Types.ComponentId.Rep_ComponentId
Cabal-syntax>   - Distribution.Types.BuildType.Rep_BuildType
Cabal-syntax>   - Distribution.Types.AbiHash.Rep_AbiHash
Cabal-syntax>   - Distribution.System.Rep_Platform
Cabal-syntax>   - Distribution.System.Rep_Arch
Cabal-syntax>   - Distribution.System.Rep_OS
Cabal-syntax>   - Distribution.SPDX.LicenseReference.Rep_LicenseRef
Cabal-syntax>   - Distribution.SPDX.LicenseExceptionId.Rep_LicenseExceptionId
Cabal-syntax>   - Distribution.SPDX.LicenseExpression.Rep_LicenseExpression
Cabal-syntax>   - Distribution.SPDX.LicenseExpression.Rep_SimpleLicenseExpression
Cabal-syntax>   - Distribution.SPDX.License.Rep_License
Cabal-syntax>   - Distribution.ModuleName.Rep_ModuleName
Cabal-syntax>   - Distribution.Types.ModuleRenaming.Rep_ModuleRenaming
Cabal-syntax>   - Distribution.Types.IncludeRenaming.Rep_IncludeRenaming
Cabal-syntax>   - Distribution.Types.Mixin.Rep_Mixin
Cabal-syntax>   - Distribution.Types.ModuleReexport.Rep_ModuleReexport
Cabal-syntax>   - Data.Graph.SetM
Cabal-syntax>   - Distribution.Compat.Graph.D:R:KeyEither
Cabal-syntax>   - Distribution.Types.TestType.Rep_TestType
Cabal-syntax>   - Distribution.Types.TestSuiteInterface.Rep_TestSuiteInterface
Cabal-syntax>   - Distribution.Types.PackageId.Rep_PackageIdentifier
Cabal-syntax>   - Distribution.Types.UnitId.Rep_DefUnitId
Cabal-syntax>   - Distribution.Types.UnitId.Rep_UnitId
Cabal-syntax>   - Distribution.Types.Module.Rep_Module
Cabal-syntax>   - Distribution.Backpack.Rep_OpenModule
Cabal-syntax>   - Distribution.Backpack.Rep_OpenUnitId
Cabal-syntax>   - Distribution.Types.ExposedModule.Rep_ExposedModule
Cabal-syntax>   - Distribution.Types.PackageVersionConstraint.Rep_PackageVersionConstraint
Cabal-syntax>   - Distribution.Types.MungedPackageId.Rep_MungedPackageId
Cabal-syntax>   - Distribution.Types.LegacyExeDependency.Rep_LegacyExeDependency
Cabal-syntax>   - Distribution.Types.ExeDependency.Rep_ExeDependency
Cabal-syntax>   - Distribution.Types.Dependency.Rep_Dependency
Cabal-syntax>   - Distribution.Types.SetupBuildInfo.Rep_SetupBuildInfo
Cabal-syntax>   - Distribution.Types.BenchmarkType.Rep_BenchmarkType
Cabal-syntax>   - Distribution.Types.BenchmarkInterface.Rep_BenchmarkInterface
Cabal-syntax>   - Distribution.Types.AbiDependency.Rep_AbiDependency
Cabal-syntax>   - Distribution.License.Rep_License
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.Rep_InstalledPackageInfo
Cabal-syntax>   - Language.Haskell.Extension.Rep_Extension
Cabal-syntax>   - Language.Haskell.Extension.Rep_KnownExtension
Cabal-syntax>   - Language.Haskell.Extension.Rep_Language
Cabal-syntax>   - Distribution.Compiler.Rep_CompilerInfo
Cabal-syntax>   - Distribution.Compiler.Rep_AbiTag
Cabal-syntax>   - Distribution.Compiler.Rep_CompilerId
Cabal-syntax>   - Distribution.Compiler.Rep_PerCompilerFlavor
Cabal-syntax>   - Distribution.Compiler.Rep_CompilerFlavor
Cabal-syntax>   - Distribution.Types.ConfVar.Rep_ConfVar
Cabal-syntax>   - Distribution.Types.BuildInfo.Rep_BuildInfo
Cabal-syntax>   - Distribution.Types.TestSuite.Rep_TestSuite
Cabal-syntax>   - Distribution.Types.Library.Rep_Library
Cabal-syntax>   - Distribution.Types.ForeignLib.Rep_ForeignLib
Cabal-syntax>   - Distribution.Types.ForeignLib.Rep_LibVersionInfo
Cabal-syntax>   - Distribution.Types.Executable.Rep_Executable
Cabal-syntax>   - Distribution.Types.Benchmark.Rep_Benchmark
Cabal-syntax>   - Distribution.Types.Component.Rep_Component
Cabal-syntax>   - Distribution.Types.ComponentRequestedSpec.Rep_ComponentRequestedSpec
Cabal-syntax>   - Distribution.Types.PackageDescription.Rep_PackageDescription
Cabal-syntax>   - Distribution.Types.GenericPackageDescription.Rep_GenericPackageDescription
Cabal-syntax>   - GHC.IOPort.IOPortException
Cabal-syntax>   - Text.Printf.UPrintf
Cabal-syntax>   - Text.Printf.hspr
Cabal-syntax>   - Text.Printf.spr
Cabal-syntax>   - Control.Applicative.Backwards.Rep_Backwards
Cabal-syntax>   - Control.Applicative.Lift.Rep_Lift
Cabal-syntax>   - Data.Functor.Constant.Rep_Constant
Cabal-syntax>   - Data.Functor.Reverse.Rep_Reverse
Cabal-syntax> Warning: Distribution.Utils.ShortText: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.ShortText.Rep_ShortText
Cabal-syntax> Warning: Distribution.Types.Condition: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.Condition.Rep_Condition
Cabal-syntax> Warning: Distribution.Parsec.Position: could not find link destinations for:
Cabal-syntax>   - Distribution.Parsec.Position.Rep_Position
Cabal-syntax> Warning: Distribution.Parsec.Warning: could not find link destinations for:
Cabal-syntax>   - Distribution.Parsec.Warning.Rep_PWarning
Cabal-syntax>   - Distribution.Parsec.Warning.Rep_PWarnType
Cabal-syntax> Warning: Distribution.Parsec.Error: could not find link destinations for:
Cabal-syntax>   - Distribution.Parsec.Error.Rep_PError
Cabal-syntax> Warning: Distribution.Fields.LexerMonad: could not find link destinations for:
Cabal-syntax>   - Distribution.Fields.LexerMonad.StartCode
Cabal-syntax> Warning: Distribution.Types.CondTree: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.CondTree.Rep_CondBranch
Cabal-syntax>   - Distribution.Types.CondTree.Rep_CondTree
Cabal-syntax> Warning: Distribution.CabalSpecVersion: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.CabalSpecVersion.Rep_CabalSpecVersion
Cabal-syntax> Warning: Distribution.Parsec: could not find link destinations for:
Cabal-syntax>   - Distribution.Parsec.Position.Rep_Position
Cabal-syntax>   - Distribution.Parsec.Warning.Rep_PWarning
Cabal-syntax>   - Distribution.Parsec.Warning.Rep_PWarnType
Cabal-syntax>   - Distribution.Parsec.Error.Rep_PError
Cabal-syntax> Warning: Distribution.Utils.Path: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Utils.Path.Rep_SymbolicPath
Cabal-syntax> Warning: Distribution.Types.Version: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.Version.Rep_Version
Cabal-syntax> Warning: Distribution.Types.VersionRange.Internal: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.VersionRange.Internal.Rep_VersionRangeF
Cabal-syntax>   - Distribution.Types.VersionRange.Internal.Rep_VersionRange
Cabal-syntax> Warning: Distribution.Types.VersionRange: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.VersionRange.Internal.Rep_VersionRangeF
Cabal-syntax>   - Distribution.Types.VersionRange.Internal.Rep_VersionRange
Cabal-syntax> Warning: Distribution.Types.SourceRepo: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.SourceRepo.Rep_SourceRepo
Cabal-syntax>   - Distribution.Types.SourceRepo.Rep_RepoType
Cabal-syntax>   - Distribution.Types.SourceRepo.Rep_KnownRepoType
Cabal-syntax>   - Distribution.Types.SourceRepo.Rep_RepoKind
Cabal-syntax> Warning: Distribution.Types.SourceRepo.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.SourceRepo.Rep_SourceRepo
Cabal-syntax> Warning: Distribution.Types.PkgconfigVersion: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.PkgconfigVersion.Rep_PkgconfigVersion
Cabal-syntax> Warning: Distribution.Types.PkgconfigVersionRange: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.PkgconfigVersionRange.Rep_PkgconfigVersionRange
Cabal-syntax> Warning: Distribution.Types.PkgconfigName: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.PkgconfigName.Rep_PkgconfigName
Cabal-syntax> Warning: Distribution.Types.PkgconfigDependency: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.PkgconfigDependency.Rep_PkgconfigDependency
Cabal-syntax> Warning: Distribution.Types.PackageName: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.PackageName.Rep_PackageName
Cabal-syntax> Warning: Distribution.Types.UnqualComponentName: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.UnqualComponentName.Rep_UnqualComponentName
Cabal-syntax> Warning: Distribution.Types.LibraryVisibility: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.LibraryVisibility.Rep_LibraryVisibility
Cabal-syntax> Warning: Distribution.Types.LibraryName: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.LibraryName.Rep_LibraryName
Cabal-syntax> Warning: Distribution.Types.MungedPackageName: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.MungedPackageName.Rep_MungedPackageName
Cabal-syntax> Warning: Distribution.Types.ForeignLibType: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.ForeignLibType.Rep_ForeignLibType
Cabal-syntax> Warning: Distribution.Types.ForeignLibOption: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.ForeignLibOption.Rep_ForeignLibOption
Cabal-syntax> Warning: Distribution.Types.Flag: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.Flag.Rep_FlagAssignment
Cabal-syntax>   - Distribution.Types.Flag.Rep_PackageFlag
Cabal-syntax>   - Distribution.Types.Flag.Rep_FlagName
Cabal-syntax> Warning: Distribution.Types.ExecutableScope: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.ExecutableScope.Rep_ExecutableScope
Cabal-syntax> Warning: Distribution.Types.ComponentName: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.ComponentName.NotLibComponentName
Cabal-syntax>   - Distribution.Types.ComponentName.Rep_ComponentName
Cabal-syntax> Warning: Distribution.Types.ComponentId: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.ComponentId.Rep_ComponentId
Cabal-syntax> Warning: Distribution.Types.BuildType: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.BuildType.Rep_BuildType
Cabal-syntax> Warning: Distribution.Types.AbiHash: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.AbiHash.Rep_AbiHash
Cabal-syntax> Warning: Distribution.System: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.System.Rep_Platform
Cabal-syntax>   - Distribution.System.Rep_Arch
Cabal-syntax>   - Distribution.System.Rep_OS
Cabal-syntax> Warning: Distribution.SPDX.LicenseReference: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.SPDX.LicenseReference.Rep_LicenseRef
Cabal-syntax> Warning: Distribution.SPDX.LicenseId: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax> Warning: Distribution.SPDX.LicenseExceptionId: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.SPDX.LicenseExceptionId.Rep_LicenseExceptionId
Cabal-syntax> Warning: Distribution.SPDX.LicenseExpression: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.SPDX.LicenseExpression.Rep_LicenseExpression
Cabal-syntax>   - Distribution.SPDX.LicenseExpression.Rep_SimpleLicenseExpression
Cabal-syntax> Warning: Distribution.SPDX.License: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.SPDX.License.Rep_License
Cabal-syntax> Warning: Distribution.SPDX: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.SPDX.LicenseReference.Rep_LicenseRef
Cabal-syntax>   - Distribution.SPDX.LicenseExceptionId.Rep_LicenseExceptionId
Cabal-syntax>   - Distribution.SPDX.LicenseExpression.Rep_LicenseExpression
Cabal-syntax>   - Distribution.SPDX.LicenseExpression.Rep_SimpleLicenseExpression
Cabal-syntax>   - Distribution.SPDX.License.Rep_License
Cabal-syntax> Warning: Distribution.ModuleName: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.ModuleName.Rep_ModuleName
Cabal-syntax> Warning: Distribution.Types.ModuleRenaming: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.ModuleRenaming.Rep_ModuleRenaming
Cabal-syntax> Warning: Distribution.Types.IncludeRenaming: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.IncludeRenaming.Rep_IncludeRenaming
Cabal-syntax> Warning: Distribution.Types.Mixin: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.Mixin.Rep_Mixin
Cabal-syntax> Warning: Distribution.Types.ModuleReexport: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.ModuleReexport.Rep_ModuleReexport
Cabal-syntax> Warning: Distribution.Compat.Graph: could not find link destinations for:
Cabal-syntax>   - Data.Graph.Rep_SCC
Cabal-syntax>   - Data.Graph.Rep1_SCC
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Compat.Graph.D:R:KeyEither
Cabal-syntax>   - Distribution.Compat.Graph.D:R:KeyNode
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.D:R:KeyInstalledPackageInfo
Cabal-syntax> Warning: Distribution.Version: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.Version.Rep_Version
Cabal-syntax>   - Distribution.Types.VersionRange.Internal.Rep_VersionRangeF
Cabal-syntax>   - Distribution.Types.VersionRange.Internal.Rep_VersionRange
Cabal-syntax> Warning: Distribution.Types.TestType: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.TestType.Rep_TestType
Cabal-syntax> Warning: Distribution.Types.TestSuiteInterface: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.TestSuiteInterface.Rep_TestSuiteInterface
Cabal-syntax> Warning: Distribution.Types.PackageId: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.PackageId.Rep_PackageIdentifier
Cabal-syntax> Warning: Distribution.Types.UnitId: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.UnitId.Rep_DefUnitId
Cabal-syntax>   - Distribution.Types.UnitId.Rep_UnitId
Cabal-syntax> Warning: Distribution.Types.Module: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.Module.Rep_Module
Cabal-syntax> Warning: Distribution.Backpack: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.UnitId.Rep_DefUnitId
Cabal-syntax>   - Distribution.Backpack.Rep_OpenModule
Cabal-syntax>   - Distribution.Backpack.Rep_OpenUnitId
Cabal-syntax> Warning: Distribution.Types.ExposedModule: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.ExposedModule.Rep_ExposedModule
Cabal-syntax> Warning: Distribution.Types.PackageVersionConstraint: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.PackageVersionConstraint.Rep_PackageVersionConstraint
Cabal-syntax> Warning: Distribution.Types.PackageId.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.PackageId.Rep_PackageIdentifier
Cabal-syntax> Warning: Distribution.Types.MungedPackageId: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.MungedPackageId.Rep_MungedPackageId
Cabal-syntax> Warning: Distribution.Types.LegacyExeDependency: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.LegacyExeDependency.Rep_LegacyExeDependency
Cabal-syntax> Warning: Distribution.Types.ExeDependency: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.ExeDependency.Rep_ExeDependency
Cabal-syntax> Warning: Distribution.Types.Dependency: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.Dependency.Rep_Dependency
Cabal-syntax> Warning: Distribution.Types.SetupBuildInfo: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.SetupBuildInfo.Rep_SetupBuildInfo
Cabal-syntax> Warning: Distribution.Types.SetupBuildInfo.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.SetupBuildInfo.Rep_SetupBuildInfo
Cabal-syntax> Warning: Distribution.Types.BenchmarkType: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.BenchmarkType.Rep_BenchmarkType
Cabal-syntax> Warning: Distribution.Types.BenchmarkInterface: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.BenchmarkInterface.Rep_BenchmarkInterface
Cabal-syntax> Warning: Distribution.Types.AbiDependency: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.AbiDependency.Rep_AbiDependency
Cabal-syntax> Warning: Distribution.License: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.License.Rep_License
Cabal-syntax> Warning: Distribution.Types.InstalledPackageInfo: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.ExposedModule.Rep_ExposedModule
Cabal-syntax>   - Distribution.Types.AbiDependency.Rep_AbiDependency
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.D:R:KeyInstalledPackageInfo
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.Rep_InstalledPackageInfo
Cabal-syntax> Warning: Distribution.Types.InstalledPackageInfo.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.D:R:KeyInstalledPackageInfo
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.Rep_InstalledPackageInfo
Cabal-syntax> Warning: Distribution.Fields: could not find link destinations for:
Cabal-syntax>   - Distribution.Parsec.Warning.Rep_PWarning
Cabal-syntax>   - Distribution.Parsec.Warning.Rep_PWarnType
Cabal-syntax>   - Distribution.Parsec.Error.Rep_PError
Cabal-syntax> Warning: Language.Haskell.Extension: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Language.Haskell.Extension.Rep_Extension
Cabal-syntax>   - Language.Haskell.Extension.Rep_KnownExtension
Cabal-syntax>   - Language.Haskell.Extension.Rep_Language
Cabal-syntax> Warning: Distribution.Compiler: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Compiler.Rep_CompilerInfo
Cabal-syntax>   - Distribution.Compiler.Rep_AbiTag
Cabal-syntax>   - Distribution.Compiler.Rep_CompilerId
Cabal-syntax>   - Distribution.Compiler.Rep_PerCompilerFlavor
Cabal-syntax>   - Distribution.Compiler.Rep_CompilerFlavor
Cabal-syntax> Warning: Distribution.Types.ConfVar: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.ConfVar.Rep_ConfVar
Cabal-syntax> Warning: Distribution.Types.BuildInfo: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.BuildInfo.Rep_BuildInfo
Cabal-syntax> Warning: Distribution.Types.BuildInfo.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.BuildInfo.Rep_BuildInfo
Cabal-syntax> Warning: Distribution.Types.TestSuite: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.TestSuite.Rep_TestSuite
Cabal-syntax> Warning: Distribution.Types.TestSuite.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.TestSuite.Rep_TestSuite
Cabal-syntax> Warning: Distribution.Types.Library: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.Library.Rep_Library
Cabal-syntax> Warning: Distribution.Types.Library.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.Library.Rep_Library
Cabal-syntax> Warning: Distribution.Types.ForeignLib: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.ForeignLib.Rep_ForeignLib
Cabal-syntax>   - Distribution.Types.ForeignLib.Rep_LibVersionInfo
Cabal-syntax> Warning: Distribution.Types.ForeignLib.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.ForeignLib.Rep_ForeignLib
Cabal-syntax> Warning: Distribution.Types.Executable: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.Executable.Rep_Executable
Cabal-syntax> Warning: Distribution.Types.Executable.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.Executable.Rep_Executable
Cabal-syntax> Warning: Distribution.Types.Benchmark: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.Benchmark.Rep_Benchmark
Cabal-syntax> Warning: Distribution.Types.Component: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.Component.Rep_Component
Cabal-syntax> Warning: Distribution.Types.ComponentRequestedSpec: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.ComponentRequestedSpec.Rep_ComponentRequestedSpec
Cabal-syntax> Warning: Distribution.Types.PackageDescription: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.PackageDescription.Rep_PackageDescription
Cabal-syntax> Warning: Distribution.Types.GenericPackageDescription: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.GenericPackageDescription.Rep_GenericPackageDescription
Cabal-syntax> Warning: Distribution.Types.GenericPackageDescription.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.Flag.Rep_PackageFlag
Cabal-syntax>   - Distribution.Types.Flag.Rep_FlagName
Cabal-syntax>   - Distribution.Types.ConfVar.Rep_ConfVar
Cabal-syntax>   - Distribution.Types.GenericPackageDescription.Rep_GenericPackageDescription
Cabal-syntax> Warning: Distribution.Types.Benchmark.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.Benchmark.Rep_Benchmark
Cabal-syntax> Warning: Distribution.Types.PackageDescription.Lens: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.PackageDescription.Rep_PackageDescription
Cabal-syntax> Warning: Distribution.Types.InstalledPackageInfo.FieldGrammar: could not find link destinations for:
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.FieldGrammar.Basic
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.FieldGrammar.SpecLicenseLenient
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.FieldGrammar.InstWith
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.FieldGrammar.CompatPackageKey
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.FieldGrammar.ExposedModules
Cabal-syntax> Warning: Distribution.InstalledPackageInfo: could not find link destinations for:
Cabal-syntax>   - Distribution.Utils.Structured.Tagged
Cabal-syntax>   - Distribution.Utils.Structured.structureHash'
Cabal-syntax>   - Distribution.Types.ExposedModule.Rep_ExposedModule
Cabal-syntax>   - Distribution.Types.AbiDependency.Rep_AbiDependency
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.D:R:KeyInstalledPackageInfo
Cabal-syntax>   - Distribution.Types.InstalledPackageInfo.Rep_InstalledPackageInfo
Cabal-syntax> Documentation created: dist/doc/html/Cabal-syntax/,
Cabal-syntax> dist/doc/html/Cabal-syntax/Cabal-syntax.txt
Cabal-syntax> Running phase: installPhase
Cabal-syntax> Installing library in /nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA
Cabal-syntax> Running phase: fixupPhase
Cabal-syntax> shrinking RPATHs of ELF executables and libraries in /nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0
Cabal-syntax> shrinking /nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSCabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA-ghc9.8.1.so
Cabal-syntax> checking for references to /build/ in /nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0...
Cabal-syntax> patching script interpreter paths in /nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0
Cabal-syntax> stripping (with command strip and flags -S -p) in  /nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0/lib
Cabal-syntax> shrinking RPATHs of ELF executables and libraries in /nix/store/px1i8v7rxcyjqmckridiwqgca8a9hsd7-Cabal-syntax-3.12.1.0-doc
Cabal-syntax> checking for references to /build/ in /nix/store/px1i8v7rxcyjqmckridiwqgca8a9hsd7-Cabal-syntax-3.12.1.0-doc...
Cabal-syntax> patching script interpreter paths in /nix/store/px1i8v7rxcyjqmckridiwqgca8a9hsd7-Cabal-syntax-3.12.1.0-doc
Cabal-syntax (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0 /nix/store/px1i8v7rxcyjqmckridiwqgca8a9hsd7-Cabal-syntax-3.12.1.0-doc
Cabal-syntax (post)> Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
Cabal-syntax (post)> 
Cabal-syntax (post)> Pushing /nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0 (180.00 MiB)
Cabal-syntax (post)> Pushing /nix/store/px1i8v7rxcyjqmckridiwqgca8a9hsd7-Cabal-syntax-3.12.1.0-doc (48.64 MiB)
Cabal-syntax (post)> 
Cabal-syntax (post)> All done.
Cabal-syntax (post)> added 2 signatures
Cabal-syntax (post)> added 10 signatures
Cabal-syntax (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0 /nix/store/px1i8v7rxcyjqmckridiwqgca8a9hsd7-Cabal-syntax-3.12.1.0-doc
Cabal-syntax (post)> copying 2 paths...
Cabal-syntax (post)> copying path '/nix/store/px1i8v7rxcyjqmckridiwqgca8a9hsd7-Cabal-syntax-3.12.1.0-doc' to 'https://cache.nix-ci.com'...
Cabal-syntax (post)> copying path '/nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0' to 'https://cache.nix-ci.com'...
Cabal-syntax (post)> copying 1 paths...
Cabal-syntax (post)> copying path '/nix/store/53mlbn192ckdzwrkvmhx342vkvbpbv6q-Cabal-syntax-3.12.1.0.drv' to 'https://cache.nix-ci.com'...
Cabal-syntax (post)> added 0 signatures
Cabal-syntax (post)> added 0 signatures
Cabal-syntax (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0 /nix/store/px1i8v7rxcyjqmckridiwqgca8a9hsd7-Cabal-syntax-3.12.1.0-doc
Cabal-syntax (post)> copying 2 paths...
Cabal-syntax (post)> copying path '/nix/store/px1i8v7rxcyjqmckridiwqgca8a9hsd7-Cabal-syntax-3.12.1.0-doc' to 'ssh-ng://worker.nix-ci.com'...
Cabal-syntax (post)> copying path '/nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0' to 'ssh-ng://worker.nix-ci.com'...
Cabal-syntax (post)> copying 1 paths...
Cabal-syntax (post)> copying path '/nix/store/53mlbn192ckdzwrkvmhx342vkvbpbv6q-Cabal-syntax-3.12.1.0.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/f4bz5nlf69zgfxikc7w98m13q3ysmw66-Cabal-3.12.1.0.drv'...
Cabal> Running phase: setupCompilerEnvironmentPhase
Cabal> Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
Cabal> Running phase: unpackPhase
Cabal> unpacking source archive /nix/store/i3lr7fx8fqyzvck858q213704kxk29dd-Cabal-3.12.1.0.tar.gz
Cabal> source root is Cabal-3.12.1.0
Cabal> setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "Cabal-3.12.1.0/src/Distribution/ZinzaPrelude.hs"
Cabal> Running phase: patchPhase
Cabal> Running phase: compileBuildDriverPhase
Cabal> setupCompileFlags: -package-db=/build/tmp.xUzyI6hGg1/setup-package.conf.d -threaded
Cabal> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.xUzyI6hGg1/Main.o )
Cabal> [2 of 2] Linking Setup
Cabal> Running phase: updateAutotoolsGnuConfigScriptsPhase
Cabal> Running phase: configurePhase
Cabal> configureFlags: --verbose --prefix=/nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/1v91j694fgvsssbz7lg6wgmrz6mpmvx6-Cabal-3.12.1.0-doc/share/doc/Cabal-3.12.1.0 --with-gcc=gcc --package-db=/build/tmp.xUzyI6hGg1/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --disable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
Cabal> Using Parsec parser
Cabal> Configuring Cabal-3.12.1.0...
Cabal> Dependency Cabal-syntax >=3.12.1.0 && <3.13: using Cabal-syntax-3.12.1.0
Cabal> Dependency array >=0.4.0.1 && <0.6: using array-0.5.6.0
Cabal> Dependency base >=4.11 && <5: using base-4.19.0.0
Cabal> Dependency bytestring >=0.10.0.0 && <0.13: using bytestring-0.12.0.2
Cabal> Dependency containers >=0.5.0.0 && <0.8: using containers-0.6.8
Cabal> Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
Cabal> Dependency directory >=1.2 && <1.4: using directory-1.3.8.1
Cabal> Dependency filepath >=1.3.0.1 && <1.6: using filepath-1.4.100.4
Cabal> Dependency mtl >=2.1 && <2.4: using mtl-2.3.1
Cabal> Dependency parsec >=3.1.13.0 && <3.2: using parsec-3.1.17.0
Cabal> Dependency pretty >=1.1.1 && <1.2: using pretty-1.1.3.6
Cabal> Dependency process >=1.2.1.0 && <1.7: using process-1.6.18.0
Cabal> Dependency time >=1.4.0.1 && <1.15: using time-1.12.2
Cabal> Dependency transformers >=0.3 && <0.4 || >=0.4.1.0 && <0.7: using
Cabal> transformers-0.6.1.0
Cabal> Dependency unix >=2.6.0.0 && <2.9: using unix-2.8.3.0
Cabal> Source component graph: component lib
Cabal> Configured component graph:
Cabal>     component Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q
Cabal>         include Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA
Cabal>         include array-0.5.6.0-dc89
Cabal>         include base-4.19.0.0-b960
Cabal>         include bytestring-0.12.0.2-4690
Cabal>         include containers-0.6.8-4775
Cabal>         include deepseq-1.5.0.0-412f
Cabal>         include directory-1.3.8.1-6a8e
Cabal>         include filepath-1.4.100.4-fa1c
Cabal>         include mtl-2.3.1-63a4
Cabal>         include parsec-3.1.17.0-389e
Cabal>         include pretty-1.1.3.6-0c70
Cabal>         include process-1.6.18.0-26fa
Cabal>         include time-1.12.2-d26d
Cabal>         include transformers-0.6.1.0-c3ec
Cabal>         include unix-2.8.3.0-8aa6
Cabal> Linked component graph:
Cabal>     unit Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q
Cabal>         include Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA
Cabal>         include array-0.5.6.0-dc89
Cabal>         include base-4.19.0.0-b960
Cabal>         include bytestring-0.12.0.2-4690
Cabal>         include containers-0.6.8-4775
Cabal>         include deepseq-1.5.0.0-412f
Cabal>         include directory-1.3.8.1-6a8e
Cabal>         include filepath-1.4.100.4-fa1c
Cabal>         include mtl-2.3.1-63a4
Cabal>         include parsec-3.1.17.0-389e
Cabal>         include pretty-1.1.3.6-0c70
Cabal>         include process-1.6.18.0-26fa
Cabal>         include time-1.12.2-d26d
Cabal>         include transformers-0.6.1.0-c3ec
Cabal>         include unix-2.8.3.0-8aa6
Cabal>         Distribution.Backpack=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Backpack,Distribution.Backpack.ComponentsGraph=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Backpack.ComponentsGraph,Distribution.Backpack.Configure=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Backpack.Configure,Distribution.Backpack.ConfiguredComponent=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Backpack.ConfiguredComponent,Distribution.Backpack.DescribeUnitId=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Backpack.DescribeUnitId,Distribution.Backpack.FullUnitId=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Backpack.FullUnitId,Distribution.Backpack.LinkedComponent=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Backpack.LinkedComponent,Distribution.Backpack.ModSubst=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Backpack.ModSubst,Distribution.Backpack.ModuleShape=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Backpack.ModuleShape,Distribution.Backpack.PreModuleShape=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Backpack.PreModuleShape,Distribution.CabalSpecVersion=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.CabalSpecVersion,Distribution.Compat.Binary=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.Binary,Distribution.Compat.CharParsing=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.CharParsing,Distribution.Compat.CreatePipe=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Compat.CreatePipe,Distribution.Compat.DList=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.DList,Distribution.Compat.Directory=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Compat.Directory,Distribution.Compat.Environment=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Compat.Environment,Distribution.Compat.Exception=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.Exception,Distribution.Compat.FilePath=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Compat.FilePath,Distribution.Compat.Graph=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.Graph,Distribution.Compat.Internal.TempFile=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Compat.Internal.TempFile,Distribution.Compat.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.Lens,Distribution.Compat.MonadFail=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.MonadFail,Distribution.Compat.Newtype=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.Newtype,Distribution.Compat.NonEmptySet=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.NonEmptySet,Distribution.Compat.Parsing=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.Parsing,Distribution.Compat.Prelude=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.Prelude,Distribution.Compat.Prelude.Internal=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Compat.Prelude.Internal,Distribution.Compat.Process=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Compat.Process,Distribution.Compat.ResponseFile=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Compat.ResponseFile,Distribution.Compat.Semigroup=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.Semigroup,Distribution.Compat.Stack=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Compat.Stack,Distribution.Compat.Time=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Compat.Time,Distribution.Compat.Typeable=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compat.Typeable,Distribution.Compiler=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Compiler,Distribution.FieldGrammar=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.FieldGrammar,Distribution.FieldGrammar.Class=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.FieldGrammar.Class,Distribution.FieldGrammar.FieldDescrs=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.FieldGrammar.FieldDescrs,Distribution.FieldGrammar.Newtypes=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.FieldGrammar.Newtypes,Distribution.FieldGrammar.Parsec=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.FieldGrammar.Parsec,Distribution.FieldGrammar.Pretty=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.FieldGrammar.Pretty,Distribution.Fields=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Fields,Distribution.Fields.ConfVar=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Fields.ConfVar,Distribution.Fields.Field=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Fields.Field,Distribution.Fields.Lexer=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Fields.Lexer,Distribution.Fields.LexerMonad=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Fields.LexerMonad,Distribution.Fields.ParseResult=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Fields.ParseResult,Distribution.Fields.Parser=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Fields.Parser,Distribution.Fields.Pretty=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Fields.Pretty,Distribution.InstalledPackageInfo=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.InstalledPackageInfo,Distribution.License=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.License,Distribution.Make=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Make,Distribution.ModuleName=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.ModuleName,Distribution.Package=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Package,Distribution.PackageDescription=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.PackageDescription,Distribution.PackageDescription.Check=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.PackageDescription.Check,Distribution.PackageDescription.Configuration=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.PackageDescription.Configuration,Distribution.PackageDescription.FieldGrammar=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.PackageDescription.FieldGrammar,Distribution.PackageDescription.Parsec=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.PackageDescription.Parsec,Distribution.PackageDescription.PrettyPrint=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.PackageDescription.PrettyPrint,Distribution.PackageDescription.Quirks=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.PackageDescription.Quirks,Distribution.PackageDescription.Utils=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.PackageDescription.Utils,Distribution.Parsec=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Parsec,Distribution.Parsec.Error=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Parsec.Error,Distribution.Parsec.FieldLineStream=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Parsec.FieldLineStream,Distribution.Parsec.Position=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Parsec.Position,Distribution.Parsec.Warning=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Parsec.Warning,Distribution.Pretty=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Pretty,Distribution.ReadE=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.ReadE,Distribution.SPDX=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.SPDX,Distribution.SPDX.License=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.SPDX.License,Distribution.SPDX.LicenseExceptionId=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.SPDX.LicenseExceptionId,Distribution.SPDX.LicenseExpression=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.SPDX.LicenseExpression,Distribution.SPDX.LicenseId=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.SPDX.LicenseId,Distribution.SPDX.LicenseListVersion=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.SPDX.LicenseListVersion,Distribution.SPDX.LicenseReference=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.SPDX.LicenseReference,Distribution.Simple=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple,Distribution.Simple.Bench=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Bench,Distribution.Simple.Build=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Build,Distribution.Simple.Build.Inputs=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Build.Inputs,Distribution.Simple.Build.Macros=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Build.Macros,Distribution.Simple.Build.PackageInfoModule=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Build.PackageInfoModule,Distribution.Simple.Build.PathsModule=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Build.PathsModule,Distribution.Simple.BuildPaths=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.BuildPaths,Distribution.Simple.BuildTarget=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.BuildTarget,Distribution.Simple.BuildToolDepends=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.BuildToolDepends,Distribution.Simple.CCompiler=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.CCompiler,Distribution.Simple.Command=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Command,Distribution.Simple.Compiler=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Compiler,Distribution.Simple.Configure=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Configure,Distribution.Simple.Errors=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Errors,Distribution.Simple.Flag=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Flag,Distribution.Simple.GHC=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.GHC,Distribution.Simple.GHCJS=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.GHCJS,Distribution.Simple.Glob=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Glob,Distribution.Simple.Glob.Internal=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Glob.Internal,Distribution.Simple.Haddock=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Haddock,Distribution.Simple.HaskellSuite=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.HaskellSuite,Distribution.Simple.Hpc=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Hpc,Distribution.Simple.Install=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Install,Distribution.Simple.InstallDirs=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.InstallDirs,Distribution.Simple.InstallDirs.Internal=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.InstallDirs.Internal,Distribution.Simple.LocalBuildInfo=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.LocalBuildInfo,Distribution.Simple.PackageDescription=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.PackageDescription,Distribution.Simple.PackageIndex=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.PackageIndex,Distribution.Simple.PreProcess=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.PreProcess,Distribution.Simple.PreProcess.Types=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.PreProcess.Types,Distribution.Simple.PreProcess.Unlit=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.PreProcess.Unlit,Distribution.Simple.Program=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Program,Distribution.Simple.Program.Ar=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Program.Ar,Distribution.Simple.Program.Builtin=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Program.Builtin,Distribution.Simple.Program.Db=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Program.Db,Distribution.Simple.Program.Find=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Program.Find,Distribution.Simple.Program.GHC=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Program.GHC,Distribution.Simple.Program.HcPkg=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Program.HcPkg,Distribution.Simple.Program.Hpc=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Program.Hpc,Distribution.Simple.Program.Internal=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Program.Internal,Distribution.Simple.Program.Ld=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Program.Ld,Distribution.Simple.Program.ResponseFile=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Program.ResponseFile,Distribution.Simple.Program.Run=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Program.Run,Distribution.Simple.Program.Script=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Program.Script,Distribution.Simple.Program.Strip=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Program.Strip,Distribution.Simple.Program.Types=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Program.Types,Distribution.Simple.Register=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Register,Distribution.Simple.Setup=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Setup,Distribution.Simple.ShowBuildInfo=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.ShowBuildInfo,Distribution.Simple.SrcDist=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.SrcDist,Distribution.Simple.Test=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Test,Distribution.Simple.Test.ExeV10=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Test.ExeV10,Distribution.Simple.Test.LibV09=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Test.LibV09,Distribution.Simple.Test.Log=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Test.Log,Distribution.Simple.UHC=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.UHC,Distribution.Simple.UserHooks=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.UserHooks,Distribution.Simple.Utils=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Simple.Utils,Distribution.System=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.System,Distribution.TestSuite=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.TestSuite,Distribution.Text=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Text,Distribution.Types.AbiDependency=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.AbiDependency,Distribution.Types.AbiHash=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.AbiHash,Distribution.Types.AnnotatedId=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Types.AnnotatedId,Distribution.Types.Benchmark=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Benchmark,Distribution.Types.Benchmark.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Benchmark.Lens,Distribution.Types.BenchmarkInterface=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.BenchmarkInterface,Distribution.Types.BenchmarkType=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.BenchmarkType,Distribution.Types.BuildInfo=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.BuildInfo,Distribution.Types.BuildInfo.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.BuildInfo.Lens,Distribution.Types.BuildType=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.BuildType,Distribution.Types.Component=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Component,Distribution.Types.ComponentId=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ComponentId,Distribution.Types.ComponentInclude=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Types.ComponentInclude,Distribution.Types.ComponentLocalBuildInfo=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Types.ComponentLocalBuildInfo,Distribution.Types.ComponentName=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ComponentName,Distribution.Types.ComponentRequestedSpec=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ComponentRequestedSpec,Distribution.Types.CondTree=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.CondTree,Distribution.Types.Condition=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Condition,Distribution.Types.ConfVar=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ConfVar,Distribution.Types.Dependency=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Dependency,Distribution.Types.DependencyMap=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.DependencyMap,Distribution.Types.DumpBuildInfo=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Types.DumpBuildInfo,Distribution.Types.ExeDependency=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ExeDependency,Distribution.Types.Executable=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Executable,Distribution.Types.Executable.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Executable.Lens,Distribution.Types.ExecutableScope=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ExecutableScope,Distribution.Types.ExposedModule=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ExposedModule,Distribution.Types.Flag=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Flag,Distribution.Types.ForeignLib=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ForeignLib,Distribution.Types.ForeignLib.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ForeignLib.Lens,Distribution.Types.ForeignLibOption=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ForeignLibOption,Distribution.Types.ForeignLibType=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ForeignLibType,Distribution.Types.GenericPackageDescription=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.GenericPackageDescription,Distribution.Types.GenericPackageDescription.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.GenericPackageDescription.Lens,Distribution.Types.GivenComponent=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Types.GivenComponent,Distribution.Types.HookedBuildInfo=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.HookedBuildInfo,Distribution.Types.IncludeRenaming=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.IncludeRenaming,Distribution.Types.InstalledPackageInfo=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.InstalledPackageInfo,Distribution.Types.InstalledPackageInfo.FieldGrammar=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.InstalledPackageInfo.FieldGrammar,Distribution.Types.InstalledPackageInfo.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.InstalledPackageInfo.Lens,Distribution.Types.LegacyExeDependency=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.LegacyExeDependency,Distribution.Types.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Lens,Distribution.Types.Library=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Library,Distribution.Types.Library.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Library.Lens,Distribution.Types.LibraryName=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.LibraryName,Distribution.Types.LibraryVisibility=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.LibraryVisibility,Distribution.Types.LocalBuildConfig=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Types.LocalBuildConfig,Distribution.Types.LocalBuildInfo=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Types.LocalBuildInfo,Distribution.Types.Mixin=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Mixin,Distribution.Types.Module=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Module,Distribution.Types.ModuleReexport=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ModuleReexport,Distribution.Types.ModuleRenaming=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.ModuleRenaming,Distribution.Types.MungedPackageId=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.MungedPackageId,Distribution.Types.MungedPackageName=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.MungedPackageName,Distribution.Types.PackageDescription=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PackageDescription,Distribution.Types.PackageDescription.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PackageDescription.Lens,Distribution.Types.PackageId=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PackageId,Distribution.Types.PackageId.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PackageId.Lens,Distribution.Types.PackageName=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PackageName,Distribution.Types.PackageName.Magic=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Types.PackageName.Magic,Distribution.Types.PackageVersionConstraint=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PackageVersionConstraint,Distribution.Types.ParStrat=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Types.ParStrat,Distribution.Types.PkgconfigDependency=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PkgconfigDependency,Distribution.Types.PkgconfigName=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PkgconfigName,Distribution.Types.PkgconfigVersion=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PkgconfigVersion,Distribution.Types.PkgconfigVersionRange=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.PkgconfigVersionRange,Distribution.Types.SetupBuildInfo=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.SetupBuildInfo,Distribution.Types.SetupBuildInfo.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.SetupBuildInfo.Lens,Distribution.Types.SourceRepo=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.SourceRepo,Distribution.Types.SourceRepo.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.SourceRepo.Lens,Distribution.Types.TargetInfo=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Types.TargetInfo,Distribution.Types.TestSuite=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.TestSuite,Distribution.Types.TestSuite.Lens=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.TestSuite.Lens,Distribution.Types.TestSuiteInterface=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.TestSuiteInterface,Distribution.Types.TestType=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.TestType,Distribution.Types.UnitId=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.UnitId,Distribution.Types.UnqualComponentName=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.UnqualComponentName,Distribution.Types.Version=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.Version,Distribution.Types.VersionInterval=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.VersionInterval,Distribution.Types.VersionInterval.Legacy=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.VersionInterval.Legacy,Distribution.Types.VersionRange=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.VersionRange,Distribution.Types.VersionRange.Internal=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Types.VersionRange.Internal,Distribution.Utils.Base62=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Utils.Base62,Distribution.Utils.Generic=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Utils.Generic,Distribution.Utils.IOData=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Utils.IOData,Distribution.Utils.Json=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Utils.Json,Distribution.Utils.LogProgress=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Utils.LogProgress,Distribution.Utils.MD5=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Utils.MD5,Distribution.Utils.MapAccum=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Utils.MapAccum,Distribution.Utils.NubList=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Utils.NubList,Distribution.Utils.Path=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Utils.Path,Distribution.Utils.Progress=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Utils.Progress,Distribution.Utils.ShortText=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Utils.ShortText,Distribution.Utils.String=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Utils.String,Distribution.Utils.Structured=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Utils.Structured,Distribution.Verbosity=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Verbosity,Distribution.Verbosity.Internal=Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q:Distribution.Verbosity.Internal,Distribution.Version=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Distribution.Version,Language.Haskell.Extension=Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA:Language.Haskell.Extension
Cabal> Ready component graph:
Cabal>     definite Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q
Cabal>         depends Cabal-syntax-3.12.1.0-FQXVNAMUkuRJMKfeTIzMQA
Cabal>         depends array-0.5.6.0-dc89
Cabal>         depends base-4.19.0.0-b960
Cabal>         depends bytestring-0.12.0.2-4690
Cabal>         depends containers-0.6.8-4775
Cabal>         depends deepseq-1.5.0.0-412f
Cabal>         depends directory-1.3.8.1-6a8e
Cabal>         depends filepath-1.4.100.4-fa1c
Cabal>         depends mtl-2.3.1-63a4
Cabal>         depends parsec-3.1.17.0-389e
Cabal>         depends pretty-1.1.3.6-0c70
Cabal>         depends process-1.6.18.0-26fa
Cabal>         depends time-1.12.2-d26d
Cabal>         depends transformers-0.6.1.0-c3ec
Cabal>         depends unix-2.8.3.0-8aa6
Cabal> Using Cabal-3.10.2.0 compiled by ghc-9.8
Cabal> Using compiler: ghc-9.8.1
Cabal> Using install prefix:
Cabal> /nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0
Cabal> Executables installed in:
Cabal> /nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0/bin
Cabal> Libraries installed in:
Cabal> /nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q
Cabal> Dynamic Libraries installed in:
Cabal> /nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
Cabal> Private executables installed in:
Cabal> /nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0/libexec/x86_64-linux-ghc-9.8.1/Cabal-3.12.1.0
Cabal> Data files installed in:
Cabal> /nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0/share/x86_64-linux-ghc-9.8.1/Cabal-3.12.1.0
Cabal> Documentation installed in:
Cabal> /nix/store/1v91j694fgvsssbz7lg6wgmrz6mpmvx6-Cabal-3.12.1.0-doc/share/doc/Cabal-3.12.1.0
Cabal> Configuration files installed in:
Cabal> /nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0/etc
Cabal> No alex found
Cabal> Using ar found on system at:
Cabal> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
Cabal> No c2hs found
Cabal> No cpphs found
Cabal> No doctest found
Cabal> Using gcc version 14.3.0 given by user at:
Cabal> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
Cabal> Using ghc version 9.8.1 found on system at:
Cabal> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
Cabal> Using ghc-pkg version 9.8.1 found on system at:
Cabal> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
Cabal> No ghcjs found
Cabal> No ghcjs-pkg found
Cabal> No greencard found
Cabal> Using haddock version 2.30.0 found on system at:
Cabal> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
Cabal> No happy found
Cabal> Using haskell-suite found on system at: haskell-suite-dummy-location
Cabal> Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
Cabal> No hmake found
Cabal> Using hpc version 0.69 found on system at:
Cabal> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
Cabal> Using hsc2hs version 0.68.10 found on system at:
Cabal> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
Cabal> Using hscolour version 1.25 found on system at:
Cabal> /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
Cabal> No jhc found
Cabal> Using ld found on system at:
Cabal> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
Cabal> No pkg-config found
Cabal> Using runghc version 9.8.1 found on system at:
Cabal> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
Cabal> Using strip version 2.44 found on system at:
Cabal> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
Cabal> Using tar found on system at:
Cabal> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
Cabal> No uhc found
Cabal> Running phase: buildPhase
Cabal> Preprocessing library for Cabal-3.12.1.0..
Cabal> Building library for Cabal-3.12.1.0..
Cabal> [  1 of 146] Compiling Distribution.Backpack.FullUnitId ( src/Distribution/Backpack/FullUnitId.hs, dist/build/Distribution/Backpack/FullUnitId.o, dist/build/Distribution/Backpack/FullUnitId.dyn_o )
Cabal> [  2 of 146] Compiling Distribution.Backpack.ModSubst ( src/Distribution/Backpack/ModSubst.hs, dist/build/Distribution/Backpack/ModSubst.o, dist/build/Distribution/Backpack/ModSubst.dyn_o )
Cabal> [  3 of 146] Compiling Distribution.Backpack.ModuleScope ( src/Distribution/Backpack/ModuleScope.hs, dist/build/Distribution/Backpack/ModuleScope.o, dist/build/Distribution/Backpack/ModuleScope.dyn_o )
Cabal> [  4 of 146] Compiling Distribution.Backpack.ModuleShape ( src/Distribution/Backpack/ModuleShape.hs, dist/build/Distribution/Backpack/ModuleShape.o, dist/build/Distribution/Backpack/ModuleShape.dyn_o )
Cabal> [  5 of 146] Compiling Distribution.Backpack.PreModuleShape ( src/Distribution/Backpack/PreModuleShape.hs, dist/build/Distribution/Backpack/PreModuleShape.o, dist/build/Distribution/Backpack/PreModuleShape.dyn_o )
Cabal> [  6 of 146] Compiling Distribution.Compat.Async ( src/Distribution/Compat/Async.hs, dist/build/Distribution/Compat/Async.o, dist/build/Distribution/Compat/Async.dyn_o )
Cabal> [  7 of 146] Compiling Distribution.Compat.CreatePipe ( src/Distribution/Compat/CreatePipe.hs, dist/build/Distribution/Compat/CreatePipe.o, dist/build/Distribution/Compat/CreatePipe.dyn_o )
Cabal> [  8 of 146] Compiling Distribution.Compat.Directory ( src/Distribution/Compat/Directory.hs, dist/build/Distribution/Compat/Directory.o, dist/build/Distribution/Compat/Directory.dyn_o )
Cabal> [  9 of 146] Compiling Distribution.Compat.FilePath ( src/Distribution/Compat/FilePath.hs, dist/build/Distribution/Compat/FilePath.o, dist/build/Distribution/Compat/FilePath.dyn_o )
Cabal> [ 10 of 146] Compiling Distribution.Compat.GetShortPathName ( src/Distribution/Compat/GetShortPathName.hs, dist/build/Distribution/Compat/GetShortPathName.o, dist/build/Distribution/Compat/GetShortPathName.dyn_o )
Cabal> [ 11 of 146] Compiling Distribution.Compat.Internal.TempFile ( src/Distribution/Compat/Internal/TempFile.hs, dist/build/Distribution/Compat/Internal/TempFile.o, dist/build/Distribution/Compat/Internal/TempFile.dyn_o )
Cabal> [ 12 of 146] Compiling Distribution.Compat.CopyFile ( src/Distribution/Compat/CopyFile.hs, dist/build/Distribution/Compat/CopyFile.o, dist/build/Distribution/Compat/CopyFile.dyn_o )
Cabal> [ 13 of 146] Compiling Distribution.Compat.Prelude.Internal ( src/Distribution/Compat/Prelude/Internal.hs, dist/build/Distribution/Compat/Prelude/Internal.o, dist/build/Distribution/Compat/Prelude/Internal.dyn_o )
Cabal> [ 14 of 146] Compiling Distribution.Compat.Process ( src/Distribution/Compat/Process.hs, dist/build/Distribution/Compat/Process.o, dist/build/Distribution/Compat/Process.dyn_o )
Cabal> [ 15 of 146] Compiling Distribution.Compat.ResponseFile ( src/Distribution/Compat/ResponseFile.hs, dist/build/Distribution/Compat/ResponseFile.o, dist/build/Distribution/Compat/ResponseFile.dyn_o )
Cabal> [ 16 of 146] Compiling Distribution.Compat.SnocList ( src/Distribution/Compat/SnocList.hs, dist/build/Distribution/Compat/SnocList.o, dist/build/Distribution/Compat/SnocList.dyn_o )
Cabal> [ 17 of 146] Compiling Distribution.Compat.Stack ( src/Distribution/Compat/Stack.hs, dist/build/Distribution/Compat/Stack.o, dist/build/Distribution/Compat/Stack.dyn_o )
Cabal> [ 18 of 146] Compiling Distribution.Compat.Environment ( src/Distribution/Compat/Environment.hs, dist/build/Distribution/Compat/Environment.o, dist/build/Distribution/Compat/Environment.dyn_o )
Cabal> [ 19 of 146] Compiling Distribution.GetOpt ( src/Distribution/GetOpt.hs, dist/build/Distribution/GetOpt.o, dist/build/Distribution/GetOpt.dyn_o )
Cabal> [ 20 of 146] Compiling Distribution.Lex ( src/Distribution/Lex.hs, dist/build/Distribution/Lex.o, dist/build/Distribution/Lex.dyn_o )
Cabal> [ 21 of 146] Compiling Distribution.PackageDescription.Check.Warning ( src/Distribution/PackageDescription/Check/Warning.hs, dist/build/Distribution/PackageDescription/Check/Warning.o, dist/build/Distribution/PackageDescription/Check/Warning.dyn_o )
Cabal> [ 22 of 146] Compiling Distribution.ReadE ( src/Distribution/ReadE.hs, dist/build/Distribution/ReadE.o, dist/build/Distribution/ReadE.dyn_o )
Cabal> [ 23 of 146] Compiling Distribution.Simple.BuildToolDepends ( src/Distribution/Simple/BuildToolDepends.hs, dist/build/Distribution/Simple/BuildToolDepends.o, dist/build/Distribution/Simple/BuildToolDepends.dyn_o )
Cabal> [ 24 of 146] Compiling Distribution.Simple.CCompiler ( src/Distribution/Simple/CCompiler.hs, dist/build/Distribution/Simple/CCompiler.o, dist/build/Distribution/Simple/CCompiler.dyn_o )
Cabal> [ 25 of 146] Compiling Distribution.Simple.Flag ( src/Distribution/Simple/Flag.hs, dist/build/Distribution/Simple/Flag.o, dist/build/Distribution/Simple/Flag.dyn_o )
Cabal> [ 26 of 146] Compiling Distribution.Simple.InstallDirs.Internal ( src/Distribution/Simple/InstallDirs/Internal.hs, dist/build/Distribution/Simple/InstallDirs/Internal.o, dist/build/Distribution/Simple/InstallDirs/Internal.dyn_o )
Cabal> [ 27 of 146] Compiling Distribution.Simple.InstallDirs ( src/Distribution/Simple/InstallDirs.hs, dist/build/Distribution/Simple/InstallDirs.o, dist/build/Distribution/Simple/InstallDirs.dyn_o )
Cabal> [ 28 of 146] Compiling Distribution.Simple.Program.Internal ( src/Distribution/Simple/Program/Internal.hs, dist/build/Distribution/Simple/Program/Internal.o, dist/build/Distribution/Simple/Program/Internal.dyn_o )
Cabal> [ 29 of 146] Compiling Distribution.TestSuite ( src/Distribution/TestSuite.hs, dist/build/Distribution/TestSuite.o, dist/build/Distribution/TestSuite.dyn_o )
Cabal> [ 30 of 146] Compiling Distribution.Types.AnnotatedId ( src/Distribution/Types/AnnotatedId.hs, dist/build/Distribution/Types/AnnotatedId.o, dist/build/Distribution/Types/AnnotatedId.dyn_o )
Cabal> [ 31 of 146] Compiling Distribution.Backpack.PreExistingComponent ( src/Distribution/Backpack/PreExistingComponent.hs, dist/build/Distribution/Backpack/PreExistingComponent.o, dist/build/Distribution/Backpack/PreExistingComponent.dyn_o )
Cabal> [ 32 of 146] Compiling Distribution.Types.ComponentInclude ( src/Distribution/Types/ComponentInclude.hs, dist/build/Distribution/Types/ComponentInclude.o, dist/build/Distribution/Types/ComponentInclude.dyn_o )
Cabal> [ 33 of 146] Compiling Distribution.Types.ComponentLocalBuildInfo ( src/Distribution/Types/ComponentLocalBuildInfo.hs, dist/build/Distribution/Types/ComponentLocalBuildInfo.o, dist/build/Distribution/Types/ComponentLocalBuildInfo.dyn_o )
Cabal> [ 34 of 146] Compiling Distribution.Types.DumpBuildInfo ( src/Distribution/Types/DumpBuildInfo.hs, dist/build/Distribution/Types/DumpBuildInfo.o, dist/build/Distribution/Types/DumpBuildInfo.dyn_o )
Cabal> [ 35 of 146] Compiling Distribution.Types.GivenComponent ( src/Distribution/Types/GivenComponent.hs, dist/build/Distribution/Types/GivenComponent.o, dist/build/Distribution/Types/GivenComponent.dyn_o )
Cabal> [ 36 of 146] Compiling Distribution.Types.PackageName.Magic ( src/Distribution/Types/PackageName/Magic.hs, dist/build/Distribution/Types/PackageName/Magic.o, dist/build/Distribution/Types/PackageName/Magic.dyn_o )
Cabal> [ 37 of 146] Compiling Distribution.Types.ParStrat ( src/Distribution/Types/ParStrat.hs, dist/build/Distribution/Types/ParStrat.o, dist/build/Distribution/Types/ParStrat.dyn_o )
Cabal> [ 38 of 146] Compiling Distribution.Types.TargetInfo ( src/Distribution/Types/TargetInfo.hs, dist/build/Distribution/Types/TargetInfo.o, dist/build/Distribution/Types/TargetInfo.dyn_o )
Cabal> [ 39 of 146] Compiling Distribution.Utils.IOData ( src/Distribution/Utils/IOData.hs, dist/build/Distribution/Utils/IOData.o, dist/build/Distribution/Utils/IOData.dyn_o )
Cabal> [ 40 of 146] Compiling Distribution.Utils.Json ( src/Distribution/Utils/Json.hs, dist/build/Distribution/Utils/Json.o, dist/build/Distribution/Utils/Json.dyn_o )
Cabal> [ 41 of 146] Compiling Distribution.Utils.MapAccum ( src/Distribution/Utils/MapAccum.hs, dist/build/Distribution/Utils/MapAccum.o, dist/build/Distribution/Utils/MapAccum.dyn_o )
Cabal> [ 42 of 146] Compiling Distribution.Utils.Progress ( src/Distribution/Utils/Progress.hs, dist/build/Distribution/Utils/Progress.o, dist/build/Distribution/Utils/Progress.dyn_o )
Cabal> [ 43 of 146] Compiling Distribution.Utils.UnionFind ( src/Distribution/Utils/UnionFind.hs, dist/build/Distribution/Utils/UnionFind.o, dist/build/Distribution/Utils/UnionFind.dyn_o )
Cabal> [ 44 of 146] Compiling Distribution.Verbosity.Internal ( src/Distribution/Verbosity/Internal.hs, dist/build/Distribution/Verbosity/Internal.o, dist/build/Distribution/Verbosity/Internal.dyn_o )
Cabal> [ 45 of 146] Compiling Distribution.Verbosity ( src/Distribution/Verbosity.hs, dist/build/Distribution/Verbosity.o, dist/build/Distribution/Verbosity.dyn_o )
Cabal> [ 46 of 146] Compiling Distribution.Simple.Program.Types ( src/Distribution/Simple/Program/Types.hs, dist/build/Distribution/Simple/Program/Types.o, dist/build/Distribution/Simple/Program/Types.dyn_o )
Cabal> [ 47 of 146] Compiling Distribution.Simple.PreProcess.Types ( src/Distribution/Simple/PreProcess/Types.hs, dist/build/Distribution/Simple/PreProcess/Types.o, dist/build/Distribution/Simple/PreProcess/Types.dyn_o )
Cabal> [ 48 of 146] Compiling Distribution.Simple.Errors ( src/Distribution/Simple/Errors.hs, dist/build/Distribution/Simple/Errors.o, dist/build/Distribution/Simple/Errors.dyn_o )
Cabal> [ 49 of 146] Compiling Distribution.Simple.PreProcess.Unlit ( src/Distribution/Simple/PreProcess/Unlit.hs, dist/build/Distribution/Simple/PreProcess/Unlit.o, dist/build/Distribution/Simple/PreProcess/Unlit.dyn_o )
Cabal> [ 50 of 146] Compiling Distribution.Backpack.UnifyM ( src/Distribution/Backpack/UnifyM.hs, dist/build/Distribution/Backpack/UnifyM.o, dist/build/Distribution/Backpack/UnifyM.dyn_o )
Cabal> [ 51 of 146] Compiling Distribution.Backpack.MixLink ( src/Distribution/Backpack/MixLink.hs, dist/build/Distribution/Backpack/MixLink.o, dist/build/Distribution/Backpack/MixLink.dyn_o )
Cabal> [ 52 of 146] Compiling Distribution.ZinzaPrelude ( src/Distribution/ZinzaPrelude.hs, dist/build/Distribution/ZinzaPrelude.o, dist/build/Distribution/ZinzaPrelude.dyn_o )
Cabal> [ 53 of 146] Compiling Distribution.Simple.Build.PathsModule.Z ( src/Distribution/Simple/Build/PathsModule/Z.hs, dist/build/Distribution/Simple/Build/PathsModule/Z.o, dist/build/Distribution/Simple/Build/PathsModule/Z.dyn_o )
Cabal> [ 54 of 146] Compiling Distribution.Simple.Build.PackageInfoModule.Z ( src/Distribution/Simple/Build/PackageInfoModule/Z.hs, dist/build/Distribution/Simple/Build/PackageInfoModule/Z.o, dist/build/Distribution/Simple/Build/PackageInfoModule/Z.dyn_o )
Cabal> [ 55 of 146] Compiling Distribution.Simple.Build.Macros.Z ( src/Distribution/Simple/Build/Macros/Z.hs, dist/build/Distribution/Simple/Build/Macros/Z.o, dist/build/Distribution/Simple/Build/Macros/Z.dyn_o )
Cabal> [ 56 of 146] Compiling Paths_Cabal      ( dist/build/autogen/Paths_Cabal.hs, dist/build/Paths_Cabal.o, dist/build/Paths_Cabal.dyn_o )
Cabal> [ 57 of 146] Compiling Distribution.Simple.Utils ( src/Distribution/Simple/Utils.hs, dist/build/Distribution/Simple/Utils.o, dist/build/Distribution/Simple/Utils.dyn_o )
Cabal> [ 58 of 146] Compiling Distribution.Utils.NubList ( src/Distribution/Utils/NubList.hs, dist/build/Distribution/Utils/NubList.o, dist/build/Distribution/Utils/NubList.dyn_o )
Cabal> [ 59 of 146] Compiling Distribution.Utils.LogProgress ( src/Distribution/Utils/LogProgress.hs, dist/build/Distribution/Utils/LogProgress.o, dist/build/Distribution/Utils/LogProgress.dyn_o )
Cabal> [ 60 of 146] Compiling Distribution.Simple.Program.Run ( src/Distribution/Simple/Program/Run.hs, dist/build/Distribution/Simple/Program/Run.o, dist/build/Distribution/Simple/Program/Run.dyn_o )
Cabal> [ 61 of 146] Compiling Distribution.Simple.Program.Script ( src/Distribution/Simple/Program/Script.hs, dist/build/Distribution/Simple/Program/Script.o, dist/build/Distribution/Simple/Program/Script.dyn_o )
Cabal> [ 62 of 146] Compiling Distribution.Simple.Program.ResponseFile ( src/Distribution/Simple/Program/ResponseFile.hs, dist/build/Distribution/Simple/Program/ResponseFile.o, dist/build/Distribution/Simple/Program/ResponseFile.dyn_o )
Cabal> [ 63 of 146] Compiling Distribution.Simple.Program.Hpc ( src/Distribution/Simple/Program/Hpc.hs, dist/build/Distribution/Simple/Program/Hpc.o, dist/build/Distribution/Simple/Program/Hpc.dyn_o )
Cabal> [ 64 of 146] Compiling Distribution.Simple.Program.Find ( src/Distribution/Simple/Program/Find.hs, dist/build/Distribution/Simple/Program/Find.o, dist/build/Distribution/Simple/Program/Find.dyn_o )
Cabal> [ 65 of 146] Compiling Distribution.Simple.PackageIndex ( src/Distribution/Simple/PackageIndex.hs, dist/build/Distribution/Simple/PackageIndex.o, dist/build/Distribution/Simple/PackageIndex.dyn_o )
Cabal> [ 66 of 146] Compiling Distribution.Simple.PackageDescription ( src/Distribution/Simple/PackageDescription.hs, dist/build/Distribution/Simple/PackageDescription.o, dist/build/Distribution/Simple/PackageDescription.dyn_o )
Cabal> [ 67 of 146] Compiling Distribution.Simple.Glob.Internal ( src/Distribution/Simple/Glob/Internal.hs, dist/build/Distribution/Simple/Glob/Internal.o, dist/build/Distribution/Simple/Glob/Internal.dyn_o )
Cabal> [ 68 of 146] Compiling Distribution.Simple.Glob ( src/Distribution/Simple/Glob.hs, dist/build/Distribution/Simple/Glob.o, dist/build/Distribution/Simple/Glob.dyn_o )
Cabal> [ 69 of 146] Compiling Distribution.PackageDescription.Check.Monad ( src/Distribution/PackageDescription/Check/Monad.hs, dist/build/Distribution/PackageDescription/Check/Monad.o, dist/build/Distribution/PackageDescription/Check/Monad.dyn_o )
Cabal> [ 70 of 146] Compiling Distribution.PackageDescription.Check.Conditional ( src/Distribution/PackageDescription/Check/Conditional.hs, dist/build/Distribution/PackageDescription/Check/Conditional.o, dist/build/Distribution/PackageDescription/Check/Conditional.dyn_o )
Cabal> [ 71 of 146] Compiling Distribution.PackageDescription.Check.Common ( src/Distribution/PackageDescription/Check/Common.hs, dist/build/Distribution/PackageDescription/Check/Common.o, dist/build/Distribution/PackageDescription/Check/Common.dyn_o )
Cabal> [ 72 of 146] Compiling Distribution.Simple.Compiler ( src/Distribution/Simple/Compiler.hs, dist/build/Distribution/Simple/Compiler.o, dist/build/Distribution/Simple/Compiler.dyn_o )
Cabal> [ 73 of 146] Compiling Distribution.Simple.Program.HcPkg ( src/Distribution/Simple/Program/HcPkg.hs, dist/build/Distribution/Simple/Program/HcPkg.o, dist/build/Distribution/Simple/Program/HcPkg.dyn_o )
Cabal> [ 74 of 146] Compiling Distribution.Simple.GHC.ImplInfo ( src/Distribution/Simple/GHC/ImplInfo.hs, dist/build/Distribution/Simple/GHC/ImplInfo.o, dist/build/Distribution/Simple/GHC/ImplInfo.dyn_o )
Cabal> [ 75 of 146] Compiling Distribution.Simple.Program.GHC ( src/Distribution/Simple/Program/GHC.hs, dist/build/Distribution/Simple/Program/GHC.o, dist/build/Distribution/Simple/Program/GHC.dyn_o )
Cabal> [ 76 of 146] Compiling Distribution.Simple.Program.Builtin ( src/Distribution/Simple/Program/Builtin.hs, dist/build/Distribution/Simple/Program/Builtin.o, dist/build/Distribution/Simple/Program/Builtin.dyn_o )
Cabal> [ 77 of 146] Compiling Distribution.Simple.Program.Db ( src/Distribution/Simple/Program/Db.hs, dist/build/Distribution/Simple/Program/Db.o, dist/build/Distribution/Simple/Program/Db.dyn_o )
Cabal> [ 78 of 146] Compiling Distribution.Simple.Program ( src/Distribution/Simple/Program.hs, dist/build/Distribution/Simple/Program.o, dist/build/Distribution/Simple/Program.dyn_o )
Cabal> [ 79 of 146] Compiling Distribution.Simple.Program.Strip ( src/Distribution/Simple/Program/Strip.hs, dist/build/Distribution/Simple/Program/Strip.o, dist/build/Distribution/Simple/Program/Strip.dyn_o )
Cabal> [ 80 of 146] Compiling Distribution.Simple.Command ( src/Distribution/Simple/Command.hs, dist/build/Distribution/Simple/Command.o, dist/build/Distribution/Simple/Command.dyn_o )
Cabal> [ 81 of 146] Compiling Distribution.Simple.Setup.Common ( src/Distribution/Simple/Setup/Common.hs, dist/build/Distribution/Simple/Setup/Common.o, dist/build/Distribution/Simple/Setup/Common.dyn_o )
Cabal> [ 82 of 146] Compiling Distribution.Simple.Setup.Test ( src/Distribution/Simple/Setup/Test.hs, dist/build/Distribution/Simple/Setup/Test.o, dist/build/Distribution/Simple/Setup/Test.dyn_o )
Cabal> [ 83 of 146] Compiling Distribution.Simple.Setup.SDist ( src/Distribution/Simple/Setup/SDist.hs, dist/build/Distribution/Simple/Setup/SDist.o, dist/build/Distribution/Simple/Setup/SDist.dyn_o )
Cabal> [ 84 of 146] Compiling Distribution.Simple.Setup.Repl ( src/Distribution/Simple/Setup/Repl.hs, dist/build/Distribution/Simple/Setup/Repl.o, dist/build/Distribution/Simple/Setup/Repl.dyn_o )
Cabal> [ 85 of 146] Compiling Distribution.Simple.Setup.Register ( src/Distribution/Simple/Setup/Register.hs, dist/build/Distribution/Simple/Setup/Register.o, dist/build/Distribution/Simple/Setup/Register.dyn_o )
Cabal> [ 86 of 146] Compiling Distribution.Simple.Setup.Install ( src/Distribution/Simple/Setup/Install.hs, dist/build/Distribution/Simple/Setup/Install.o, dist/build/Distribution/Simple/Setup/Install.dyn_o )
Cabal> [ 87 of 146] Compiling Distribution.Simple.Setup.Hscolour ( src/Distribution/Simple/Setup/Hscolour.hs, dist/build/Distribution/Simple/Setup/Hscolour.o, dist/build/Distribution/Simple/Setup/Hscolour.dyn_o )
Cabal> [ 88 of 146] Compiling Distribution.Simple.Setup.Haddock ( src/Distribution/Simple/Setup/Haddock.hs, dist/build/Distribution/Simple/Setup/Haddock.o, dist/build/Distribution/Simple/Setup/Haddock.dyn_o )
Cabal> [ 89 of 146] Compiling Distribution.Simple.Setup.Global ( src/Distribution/Simple/Setup/Global.hs, dist/build/Distribution/Simple/Setup/Global.o, dist/build/Distribution/Simple/Setup/Global.dyn_o )
Cabal> [ 90 of 146] Compiling Distribution.Simple.Setup.Copy ( src/Distribution/Simple/Setup/Copy.hs, dist/build/Distribution/Simple/Setup/Copy.o, dist/build/Distribution/Simple/Setup/Copy.dyn_o )
Cabal> [ 91 of 146] Compiling Distribution.Simple.Setup.Config ( src/Distribution/Simple/Setup/Config.hs, dist/build/Distribution/Simple/Setup/Config.o, dist/build/Distribution/Simple/Setup/Config.dyn_o )
Cabal> [ 92 of 146] Compiling Distribution.Types.LocalBuildConfig ( src/Distribution/Types/LocalBuildConfig.hs, dist/build/Distribution/Types/LocalBuildConfig.o, dist/build/Distribution/Types/LocalBuildConfig.dyn_o )
Cabal> [ 93 of 146] Compiling Distribution.Types.LocalBuildInfo ( src/Distribution/Types/LocalBuildInfo.hs, dist/build/Distribution/Types/LocalBuildInfo.o, dist/build/Distribution/Types/LocalBuildInfo.dyn_o )
Cabal> [ 94 of 146] Compiling Distribution.Simple.LocalBuildInfo ( src/Distribution/Simple/LocalBuildInfo.hs, dist/build/Distribution/Simple/LocalBuildInfo.o, dist/build/Distribution/Simple/LocalBuildInfo.dyn_o )
Cabal> [ 95 of 146] Compiling Distribution.Simple.Test.Log ( src/Distribution/Simple/Test/Log.hs, dist/build/Distribution/Simple/Test/Log.o, dist/build/Distribution/Simple/Test/Log.dyn_o )
Cabal> [ 96 of 146] Compiling Distribution.Simple.Hpc ( src/Distribution/Simple/Hpc.hs, dist/build/Distribution/Simple/Hpc.o, dist/build/Distribution/Simple/Hpc.dyn_o )
Cabal> [ 97 of 146] Compiling Distribution.Simple.Build.PackageInfoModule ( src/Distribution/Simple/Build/PackageInfoModule.hs, dist/build/Distribution/Simple/Build/PackageInfoModule.o, dist/build/Distribution/Simple/Build/PackageInfoModule.dyn_o )
Cabal> [ 98 of 146] Compiling Distribution.Simple.Build.Macros ( src/Distribution/Simple/Build/Macros.hs, dist/build/Distribution/Simple/Build/Macros.o, dist/build/Distribution/Simple/Build/Macros.dyn_o )
Cabal> [ 99 of 146] Compiling Distribution.Backpack.Id ( src/Distribution/Backpack/Id.hs, dist/build/Distribution/Backpack/Id.o, dist/build/Distribution/Backpack/Id.dyn_o )
Cabal> [100 of 146] Compiling Distribution.Backpack.ConfiguredComponent ( src/Distribution/Backpack/ConfiguredComponent.hs, dist/build/Distribution/Backpack/ConfiguredComponent.o, dist/build/Distribution/Backpack/ConfiguredComponent.dyn_o )
Cabal> [101 of 146] Compiling Distribution.Backpack.LinkedComponent ( src/Distribution/Backpack/LinkedComponent.hs, dist/build/Distribution/Backpack/LinkedComponent.o, dist/build/Distribution/Backpack/LinkedComponent.dyn_o )
Cabal> [102 of 146] Compiling Distribution.Backpack.ComponentsGraph ( src/Distribution/Backpack/ComponentsGraph.hs, dist/build/Distribution/Backpack/ComponentsGraph.o, dist/build/Distribution/Backpack/ComponentsGraph.dyn_o )
Cabal> [103 of 146] Compiling Distribution.Simple.Program.Ld ( src/Distribution/Simple/Program/Ld.hs, dist/build/Distribution/Simple/Program/Ld.o, dist/build/Distribution/Simple/Program/Ld.dyn_o )
Cabal> [104 of 146] Compiling Distribution.Simple.Program.Ar ( src/Distribution/Simple/Program/Ar.hs, dist/build/Distribution/Simple/Program/Ar.o, dist/build/Distribution/Simple/Program/Ar.dyn_o )
Cabal> [105 of 146] Compiling Distribution.Simple.ConfigureScript ( src/Distribution/Simple/ConfigureScript.hs, dist/build/Distribution/Simple/ConfigureScript.o, dist/build/Distribution/Simple/ConfigureScript.dyn_o )
Cabal> [106 of 146] Compiling Distribution.Simple.Setup.Clean ( src/Distribution/Simple/Setup/Clean.hs, dist/build/Distribution/Simple/Setup/Clean.o, dist/build/Distribution/Simple/Setup/Clean.dyn_o )
Cabal> [107 of 146] Compiling Distribution.Simple.Setup.Build ( src/Distribution/Simple/Setup/Build.hs, dist/build/Distribution/Simple/Setup/Build.o, dist/build/Distribution/Simple/Setup/Build.dyn_o )
Cabal> [108 of 146] Compiling Distribution.Simple.Setup.Benchmark ( src/Distribution/Simple/Setup/Benchmark.hs, dist/build/Distribution/Simple/Setup/Benchmark.o, dist/build/Distribution/Simple/Setup/Benchmark.dyn_o )
Cabal> [109 of 146] Compiling Distribution.Simple.Setup ( src/Distribution/Simple/Setup.hs, dist/build/Distribution/Simple/Setup.o, dist/build/Distribution/Simple/Setup.dyn_o )
Cabal> [110 of 146] Compiling Distribution.Simple.Build.Inputs ( src/Distribution/Simple/Build/Inputs.hs, dist/build/Distribution/Simple/Build/Inputs.o, dist/build/Distribution/Simple/Build/Inputs.dyn_o )
Cabal> [111 of 146] Compiling Distribution.Simple.BuildTarget ( src/Distribution/Simple/BuildTarget.hs, dist/build/Distribution/Simple/BuildTarget.o, dist/build/Distribution/Simple/BuildTarget.dyn_o )
Cabal> [112 of 146] Compiling Distribution.Simple.BuildPaths ( src/Distribution/Simple/BuildPaths.hs, dist/build/Distribution/Simple/BuildPaths.o, dist/build/Distribution/Simple/BuildPaths.dyn_o )
Cabal> [113 of 146] Compiling Distribution.Simple.UHC ( src/Distribution/Simple/UHC.hs, dist/build/Distribution/Simple/UHC.o, dist/build/Distribution/Simple/UHC.dyn_o )
Cabal> [114 of 146] Compiling Distribution.Simple.HaskellSuite ( src/Distribution/Simple/HaskellSuite.hs, dist/build/Distribution/Simple/HaskellSuite.o, dist/build/Distribution/Simple/HaskellSuite.dyn_o )
Cabal> [115 of 146] Compiling Distribution.Simple.GHC.Internal ( src/Distribution/Simple/GHC/Internal.hs, dist/build/Distribution/Simple/GHC/Internal.o, dist/build/Distribution/Simple/GHC/Internal.dyn_o )
Cabal> [116 of 146] Compiling Distribution.Simple.GHC.EnvironmentParser ( src/Distribution/Simple/GHC/EnvironmentParser.hs, dist/build/Distribution/Simple/GHC/EnvironmentParser.o, dist/build/Distribution/Simple/GHC/EnvironmentParser.dyn_o )
Cabal> [117 of 146] Compiling Distribution.Simple.GHCJS ( src/Distribution/Simple/GHCJS.hs, dist/build/Distribution/Simple/GHCJS.o, dist/build/Distribution/Simple/GHCJS.dyn_o )
Cabal> [118 of 146] Compiling Distribution.Simple.GHC.Build.Utils ( src/Distribution/Simple/GHC/Build/Utils.hs, dist/build/Distribution/Simple/GHC/Build/Utils.o, dist/build/Distribution/Simple/GHC/Build/Utils.dyn_o )
Cabal> [119 of 146] Compiling Distribution.Simple.GHC.Build.Modules ( src/Distribution/Simple/GHC/Build/Modules.hs, dist/build/Distribution/Simple/GHC/Build/Modules.o, dist/build/Distribution/Simple/GHC/Build/Modules.dyn_o )
Cabal> [120 of 146] Compiling Distribution.Simple.GHC.Build.ExtraSources ( src/Distribution/Simple/GHC/Build/ExtraSources.hs, dist/build/Distribution/Simple/GHC/Build/ExtraSources.o, dist/build/Distribution/Simple/GHC/Build/ExtraSources.dyn_o )
Cabal> [121 of 146] Compiling Distribution.Simple.GHC.Build.Link ( src/Distribution/Simple/GHC/Build/Link.hs, dist/build/Distribution/Simple/GHC/Build/Link.o, dist/build/Distribution/Simple/GHC/Build/Link.dyn_o )
Cabal> [122 of 146] Compiling Distribution.Simple.GHC.Build ( src/Distribution/Simple/GHC/Build.hs, dist/build/Distribution/Simple/GHC/Build.o, dist/build/Distribution/Simple/GHC/Build.dyn_o )
Cabal> [123 of 146] Compiling Distribution.Simple.GHC ( src/Distribution/Simple/GHC.hs, dist/build/Distribution/Simple/GHC.o, dist/build/Distribution/Simple/GHC.dyn_o )
Cabal> [124 of 146] Compiling Distribution.Simple.ShowBuildInfo ( src/Distribution/Simple/ShowBuildInfo.hs, dist/build/Distribution/Simple/ShowBuildInfo.o, dist/build/Distribution/Simple/ShowBuildInfo.dyn_o )
Cabal> [125 of 146] Compiling Distribution.Simple.Install ( src/Distribution/Simple/Install.hs, dist/build/Distribution/Simple/Install.o, dist/build/Distribution/Simple/Install.dyn_o )
Cabal> [126 of 146] Compiling Distribution.Simple.Build.PathsModule ( src/Distribution/Simple/Build/PathsModule.hs, dist/build/Distribution/Simple/Build/PathsModule.o, dist/build/Distribution/Simple/Build/PathsModule.dyn_o )
Cabal> [127 of 146] Compiling Distribution.Simple.Test.LibV09 ( src/Distribution/Simple/Test/LibV09.hs, dist/build/Distribution/Simple/Test/LibV09.o, dist/build/Distribution/Simple/Test/LibV09.dyn_o )
Cabal> [128 of 146] Compiling Distribution.Simple.Test.ExeV10 ( src/Distribution/Simple/Test/ExeV10.hs, dist/build/Distribution/Simple/Test/ExeV10.o, dist/build/Distribution/Simple/Test/ExeV10.dyn_o )
Cabal> [129 of 146] Compiling Distribution.PackageDescription.Check.Paths ( src/Distribution/PackageDescription/Check/Paths.hs, dist/build/Distribution/PackageDescription/Check/Paths.o, dist/build/Distribution/PackageDescription/Check/Paths.dyn_o )
Cabal> [130 of 146] Compiling Distribution.PackageDescription.Check.Target ( src/Distribution/PackageDescription/Check/Target.hs, dist/build/Distribution/PackageDescription/Check/Target.o, dist/build/Distribution/PackageDescription/Check/Target.dyn_o )
Cabal> [131 of 146] Compiling Distribution.PackageDescription.Check ( src/Distribution/PackageDescription/Check.hs, dist/build/Distribution/PackageDescription/Check.o, dist/build/Distribution/PackageDescription/Check.dyn_o )
Cabal> [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, dist/build/Distribution/Make.o, dist/build/Distribution/Make.dyn_o )
Cabal> [133 of 146] Compiling Distribution.Compat.Time ( src/Distribution/Compat/Time.hs, dist/build/Distribution/Compat/Time.o, dist/build/Distribution/Compat/Time.dyn_o )
Cabal> [134 of 146] Compiling Distribution.Backpack.ReadyComponent ( src/Distribution/Backpack/ReadyComponent.hs, dist/build/Distribution/Backpack/ReadyComponent.o, dist/build/Distribution/Backpack/ReadyComponent.dyn_o )
Cabal> [135 of 146] Compiling Distribution.Backpack.Configure ( src/Distribution/Backpack/Configure.hs, dist/build/Distribution/Backpack/Configure.o, dist/build/Distribution/Backpack/Configure.dyn_o )
Cabal> [136 of 146] Compiling Distribution.Backpack.DescribeUnitId ( src/Distribution/Backpack/DescribeUnitId.hs, dist/build/Distribution/Backpack/DescribeUnitId.o, dist/build/Distribution/Backpack/DescribeUnitId.dyn_o )
Cabal> [137 of 146] Compiling Distribution.Simple.Register ( src/Distribution/Simple/Register.hs, dist/build/Distribution/Simple/Register.o, dist/build/Distribution/Simple/Register.dyn_o )
Cabal> [138 of 146] Compiling Distribution.Simple.PreProcess ( src/Distribution/Simple/PreProcess.hs, dist/build/Distribution/Simple/PreProcess.o, dist/build/Distribution/Simple/PreProcess.dyn_o )
Cabal> [139 of 146] Compiling Distribution.Simple.UserHooks ( src/Distribution/Simple/UserHooks.hs, dist/build/Distribution/Simple/UserHooks.o, dist/build/Distribution/Simple/UserHooks.dyn_o )
Cabal> [140 of 146] Compiling Distribution.Simple.Bench ( src/Distribution/Simple/Bench.hs, dist/build/Distribution/Simple/Bench.o, dist/build/Distribution/Simple/Bench.dyn_o )
Cabal> [141 of 146] Compiling Distribution.Simple.Configure ( src/Distribution/Simple/Configure.hs, dist/build/Distribution/Simple/Configure.o, dist/build/Distribution/Simple/Configure.dyn_o )
Cabal> [142 of 146] Compiling Distribution.Simple.Test ( src/Distribution/Simple/Test.hs, dist/build/Distribution/Simple/Test.o, dist/build/Distribution/Simple/Test.dyn_o )
Cabal> [143 of 146] Compiling Distribution.Simple.SrcDist ( src/Distribution/Simple/SrcDist.hs, dist/build/Distribution/Simple/SrcDist.o, dist/build/Distribution/Simple/SrcDist.dyn_o )
Cabal> [144 of 146] Compiling Distribution.Simple.Build ( src/Distribution/Simple/Build.hs, dist/build/Distribution/Simple/Build.o, dist/build/Distribution/Simple/Build.dyn_o )
Cabal> [145 of 146] Compiling Distribution.Simple.Haddock ( src/Distribution/Simple/Haddock.hs, dist/build/Distribution/Simple/Haddock.o, dist/build/Distribution/Simple/Haddock.dyn_o )
Cabal> [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, dist/build/Distribution/Simple.o, dist/build/Distribution/Simple.dyn_o )
Cabal> [  1 of 146] Compiling Distribution.Backpack.FullUnitId ( src/Distribution/Backpack/FullUnitId.hs, dist/build/Distribution/Backpack/FullUnitId.p_o )
Cabal> [  2 of 146] Compiling Distribution.Backpack.ModSubst ( src/Distribution/Backpack/ModSubst.hs, dist/build/Distribution/Backpack/ModSubst.p_o )
Cabal> [  3 of 146] Compiling Distribution.Backpack.ModuleScope ( src/Distribution/Backpack/ModuleScope.hs, dist/build/Distribution/Backpack/ModuleScope.p_o )
Cabal> [  4 of 146] Compiling Distribution.Backpack.ModuleShape ( src/Distribution/Backpack/ModuleShape.hs, dist/build/Distribution/Backpack/ModuleShape.p_o )
Cabal> [  5 of 146] Compiling Distribution.Backpack.PreModuleShape ( src/Distribution/Backpack/PreModuleShape.hs, dist/build/Distribution/Backpack/PreModuleShape.p_o )
Cabal> [  6 of 146] Compiling Distribution.Compat.Async ( src/Distribution/Compat/Async.hs, dist/build/Distribution/Compat/Async.p_o )
Cabal> [  7 of 146] Compiling Distribution.Compat.CreatePipe ( src/Distribution/Compat/CreatePipe.hs, dist/build/Distribution/Compat/CreatePipe.p_o )
Cabal> [  8 of 146] Compiling Distribution.Compat.Directory ( src/Distribution/Compat/Directory.hs, dist/build/Distribution/Compat/Directory.p_o )
Cabal> [  9 of 146] Compiling Distribution.Compat.FilePath ( src/Distribution/Compat/FilePath.hs, dist/build/Distribution/Compat/FilePath.p_o )
Cabal> [ 10 of 146] Compiling Distribution.Compat.GetShortPathName ( src/Distribution/Compat/GetShortPathName.hs, dist/build/Distribution/Compat/GetShortPathName.p_o )
Cabal> [ 11 of 146] Compiling Distribution.Compat.Internal.TempFile ( src/Distribution/Compat/Internal/TempFile.hs, dist/build/Distribution/Compat/Internal/TempFile.p_o )
Cabal> [ 12 of 146] Compiling Distribution.Compat.CopyFile ( src/Distribution/Compat/CopyFile.hs, dist/build/Distribution/Compat/CopyFile.p_o )
Cabal> [ 13 of 146] Compiling Distribution.Compat.Prelude.Internal ( src/Distribution/Compat/Prelude/Internal.hs, dist/build/Distribution/Compat/Prelude/Internal.p_o )
Cabal> [ 14 of 146] Compiling Distribution.Compat.Process ( src/Distribution/Compat/Process.hs, dist/build/Distribution/Compat/Process.p_o )
Cabal> [ 15 of 146] Compiling Distribution.Compat.ResponseFile ( src/Distribution/Compat/ResponseFile.hs, dist/build/Distribution/Compat/ResponseFile.p_o )
Cabal> [ 16 of 146] Compiling Distribution.Compat.SnocList ( src/Distribution/Compat/SnocList.hs, dist/build/Distribution/Compat/SnocList.p_o )
Cabal> [ 17 of 146] Compiling Distribution.Compat.Stack ( src/Distribution/Compat/Stack.hs, dist/build/Distribution/Compat/Stack.p_o )
Cabal> [ 18 of 146] Compiling Distribution.Compat.Environment ( src/Distribution/Compat/Environment.hs, dist/build/Distribution/Compat/Environment.p_o )
Cabal> [ 19 of 146] Compiling Distribution.GetOpt ( src/Distribution/GetOpt.hs, dist/build/Distribution/GetOpt.p_o )
Cabal> [ 20 of 146] Compiling Distribution.Lex ( src/Distribution/Lex.hs, dist/build/Distribution/Lex.p_o )
Cabal> [ 21 of 146] Compiling Distribution.PackageDescription.Check.Warning ( src/Distribution/PackageDescription/Check/Warning.hs, dist/build/Distribution/PackageDescription/Check/Warning.p_o )
Cabal> [ 22 of 146] Compiling Distribution.ReadE ( src/Distribution/ReadE.hs, dist/build/Distribution/ReadE.p_o )
Cabal> [ 23 of 146] Compiling Distribution.Simple.BuildToolDepends ( src/Distribution/Simple/BuildToolDepends.hs, dist/build/Distribution/Simple/BuildToolDepends.p_o )
Cabal> [ 24 of 146] Compiling Distribution.Simple.CCompiler ( src/Distribution/Simple/CCompiler.hs, dist/build/Distribution/Simple/CCompiler.p_o )
Cabal> [ 25 of 146] Compiling Distribution.Simple.Flag ( src/Distribution/Simple/Flag.hs, dist/build/Distribution/Simple/Flag.p_o )
Cabal> [ 26 of 146] Compiling Distribution.Simple.InstallDirs.Internal ( src/Distribution/Simple/InstallDirs/Internal.hs, dist/build/Distribution/Simple/InstallDirs/Internal.p_o )
Cabal> [ 27 of 146] Compiling Distribution.Simple.InstallDirs ( src/Distribution/Simple/InstallDirs.hs, dist/build/Distribution/Simple/InstallDirs.p_o )
Cabal> [ 28 of 146] Compiling Distribution.Simple.Program.Internal ( src/Distribution/Simple/Program/Internal.hs, dist/build/Distribution/Simple/Program/Internal.p_o )
Cabal> [ 29 of 146] Compiling Distribution.TestSuite ( src/Distribution/TestSuite.hs, dist/build/Distribution/TestSuite.p_o )
Cabal> [ 30 of 146] Compiling Distribution.Types.AnnotatedId ( src/Distribution/Types/AnnotatedId.hs, dist/build/Distribution/Types/AnnotatedId.p_o )
Cabal> [ 31 of 146] Compiling Distribution.Backpack.PreExistingComponent ( src/Distribution/Backpack/PreExistingComponent.hs, dist/build/Distribution/Backpack/PreExistingComponent.p_o )
Cabal> [ 32 of 146] Compiling Distribution.Types.ComponentInclude ( src/Distribution/Types/ComponentInclude.hs, dist/build/Distribution/Types/ComponentInclude.p_o )
Cabal> [ 33 of 146] Compiling Distribution.Types.ComponentLocalBuildInfo ( src/Distribution/Types/ComponentLocalBuildInfo.hs, dist/build/Distribution/Types/ComponentLocalBuildInfo.p_o )
Cabal> [ 34 of 146] Compiling Distribution.Types.DumpBuildInfo ( src/Distribution/Types/DumpBuildInfo.hs, dist/build/Distribution/Types/DumpBuildInfo.p_o )
Cabal> [ 35 of 146] Compiling Distribution.Types.GivenComponent ( src/Distribution/Types/GivenComponent.hs, dist/build/Distribution/Types/GivenComponent.p_o )
Cabal> [ 36 of 146] Compiling Distribution.Types.PackageName.Magic ( src/Distribution/Types/PackageName/Magic.hs, dist/build/Distribution/Types/PackageName/Magic.p_o )
Cabal> [ 37 of 146] Compiling Distribution.Types.ParStrat ( src/Distribution/Types/ParStrat.hs, dist/build/Distribution/Types/ParStrat.p_o )
Cabal> [ 38 of 146] Compiling Distribution.Types.TargetInfo ( src/Distribution/Types/TargetInfo.hs, dist/build/Distribution/Types/TargetInfo.p_o )
Cabal> [ 39 of 146] Compiling Distribution.Utils.IOData ( src/Distribution/Utils/IOData.hs, dist/build/Distribution/Utils/IOData.p_o )
Cabal> [ 40 of 146] Compiling Distribution.Utils.Json ( src/Distribution/Utils/Json.hs, dist/build/Distribution/Utils/Json.p_o )
Cabal> [ 41 of 146] Compiling Distribution.Utils.MapAccum ( src/Distribution/Utils/MapAccum.hs, dist/build/Distribution/Utils/MapAccum.p_o )
Cabal> [ 42 of 146] Compiling Distribution.Utils.Progress ( src/Distribution/Utils/Progress.hs, dist/build/Distribution/Utils/Progress.p_o )
Cabal> [ 43 of 146] Compiling Distribution.Utils.UnionFind ( src/Distribution/Utils/UnionFind.hs, dist/build/Distribution/Utils/UnionFind.p_o )
Cabal> [ 44 of 146] Compiling Distribution.Verbosity.Internal ( src/Distribution/Verbosity/Internal.hs, dist/build/Distribution/Verbosity/Internal.p_o )
Cabal> [ 45 of 146] Compiling Distribution.Verbosity ( src/Distribution/Verbosity.hs, dist/build/Distribution/Verbosity.p_o )
Cabal> [ 46 of 146] Compiling Distribution.Simple.Program.Types ( src/Distribution/Simple/Program/Types.hs, dist/build/Distribution/Simple/Program/Types.p_o )
Cabal> [ 47 of 146] Compiling Distribution.Simple.PreProcess.Types ( src/Distribution/Simple/PreProcess/Types.hs, dist/build/Distribution/Simple/PreProcess/Types.p_o )
Cabal> [ 48 of 146] Compiling Distribution.Simple.Errors ( src/Distribution/Simple/Errors.hs, dist/build/Distribution/Simple/Errors.p_o )
Cabal> [ 49 of 146] Compiling Distribution.Simple.PreProcess.Unlit ( src/Distribution/Simple/PreProcess/Unlit.hs, dist/build/Distribution/Simple/PreProcess/Unlit.p_o )
Cabal> [ 50 of 146] Compiling Distribution.Backpack.UnifyM ( src/Distribution/Backpack/UnifyM.hs, dist/build/Distribution/Backpack/UnifyM.p_o )
Cabal> [ 51 of 146] Compiling Distribution.Backpack.MixLink ( src/Distribution/Backpack/MixLink.hs, dist/build/Distribution/Backpack/MixLink.p_o )
Cabal> [ 52 of 146] Compiling Distribution.ZinzaPrelude ( src/Distribution/ZinzaPrelude.hs, dist/build/Distribution/ZinzaPrelude.p_o )
Cabal> [ 53 of 146] Compiling Distribution.Simple.Build.PathsModule.Z ( src/Distribution/Simple/Build/PathsModule/Z.hs, dist/build/Distribution/Simple/Build/PathsModule/Z.p_o )
Cabal> [ 54 of 146] Compiling Distribution.Simple.Build.PackageInfoModule.Z ( src/Distribution/Simple/Build/PackageInfoModule/Z.hs, dist/build/Distribution/Simple/Build/PackageInfoModule/Z.p_o )
Cabal> [ 55 of 146] Compiling Distribution.Simple.Build.Macros.Z ( src/Distribution/Simple/Build/Macros/Z.hs, dist/build/Distribution/Simple/Build/Macros/Z.p_o )
Cabal> [ 56 of 146] Compiling Paths_Cabal      ( dist/build/autogen/Paths_Cabal.hs, dist/build/Paths_Cabal.p_o )
Cabal> [ 57 of 146] Compiling Distribution.Simple.Utils ( src/Distribution/Simple/Utils.hs, dist/build/Distribution/Simple/Utils.p_o )
Cabal> [ 58 of 146] Compiling Distribution.Utils.NubList ( src/Distribution/Utils/NubList.hs, dist/build/Distribution/Utils/NubList.p_o )
Cabal> [ 59 of 146] Compiling Distribution.Utils.LogProgress ( src/Distribution/Utils/LogProgress.hs, dist/build/Distribution/Utils/LogProgress.p_o )
Cabal> [ 60 of 146] Compiling Distribution.Simple.Program.Run ( src/Distribution/Simple/Program/Run.hs, dist/build/Distribution/Simple/Program/Run.p_o )
Cabal> [ 61 of 146] Compiling Distribution.Simple.Program.Script ( src/Distribution/Simple/Program/Script.hs, dist/build/Distribution/Simple/Program/Script.p_o )
Cabal> [ 62 of 146] Compiling Distribution.Simple.Program.ResponseFile ( src/Distribution/Simple/Program/ResponseFile.hs, dist/build/Distribution/Simple/Program/ResponseFile.p_o )
Cabal> [ 63 of 146] Compiling Distribution.Simple.Program.Hpc ( src/Distribution/Simple/Program/Hpc.hs, dist/build/Distribution/Simple/Program/Hpc.p_o )
Cabal> [ 64 of 146] Compiling Distribution.Simple.Program.Find ( src/Distribution/Simple/Program/Find.hs, dist/build/Distribution/Simple/Program/Find.p_o )
Cabal> [ 65 of 146] Compiling Distribution.Simple.PackageIndex ( src/Distribution/Simple/PackageIndex.hs, dist/build/Distribution/Simple/PackageIndex.p_o )
Cabal> [ 66 of 146] Compiling Distribution.Simple.PackageDescription ( src/Distribution/Simple/PackageDescription.hs, dist/build/Distribution/Simple/PackageDescription.p_o )
Cabal> [ 67 of 146] Compiling Distribution.Simple.Glob.Internal ( src/Distribution/Simple/Glob/Internal.hs, dist/build/Distribution/Simple/Glob/Internal.p_o )
Cabal> [ 68 of 146] Compiling Distribution.Simple.Glob ( src/Distribution/Simple/Glob.hs, dist/build/Distribution/Simple/Glob.p_o )
Cabal> [ 69 of 146] Compiling Distribution.PackageDescription.Check.Monad ( src/Distribution/PackageDescription/Check/Monad.hs, dist/build/Distribution/PackageDescription/Check/Monad.p_o )
Cabal> [ 70 of 146] Compiling Distribution.PackageDescription.Check.Conditional ( src/Distribution/PackageDescription/Check/Conditional.hs, dist/build/Distribution/PackageDescription/Check/Conditional.p_o )
Cabal> [ 71 of 146] Compiling Distribution.PackageDescription.Check.Common ( src/Distribution/PackageDescription/Check/Common.hs, dist/build/Distribution/PackageDescription/Check/Common.p_o )
Cabal> [ 72 of 146] Compiling Distribution.Simple.Compiler ( src/Distribution/Simple/Compiler.hs, dist/build/Distribution/Simple/Compiler.p_o )
Cabal> [ 73 of 146] Compiling Distribution.Simple.Program.HcPkg ( src/Distribution/Simple/Program/HcPkg.hs, dist/build/Distribution/Simple/Program/HcPkg.p_o )
Cabal> [ 74 of 146] Compiling Distribution.Simple.GHC.ImplInfo ( src/Distribution/Simple/GHC/ImplInfo.hs, dist/build/Distribution/Simple/GHC/ImplInfo.p_o )
Cabal> [ 75 of 146] Compiling Distribution.Simple.Program.GHC ( src/Distribution/Simple/Program/GHC.hs, dist/build/Distribution/Simple/Program/GHC.p_o )
Cabal> [ 76 of 146] Compiling Distribution.Simple.Program.Builtin ( src/Distribution/Simple/Program/Builtin.hs, dist/build/Distribution/Simple/Program/Builtin.p_o )
Cabal> [ 77 of 146] Compiling Distribution.Simple.Program.Db ( src/Distribution/Simple/Program/Db.hs, dist/build/Distribution/Simple/Program/Db.p_o )
Cabal> [ 78 of 146] Compiling Distribution.Simple.Program ( src/Distribution/Simple/Program.hs, dist/build/Distribution/Simple/Program.p_o )
Cabal> [ 79 of 146] Compiling Distribution.Simple.Program.Strip ( src/Distribution/Simple/Program/Strip.hs, dist/build/Distribution/Simple/Program/Strip.p_o )
Cabal> [ 80 of 146] Compiling Distribution.Simple.Command ( src/Distribution/Simple/Command.hs, dist/build/Distribution/Simple/Command.p_o )
Cabal> [ 81 of 146] Compiling Distribution.Simple.Setup.Common ( src/Distribution/Simple/Setup/Common.hs, dist/build/Distribution/Simple/Setup/Common.p_o )
Cabal> [ 82 of 146] Compiling Distribution.Simple.Setup.Test ( src/Distribution/Simple/Setup/Test.hs, dist/build/Distribution/Simple/Setup/Test.p_o )
Cabal> [ 83 of 146] Compiling Distribution.Simple.Setup.SDist ( src/Distribution/Simple/Setup/SDist.hs, dist/build/Distribution/Simple/Setup/SDist.p_o )
Cabal> [ 84 of 146] Compiling Distribution.Simple.Setup.Repl ( src/Distribution/Simple/Setup/Repl.hs, dist/build/Distribution/Simple/Setup/Repl.p_o )
Cabal> [ 85 of 146] Compiling Distribution.Simple.Setup.Register ( src/Distribution/Simple/Setup/Register.hs, dist/build/Distribution/Simple/Setup/Register.p_o )
Cabal> [ 86 of 146] Compiling Distribution.Simple.Setup.Install ( src/Distribution/Simple/Setup/Install.hs, dist/build/Distribution/Simple/Setup/Install.p_o )
Cabal> [ 87 of 146] Compiling Distribution.Simple.Setup.Hscolour ( src/Distribution/Simple/Setup/Hscolour.hs, dist/build/Distribution/Simple/Setup/Hscolour.p_o )
Cabal> [ 88 of 146] Compiling Distribution.Simple.Setup.Haddock ( src/Distribution/Simple/Setup/Haddock.hs, dist/build/Distribution/Simple/Setup/Haddock.p_o )
Cabal> [ 89 of 146] Compiling Distribution.Simple.Setup.Global ( src/Distribution/Simple/Setup/Global.hs, dist/build/Distribution/Simple/Setup/Global.p_o )
Cabal> [ 90 of 146] Compiling Distribution.Simple.Setup.Copy ( src/Distribution/Simple/Setup/Copy.hs, dist/build/Distribution/Simple/Setup/Copy.p_o )
Cabal> [ 91 of 146] Compiling Distribution.Simple.Setup.Config ( src/Distribution/Simple/Setup/Config.hs, dist/build/Distribution/Simple/Setup/Config.p_o )
Cabal> [ 92 of 146] Compiling Distribution.Types.LocalBuildConfig ( src/Distribution/Types/LocalBuildConfig.hs, dist/build/Distribution/Types/LocalBuildConfig.p_o )
Cabal> [ 93 of 146] Compiling Distribution.Types.LocalBuildInfo ( src/Distribution/Types/LocalBuildInfo.hs, dist/build/Distribution/Types/LocalBuildInfo.p_o )
Cabal> [ 94 of 146] Compiling Distribution.Simple.LocalBuildInfo ( src/Distribution/Simple/LocalBuildInfo.hs, dist/build/Distribution/Simple/LocalBuildInfo.p_o )
Cabal> [ 95 of 146] Compiling Distribution.Simple.Test.Log ( src/Distribution/Simple/Test/Log.hs, dist/build/Distribution/Simple/Test/Log.p_o )
Cabal> [ 96 of 146] Compiling Distribution.Simple.Hpc ( src/Distribution/Simple/Hpc.hs, dist/build/Distribution/Simple/Hpc.p_o )
Cabal> [ 97 of 146] Compiling Distribution.Simple.Build.PackageInfoModule ( src/Distribution/Simple/Build/PackageInfoModule.hs, dist/build/Distribution/Simple/Build/PackageInfoModule.p_o )
Cabal> [ 98 of 146] Compiling Distribution.Simple.Build.Macros ( src/Distribution/Simple/Build/Macros.hs, dist/build/Distribution/Simple/Build/Macros.p_o )
Cabal> [ 99 of 146] Compiling Distribution.Backpack.Id ( src/Distribution/Backpack/Id.hs, dist/build/Distribution/Backpack/Id.p_o )
Cabal> [100 of 146] Compiling Distribution.Backpack.ConfiguredComponent ( src/Distribution/Backpack/ConfiguredComponent.hs, dist/build/Distribution/Backpack/ConfiguredComponent.p_o )
Cabal> [101 of 146] Compiling Distribution.Backpack.LinkedComponent ( src/Distribution/Backpack/LinkedComponent.hs, dist/build/Distribution/Backpack/LinkedComponent.p_o )
Cabal> [102 of 146] Compiling Distribution.Backpack.ComponentsGraph ( src/Distribution/Backpack/ComponentsGraph.hs, dist/build/Distribution/Backpack/ComponentsGraph.p_o )
Cabal> [103 of 146] Compiling Distribution.Simple.Program.Ld ( src/Distribution/Simple/Program/Ld.hs, dist/build/Distribution/Simple/Program/Ld.p_o )
Cabal> [104 of 146] Compiling Distribution.Simple.Program.Ar ( src/Distribution/Simple/Program/Ar.hs, dist/build/Distribution/Simple/Program/Ar.p_o )
Cabal> [105 of 146] Compiling Distribution.Simple.ConfigureScript ( src/Distribution/Simple/ConfigureScript.hs, dist/build/Distribution/Simple/ConfigureScript.p_o )
Cabal> [106 of 146] Compiling Distribution.Simple.Setup.Clean ( src/Distribution/Simple/Setup/Clean.hs, dist/build/Distribution/Simple/Setup/Clean.p_o )
Cabal> [107 of 146] Compiling Distribution.Simple.Setup.Build ( src/Distribution/Simple/Setup/Build.hs, dist/build/Distribution/Simple/Setup/Build.p_o )
Cabal> [108 of 146] Compiling Distribution.Simple.Setup.Benchmark ( src/Distribution/Simple/Setup/Benchmark.hs, dist/build/Distribution/Simple/Setup/Benchmark.p_o )
Cabal> [109 of 146] Compiling Distribution.Simple.Setup ( src/Distribution/Simple/Setup.hs, dist/build/Distribution/Simple/Setup.p_o )
Cabal> [110 of 146] Compiling Distribution.Simple.Build.Inputs ( src/Distribution/Simple/Build/Inputs.hs, dist/build/Distribution/Simple/Build/Inputs.p_o )
Cabal> [111 of 146] Compiling Distribution.Simple.BuildTarget ( src/Distribution/Simple/BuildTarget.hs, dist/build/Distribution/Simple/BuildTarget.p_o )
Cabal> [112 of 146] Compiling Distribution.Simple.BuildPaths ( src/Distribution/Simple/BuildPaths.hs, dist/build/Distribution/Simple/BuildPaths.p_o )
Cabal> [113 of 146] Compiling Distribution.Simple.UHC ( src/Distribution/Simple/UHC.hs, dist/build/Distribution/Simple/UHC.p_o )
Cabal> [114 of 146] Compiling Distribution.Simple.HaskellSuite ( src/Distribution/Simple/HaskellSuite.hs, dist/build/Distribution/Simple/HaskellSuite.p_o )
Cabal> [115 of 146] Compiling Distribution.Simple.GHC.Internal ( src/Distribution/Simple/GHC/Internal.hs, dist/build/Distribution/Simple/GHC/Internal.p_o )
Cabal> [116 of 146] Compiling Distribution.Simple.GHC.EnvironmentParser ( src/Distribution/Simple/GHC/EnvironmentParser.hs, dist/build/Distribution/Simple/GHC/EnvironmentParser.p_o )
Cabal> [117 of 146] Compiling Distribution.Simple.GHCJS ( src/Distribution/Simple/GHCJS.hs, dist/build/Distribution/Simple/GHCJS.p_o )
Cabal> [118 of 146] Compiling Distribution.Simple.GHC.Build.Utils ( src/Distribution/Simple/GHC/Build/Utils.hs, dist/build/Distribution/Simple/GHC/Build/Utils.p_o )
Cabal> [119 of 146] Compiling Distribution.Simple.GHC.Build.Modules ( src/Distribution/Simple/GHC/Build/Modules.hs, dist/build/Distribution/Simple/GHC/Build/Modules.p_o )
Cabal> [120 of 146] Compiling Distribution.Simple.GHC.Build.ExtraSources ( src/Distribution/Simple/GHC/Build/ExtraSources.hs, dist/build/Distribution/Simple/GHC/Build/ExtraSources.p_o )
Cabal> [121 of 146] Compiling Distribution.Simple.GHC.Build.Link ( src/Distribution/Simple/GHC/Build/Link.hs, dist/build/Distribution/Simple/GHC/Build/Link.p_o )
Cabal> [122 of 146] Compiling Distribution.Simple.GHC.Build ( src/Distribution/Simple/GHC/Build.hs, dist/build/Distribution/Simple/GHC/Build.p_o )
Cabal> [123 of 146] Compiling Distribution.Simple.GHC ( src/Distribution/Simple/GHC.hs, dist/build/Distribution/Simple/GHC.p_o )
Cabal> [124 of 146] Compiling Distribution.Simple.ShowBuildInfo ( src/Distribution/Simple/ShowBuildInfo.hs, dist/build/Distribution/Simple/ShowBuildInfo.p_o )
Cabal> [125 of 146] Compiling Distribution.Simple.Install ( src/Distribution/Simple/Install.hs, dist/build/Distribution/Simple/Install.p_o )
Cabal> [126 of 146] Compiling Distribution.Simple.Build.PathsModule ( src/Distribution/Simple/Build/PathsModule.hs, dist/build/Distribution/Simple/Build/PathsModule.p_o )
Cabal> [127 of 146] Compiling Distribution.Simple.Test.LibV09 ( src/Distribution/Simple/Test/LibV09.hs, dist/build/Distribution/Simple/Test/LibV09.p_o )
Cabal> [128 of 146] Compiling Distribution.Simple.Test.ExeV10 ( src/Distribution/Simple/Test/ExeV10.hs, dist/build/Distribution/Simple/Test/ExeV10.p_o )
Cabal> [129 of 146] Compiling Distribution.PackageDescription.Check.Paths ( src/Distribution/PackageDescription/Check/Paths.hs, dist/build/Distribution/PackageDescription/Check/Paths.p_o )
Cabal> [130 of 146] Compiling Distribution.PackageDescription.Check.Target ( src/Distribution/PackageDescription/Check/Target.hs, dist/build/Distribution/PackageDescription/Check/Target.p_o )
Cabal> [131 of 146] Compiling Distribution.PackageDescription.Check ( src/Distribution/PackageDescription/Check.hs, dist/build/Distribution/PackageDescription/Check.p_o )
Cabal> [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, dist/build/Distribution/Make.p_o )
Cabal> [133 of 146] Compiling Distribution.Compat.Time ( src/Distribution/Compat/Time.hs, dist/build/Distribution/Compat/Time.p_o )
Cabal> [134 of 146] Compiling Distribution.Backpack.ReadyComponent ( src/Distribution/Backpack/ReadyComponent.hs, dist/build/Distribution/Backpack/ReadyComponent.p_o )
Cabal> [135 of 146] Compiling Distribution.Backpack.Configure ( src/Distribution/Backpack/Configure.hs, dist/build/Distribution/Backpack/Configure.p_o )
Cabal> [136 of 146] Compiling Distribution.Backpack.DescribeUnitId ( src/Distribution/Backpack/DescribeUnitId.hs, dist/build/Distribution/Backpack/DescribeUnitId.p_o )
Cabal> [137 of 146] Compiling Distribution.Simple.Register ( src/Distribution/Simple/Register.hs, dist/build/Distribution/Simple/Register.p_o )
Cabal> [138 of 146] Compiling Distribution.Simple.PreProcess ( src/Distribution/Simple/PreProcess.hs, dist/build/Distribution/Simple/PreProcess.p_o )
Cabal> [139 of 146] Compiling Distribution.Simple.UserHooks ( src/Distribution/Simple/UserHooks.hs, dist/build/Distribution/Simple/UserHooks.p_o )
Cabal> [140 of 146] Compiling Distribution.Simple.Bench ( src/Distribution/Simple/Bench.hs, dist/build/Distribution/Simple/Bench.p_o )
Cabal> [141 of 146] Compiling Distribution.Simple.Configure ( src/Distribution/Simple/Configure.hs, dist/build/Distribution/Simple/Configure.p_o )
Cabal> [142 of 146] Compiling Distribution.Simple.Test ( src/Distribution/Simple/Test.hs, dist/build/Distribution/Simple/Test.p_o )
Cabal> [143 of 146] Compiling Distribution.Simple.SrcDist ( src/Distribution/Simple/SrcDist.hs, dist/build/Distribution/Simple/SrcDist.p_o )
Cabal> [144 of 146] Compiling Distribution.Simple.Build ( src/Distribution/Simple/Build.hs, dist/build/Distribution/Simple/Build.p_o )
Cabal> [145 of 146] Compiling Distribution.Simple.Haddock ( src/Distribution/Simple/Haddock.hs, dist/build/Distribution/Simple/Haddock.p_o )
Cabal> [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, dist/build/Distribution/Simple.p_o )
Cabal> buildPhase completed in 50 seconds
Cabal> Running phase: haddockPhase
Cabal> Preprocessing library for Cabal-3.12.1.0..
Cabal> Running Haddock on library for Cabal-3.12.1.0..
Cabal> Warning: --source-* options are ignored when --hyperlinked-source is enabled.
Cabal> [  1 of 146] Compiling Distribution.Backpack.FullUnitId ( src/Distribution/Backpack/FullUnitId.hs, nothing )
Cabal> [  2 of 146] Compiling Distribution.Backpack.ModSubst ( src/Distribution/Backpack/ModSubst.hs, nothing )
Cabal> [  3 of 146] Compiling Distribution.Backpack.ModuleScope ( src/Distribution/Backpack/ModuleScope.hs, nothing )
Cabal> [  4 of 146] Compiling Distribution.Backpack.ModuleShape ( src/Distribution/Backpack/ModuleShape.hs, nothing )
Cabal> [  5 of 146] Compiling Distribution.Backpack.PreModuleShape ( src/Distribution/Backpack/PreModuleShape.hs, nothing )
Cabal> [  6 of 146] Compiling Distribution.Compat.Async ( src/Distribution/Compat/Async.hs, nothing )
Cabal> [  7 of 146] Compiling Distribution.Compat.CreatePipe ( src/Distribution/Compat/CreatePipe.hs, nothing )
Cabal> [  8 of 146] Compiling Distribution.Compat.Directory ( src/Distribution/Compat/Directory.hs, nothing )
Cabal> [  9 of 146] Compiling Distribution.Compat.FilePath ( src/Distribution/Compat/FilePath.hs, nothing )
Cabal> [ 10 of 146] Compiling Distribution.Compat.GetShortPathName ( src/Distribution/Compat/GetShortPathName.hs, nothing )
Cabal> [ 11 of 146] Compiling Distribution.Compat.Internal.TempFile ( src/Distribution/Compat/Internal/TempFile.hs, nothing )
Cabal> [ 12 of 146] Compiling Distribution.Compat.CopyFile ( src/Distribution/Compat/CopyFile.hs, nothing )
Cabal> [ 13 of 146] Compiling Distribution.Compat.Prelude.Internal ( src/Distribution/Compat/Prelude/Internal.hs, nothing )
Cabal> [ 14 of 146] Compiling Distribution.Compat.Process ( src/Distribution/Compat/Process.hs, nothing )
Cabal> [ 15 of 146] Compiling Distribution.Compat.ResponseFile ( src/Distribution/Compat/ResponseFile.hs, nothing )
Cabal> [ 16 of 146] Compiling Distribution.Compat.SnocList ( src/Distribution/Compat/SnocList.hs, nothing )
Cabal> [ 17 of 146] Compiling Distribution.Compat.Stack ( src/Distribution/Compat/Stack.hs, nothing )
Cabal> [ 18 of 146] Compiling Distribution.Compat.Environment ( src/Distribution/Compat/Environment.hs, nothing )
Cabal> [ 19 of 146] Compiling Distribution.GetOpt ( src/Distribution/GetOpt.hs, nothing )
Cabal> [ 20 of 146] Compiling Distribution.Lex ( src/Distribution/Lex.hs, nothing )
Cabal> [ 21 of 146] Compiling Distribution.PackageDescription.Check.Warning ( src/Distribution/PackageDescription/Check/Warning.hs, nothing )
Cabal> [ 22 of 146] Compiling Distribution.ReadE ( src/Distribution/ReadE.hs, nothing )
Cabal> [ 23 of 146] Compiling Distribution.Simple.BuildToolDepends ( src/Distribution/Simple/BuildToolDepends.hs, nothing )
Cabal> [ 24 of 146] Compiling Distribution.Simple.CCompiler ( src/Distribution/Simple/CCompiler.hs, nothing )
Cabal> [ 25 of 146] Compiling Distribution.Simple.Flag ( src/Distribution/Simple/Flag.hs, nothing )
Cabal> [ 26 of 146] Compiling Distribution.Simple.InstallDirs.Internal ( src/Distribution/Simple/InstallDirs/Internal.hs, nothing )
Cabal> [ 27 of 146] Compiling Distribution.Simple.InstallDirs ( src/Distribution/Simple/InstallDirs.hs, nothing )
Cabal> [ 28 of 146] Compiling Distribution.Simple.Program.Internal ( src/Distribution/Simple/Program/Internal.hs, nothing )
Cabal> [ 29 of 146] Compiling Distribution.TestSuite ( src/Distribution/TestSuite.hs, nothing )
Cabal> [ 30 of 146] Compiling Distribution.Types.AnnotatedId ( src/Distribution/Types/AnnotatedId.hs, nothing )
Cabal> [ 31 of 146] Compiling Distribution.Backpack.PreExistingComponent ( src/Distribution/Backpack/PreExistingComponent.hs, nothing )
Cabal> [ 32 of 146] Compiling Distribution.Types.ComponentInclude ( src/Distribution/Types/ComponentInclude.hs, nothing )
Cabal> [ 33 of 146] Compiling Distribution.Types.ComponentLocalBuildInfo ( src/Distribution/Types/ComponentLocalBuildInfo.hs, nothing )
Cabal> [ 34 of 146] Compiling Distribution.Types.DumpBuildInfo ( src/Distribution/Types/DumpBuildInfo.hs, nothing )
Cabal> [ 35 of 146] Compiling Distribution.Types.GivenComponent ( src/Distribution/Types/GivenComponent.hs, nothing )
Cabal> [ 36 of 146] Compiling Distribution.Types.PackageName.Magic ( src/Distribution/Types/PackageName/Magic.hs, nothing )
Cabal> [ 37 of 146] Compiling Distribution.Types.ParStrat ( src/Distribution/Types/ParStrat.hs, nothing )
Cabal> [ 38 of 146] Compiling Distribution.Types.TargetInfo ( src/Distribution/Types/TargetInfo.hs, nothing )
Cabal> [ 39 of 146] Compiling Distribution.Utils.IOData ( src/Distribution/Utils/IOData.hs, nothing )
Cabal> [ 40 of 146] Compiling Distribution.Utils.Json ( src/Distribution/Utils/Json.hs, nothing )
Cabal> [ 41 of 146] Compiling Distribution.Utils.MapAccum ( src/Distribution/Utils/MapAccum.hs, nothing )
Cabal> [ 42 of 146] Compiling Distribution.Utils.Progress ( src/Distribution/Utils/Progress.hs, nothing )
Cabal> [ 43 of 146] Compiling Distribution.Utils.UnionFind ( src/Distribution/Utils/UnionFind.hs, nothing )
Cabal> [ 44 of 146] Compiling Distribution.Verbosity.Internal ( src/Distribution/Verbosity/Internal.hs, nothing )
Cabal> [ 45 of 146] Compiling Distribution.Verbosity ( src/Distribution/Verbosity.hs, nothing )
Cabal> [ 46 of 146] Compiling Distribution.Simple.Program.Types ( src/Distribution/Simple/Program/Types.hs, nothing )
Cabal> [ 47 of 146] Compiling Distribution.Simple.PreProcess.Types ( src/Distribution/Simple/PreProcess/Types.hs, nothing )
Cabal> [ 48 of 146] Compiling Distribution.Simple.Errors ( src/Distribution/Simple/Errors.hs, nothing )
Cabal> [ 49 of 146] Compiling Distribution.Simple.PreProcess.Unlit ( src/Distribution/Simple/PreProcess/Unlit.hs, nothing )
Cabal> [ 50 of 146] Compiling Distribution.Backpack.UnifyM ( src/Distribution/Backpack/UnifyM.hs, nothing )
Cabal> [ 51 of 146] Compiling Distribution.Backpack.MixLink ( src/Distribution/Backpack/MixLink.hs, nothing )
Cabal> [ 52 of 146] Compiling Distribution.ZinzaPrelude ( src/Distribution/ZinzaPrelude.hs, nothing )
Cabal> [ 53 of 146] Compiling Distribution.Simple.Build.PathsModule.Z ( src/Distribution/Simple/Build/PathsModule/Z.hs, nothing )
Cabal> [ 54 of 146] Compiling Distribution.Simple.Build.PackageInfoModule.Z ( src/Distribution/Simple/Build/PackageInfoModule/Z.hs, nothing )
Cabal> [ 55 of 146] Compiling Distribution.Simple.Build.Macros.Z ( src/Distribution/Simple/Build/Macros/Z.hs, nothing )
Cabal> [ 56 of 146] Compiling Paths_Cabal      ( dist/build/autogen/Paths_Cabal.hs, nothing )
Cabal> [ 57 of 146] Compiling Distribution.Simple.Utils ( src/Distribution/Simple/Utils.hs, nothing )
Cabal> [ 58 of 146] Compiling Distribution.Utils.NubList ( src/Distribution/Utils/NubList.hs, nothing )
Cabal> [ 59 of 146] Compiling Distribution.Utils.LogProgress ( src/Distribution/Utils/LogProgress.hs, nothing )
Cabal> [ 60 of 146] Compiling Distribution.Simple.Program.Run ( src/Distribution/Simple/Program/Run.hs, nothing )
Cabal> [ 61 of 146] Compiling Distribution.Simple.Program.Script ( src/Distribution/Simple/Program/Script.hs, nothing )
Cabal> [ 62 of 146] Compiling Distribution.Simple.Program.ResponseFile ( src/Distribution/Simple/Program/ResponseFile.hs, nothing )
Cabal> [ 63 of 146] Compiling Distribution.Simple.Program.Hpc ( src/Distribution/Simple/Program/Hpc.hs, nothing )
Cabal> [ 64 of 146] Compiling Distribution.Simple.Program.Find ( src/Distribution/Simple/Program/Find.hs, nothing )
Cabal> [ 65 of 146] Compiling Distribution.Simple.PackageIndex ( src/Distribution/Simple/PackageIndex.hs, nothing )
Cabal> [ 66 of 146] Compiling Distribution.Simple.PackageDescription ( src/Distribution/Simple/PackageDescription.hs, nothing )
Cabal> [ 67 of 146] Compiling Distribution.Simple.Glob.Internal ( src/Distribution/Simple/Glob/Internal.hs, nothing )
Cabal> [ 68 of 146] Compiling Distribution.Simple.Glob ( src/Distribution/Simple/Glob.hs, nothing )
Cabal> [ 69 of 146] Compiling Distribution.PackageDescription.Check.Monad ( src/Distribution/PackageDescription/Check/Monad.hs, nothing )
Cabal> [ 70 of 146] Compiling Distribution.PackageDescription.Check.Conditional ( src/Distribution/PackageDescription/Check/Conditional.hs, nothing )
Cabal> [ 71 of 146] Compiling Distribution.PackageDescription.Check.Common ( src/Distribution/PackageDescription/Check/Common.hs, nothing )
Cabal> [ 72 of 146] Compiling Distribution.Simple.Compiler ( src/Distribution/Simple/Compiler.hs, nothing )
Cabal> [ 73 of 146] Compiling Distribution.Simple.Program.HcPkg ( src/Distribution/Simple/Program/HcPkg.hs, nothing )
Cabal> [ 74 of 146] Compiling Distribution.Simple.GHC.ImplInfo ( src/Distribution/Simple/GHC/ImplInfo.hs, nothing )
Cabal> [ 75 of 146] Compiling Distribution.Simple.Program.GHC ( src/Distribution/Simple/Program/GHC.hs, nothing )
Cabal> [ 76 of 146] Compiling Distribution.Simple.Program.Builtin ( src/Distribution/Simple/Program/Builtin.hs, nothing )
Cabal> [ 77 of 146] Compiling Distribution.Simple.Program.Db ( src/Distribution/Simple/Program/Db.hs, nothing )
Cabal> [ 78 of 146] Compiling Distribution.Simple.Program ( src/Distribution/Simple/Program.hs, nothing )
Cabal> [ 79 of 146] Compiling Distribution.Simple.Program.Strip ( src/Distribution/Simple/Program/Strip.hs, nothing )
Cabal> [ 80 of 146] Compiling Distribution.Simple.Command ( src/Distribution/Simple/Command.hs, nothing )
Cabal> [ 81 of 146] Compiling Distribution.Simple.Setup.Common ( src/Distribution/Simple/Setup/Common.hs, nothing )
Cabal> [ 82 of 146] Compiling Distribution.Simple.Setup.Test ( src/Distribution/Simple/Setup/Test.hs, nothing )
Cabal> [ 83 of 146] Compiling Distribution.Simple.Setup.SDist ( src/Distribution/Simple/Setup/SDist.hs, nothing )
Cabal> [ 84 of 146] Compiling Distribution.Simple.Setup.Repl ( src/Distribution/Simple/Setup/Repl.hs, nothing )
Cabal> [ 85 of 146] Compiling Distribution.Simple.Setup.Register ( src/Distribution/Simple/Setup/Register.hs, nothing )
Cabal> [ 86 of 146] Compiling Distribution.Simple.Setup.Install ( src/Distribution/Simple/Setup/Install.hs, nothing )
Cabal> [ 87 of 146] Compiling Distribution.Simple.Setup.Hscolour ( src/Distribution/Simple/Setup/Hscolour.hs, nothing )
Cabal> [ 88 of 146] Compiling Distribution.Simple.Setup.Haddock ( src/Distribution/Simple/Setup/Haddock.hs, nothing )
Cabal> [ 89 of 146] Compiling Distribution.Simple.Setup.Global ( src/Distribution/Simple/Setup/Global.hs, nothing )
Cabal> [ 90 of 146] Compiling Distribution.Simple.Setup.Copy ( src/Distribution/Simple/Setup/Copy.hs, nothing )
Cabal> [ 91 of 146] Compiling Distribution.Simple.Setup.Config ( src/Distribution/Simple/Setup/Config.hs, nothing )
Cabal> [ 92 of 146] Compiling Distribution.Types.LocalBuildConfig ( src/Distribution/Types/LocalBuildConfig.hs, nothing )
Cabal> [ 93 of 146] Compiling Distribution.Types.LocalBuildInfo ( src/Distribution/Types/LocalBuildInfo.hs, nothing )
Cabal> [ 94 of 146] Compiling Distribution.Simple.LocalBuildInfo ( src/Distribution/Simple/LocalBuildInfo.hs, nothing )
Cabal> [ 95 of 146] Compiling Distribution.Simple.Test.Log ( src/Distribution/Simple/Test/Log.hs, nothing )
Cabal> [ 96 of 146] Compiling Distribution.Simple.Hpc ( src/Distribution/Simple/Hpc.hs, nothing )
Cabal> [ 97 of 146] Compiling Distribution.Simple.Build.PackageInfoModule ( src/Distribution/Simple/Build/PackageInfoModule.hs, nothing )
Cabal> [ 98 of 146] Compiling Distribution.Simple.Build.Macros ( src/Distribution/Simple/Build/Macros.hs, nothing )
Cabal> [ 99 of 146] Compiling Distribution.Backpack.Id ( src/Distribution/Backpack/Id.hs, nothing )
Cabal> [100 of 146] Compiling Distribution.Backpack.ConfiguredComponent ( src/Distribution/Backpack/ConfiguredComponent.hs, nothing )
Cabal> [101 of 146] Compiling Distribution.Backpack.LinkedComponent ( src/Distribution/Backpack/LinkedComponent.hs, nothing )
Cabal> [102 of 146] Compiling Distribution.Backpack.ComponentsGraph ( src/Distribution/Backpack/ComponentsGraph.hs, nothing )
Cabal> [103 of 146] Compiling Distribution.Simple.Program.Ld ( src/Distribution/Simple/Program/Ld.hs, nothing )
Cabal> [104 of 146] Compiling Distribution.Simple.Program.Ar ( src/Distribution/Simple/Program/Ar.hs, nothing )
Cabal> [105 of 146] Compiling Distribution.Simple.ConfigureScript ( src/Distribution/Simple/ConfigureScript.hs, nothing )
Cabal> [106 of 146] Compiling Distribution.Simple.Setup.Clean ( src/Distribution/Simple/Setup/Clean.hs, nothing )
Cabal> [107 of 146] Compiling Distribution.Simple.Setup.Build ( src/Distribution/Simple/Setup/Build.hs, nothing )
Cabal> [108 of 146] Compiling Distribution.Simple.Setup.Benchmark ( src/Distribution/Simple/Setup/Benchmark.hs, nothing )
Cabal> [109 of 146] Compiling Distribution.Simple.Setup ( src/Distribution/Simple/Setup.hs, nothing )
Cabal> [110 of 146] Compiling Distribution.Simple.Build.Inputs ( src/Distribution/Simple/Build/Inputs.hs, nothing )
Cabal> [111 of 146] Compiling Distribution.Simple.BuildTarget ( src/Distribution/Simple/BuildTarget.hs, nothing )
Cabal> [112 of 146] Compiling Distribution.Simple.BuildPaths ( src/Distribution/Simple/BuildPaths.hs, nothing )
Cabal> [113 of 146] Compiling Distribution.Simple.UHC ( src/Distribution/Simple/UHC.hs, nothing )
Cabal> [114 of 146] Compiling Distribution.Simple.HaskellSuite ( src/Distribution/Simple/HaskellSuite.hs, nothing )
Cabal> [115 of 146] Compiling Distribution.Simple.GHC.Internal ( src/Distribution/Simple/GHC/Internal.hs, nothing )
Cabal> [116 of 146] Compiling Distribution.Simple.GHC.EnvironmentParser ( src/Distribution/Simple/GHC/EnvironmentParser.hs, nothing )
Cabal> [117 of 146] Compiling Distribution.Simple.GHCJS ( src/Distribution/Simple/GHCJS.hs, nothing )
Cabal> [118 of 146] Compiling Distribution.Simple.GHC.Build.Utils ( src/Distribution/Simple/GHC/Build/Utils.hs, nothing )
Cabal> [119 of 146] Compiling Distribution.Simple.GHC.Build.Modules ( src/Distribution/Simple/GHC/Build/Modules.hs, nothing )
Cabal> [120 of 146] Compiling Distribution.Simple.GHC.Build.ExtraSources ( src/Distribution/Simple/GHC/Build/ExtraSources.hs, nothing )
Cabal> [121 of 146] Compiling Distribution.Simple.GHC.Build.Link ( src/Distribution/Simple/GHC/Build/Link.hs, nothing )
Cabal> [122 of 146] Compiling Distribution.Simple.GHC.Build ( src/Distribution/Simple/GHC/Build.hs, nothing )
Cabal> [123 of 146] Compiling Distribution.Simple.GHC ( src/Distribution/Simple/GHC.hs, nothing )
Cabal> [124 of 146] Compiling Distribution.Simple.ShowBuildInfo ( src/Distribution/Simple/ShowBuildInfo.hs, nothing )
Cabal> [125 of 146] Compiling Distribution.Simple.Install ( src/Distribution/Simple/Install.hs, nothing )
Cabal> [126 of 146] Compiling Distribution.Simple.Build.PathsModule ( src/Distribution/Simple/Build/PathsModule.hs, nothing )
Cabal> [127 of 146] Compiling Distribution.Simple.Test.LibV09 ( src/Distribution/Simple/Test/LibV09.hs, nothing )
Cabal> [128 of 146] Compiling Distribution.Simple.Test.ExeV10 ( src/Distribution/Simple/Test/ExeV10.hs, nothing )
Cabal> [129 of 146] Compiling Distribution.PackageDescription.Check.Paths ( src/Distribution/PackageDescription/Check/Paths.hs, nothing )
Cabal> [130 of 146] Compiling Distribution.PackageDescription.Check.Target ( src/Distribution/PackageDescription/Check/Target.hs, nothing )
Cabal> [131 of 146] Compiling Distribution.PackageDescription.Check ( src/Distribution/PackageDescription/Check.hs, nothing )
Cabal> [132 of 146] Compiling Distribution.Make ( src/Distribution/Make.hs, nothing )
Cabal> [133 of 146] Compiling Distribution.Compat.Time ( src/Distribution/Compat/Time.hs, nothing )
Cabal> [134 of 146] Compiling Distribution.Backpack.ReadyComponent ( src/Distribution/Backpack/ReadyComponent.hs, nothing )
Cabal> [135 of 146] Compiling Distribution.Backpack.Configure ( src/Distribution/Backpack/Configure.hs, nothing )
Cabal> [136 of 146] Compiling Distribution.Backpack.DescribeUnitId ( src/Distribution/Backpack/DescribeUnitId.hs, nothing )
Cabal> [137 of 146] Compiling Distribution.Simple.Register ( src/Distribution/Simple/Register.hs, nothing )
Cabal> [138 of 146] Compiling Distribution.Simple.PreProcess ( src/Distribution/Simple/PreProcess.hs, nothing )
Cabal> [139 of 146] Compiling Distribution.Simple.UserHooks ( src/Distribution/Simple/UserHooks.hs, nothing )
Cabal> [140 of 146] Compiling Distribution.Simple.Bench ( src/Distribution/Simple/Bench.hs, nothing )
Cabal> [141 of 146] Compiling Distribution.Simple.Configure ( src/Distribution/Simple/Configure.hs, nothing )
Cabal> [142 of 146] Compiling Distribution.Simple.Test ( src/Distribution/Simple/Test.hs, nothing )
Cabal> [143 of 146] Compiling Distribution.Simple.SrcDist ( src/Distribution/Simple/SrcDist.hs, nothing )
Cabal> [144 of 146] Compiling Distribution.Simple.Build ( src/Distribution/Simple/Build.hs, nothing )
Cabal> [145 of 146] Compiling Distribution.Simple.Haddock ( src/Distribution/Simple/Haddock.hs, nothing )
Cabal> [146 of 146] Compiling Distribution.Simple ( src/Distribution/Simple.hs, nothing )
Cabal> Haddock coverage:
Cabal>    0% (  0 /  5) in 'Distribution.Backpack.FullUnitId'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     FullUnitId (src/Distribution/Backpack/FullUnitId.hs:15)
Cabal>     FullDb (src/Distribution/Backpack/FullUnitId.hs:18)
Cabal>     expandOpenUnitId (src/Distribution/Backpack/FullUnitId.hs:21)
Cabal>     expandUnitId (src/Distribution/Backpack/FullUnitId.hs:27)
Cabal> Warning: 'ModuleSubst' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>  100% (  2 /  2) in 'Distribution.Backpack.ModSubst'
Cabal> Warning: 'OpenModule' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Backpack’
Cabal>     * in ‘Distribution.Backpack’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Backpack’
Cabal> Warning: 'Module' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'ModuleScope' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ModuleScope.hs:69:20
Cabal>     * at src/Distribution/Backpack/ModuleScope.hs:69:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ModuleScope.hs:69:1
Cabal> Warning: 'ModuleShape' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'ModuleShape' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ModuleShape.hs:30:20
Cabal>     * at src/Distribution/Backpack/ModuleShape.hs:30:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ModuleShape.hs:30:1
Cabal> Warning: 'InstalledPackageInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.InstalledPackageInfo’
Cabal>     * in ‘Distribution.Types.InstalledPackageInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.InstalledPackageInfo’
Cabal>   80% (  4 /  5) in 'Distribution.Backpack.ModuleShape'
Cabal>   Missing documentation for:
Cabal>     shapeInstalledPackage (src/Distribution/Backpack/ModuleShape.hs:77)
Cabal>    0% (  0 /  5) in 'Distribution.Backpack.PreModuleShape'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     PreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:22)
Cabal>     toPreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:29)
Cabal>     renamePreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:32)
Cabal>     mixLinkPreModuleShape (src/Distribution/Backpack/PreModuleShape.hs:41)
Cabal> Warning: 'async' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   50% (  1 /  2) in 'Distribution.Compat.CreatePipe'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>   75% (  3 /  4) in 'Distribution.Compat.Directory'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>   66% (  2 /  3) in 'Distribution.Compat.FilePath'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal> Warning: 'GetShortPathName' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>  100% (  2 /  2) in 'Distribution.Compat.Prelude.Internal'
Cabal>   80% (  4 /  5) in 'Distribution.Compat.Process'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>   66% (  2 /  3) in 'Distribution.Compat.ResponseFile'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal> Warning: 'Verbosity' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   66% (  6 /  9) in 'Distribution.Compat.Stack'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     WithCallStack (src/Distribution/Compat/Stack.hs:31)
Cabal>     withLexicalCallStack (src/Distribution/Compat/Stack.hs:74)
Cabal> Warning: 'ReturnInOrder' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'PackageCheck' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   50% (  5 / 10) in 'Distribution.ReadE'
Cabal>   Missing documentation for:
Cabal>     succeedReadE (src/Distribution/ReadE.hs:47)
Cabal>     failReadE (src/Distribution/ReadE.hs:50)
Cabal>     parsecToReadE (src/Distribution/ReadE.hs:57)
Cabal>     parsecToReadEErr (src/Distribution/ReadE.hs:61)
Cabal>     unexpectMsgString (src/Distribution/ReadE.hs:67)
Cabal> Warning: 'PackageDescription' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
Cabal> Warning: 'BuildInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
Cabal>  100% (  6 /  6) in 'Distribution.Simple.BuildToolDepends'
Cabal> Warning: 'a' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'b' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>  100% (  5 /  5) in 'Distribution.Simple.CCompiler'
Cabal> Warning: 'Flag' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Flag.hs:65:15
Cabal>     * at src/Distribution/Simple/Flag.hs:65:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Flag.hs:65:1
Cabal>  100% ( 12 / 12) in 'Distribution.Simple.Flag'
Cabal>    0% (  0 /  3) in 'Distribution.Simple.InstallDirs.Internal'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     PathComponent (src/Distribution/Simple/InstallDirs/Internal.hs:12)
Cabal>     PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
Cabal> Warning: 'InstallDirs' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/InstallDirs.hs:85:24
Cabal>     * at src/Distribution/Simple/InstallDirs.hs:85:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/InstallDirs.hs:85:1
Cabal> Warning: 'PathTemplate' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/InstallDirs.hs:389:24
Cabal>     * at src/Distribution/Simple/InstallDirs.hs:389:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/InstallDirs.hs:389:1
Cabal>   47% ( 11 / 23) in 'Distribution.Simple.InstallDirs'
Cabal>   Missing documentation for:
Cabal>     defaultInstallDirs (src/Distribution/Simple/InstallDirs.hs:179)
Cabal>     defaultInstallDirs' (src/Distribution/Simple/InstallDirs.hs:187)
Cabal>     combineInstallDirs (src/Distribution/Simple/InstallDirs.hs:121)
Cabal>     PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
Cabal>     PathTemplateEnv (src/Distribution/Simple/InstallDirs.hs:395)
Cabal>     combinePathTemplate (src/Distribution/Simple/InstallDirs.hs:410)
Cabal>     substPathTemplate (src/Distribution/Simple/InstallDirs.hs:414)
Cabal>     platformTemplateEnv (src/Distribution/Simple/InstallDirs.hs:452)
Cabal>     compilerTemplateEnv (src/Distribution/Simple/InstallDirs.hs:447)
Cabal>     packageTemplateEnv (src/Distribution/Simple/InstallDirs.hs:437)
Cabal>     abiTemplateEnv (src/Distribution/Simple/InstallDirs.hs:458)
Cabal>     installDirsTemplateEnv (src/Distribution/Simple/InstallDirs.hs:477)
Cabal> Warning: 'strip' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>  100% (  2 /  2) in 'Distribution.Simple.Program.Internal'
Cabal> Warning: 'TestInstance' is ambiguous. It is defined
Cabal>     * at src/Distribution/TestSuite.hs:30:21
Cabal>     * at src/Distribution/TestSuite.hs:30:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/TestSuite.hs:30:1
Cabal>   22% (  2 /  9) in 'Distribution.TestSuite'
Cabal>   Missing documentation for:
Cabal>     TestInstance (src/Distribution/TestSuite.hs:30)
Cabal>     OptionDescr (src/Distribution/TestSuite.hs:49)
Cabal>     OptionType (src/Distribution/TestSuite.hs:59)
Cabal>     Test (src/Distribution/TestSuite.hs:78)
Cabal>     Options (src/Distribution/TestSuite.hs:94)
Cabal>     Progress (src/Distribution/TestSuite.hs:96)
Cabal>     Result (src/Distribution/TestSuite.hs:100)
Cabal> Warning: 'AnnotatedId' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/AnnotatedId.hs:19:23
Cabal>     * at src/Distribution/Types/AnnotatedId.hs:19:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/AnnotatedId.hs:19:1
Cabal>   50% (  1 /  2) in 'Distribution.Types.AnnotatedId'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal> Warning: 'LinkedComponent' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'pc_pkgid' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'PreExistingComponent' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/PreExistingComponent.hs:37:29
Cabal>     * at src/Distribution/Backpack/PreExistingComponent.hs:37:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/PreExistingComponent.hs:37:1
Cabal> Warning: 'InstalledPackageInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.InstalledPackageInfo’
Cabal>     * in ‘Distribution.Types.InstalledPackageInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.InstalledPackageInfo’
Cabal> Warning: 'CSubLibName' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   20% (  1 /  5) in 'Distribution.Types.ComponentInclude'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     ComponentInclude (src/Distribution/Types/ComponentInclude.hs:16)
Cabal>     ci_id (src/Distribution/Types/ComponentInclude.hs:25)
Cabal>     ci_pkgid (src/Distribution/Types/ComponentInclude.hs:28)
Cabal> Warning: 'ModuleRenaming' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.ModuleRenaming’
Cabal>     * in ‘Distribution.Types.ModuleRenaming’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.ModuleRenaming’
Cabal> Warning: 'BuildInfo' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   25% (  1 /  4) in 'Distribution.Types.ComponentLocalBuildInfo'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     componentIsIndefinite (src/Distribution/Types/ComponentLocalBuildInfo.hs:122)
Cabal>     maybeComponentInstantiatedWith (src/Distribution/Types/ComponentLocalBuildInfo.hs:126)
Cabal>    0% (  0 /  2) in 'Distribution.Types.DumpBuildInfo'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     DumpBuildInfo (src/Distribution/Types/DumpBuildInfo.hs:10)
Cabal> Warning: 'GivenComponent' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/GivenComponent.hs:20:23
Cabal>     * at src/Distribution/Types/GivenComponent.hs:20:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/GivenComponent.hs:20:1
Cabal>   50% (  1 /  2) in 'Distribution.Types.GivenComponent'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>  100% (  5 /  5) in 'Distribution.Types.PackageName.Magic'
Cabal>   80% (  4 /  5) in 'Distribution.Types.ParStrat'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal> Warning: 'TargetInfo' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/TargetInfo.hs:22:19
Cabal>     * at src/Distribution/Types/TargetInfo.hs:22:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/TargetInfo.hs:22:1
Cabal> Warning: 'LocalBuildInfo' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   50% (  1 /  2) in 'Distribution.Types.TargetInfo'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>  100% (  8 /  8) in 'Distribution.Utils.IOData'
Cabal>   75% (  3 /  4) in 'Distribution.Utils.Json'
Cabal>   Missing documentation for:
Cabal>     Json (src/Distribution/Utils/Json.hs:20)
Cabal> Warning: 'mapAccumL' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   50% (  1 /  2) in 'Distribution.Utils.MapAccum'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>  100% (  5 /  5) in 'Distribution.Utils.Progress'
Cabal> Warning: 'Point' is ambiguous. It is defined
Cabal>     * at src/Distribution/Utils/UnionFind.hs:23:21
Cabal>     * at src/Distribution/Utils/UnionFind.hs:23:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Utils/UnionFind.hs:23:1
Cabal>    0% (  0 /  3) in 'Distribution.Verbosity.Internal'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     VerbosityLevel (src/Distribution/Verbosity/Internal.hs:12)
Cabal>     VerbosityFlag (src/Distribution/Verbosity/Internal.hs:18)
Cabal> Warning: 'Verbosity' is ambiguous. It is defined
Cabal>     * at src/Distribution/Verbosity.hs:90:18
Cabal>     * at src/Distribution/Verbosity.hs:90:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Verbosity.hs:90:1
Cabal> Warning: 'stderr' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'stdout' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   87% ( 35 / 40) in 'Distribution.Verbosity'
Cabal>   Missing documentation for:
Cabal>     Verbosity (src/Distribution/Verbosity.hs:90)
Cabal>     flagToVerbosity (src/Distribution/Verbosity.hs:241)
Cabal>     showForCabal (src/Distribution/Verbosity.hs:244)
Cabal>     showForGHC (src/Distribution/Verbosity.hs:267)
Cabal>     verboseHasFlags (src/Distribution/Verbosity.hs:335)
Cabal> Warning: 'Program' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Program/Types.hs:50:16
Cabal>     * at src/Distribution/Simple/Program/Types.hs:50:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
Cabal> Warning: 'ConfiguredProgram' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Program/Types.hs:120:26
Cabal>     * at src/Distribution/Simple/Program/Types.hs:120:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:120:1
Cabal> Warning: 'findExecutable' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'simpleProgram' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'findProgramOnSearchPath' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   83% ( 10 / 12) in 'Distribution.Simple.Program.Types'
Cabal>   Missing documentation for:
Cabal>     ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
Cabal>     ProgArg (src/Distribution/Simple/Program/Types.hs:83)
Cabal> Warning: 'PreProcessor' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/PreProcess/Types.hs:69:21
Cabal>     * at src/Distribution/Simple/PreProcess/Types.hs:69:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/PreProcess/Types.hs:69:1
Cabal>   60% (  3 /  5) in 'Distribution.Simple.PreProcess.Types'
Cabal>   Missing documentation for:
Cabal>     builtinHaskellSuffixes (src/Distribution/Simple/PreProcess/Types.hs:111)
Cabal>     builtinHaskellBootSuffixes (src/Distribution/Simple/PreProcess/Types.hs:114)
Cabal>    0% (  0 /  5) in 'Distribution.Simple.Errors'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     CabalException (src/Distribution/Simple/Errors.hs:46)
Cabal>     FailedDependency (src/Distribution/Simple/Errors.hs:39)
Cabal>     exceptionCode (src/Distribution/Simple/Errors.hs:179)
Cabal>     exceptionMessage (src/Distribution/Simple/Errors.hs:315)
Cabal>  100% (  3 /  3) in 'Distribution.Simple.PreProcess.Unlit'
Cabal> Warning: 'ModuleScope' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ModuleScope.hs:69:20
Cabal>     * at src/Distribution/Backpack/ModuleScope.hs:69:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ModuleScope.hs:69:1
Cabal> Warning: 'ModuleSubst' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'UnitIdU' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/UnifyM.hs:261:5
Cabal>     * at src/Distribution/Backpack/UnifyM.hs:268:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:268:1
Cabal> Warning: 'Module' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.Module’
Cabal>     * in ‘Distribution.Types.Module’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.Module’
Cabal> Warning: 'ModuleU' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/UnifyM.hs:256:5
Cabal>     * at src/Distribution/Backpack/UnifyM.hs:265:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:265:1
Cabal> Warning: 'UnifyM' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/UnifyM.hs:83:22
Cabal>     * at src/Distribution/Backpack/UnifyM.hs:83:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/UnifyM.hs:83:1
Cabal> Warning: 'ModuleShape' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ModuleShape.hs:30:20
Cabal>     * at src/Distribution/Backpack/ModuleShape.hs:30:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ModuleShape.hs:30:1
Cabal> Warning: 'die' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'IOError' is ambiguous. It is defined
Cabal>     * in ‘GHC.IO.Exception’
Cabal>     * in ‘GHC.IO.Exception’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘GHC.IO.Exception’
Cabal> Warning: 'map' is ambiguous. It is defined
Cabal>     * in ‘GHC.Base’
Cabal>     * in ‘Data.ByteString.Lazy’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Data.ByteString.Lazy’
Cabal> Warning: 'action' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'findModuleFile' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'createDirectoryIfMissing' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'TempFileOptions' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Utils.hs:1632:24
Cabal>     * at src/Distribution/Simple/Utils.hs:1632:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Utils.hs:1632:1
Cabal>   85% (122 /142) in 'Distribution.Simple.Utils'
Cabal>   Missing documentation for:
Cabal>     cabalVersion (src/Distribution/Simple/Utils.hs:285)
Cabal>     dieNoVerbosity (src/Distribution/Simple/Utils.hs:346)
Cabal>     die' (src/Distribution/Simple/Utils.hs:376)
Cabal>     dieWithException (src/Distribution/Simple/Utils.hs:389)
Cabal>     dieWithLocation' (src/Distribution/Simple/Utils.hs:365)
Cabal>     dieNoWrap (src/Distribution/Simple/Utils.hs:408)
Cabal>     topHandler (src/Distribution/Simple/Utils.hs:515)
Cabal>     topHandlerWith (src/Distribution/Simple/Utils.hs:464)
Cabal>     infoNoWrap (src/Distribution/Simple/Utils.hs:603)
Cabal>     VerboseException (src/Distribution/Simple/Utils.hs:384)
Cabal>     setFileOrdinary (src/Distribution/Compat/CopyFile.hs:77)
Cabal>     setFileExecutable (src/Distribution/Compat/CopyFile.hs:78)
Cabal>     shortRelativePath (src/Distribution/Simple/Utils.hs:1747)
Cabal>     findFirstFile (src/Distribution/Simple/Utils.hs:1301)
Cabal>     findAllFilesWithExtension (src/Distribution/Simple/Utils.hs:1277)
Cabal>     addLibraryPath (src/Distribution/Simple/Utils.hs:1397)
Cabal>     defaultTempFileOptions (src/Distribution/Simple/Utils.hs:1638)
Cabal>     createTempDirectory (src/Distribution/Compat/Internal/TempFile.hs:124)
Cabal>     equating
Cabal>     unintersperse
Cabal> Warning: 'NubList' is ambiguous. It is defined
Cabal>     * at src/Distribution/Utils/NubList.hs:24:21
Cabal>     * at src/Distribution/Utils/NubList.hs:24:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Utils/NubList.hs:24:1
Cabal> Warning: 'get' is ambiguous. It is defined
Cabal>     * in ‘Text.ParserCombinators.ReadPrec’
Cabal>     * in ‘Data.Binary.Class’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Data.Binary.Class’
Cabal>   66% (  6 /  9) in 'Distribution.Utils.NubList'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     fromNubList
Cabal>     fromNubListR
Cabal> Warning: 'LogProgress' is ambiguous. It is defined
Cabal>     * at src/Distribution/Utils/LogProgress.hs:33:25
Cabal>     * at src/Distribution/Utils/LogProgress.hs:33:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Utils/LogProgress.hs:33:1
Cabal> Warning: 'die' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   85% (  6 /  7) in 'Distribution.Utils.LogProgress'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>   30% (  4 / 13) in 'Distribution.Simple.Program.Run'
Cabal>   Missing documentation for:
Cabal>     IOEncoding (src/Distribution/Simple/Program/Run.hs:61)
Cabal>     emptyProgramInvocation (src/Distribution/Simple/Program/Run.hs:71)
Cabal>     simpleProgramInvocation (src/Distribution/Simple/Program/Run.hs:83)
Cabal>     programInvocation (src/Distribution/Simple/Program/Run.hs:90)
Cabal>     runProgramInvocation (src/Distribution/Simple/Program/Run.hs:101)
Cabal>     getProgramInvocationOutput (src/Distribution/Simple/Program/Run.hs:158)
Cabal>     getProgramInvocationLBS (src/Distribution/Simple/Program/Run.hs:166)
Cabal>     getProgramInvocationOutputAndErrors (src/Distribution/Simple/Program/Run.hs:177)
Cabal>     getProgramInvocationLBSAndErrors (src/Distribution/Simple/Program/Run.hs:189)
Cabal>  100% (  4 /  4) in 'Distribution.Simple.Program.Script'
Cabal>   50% (  1 /  2) in 'Distribution.Simple.Program.ResponseFile'
Cabal>   Missing documentation for:
Cabal>     withResponseFile (src/Distribution/Simple/Program/ResponseFile.hs:37)
Cabal>   66% (  2 /  3) in 'Distribution.Simple.Program.Hpc'
Cabal>   Missing documentation for:
Cabal>     union (src/Distribution/Simple/Program/Hpc.hs:115)
Cabal> Warning: 'findExecutable' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Program/Find.hs:205:1
Cabal>     * in ‘System.Directory’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Program/Find.hs:205:1
Cabal>   63% (  7 / 11) in 'Distribution.Simple.Program.Find'
Cabal>   Missing documentation for:
Cabal>     ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
Cabal>     defaultProgramSearchPath (src/Distribution/Simple/Program/Find.hs:66)
Cabal>     findProgramOnSearchPath (src/Distribution/Simple/Program/Find.hs:82)
Cabal>     logExtraProgramSearchPath (src/Distribution/Simple/Program/Find.hs:72)
Cabal> Warning: 'UnitIndex' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'PackageIndex' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/PackageIndex.hs:127:23
Cabal>     * at src/Distribution/Simple/PackageIndex.hs:127:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/PackageIndex.hs:127:1
Cabal> Warning: 'InstalledPackageInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.InstalledPackageInfo’
Cabal>     * in ‘Distribution.Types.InstalledPackageInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.InstalledPackageInfo’
Cabal> Warning: 'Cabal' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'PackageDB' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   92% ( 38 / 41) in 'Distribution.Simple.PackageIndex'
Cabal>   Missing documentation for:
Cabal>     SearchResult (src/Distribution/Simple/PackageIndex.hs:559)
Cabal>     topologicalOrder (src/Distribution/Simple/PackageIndex.hs:667)
Cabal>     reverseTopologicalOrder (src/Distribution/Simple/PackageIndex.hs:675)
Cabal>   50% (  3 /  6) in 'Distribution.Simple.PackageDescription'
Cabal>   Missing documentation for:
Cabal>     readGenericPackageDescription (src/Distribution/Simple/PackageDescription.hs:45)
Cabal>     readHookedBuildInfo (src/Distribution/Simple/PackageDescription.hs:48)
Cabal>     parseString (src/Distribution/Simple/PackageDescription.hs:81)
Cabal> Warning: 'matchDirFileGlob' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'Version' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   68% ( 15 / 22) in 'Distribution.Simple.Glob.Internal'
Cabal>   Missing documentation for:
Cabal>     parseFileGlob (src/Distribution/Simple/Glob/Internal.hs:138)
Cabal>     enableMultidot (src/Distribution/Simple/Glob/Internal.hs:178)
Cabal>     dispGlobPieces (src/Distribution/Simple/Glob/Internal.hs:234)
Cabal>     isGlobEscapedChar (src/Distribution/Simple/Glob/Internal.hs:252)
Cabal>     GlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:260)
Cabal>     explainGlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:272)
Cabal>     GlobResult (src/Distribution/Simple/Glob/Internal.hs:318)
Cabal> Warning: 'die'' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'Version' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'die' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   75% ( 12 / 16) in 'Distribution.Simple.Glob'
Cabal>   Missing documentation for:
Cabal>     GlobResult (src/Distribution/Simple/Glob/Internal.hs:318)
Cabal>     parseFileGlob (src/Distribution/Simple/Glob/Internal.hs:138)
Cabal>     GlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:260)
Cabal>     explainGlobSyntaxError (src/Distribution/Simple/Glob/Internal.hs:272)
Cabal> Warning: 'm' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'TargetAnnotation' is ambiguous. It is defined
Cabal>     * at src/Distribution/PackageDescription/Check/Monad.hs:160:27
Cabal>     * at src/Distribution/PackageDescription/Check/Monad.hs:160:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:160:1
Cabal> Warning: 'CheckPackageContentOps' is ambiguous. It is defined
Cabal>     * at src/Distribution/PackageDescription/Check/Monad.hs:92:33
Cabal>     * at src/Distribution/PackageDescription/Check/Monad.hs:92:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:92:1
Cabal> Warning: 'CheckCtx' is ambiguous. It is defined
Cabal>     * at src/Distribution/PackageDescription/Check/Monad.hs:109:19
Cabal>     * at src/Distribution/PackageDescription/Check/Monad.hs:109:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:109:1
Cabal> Warning: 'TaraAnn' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'LocalBuildInfo' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   68% ( 33 / 48) in 'Distribution.Simple.Compiler'
Cabal>   Missing documentation for:
Cabal>     Compiler (src/Distribution/Simple/Compiler.hs:91)
Cabal>     showCompilerId (src/Distribution/Simple/Compiler.hs:113)
Cabal>     showCompilerIdWithAbi (src/Distribution/Simple/Compiler.hs:116)
Cabal>     compilerFlavor (src/Distribution/Simple/Compiler.hs:123)
Cabal>     compilerVersion (src/Distribution/Simple/Compiler.hs:126)
Cabal>     compilerInfo (src/Distribution/Simple/Compiler.hs:155)
Cabal>     absolutePackageDBPath (src/Distribution/Simple/Compiler.hs:213)
Cabal>     flagToOptimisationLevel (src/Distribution/Simple/Compiler.hs:237)
Cabal>     flagToDebugInfoLevel (src/Distribution/Simple/Compiler.hs:270)
Cabal>     CompilerFlag (src/Distribution/Simple/Compiler.hs:310)
Cabal>     languageToFlags (src/Distribution/Simple/Compiler.hs:295)
Cabal>     unsupportedLanguages (src/Distribution/Simple/Compiler.hs:290)
Cabal>     knownProfDetailLevels (src/Distribution/Simple/Compiler.hs:476)
Cabal>     flagToProfDetailLevel (src/Distribution/Simple/Compiler.hs:464)
Cabal>     showProfDetailLevel (src/Distribution/Simple/Compiler.hs:486)
Cabal>   65% ( 17 / 26) in 'Distribution.Simple.Program.HcPkg'
Cabal>   Missing documentation for:
Cabal>     initInvocation (src/Distribution/Simple/Program/HcPkg.hs:387)
Cabal>     registerInvocation (src/Distribution/Simple/Program/HcPkg.hs:401)
Cabal>     unregisterInvocation (src/Distribution/Simple/Program/HcPkg.hs:429)
Cabal>     recacheInvocation (src/Distribution/Simple/Program/HcPkg.hs:439)
Cabal>     exposeInvocation (src/Distribution/Simple/Program/HcPkg.hs:450)
Cabal>     hideInvocation (src/Distribution/Simple/Program/HcPkg.hs:473)
Cabal>     dumpInvocation (src/Distribution/Simple/Program/HcPkg.hs:479)
Cabal>     describeInvocation (src/Distribution/Simple/Program/HcPkg.hs:461)
Cabal>     listInvocation (src/Distribution/Simple/Program/HcPkg.hs:492)
Cabal> Warning: 'OpenModule' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Backpack’
Cabal>     * in ‘Distribution.Backpack’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Backpack’
Cabal>   18% (  2 / 11) in 'Distribution.Simple.Program.GHC'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     GhcMode (src/Distribution/Simple/Program/GHC.hs:585)
Cabal>     GhcOptimisation (src/Distribution/Simple/Program/GHC.hs:600)
Cabal>     GhcDynLinkMode (src/Distribution/Simple/Program/GHC.hs:611)
Cabal>     GhcProfAuto (src/Distribution/Simple/Program/GHC.hs:620)
Cabal>     ghcInvocation (src/Distribution/Simple/Program/GHC.hs:648)
Cabal>     renderGhcOptions (src/Distribution/Simple/Program/GHC.hs:659)
Cabal>     runGHC (src/Distribution/Simple/Program/GHC.hs:638)
Cabal>     normaliseGhcArgs (src/Distribution/Simple/Program/GHC.hs:49)
Cabal> Warning: 'Program' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Program/Types.hs:50:16
Cabal>     * at src/Distribution/Simple/Program/Types.hs:50:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
Cabal>   12% (  4 / 31) in 'Distribution.Simple.Program.Builtin'
Cabal>   Missing documentation for:
Cabal>     ghcProgram (src/Distribution/Simple/Program/Builtin.hs:104)
Cabal>     ghcPkgProgram (src/Distribution/Simple/Program/Builtin.hs:145)
Cabal>     runghcProgram (src/Distribution/Simple/Program/Builtin.hs:135)
Cabal>     ghcjsProgram (src/Distribution/Simple/Program/Builtin.hs:156)
Cabal>     ghcjsPkgProgram (src/Distribution/Simple/Program/Builtin.hs:163)
Cabal>     hmakeProgram (src/Distribution/Simple/Program/Builtin.hs:174)
Cabal>     jhcProgram (src/Distribution/Simple/Program/Builtin.hs:185)
Cabal>     haskellSuiteProgram (src/Distribution/Simple/Program/Builtin.hs:228)
Cabal>     haskellSuitePkgProgram (src/Distribution/Simple/Program/Builtin.hs:239)
Cabal>     uhcProgram (src/Distribution/Simple/Program/Builtin.hs:197)
Cabal>     gccProgram (src/Distribution/Simple/Program/Builtin.hs:268)
Cabal>     arProgram (src/Distribution/Simple/Program/Builtin.hs:274)
Cabal>     stripProgram (src/Distribution/Simple/Program/Builtin.hs:277)
Cabal>     happyProgram (src/Distribution/Simple/Program/Builtin.hs:246)
Cabal>     alexProgram (src/Distribution/Simple/Program/Builtin.hs:257)
Cabal>     hsc2hsProgram (src/Distribution/Simple/Program/Builtin.hs:284)
Cabal>     c2hsProgram (src/Distribution/Simple/Program/Builtin.hs:295)
Cabal>     cpphsProgram (src/Distribution/Simple/Program/Builtin.hs:301)
Cabal>     hscolourProgram (src/Distribution/Simple/Program/Builtin.hs:311)
Cabal>     doctestProgram (src/Distribution/Simple/Program/Builtin.hs:324)
Cabal>     haddockProgram (src/Distribution/Simple/Program/Builtin.hs:335)
Cabal>     greencardProgram (src/Distribution/Simple/Program/Builtin.hs:347)
Cabal>     ldProgram (src/Distribution/Simple/Program/Builtin.hs:350)
Cabal>     tarProgram (src/Distribution/Simple/Program/Builtin.hs:391)
Cabal>     cppProgram (src/Distribution/Simple/Program/Builtin.hs:409)
Cabal>     pkgConfigProgram (src/Distribution/Simple/Program/Builtin.hs:412)
Cabal>     hpcProgram (src/Distribution/Simple/Program/Builtin.hs:203)
Cabal> Warning: 'ProgramDb' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Program/Db.hs:95:18
Cabal>     * at src/Distribution/Simple/Program/Db.hs:95:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Program/Db.hs:95:1
Cabal> Warning: 'Program' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Program/Types.hs:50:16
Cabal>     * at src/Distribution/Simple/Program/Types.hs:50:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
Cabal> Warning: 'Programs' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'AnyVersion' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   82% ( 28 / 34) in 'Distribution.Simple.Program.Db'
Cabal>   Missing documentation for:
Cabal>     emptyProgramDb (src/Distribution/Simple/Program/Db.hs:107)
Cabal>     defaultProgramDb (src/Distribution/Simple/Program/Db.hs:110)
Cabal>     addKnownPrograms (src/Distribution/Simple/Program/Db.hs:190)
Cabal>     lookupKnownProgram (src/Distribution/Simple/Program/Db.hs:193)
Cabal>     knownPrograms (src/Distribution/Simple/Program/Db.hs:197)
Cabal>     userMaybeSpecifyPath (src/Distribution/Simple/Program/Db.hs:259)
Cabal> Warning: 'Program' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Program/Types.hs:50:16
Cabal>     * at src/Distribution/Simple/Program/Types.hs:50:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:50:1
Cabal> Warning: 'ConfiguredProgram' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Program/Types.hs:120:26
Cabal>     * at src/Distribution/Simple/Program/Types.hs:120:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Program/Types.hs:120:1
Cabal>   50% ( 40 / 80) in 'Distribution.Simple.Program'
Cabal>   Missing documentation for:
Cabal>     ProgramSearchPathEntry (src/Distribution/Simple/Program/Types.hs:105)
Cabal>     findProgramOnSearchPath (src/Distribution/Simple/Program/Find.hs:82)
Cabal>     defaultProgramSearchPath (src/Distribution/Simple/Program/Find.hs:66)
Cabal>     ProgArg (src/Distribution/Simple/Program/Types.hs:83)
Cabal>     emptyProgramInvocation (src/Distribution/Simple/Program/Run.hs:71)
Cabal>     simpleProgramInvocation (src/Distribution/Simple/Program/Run.hs:83)
Cabal>     programInvocation (src/Distribution/Simple/Program/Run.hs:90)
Cabal>     runProgramInvocation (src/Distribution/Simple/Program/Run.hs:101)
Cabal>     getProgramInvocationOutput (src/Distribution/Simple/Program/Run.hs:158)
Cabal>     getProgramInvocationLBS (src/Distribution/Simple/Program/Run.hs:166)
Cabal>     defaultProgramDb (src/Distribution/Simple/Program/Db.hs:110)
Cabal>     emptyProgramDb (src/Distribution/Simple/Program/Db.hs:107)
Cabal>     addKnownPrograms (src/Distribution/Simple/Program/Db.hs:190)
Cabal>     lookupKnownProgram (src/Distribution/Simple/Program/Db.hs:193)
Cabal>     knownPrograms (src/Distribution/Simple/Program/Db.hs:197)
Cabal>     userMaybeSpecifyPath (src/Distribution/Simple/Program/Db.hs:259)
Cabal>     ghcProgram (src/Distribution/Simple/Program/Builtin.hs:104)
Cabal>     ghcPkgProgram (src/Distribution/Simple/Program/Builtin.hs:145)
Cabal>     ghcjsProgram (src/Distribution/Simple/Program/Builtin.hs:156)
Cabal>     ghcjsPkgProgram (src/Distribution/Simple/Program/Builtin.hs:163)
Cabal>     hmakeProgram (src/Distribution/Simple/Program/Builtin.hs:174)
Cabal>     jhcProgram (src/Distribution/Simple/Program/Builtin.hs:185)
Cabal>     uhcProgram (src/Distribution/Simple/Program/Builtin.hs:197)
Cabal>     gccProgram (src/Distribution/Simple/Program/Builtin.hs:268)
Cabal>     arProgram (src/Distribution/Simple/Program/Builtin.hs:274)
Cabal>     stripProgram (src/Distribution/Simple/Program/Builtin.hs:277)
Cabal>     happyProgram (src/Distribution/Simple/Program/Builtin.hs:246)
Cabal>     alexProgram (src/Distribution/Simple/Program/Builtin.hs:257)
Cabal>     hsc2hsProgram (src/Distribution/Simple/Program/Builtin.hs:284)
Cabal>     c2hsProgram (src/Distribution/Simple/Program/Builtin.hs:295)
Cabal>     cpphsProgram (src/Distribution/Simple/Program/Builtin.hs:301)
Cabal>     hscolourProgram (src/Distribution/Simple/Program/Builtin.hs:311)
Cabal>     doctestProgram (src/Distribution/Simple/Program/Builtin.hs:324)
Cabal>     haddockProgram (src/Distribution/Simple/Program/Builtin.hs:335)
Cabal>     greencardProgram (src/Distribution/Simple/Program/Builtin.hs:347)
Cabal>     ldProgram (src/Distribution/Simple/Program/Builtin.hs:350)
Cabal>     tarProgram (src/Distribution/Simple/Program/Builtin.hs:391)
Cabal>     cppProgram (src/Distribution/Simple/Program/Builtin.hs:409)
Cabal>     pkgConfigProgram (src/Distribution/Simple/Program/Builtin.hs:412)
Cabal>     hpcProgram (src/Distribution/Simple/Program/Builtin.hs:203)
Cabal>   33% (  1 /  3) in 'Distribution.Simple.Program.Strip'
Cabal>   Missing documentation for:
Cabal>     stripLib (src/Distribution/Simple/Program/Strip.hs:52)
Cabal>     stripExe (src/Distribution/Simple/Program/Strip.hs:41)
Cabal> Warning: 'CommandUI' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Command.hs:97:24
Cabal>     * at src/Distribution/Simple/Command.hs:97:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Command.hs:97:1
Cabal> Warning: 'GetOpt' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'smart' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   61% ( 33 / 54) in 'Distribution.Simple.Command'
Cabal>   Missing documentation for:
Cabal>     CommandUI (src/Distribution/Simple/Command.hs:97)
Cabal>     CommandParse (src/Distribution/Simple/Command.hs:596)
Cabal>     helpCommandUI (src/Distribution/Simple/Command.hs:764)
Cabal>     ShowOrParseArgs (src/Distribution/Simple/Command.hs:116)
Cabal>     Command (src/Distribution/Simple/Command.hs:608)
Cabal>     commandAddAction (src/Distribution/Simple/Command.hs:621)
Cabal>     CommandType (src/Distribution/Simple/Command.hs:607)
Cabal>     commandFromSpec (src/Distribution/Simple/Command.hs:788)
Cabal>     commandsRun (src/Distribution/Simple/Command.hs:659)
Cabal>     commandsRunWithFallback (src/Distribution/Simple/Command.hs:675)
Cabal>     defaultCommandFallback (src/Distribution/Simple/Command.hs:667)
Cabal>     Name (src/Distribution/Simple/Command.hs:117)
Cabal>     liftOption (src/Distribution/Simple/Command.hs:374)
Cabal>     Description (src/Distribution/Simple/Command.hs:118)
Cabal>     OptFlags (src/Distribution/Simple/Command.hs:160)
Cabal>     ArgPlaceHolder (src/Distribution/Simple/Command.hs:161)
Cabal>     MkOptDescr (src/Distribution/Simple/Command.hs:200)
Cabal>     optArgDef' (src/Distribution/Simple/Command.hs:275)
Cabal>     noArg (src/Distribution/Simple/Command.hs:279)
Cabal>     boolOpt (src/Distribution/Simple/Command.hs:287)
Cabal>     boolOpt' (src/Distribution/Simple/Command.hs:299)
Cabal> Warning: 'progDb' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'OptionField' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Command.hs:125:22
Cabal>     * at src/Distribution/Simple/Command.hs:125:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Command.hs:125:1
Cabal> Warning: 'haddocksInterfaces' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'haddocksAction' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'BuildOptions' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/LocalBuildConfig.hs:148:21
Cabal>     * at src/Distribution/Types/LocalBuildConfig.hs:148:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/LocalBuildConfig.hs:148:1
Cabal> Warning: 'LocalBuildConfig' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/LocalBuildConfig.hs:134:25
Cabal>     * at src/Distribution/Types/LocalBuildConfig.hs:134:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/LocalBuildConfig.hs:134:1
Cabal> Warning: 'InstalledPackageInfo' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'PackageBuildDescr' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/LocalBuildConfig.hs:48:26
Cabal>     * at src/Distribution/Types/LocalBuildConfig.hs:48:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/LocalBuildConfig.hs:48:1
Cabal>   77% (  7 /  9) in 'Distribution.Types.LocalBuildConfig'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     buildOptionsConfigFlags (src/Distribution/Types/LocalBuildConfig.hs:202)
Cabal> Warning: 'LocalBuildInfo' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/LocalBuildInfo.hs:180:1
Cabal>     * at src/Distribution/Types/LocalBuildInfo.hs:129:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
Cabal> Warning: 'LocalBuildDescr' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/LocalBuildConfig.hs:122:24
Cabal>     * at src/Distribution/Types/LocalBuildConfig.hs:122:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/LocalBuildConfig.hs:122:1
Cabal> Warning: 'LocalBuildConfig' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/LocalBuildConfig.hs:134:25
Cabal>     * at src/Distribution/Types/LocalBuildConfig.hs:134:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/LocalBuildConfig.hs:134:1
Cabal> Warning: 'PackageIdentifier' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.PackageId’
Cabal>     * in ‘Distribution.Types.PackageId’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.PackageId’
Cabal> Warning: 'localPkgDescr' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/LocalBuildConfig.hs:62:5
Cabal>     * at src/Distribution/Types/LocalBuildInfo.hs:193:5
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:193:5
Cabal> Warning: 'TargetInfo' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/TargetInfo.hs:22:19
Cabal>     * at src/Distribution/Types/TargetInfo.hs:22:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/TargetInfo.hs:22:1
Cabal> Warning: 'PackageDescription' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
Cabal> Warning: 'Component' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   53% ( 16 / 30) in 'Distribution.Types.LocalBuildInfo'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     buildDir (src/Distribution/Types/LocalBuildInfo.hs:277)
Cabal>     buildDirPBD (src/Distribution/Types/LocalBuildInfo.hs:281)
Cabal>     configFlagsBuildDir (src/Distribution/Types/LocalBuildInfo.hs:285)
Cabal>     cabalFilePath (src/Distribution/Types/LocalBuildInfo.hs:288)
Cabal>     progPrefix (src/Distribution/Types/LocalBuildInfo.hs:292)
Cabal>     progSuffix (src/Distribution/Types/LocalBuildInfo.hs:294)
Cabal>     unitIdTarget' (src/Distribution/Types/LocalBuildInfo.hs:360)
Cabal>     componentNameTargets (src/Distribution/Types/LocalBuildInfo.hs:420)
Cabal>     unitIdTarget (src/Distribution/Types/LocalBuildInfo.hs:423)
Cabal>     allTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:426)
Cabal>     withAllTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:429)
Cabal>     neededTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:432)
Cabal>     withNeededTargetsInBuildOrder (src/Distribution/Types/LocalBuildInfo.hs:435)
Cabal> Warning: 'LocalBuildInfo' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/LocalBuildInfo.hs:180:1
Cabal>     * at src/Distribution/Types/LocalBuildInfo.hs:129:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
Cabal> Warning: 'Executable' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.Executable’
Cabal>     * in ‘Distribution.Types.Executable’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.Executable’
Cabal> Warning: 'Benchmark' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.Benchmark’
Cabal>     * in ‘Distribution.Types.Benchmark’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.Benchmark’
Cabal> Warning: 'Library' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.Library’
Cabal>     * in ‘Distribution.Types.Library’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.Library’
Cabal> Warning: 'compBuildOrder' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   49% ( 31 / 63) in 'Distribution.Simple.LocalBuildInfo'
Cabal>   Missing documentation for:
Cabal>     buildDir (src/Distribution/Types/LocalBuildInfo.hs:277)
Cabal>     cabalFilePath (src/Distribution/Types/LocalBuildInfo.hs:288)
Cabal>     progPrefix (src/Distribution/Types/LocalBuildInfo.hs:292)
Cabal>     progSuffix (src/Distribution/Types/LocalBuildInfo.hs:294)
Cabal>     Component
Cabal>     ComponentName
Cabal>     LibraryName
Cabal>     defaultLibName
Cabal>     showComponentName
Cabal>     componentBuildDir (src/Distribution/Simple/LocalBuildInfo.hs:115)
Cabal>     foldComponent
Cabal>     componentName
Cabal>     componentBuildInfo
Cabal>     lookupComponent
Cabal>     getComponent
Cabal>     allComponentsInBuildOrder (src/Distribution/Simple/LocalBuildInfo.hs:211)
Cabal>     withTestLBI (src/Distribution/Simple/LocalBuildInfo.hs:173)
Cabal>     enabledTestLBIs (src/Distribution/Simple/LocalBuildInfo.hs:180)
Cabal>     enabledBenchLBIs (src/Distribution/Simple/LocalBuildInfo.hs:190)
Cabal>     defaultInstallDirs (src/Distribution/Simple/InstallDirs.hs:179)
Cabal>     defaultInstallDirs' (src/Distribution/Simple/InstallDirs.hs:187)
Cabal>     combineInstallDirs (src/Distribution/Simple/InstallDirs.hs:121)
Cabal>     PathTemplateVariable (src/Distribution/Simple/InstallDirs/Internal.hs:20)
Cabal>     PathTemplateEnv (src/Distribution/Simple/InstallDirs.hs:395)
Cabal>     combinePathTemplate (src/Distribution/Simple/InstallDirs.hs:410)
Cabal>     platformTemplateEnv (src/Distribution/Simple/InstallDirs.hs:452)
Cabal>     compilerTemplateEnv (src/Distribution/Simple/InstallDirs.hs:447)
Cabal>     packageTemplateEnv (src/Distribution/Simple/InstallDirs.hs:437)
Cabal>     abiTemplateEnv (src/Distribution/Simple/InstallDirs.hs:458)
Cabal>     installDirsTemplateEnv (src/Distribution/Simple/InstallDirs.hs:477)
Cabal>     absoluteInstallCommandDirs (src/Distribution/Simple/LocalBuildInfo.hs:378)
Cabal>     substPathTemplate (src/Distribution/Simple/LocalBuildInfo.hs:436)
Cabal> Warning: 'PackageLog' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Test/Log.hs:40:19
Cabal>     * at src/Distribution/Simple/Test/Log.hs:40:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Test/Log.hs:40:1
Cabal> Warning: 'TestSuiteLog' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Test/Log.hs:59:21
Cabal>     * at src/Distribution/Simple/Test/Log.hs:59:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Test/Log.hs:59:1
Cabal>   71% ( 10 / 14) in 'Distribution.Simple.Test.Log'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     TestLogs (src/Distribution/Simple/Test/Log.hs:66)
Cabal>     summarizeSuiteStart (src/Distribution/Simple/Test/Log.hs:193)
Cabal>     testSuiteLogPath (src/Distribution/Simple/Test/Log.hs:127)
Cabal>   55% (  5 /  9) in 'Distribution.Simple.Hpc'
Cabal>   Missing documentation for:
Cabal>     Way (src/Distribution/Simple/Hpc.hs:55)
Cabal>     htmlDir (src/Distribution/Simple/Hpc.hs:104)
Cabal>     mixDir (src/Distribution/Simple/Hpc.hs:77)
Cabal>     tixDir (src/Distribution/Simple/Hpc.hs:85)
Cabal>   50% (  1 /  2) in 'Distribution.Simple.Build.PackageInfoModule'
Cabal>   Missing documentation for:
Cabal>     generatePackageInfoModule (src/Distribution/Simple/Build/PackageInfoModule.hs:37)
Cabal>  100% (  3 /  3) in 'Distribution.Simple.Build.Macros'
Cabal> Warning: 'computeCompatPackageName' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'ConfiguredComponent' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ConfiguredComponent.hs:45:28
Cabal>     * at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
Cabal>   54% (  6 / 11) in 'Distribution.Backpack.ConfiguredComponent'
Cabal>   Missing documentation for:
Cabal>     toConfiguredComponent (src/Distribution/Backpack/ConfiguredComponent.hs:179)
Cabal>     toConfiguredComponents (src/Distribution/Backpack/ConfiguredComponent.hs:317)
Cabal>     ConfiguredComponentMap (src/Distribution/Backpack/ConfiguredComponent.hs:169)
Cabal>     extendConfiguredComponentMap (src/Distribution/Backpack/ConfiguredComponent.hs:292)
Cabal>     newPackageDepsBehaviour (src/Distribution/Backpack/ConfiguredComponent.hs:350)
Cabal> Warning: 'ConfiguredComponent' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ConfiguredComponent.hs:45:28
Cabal>     * at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ConfiguredComponent.hs:45:1
Cabal> Warning: 'LinkedComponent' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/LinkedComponent.hs:50:24
Cabal>     * at src/Distribution/Backpack/LinkedComponent.hs:50:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/LinkedComponent.hs:50:1
Cabal> Warning: 'ReadyComponent' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'ModuleRenaming' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.ModuleRenaming’
Cabal>     * in ‘Distribution.Types.ModuleRenaming’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.ModuleRenaming’
Cabal> Warning: 'IncludeRenaming' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.IncludeRenaming’
Cabal>     * in ‘Distribution.Types.IncludeRenaming’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.IncludeRenaming’
Cabal> Warning: 'ModSubst' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   54% (  6 / 11) in 'Distribution.Backpack.LinkedComponent'
Cabal>   Missing documentation for:
Cabal>     toLinkedComponent (src/Distribution/Backpack/LinkedComponent.hs:123)
Cabal>     toLinkedComponents (src/Distribution/Backpack/LinkedComponent.hs:417)
Cabal>     dispLinkedComponent (src/Distribution/Backpack/LinkedComponent.hs:99)
Cabal>     LinkedComponentMap (src/Distribution/Backpack/LinkedComponent.hs:430)
Cabal>     extendLinkedComponentMap (src/Distribution/Backpack/LinkedComponent.hs:436)
Cabal> Warning: 'PackageDescription' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
Cabal>  100% (  7 /  7) in 'Distribution.Backpack.ComponentsGraph'
Cabal>  100% (  2 /  2) in 'Distribution.Simple.Program.Ld'
Cabal>  100% (  3 /  3) in 'Distribution.Simple.Program.Ar'
Cabal> Warning: 'CommandUI' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'Monoid' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   25% ( 26 /102) in 'Distribution.Simple.Setup'
Cabal>   Missing documentation for:
Cabal>     emptyGlobalFlags (src/Distribution/Simple/Setup/Global.hs:115)
Cabal>     defaultGlobalFlags (src/Distribution/Simple/Setup/Global.hs:54)
Cabal>     globalCommand (src/Distribution/Simple/Setup/Global.hs:61)
Cabal>     emptyConfigFlags (src/Distribution/Simple/Setup/Config.hs:1024)
Cabal>     defaultConfigFlags (src/Distribution/Simple/Setup/Config.hs:310)
Cabal>     configureCommand (src/Distribution/Simple/Setup/Config.hs:356)
Cabal>     configAbsolutePaths (src/Distribution/Simple/Setup/Config.hs:302)
Cabal>     readPackageDbList (src/Distribution/Simple/Setup/Config.hs:869)
Cabal>     showPackageDbList (src/Distribution/Simple/Setup/Config.hs:881)
Cabal>     emptyCopyFlags (src/Distribution/Simple/Setup/Copy.hs:146)
Cabal>     defaultCopyFlags (src/Distribution/Simple/Setup/Copy.hs:62)
Cabal>     copyCommand (src/Distribution/Simple/Setup/Copy.hs:72)
Cabal>     emptyInstallFlags (src/Distribution/Simple/Setup/Install.hs:151)
Cabal>     defaultInstallFlags (src/Distribution/Simple/Setup/Install.hs:61)
Cabal>     installCommand (src/Distribution/Simple/Setup/Install.hs:73)
Cabal>     HaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:83)
Cabal>     emptyHaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:357)
Cabal>     defaultHaddockFlags (src/Distribution/Simple/Setup/Haddock.hs:116)
Cabal>     haddockCommand (src/Distribution/Simple/Setup/Haddock.hs:146)
Cabal>     HaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:379)
Cabal>     emptyHaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:599)
Cabal>     defaultHaddockProjectFlags (src/Distribution/Simple/Setup/Haddock.hs:422)
Cabal>     haddockProjectCommand (src/Distribution/Simple/Setup/Haddock.hs:446)
Cabal>     HscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:42)
Cabal>     emptyHscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:58)
Cabal>     defaultHscolourFlags (src/Distribution/Simple/Setup/Hscolour.hs:61)
Cabal>     hscolourCommand (src/Distribution/Simple/Setup/Hscolour.hs:81)
Cabal>     BuildFlags (src/Distribution/Simple/Setup/Build.hs:47)
Cabal>     emptyBuildFlags (src/Distribution/Simple/Setup/Build.hs:158)
Cabal>     defaultBuildFlags (src/Distribution/Simple/Setup/Build.hs:65)
Cabal>     buildCommand (src/Distribution/Simple/Setup/Build.hs:78)
Cabal>     DumpBuildInfo (src/Distribution/Types/DumpBuildInfo.hs:10)
Cabal>     ReplFlags (src/Distribution/Simple/Setup/Repl.hs:63)
Cabal>     defaultReplFlags (src/Distribution/Simple/Setup/Repl.hs:77)
Cabal>     replCommand (src/Distribution/Simple/Setup/Repl.hs:95)
Cabal>     ReplOptions (src/Distribution/Simple/Setup/Repl.hs:46)
Cabal>     CleanFlags (src/Distribution/Simple/Setup/Clean.hs:42)
Cabal>     emptyCleanFlags (src/Distribution/Simple/Setup/Clean.hs:90)
Cabal>     defaultCleanFlags (src/Distribution/Simple/Setup/Clean.hs:54)
Cabal>     cleanCommand (src/Distribution/Simple/Setup/Clean.hs:63)
Cabal>     emptyRegisterFlags (src/Distribution/Simple/Setup/Register.hs:188)
Cabal>     defaultRegisterFlags (src/Distribution/Simple/Setup/Register.hs:61)
Cabal>     registerCommand (src/Distribution/Simple/Setup/Register.hs:75)
Cabal>     unregisterCommand (src/Distribution/Simple/Setup/Register.hs:142)
Cabal>     emptySDistFlags (src/Distribution/Simple/Setup/SDist.hs:106)
Cabal>     defaultSDistFlags (src/Distribution/Simple/Setup/SDist.hs:53)
Cabal>     sdistCommand (src/Distribution/Simple/Setup/SDist.hs:63)
Cabal>     TestFlags (src/Distribution/Simple/Setup/Test.hs:82)
Cabal>     emptyTestFlags (src/Distribution/Simple/Setup/Test.hs:247)
Cabal>     defaultTestFlags (src/Distribution/Simple/Setup/Test.hs:100)
Cabal>     testCommand (src/Distribution/Simple/Setup/Test.hs:114)
Cabal>     TestShowDetails (src/Distribution/Simple/Setup/Test.hs:51)
Cabal>     BenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:45)
Cabal>     emptyBenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:124)
Cabal>     defaultBenchmarkFlags (src/Distribution/Simple/Setup/Benchmark.hs:56)
Cabal>     benchmarkCommand (src/Distribution/Simple/Setup/Benchmark.hs:64)
Cabal>     configureOptions (src/Distribution/Simple/Setup/Config.hs:403)
Cabal>     configureCCompiler (src/Distribution/Simple/Setup/Common.hs:327)
Cabal>     configureLinker (src/Distribution/Simple/Setup/Common.hs:330)
Cabal>     buildOptions (src/Distribution/Simple/Setup/Build.hs:129)
Cabal>     haddockOptions (src/Distribution/Simple/Setup/Haddock.hs:184)
Cabal>     haddockProjectOptions (src/Distribution/Simple/Setup/Haddock.hs:484)
Cabal>     installDirsOptions (src/Distribution/Simple/Setup/Config.hs:920)
Cabal>     testOptions' (src/Distribution/Simple/Setup/Test.hs:134)
Cabal>     benchmarkOptions' (src/Distribution/Simple/Setup/Benchmark.hs:84)
Cabal>     programFlagsDescription (src/Distribution/Simple/Setup/Common.hs:105)
Cabal>     replOptions (src/Distribution/Simple/Setup/Repl.hs:183)
Cabal>     defaultDistPref (src/Distribution/Simple/Setup/Common.hs:65)
Cabal>     optionDistPref (src/Distribution/Simple/Setup/Common.hs:255)
Cabal>     boolOpt (src/Distribution/Simple/Setup/Common.hs:228)
Cabal>     boolOpt' (src/Distribution/Simple/Setup/Common.hs:234)
Cabal>     trueArg (src/Distribution/Simple/Setup/Common.hs:237)
Cabal>     falseArg (src/Distribution/Simple/Setup/Common.hs:238)
Cabal>     optionVerbosity (src/Distribution/Simple/Setup/Common.hs:275)
Cabal>     buildingWhatVerbosity (src/Distribution/Simple/Setup.hs:180)
Cabal>     buildingWhatDistPref (src/Distribution/Simple/Setup.hs:187)
Cabal> Warning: 'Library' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'BuildInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
Cabal> Warning: 'Compiler' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Compiler.hs:91:17
Cabal>     * at src/Distribution/Simple/Compiler.hs:91:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Compiler.hs:91:1
Cabal>   81% ( 13 / 16) in 'Distribution.Simple.Build.Inputs'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     buildingWhatVerbosity (src/Distribution/Simple/Setup.hs:180)
Cabal>     buildingWhatDistPref (src/Distribution/Simple/Setup.hs:187)
Cabal> Warning: 'matchExactly' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'ambiguousWith' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'shadows' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'TargetInfo' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/TargetInfo.hs:22:19
Cabal>     * at src/Distribution/Types/TargetInfo.hs:22:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/TargetInfo.hs:22:1
Cabal> Warning: 'PackageDescription' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
Cabal>   57% ( 11 / 19) in 'Distribution.Simple.BuildTarget'
Cabal>   Missing documentation for:
Cabal>     QualLevel (src/Distribution/Simple/BuildTarget.hs:371)
Cabal>     buildTargetComponentName (src/Distribution/Simple/BuildTarget.hs:136)
Cabal>     readUserBuildTargets (src/Distribution/Simple/BuildTarget.hs:183)
Cabal>     showUserBuildTarget (src/Distribution/Simple/BuildTarget.hs:255)
Cabal>     UserBuildTargetProblem (src/Distribution/Simple/BuildTarget.hs:242)
Cabal>     reportUserBuildTargetProblems (src/Distribution/Simple/BuildTarget.hs:247)
Cabal>     BuildTargetProblem (src/Distribution/Simple/BuildTarget.hs:334)
Cabal>     reportBuildTargetProblems (src/Distribution/Simple/BuildTarget.hs:397)
Cabal> Warning: 'lib' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'C' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   58% ( 18 / 31) in 'Distribution.Simple.BuildPaths'
Cabal>   Missing documentation for:
Cabal>     defaultDistPref (src/Distribution/Simple/Setup/Common.hs:65)
Cabal>     srcPref (src/Distribution/Simple/BuildPaths.hs:74)
Cabal>     hscolourPref (src/Distribution/Simple/BuildPaths.hs:77)
Cabal>     cppHeaderName (src/Distribution/Simple/BuildPaths.hs:108)
Cabal>     haddockName (src/Distribution/Simple/BuildPaths.hs:129)
Cabal>     mkLibName (src/Distribution/Simple/BuildPaths.hs:220)
Cabal>     mkProfLibName (src/Distribution/Simple/BuildPaths.hs:223)
Cabal>     mkSharedLibName (src/Distribution/Simple/BuildPaths.hs:238)
Cabal>     mkStaticLibName (src/Distribution/Simple/BuildPaths.hs:244)
Cabal>     getSourceFiles (src/Distribution/Simple/BuildPaths.hs:191)
Cabal>     getLibSourceFiles (src/Distribution/Simple/BuildPaths.hs:140)
Cabal>     getExeSourceFiles (src/Distribution/Simple/BuildPaths.hs:157)
Cabal>     getFLibSourceFiles (src/Distribution/Simple/BuildPaths.hs:176)
Cabal>   12% (  1 /  8) in 'Distribution.Simple.UHC'
Cabal>   Missing documentation for:
Cabal>     configure (src/Distribution/Simple/UHC.hs:64)
Cabal>     getInstalledPackages (src/Distribution/Simple/UHC.hs:118)
Cabal>     buildLib (src/Distribution/Simple/UHC.hs:208)
Cabal>     buildExe (src/Distribution/Simple/UHC.hs:242)
Cabal>     installLib (src/Distribution/Simple/UHC.hs:324)
Cabal>     registerPackage (src/Distribution/Simple/UHC.hs:350)
Cabal>     inplacePackageDbPath (src/Distribution/Simple/UHC.hs:365)
Cabal>    0% (  0 / 13) in 'Distribution.Simple.HaskellSuite'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     configure (src/Distribution/Simple/HaskellSuite.hs:36)
Cabal>     hstoolVersion (src/Distribution/Simple/HaskellSuite.hs:93)
Cabal>     numericVersion (src/Distribution/Simple/HaskellSuite.hs:96)
Cabal>     getCompilerVersion (src/Distribution/Simple/HaskellSuite.hs:99)
Cabal>     getExtensions (src/Distribution/Simple/HaskellSuite.hs:113)
Cabal>     getLanguages (src/Distribution/Simple/HaskellSuite.hs:121)
Cabal>     getInstalledPackages (src/Distribution/Simple/HaskellSuite.hs:135)
Cabal>     buildLib (src/Distribution/Simple/HaskellSuite.hs:173)
Cabal>     installLib (src/Distribution/Simple/HaskellSuite.hs:224)
Cabal>     registerPackage (src/Distribution/Simple/HaskellSuite.hs:245)
Cabal>     initPackageDB (src/Distribution/Simple/HaskellSuite.hs:257)
Cabal>     packageDbOpt (src/Distribution/Simple/HaskellSuite.hs:265)
Cabal> Warning: 'Arch' is ambiguous. It is defined
Cabal>     * in ‘Distribution.System’
Cabal>     * in ‘Distribution.Types.ConfVar’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.System’
Cabal> Warning: 'OS' is ambiguous. It is defined
Cabal>     * in ‘Distribution.System’
Cabal>     * in ‘Distribution.Types.ConfVar’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.System’
Cabal> Warning: 'Platform' is ambiguous. It is defined
Cabal>     * in ‘Distribution.System’
Cabal>     * in ‘Distribution.System’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.System’
Cabal> Warning: 'BuildSources' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/GHCJS.hs:1105:21
Cabal>     * at src/Distribution/Simple/GHCJS.hs:1105:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/GHCJS.hs:1105:1
Cabal> Warning: 'InstalledPackageInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.InstalledPackageInfo’
Cabal>     * in ‘Distribution.Types.InstalledPackageInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.InstalledPackageInfo’
Cabal> Warning: 'BuildInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
Cabal>   52% ( 20 / 38) in 'Distribution.Simple.GHCJS'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     getGhcInfo (src/Distribution/Simple/GHCJS.hs:308)
Cabal>     configure (src/Distribution/Simple/GHCJS.hs:117)
Cabal>     buildLib (src/Distribution/Simple/GHCJS.hs:463)
Cabal>     replLib (src/Distribution/Simple/GHCJS.hs:474)
Cabal>     replFLib (src/Distribution/Simple/GHCJS.hs:891)
Cabal>     replExe (src/Distribution/Simple/GHCJS.hs:914)
Cabal>     hcPkgInfo (src/Distribution/Simple/GHCJS.hs:1968)
Cabal>     registerPackage (src/Distribution/Simple/GHCJS.hs:1992)
Cabal>     componentGhcOptions (src/Distribution/Simple/GHCJS.hs:1780)
Cabal>     componentCcGhcOptions (src/Distribution/Simple/GHC/Internal.hs:349)
Cabal>     getLibDir (src/Distribution/Simple/GHCJS.hs:355)
Cabal>     isDynamic (src/Distribution/Simple/GHCJS.hs:1948)
Cabal>     pkgRoot (src/Distribution/Simple/GHCJS.hs:2001)
Cabal>     readGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:57)
Cabal>     parseGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:54)
Cabal>     ParseErrorExc (src/Distribution/Simple/GHC/EnvironmentParser.hs:48)
Cabal>     getImplInfo (src/Distribution/Simple/GHC/ImplInfo.hs:70)
Cabal> Warning: 'Executable' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.Executable’
Cabal>     * in ‘Distribution.Types.Executable’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.Executable’
Cabal> Warning: 'TestSuite' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.TestSuite’
Cabal>     * in ‘Distribution.Types.TestSuite’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.TestSuite’
Cabal> Warning: 'Benchmark' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.Benchmark’
Cabal>     * in ‘Distribution.Types.Benchmark’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.Benchmark’
Cabal> Warning: 'BuildInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
Cabal> Warning: 'GhcOptions' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Program/GHC.hs:410:19
Cabal>     * at src/Distribution/Simple/Program/GHC.hs:410:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Program/GHC.hs:410:1
Cabal> Warning: 'PreBuildComponentRules' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'GhcOptions' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Program/GHC.hs:410:19
Cabal>     * at src/Distribution/Simple/Program/GHC.hs:410:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Program/GHC.hs:410:1
Cabal> Warning: 'Executable' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.Executable’
Cabal>     * in ‘Distribution.Types.Executable’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.Executable’
Cabal> Warning: 'InstalledPackageInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.InstalledPackageInfo’
Cabal>     * in ‘Distribution.Types.InstalledPackageInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.InstalledPackageInfo’
Cabal> Warning: 'BuildInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
Cabal> Warning: 'Compiler' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Compiler.hs:91:17
Cabal>     * at src/Distribution/Simple/Compiler.hs:91:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Compiler.hs:91:1
Cabal>   55% ( 21 / 38) in 'Distribution.Simple.GHC'
Cabal>   Missing documentation for:
Cabal>     getGhcInfo (src/Distribution/Simple/GHC.hs:387)
Cabal>     configure (src/Distribution/Simple/GHC.hs:155)
Cabal>     getInstalledPackagesMonitorFiles (src/Distribution/Simple/GHC.hs:545)
Cabal>     buildLib (src/Distribution/Simple/GHC.hs:578)
Cabal>     replLib (src/Distribution/Simple/GHC.hs:590)
Cabal>     replFLib (src/Distribution/Simple/GHC.hs:636)
Cabal>     replExe (src/Distribution/Simple/GHC.hs:661)
Cabal>     hcPkgInfo (src/Distribution/Simple/GHC.hs:960)
Cabal>     registerPackage (src/Distribution/Simple/GHC.hs:984)
Cabal>     componentGhcOptions (src/Distribution/Simple/GHC/Internal.hs:522)
Cabal>     componentCcGhcOptions (src/Distribution/Simple/GHC/Internal.hs:349)
Cabal>     getLibDir (src/Distribution/Simple/GHC.hs:451)
Cabal>     pkgRoot (src/Distribution/Simple/GHC.hs:993)
Cabal>     readGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:57)
Cabal>     parseGhcEnvironmentFile (src/Distribution/Simple/GHC/EnvironmentParser.hs:54)
Cabal>     ParseErrorExc (src/Distribution/Simple/GHC/EnvironmentParser.hs:48)
Cabal>     getImplInfo (src/Distribution/Simple/GHC/ImplInfo.hs:70)
Cabal>   60% (  3 /  5) in 'Distribution.Simple.ShowBuildInfo'
Cabal>   Missing documentation for:
Cabal>     mkCompilerInfo (src/Distribution/Simple/ShowBuildInfo.hs:134)
Cabal>     mkComponentInfo (src/Distribution/Simple/ShowBuildInfo.hs:142)
Cabal> Warning: 'register' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>  100% (  2 /  2) in 'Distribution.Simple.Install'
Cabal>   66% (  2 /  3) in 'Distribution.Simple.Build.PathsModule'
Cabal>   Missing documentation for:
Cabal>     generatePathsModule (src/Distribution/Simple/Build/PathsModule.hs:42)
Cabal> Warning: 'TestSuite' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.TestSuite’
Cabal>     * in ‘Distribution.Types.TestSuite’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.TestSuite’
Cabal> Warning: 'Test' is ambiguous. It is defined
Cabal>     * at src/Distribution/TestSuite.hs:79:5
Cabal>     * at src/Distribution/TestSuite.hs:78:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/TestSuite.hs:78:1
Cabal> Warning: 'TestSuiteLog' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Test/Log.hs:59:21
Cabal>     * at src/Distribution/Simple/Test/Log.hs:59:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Test/Log.hs:59:1
Cabal>   75% (  6 /  8) in 'Distribution.Simple.Test.LibV09'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     runTest (src/Distribution/Simple/Test/LibV09.hs:65)
Cabal>    0% (  0 /  2) in 'Distribution.Simple.Test.ExeV10'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal>     runTest (src/Distribution/Simple/Test/ExeV10.hs:59)
Cabal> Warning: 'dist' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'PackageDescription' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
Cabal> Warning: 'CheckPackageContentOps' is ambiguous. It is defined
Cabal>     * at src/Distribution/PackageDescription/Check/Monad.hs:92:33
Cabal>     * at src/Distribution/PackageDescription/Check/Monad.hs:92:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/PackageDescription/Check/Monad.hs:92:1
Cabal> Warning: 'GenericPackageDescription' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.GenericPackageDescription’
Cabal>     * in ‘Distribution.Types.GenericPackageDescription’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.GenericPackageDescription’
Cabal>   89% ( 17 / 19) in 'Distribution.PackageDescription.Check'
Cabal>   Missing documentation for:
Cabal>     CheckExplanationIDString (src/Distribution/PackageDescription/Check/Warning.hs:590)
Cabal>     ppCheckExplanationId (src/Distribution/PackageDescription/Check/Warning.hs:597)
Cabal>   66% (  4 /  6) in 'Distribution.Make'
Cabal>   Missing documentation for:
Cabal>     defaultMain (src/Distribution/Make.hs:85)
Cabal>     defaultMainArgs (src/Distribution/Make.hs:88)
Cabal> Warning: 'ModTime' is ambiguous. It is defined
Cabal>     * at src/Distribution/Compat/Time.hs:60:19
Cabal>     * at src/Distribution/Compat/Time.hs:60:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Compat/Time.hs:60:1
Cabal> Warning: 'sleepFileTimeCalibrate' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   85% (  6 /  7) in 'Distribution.Compat.Time'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal> Warning: 'InstM' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ReadyComponent.hs:205:19
Cabal>     * at src/Distribution/Backpack/ReadyComponent.hs:205:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:205:1
Cabal> Warning: 'IndefiniteComponent' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ReadyComponent.hs:110:28
Cabal>     * at src/Distribution/Backpack/ReadyComponent.hs:110:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:110:1
Cabal> Warning: 'InstantiatedComponent' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ReadyComponent.hs:93:30
Cabal>     * at src/Distribution/Backpack/ReadyComponent.hs:93:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:93:1
Cabal> Warning: 'componentPackageDeps' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'ReadyComponent' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/ReadyComponent.hs:55:23
Cabal>     * at src/Distribution/Backpack/ReadyComponent.hs:55:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/ReadyComponent.hs:55:1
Cabal> Warning: 'OpenModule' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Backpack’
Cabal>     * in ‘Distribution.Backpack’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Backpack’
Cabal> Warning: 'InstalledPackageInfo' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'MungedPackageId' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.MungedPackageId’
Cabal>     * in ‘Distribution.Types.MungedPackageId’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.MungedPackageId’
Cabal> Warning: 'LinkedComponent' is ambiguous. It is defined
Cabal>     * at src/Distribution/Backpack/LinkedComponent.hs:50:24
Cabal>     * at src/Distribution/Backpack/LinkedComponent.hs:50:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Backpack/LinkedComponent.hs:50:1
Cabal> Warning: 'improveUnitId' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'HashedUnitId' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   50% (  1 /  2) in 'Distribution.Backpack.Configure'
Cabal>   Missing documentation for:
Cabal>     configureComponentLocalBuildInfos (src/Distribution/Backpack/Configure.hs:79)
Cabal> Warning: 'OpenModule' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'Module' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   50% (  1 /  2) in 'Distribution.Backpack.DescribeUnitId'
Cabal>   Missing documentation for:
Cabal>     Module header
Cabal> Warning: 'InstalledPackageInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.InstalledPackageInfo’
Cabal>     * in ‘Distribution.Types.InstalledPackageInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.InstalledPackageInfo’
Cabal>   52% (  9 / 17) in 'Distribution.Simple.Register'
Cabal>   Missing documentation for:
Cabal>     register (src/Distribution/Simple/Register.hs:99)
Cabal>     unregister (src/Distribution/Simple/Register.hs:703)
Cabal>     internalPackageDBPath (src/Distribution/Simple/Register.hs:738)
Cabal>     initPackageDB (src/Distribution/Simple/Register.hs:355)
Cabal>     doesPackageDBExist (src/Distribution/Simple/Register.hs:375)
Cabal>     deletePackageDB (src/Distribution/Simple/Register.hs:383)
Cabal>     registerPackage (src/Distribution/Simple/Register.hs:430)
Cabal>     generateRegistrationInfo (src/Distribution/Simple/Register.hs:261)
Cabal> Warning: 'PreProcessor' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/PreProcess/Types.hs:69:21
Cabal>     * at src/Distribution/Simple/PreProcess/Types.hs:69:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/PreProcess/Types.hs:69:1
Cabal> Warning: 'Suffix' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/PreProcess/Types.hs:101:18
Cabal>     * at src/Distribution/Simple/PreProcess/Types.hs:101:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/PreProcess/Types.hs:101:1
Cabal>   40% (  9 / 22) in 'Distribution.Simple.PreProcess'
Cabal>   Missing documentation for:
Cabal>     builtinHaskellSuffixes (src/Distribution/Simple/PreProcess/Types.hs:111)
Cabal>     builtinHaskellBootSuffixes (src/Distribution/Simple/PreProcess/Types.hs:114)
Cabal>     mkSimplePreProcessor (src/Distribution/Simple/PreProcess.hs:109)
Cabal>     runSimplePreProcessor (src/Distribution/Simple/PreProcess.hs:124)
Cabal>     ppCpp (src/Distribution/Simple/PreProcess.hs:407)
Cabal>     ppCpp' (src/Distribution/Simple/PreProcess.hs:410)
Cabal>     ppGreenCard (src/Distribution/Simple/PreProcess.hs:382)
Cabal>     ppC2hs (src/Distribution/Simple/PreProcess.hs:651)
Cabal>     ppHsc2hs (src/Distribution/Simple/PreProcess.hs:476)
Cabal>     ppHappy (src/Distribution/Simple/PreProcess.hs:813)
Cabal>     ppAlex (src/Distribution/Simple/PreProcess.hs:822)
Cabal>     ppUnlit (src/Distribution/Simple/PreProcess.hs:397)
Cabal>     platformDefines (src/Distribution/Simple/PreProcess.hs:720)
Cabal> Warning: 'UserHooks' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/UserHooks.hs:53:18
Cabal>     * at src/Distribution/Simple/UserHooks.hs:53:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/UserHooks.hs:53:1
Cabal>   75% (  3 /  4) in 'Distribution.Simple.UserHooks'
Cabal>   Missing documentation for:
Cabal>     Args (src/Distribution/Simple/UserHooks.hs:45)
Cabal>  100% (  2 /  2) in 'Distribution.Simple.Bench'
Cabal> Warning: 'configure' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Configure.hs:415:1
Cabal>     * at src/Distribution/Simple/GHC.hs:155:1
Cabal>     * at src/Distribution/Simple/GHCJS.hs:117:1
Cabal>     * at src/Distribution/Simple/HaskellSuite.hs:36:1
Cabal>     * at src/Distribution/Simple/UHC.hs:64:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/UHC.hs:64:1
Cabal> Warning: 'BuildInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     * in ‘Distribution.Types.BuildInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.BuildInfo’
Cabal> Warning: 'LocalBuildInfo' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/LocalBuildInfo.hs:180:1
Cabal>     * at src/Distribution/Types/LocalBuildInfo.hs:129:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
Cabal> Warning: 'UserHooks' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'ConfigFlags' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Setup/Config.hs:78:20
Cabal>     * at src/Distribution/Simple/Setup/Config.hs:78:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Setup/Config.hs:78:1
Cabal> Warning: 'Compiler' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Compiler.hs:91:17
Cabal>     * at src/Distribution/Simple/Compiler.hs:91:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/Compiler.hs:91:1
Cabal> Warning: 'getInstalledPackages' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/Configure.hs:1866:1
Cabal>     * at src/Distribution/Simple/GHC.hs:409:1
Cabal>     * at src/Distribution/Simple/GHCJS.hs:329:1
Cabal>     * at src/Distribution/Simple/HaskellSuite.hs:135:1
Cabal>     * at src/Distribution/Simple/UHC.hs:118:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/UHC.hs:118:1
Cabal> Warning: 'InstalledPackageInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.InstalledPackageInfo’
Cabal>     * in ‘Distribution.Types.InstalledPackageInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.InstalledPackageInfo’
Cabal>   85% ( 23 / 27) in 'Distribution.Simple.Configure'
Cabal>   Missing documentation for:
Cabal>     configCompilerEx (src/Distribution/Simple/Configure.hs:2274)
Cabal>     configCompilerAuxEx (src/Distribution/Simple/Configure.hs:2258)
Cabal>     checkForeignDeps (src/Distribution/Simple/Configure.hs:2293)
Cabal>     platformDefines (src/Distribution/Simple/PreProcess.hs:720)
Cabal>  100% (  2 /  2) in 'Distribution.Simple.Test'
Cabal> Warning: 'die' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'PackageDescription' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     * in ‘Distribution.Types.PackageDescription’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.PackageDescription’
Cabal> Warning: 'errorPrefix' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>  100% ( 15 / 15) in 'Distribution.Simple.SrcDist'
Cabal> Warning: 'LocalBuildInfo' is ambiguous. It is defined
Cabal>     * at src/Distribution/Types/LocalBuildInfo.hs:180:1
Cabal>     * at src/Distribution/Types/LocalBuildInfo.hs:129:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Types/LocalBuildInfo.hs:129:1
Cabal> Warning: 'TestSuite' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.TestSuite’
Cabal>     * in ‘Distribution.Types.TestSuite’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.TestSuite’
Cabal> Warning: 'Benchmark' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.Benchmark’
Cabal>     * in ‘Distribution.Types.Benchmark’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.Benchmark’
Cabal> Warning: 'autogenComponentsModuleDir' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal>   88% ( 15 / 17) in 'Distribution.Simple.Build'
Cabal>   Missing documentation for:
Cabal>     repl (src/Distribution/Simple/Build.hs:278)
Cabal>     AutogenFile (src/Distribution/Simple/Build.hs:1078)
Cabal> Warning: 'haddocks' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'Haddock' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'HaddocksFlags' is out of scope.
Cabal>     If you qualify the identifier, haddock can try to link it anyway.
Cabal> Warning: 'InstalledPackageInfo' is ambiguous. It is defined
Cabal>     * in ‘Distribution.Types.InstalledPackageInfo’
Cabal>     * in ‘Distribution.Types.InstalledPackageInfo’
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined in ‘Distribution.Types.InstalledPackageInfo’
Cabal>   66% (  4 /  6) in 'Distribution.Simple.Haddock'
Cabal>   Missing documentation for:
Cabal>     haddock (src/Distribution/Simple/Haddock.hs:213)
Cabal>     hscolour (src/Distribution/Simple/Haddock.hs:1125)
Cabal> Warning: 'UserHooks' is ambiguous. It is defined
Cabal>     * at src/Distribution/Simple/UserHooks.hs:53:18
Cabal>     * at src/Distribution/Simple/UserHooks.hs:53:1
Cabal>     You may be able to disambiguate the identifier by qualifying it or
Cabal>     by specifying the type/value namespace explicitly.
Cabal>     Defaulting to the one defined at src/Distribution/Simple/UserHooks.hs:53:1
Cabal>   95% ( 20 / 21) in 'Distribution.Simple'
Cabal>   Missing documentation for:
Cabal>     Args (src/Distribution/Simple/UserHooks.hs:45)
Cabal> Warning: Distribution.Backpack.FullUnitId: could not find link destinations for:
Cabal>  - Distribution.Backpack.FullUnitId.Rep_FullUnitId
Cabal> Warning: Distribution.Backpack.ModuleShape: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Backpack.ModuleShape.Rep_ModuleShape
Cabal> Warning: Distribution.Backpack.PreModuleShape: could not find link destinations for:
Cabal>  - Distribution.Backpack.PreModuleShape.Rep_PreModuleShape
Cabal> Warning: Distribution.Compat.Stack: could not find link destinations for:
Cabal>  - GHC.IsList.D:R:ItemCallStack
Cabal> Warning: Distribution.ReadE: could not find link destinations for:
Cabal>  - Distribution.ReadE.ErrorMsg
Cabal> Warning: Distribution.Simple.Flag: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Simple.Flag.Rep_Flag
Cabal> Warning: Distribution.Simple.InstallDirs.Internal: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Simple.InstallDirs.Internal.Rep_PathComponent
Cabal>  - Distribution.Simple.InstallDirs.Internal.Rep_PathTemplateVariable
Cabal> Warning: Distribution.Simple.InstallDirs: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Simple.InstallDirs.Internal.Rep_PathTemplateVariable
Cabal>  - Distribution.Simple.InstallDirs.Rep_PathTemplate
Cabal>  - Distribution.Simple.InstallDirs.Rep_CopyDest
Cabal>  - Distribution.Simple.InstallDirs.Rep_InstallDirs
Cabal> Warning: Distribution.Types.ComponentLocalBuildInfo: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Types.ComponentLocalBuildInfo.D:R:KeyComponentLocalBuildInfo
Cabal>  - Distribution.Types.ComponentLocalBuildInfo.Rep_ComponentLocalBuildInfo
Cabal> Warning: Distribution.Types.DumpBuildInfo: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Types.DumpBuildInfo.Rep_DumpBuildInfo
Cabal> Warning: Distribution.Types.GivenComponent: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Types.GivenComponent.Rep_GivenComponent
Cabal> Warning: Distribution.Types.TargetInfo: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Types.TargetInfo.D:R:KeyTargetInfo
Cabal>  - Distribution.Types.TargetInfo.Rep_TargetInfo
Cabal> Warning: Distribution.Verbosity.Internal: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Verbosity.Internal.Rep_VerbosityFlag
Cabal>  - Distribution.Verbosity.Internal.Rep_VerbosityLevel
Cabal> Warning: Distribution.Verbosity: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Verbosity.Rep_Verbosity
Cabal> Warning: Distribution.Simple.Program.Types: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Simple.Program.Types.Rep_ConfiguredProgram
Cabal>  - Distribution.Simple.Program.Types.Rep_ProgramLocation
Cabal>  - Distribution.Simple.Program.Types.Rep_ProgramSearchPathEntry
Cabal> Warning: Distribution.Simple.PreProcess.Types: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Simple.PreProcess.Types.Rep_Suffix
Cabal> Warning: Distribution.Simple.Utils: could not find link destinations for:
Cabal>  - Distribution.Simple.Utils.withMetadata
Cabal> Warning: Distribution.Utils.NubList: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Utils.NubList.Rep_NubList
Cabal> Warning: Distribution.Utils.LogProgress: could not find link destinations for:
Cabal>  - Distribution.Utils.LogProgress.CtxMsg
Cabal> Warning: Distribution.Simple.Program.Find: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Simple.Program.Types.Rep_ProgramSearchPathEntry
Cabal>  - Distribution.Simple.Program.Find.findExecutable
Cabal> Warning: Distribution.Simple.PackageIndex: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Simple.PackageIndex.DepUniqueKey
Cabal>  - Distribution.Simple.PackageIndex.Rep_PackageIndex
Cabal> Warning: Distribution.Simple.Glob.Internal: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Simple.Glob.Internal.Rep_Glob
Cabal>  - Distribution.Simple.Glob.Internal.Rep_GlobPiece
Cabal> Warning: Distribution.Simple.Glob: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Simple.Glob.Internal.Rep_Glob
Cabal> Warning: Distribution.Simple.Compiler: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Simple.Compiler.Rep_ProfDetailLevel
Cabal>  - Distribution.Simple.Compiler.Rep_Compiler
Cabal>  - Distribution.Simple.Compiler.Rep_DebugInfoLevel
Cabal>  - Distribution.Simple.Compiler.Rep_OptimisationLevel
Cabal>  - Distribution.Simple.Compiler.Rep_PackageDB
Cabal> Warning: Distribution.Simple.Program.GHC: could not find link destinations for:
Cabal>  - Distribution.Simple.Program.GHC.Rep_GhcOptions
Cabal> Warning: Distribution.Simple.Program.Db: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal> Warning: Distribution.Simple.Program: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Simple.Program.Types.Rep_ConfiguredProgram
Cabal>  - Distribution.Simple.Program.Types.Rep_ProgramLocation
Cabal>  - Distribution.Simple.Program.Types.Rep_ProgramSearchPathEntry
Cabal> Warning: Distribution.Types.LocalBuildConfig: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Types.LocalBuildConfig.Rep_LocalBuildConfig
Cabal>  - Distribution.Types.LocalBuildConfig.Rep_BuildOptions
Cabal>  - Distribution.Types.LocalBuildConfig.Rep_LocalBuildDescr
Cabal>  - Distribution.Types.LocalBuildConfig.Rep_ComponentBuildDescr
Cabal>  - Distribution.Types.LocalBuildConfig.Rep_PackageBuildDescr
Cabal> Warning: Distribution.Types.LocalBuildInfo: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Types.LocalBuildInfo.Rep_LocalBuildInfo
Cabal> Warning: Distribution.Simple.LocalBuildInfo: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Types.LibraryName.Rep_LibraryName
Cabal>  - Distribution.Types.ComponentName.NotLibComponentName
Cabal>  - Distribution.Types.ComponentName.Rep_ComponentName
Cabal>  - Distribution.Simple.InstallDirs.Internal.Rep_PathTemplateVariable
Cabal>  - Distribution.Simple.InstallDirs.Rep_PathTemplate
Cabal>  - Distribution.Simple.InstallDirs.Rep_CopyDest
Cabal>  - Distribution.Simple.InstallDirs.Rep_InstallDirs
Cabal>  - Distribution.Types.ComponentLocalBuildInfo.D:R:KeyComponentLocalBuildInfo
Cabal>  - Distribution.Types.ComponentLocalBuildInfo.Rep_ComponentLocalBuildInfo
Cabal>  - Distribution.Types.Component.Rep_Component
Cabal>  - Distribution.Types.LocalBuildInfo.Rep_LocalBuildInfo
Cabal> Warning: Distribution.Simple.Setup: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Simple.Flag.Rep_Flag
Cabal>  - Distribution.Simple.InstallDirs.Rep_CopyDest
Cabal>  - Distribution.Types.DumpBuildInfo.Rep_DumpBuildInfo
Cabal>  - Distribution.Simple.Setup.Common.programDbPaths
Cabal>  - Distribution.Simple.Setup.Test.Rep_TestFlags
Cabal>  - Distribution.Simple.Setup.Test.Rep_TestShowDetails
Cabal>  - Distribution.Simple.Setup.SDist.Rep_SDistFlags
Cabal>  - Distribution.Simple.Setup.Repl.Rep_ReplFlags
Cabal>  - Distribution.Simple.Setup.Repl.Rep_ReplOptions
Cabal>  - Distribution.Simple.Setup.Register.Rep_RegisterFlags
Cabal>  - Distribution.Simple.Setup.Install.Rep_InstallFlags
Cabal>  - Distribution.Simple.Setup.Hscolour.Rep_HscolourFlags
Cabal>  - Distribution.Simple.Setup.Haddock.Rep_HaddockProjectFlags
Cabal>  - Distribution.Simple.Setup.Haddock.Rep_HaddockFlags
Cabal>  - Distribution.Simple.Setup.Haddock.Rep_HaddockTarget
Cabal>  - Distribution.Simple.Setup.Global.Rep_GlobalFlags
Cabal>  - Distribution.Simple.Setup.Copy.Rep_CopyFlags
Cabal>  - Distribution.Simple.Setup.Config.Rep_ConfigFlags
Cabal>  - Distribution.Simple.Setup.Clean.Rep_CleanFlags
Cabal>  - Distribution.Simple.Setup.Build.Rep_BuildFlags
Cabal>  - Distribution.Simple.Setup.Benchmark.Rep_BenchmarkFlags
Cabal>  - Distribution.Simple.Setup.Rep_BuildingWhat
Cabal> Warning: Distribution.Simple.Build.Inputs: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Types.TargetInfo.D:R:KeyTargetInfo
Cabal>  - Distribution.Types.TargetInfo.Rep_TargetInfo
Cabal>  - Distribution.Types.LocalBuildInfo.Rep_LocalBuildInfo
Cabal>  - Distribution.Simple.Setup.Rep_BuildingWhat
Cabal> Warning: Distribution.Simple.BuildTarget: could not find link destinations for:
Cabal>  - Distribution.Simple.BuildTarget.Rep_BuildTarget
Cabal> Warning: Distribution.PackageDescription.Check: could not find link destinations for:
Cabal>  - Distribution.PackageDescription.Check.Warning.WarnLang
Cabal>  - Distribution.PackageDescription.Check.Warning.CEType
Cabal> Warning: Distribution.Make: could not find link destinations for:
Cabal>  - Distribution.Types.InstalledPackageInfo.FieldGrammar.SpecLicenseLenient
Cabal>  - Distribution.Types.Version.Rep_Version
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.License.Rep_License
Cabal> Warning: Distribution.Compat.Time: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Compat.Time.Rep_ModTime
Cabal> Warning: Distribution.Backpack.Configure: could not find link destinations for:
Cabal>  - Distribution.Backpack.PreExistingComponent.PreExistingComponent
Cabal>  - Distribution.Backpack.PreExistingComponent.PromisedComponent
Cabal> Warning: Distribution.Simple.PreProcess: could not find link destinations for:
Cabal>  - Distribution.Utils.Structured.Tagged
Cabal>  - Distribution.Utils.Structured.structureHash'
Cabal>  - Distribution.Simple.PreProcess.Types.Rep_Suffix
Cabal> Documentation created: dist/doc/html/Cabal/, dist/doc/html/Cabal/Cabal.txt
Cabal> Running phase: installPhase
Cabal> Installing library in /nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q
Cabal> Running phase: fixupPhase
Cabal> shrinking RPATHs of ELF executables and libraries in /nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0
Cabal> shrinking /nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSCabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q-ghc9.8.1.so
Cabal> checking for references to /build/ in /nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0...
Cabal> patching script interpreter paths in /nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0
Cabal> stripping (with command strip and flags -S -p) in  /nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0/lib
Cabal> shrinking RPATHs of ELF executables and libraries in /nix/store/1v91j694fgvsssbz7lg6wgmrz6mpmvx6-Cabal-3.12.1.0-doc
Cabal> checking for references to /build/ in /nix/store/1v91j694fgvsssbz7lg6wgmrz6mpmvx6-Cabal-3.12.1.0-doc...
Cabal> patching script interpreter paths in /nix/store/1v91j694fgvsssbz7lg6wgmrz6mpmvx6-Cabal-3.12.1.0-doc
Cabal (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/1v91j694fgvsssbz7lg6wgmrz6mpmvx6-Cabal-3.12.1.0-doc /nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0
Cabal (post)> Pushing 2 paths (68 are already present) using zstd to cache sellout ⏳
Cabal (post)> 
Cabal (post)> Pushing /nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0 (122.62 MiB)
Cabal (post)> Pushing /nix/store/1v91j694fgvsssbz7lg6wgmrz6mpmvx6-Cabal-3.12.1.0-doc (34.02 MiB)
Cabal (post)> 
Cabal (post)> All done.
Cabal (post)> added 2 signatures
Cabal (post)> added 1 signatures
Cabal (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/1v91j694fgvsssbz7lg6wgmrz6mpmvx6-Cabal-3.12.1.0-doc /nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0
Cabal (post)> copying 2 paths...
Cabal (post)> copying path '/nix/store/1v91j694fgvsssbz7lg6wgmrz6mpmvx6-Cabal-3.12.1.0-doc' to 'https://cache.nix-ci.com'...
Cabal (post)> copying path '/nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0' to 'https://cache.nix-ci.com'...
Cabal (post)> copying 1 paths...
Cabal (post)> copying path '/nix/store/f4bz5nlf69zgfxikc7w98m13q3ysmw66-Cabal-3.12.1.0.drv' to 'https://cache.nix-ci.com'...
Cabal (post)> added 0 signatures
Cabal (post)> added 0 signatures
Cabal (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/1v91j694fgvsssbz7lg6wgmrz6mpmvx6-Cabal-3.12.1.0-doc /nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0
Cabal (post)> copying 2 paths...
Cabal (post)> copying path '/nix/store/1v91j694fgvsssbz7lg6wgmrz6mpmvx6-Cabal-3.12.1.0-doc' to 'ssh-ng://worker.nix-ci.com'...
Cabal (post)> copying path '/nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0' to 'ssh-ng://worker.nix-ci.com'...
Cabal (post)> copying 1 paths...
Cabal (post)> copying path '/nix/store/f4bz5nlf69zgfxikc7w98m13q3ysmw66-Cabal-3.12.1.0.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/lfh0jnlpg0pcc0148b781bizlqm7s68m-cabal-doctest-1.0.11.drv'...
building '/nix/store/yzvldx7zq7xlxqcbswr3f2208k08raiy-ghc-paths-0.1.0.12.drv'...
cabal-doctest> Running phase: setupCompilerEnvironmentPhase
cabal-doctest> Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
ghc-paths> Running phase: setupCompilerEnvironmentPhase
ghc-paths> Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
cabal-doctest> Running phase: unpackPhase
cabal-doctest> unpacking source archive /nix/store/8ic4r88607c95vfk7d2idwr4rh3qz6cd-cabal-doctest-1.0.11.tar.gz
cabal-doctest> source root is cabal-doctest-1.0.11
cabal-doctest> setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "cabal-doctest-1.0.11/src/Distribution/Extra/Doctest.hs"
cabal-doctest> Running phase: patchPhase
cabal-doctest> Running phase: compileBuildDriverPhase
cabal-doctest> setupCompileFlags: -package-db=/build/tmp.enX3TPVKSf/setup-package.conf.d -threaded
cabal-doctest> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.enX3TPVKSf/Main.o )
ghc-paths> Running phase: unpackPhase
ghc-paths> unpacking source archive /nix/store/jbdk3r2ic959xyc0394gn6n61wgjf6n0-ghc-paths-0.1.0.12.tar.gz
ghc-paths> source root is ghc-paths-0.1.0.12
ghc-paths> setting SOURCE_DATE_EPOCH to timestamp 1566388706 of file "ghc-paths-0.1.0.12/Setup.hs"
ghc-paths> Running phase: patchPhase
ghc-paths> Replace Cabal file with edited version from mirror://hackage/ghc-paths-0.1.0.12/revision/7.cabal.
ghc-paths> applying patch /nix/store/57w4xa43g7ilkdjd7mplrn8l3pvmyklf-ghc-paths-nix.patch
ghc-paths> patching file GHC/Paths.hs
ghc-paths> Running phase: compileBuildDriverPhase
ghc-paths> setupCompileFlags: -package-db=/build/tmp.rHWvg7XRqQ/setup-package.conf.d -threaded
cabal-doctest> [2 of 2] Linking Setup
ghc-paths> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.rHWvg7XRqQ/Main.o )
ghc-paths> [2 of 2] Linking Setup
cabal-doctest> Running phase: updateAutotoolsGnuConfigScriptsPhase
cabal-doctest> Running phase: configurePhase
cabal-doctest> configureFlags: --verbose --prefix=/nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/xxac1yndirf4njn8f7wk9gcqj4imx596-cabal-doctest-1.0.11-doc/share/doc/cabal-doctest-1.0.11 --with-gcc=gcc --package-db=/build/tmp.enX3TPVKSf/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
cabal-doctest> Using Parsec parser
cabal-doctest> Configuring cabal-doctest-1.0.11...
cabal-doctest> Dependency Cabal >=1.24 && <3.16: using Cabal-3.12.1.0
cabal-doctest> Dependency base >=4.9 && <5: using base-4.19.0.0
cabal-doctest> Dependency directory >=1.3 && <2: using directory-1.3.8.1
cabal-doctest> Dependency filepath >=1.4 && <2: using filepath-1.4.100.4
ghc-paths> Running phase: updateAutotoolsGnuConfigScriptsPhase
ghc-paths> Running phase: configurePhase
ghc-paths> configureFlags: --verbose --prefix=/nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/4mymw7yy867mvlf8kl6jmhbr3m3gn8fi-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12 --with-gcc=gcc --package-db=/build/tmp.rHWvg7XRqQ/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
ghc-paths> Using Parsec parser
ghc-paths> Configuring ghc-paths-0.1.0.12...
cabal-doctest> Source component graph: component lib
cabal-doctest> Configured component graph:
cabal-doctest>     component cabal-doctest-1.0.11-G67vogFamQOLj87ZE4PFKP
cabal-doctest>         include Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q
cabal-doctest>         include base-4.19.0.0-b960
cabal-doctest>         include directory-1.3.8.1-6a8e
cabal-doctest>         include filepath-1.4.100.4-fa1c
cabal-doctest> Linked component graph:
cabal-doctest>     unit cabal-doctest-1.0.11-G67vogFamQOLj87ZE4PFKP
cabal-doctest>         include Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q
cabal-doctest>         include base-4.19.0.0-b960
cabal-doctest>         include directory-1.3.8.1-6a8e
cabal-doctest>         include filepath-1.4.100.4-fa1c
cabal-doctest>         Distribution.Extra.Doctest=cabal-doctest-1.0.11-G67vogFamQOLj87ZE4PFKP:Distribution.Extra.Doctest
cabal-doctest> Ready component graph:
cabal-doctest>     definite cabal-doctest-1.0.11-G67vogFamQOLj87ZE4PFKP
cabal-doctest>         depends Cabal-3.12.1.0-EByi5eKdcCFCx80BpFFA3Q
cabal-doctest>         depends base-4.19.0.0-b960
cabal-doctest>         depends directory-1.3.8.1-6a8e
cabal-doctest>         depends filepath-1.4.100.4-fa1c
cabal-doctest> Using Cabal-3.10.2.0 compiled by ghc-9.8
cabal-doctest> Using compiler: ghc-9.8.1
cabal-doctest> Using install prefix:
cabal-doctest> /nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11
cabal-doctest> Executables installed in:
cabal-doctest> /nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11/bin
cabal-doctest> Libraries installed in:
cabal-doctest> /nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/cabal-doctest-1.0.11-G67vogFamQOLj87ZE4PFKP
cabal-doctest> Dynamic Libraries installed in:
cabal-doctest> /nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
cabal-doctest> Private executables installed in:
cabal-doctest> /nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11/libexec/x86_64-linux-ghc-9.8.1/cabal-doctest-1.0.11
cabal-doctest> Data files installed in:
cabal-doctest> /nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11/share/x86_64-linux-ghc-9.8.1/cabal-doctest-1.0.11
cabal-doctest> Documentation installed in:
cabal-doctest> /nix/store/xxac1yndirf4njn8f7wk9gcqj4imx596-cabal-doctest-1.0.11-doc/share/doc/cabal-doctest-1.0.11
cabal-doctest> Configuration files installed in:
cabal-doctest> /nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11/etc
cabal-doctest> No alex found
cabal-doctest> Using ar found on system at:
cabal-doctest> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
cabal-doctest> No c2hs found
cabal-doctest> No cpphs found
cabal-doctest> No doctest found
cabal-doctest> Using gcc version 14.3.0 given by user at:
cabal-doctest> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
cabal-doctest> Using ghc version 9.8.1 found on system at:
cabal-doctest> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
cabal-doctest> Using ghc-pkg version 9.8.1 found on system at:
cabal-doctest> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
cabal-doctest> No ghcjs found
cabal-doctest> No ghcjs-pkg found
cabal-doctest> No greencard found
cabal-doctest> Using haddock version 2.30.0 found on system at:
cabal-doctest> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
cabal-doctest> No happy found
cabal-doctest> Using haskell-suite found on system at: haskell-suite-dummy-location
cabal-doctest> Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
cabal-doctest> No hmake found
cabal-doctest> Using hpc version 0.69 found on system at:
cabal-doctest> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
cabal-doctest> Using hsc2hs version 0.68.10 found on system at:
cabal-doctest> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
cabal-doctest> Using hscolour version 1.25 found on system at:
cabal-doctest> /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
cabal-doctest> No jhc found
cabal-doctest> Using ld found on system at:
cabal-doctest> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
cabal-doctest> No pkg-config found
cabal-doctest> Using runghc version 9.8.1 found on system at:
cabal-doctest> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
cabal-doctest> Using strip version 2.44 found on system at:
cabal-doctest> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
cabal-doctest> Using tar found on system at:
cabal-doctest> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
cabal-doctest> No uhc found
cabal-doctest> Running phase: buildPhase
cabal-doctest> Preprocessing library for cabal-doctest-1.0.11..
cabal-doctest> Building library for cabal-doctest-1.0.11..
cabal-doctest> [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.o, dist/build/Distribution/Extra/Doctest.dyn_o )
ghc-paths> Dependency base >=3 && <5: using base-4.19.0.0
ghc-paths> Source component graph: component lib
ghc-paths> Configured component graph:
ghc-paths>     component ghc-paths-0.1.0.12-EgeSPqFAJlEIw13cE7FBLC
ghc-paths>         include base-4.19.0.0-b960
ghc-paths> Linked component graph:
ghc-paths>     unit ghc-paths-0.1.0.12-EgeSPqFAJlEIw13cE7FBLC
ghc-paths>         include base-4.19.0.0-b960
ghc-paths>         GHC.Paths=ghc-paths-0.1.0.12-EgeSPqFAJlEIw13cE7FBLC:GHC.Paths
ghc-paths> Ready component graph:
ghc-paths>     definite ghc-paths-0.1.0.12-EgeSPqFAJlEIw13cE7FBLC
ghc-paths>         depends base-4.19.0.0-b960
ghc-paths> Using Cabal-3.12.1.0 compiled by ghc-9.8
ghc-paths> Using compiler: ghc-9.8.1
ghc-paths> Using install prefix:
ghc-paths> /nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12
ghc-paths> Executables installed in:
ghc-paths> /nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12/bin
ghc-paths> Libraries installed in:
ghc-paths> /nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/ghc-paths-0.1.0.12-EgeSPqFAJlEIw13cE7FBLC
ghc-paths> Dynamic Libraries installed in:
ghc-paths> /nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9
ghc-paths> Private executables installed in:
ghc-paths> /nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12/libexec/x86_64-linux-ghc-9.8.1-f1e9/ghc-paths-0.1.0.12
ghc-paths> Data files installed in:
ghc-paths> /nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12/share/x86_64-linux-ghc-9.8.1-f1e9/ghc-paths-0.1.0.12
ghc-paths> Documentation installed in:
ghc-paths> /nix/store/4mymw7yy867mvlf8kl6jmhbr3m3gn8fi-ghc-paths-0.1.0.12-doc/share/doc/ghc-paths-0.1.0.12
ghc-paths> Configuration files installed in:
ghc-paths> /nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12/etc
ghc-paths> No alex found
ghc-paths> Using ar found on system at:
ghc-paths> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
ghc-paths> No c2hs found
ghc-paths> No cpphs found
ghc-paths> No doctest found
ghc-paths> Using gcc version 14.3.0 given by user at:
ghc-paths> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
ghc-paths> Using ghc version 9.8.1 found on system at:
ghc-paths> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
ghc-paths> Using ghc-pkg version 9.8.1 found on system at:
ghc-paths> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
ghc-paths> No ghcjs found
ghc-paths> No ghcjs-pkg found
ghc-paths> No greencard found
ghc-paths> Using haddock version 2.30.0 found on system at:
ghc-paths> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
ghc-paths> No happy found
ghc-paths> Using haskell-suite found on system at: haskell-suite-dummy-location
ghc-paths> Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
ghc-paths> No hmake found
ghc-paths> Using hpc version 0.69 found on system at:
ghc-paths> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
ghc-paths> Using hsc2hs version 0.68.10 found on system at:
ghc-paths> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
ghc-paths> Using hscolour version 1.25 found on system at:
ghc-paths> /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
ghc-paths> No jhc found
ghc-paths> Using ld found on system at:
ghc-paths> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
ghc-paths> No pkg-config found
ghc-paths> Using runghc version 9.8.1 found on system at:
ghc-paths> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
ghc-paths> Using strip version 2.44 found on system at:
ghc-paths> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
ghc-paths> Using tar found on system at:
ghc-paths> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
ghc-paths> No uhc found
ghc-paths> Running: /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc --print-libdir -j16 '+RTS' -A64M -RTS -haddock
ghc-paths> Running phase: buildPhase
ghc-paths> Preprocessing library for ghc-paths-0.1.0.12...
ghc-paths> Building library for ghc-paths-0.1.0.12...
ghc-paths> [1 of 1] Compiling GHC.Paths        ( GHC/Paths.hs, dist/build/GHC/Paths.o, dist/build/GHC/Paths.dyn_o )
ghc-paths> [1 of 1] Compiling GHC.Paths        ( GHC/Paths.hs, dist/build/GHC/Paths.p_o )
ghc-paths> Running phase: checkPhase
ghc-paths> Package has no test suites.
ghc-paths> Running phase: haddockPhase
ghc-paths> Preprocessing library for ghc-paths-0.1.0.12...
ghc-paths> Running Haddock on library for ghc-paths-0.1.0.12...
cabal-doctest> [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, dist/build/Distribution/Extra/Doctest.p_o )
ghc-paths> [1 of 1] Compiling GHC.Paths        ( GHC/Paths.hs, nothing )
ghc-paths> Haddock coverage:
ghc-paths>    0% (  0 /  5) in 'GHC.Paths'
ghc-paths>   Missing documentation for:
ghc-paths>     Module header
ghc-paths>     ghc (GHC/Paths.hs:34)
ghc-paths>     ghc_pkg (GHC/Paths.hs:35)
ghc-paths>     libdir (GHC/Paths.hs:31)
ghc-paths>     docdir (GHC/Paths.hs:32)
ghc-paths> Documentation created: dist/doc/html/ghc-paths/,
ghc-paths> dist/doc/html/ghc-paths/ghc-paths.txt
ghc-paths> Running phase: installPhase
ghc-paths> Installing library in /nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/ghc-paths-0.1.0.12-EgeSPqFAJlEIw13cE7FBLC
ghc-paths> Running phase: fixupPhase
ghc-paths> shrinking RPATHs of ELF executables and libraries in /nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12
ghc-paths> shrinking /nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/libHSghc-paths-0.1.0.12-EgeSPqFAJlEIw13cE7FBLC-ghc9.8.1.so
ghc-paths> checking for references to /build/ in /nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12...
ghc-paths> patching script interpreter paths in /nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12
ghc-paths> stripping (with command strip and flags -S -p) in  /nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12/lib
ghc-paths> shrinking RPATHs of ELF executables and libraries in /nix/store/4mymw7yy867mvlf8kl6jmhbr3m3gn8fi-ghc-paths-0.1.0.12-doc
ghc-paths> checking for references to /build/ in /nix/store/4mymw7yy867mvlf8kl6jmhbr3m3gn8fi-ghc-paths-0.1.0.12-doc...
ghc-paths> patching script interpreter paths in /nix/store/4mymw7yy867mvlf8kl6jmhbr3m3gn8fi-ghc-paths-0.1.0.12-doc
ghc-paths (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12 /nix/store/4mymw7yy867mvlf8kl6jmhbr3m3gn8fi-ghc-paths-0.1.0.12-doc
ghc-paths (post)> Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
ghc-paths (post)> 
ghc-paths (post)> Pushing /nix/store/4mymw7yy867mvlf8kl6jmhbr3m3gn8fi-ghc-paths-0.1.0.12-doc (121.09 KiB)
ghc-paths (post)> Pushing /nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12 (101.07 KiB)
ghc-paths (post)> 
ghc-paths (post)> All done.
ghc-paths (post)> added 2 signatures
ghc-paths (post)> added 1 signatures
ghc-paths (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12 /nix/store/4mymw7yy867mvlf8kl6jmhbr3m3gn8fi-ghc-paths-0.1.0.12-doc
ghc-paths (post)> copying 2 paths...
ghc-paths (post)> copying path '/nix/store/4mymw7yy867mvlf8kl6jmhbr3m3gn8fi-ghc-paths-0.1.0.12-doc' to 'https://cache.nix-ci.com'...
ghc-paths (post)> copying path '/nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12' to 'https://cache.nix-ci.com'...
ghc-paths (post)> copying 1 paths...
ghc-paths (post)> copying path '/nix/store/yzvldx7zq7xlxqcbswr3f2208k08raiy-ghc-paths-0.1.0.12.drv' to 'https://cache.nix-ci.com'...
ghc-paths (post)> added 0 signatures
ghc-paths (post)> added 0 signatures
ghc-paths (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12 /nix/store/4mymw7yy867mvlf8kl6jmhbr3m3gn8fi-ghc-paths-0.1.0.12-doc
ghc-paths (post)> copying 2 paths...
ghc-paths (post)> copying path '/nix/store/4mymw7yy867mvlf8kl6jmhbr3m3gn8fi-ghc-paths-0.1.0.12-doc' to 'ssh-ng://worker.nix-ci.com'...
ghc-paths (post)> copying path '/nix/store/0229yq2agiyyhl4kx7n5cpnfng85a5ns-ghc-paths-0.1.0.12' to 'ssh-ng://worker.nix-ci.com'...
ghc-paths (post)> copying 1 paths...
ghc-paths (post)> copying path '/nix/store/yzvldx7zq7xlxqcbswr3f2208k08raiy-ghc-paths-0.1.0.12.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/989y2cvpp3g59xj466p6na2advd2r3jb-doctest-0.22.6.drv'...
cabal-doctest> Running phase: checkPhase
cabal-doctest> Package has no test suites.
cabal-doctest> Running phase: haddockPhase
cabal-doctest> Preprocessing library for cabal-doctest-1.0.11..
cabal-doctest> Running Haddock on library for cabal-doctest-1.0.11..
cabal-doctest> Warning: --source-* options are ignored when --hyperlinked-source is enabled.
cabal-doctest> [1 of 1] Compiling Distribution.Extra.Doctest ( src/Distribution/Extra/Doctest.hs, nothing )
cabal-doctest> Haddock coverage:
cabal-doctest> Warning: 'UserHooks' is ambiguous. It is defined
cabal-doctest>     * in ‘Distribution.Simple.UserHooks’
cabal-doctest>     * in ‘Distribution.Simple.UserHooks’
cabal-doctest>     You may be able to disambiguate the identifier by qualifying it or
cabal-doctest>     by specifying the type/value namespace explicitly.
cabal-doctest>     Defaulting to the one defined in ‘Distribution.Simple.UserHooks’
cabal-doctest>  100% (  6 /  6) in 'Distribution.Extra.Doctest'
cabal-doctest> Documentation created: dist/doc/html/cabal-doctest/,
cabal-doctest> dist/doc/html/cabal-doctest/cabal-doctest.txt
cabal-doctest> Running phase: installPhase
cabal-doctest> Installing library in /nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/cabal-doctest-1.0.11-G67vogFamQOLj87ZE4PFKP
cabal-doctest> Running phase: fixupPhase
cabal-doctest> shrinking RPATHs of ELF executables and libraries in /nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11
cabal-doctest> shrinking /nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHScabal-doctest-1.0.11-G67vogFamQOLj87ZE4PFKP-ghc9.8.1.so
cabal-doctest> checking for references to /build/ in /nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11...
cabal-doctest> patching script interpreter paths in /nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11
cabal-doctest> stripping (with command strip and flags -S -p) in  /nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11/lib
cabal-doctest> shrinking RPATHs of ELF executables and libraries in /nix/store/xxac1yndirf4njn8f7wk9gcqj4imx596-cabal-doctest-1.0.11-doc
cabal-doctest> checking for references to /build/ in /nix/store/xxac1yndirf4njn8f7wk9gcqj4imx596-cabal-doctest-1.0.11-doc...
cabal-doctest> patching script interpreter paths in /nix/store/xxac1yndirf4njn8f7wk9gcqj4imx596-cabal-doctest-1.0.11-doc
cabal-doctest (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11 /nix/store/xxac1yndirf4njn8f7wk9gcqj4imx596-cabal-doctest-1.0.11-doc
cabal-doctest (post)> Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
cabal-doctest (post)> 
cabal-doctest (post)> Pushing /nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11 (788.95 KiB)
cabal-doctest (post)> Pushing /nix/store/xxac1yndirf4njn8f7wk9gcqj4imx596-cabal-doctest-1.0.11-doc (385.12 KiB)
cabal-doctest (post)> 
cabal-doctest (post)> All done.
cabal-doctest (post)> added 2 signatures
cabal-doctest (post)> added 1 signatures
cabal-doctest (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11 /nix/store/xxac1yndirf4njn8f7wk9gcqj4imx596-cabal-doctest-1.0.11-doc
cabal-doctest (post)> copying 2 paths...
cabal-doctest (post)> copying path '/nix/store/xxac1yndirf4njn8f7wk9gcqj4imx596-cabal-doctest-1.0.11-doc' to 'https://cache.nix-ci.com'...
cabal-doctest (post)> copying path '/nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11' to 'https://cache.nix-ci.com'...
cabal-doctest (post)> copying 1 paths...
cabal-doctest (post)> copying path '/nix/store/lfh0jnlpg0pcc0148b781bizlqm7s68m-cabal-doctest-1.0.11.drv' to 'https://cache.nix-ci.com'...
cabal-doctest (post)> added 0 signatures
cabal-doctest (post)> added 0 signatures
cabal-doctest (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11 /nix/store/xxac1yndirf4njn8f7wk9gcqj4imx596-cabal-doctest-1.0.11-doc
cabal-doctest (post)> copying 2 paths...
cabal-doctest (post)> copying path '/nix/store/xxac1yndirf4njn8f7wk9gcqj4imx596-cabal-doctest-1.0.11-doc' to 'ssh-ng://worker.nix-ci.com'...
cabal-doctest (post)> copying path '/nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11' to 'ssh-ng://worker.nix-ci.com'...
cabal-doctest (post)> copying 1 paths...
cabal-doctest (post)> copying path '/nix/store/lfh0jnlpg0pcc0148b781bizlqm7s68m-cabal-doctest-1.0.11.drv' to 'ssh-ng://worker.nix-ci.com'...
doctest> Running phase: setupCompilerEnvironmentPhase
doctest> Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
doctest> Running phase: unpackPhase
doctest> unpacking source archive /nix/store/mk30nc4vbm3vmsbjqpy8zxvmg7i4j2bx-doctest-0.22.6.tar.gz
doctest> source root is doctest-0.22.6
doctest> setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "doctest-0.22.6/test/UtilSpec.hs"
doctest> Running phase: patchPhase
doctest> applying patch /nix/store/q6x451lgsrmarzh4grswgr3s1j4iqadx-doctest-0.23.0-ghc-9.12.patch
doctest> patching file test/Language/Haskell/GhciWrapperSpec.hs
doctest> Running phase: compileBuildDriverPhase
doctest> setupCompileFlags: -package-db=/build/tmp.LEtKh8UCOx/setup-package.conf.d -threaded
doctest> [1 of 2] Compiling Main             ( Setup.lhs, /build/tmp.LEtKh8UCOx/Main.o )
doctest> [2 of 2] Linking Setup
doctest> Running phase: updateAutotoolsGnuConfigScriptsPhase
doctest> Running phase: configurePhase
doctest> configureFlags: --verbose --prefix=/nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/hzxpfhd0aslbal62bficzkcka2rfqzyf-doctest-0.22.6-doc/share/doc/doctest-0.22.6 --with-gcc=gcc --package-db=/build/tmp.LEtKh8UCOx/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/lib
doctest> Using Parsec parser
doctest> Configuring doctest-0.22.6...
doctest> Flags chosen: cabal-doctest=False
doctest> Dependency base >=4.7 && <5: using base-4.19.0.0
doctest> Dependency code-page >=0.1: using code-page-0.2.1
doctest> Dependency containers: using containers-0.6.8
doctest> Dependency deepseq: using deepseq-1.5.0.0
doctest> Dependency directory: using directory-1.3.8.1
doctest> Dependency exceptions: using exceptions-0.10.7
doctest> Dependency filepath: using filepath-1.4.100.4
doctest> Dependency ghc >=8.0 && <9.12: using ghc-9.8.1
doctest> Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
doctest> Dependency process: using process-1.6.18.0
doctest> Dependency syb >=0.3: using syb-0.7.2.4
doctest> Dependency transformers: using transformers-0.6.1.0
doctest> Dependency base >=4.7 && <5: using base-4.19.0.0
doctest> Dependency doctest: using doctest-0.22.6
doctest> Dependency HUnit: using HUnit-1.6.2.0
doctest> Dependency QuickCheck >=2.13.1: using QuickCheck-2.14.3
doctest> Dependency base >=4.7 && <5: using base-4.19.0.0
doctest> Dependency code-page >=0.1: using code-page-0.2.1
doctest> Dependency containers: using containers-0.6.8
doctest> Dependency deepseq: using deepseq-1.5.0.0
doctest> Dependency directory: using directory-1.3.8.1
doctest> Dependency exceptions: using exceptions-0.10.7
doctest> Dependency filepath: using filepath-1.4.100.4
doctest> Dependency ghc >=8.0 && <9.12: using ghc-9.8.1
doctest> Dependency ghc-paths >=0.1.0.9: using ghc-paths-0.1.0.12
doctest> Dependency hspec >=2.3.0: using hspec-2.11.12
doctest> Dependency hspec-core >=2.3.0: using hspec-core-2.11.12
doctest> Dependency mockery: using mockery-0.3.5
doctest> Dependency process: using process-1.6.18.0
doctest> Dependency silently >=1.2.4: using silently-1.2.5.4
doctest> Dependency stringbuilder >=0.4: using stringbuilder-0.5.1
doctest> Dependency syb >=0.3: using syb-0.7.2.4
doctest> Dependency transformers: using transformers-0.6.1.0
doctest> Source component graph:
doctest>     component test:spec
doctest>     component lib
doctest>     component exe:doctest dependency lib
doctest> Configured component graph:
doctest>     component doctest-0.22.6-DRoscKXGyxNJvgeTr1ykvB-spec
doctest>         include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
doctest>         include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
doctest>         include base-4.19.0.0-b960
doctest>         include code-page-0.2.1-79IhzHzv7QBJA53emToc6w
doctest>         include containers-0.6.8-4775
doctest>         include deepseq-1.5.0.0-412f
doctest>         include directory-1.3.8.1-6a8e
doctest>         include exceptions-0.10.7-d3e7
doctest>         include filepath-1.4.100.4-fa1c
doctest>         include ghc-9.8.1-f1e9
doctest>         include ghc-paths-0.1.0.12-EgeSPqFAJlEIw13cE7FBLC
doctest>         include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
doctest>         include hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY
doctest>         include mockery-0.3.5-4qyB3oSxfvpsfmSEuu4EC
doctest>         include process-1.6.18.0-26fa
doctest>         include silently-1.2.5.4-rAp7M7uqAhBpWTxTpNXNT
doctest>         include stringbuilder-0.5.1-KxJjrcRVz19Fte3egf60Hq
doctest>         include syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
doctest>         include transformers-0.6.1.0-c3ec
doctest>     component doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
doctest>         include base-4.19.0.0-b960
doctest>         include code-page-0.2.1-79IhzHzv7QBJA53emToc6w
doctest>         include containers-0.6.8-4775
doctest>         include deepseq-1.5.0.0-412f
doctest>         include directory-1.3.8.1-6a8e
doctest>         include exceptions-0.10.7-d3e7
doctest>         include filepath-1.4.100.4-fa1c
doctest>         include ghc-9.8.1-f1e9
doctest>         include ghc-paths-0.1.0.12-EgeSPqFAJlEIw13cE7FBLC
doctest>         include process-1.6.18.0-26fa
doctest>         include syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
doctest>         include transformers-0.6.1.0-c3ec
doctest>     component doctest-0.22.6-Fewry3Eaz407FxNGuiXANM-doctest
doctest>         include base-4.19.0.0-b960
doctest>         include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
doctest> Linked component graph:
doctest>     unit doctest-0.22.6-DRoscKXGyxNJvgeTr1ykvB-spec
doctest>         include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
doctest>         include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
doctest>         include base-4.19.0.0-b960
doctest>         include code-page-0.2.1-79IhzHzv7QBJA53emToc6w
doctest>         include containers-0.6.8-4775
doctest>         include deepseq-1.5.0.0-412f
doctest>         include directory-1.3.8.1-6a8e
doctest>         include exceptions-0.10.7-d3e7
doctest>         include filepath-1.4.100.4-fa1c
doctest>         include ghc-9.8.1-f1e9
doctest>         include ghc-paths-0.1.0.12-EgeSPqFAJlEIw13cE7FBLC
doctest>         include hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
doctest>         include hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY
doctest>         include mockery-0.3.5-4qyB3oSxfvpsfmSEuu4EC
doctest>         include process-1.6.18.0-26fa
doctest>         include silently-1.2.5.4-rAp7M7uqAhBpWTxTpNXNT
doctest>         include stringbuilder-0.5.1-KxJjrcRVz19Fte3egf60Hq
doctest>         include syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
doctest>         include transformers-0.6.1.0-c3ec
doctest>     unit doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
doctest>         include base-4.19.0.0-b960
doctest>         include code-page-0.2.1-79IhzHzv7QBJA53emToc6w
doctest>         include containers-0.6.8-4775
doctest>         include deepseq-1.5.0.0-412f
doctest>         include directory-1.3.8.1-6a8e
doctest>         include exceptions-0.10.7-d3e7
doctest>         include filepath-1.4.100.4-fa1c
doctest>         include ghc-9.8.1-f1e9
doctest>         include ghc-paths-0.1.0.12-EgeSPqFAJlEIw13cE7FBLC
doctest>         include process-1.6.18.0-26fa
doctest>         include syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
doctest>         include transformers-0.6.1.0-c3ec
doctest>         Test.DocTest=doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz:Test.DocTest,Test.DocTest.Internal.Cabal=doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz:Test.DocTest.Internal.Cabal,Test.DocTest.Internal.Extract=doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz:Test.DocTest.Internal.Extract,Test.DocTest.Internal.Location=doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz:Test.DocTest.Internal.Location,Test.DocTest.Internal.Parse=doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz:Test.DocTest.Internal.Parse,Test.DocTest.Internal.Run=doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz:Test.DocTest.Internal.Run
doctest>     unit doctest-0.22.6-Fewry3Eaz407FxNGuiXANM-doctest
doctest>         include base-4.19.0.0-b960
doctest>         include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
doctest> Ready component graph:
doctest>     definite doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
doctest>         depends base-4.19.0.0-b960
doctest>         depends code-page-0.2.1-79IhzHzv7QBJA53emToc6w
doctest>         depends containers-0.6.8-4775
doctest>         depends deepseq-1.5.0.0-412f
doctest>         depends directory-1.3.8.1-6a8e
doctest>         depends exceptions-0.10.7-d3e7
doctest>         depends filepath-1.4.100.4-fa1c
doctest>         depends ghc-9.8.1-f1e9
doctest>         depends ghc-paths-0.1.0.12-EgeSPqFAJlEIw13cE7FBLC
doctest>         depends process-1.6.18.0-26fa
doctest>         depends syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
doctest>         depends transformers-0.6.1.0-c3ec
doctest>     definite doctest-0.22.6-Fewry3Eaz407FxNGuiXANM-doctest
doctest>         depends base-4.19.0.0-b960
doctest>         depends doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
doctest>     definite doctest-0.22.6-DRoscKXGyxNJvgeTr1ykvB-spec
doctest>         depends HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
doctest>         depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
doctest>         depends base-4.19.0.0-b960
doctest>         depends code-page-0.2.1-79IhzHzv7QBJA53emToc6w
doctest>         depends containers-0.6.8-4775
doctest>         depends deepseq-1.5.0.0-412f
doctest>         depends directory-1.3.8.1-6a8e
doctest>         depends exceptions-0.10.7-d3e7
doctest>         depends filepath-1.4.100.4-fa1c
doctest>         depends ghc-9.8.1-f1e9
doctest>         depends ghc-paths-0.1.0.12-EgeSPqFAJlEIw13cE7FBLC
doctest>         depends hspec-2.11.12-3eKBTF5SgR31rwnPHV9GfH
doctest>         depends hspec-core-2.11.12-39AL3IYzsBd4t4draAjgjY
doctest>         depends mockery-0.3.5-4qyB3oSxfvpsfmSEuu4EC
doctest>         depends process-1.6.18.0-26fa
doctest>         depends silently-1.2.5.4-rAp7M7uqAhBpWTxTpNXNT
doctest>         depends stringbuilder-0.5.1-KxJjrcRVz19Fte3egf60Hq
doctest>         depends syb-0.7.2.4-5y0fSanOiLQzm0Y7MFmYI
doctest>         depends transformers-0.6.1.0-c3ec
doctest> Using Cabal-3.10.2.0 compiled by ghc-9.8
doctest> Using compiler: ghc-9.8.1
doctest> Using install prefix:
doctest> /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6
doctest> Executables installed in:
doctest> /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6/bin
doctest> Libraries installed in:
doctest> /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
doctest> Dynamic Libraries installed in:
doctest> /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
doctest> Private executables installed in:
doctest> /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6/libexec/x86_64-linux-ghc-9.8.1/doctest-0.22.6
doctest> Data files installed in:
doctest> /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6/share/x86_64-linux-ghc-9.8.1/doctest-0.22.6
doctest> Documentation installed in:
doctest> /nix/store/hzxpfhd0aslbal62bficzkcka2rfqzyf-doctest-0.22.6-doc/share/doc/doctest-0.22.6
doctest> Configuration files installed in:
doctest> /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6/etc
doctest> No alex found
doctest> Using ar found on system at:
doctest> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
doctest> No c2hs found
doctest> No cpphs found
doctest> No doctest found
doctest> Using gcc version 14.3.0 given by user at:
doctest> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
doctest> Using ghc version 9.8.1 found on system at:
doctest> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
doctest> Using ghc-pkg version 9.8.1 found on system at:
doctest> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
doctest> No ghcjs found
doctest> No ghcjs-pkg found
doctest> No greencard found
doctest> Using haddock version 2.30.0 found on system at:
doctest> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
doctest> No happy found
doctest> Using haskell-suite found on system at: haskell-suite-dummy-location
doctest> Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
doctest> No hmake found
doctest> Using hpc version 0.69 found on system at:
doctest> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
doctest> Using hsc2hs version 0.68.10 found on system at:
doctest> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
doctest> Using hscolour version 1.25 found on system at:
doctest> /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
doctest> No jhc found
doctest> Using ld found on system at:
doctest> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
doctest> No pkg-config found
doctest> Using runghc version 9.8.1 found on system at:
doctest> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
doctest> Using strip version 2.44 found on system at:
doctest> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
doctest> Using tar found on system at:
doctest> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
doctest> No uhc found
doctest> Running phase: buildPhase
doctest> Preprocessing library for doctest-0.22.6..
doctest> Building library for doctest-0.22.6..
doctest> [ 1 of 25] Compiling Imports          ( src/Imports.hs, dist/build/Imports.o, dist/build/Imports.dyn_o )
doctest> [ 2 of 25] Compiling GhcUtil          ( src/GhcUtil.hs, dist/build/GhcUtil.o, dist/build/GhcUtil.dyn_o )
doctest> [ 3 of 25] Compiling Cabal.Paths      ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.o, dist/build/Cabal/Paths.dyn_o )
doctest> [ 4 of 25] Compiling Cabal.Options    ( src/Cabal/Options.hs, dist/build/Cabal/Options.o, dist/build/Cabal/Options.dyn_o )
doctest> [ 5 of 25] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.o, dist/build/Language/Haskell/GhciWrapper.dyn_o )
doctest> [ 6 of 25] Compiling Interpreter      ( src/Interpreter.hs, dist/build/Interpreter.o, dist/build/Interpreter.dyn_o )
doctest> [ 7 of 25] Compiling Location         ( src/Location.hs, dist/build/Location.o, dist/build/Location.dyn_o )
doctest> [ 8 of 25] Compiling PackageDBs       ( src/PackageDBs.hs, dist/build/PackageDBs.o, dist/build/PackageDBs.dyn_o )
doctest> [ 9 of 25] Compiling Paths_doctest    ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.o, dist/build/Paths_doctest.dyn_o )
doctest> [10 of 25] Compiling Info             ( src/Info.hs, dist/build/Info.o, dist/build/Info.dyn_o )
doctest> [11 of 25] Compiling Options          ( src/Options.hs, dist/build/Options.o, dist/build/Options.dyn_o )
doctest> [12 of 25] Compiling Cabal            ( src/Cabal.hs, dist/build/Cabal.o, dist/build/Cabal.dyn_o )
doctest> [13 of 25] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.o, dist/build/Test/DocTest/Internal/Cabal.dyn_o )
doctest> [14 of 25] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.o, dist/build/Test/DocTest/Internal/Location.dyn_o )
doctest> [15 of 25] Compiling Util             ( src/Util.hs, dist/build/Util.o, dist/build/Util.dyn_o )
doctest> [16 of 25] Compiling Extract          ( src/Extract.hs, dist/build/Extract.o, dist/build/Extract.dyn_o )
doctest> [17 of 25] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.o, dist/build/Test/DocTest/Internal/Extract.dyn_o )
doctest> [18 of 25] Compiling Parse            ( src/Parse.hs, dist/build/Parse.o, dist/build/Parse.dyn_o )
doctest> [19 of 25] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.o, dist/build/Test/DocTest/Internal/Parse.dyn_o )
doctest> [20 of 25] Compiling Runner.Example   ( src/Runner/Example.hs, dist/build/Runner/Example.o, dist/build/Runner/Example.dyn_o )
doctest> [21 of 25] Compiling Property         ( src/Property.hs, dist/build/Property.o, dist/build/Property.dyn_o )
doctest> [22 of 25] Compiling Runner           ( src/Runner.hs, dist/build/Runner.o, dist/build/Runner.dyn_o )
doctest> [23 of 25] Compiling Run              ( src/Run.hs, dist/build/Run.o, dist/build/Run.dyn_o )
doctest> [24 of 25] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.o, dist/build/Test/DocTest/Internal/Run.dyn_o )
doctest> [25 of 25] Compiling Test.DocTest     ( src/Test/DocTest.hs, dist/build/Test/DocTest.o, dist/build/Test/DocTest.dyn_o )
doctest> [ 1 of 25] Compiling Imports          ( src/Imports.hs, dist/build/Imports.p_o )
doctest> [ 2 of 25] Compiling GhcUtil          ( src/GhcUtil.hs, dist/build/GhcUtil.p_o )
doctest> [ 3 of 25] Compiling Cabal.Paths      ( src/Cabal/Paths.hs, dist/build/Cabal/Paths.p_o )
doctest> [ 4 of 25] Compiling Cabal.Options    ( src/Cabal/Options.hs, dist/build/Cabal/Options.p_o )
doctest> [ 5 of 25] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/Language/Haskell/GhciWrapper.p_o )
doctest> [ 6 of 25] Compiling Interpreter      ( src/Interpreter.hs, dist/build/Interpreter.p_o )
doctest> [ 7 of 25] Compiling Location         ( src/Location.hs, dist/build/Location.p_o )
doctest> [ 8 of 25] Compiling PackageDBs       ( src/PackageDBs.hs, dist/build/PackageDBs.p_o )
doctest> [ 9 of 25] Compiling Paths_doctest    ( dist/build/autogen/Paths_doctest.hs, dist/build/Paths_doctest.p_o )
doctest> [10 of 25] Compiling Info             ( src/Info.hs, dist/build/Info.p_o )
doctest> [11 of 25] Compiling Options          ( src/Options.hs, dist/build/Options.p_o )
doctest> [12 of 25] Compiling Cabal            ( src/Cabal.hs, dist/build/Cabal.p_o )
doctest> [13 of 25] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/Test/DocTest/Internal/Cabal.p_o )
doctest> [14 of 25] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/Test/DocTest/Internal/Location.p_o )
doctest> [15 of 25] Compiling Util             ( src/Util.hs, dist/build/Util.p_o )
doctest> [16 of 25] Compiling Extract          ( src/Extract.hs, dist/build/Extract.p_o )
doctest> [17 of 25] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/Test/DocTest/Internal/Extract.p_o )
doctest> [18 of 25] Compiling Parse            ( src/Parse.hs, dist/build/Parse.p_o )
doctest> [19 of 25] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/Test/DocTest/Internal/Parse.p_o )
doctest> [20 of 25] Compiling Runner.Example   ( src/Runner/Example.hs, dist/build/Runner/Example.p_o )
doctest> [21 of 25] Compiling Property         ( src/Property.hs, dist/build/Property.p_o )
doctest> [22 of 25] Compiling Runner           ( src/Runner.hs, dist/build/Runner.p_o )
doctest> [23 of 25] Compiling Run              ( src/Run.hs, dist/build/Run.p_o )
doctest> [24 of 25] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/Test/DocTest/Internal/Run.p_o )
doctest> [25 of 25] Compiling Test.DocTest     ( src/Test/DocTest.hs, dist/build/Test/DocTest.p_o )
doctest> Preprocessing executable 'doctest' for doctest-0.22.6..
doctest> Building executable 'doctest' for doctest-0.22.6..
doctest> [1 of 2] Compiling Main             ( driver/doctest.hs, dist/build/doctest/doctest-tmp/Main.o )
doctest> [2 of 2] Compiling Paths_doctest    ( dist/build/doctest/autogen/Paths_doctest.hs, dist/build/doctest/doctest-tmp/Paths_doctest.o )
doctest> [3 of 3] Linking dist/build/doctest/doctest
doctest> Preprocessing test suite 'spec' for doctest-0.22.6..
doctest> Building test suite 'spec' for doctest-0.22.6..
doctest> [ 1 of 42] Compiling Imports          ( src/Imports.hs, dist/build/spec/spec-tmp/Imports.o )
doctest> [ 2 of 42] Compiling GhcUtil          ( src/GhcUtil.hs, dist/build/spec/spec-tmp/GhcUtil.o )
doctest> [ 3 of 42] Compiling Cabal.Paths      ( src/Cabal/Paths.hs, dist/build/spec/spec-tmp/Cabal/Paths.o )
doctest> [ 4 of 42] Compiling Cabal.Options    ( src/Cabal/Options.hs, dist/build/spec/spec-tmp/Cabal/Options.o )
doctest> [ 5 of 42] Compiling Cabal.OptionsSpec ( test/Cabal/OptionsSpec.hs, dist/build/spec/spec-tmp/Cabal/OptionsSpec.o )
doctest> [ 6 of 42] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapper.o )
doctest> [ 7 of 42] Compiling Interpreter      ( src/Interpreter.hs, dist/build/spec/spec-tmp/Interpreter.o )
doctest> [ 8 of 42] Compiling InterpreterSpec  ( test/InterpreterSpec.hs, dist/build/spec/spec-tmp/InterpreterSpec.o )
doctest> [ 9 of 42] Compiling Info             ( src/Info.hs, dist/build/spec/spec-tmp/Info.o )
doctest> [10 of 42] Compiling InfoSpec         ( test/InfoSpec.hs, dist/build/spec/spec-tmp/InfoSpec.o )
doctest> [11 of 42] Compiling Cabal            ( src/Cabal.hs, dist/build/spec/spec-tmp/Cabal.o )
doctest> [12 of 42] Compiling Cabal.PathsSpec  ( test/Cabal/PathsSpec.hs, dist/build/spec/spec-tmp/Cabal/PathsSpec.o )
doctest> [13 of 42] Compiling Language.Haskell.GhciWrapperSpec ( test/Language/Haskell/GhciWrapperSpec.hs, dist/build/spec/spec-tmp/Language/Haskell/GhciWrapperSpec.o )
doctest> [14 of 42] Compiling Location         ( src/Location.hs, dist/build/spec/spec-tmp/Location.o )
doctest> [15 of 42] Compiling LocationSpec     ( test/LocationSpec.hs, dist/build/spec/spec-tmp/LocationSpec.o )
doctest> [16 of 42] Compiling Options          ( src/Options.hs, dist/build/spec/spec-tmp/Options.o )
doctest> [17 of 42] Compiling OptionsSpec      ( test/OptionsSpec.hs, dist/build/spec/spec-tmp/OptionsSpec.o )
doctest> [18 of 42] Compiling PackageDBs       ( src/PackageDBs.hs, dist/build/spec/spec-tmp/PackageDBs.o )
doctest> [19 of 42] Compiling PackageDBsSpec   ( test/PackageDBsSpec.hs, dist/build/spec/spec-tmp/PackageDBsSpec.o )
doctest> [20 of 42] Compiling Paths_doctest    ( dist/build/spec/autogen/Paths_doctest.hs, dist/build/spec/spec-tmp/Paths_doctest.o )
doctest> [21 of 42] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Cabal.o )
doctest> [22 of 42] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Location.o )
doctest> [23 of 42] Compiling Util             ( src/Util.hs, dist/build/spec/spec-tmp/Util.o )
doctest> [24 of 42] Compiling Extract          ( src/Extract.hs, dist/build/spec/spec-tmp/Extract.o )
doctest> [25 of 42] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Extract.o )
doctest> [26 of 42] Compiling Parse            ( src/Parse.hs, dist/build/spec/spec-tmp/Parse.o )
doctest> [27 of 42] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Parse.o )
doctest> [28 of 42] Compiling Runner.Example   ( src/Runner/Example.hs, dist/build/spec/spec-tmp/Runner/Example.o )
doctest> [29 of 42] Compiling Runner.ExampleSpec ( test/Runner/ExampleSpec.hs, dist/build/spec/spec-tmp/Runner/ExampleSpec.o )
doctest> [30 of 42] Compiling Property         ( src/Property.hs, dist/build/spec/spec-tmp/Property.o )
doctest> [31 of 42] Compiling Runner           ( src/Runner.hs, dist/build/spec/spec-tmp/Runner.o )
doctest> [32 of 42] Compiling RunnerSpec       ( test/RunnerSpec.hs, dist/build/spec/spec-tmp/RunnerSpec.o )
doctest> [33 of 42] Compiling Run              ( src/Run.hs, dist/build/spec/spec-tmp/Run.o )
doctest> [34 of 42] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, dist/build/spec/spec-tmp/Test/DocTest/Internal/Run.o )
doctest> [35 of 42] Compiling Test.DocTest     ( src/Test/DocTest.hs, dist/build/spec/spec-tmp/Test/DocTest.o )
doctest> [36 of 42] Compiling RunSpec          ( test/RunSpec.hs, dist/build/spec/spec-tmp/RunSpec.o )
doctest> [37 of 42] Compiling MainSpec         ( test/MainSpec.hs, dist/build/spec/spec-tmp/MainSpec.o )
doctest> [38 of 42] Compiling PropertySpec     ( test/PropertySpec.hs, dist/build/spec/spec-tmp/PropertySpec.o )
doctest> [39 of 42] Compiling ParseSpec        ( test/ParseSpec.hs, dist/build/spec/spec-tmp/ParseSpec.o )
doctest> [40 of 42] Compiling ExtractSpec      ( test/ExtractSpec.hs, dist/build/spec/spec-tmp/ExtractSpec.o )
doctest> [41 of 42] Compiling UtilSpec         ( test/UtilSpec.hs, dist/build/spec/spec-tmp/UtilSpec.o )
doctest> [42 of 42] Compiling Main             ( test/Spec.hs, dist/build/spec/spec-tmp/Main.o )
doctest> [43 of 43] Linking dist/build/spec/spec
doctest> Running phase: checkPhase
doctest> Running 1 test suites...
doctest> Test suite spec: RUNNING...
doctest> 
doctest> Extract
doctest>   extract
doctest>     extracts documentation for a top-level declaration [✔]
doctest>     extracts documentation from argument list [✔]
doctest>     extracts documentation for a type class function [✔]
doctest>     extracts documentation from the argument list of a type class function [✔]
doctest>     extracts documentation from the module header [✔]
doctest>     extracts documentation from imported modules [✔]
doctest>     extracts documentation from export list [✔]
doctest>     extracts documentation from named chunks [✔]
doctest>     returns docstrings in the same order they appear in the source [✔]
doctest>     extracts $setup code [✔]
doctest>     fails on invalid flags [✔]
doctest>   extract (regression tests)
doctest>     works with infix operators [✔]
doctest>     works with parallel list comprehensions [✔]
doctest>     works with list comprehensions in instance definitions [✔]
doctest>     works with foreign imports [✔]
doctest>     works for rewrite rules [✔]
doctest>     works for rewrite rules with type signatures [✔]
doctest>     strips CR from dos line endings [✔]
doctest>     works with a module that splices in an expression from an other module [✔]
doctest>     works for type families and GHC 7.6.1 [✔]
doctest> Info
doctest>   formatInfo
doctest>     formats --info output [✔]
doctest> Interpreter
doctest>   interpreterSupported
doctest>     indicates whether GHCi is supported on current platform [✔]
doctest>   ghcInfo
doctest>     includes "Have interpreter" [✔]
doctest>   safeEval
doctest>     evaluates an expression [✔]
doctest>     returns Left on unterminated multiline command [✔]
doctest>   filterExpression
doctest>     removes :set -XTemplateHaskell [✔]
doctest>     filters -XTemplateHaskell [✔]
doctest>     leaves :set-statement that do not set -XTemplateHaskell alone  [✔]
doctest> Language.Haskell.GhciWrapper
doctest>   evalEcho
doctest>     prints result to stdout [✔]
doctest>   evalIt
doctest>     preserves it [✔]
doctest>   eval
doctest>     shows literals [✔]
doctest>     shows string literals containing Unicode [✔]
doctest>     evaluates simple expressions [✔]
doctest>     supports let bindings [✔]
doctest>     allows import statements [✔]
doctest>     captures stdout [✔]
doctest>     captures stdout (Unicode) [✔]
doctest>     captures stdout (empty line) [✔]
doctest>     captures stdout (multiple lines) [✔]
doctest>     captures stderr [✔]
doctest>     captures stderr (Unicode) [✔]
doctest>     shows exceptions [✔]
doctest>     shows exceptions (ExitCode) [✔]
doctest>     gives an error message for identifiers that are not in scope [✔]
doctest>     when configVerbose is True
doctest>       prints prompt [✔]
doctest>     with -XOverloadedStrings, -Wall and -Werror
doctest>       does not fail on marker expression (bug fix) [✔]
doctest>     with NoImplicitPrelude
doctest>       works [✔]
doctest>     with a strange String type
doctest>       works [✔]
doctest> Location
doctest>   toLocation
doctest>     works for a regular SrcSpan [✔]
doctest>     works for a single-line SrcSpan [✔]
doctest>     works for a SrcSpan that corresponds to single point [✔]
doctest>     works for a bad SrcSpan [✔]
doctest>     works for a SrcLoc with bad locations [✔]
doctest>   enumerate
doctest>     replicates UnhelpfulLocation [✔]
doctest>     enumerates Location [✔]
doctest> Main
doctest>   doctest
doctest>     testSimple [✔]
doctest>     it-variable [✔]
doctest>     it-variable in $setup [✔]
doctest>     failing [✔]
doctest>     skips subsequent examples from the same group if an example fails [✔]
doctest>     testImport [✔]
doctest>     testCommentLocation [✔]
doctest>     testPutStr [✔]
doctest>     fails on multi-line expressions, introduced with :{ [✔]
doctest>     testBlankline [✔]
doctest>     examples from the same Haddock comment share the same scope [✔]
doctest>     testDocumentationForArguments [✔]
doctest>     template-haskell [✔]
doctest>     handles source files with CRLF line endings [✔]
doctest>     runs $setup before each test group [✔]
doctest>     skips subsequent tests from a module, if $setup fails [✔]
doctest>     ignores trailing whitespace when matching test output [✔]
doctest>   doctest as a runner for QuickCheck properties
doctest>     runs a boolean property [✔]
doctest>     runs an explicitly quantified property [✔]
doctest>     runs an implicitly quantified property [✔]
doctest>     reports a failing property [✔]
doctest>     runs a boolean property with an explicit type signature [✔]
doctest>     runs $setup before each property [✔]
doctest>   doctest (regression tests)
doctest>     bugfixWorkingDirectory [✔]
doctest>     bugfixOutputToStdErr [✔]
doctest>     bugfixImportHierarchical [✔]
doctest>     bugfixMultipleModules [✔]
doctest>     testCPP [✔]
doctest>     template-haskell-bugfix [✔]
doctest>     doesn't clash with user bindings of stdout/stderr [✔]
doctest>     doesn't get confused by doctests using System.IO imports [✔]
doctest> Options
doctest>   parseOptions
doctest>     strips --optghc [✔]
doctest>     strips --optghc= [✔]
doctest>     with ghc options that are not valid with --interactive
doctest>       returns ProxyToGhc [✔]
doctest>         +++ OK, passed 100 tests.
doctest>     with --interactive
doctest>       disables magic mode [✔]
doctest>       filters out --interactive [✔]
doctest>       accepts --fast [✔]
doctest>     --no-magic
doctest>       without --no-magic
doctest>         enables magic mode [✔]
doctest>       with --no-magic
doctest>         disables magic mode [✔]
doctest>     --fast
doctest>       without --fast
doctest>         disables fast mode [✔]
doctest>       with --fast
doctest>         enabled fast mode [✔]
doctest>     --preserve-it
doctest>       without --preserve-it
doctest>         does not preserve the `it` variable [✔]
doctest>       with --preserve-it
doctest>         preserves the `it` variable [✔]
doctest>     with --help
doctest>       outputs usage information [✔]
doctest>     with --version
doctest>       outputs version information [✔]
doctest>     with --info
doctest>       outputs machine readable version information [✔]
doctest>     --verbose
doctest>       without --verbose
doctest>         is not verbose by default [✔]
doctest>       with --verbose
doctest>         parses verbose option [✔]
doctest> PackageDBs
doctest>   getPackageDBsFromEnv
doctest>     uses global and user when no env used [✔]
doctest>     respects GHC_PACKAGE_PATH [✔]
doctest> Parse
doctest>   extractDocTests
doctest>     extracts properties from a module [✔]
doctest>     extracts examples from a module [✔]
doctest>     extracts examples from documentation for non-exported names [✔]
doctest>     extracts multiple examples from a module [✔]
doctest>     returns an empty list, if documentation contains no examples [✔]
doctest>     sets setup code to Nothing, if it does not contain any tests [✔]
doctest>     keeps modules that only contain setup code [✔]
doctest>   parseInteractions (an internal function)
doctest>     parses an interaction [✔]
doctest>     drops whitespace as appropriate [✔]
doctest>     parses an interaction without a result [✔]
doctest>     works with a complex example [✔]
doctest>     attaches location information to parsed interactions [✔]
doctest>     basic multiline [✔]
doctest>     multiline align output [✔]
doctest>     multiline align output with >>> [✔]
doctest>     parses wild cards lines [✔]
doctest>     parses wild card chunks [✔]
doctest>    parseProperties (an internal function)
doctest>     parses a property [✔]
doctest>   mkLineChunks (an internal function)
doctest>     replaces ellipsis with WildCardChunks [✔]
doctest>     doesn't replace fewer than 3 consecutive dots [✔]
doctest>     handles leading and trailing dots [✔]
doctest>     handles leading and trailing ellipsis [✔]
doctest> Property
doctest>   runProperty
doctest>     reports a failing property [✔]
doctest>     runs a Bool property [✔]
doctest>     runs a Bool property with an explicit type signature [✔]
doctest>     runs an implicitly quantified property [✔]
doctest>     runs an implicitly quantified property even with GHC 7.4 [✔]
doctest>     runs an explicitly quantified property [✔]
doctest>     allows to mix implicit and explicit quantification [✔]
doctest>     reports the value for which a property fails [✔]
doctest>     reports the values for which a property that takes multiple arguments fails [✔]
doctest>     defaults ambiguous type variables to Integer [✔]
doctest>   freeVariables
doctest>     finds a free variables in a term [✔]
doctest>     ignores duplicates [✔]
doctest>     works for terms with multiple names [✔]
doctest>     works for names that contain a prime [✔]
doctest>     works for names that are similar to other names that are in scope [✔]
doctest>   parseNotInScope
doctest>     when error message was produced by GHC 7.4.1
doctest>       extracts a variable name of variable that is not in scope from an error message [✔]
doctest>       ignores duplicates [✔]
doctest>       works for variable names that contain a prime [✔]
doctest>       works for error messages with suggestions [✔]
doctest>     when error message was produced by GHC 8.0.1
doctest>       extracts a variable name of variable that is not in scope from an error message [✔]
doctest>       ignores duplicates [✔]
doctest>       works for variable names that contain a prime [✔]
doctest>       works for error messages with suggestions [✔]
doctest> Run
doctest>   doctest
doctest>     exits with ExitFailure if at least one test case fails [✔]
doctest>     prints help on --help [✔]
doctest>     prints version on --version [✔]
doctest>     accepts arbitrary GHC options [✔]
doctest>     accepts GHC options with --optghc [✔]
doctest>     prints a deprecation message for --optghc [✔]
doctest>     prints error message on invalid option [✔]
doctest>     prints verbose description of a specification [✔]
doctest>     prints verbose description of a property [✔]
doctest>     prints verbose error [✔]
doctest>     can deal with potentially problematic GHC options [✔]
doctest>   doctestWithResult
doctest>     on parse error
doctest>       aborts with (ExitFailure 1) [✔]
doctest>       prints a useful error message [✔]
doctest>   expandDirs
doctest>     expands a directory [✔]
doctest>     ignores files [✔]
doctest>     ignores random things [✔]
doctest> Runner
doctest>   report
doctest>     when mode is interactive
doctest>       writes to stderr [✔]
doctest>       overwrites any intermediate output [✔]
doctest>       blank out intermediate output if necessary [✔]
doctest>     when mode is non-interactive
doctest>       writes to stderr [✔]
doctest>   report_
doctest>     when mode is interactive
doctest>       writes intermediate output to stderr [✔]
doctest>       overwrites any intermediate output [✔]
doctest>       blank out intermediate output if necessary [✔]
doctest>     when mode is non-interactive
doctest>       is ignored [✔]
doctest>       does not influence a subsequent call to `report` [✔]
doctest>       does not require `report` to blank out any intermediate output [✔]
doctest> Runner.Example
doctest>   mkResult
doctest>     returns Equal when output matches [✔]
doctest>       +++ OK, passed 100 tests.
doctest>     ignores trailing whitespace [✔]
doctest>     with WildCardLine
doctest>       matches zero lines [✔]
doctest>       matches first zero line [✔]
doctest>       matches final zero line [✔]
doctest>       matches an arbitrary number of lines [✔]
doctest>       matches an arbitrary number of lines (quickcheck) [✔]
doctest>         +++ OK, passed 100 tests.
doctest>     with WildCardChunk
doctest>       matches an arbitrary line chunk [✔]
doctest>       matches an arbitrary line chunk at end [✔]
doctest>       does not match at end [✔]
doctest>       does not match at start [✔]
doctest>     when output does not match
doctest>       constructs failure message [✔]
doctest>       constructs failure message for multi-line output [✔]
doctest>       when any output line contains "unsafe" characters
doctest>         uses show to format output lines [✔]
doctest>       insert caret after last matching character on different lengths [✔]
doctest>       insert caret after mismatching line for multi-line output [✔]
doctest>       insert caret after mismatching line with the longest match for multi-line wildcard pattern [✔]
doctest>       insert caret after longest match for wildcard [✔]
doctest>       show expanded pattern for long matches [✔]
doctest> Util
doctest>   convertDosLineEndings
doctest>     converts CRLF to LF [✔]
doctest>     strips a trailing CR [✔]
doctest>   takeWhileEnd
doctest>     returns the longest suffix of elements that satisfy a given predicate [✔]
doctest> 
doctest> Finished in 12.4557 seconds
doctest> 198 examples, 0 failures
doctest> Test suite spec: PASS
doctest> Test suite logged to: dist/test/doctest-0.22.6-spec.log
doctest> 1 of 1 test suites (1 of 1 test cases) passed.
doctest> Running phase: haddockPhase
doctest> Preprocessing library for doctest-0.22.6..
doctest> Running Haddock on library for doctest-0.22.6..
doctest> Warning: --source-* options are ignored when --hyperlinked-source is enabled.
doctest> [ 1 of 25] Compiling Imports          ( src/Imports.hs, nothing )
doctest> [ 2 of 25] Compiling GhcUtil          ( src/GhcUtil.hs, nothing )
doctest> [ 3 of 25] Compiling Cabal.Paths      ( src/Cabal/Paths.hs, nothing )
doctest> [ 4 of 25] Compiling Cabal.Options    ( src/Cabal/Options.hs, nothing )
doctest> [ 5 of 25] Compiling Language.Haskell.GhciWrapper ( src/Language/Haskell/GhciWrapper.hs, nothing )
doctest> [ 6 of 25] Compiling Interpreter      ( src/Interpreter.hs, nothing )
doctest> [ 7 of 25] Compiling Location         ( src/Location.hs, nothing )
doctest> [ 8 of 25] Compiling PackageDBs       ( src/PackageDBs.hs, nothing )
doctest> [ 9 of 25] Compiling Paths_doctest    ( dist/build/autogen/Paths_doctest.hs, nothing )
doctest> [10 of 25] Compiling Info             ( src/Info.hs, nothing )
doctest> [11 of 25] Compiling Options          ( src/Options.hs, nothing )
doctest> [12 of 25] Compiling Cabal            ( src/Cabal.hs, nothing )
doctest> [13 of 25] Compiling Test.DocTest.Internal.Cabal ( src/Test/DocTest/Internal/Cabal.hs, nothing )
doctest> [14 of 25] Compiling Test.DocTest.Internal.Location ( src/Test/DocTest/Internal/Location.hs, nothing )
doctest> [15 of 25] Compiling Util             ( src/Util.hs, nothing )
doctest> [16 of 25] Compiling Extract          ( src/Extract.hs, nothing )
doctest> [17 of 25] Compiling Test.DocTest.Internal.Extract ( src/Test/DocTest/Internal/Extract.hs, nothing )
doctest> [18 of 25] Compiling Parse            ( src/Parse.hs, nothing )
doctest> [19 of 25] Compiling Test.DocTest.Internal.Parse ( src/Test/DocTest/Internal/Parse.hs, nothing )
doctest> [20 of 25] Compiling Runner.Example   ( src/Runner/Example.hs, nothing )
doctest> [21 of 25] Compiling Property         ( src/Property.hs, nothing )
doctest> [22 of 25] Compiling Runner           ( src/Runner.hs, nothing )
doctest> [23 of 25] Compiling Run              ( src/Run.hs, nothing )
doctest> [24 of 25] Compiling Test.DocTest.Internal.Run ( src/Test/DocTest/Internal/Run.hs, nothing )
doctest> [25 of 25] Compiling Test.DocTest     ( src/Test/DocTest.hs, nothing )
doctest> Haddock coverage:
doctest> Warning: Imports: Could not find documentation for exported module: Imports
doctest>    0% (  0 /  2) in 'Test.DocTest.Internal.Cabal'
doctest>   Missing documentation for:
doctest>     Module header
doctest>     doctest (src/Test/DocTest/Internal/Cabal.hs:10)
doctest>   88% (  8 /  9) in 'Test.DocTest.Internal.Location'
doctest>   Missing documentation for:
doctest>     Module header
doctest> Warning: 'SomeException' is ambiguous. It is defined
doctest>     * in ‘GHC.Exception.Type’
doctest>     * in ‘GHC.Exception.Type’
doctest>     You may be able to disambiguate the identifier by qualifying it or
doctest>     by specifying the type/value namespace explicitly.
doctest>     Defaulting to the one defined in ‘GHC.Exception.Type’
doctest>   66% (  2 /  3) in 'Test.DocTest.Internal.Extract'
doctest>   Missing documentation for:
doctest>     Module header
doctest>   22% (  2 /  9) in 'Test.DocTest.Internal.Parse'
doctest>   Missing documentation for:
doctest>     Module header
doctest>     DocTest (src/Parse.hs:29)
doctest>     Expression (src/Parse.hs:44)
doctest>     ExpectedResult (src/Parse.hs:45)
doctest>     ExpectedLine (src/Parse.hs:38)
doctest>     LineChunk (src/Parse.hs:32)
doctest>     parseModules (src/Parse.hs:60)
doctest>   16% (  2 / 12) in 'Test.DocTest.Internal.Run'
doctest>   Missing documentation for:
doctest>     Module header
doctest>     Result (src/Run.hs:137)
doctest>     Config (src/Options.hs:56)
doctest>     isSuccess (src/Run.hs:140)
doctest>     defaultConfig (src/Options.hs:65)
doctest>     doctestWithRepl (src/Run.hs:65)
doctest>     doctestWith (src/Run.hs:135)
doctest>     evaluateResult (src/Run.hs:143)
doctest>     doctestWithResult (src/Run.hs:146)
doctest>     runDocTests (src/Run.hs:156)
doctest>   50% (  1 /  2) in 'Test.DocTest'
doctest>   Missing documentation for:
doctest>     Module header
doctest> Documentation created: dist/doc/html/doctest/,
doctest> dist/doc/html/doctest/doctest.txt
doctest> Preprocessing executable 'doctest' for doctest-0.22.6..
doctest> Preprocessing test suite 'spec' for doctest-0.22.6..
doctest> Running phase: installPhase
doctest> Installing library in /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
doctest> Installing executable doctest in /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6/bin
doctest> Warning: The directory
doctest> /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6/bin is not in the
doctest> system search path.
doctest> Running phase: fixupPhase
doctest> shrinking RPATHs of ELF executables and libraries in /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6
doctest> shrinking /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6/bin/doctest
doctest> shrinking /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSdoctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz-ghc9.8.1.so
doctest> checking for references to /build/ in /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6...
doctest> patching script interpreter paths in /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6
doctest> stripping (with command strip and flags -S -p) in  /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6/lib /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6/bin
doctest> shrinking RPATHs of ELF executables and libraries in /nix/store/hzxpfhd0aslbal62bficzkcka2rfqzyf-doctest-0.22.6-doc
doctest> checking for references to /build/ in /nix/store/hzxpfhd0aslbal62bficzkcka2rfqzyf-doctest-0.22.6-doc...
doctest> patching script interpreter paths in /nix/store/hzxpfhd0aslbal62bficzkcka2rfqzyf-doctest-0.22.6-doc
doctest (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/hzxpfhd0aslbal62bficzkcka2rfqzyf-doctest-0.22.6-doc /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6
doctest (post)> Pushing 2 paths (72 are already present) using zstd to cache sellout ⏳
doctest (post)> 
doctest (post)> Pushing /nix/store/hzxpfhd0aslbal62bficzkcka2rfqzyf-doctest-0.22.6-doc (1.34 MiB)
doctest (post)> Pushing /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6 (66.53 MiB)
doctest (post)> 
doctest (post)> All done.
doctest (post)> added 2 signatures
doctest (post)> added 34 signatures
doctest (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/hzxpfhd0aslbal62bficzkcka2rfqzyf-doctest-0.22.6-doc /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6
doctest (post)> copying 2 paths...
doctest (post)> copying path '/nix/store/hzxpfhd0aslbal62bficzkcka2rfqzyf-doctest-0.22.6-doc' to 'https://cache.nix-ci.com'...
doctest (post)> copying path '/nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6' to 'https://cache.nix-ci.com'...
doctest (post)> copying 1 paths...
doctest (post)> copying path '/nix/store/989y2cvpp3g59xj466p6na2advd2r3jb-doctest-0.22.6.drv' to 'https://cache.nix-ci.com'...
doctest (post)> added 0 signatures
doctest (post)> added 0 signatures
doctest (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/hzxpfhd0aslbal62bficzkcka2rfqzyf-doctest-0.22.6-doc /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6
doctest (post)> copying 2 paths...
doctest (post)> copying path '/nix/store/hzxpfhd0aslbal62bficzkcka2rfqzyf-doctest-0.22.6-doc' to 'ssh-ng://worker.nix-ci.com'...
doctest (post)> copying path '/nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6' to 'ssh-ng://worker.nix-ci.com'...
doctest (post)> copying 1 paths...
doctest (post)> copying path '/nix/store/989y2cvpp3g59xj466p6na2advd2r3jb-doctest-0.22.6.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/1pq12dx42mf5sam3hkb11ddyl1rqzlm0-no-recursion-0.3.0.0.drv'...
building '/nix/store/2arh61w9mwa0zd7rw90cl46s5agma11k-vector-0.13.2.0.drv'...
no-recursion> Running phase: setupCompilerEnvironmentPhase
no-recursion> Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
vector> Running phase: setupCompilerEnvironmentPhase
vector> Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
no-recursion> Running phase: unpackPhase
no-recursion> unpacking source archive /nix/store/m17m98cfs3z832acdfkbis1jvgl60n38-source
no-recursion> source root is source
no-recursion> Running phase: patchPhase
no-recursion> Running phase: compileBuildDriverPhase
no-recursion> setupCompileFlags: -package-db=/build/tmp.7Vyzf8qk55/setup-package.conf.d -threaded
no-recursion> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.7Vyzf8qk55/Main.o )
no-recursion> [2 of 2] Linking Setup
vector> Running phase: unpackPhase
vector> unpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
vector> source root is vector-0.13.2.0
vector> setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
vector> Running phase: patchPhase
vector> Replace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/1.cabal.
vector> Running phase: compileBuildDriverPhase
vector> setupCompileFlags: -package-db=/build/tmp.yGYKNmnPtK/setup-package.conf.d -threaded
vector> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.yGYKNmnPtK/Main.o )
vector> [2 of 2] Linking Setup
no-recursion> Running phase: updateAutotoolsGnuConfigScriptsPhase
no-recursion> Running phase: configurePhase
no-recursion> configureFlags: --verbose --prefix=/nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/24crf3lalxy4hi6ri7237rs04m7l912l-no-recursion-0.3.0.0-doc/share/doc/no-recursion-0.3.0.0 --with-gcc=gcc --package-db=/build/tmp.7Vyzf8qk55/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/lib
no-recursion> Using Parsec parser
no-recursion> Configuring no-recursion-0.3.0.0...
vector> Running phase: updateAutotoolsGnuConfigScriptsPhase
vector> Running phase: configurePhase
vector> configureFlags: --verbose --prefix=/nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.yGYKNmnPtK/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/lib
vector> Using Parsec parser
vector> Configuring vector-0.13.2.0...
no-recursion> Flags chosen: noisy-deprecations=True
vector> Flags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
vector> wall=False
vector> Dependency base >=4.9 && <4.22: using base-4.19.0.0
vector> Dependency deepseq >=1.1 && <1.6: using deepseq-1.5.0.0
vector> Dependency primitive >=0.6.4.0 && <0.10: using primitive-0.9.1.0
vector> Dependency vector-stream >=0.1 && <0.2: using vector-stream-0.1.0.1
vector> Dependency base: using base-4.19.0.0
vector> Dependency random >=1.2: using random-1.2.1.3
vector> Dependency tasty: using tasty-1.5.3
vector> Dependency vector: using vector-0.13.2.0
vector> Dependency QuickCheck >=2.9 && <2.16: using QuickCheck-2.14.3
vector> Dependency base >=4.5 && <5: using base-4.19.0.0
vector> Dependency base-orphans >=0.6: using base-orphans-0.9.3
vector> Dependency primitive: using primitive-0.9.1.0
vector> Dependency random: using random-1.2.1.3
vector> Dependency tasty: using tasty-1.5.3
vector> Dependency tasty-hunit: using tasty-hunit-0.10.2
vector> Dependency tasty-quickcheck: using tasty-quickcheck-0.11
vector> Dependency template-haskell: using template-haskell-2.21.0.0
vector> Dependency transformers >=0.2.0.0: using transformers-0.6.1.0
vector> Dependency vector: using vector-0.13.2.0
vector> Dependency QuickCheck >=2.9 && <2.16: using QuickCheck-2.14.3
vector> Dependency base >=4.5 && <5: using base-4.19.0.0
vector> Dependency base-orphans >=0.6: using base-orphans-0.9.3
vector> Dependency primitive: using primitive-0.9.1.0
vector> Dependency random: using random-1.2.1.3
vector> Dependency tasty: using tasty-1.5.3
vector> Dependency tasty-hunit: using tasty-hunit-0.10.2
vector> Dependency tasty-quickcheck: using tasty-quickcheck-0.11
vector> Dependency template-haskell: using template-haskell-2.21.0.0
vector> Dependency transformers >=0.2.0.0: using transformers-0.6.1.0
vector> Dependency vector: using vector-0.13.2.0
vector> Dependency base: using base-4.19.0.0
vector> Dependency doctest >=0.15 && <0.24: using doctest-0.22.6
vector> Dependency primitive >=0.6.4.0 && <0.10: using primitive-0.9.1.0
vector> Dependency vector: using vector-0.13.2.0
vector> Dependency base: using base-4.19.0.0
vector> Dependency primitive >=0.6.4.0 && <0.10: using primitive-0.9.1.0
vector> Dependency tasty: using tasty-1.5.3
vector> Dependency tasty-inspection-testing >=0.1: using
vector> tasty-inspection-testing-0.2.1
vector> Dependency vector: using vector-0.13.2.0
no-recursion> Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
no-recursion> >=4.21.0 && <4.22: using base-4.19.0.0
no-recursion> Dependency ghc >=9.6.1 && <9.7 || >=9.8.1 && <9.9 || >=9.10.1 && <9.11 ||
no-recursion> >=9.12.1 && <9.13: using ghc-9.8.1
no-recursion> Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
no-recursion> >=4.21.0 && <4.22: using base-4.19.0.0
no-recursion> Dependency doctest >=0.21.1 && <0.22 || >=0.22.2 && <0.23 || >=0.24.0 &&
no-recursion> <0.25: using doctest-0.22.6
no-recursion> Dependency no-recursion: using no-recursion-0.3.0.0
no-recursion> Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
no-recursion> >=4.21.0 && <4.22: using base-4.19.0.0
no-recursion> Dependency no-recursion: using no-recursion-0.3.0.0
no-recursion> Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
no-recursion> >=4.21.0 && <4.22: using base-4.19.0.0
no-recursion> Dependency no-recursion: using no-recursion-0.3.0.0
no-recursion> Source component graph:
no-recursion>     component lib
no-recursion>     component test:annotations dependency lib
no-recursion>     component test:doctests dependency lib
no-recursion>     component test:no-ignore-annotations dependency lib
no-recursion> Configured component graph:
no-recursion>     component no-recursion-0.3.0.0-J4skRsBUeaM3XOLOOVqotc
no-recursion>         include base-4.19.0.0-b960
no-recursion>         include ghc-9.8.1-f1e9
no-recursion>     component no-recursion-0.3.0.0-6s25OEOGykmGvOMr7PiyP3-annotations
no-recursion>         include base-4.19.0.0-b960
no-recursion>         include no-recursion-0.3.0.0-J4skRsBUeaM3XOLOOVqotc
no-recursion>     component no-recursion-0.3.0.0-KsNuV9jt0UWB9oL0060fob-doctests
no-recursion>         include base-4.19.0.0-b960
no-recursion>         include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
no-recursion>         include no-recursion-0.3.0.0-J4skRsBUeaM3XOLOOVqotc
no-recursion>     component no-recursion-0.3.0.0-7GiOPw1NnES22pKsgAjbqX-no-ignore-annotations
no-recursion>         include base-4.19.0.0-b960
no-recursion>         include no-recursion-0.3.0.0-J4skRsBUeaM3XOLOOVqotc
no-recursion> Linked component graph:
no-recursion>     unit no-recursion-0.3.0.0-J4skRsBUeaM3XOLOOVqotc
no-recursion>         include base-4.19.0.0-b960
no-recursion>         include ghc-9.8.1-f1e9
no-recursion>         NoRecursion=no-recursion-0.3.0.0-J4skRsBUeaM3XOLOOVqotc:NoRecursion
no-recursion>     unit no-recursion-0.3.0.0-6s25OEOGykmGvOMr7PiyP3-annotations
no-recursion>         include base-4.19.0.0-b960
no-recursion>         include no-recursion-0.3.0.0-J4skRsBUeaM3XOLOOVqotc
no-recursion>     unit no-recursion-0.3.0.0-KsNuV9jt0UWB9oL0060fob-doctests
no-recursion>         include base-4.19.0.0-b960
no-recursion>         include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
no-recursion>         include no-recursion-0.3.0.0-J4skRsBUeaM3XOLOOVqotc
no-recursion>     unit no-recursion-0.3.0.0-7GiOPw1NnES22pKsgAjbqX-no-ignore-annotations
no-recursion>         include base-4.19.0.0-b960
no-recursion>         include no-recursion-0.3.0.0-J4skRsBUeaM3XOLOOVqotc
no-recursion> Ready component graph:
no-recursion>     definite no-recursion-0.3.0.0-J4skRsBUeaM3XOLOOVqotc
no-recursion>         depends base-4.19.0.0-b960
no-recursion>         depends ghc-9.8.1-f1e9
no-recursion>     definite no-recursion-0.3.0.0-KsNuV9jt0UWB9oL0060fob-doctests
no-recursion>         depends base-4.19.0.0-b960
no-recursion>         depends doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
no-recursion>         depends no-recursion-0.3.0.0-J4skRsBUeaM3XOLOOVqotc
no-recursion>     definite no-recursion-0.3.0.0-7GiOPw1NnES22pKsgAjbqX-no-ignore-annotations
no-recursion>         depends base-4.19.0.0-b960
no-recursion>         depends no-recursion-0.3.0.0-J4skRsBUeaM3XOLOOVqotc
no-recursion>     definite no-recursion-0.3.0.0-6s25OEOGykmGvOMr7PiyP3-annotations
no-recursion>         depends base-4.19.0.0-b960
no-recursion>         depends no-recursion-0.3.0.0-J4skRsBUeaM3XOLOOVqotc
no-recursion> Using Cabal-3.12.1.0 compiled by ghc-9.8
no-recursion> Using compiler: ghc-9.8.1
no-recursion> Using install prefix:
no-recursion> /nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0
no-recursion> Executables installed in:
no-recursion> /nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0/bin
no-recursion> Libraries installed in:
no-recursion> /nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/no-recursion-0.3.0.0-J4skRsBUeaM3XOLOOVqotc
no-recursion> Dynamic Libraries installed in:
no-recursion> /nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9
no-recursion> Private executables installed in:
no-recursion> /nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0/libexec/x86_64-linux-ghc-9.8.1-f1e9/no-recursion-0.3.0.0
no-recursion> Data files installed in:
no-recursion> /nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0/share/x86_64-linux-ghc-9.8.1-f1e9/no-recursion-0.3.0.0
no-recursion> Documentation installed in:
no-recursion> /nix/store/24crf3lalxy4hi6ri7237rs04m7l912l-no-recursion-0.3.0.0-doc/share/doc/no-recursion-0.3.0.0
no-recursion> Configuration files installed in:
no-recursion> /nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0/etc
no-recursion> No alex found
no-recursion> Using ar found on system at:
no-recursion> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
no-recursion> No c2hs found
no-recursion> No cpphs found
no-recursion> Using doctest version 0.22.6 found on system at:
no-recursion> /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6/bin/doctest
no-recursion> Using gcc version 14.3.0 given by user at:
no-recursion> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
no-recursion> Using ghc version 9.8.1 found on system at:
no-recursion> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
no-recursion> Using ghc-pkg version 9.8.1 found on system at:
no-recursion> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
no-recursion> No ghcjs found
no-recursion> No ghcjs-pkg found
no-recursion> No greencard found
no-recursion> Using haddock version 2.30.0 found on system at:
no-recursion> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
no-recursion> No happy found
no-recursion> Using haskell-suite found on system at: haskell-suite-dummy-location
no-recursion> Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
no-recursion> No hmake found
no-recursion> Using hpc version 0.69 found on system at:
no-recursion> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
no-recursion> Using hsc2hs version 0.68.10 found on system at:
no-recursion> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
no-recursion> Using hscolour version 1.25 found on system at:
no-recursion> /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
no-recursion> No jhc found
no-recursion> Using ld found on system at:
no-recursion> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
no-recursion> No pkg-config found
no-recursion> Using runghc version 9.8.1 found on system at:
no-recursion> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
no-recursion> Using strip version 2.44 found on system at:
no-recursion> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
no-recursion> Using tar found on system at:
no-recursion> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
no-recursion> No uhc found
no-recursion> Running phase: buildPhase
vector> Source component graph:
vector>     component lib
vector>     component lib:benchmarks-O2 dependency lib
vector>     component test:vector-doctest dependency lib
vector>     component test:vector-inspection dependency lib
vector>     component test:vector-tests-O0 dependency lib
vector>     component test:vector-tests-O2 dependency lib
vector> Configured component graph:
vector>     component vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector>         include base-4.19.0.0-b960
vector>         include deepseq-1.5.0.0-412f
vector>         include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
vector>         include vector-stream-0.1.0.1-1ROR3WR6vG9AVjHlNJubVk
vector>     component vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2
vector>         include base-4.19.0.0-b960
vector>         include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
vector>         include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
vector>         include vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector>     component vector-0.13.2.0-1eGaHRODX4tFEt6A190OpQ-vector-doctest
vector>         include base-4.19.0.0-b960
vector>         include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
vector>         include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
vector>         include vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector>     component vector-0.13.2.0-2ebrAZXEXXi853buqytQYY-vector-inspection
vector>         include base-4.19.0.0-b960
vector>         include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
vector>         include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
vector>         include tasty-inspection-testing-0.2.1-8C8dNDpjl7p97LTsz7awMh
vector>         include vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector>     component vector-0.13.2.0-DkOOETKrqPI8zkryteKkPv-vector-tests-O0
vector>         include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
vector>         include base-4.19.0.0-b960
vector>         include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
vector>         include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
vector>         include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
vector>         include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
vector>         include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
vector>         include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
vector>         include template-haskell-2.21.0.0-8831
vector>         include transformers-0.6.1.0-c3ec
vector>         include vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector>     component vector-0.13.2.0-Cy29OZFnKYM7djuPVsYPEp-vector-tests-O2
vector>         include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
vector>         include base-4.19.0.0-b960
vector>         include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
vector>         include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
vector>         include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
vector>         include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
vector>         include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
vector>         include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
vector>         include template-haskell-2.21.0.0-8831
vector>         include transformers-0.6.1.0-c3ec
vector>         include vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector> Linked component graph:
vector>     unit vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector>         include base-4.19.0.0-b960
vector>         include deepseq-1.5.0.0-412f
vector>         include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
vector>         include vector-stream-0.1.0.1-1ROR3WR6vG9AVjHlNJubVk
vector>         Data.Vector=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-KITycIPQp0R25115diGgzh:Data.Vector.Unboxed.Mutable
vector>     unit vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2
vector>         include base-4.19.0.0-b960
vector>         include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
vector>         include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
vector>         include vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector>         Bench.Vector.Algo.AwShCC=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2:Bench.Vector.TestData.ParenTree
vector>     unit vector-0.13.2.0-1eGaHRODX4tFEt6A190OpQ-vector-doctest
vector>         include base-4.19.0.0-b960
vector>         include doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
vector>         include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
vector>         include vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector>     unit vector-0.13.2.0-2ebrAZXEXXi853buqytQYY-vector-inspection
vector>         include base-4.19.0.0-b960
vector>         include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
vector>         include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
vector>         include tasty-inspection-testing-0.2.1-8C8dNDpjl7p97LTsz7awMh
vector>         include vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector>     unit vector-0.13.2.0-DkOOETKrqPI8zkryteKkPv-vector-tests-O0
vector>         include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
vector>         include base-4.19.0.0-b960
vector>         include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
vector>         include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
vector>         include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
vector>         include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
vector>         include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
vector>         include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
vector>         include template-haskell-2.21.0.0-8831
vector>         include transformers-0.6.1.0-c3ec
vector>         include vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector>     unit vector-0.13.2.0-Cy29OZFnKYM7djuPVsYPEp-vector-tests-O2
vector>         include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
vector>         include base-4.19.0.0-b960
vector>         include base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
vector>         include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
vector>         include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
vector>         include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
vector>         include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
vector>         include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
vector>         include template-haskell-2.21.0.0-8831
vector>         include transformers-0.6.1.0-c3ec
vector>         include vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector> Ready component graph:
vector>     definite vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector>         depends base-4.19.0.0-b960
vector>         depends deepseq-1.5.0.0-412f
vector>         depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
vector>         depends vector-stream-0.1.0.1-1ROR3WR6vG9AVjHlNJubVk
vector>     definite vector-0.13.2.0-DkOOETKrqPI8zkryteKkPv-vector-tests-O0
vector>         depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
vector>         depends base-4.19.0.0-b960
vector>         depends base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
vector>         depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
vector>         depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
vector>         depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
vector>         depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
vector>         depends tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
vector>         depends template-haskell-2.21.0.0-8831
vector>         depends transformers-0.6.1.0-c3ec
vector>         depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector>     definite vector-0.13.2.0-Cy29OZFnKYM7djuPVsYPEp-vector-tests-O2
vector>         depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
vector>         depends base-4.19.0.0-b960
vector>         depends base-orphans-0.9.3-KQrT0vwfP0RDZyxwwFJRzU
vector>         depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
vector>         depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
vector>         depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
vector>         depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
vector>         depends tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
vector>         depends template-haskell-2.21.0.0-8831
vector>         depends transformers-0.6.1.0-c3ec
vector>         depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector>     definite vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2
vector>         depends base-4.19.0.0-b960
vector>         depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
vector>         depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
vector>         depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector>     definite vector-0.13.2.0-2ebrAZXEXXi853buqytQYY-vector-inspection
vector>         depends base-4.19.0.0-b960
vector>         depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
vector>         depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
vector>         depends tasty-inspection-testing-0.2.1-8C8dNDpjl7p97LTsz7awMh
vector>         depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector>     definite vector-0.13.2.0-1eGaHRODX4tFEt6A190OpQ-vector-doctest
vector>         depends base-4.19.0.0-b960
vector>         depends doctest-0.22.6-JET1qzeGFw1Ff4jrrp42yz
vector>         depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
vector>         depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector> Using Cabal-3.10.2.0 compiled by ghc-9.8
vector> Using compiler: ghc-9.8.1
vector> Using install prefix:
vector> /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0
vector> Executables installed in:
vector> /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0/bin
vector> Libraries installed in:
vector> /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector> Dynamic Libraries installed in:
vector> /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
vector> Private executables installed in:
vector> /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.8.1/vector-0.13.2.0
vector> Data files installed in:
vector> /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0/share/x86_64-linux-ghc-9.8.1/vector-0.13.2.0
vector> Documentation installed in:
vector> /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.8.1/vector-0.13.2.0
vector> Configuration files installed in:
vector> /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0/etc
vector> No alex found
vector> Using ar found on system at:
vector> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
vector> No c2hs found
vector> No cpphs found
vector> Using doctest version 0.22.6 found on system at:
vector> /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6/bin/doctest
vector> Using gcc version 14.3.0 given by user at:
vector> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
vector> Using ghc version 9.8.1 found on system at:
vector> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
vector> Using ghc-pkg version 9.8.1 found on system at:
vector> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
vector> No ghcjs found
vector> No ghcjs-pkg found
vector> No greencard found
vector> Using haddock version 2.30.0 found on system at:
vector> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
vector> No happy found
vector> Using haskell-suite found on system at: haskell-suite-dummy-location
vector> Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
vector> No hmake found
vector> Using hpc version 0.69 found on system at:
vector> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
vector> Using hsc2hs version 0.68.10 found on system at:
vector> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
vector> Using hscolour version 1.25 found on system at:
vector> /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
vector> No jhc found
vector> Using ld found on system at:
vector> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
vector> No pkg-config found
vector> Using runghc version 9.8.1 found on system at:
vector> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
vector> Using strip version 2.44 found on system at:
vector> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
vector> Using tar found on system at:
vector> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
vector> No uhc found
no-recursion> Preprocessing library for no-recursion-0.3.0.0...
no-recursion> Building library for no-recursion-0.3.0.0...
no-recursion> [1 of 2] Compiling PluginUtils      ( src/PluginUtils.hs, dist/build/PluginUtils.o, dist/build/PluginUtils.dyn_o )
vector> Running phase: buildPhase
vector> Preprocessing library for vector-0.13.2.0..
vector> Building library for vector-0.13.2.0..
no-recursion> [2 of 2] Compiling NoRecursion      ( src/NoRecursion.hs, dist/build/NoRecursion.o, dist/build/NoRecursion.dyn_o )
vector> [ 1 of 23] Compiling Data.Vector.Fusion.Stream.Monadic ( src/Data/Vector/Fusion/Stream/Monadic.hs, dist/build/Data/Vector/Fusion/Stream/Monadic.o, dist/build/Data/Vector/Fusion/Stream/Monadic.dyn_o )
vector> [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.o, dist/build/Data/Vector/Fusion/Util.dyn_o )
vector> [ 3 of 23] Compiling Data.Vector.Fusion.Bundle.Size ( src/Data/Vector/Fusion/Bundle/Size.hs, dist/build/Data/Vector/Fusion/Bundle/Size.o, dist/build/Data/Vector/Fusion/Bundle/Size.dyn_o )
vector> [ 4 of 23] Compiling Data.Vector.Generic.Mutable.Base ( src/Data/Vector/Generic/Mutable/Base.hs, dist/build/Data/Vector/Generic/Mutable/Base.o, dist/build/Data/Vector/Generic/Mutable/Base.dyn_o )
vector> [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.o, dist/build/Data/Vector/Generic/Base.dyn_o )
vector> [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.o, dist/build/Data/Vector/Internal/Check.dyn_o )
vector> [ 7 of 23] Compiling Data.Vector.Fusion.Bundle.Monadic ( src/Data/Vector/Fusion/Bundle/Monadic.hs, dist/build/Data/Vector/Fusion/Bundle/Monadic.o, dist/build/Data/Vector/Fusion/Bundle/Monadic.dyn_o )
no-recursion> [1 of 2] Compiling PluginUtils      ( src/PluginUtils.hs, dist/build/PluginUtils.p_o )
no-recursion> [2 of 2] Compiling NoRecursion      ( src/NoRecursion.hs, dist/build/NoRecursion.p_o )
no-recursion> Preprocessing test suite 'doctests' for no-recursion-0.3.0.0...
no-recursion> Building test suite 'doctests' for no-recursion-0.3.0.0...
no-recursion> [1 of 2] Compiling Build_doctests   ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
no-recursion> [2 of 2] Compiling Main             ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
no-recursion> [3 of 3] Linking dist/build/doctests/doctests
vector> [ 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 )
vector> [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.o, dist/build/Data/Vector/Generic/Mutable.dyn_o )
no-recursion> Preprocessing test suite 'no-ignore-annotations' for no-recursion-0.3.0.0...
no-recursion> Building test suite 'no-ignore-annotations' for no-recursion-0.3.0.0...
no-recursion> [1 of 2] Compiling Test.IgnoreDefaultImpls ( tests/no-ignore/Test/IgnoreDefaultImpls.hs, dist/build/no-ignore-annotations/no-ignore-annotations-tmp/Test/IgnoreDefaultImpls.o )
no-recursion> [2 of 2] Compiling Main             ( tests/no-ignore/test.hs, dist/build/no-ignore-annotations/no-ignore-annotations-tmp/Main.o )
no-recursion> [3 of 3] Linking dist/build/no-ignore-annotations/no-ignore-annotations
no-recursion> Preprocessing test suite 'annotations' for no-recursion-0.3.0.0...
no-recursion> Building test suite 'annotations' for no-recursion-0.3.0.0...
no-recursion> [1 of 6] Compiling Test.AllowRecursion ( tests/ignore/Test/AllowRecursion.hs, dist/build/annotations/annotations-tmp/Test/AllowRecursion.o )
no-recursion> [2 of 6] Compiling Test.AnnModule   ( tests/ignore/Test/AnnModule.hs, dist/build/annotations/annotations-tmp/Test/AnnModule.o )
no-recursion> [3 of 6] Compiling Test.AnnName     ( tests/ignore/Test/AnnName.hs, dist/build/annotations/annotations-tmp/Test/AnnName.o )
no-recursion> [4 of 6] Compiling Test.IgnoreDefaultImpls ( tests/ignore/Test/IgnoreDefaultImpls.hs, dist/build/annotations/annotations-tmp/Test/IgnoreDefaultImpls.o )
no-recursion> [5 of 6] Compiling Test.UnannName   ( tests/ignore/Test/UnannName.hs, dist/build/annotations/annotations-tmp/Test/UnannName.o )
no-recursion> [6 of 6] Compiling Main             ( tests/ignore/test.hs, dist/build/annotations/annotations-tmp/Main.o )
no-recursion> [7 of 7] Linking dist/build/annotations/annotations
no-recursion> Running phase: checkPhase
no-recursion> Running 3 test suites...
no-recursion> Test suite doctests: RUNNING...
vector> [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.o, dist/build/Data/Vector/Generic/New.dyn_o )
vector> [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.o, dist/build/Data/Vector/Generic.dyn_o )
no-recursion> Examples: 0  Tried: 0  Errors: 0  Failures: 0
no-recursion> Test suite doctests: PASS
no-recursion> Test suite logged to: dist/test/no-recursion-0.3.0.0-doctests.log
no-recursion> Test suite no-ignore-annotations: RUNNING...
no-recursion> Test suite no-ignore-annotations: PASS
no-recursion> Test suite logged to: dist/test/no-recursion-0.3.0.0-no-ignore-annotations.log
no-recursion> Test suite annotations: RUNNING...
no-recursion> Test suite annotations: PASS
no-recursion> Test suite logged to: dist/test/no-recursion-0.3.0.0-annotations.log
no-recursion> 3 of 3 test suites (3 of 3 test cases) passed.
no-recursion> Running phase: haddockPhase
no-recursion> Preprocessing library for no-recursion-0.3.0.0...
no-recursion> Running Haddock on library for no-recursion-0.3.0.0...
no-recursion> [1 of 2] Compiling PluginUtils      ( src/PluginUtils.hs, nothing )
no-recursion> [2 of 2] Compiling NoRecursion      ( src/NoRecursion.hs, nothing )
no-recursion> Haddock coverage:
no-recursion> Warning: 'fst' is out of scope.
no-recursion>     If you qualify the identifier, haddock can try to link it anyway.
no-recursion> Warning: ':' is out of scope.
no-recursion>     If you qualify the identifier, haddock can try to link it anyway.
no-recursion> Warning: 'Opts' is ambiguous. It is defined
no-recursion>     * at src/NoRecursion.hs:50:13
no-recursion>     * at src/NoRecursion.hs:50:1
no-recursion>     You may be able to disambiguate the identifier by qualifying it or
no-recursion>     by specifying the type/value namespace explicitly.
no-recursion>     Defaulting to the one defined at src/NoRecursion.hs:50:1
no-recursion>  100% (  2 /  2) in 'NoRecursion'
vector> [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.o, dist/build/Data/Vector/Mutable.dyn_o )
vector> [13 of 23] Compiling Data.Vector      ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
no-recursion> Documentation created: dist/doc/html/no-recursion/,
no-recursion> dist/doc/html/no-recursion/no-recursion.txt
no-recursion> Preprocessing test suite 'doctests' for no-recursion-0.3.0.0...
no-recursion> Preprocessing test suite 'no-ignore-annotations' for no-recursion-0.3.0.0...
no-recursion> Preprocessing test suite 'annotations' for no-recursion-0.3.0.0...
no-recursion> Running phase: installPhase
no-recursion> Installing library in /nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/no-recursion-0.3.0.0-J4skRsBUeaM3XOLOOVqotc
no-recursion> Running phase: fixupPhase
no-recursion> shrinking RPATHs of ELF executables and libraries in /nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0
no-recursion> shrinking /nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1-f1e9/libHSno-recursion-0.3.0.0-J4skRsBUeaM3XOLOOVqotc-ghc9.8.1.so
no-recursion> checking for references to /build/ in /nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0...
no-recursion> patching script interpreter paths in /nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0
no-recursion> stripping (with command strip and flags -S -p) in  /nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0/lib
no-recursion> shrinking RPATHs of ELF executables and libraries in /nix/store/24crf3lalxy4hi6ri7237rs04m7l912l-no-recursion-0.3.0.0-doc
no-recursion> checking for references to /build/ in /nix/store/24crf3lalxy4hi6ri7237rs04m7l912l-no-recursion-0.3.0.0-doc...
no-recursion> patching script interpreter paths in /nix/store/24crf3lalxy4hi6ri7237rs04m7l912l-no-recursion-0.3.0.0-doc
no-recursion (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/24crf3lalxy4hi6ri7237rs04m7l912l-no-recursion-0.3.0.0-doc /nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0
no-recursion (post)> Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
no-recursion (post)> 
no-recursion (post)> Pushing /nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0 (533.55 KiB)
no-recursion (post)> Pushing /nix/store/24crf3lalxy4hi6ri7237rs04m7l912l-no-recursion-0.3.0.0-doc (337.12 KiB)
no-recursion (post)> 
no-recursion (post)> All done.
no-recursion (post)> added 2 signatures
no-recursion (post)> added 1 signatures
no-recursion (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/24crf3lalxy4hi6ri7237rs04m7l912l-no-recursion-0.3.0.0-doc /nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0
no-recursion (post)> copying 2 paths...
no-recursion (post)> copying path '/nix/store/24crf3lalxy4hi6ri7237rs04m7l912l-no-recursion-0.3.0.0-doc' to 'https://cache.nix-ci.com'...
no-recursion (post)> copying path '/nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0' to 'https://cache.nix-ci.com'...
no-recursion (post)> copying 1 paths...
no-recursion (post)> copying path '/nix/store/1pq12dx42mf5sam3hkb11ddyl1rqzlm0-no-recursion-0.3.0.0.drv' to 'https://cache.nix-ci.com'...
no-recursion (post)> added 0 signatures
no-recursion (post)> added 0 signatures
no-recursion (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/24crf3lalxy4hi6ri7237rs04m7l912l-no-recursion-0.3.0.0-doc /nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0
no-recursion (post)> copying 2 paths...
no-recursion (post)> copying path '/nix/store/24crf3lalxy4hi6ri7237rs04m7l912l-no-recursion-0.3.0.0-doc' to 'ssh-ng://worker.nix-ci.com'...
no-recursion (post)> copying path '/nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0' to 'ssh-ng://worker.nix-ci.com'...
no-recursion (post)> copying 1 paths...
no-recursion (post)> copying path '/nix/store/1pq12dx42mf5sam3hkb11ddyl1rqzlm0-no-recursion-0.3.0.0.drv' to 'ssh-ng://worker.nix-ci.com'...
vector> [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.o, dist/build/Data/Vector/Primitive/Mutable.dyn_o )
vector> [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.o, dist/build/Data/Vector/Primitive.dyn_o )
vector> [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.o, dist/build/Data/Vector/Storable/Internal.dyn_o )
vector> [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.o, dist/build/Data/Vector/Storable/Mutable.dyn_o )
vector> [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.o, dist/build/Data/Vector/Storable.dyn_o )
vector> [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.o, dist/build/Data/Vector/Strict/Mutable.dyn_o )
vector> [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.o, dist/build/Data/Vector/Strict.dyn_o )
vector> [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.o, dist/build/Data/Vector/Unboxed/Base.dyn_o )
vector> [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.o, dist/build/Data/Vector/Unboxed.dyn_o )
vector> [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.o, dist/build/Data/Vector/Unboxed/Mutable.dyn_o )
vector> [ 1 of 23] Compiling Data.Vector.Fusion.Stream.Monadic ( src/Data/Vector/Fusion/Stream/Monadic.hs, dist/build/Data/Vector/Fusion/Stream/Monadic.p_o )
vector> [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
vector> [ 3 of 23] Compiling Data.Vector.Fusion.Bundle.Size ( src/Data/Vector/Fusion/Bundle/Size.hs, dist/build/Data/Vector/Fusion/Bundle/Size.p_o )
vector> [ 4 of 23] Compiling Data.Vector.Generic.Mutable.Base ( src/Data/Vector/Generic/Mutable/Base.hs, dist/build/Data/Vector/Generic/Mutable/Base.p_o )
vector> [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
vector> [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
vector> [ 7 of 23] Compiling Data.Vector.Fusion.Bundle.Monadic ( src/Data/Vector/Fusion/Bundle/Monadic.hs, dist/build/Data/Vector/Fusion/Bundle/Monadic.p_o )
vector> [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
vector> [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
vector> [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
vector> [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
vector> [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
vector> [13 of 23] Compiling Data.Vector      ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
vector> [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
vector> [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
vector> [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
vector> [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
vector> [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
vector> [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
vector> [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
vector> [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
vector> [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
vector> [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
vector> Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0..
vector> Building test suite 'vector-tests-O0' for vector-0.13.2.0..
vector> [ 1 of 12] Compiling Boilerplater     ( tests/Boilerplater.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Boilerplater.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Boilerplater.dyn_o )
vector> [ 2 of 12] Compiling Tests.Vector.UnitTests ( tests/Tests/Vector/UnitTests.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/UnitTests.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/UnitTests.dyn_o )
vector> [ 3 of 12] Compiling Utilities        ( tests/Utilities.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Utilities.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Utilities.dyn_o )
vector> 
vector> tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘tail’
vector>     (imported from Prelude, but defined in GHC.List):
vector>     "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
vector>     |
vector> 244 | postscanl f z = tail . scanl f z
vector>     |                 ^^^^
vector> 
vector> tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘tail’
vector>     (imported from Prelude, but defined in GHC.List):
vector>     "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
vector>     |
vector> 245 | prescanr f z = tail . scanr f z
vector>     |                ^^^^
vector> [ 4 of 12] Compiling Tests.Vector.Property ( tests/Tests/Vector/Property.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Property.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Property.dyn_o )
vector> 
vector> tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘head’
vector>     (imported from Data.List, but defined in GHC.List):
vector>     "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
vector>     |
vector> 243 |     prop_head      :: P (v a -> a) = not . V.null ===> V.head `eq` head
vector>     |                                                                    ^^^^
vector> 
vector> tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘head’
vector>     (imported from Data.List, but defined in GHC.List):
vector>     "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
vector>     |
vector> 256 |     prop_unsafeHead  :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
vector>     |                                                                            ^^^^
vector> 
vector> tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘tail’
vector>     (imported from Data.List, but defined in GHC.List):
vector>     "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
vector>     |
vector> 272 |     prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
vector>     |                                                                 ^^^^
vector> 
vector> tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘head’
vector>     (imported from Data.List, but defined in GHC.List):
vector>     "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
vector>     |
vector> 439 |       = V.uniq `eq` (map head . group)
vector>     |                          ^^^^
vector> [ 5 of 12] Compiling Tests.Vector.Unboxed ( tests/Tests/Vector/Unboxed.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Unboxed.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Unboxed.dyn_o )
vector> [ 6 of 12] Compiling Tests.Vector.Strict ( tests/Tests/Vector/Strict.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Strict.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Strict.dyn_o )
vector> [ 7 of 12] Compiling Tests.Vector.Storable ( tests/Tests/Vector/Storable.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Storable.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Storable.dyn_o )
vector> [ 8 of 12] Compiling Tests.Vector.Primitive ( tests/Tests/Vector/Primitive.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Primitive.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Primitive.dyn_o )
vector> [ 9 of 12] Compiling Tests.Vector.Boxed ( tests/Tests/Vector/Boxed.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Boxed.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Vector/Boxed.dyn_o )
vector> [10 of 12] Compiling Tests.Move       ( tests/Tests/Move.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Move.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Move.dyn_o )
vector> [11 of 12] Compiling Tests.Bundle     ( tests/Tests/Bundle.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Bundle.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Tests/Bundle.dyn_o )
vector> 
vector> tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘head’
vector>     (imported from Prelude, but defined in GHC.List):
vector>     "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
vector>    |
vector> 76 |     prop_head      :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
vector>    |                                                                             ^^^^
vector> 
vector> tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘tail’
vector>     (imported from Prelude, but defined in GHC.List):
vector>     "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
vector>    |
vector> 92 |     prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
vector>    |                                                                                   ^^^^
vector> [12 of 12] Compiling Main             ( tests/Main.hs, dist/build/vector-tests-O0/vector-tests-O0-tmp/Main.o, dist/build/vector-tests-O0/vector-tests-O0-tmp/Main.dyn_o )
vector> [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
vector> Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0..
vector> Building test suite 'vector-tests-O2' for vector-0.13.2.0..
vector> [ 1 of 12] Compiling Boilerplater     ( tests/Boilerplater.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Boilerplater.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Boilerplater.dyn_o )
vector> [ 2 of 12] Compiling Tests.Vector.UnitTests ( tests/Tests/Vector/UnitTests.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/UnitTests.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/UnitTests.dyn_o )
vector> [ 3 of 12] Compiling Utilities        ( tests/Utilities.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Utilities.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Utilities.dyn_o )
vector> 
vector> tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘tail’
vector>     (imported from Prelude, but defined in GHC.List):
vector>     "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
vector>     |
vector> 244 | postscanl f z = tail . scanl f z
vector>     |                 ^^^^
vector> 
vector> tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘tail’
vector>     (imported from Prelude, but defined in GHC.List):
vector>     "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
vector>     |
vector> 245 | prescanr f z = tail . scanr f z
vector>     |                ^^^^
vector> [ 4 of 12] Compiling Tests.Vector.Property ( tests/Tests/Vector/Property.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Property.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Property.dyn_o )
vector> 
vector> tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘head’
vector>     (imported from Data.List, but defined in GHC.List):
vector>     "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
vector>     |
vector> 243 |     prop_head      :: P (v a -> a) = not . V.null ===> V.head `eq` head
vector>     |                                                                    ^^^^
vector> 
vector> tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘head’
vector>     (imported from Data.List, but defined in GHC.List):
vector>     "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
vector>     |
vector> 256 |     prop_unsafeHead  :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
vector>     |                                                                            ^^^^
vector> 
vector> tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘tail’
vector>     (imported from Data.List, but defined in GHC.List):
vector>     "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
vector>     |
vector> 272 |     prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
vector>     |                                                                 ^^^^
vector> 
vector> tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘head’
vector>     (imported from Data.List, but defined in GHC.List):
vector>     "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
vector>     |
vector> 439 |       = V.uniq `eq` (map head . group)
vector>     |                          ^^^^
vector> [ 5 of 12] Compiling Tests.Vector.Unboxed ( tests/Tests/Vector/Unboxed.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Unboxed.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Unboxed.dyn_o )
vector> [ 6 of 12] Compiling Tests.Vector.Strict ( tests/Tests/Vector/Strict.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Strict.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Strict.dyn_o )
vector> [ 7 of 12] Compiling Tests.Vector.Storable ( tests/Tests/Vector/Storable.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Storable.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Storable.dyn_o )
vector> [ 8 of 12] Compiling Tests.Vector.Primitive ( tests/Tests/Vector/Primitive.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Primitive.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Primitive.dyn_o )
vector> [ 9 of 12] Compiling Tests.Vector.Boxed ( tests/Tests/Vector/Boxed.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Boxed.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Boxed.dyn_o )
vector> [10 of 12] Compiling Tests.Move       ( tests/Tests/Move.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Move.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Move.dyn_o )
vector> [11 of 12] Compiling Tests.Bundle     ( tests/Tests/Bundle.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Bundle.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Bundle.dyn_o )
vector> 
vector> tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘head’
vector>     (imported from Prelude, but defined in GHC.List):
vector>     "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
vector>    |
vector> 76 |     prop_head      :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
vector>    |                                                                             ^^^^
vector> 
vector> tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
vector>     In the use of ‘tail’
vector>     (imported from Prelude, but defined in GHC.List):
vector>     "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
vector>    |
vector> 92 |     prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
vector>    |                                                                                   ^^^^
vector> [12 of 12] Compiling Main             ( tests/Main.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Main.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Main.dyn_o )
vector> [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
vector> Preprocessing library 'benchmarks-O2' for vector-0.13.2.0..
vector> Building library 'benchmarks-O2' for vector-0.13.2.0..
vector> [ 1 of 14] Compiling Bench.Vector.Algo.AwShCC ( benchlib/Bench/Vector/Algo/AwShCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/AwShCC.o, dist/build/benchmarks-O2/Bench/Vector/Algo/AwShCC.dyn_o )
vector> [ 2 of 14] Compiling Bench.Vector.Algo.FindIndexR ( benchlib/Bench/Vector/Algo/FindIndexR.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.o, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.dyn_o )
vector> [ 3 of 14] Compiling Bench.Vector.Algo.HybCC ( benchlib/Bench/Vector/Algo/HybCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/HybCC.o, dist/build/benchmarks-O2/Bench/Vector/Algo/HybCC.dyn_o )
vector> [ 4 of 14] Compiling Bench.Vector.Algo.Leaffix ( benchlib/Bench/Vector/Algo/Leaffix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Leaffix.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Leaffix.dyn_o )
vector> [ 5 of 14] Compiling Bench.Vector.Algo.ListRank ( benchlib/Bench/Vector/Algo/ListRank.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/ListRank.o, dist/build/benchmarks-O2/Bench/Vector/Algo/ListRank.dyn_o )
vector> [ 6 of 14] Compiling Bench.Vector.Algo.MutableSet ( benchlib/Bench/Vector/Algo/MutableSet.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/MutableSet.o, dist/build/benchmarks-O2/Bench/Vector/Algo/MutableSet.dyn_o )
vector> [ 7 of 14] Compiling Bench.Vector.Algo.NextPermutation ( benchlib/Bench/Vector/Algo/NextPermutation.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/NextPermutation.o, dist/build/benchmarks-O2/Bench/Vector/Algo/NextPermutation.dyn_o )
vector> [ 8 of 14] Compiling Bench.Vector.Algo.Quickhull ( benchlib/Bench/Vector/Algo/Quickhull.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Quickhull.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Quickhull.dyn_o )
vector> [ 9 of 14] Compiling Bench.Vector.Algo.Rootfix ( benchlib/Bench/Vector/Algo/Rootfix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Rootfix.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Rootfix.dyn_o )
vector> [10 of 14] Compiling Bench.Vector.Algo.Spectral ( benchlib/Bench/Vector/Algo/Spectral.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Spectral.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Spectral.dyn_o )
vector> [11 of 14] Compiling Bench.Vector.Algo.Tridiag ( benchlib/Bench/Vector/Algo/Tridiag.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Tridiag.o, dist/build/benchmarks-O2/Bench/Vector/Algo/Tridiag.dyn_o )
vector> [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.o, dist/build/benchmarks-O2/Bench/Vector/Tasty.dyn_o )
vector> [13 of 14] Compiling Bench.Vector.TestData.Graph ( benchlib/Bench/Vector/TestData/Graph.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/Graph.o, dist/build/benchmarks-O2/Bench/Vector/TestData/Graph.dyn_o )
vector> [14 of 14] Compiling Bench.Vector.TestData.ParenTree ( benchlib/Bench/Vector/TestData/ParenTree.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/ParenTree.o, dist/build/benchmarks-O2/Bench/Vector/TestData/ParenTree.dyn_o )
vector> [ 1 of 14] Compiling Bench.Vector.Algo.AwShCC ( benchlib/Bench/Vector/Algo/AwShCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/AwShCC.p_o )
vector> [ 2 of 14] Compiling Bench.Vector.Algo.FindIndexR ( benchlib/Bench/Vector/Algo/FindIndexR.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/FindIndexR.p_o )
vector> [ 3 of 14] Compiling Bench.Vector.Algo.HybCC ( benchlib/Bench/Vector/Algo/HybCC.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/HybCC.p_o )
vector> [ 4 of 14] Compiling Bench.Vector.Algo.Leaffix ( benchlib/Bench/Vector/Algo/Leaffix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Leaffix.p_o )
vector> [ 5 of 14] Compiling Bench.Vector.Algo.ListRank ( benchlib/Bench/Vector/Algo/ListRank.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/ListRank.p_o )
vector> [ 6 of 14] Compiling Bench.Vector.Algo.MutableSet ( benchlib/Bench/Vector/Algo/MutableSet.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/MutableSet.p_o )
vector> [ 7 of 14] Compiling Bench.Vector.Algo.NextPermutation ( benchlib/Bench/Vector/Algo/NextPermutation.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/NextPermutation.p_o )
vector> [ 8 of 14] Compiling Bench.Vector.Algo.Quickhull ( benchlib/Bench/Vector/Algo/Quickhull.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Quickhull.p_o )
vector> [ 9 of 14] Compiling Bench.Vector.Algo.Rootfix ( benchlib/Bench/Vector/Algo/Rootfix.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Rootfix.p_o )
vector> [10 of 14] Compiling Bench.Vector.Algo.Spectral ( benchlib/Bench/Vector/Algo/Spectral.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Spectral.p_o )
vector> [11 of 14] Compiling Bench.Vector.Algo.Tridiag ( benchlib/Bench/Vector/Algo/Tridiag.hs, dist/build/benchmarks-O2/Bench/Vector/Algo/Tridiag.p_o )
vector> [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
vector> [13 of 14] Compiling Bench.Vector.TestData.Graph ( benchlib/Bench/Vector/TestData/Graph.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/Graph.p_o )
vector> [14 of 14] Compiling Bench.Vector.TestData.ParenTree ( benchlib/Bench/Vector/TestData/ParenTree.hs, dist/build/benchmarks-O2/Bench/Vector/TestData/ParenTree.p_o )
vector> Preprocessing test suite 'vector-inspection' for vector-0.13.2.0..
vector> Building test suite 'vector-inspection' for vector-0.13.2.0..
vector> [1 of 4] Compiling Inspect          ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
vector> [2 of 4] Compiling Inspect.DerivingVia.OtherFoo ( tests-inspect/Inspect/DerivingVia/OtherFoo.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia/OtherFoo.o, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia/OtherFoo.dyn_o )
vector> [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
vector> [4 of 4] Compiling Main             ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
vector> [5 of 5] Linking dist/build/vector-inspection/vector-inspection
vector> Preprocessing test suite 'vector-doctest' for vector-0.13.2.0..
vector> Building test suite 'vector-doctest' for vector-0.13.2.0..
vector> [1 of 1] Compiling Main             ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
vector> [2 of 2] Linking dist/build/vector-doctest/vector-doctest
vector> buildPhase completed in 1 minutes 57 seconds
vector> Running phase: checkPhase
vector> Running 2 test suites...
vector> Test suite vector-tests-O0: RUNNING...
vector> toplevel
vector>   Data.Vector.Fusion.Bundle
vector>     fromList.toList == id:                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     toList.fromList == id:                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     eq:                                                                    OK
vector>       +++ OK, passed 100 tests.
vector>     length:                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     null:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     empty:                                                                 OK
vector>       +++ OK, passed 1 test.
vector>     singleton:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     replicate:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     cons:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     snoc:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     append:                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     head:                                                                  OK
vector>       +++ OK, passed 100 tests; 16 discarded.
vector>     last:                                                                  OK
vector>       +++ OK, passed 100 tests; 14 discarded.
vector>     index:                                                                 OK
vector>       +++ OK, passed 100 tests; 15 discarded.
vector>     extract:                                                               OK
vector>       +++ OK, passed 100 tests.
vector>     init:                                                                  OK
vector>       +++ OK, passed 100 tests; 19 discarded.
vector>     tail:                                                                  OK
vector>       +++ OK, passed 100 tests; 13 discarded.
vector>     take:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     drop:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     map:                                                                   OK
vector>       +++ OK, passed 100 tests.
vector>     zipWith:                                                               OK
vector>       +++ OK, passed 100 tests.
vector>     zipWith3:                                                              OK
vector>       +++ OK, passed 100 tests.
vector>     filter:                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     takeWhile:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     dropWhile:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     elem:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     notElem:                                                               OK
vector>       +++ OK, passed 100 tests.
vector>     find:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     findIndex:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     foldl:                                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     foldl1:                                                                OK
vector>       +++ OK, passed 100 tests; 15 discarded.
vector>     foldl':                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     foldl1':                                                               OK
vector>       +++ OK, passed 100 tests; 14 discarded.
vector>     foldr:                                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     foldr1:                                                                OK
vector>       +++ OK, passed 100 tests; 17 discarded.
vector>     prescanl:                                                              OK
vector>       +++ OK, passed 100 tests.
vector>     prescanl':                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     postscanl:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     postscanl':                                                            OK
vector>       +++ OK, passed 100 tests.
vector>     scanl:                                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     scanl':                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     scanl1:                                                                OK
vector>       +++ OK, passed 100 tests; 23 discarded.
vector>     scanl1':                                                               OK
vector>       +++ OK, passed 100 tests; 15 discarded.
vector>     concatMap:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     unfoldr:                                                               OK
vector>       +++ OK, passed 100 tests.
vector>     and:                                                                   OK
vector>       +++ OK, passed 100 tests.
vector>     or:                                                                    OK
vector>       +++ OK, passed 100 tests.
vector>   Tests.Vector.Boxed
vector>     Bool
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 25 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       fmap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       return:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       bind:                                                                OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mzip:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       munzip:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_pure:                                                    OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_appl:                                                    OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       alternative_empty:                                                   OK
vector>         +++ OK, passed 1 test.
vector>       alternative_or:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       sequence:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       sequence_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       and:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       or:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>     Int
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 25 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       fmap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       return:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       bind:                                                                OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mzip:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       munzip:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_pure:                                                    OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_appl:                                                    OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       alternative_empty:                                                   OK
vector>         +++ OK, passed 1 test.
vector>       alternative_or:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       sequence:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       sequence_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Tests.Vector.Primitive
vector>     Int
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 24 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 10 discarded.
vector>     Double
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       foldl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldr:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       ifoldl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 3 discarded.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Tests.Vector.Storable
vector>     Data.Vector.Storable.Vector (Int)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>     Data.Vector.Storable.Vector (Double)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       foldr':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       ifoldl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 4 discarded.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Tests.Vector.Strict
vector>     Bool
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 24 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       fmap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       return:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       bind:                                                                OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mzip:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       munzip:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_pure:                                                    OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_appl:                                                    OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       alternative_empty:                                                   OK
vector>         +++ OK, passed 1 test.
vector>       alternative_or:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       sequence:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       sequence_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       and:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       or:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>     Int
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 25 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 25 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 10 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       fmap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       return:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       bind:                                                                OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mzip:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       munzip:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_pure:                                                    OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_appl:                                                    OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       alternative_empty:                                                   OK
vector>         +++ OK, passed 1 test.
vector>       alternative_or:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       sequence:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       sequence_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Tests.Vector.Unboxed
vector>     ()
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 24 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>     (Bool)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       and:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       or:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>     (Int)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>     (Float)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 26 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 10 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 5 discarded.
vector>     (Double)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       foldr':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       ifoldl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 2 discarded.
vector>     (Int,Bool)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 26 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 10 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>     (Int,Bool,Int)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Data.Vector.Storable.Vector Alignment
vector>     Aligned Double:                                                        OK
vector>     Aligned Int:                                                           OK
vector>   Regression tests
vector>     enumFromTo crash #188
vector>       Word8:                                                               OK
vector>       Word16:                                                              OK
vector>       Word32:                                                              OK
vector>       Word64:                                                              OK
vector>       Word:                                                                OK
vector>       Int8:                                                                OK
vector>       Int16:                                                               OK
vector>       Int32:                                                               OK
vector>       Int64:                                                               OK
vector>       Int:                                                                 OK
vector>       Char:                                                                OK
vector>   Negative tests
vector>     slice out of bounds #257
vector>       Boxed
vector>         Negative ix:                                                       OK
vector>         Negative size:                                                     OK
vector>         Negative ix and size:                                              OK
vector>         Too large ix:                                                      OK
vector>         Too large size:                                                    OK
vector>         Too large ix and size:                                             OK
vector>         Overflow:                                                          OK
vector>         OutOfMemory:                                                       OK
vector>       Primitive
vector>         Negative ix:                                                       OK
vector>         Negative size:                                                     OK
vector>         Negative ix and size:                                              OK
vector>         Too large ix:                                                      OK
vector>         Too large size:                                                    OK
vector>         Too large ix and size:                                             OK
vector>         Overflow:                                                          OK
vector>         OutOfMemory:                                                       OK
vector>       Storable
vector>         Negative ix:                                                       OK
vector>         Negative size:                                                     OK
vector>         Negative ix and size:                                              OK
vector>         Too large ix:                                                      OK
vector>         Too large size:                                                    OK
vector>         Too large ix and size:                                             OK
vector>         Overflow:                                                          OK
vector>         OutOfMemory:                                                       OK
vector>       Unboxed
vector>         Negative ix:                                                       OK
vector>         Negative size:                                                     OK
vector>         Negative ix and size:                                              OK
vector>         Too large ix:                                                      OK
vector>         Too large size:                                                    OK
vector>         Too large ix and size:                                             OK
vector>         Overflow:                                                          OK
vector>         OutOfMemory:                                                       OK
vector>     take #282
vector>       Boxed:                                                               OK
vector>       Primitive:                                                           OK
vector>       Storable:                                                            OK
vector>       Unboxed:                                                             OK
vector>   Data.Vector
vector>     MonadFix:                                                              OK
vector>     toFromArray:                                                           OK
vector>     toFromArraySlice:                                                      OK
vector>     toFromArraySliceUnsafe:                                                OK
vector>     toFromMutableArray:                                                    OK
vector>   Data.Vector.Mutable (Move):                                              OK
vector>     +++ OK, passed 100 tests; 16 discarded.
vector>   Data.Vector.Primitive.Mutable (Move):                                    OK
vector>     +++ OK, passed 100 tests; 14 discarded.
vector>   Data.Vector.Unboxed.Mutable (Move):                                      OK
vector>     +++ OK, passed 100 tests; 17 discarded.
vector>   Data.Vector.Storable.Mutable (Move):                                     OK
vector>     +++ OK, passed 100 tests; 15 discarded.
vector>   Data.Vector.Generic.Mutable (nextPermutation):                           OK
vector>     +++ OK, passed 1 test.
vector>   Data.Vector.Generic.Mutable (prevPermutation):                           OK (0.01s)
vector>     +++ OK, passed 1 test.
vector>   Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
vector>     +++ OK, passed 100 tests.
vector>   Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
vector>     +++ OK, passed 100 tests.
vector> 
vector> All 2808 tests passed (12.29s)
vector> Test suite vector-tests-O0: PASS
vector> Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
vector> Test suite vector-tests-O2: RUNNING...
vector> toplevel
vector>   Data.Vector.Fusion.Bundle
vector>     fromList.toList == id:                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     toList.fromList == id:                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     eq:                                                                    OK
vector>       +++ OK, passed 100 tests.
vector>     length:                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     null:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     empty:                                                                 OK
vector>       +++ OK, passed 1 test.
vector>     singleton:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     replicate:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     cons:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     snoc:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     append:                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     head:                                                                  OK
vector>       +++ OK, passed 100 tests; 13 discarded.
vector>     last:                                                                  OK
vector>       +++ OK, passed 100 tests; 18 discarded.
vector>     index:                                                                 OK
vector>       +++ OK, passed 100 tests; 12 discarded.
vector>     extract:                                                               OK
vector>       +++ OK, passed 100 tests.
vector>     init:                                                                  OK
vector>       +++ OK, passed 100 tests; 15 discarded.
vector>     tail:                                                                  OK
vector>       +++ OK, passed 100 tests; 15 discarded.
vector>     take:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     drop:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     map:                                                                   OK
vector>       +++ OK, passed 100 tests.
vector>     zipWith:                                                               OK
vector>       +++ OK, passed 100 tests.
vector>     zipWith3:                                                              OK
vector>       +++ OK, passed 100 tests.
vector>     filter:                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     takeWhile:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     dropWhile:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     elem:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     notElem:                                                               OK
vector>       +++ OK, passed 100 tests.
vector>     find:                                                                  OK
vector>       +++ OK, passed 100 tests.
vector>     findIndex:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     foldl:                                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     foldl1:                                                                OK
vector>       +++ OK, passed 100 tests; 25 discarded.
vector>     foldl':                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     foldl1':                                                               OK
vector>       +++ OK, passed 100 tests; 16 discarded.
vector>     foldr:                                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     foldr1:                                                                OK
vector>       +++ OK, passed 100 tests; 15 discarded.
vector>     prescanl:                                                              OK
vector>       +++ OK, passed 100 tests.
vector>     prescanl':                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     postscanl:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     postscanl':                                                            OK
vector>       +++ OK, passed 100 tests.
vector>     scanl:                                                                 OK
vector>       +++ OK, passed 100 tests.
vector>     scanl':                                                                OK
vector>       +++ OK, passed 100 tests.
vector>     scanl1:                                                                OK
vector>       +++ OK, passed 100 tests; 15 discarded.
vector>     scanl1':                                                               OK
vector>       +++ OK, passed 100 tests; 13 discarded.
vector>     concatMap:                                                             OK
vector>       +++ OK, passed 100 tests.
vector>     unfoldr:                                                               OK
vector>       +++ OK, passed 100 tests.
vector>     and:                                                                   OK
vector>       +++ OK, passed 100 tests.
vector>     or:                                                                    OK
vector>       +++ OK, passed 100 tests.
vector>   Tests.Vector.Boxed
vector>     Bool
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       fmap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       return:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       bind:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mzip:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       munzip:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_pure:                                                    OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_appl:                                                    OK
vector>         +++ OK, passed 100 tests.
vector>       alternative_empty:                                                   OK
vector>         +++ OK, passed 1 test.
vector>       alternative_or:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       sequence:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       sequence_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       and:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       or:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>     Int
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       fmap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       return:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       bind:                                                                OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mzip:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       munzip:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_pure:                                                    OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_appl:                                                    OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       alternative_empty:                                                   OK
vector>         +++ OK, passed 1 test.
vector>       alternative_or:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       sequence:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       sequence_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Tests.Vector.Primitive
vector>     Int
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 10 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 10 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 10 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>     Double
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       foldl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       foldr:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       foldr':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       ifoldl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Tests.Vector.Storable
vector>     Data.Vector.Storable.Vector (Int)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>     Data.Vector.Storable.Vector (Double)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       ifoldl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Tests.Vector.Strict
vector>     Bool
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       fmap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       return:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       bind:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mzip:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       munzip:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_pure:                                                    OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_appl:                                                    OK
vector>         +++ OK, passed 100 tests.
vector>       alternative_empty:                                                   OK
vector>         +++ OK, passed 1 test.
vector>       alternative_or:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       sequence:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       sequence_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       and:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       or:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>     Int
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 24 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       fmap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       return:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       bind:                                                                OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mzip:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       munzip:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_pure:                                                    OK
vector>         +++ OK, passed 100 tests.
vector>       applicative_appl:                                                    OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       alternative_empty:                                                   OK
vector>         +++ OK, passed 1 test.
vector>       alternative_or:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       sequence:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       sequence_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Tests.Vector.Unboxed
vector>     ()
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 26 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>     (Bool)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 24 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       and:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       or:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>     (Int)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>     (Float)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 26 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 3 discarded.
vector>     (Double)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldr:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       ifoldl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       sum:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       product:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromN:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromTo:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       enumFromThenTo:                                                      OK
vector>         +++ OK, passed 100 tests; 5 discarded.
vector>     (Int,Bool)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 11 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 27 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 20 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 19 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>     (Int,Bool,Int)
vector>       fromList.toList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       toList.fromList == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unstream.stream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       stream.unstream == id:                                               OK
vector>         +++ OK, passed 100 tests.
vector>       eq:                                                                  OK
vector>         +++ OK, passed 100 tests.
vector>       length:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       null:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       index:                                                               OK
vector>         +++ OK, passed 100 tests; 21 discarded.
vector>       safeIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       head:                                                                OK
vector>         +++ OK, passed 100 tests; 15 discarded.
vector>       last:                                                                OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       unsafeIndex:                                                         OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       unsafeHead:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       unsafeLast:                                                          OK
vector>         +++ OK, passed 100 tests; 24 discarded.
vector>       slice:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       init:                                                                OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       tail:                                                                OK
vector>         +++ OK, passed 100 tests; 23 discarded.
vector>       take:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       drop:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       splitAt:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       empty:                                                               OK
vector>         +++ OK, passed 1 test.
vector>       singleton:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       replicate:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       generate:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       iterateNM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       generateM:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       replicateM:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       create:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       createT:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldr:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrN:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactN:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrNM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       unfoldrExactNM:                                                      OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       constructN:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       constructrN:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       cons:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       snoc:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       append:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       concat:                                                              OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       force:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       upd:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       accum:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       reverse:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       backpermute:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       map:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       imap:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       concatMap:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mapM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       forM:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       forM_:                                                               OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       imapM:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       imapM_:                                                              OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       zipWith:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       zipWith3:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       izipWith3:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       izipWithM_:                                                          OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       zipWithM:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       zipWithM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       filter:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifilter:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       filterM:                                                             OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       uniq:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       mapMaybe:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       imapMaybe:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       takeWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       dropWhile:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partition:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       partitionWith:                                                       OK
vector>         +++ OK, passed 100 tests.
vector>       span:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       break:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       spanR:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       breakR:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       groupBy:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       elem:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       notElem:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       find:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       findIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       findIndexR:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       findIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndex:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       elemIndices:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       foldl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1:                                                              OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       foldl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldl1':                                                             OK
vector>         +++ OK, passed 100 tests; 12 discarded.
vector>       foldr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1:                                                              OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       foldr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       foldr1':                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       ifoldl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       ifoldM_:                                                             OK (0.04s)
vector>         +++ OK, passed 100 tests.
vector>       ifoldM'_:                                                            OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       all:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       any:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanl':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanl:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanl':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanl1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanl':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr:                                                            OK
vector>         +++ OK, passed 100 tests.
vector>       prescanr':                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       postscanr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       scanr:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       scanr':                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       scanr1':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       iscanr':                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mut_read:                                                            OK
vector>         +++ OK, passed 100 tests; 22 discarded.
vector>       mut_write:                                                           OK
vector>         +++ OK, passed 100 tests; 18 discarded.
vector>       mut_modify:                                                          OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       mut_generate:                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       mut_generateM:                                                       OK (0.01s)
vector>         +++ OK, passed 100 tests.
vector>       mut_mapM_:                                                           OK (0.02s)
vector>         +++ OK, passed 100 tests.
vector>       mut_imapM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_forM_:                                                           OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_iforM_:                                                          OK (0.03s)
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldr':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldl':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldr':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldl':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM:                                                           OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldM':                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_foldrM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM:                                                          OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldM':                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM:                                                         OK
vector>         +++ OK, passed 100 tests.
vector>       mut_ifoldrM':                                                        OK
vector>         +++ OK, passed 100 tests.
vector>       compare:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       maximum:                                                             OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       minimum:                                                             OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maxIndex:                                                            OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       maximumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       minimumBy:                                                           OK
vector>         +++ OK, passed 100 tests; 13 discarded.
vector>       maximumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minimumOn:                                                           OK
vector>         +++ OK, passed 100 tests; 17 discarded.
vector>       maxIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       minIndexBy:                                                          OK
vector>         +++ OK, passed 100 tests; 16 discarded.
vector>       ListFirstMaxIndexWins:                                               OK
vector>         +++ OK, passed 100 tests; 14 discarded.
vector>       FalseListFirstMaxIndexWins:                                          OK
vector>         +++ OK, failed as expected. (after 1 test):
vector>         Exception:
vector>           Prelude.foldr1: empty list
vector>           CallStack (from HasCallStack):
vector>             error, called at libraries/base/GHC/List.hs:1782:3 in base:GHC.List
vector>             errorEmptyList, called at libraries/base/GHC/List.hs:650:30 in base:GHC.List
vector>             foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
vector>         []
vector>       zip:                                                                 OK
vector>         +++ OK, passed 100 tests.
vector>       zip3:                                                                OK
vector>         +++ OK, passed 100 tests.
vector>       unzip:                                                               OK
vector>         +++ OK, passed 100 tests.
vector>       unzip3:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       indexed:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       update:                                                              OK
vector>         +++ OK, passed 100 tests.
vector>       mempty:                                                              OK
vector>         +++ OK, passed 1 test.
vector>       mappend:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>       mconcat:                                                             OK (0.05s)
vector>         +++ OK, passed 100 tests.
vector>       glength:                                                             OK
vector>         +++ OK, passed 100 tests.
vector>     unstream
vector>       unstream == vunstream (exact):                                       OK
vector>         +++ OK, passed 100 tests.
vector>       unstream == vunstream (unknown):                                     OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (exact):                                      OK
vector>         +++ OK, passed 100 tests.
vector>       unstreamR ~= vunstream (unknown):                                    OK
vector>         +++ OK, passed 100 tests.
vector>   Data.Vector.Storable.Vector Alignment
vector>     Aligned Double:                                                        OK
vector>     Aligned Int:                                                           OK
vector>   Regression tests
vector>     enumFromTo crash #188
vector>       Word8:                                                               OK
vector>       Word16:                                                              OK
vector>       Word32:                                                              OK
vector>       Word64:                                                              OK
vector>       Word:                                                                OK
vector>       Int8:                                                                OK
vector>       Int16:                                                               OK
vector>       Int32:                                                               OK
vector>       Int64:                                                               OK
vector>       Int:                                                                 OK
vector>       Char:                                                                OK
vector>   Negative tests
vector>     slice out of bounds #257
vector>       Boxed
vector>         Negative ix:                                                       OK
vector>         Negative size:                                                     OK
vector>         Negative ix and size:                                              OK
vector>         Too large ix:                                                      OK
vector>         Too large size:                                                    OK
vector>         Too large ix and size:                                             OK
vector>         Overflow:                                                          OK
vector>         OutOfMemory:                                                       OK
vector>       Primitive
vector>         Negative ix:                                                       OK
vector>         Negative size:                                                     OK
vector>         Negative ix and size:                                              OK
vector>         Too large ix:                                                      OK
vector>         Too large size:                                                    OK
vector>         Too large ix and size:                                             OK
vector>         Overflow:                                                          OK
vector>         OutOfMemory:                                                       OK
vector>       Storable
vector>         Negative ix:                                                       OK
vector>         Negative size:                                                     OK
vector>         Negative ix and size:                                              OK
vector>         Too large ix:                                                      OK
vector>         Too large size:                                                    OK
vector>         Too large ix and size:                                             OK
vector>         Overflow:                                                          OK
vector>         OutOfMemory:                                                       OK
vector>       Unboxed
vector>         Negative ix:                                                       OK
vector>         Negative size:                                                     OK
vector>         Negative ix and size:                                              OK
vector>         Too large ix:                                                      OK
vector>         Too large size:                                                    OK
vector>         Too large ix and size:                                             OK
vector>         Overflow:                                                          OK
vector>         OutOfMemory:                                                       OK
vector>     take #282
vector>       Boxed:                                                               OK
vector>       Primitive:                                                           OK
vector>       Storable:                                                            OK
vector>       Unboxed:                                                             OK
vector>   Data.Vector
vector>     MonadFix:                                                              OK
vector>     toFromArray:                                                           OK
vector>     toFromArraySlice:                                                      OK
vector>     toFromArraySliceUnsafe:                                                OK
vector>     toFromMutableArray:                                                    OK
vector>   Data.Vector.Mutable (Move):                                              OK
vector>     +++ OK, passed 100 tests; 15 discarded.
vector>   Data.Vector.Primitive.Mutable (Move):                                    OK
vector>     +++ OK, passed 100 tests; 17 discarded.
vector>   Data.Vector.Unboxed.Mutable (Move):                                      OK
vector>     +++ OK, passed 100 tests; 17 discarded.
vector>   Data.Vector.Storable.Mutable (Move):                                     OK
vector>     +++ OK, passed 100 tests; 17 discarded.
vector>   Data.Vector.Generic.Mutable (nextPermutation):                           OK
vector>     +++ OK, passed 1 test.
vector>   Data.Vector.Generic.Mutable (prevPermutation):                           OK
vector>     +++ OK, passed 1 test.
vector>   Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
vector>     +++ OK, passed 100 tests.
vector>   Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
vector>     +++ OK, passed 100 tests.
vector> 
vector> All 2808 tests passed (10.32s)
vector> Test suite vector-tests-O2: PASS
vector> Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
vector> 2 of 2 test suites (2 of 2 test cases) passed.
vector> Running phase: haddockPhase
vector> Running phase: installPhase
vector> Installing library in /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/vector-0.13.2.0-KITycIPQp0R25115diGgzh
vector> Installing internal library benchmarks-O2 in /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/vector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2
vector> Running phase: fixupPhase
vector> shrinking RPATHs of ELF executables and libraries in /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0
vector> shrinking /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSvector-0.13.2.0-7L8o32aWrc7EtPdmY4JHZe-benchmarks-O2-ghc9.8.1.so
vector> shrinking /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSvector-0.13.2.0-KITycIPQp0R25115diGgzh-ghc9.8.1.so
vector> checking for references to /build/ in /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0...
vector> patching script interpreter paths in /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0
vector> stripping (with command strip and flags -S -p) in  /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0/lib
vector (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0
vector (post)> Pushing 1 paths (93 are already present) using zstd to cache sellout ⏳
vector (post)> 
vector (post)> Pushing /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0 (57.19 MiB)
vector (post)> 
vector (post)> All done.
vector (post)> added 1 signatures
vector (post)> added 7 signatures
vector (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0
vector (post)> copying 1 paths...
vector (post)> copying path '/nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
vector (post)> copying 1 paths...
vector (post)> copying path '/nix/store/2arh61w9mwa0zd7rw90cl46s5agma11k-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...
vector (post)> added 0 signatures
vector (post)> added 0 signatures
vector (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0
vector (post)> copying 1 paths...
vector (post)> copying path '/nix/store/4cjsy3i6fs4jig907xdvjj3mj1gk9kwi-vector-0.13.2.0' to 'ssh-ng://worker.nix-ci.com'...
vector (post)> copying 1 paths...
vector (post)> copying path '/nix/store/2arh61w9mwa0zd7rw90cl46s5agma11k-vector-0.13.2.0.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/f4j26b5i6a9d3qcvfadkl4jqpf5w9cvv-nothunks-0.3.0.0.drv'...
nothunks> Running phase: setupCompilerEnvironmentPhase
nothunks> Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
nothunks> Running phase: unpackPhase
nothunks> unpacking source archive /nix/store/wzdyx5j9ylkjc475kaylxv5w38vhyy44-nothunks-0.3.0.0.tar.gz
nothunks> source root is nothunks-0.3.0.0
nothunks> setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.0.0/test/Test/NoThunks/Class.hs"
nothunks> Running phase: patchPhase
nothunks> Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.0.0/revision/1.cabal.
nothunks> Run jailbreak-cabal to lift version restrictions on build inputs.
nothunks> Running phase: compileBuildDriverPhase
nothunks> setupCompileFlags: -package-db=/build/tmp.7IzGfKhhxI/setup-package.conf.d -threaded
nothunks> [1 of 2] Compiling Main             ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.7IzGfKhhxI/Main.o )
nothunks> [2 of 2] Linking Setup
nothunks> Running phase: updateAutotoolsGnuConfigScriptsPhase
nothunks> Running phase: configurePhase
nothunks> configureFlags: --verbose --prefix=/nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/mzswv9lll0l5d14hwq5lia81ci9nfc41-nothunks-0.3.0.0-doc/share/doc/nothunks-0.3.0.0 --with-gcc=gcc --package-db=/build/tmp.7IzGfKhhxI/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
nothunks> Using Parsec parser
nothunks> Configuring nothunks-0.3.0.0...
nothunks> Flags chosen: bytestring=True, text=True, vector=True
nothunks> Dependency base: using base-4.19.0.0
nothunks> Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.0.2
nothunks> Dependency containers: using containers-0.6.8
nothunks> Dependency ghc-heap: using ghc-heap-9.8.1
nothunks> Dependency stm: using stm-2.5.2.1
nothunks> Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1
nothunks> Dependency time: using time-1.12.2
nothunks> Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
nothunks> Dependency wherefrom-compat >=0.1.1 && <0.2: using wherefrom-compat-0.1.1.1
nothunks> Dependency base: using base-4.19.0.0
nothunks> Dependency containers: using containers-0.6.8
nothunks> Dependency ghc-prim: using ghc-prim-0.11.0
nothunks> Dependency hedgehog: using hedgehog-1.5
nothunks> Dependency nothunks: using nothunks-0.3.0.0
nothunks> Dependency random: using random-1.2.1.3
nothunks> Dependency stm: using stm-2.5.2.1
nothunks> Dependency tasty: using tasty-1.5.3
nothunks> Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
nothunks> Source component graph:
nothunks>     component lib
nothunks>     component test:nothunks-test dependency lib
nothunks> Configured component graph:
nothunks>     component nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
nothunks>         include base-4.19.0.0-b960
nothunks>         include bytestring-0.12.0.2-4690
nothunks>         include containers-0.6.8-4775
nothunks>         include ghc-heap-9.8.1-6b37
nothunks>         include stm-2.5.2.1-83fa
nothunks>         include text-2.1-c36a
nothunks>         include time-1.12.2-d26d
nothunks>         include vector-0.13.2.0-KITycIPQp0R25115diGgzh
nothunks>         include wherefrom-compat-0.1.1.1-3Sxrs3BzJs08HbomO9TZjn
nothunks>     component nothunks-0.3.0.0-LYjtYcIcjmw181oNqsR7aE-nothunks-test
nothunks>         include base-4.19.0.0-b960
nothunks>         include containers-0.6.8-4775
nothunks>         include ghc-prim-0.11.0-a69e
nothunks>         include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
nothunks>         include nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
nothunks>         include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
nothunks>         include stm-2.5.2.1-83fa
nothunks>         include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
nothunks>         include tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t
nothunks> Linked component graph:
nothunks>     unit nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
nothunks>         include base-4.19.0.0-b960
nothunks>         include bytestring-0.12.0.2-4690
nothunks>         include containers-0.6.8-4775
nothunks>         include ghc-heap-9.8.1-6b37
nothunks>         include stm-2.5.2.1-83fa
nothunks>         include text-2.1-c36a
nothunks>         include time-1.12.2-d26d
nothunks>         include vector-0.13.2.0-KITycIPQp0R25115diGgzh
nothunks>         include wherefrom-compat-0.1.1.1-3Sxrs3BzJs08HbomO9TZjn
nothunks>         NoThunks.Class=nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg:NoThunks.Class
nothunks>     unit nothunks-0.3.0.0-LYjtYcIcjmw181oNqsR7aE-nothunks-test
nothunks>         include base-4.19.0.0-b960
nothunks>         include containers-0.6.8-4775
nothunks>         include ghc-prim-0.11.0-a69e
nothunks>         include hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
nothunks>         include nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
nothunks>         include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
nothunks>         include stm-2.5.2.1-83fa
nothunks>         include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
nothunks>         include tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t
nothunks> Ready component graph:
nothunks>     definite nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
nothunks>         depends base-4.19.0.0-b960
nothunks>         depends bytestring-0.12.0.2-4690
nothunks>         depends containers-0.6.8-4775
nothunks>         depends ghc-heap-9.8.1-6b37
nothunks>         depends stm-2.5.2.1-83fa
nothunks>         depends text-2.1-c36a
nothunks>         depends time-1.12.2-d26d
nothunks>         depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
nothunks>         depends wherefrom-compat-0.1.1.1-3Sxrs3BzJs08HbomO9TZjn
nothunks>     definite nothunks-0.3.0.0-LYjtYcIcjmw181oNqsR7aE-nothunks-test
nothunks>         depends base-4.19.0.0-b960
nothunks>         depends containers-0.6.8-4775
nothunks>         depends ghc-prim-0.11.0-a69e
nothunks>         depends hedgehog-1.5-1B99eT9THHr5ZSpEl39tYK
nothunks>         depends nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
nothunks>         depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
nothunks>         depends stm-2.5.2.1-83fa
nothunks>         depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
nothunks>         depends tasty-hedgehog-1.4.0.2-3HTxjzkRHVKFpZeoZBll1t
nothunks> Using Cabal-3.10.2.0 compiled by ghc-9.8
nothunks> Using compiler: ghc-9.8.1
nothunks> Using install prefix:
nothunks> /nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0
nothunks> Executables installed in:
nothunks> /nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0/bin
nothunks> Libraries installed in:
nothunks> /nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
nothunks> Dynamic Libraries installed in:
nothunks> /nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
nothunks> Private executables installed in:
nothunks> /nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0/libexec/x86_64-linux-ghc-9.8.1/nothunks-0.3.0.0
nothunks> Data files installed in:
nothunks> /nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0/share/x86_64-linux-ghc-9.8.1/nothunks-0.3.0.0
nothunks> Documentation installed in:
nothunks> /nix/store/mzswv9lll0l5d14hwq5lia81ci9nfc41-nothunks-0.3.0.0-doc/share/doc/nothunks-0.3.0.0
nothunks> Configuration files installed in:
nothunks> /nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0/etc
nothunks> No alex found
nothunks> Using ar found on system at:
nothunks> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
nothunks> No c2hs found
nothunks> No cpphs found
nothunks> No doctest found
nothunks> Using gcc version 14.3.0 given by user at:
nothunks> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
nothunks> Using ghc version 9.8.1 found on system at:
nothunks> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
nothunks> Using ghc-pkg version 9.8.1 found on system at:
nothunks> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
nothunks> No ghcjs found
nothunks> No ghcjs-pkg found
nothunks> No greencard found
nothunks> Using haddock version 2.30.0 found on system at:
nothunks> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
nothunks> No happy found
nothunks> Using haskell-suite found on system at: haskell-suite-dummy-location
nothunks> Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
nothunks> No hmake found
nothunks> Using hpc version 0.69 found on system at:
nothunks> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
nothunks> Using hsc2hs version 0.68.10 found on system at:
nothunks> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
nothunks> Using hscolour version 1.25 found on system at:
nothunks> /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
nothunks> No jhc found
nothunks> Using ld found on system at:
nothunks> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
nothunks> No pkg-config found
nothunks> Using runghc version 9.8.1 found on system at:
nothunks> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
nothunks> Using strip version 2.44 found on system at:
nothunks> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
nothunks> Using tar found on system at:
nothunks> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
nothunks> No uhc found
nothunks> Running phase: buildPhase
nothunks> Preprocessing library for nothunks-0.3.0.0..
nothunks> Building library for nothunks-0.3.0.0..
nothunks> [1 of 1] Compiling NoThunks.Class   ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
nothunks> [1 of 1] Compiling NoThunks.Class   ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
nothunks> Preprocessing test suite 'nothunks-test' for nothunks-0.3.0.0..
nothunks> Building test suite 'nothunks-test' for nothunks-0.3.0.0..
nothunks> [1 of 2] Compiling Test.NoThunks.Class ( test/Test/NoThunks/Class.hs, dist/build/nothunks-test/nothunks-test-tmp/Test/NoThunks/Class.o )
nothunks> [2 of 2] Compiling Main             ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
nothunks> [3 of 3] Linking dist/build/nothunks-test/nothunks-test
nothunks> Running phase: checkPhase
nothunks> Running 1 test suites...
nothunks> Test suite nothunks-test: RUNNING...
nothunks> Tests
nothunks>   NoThunks.Class
nothunks>     Sanity
nothunks>       IntNotNF:          OK
nothunks>           ✓ <interactive> passed 1 test.
nothunks>       IntIsNF:           OK
nothunks>           ✓ <interactive> passed 1 test.
nothunks>       Pair:              OK
nothunks>           ✓ <interactive> passed 1 test.
nothunks>       Sum:               OK
nothunks>           ✓ <interactive> passed 1 test.
nothunks>       Fn:                OK
nothunks>           ✓ <interactive> passed 1 test.
nothunks>       IO:                OK
nothunks>           ✓ <interactive> passed 1 test.
nothunks>     InspectHeap
nothunks>       Int:               OK (0.01s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int"] 50% ██████████··········
nothunks>             Nothing      50% █████████▉··········
nothunks>       IntInt:            OK (0.02s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int","Tuple2"] 38% ███████▋············
nothunks>             Just ["Tuple2"]       49% █████████▉··········
nothunks>             Nothing               12% ██▍·················
nothunks>       SumInt:            OK (0.01s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Either"]       35% ██████▉·············
nothunks>             Just ["Int","Either"] 32% ██████▌·············
nothunks>             Nothing               33% ██████▌·············
nothunks>       ListInt:           OK (0.02s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int","List"] 24% ████▋···············
nothunks>             Just ["List"]       44% ████████▉···········
nothunks>             Nothing             32% ██████▍·············
nothunks>       IntListInt:        OK (0.02s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int","List","Tuple2"]  5% ▉···················
nothunks>             Just ["Int","Tuple2"]        27% █████▎··············
nothunks>             Just ["List","Tuple2"]       10% █▉··················
nothunks>             Just ["Tuple2"]              49% █████████▊··········
nothunks>             Nothing                      10% █▉··················
nothunks>       SeqInt:              ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
nothunks>     after 8 tests and 1 shrink.
nothunks>     shrink path: 8:c
nothunks>     Just ["Int","Seq"] 25% █████···············
nothunks>     Nothing            62% ████████████▌·······
nothunks> 
nothunks>         ┏━━ test/Test/NoThunks/Class.hs ━━━
nothunks>     166 ┃ testWithModel :: forall a. FromModel a
nothunks>     167 ┃               => (Maybe ThunkInfo -> Maybe [String] -> Bool)
nothunks>     168 ┃               -> Proxy a
nothunks>     169 ┃               -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
nothunks>     170 ┃               -- can just be @(==)@; however, when we use 'isNormalForm', the
nothunks>     171 ┃               -- context we will get from the model will be too detailed.
nothunks>     172 ┃               -> Property
nothunks>     173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
nothunks>     174 ┃     m :: Model a <- forAll genModel
nothunks>         ┃     │ Wrap
nothunks>         ┃     │   { unwrap =
nothunks>         ┃     │       SeqEnqueue
nothunks>         ┃     │         (IntValue 0)
nothunks>         ┃     │         (SeqEnqueue
nothunks>         ┃     │            (IntValue 0)
nothunks>         ┃     │            (SeqEnqueue
nothunks>         ┃     │               (IntValue 0)
nothunks>         ┃     │               (SeqEnqueue
nothunks>         ┃     │                  (IntValue 0)
nothunks>         ┃     │                  (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
nothunks>         ┃     │   }
nothunks>     175 ┃     collect $ modelUnexpected [] m
nothunks>     176 ┃     fromModel m $ \a -> do
nothunks>     177 ┃       annotate $ show $ modelIsNF [] m
nothunks>         ┃       │ IsNF
nothunks>     178 ┃       isNF <- liftIO $ noThunks [] a
nothunks>     179 ┃       Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
nothunks>         ┃       ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
nothunks>         ┃       │ ━━━ Failed (- lhs) (+ rhs) ━━━
nothunks>         ┃       │ - Just
nothunks>         ┃       │ -   ThunkInfo
nothunks>         ┃       │ -     { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
nothunks>         ┃       │ + Nothing
nothunks> 
nothunks>     This failure can be reproduced by running:
nothunks>     > recheckAt (Seed 3294309595777122250 3398551881818566923) "8:c" EXPECTED FAILURE
nothunks> 
nothunks> OK (0.02s)
nothunks>           ✓ <interactive> passed 1 test.
nothunks>     Model
nothunks>       Int:               OK
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int"] 48% █████████▋··········
nothunks>             Nothing      52% ██████████▎·········
nothunks>       IntInt:            OK
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int","Tuple2"] 37% ███████▍············
nothunks>             Just ["Tuple2"]       52% ██████████▎·········
nothunks>             Nothing               11% ██▎·················
nothunks>       SumInt:            OK (0.01s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Either"]       34% ██████▋·············
nothunks>             Just ["Int","Either"] 34% ██████▋·············
nothunks>             Nothing               33% ██████▌·············
nothunks>       ListInt:           OK (0.02s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int","List"] 21% ████▏···············
nothunks>             Just ["List"]       44% ████████▉···········
nothunks>             Nothing             35% ██████▉·············
nothunks>       IntListInt:        OK (0.02s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int","List","Tuple2"]  4% ▊···················
nothunks>             Just ["Int","Tuple2"]        24% ████▉···············
nothunks>             Just ["List","Tuple2"]       10% █▉··················
nothunks>             Just ["Tuple2"]              54% ██████████▋·········
nothunks>             Nothing                       8% █▋··················
nothunks>       SeqInt:            OK (0.06s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int","Seq"] 43% ████████▌···········
nothunks>             Nothing            57% ███████████▍········
nothunks>       AllowThunksIn:     OK (0.02s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["Int","field2","Record"] 26% █████▏··············
nothunks>             Just ["Record"]                49% █████████▉··········
nothunks>             Nothing                        24% ████▉···············
nothunks>       Fn:                OK
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["->"] 24% ████▊···············
nothunks>             Nothing     76% ███████████████▏····
nothunks>       IO:                OK
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["IO"] 23% ████▋···············
nothunks>             Nothing     77% ███████████████▎····
nothunks>       ThunkFreeFn:       OK (0.01s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["->"]       23% ████▋···············
nothunks>             Just ["...","->"] 40% ███████▉············
nothunks>             Nothing           37% ███████▍············
nothunks>       ThunkFreeIO:       OK (0.01s)
nothunks>           ✓ <interactive> passed 1000 tests.
nothunks>             Just ["...","IO"] 38% ███████▌············
nothunks>             Just ["IO"]       26% █████▏··············
nothunks>             Nothing           37% ███████▎············
nothunks>     MutableVars
nothunks>       IORef
nothunks>         NotNF:           OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NF:              OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NotNFPure:       OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NFPure:          OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NotNFAtomically: OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NFAtomically:    OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>       MVar
nothunks>         NotNF:           OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NF:              OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NotNFPure:       OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NFPure:          OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NotNFAtomically: OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NFAtomically:    OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>       TVar
nothunks>         NotNF:           OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NF:              OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NotNFPure:       OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NFPure:          OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NotNFAtomically: OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks>         NFAtomically:    OK
nothunks>             ✓ <interactive> passed 1 test.
nothunks> 
nothunks> All 41 tests passed (0.32s)
nothunks> Test suite nothunks-test: PASS
nothunks> Test suite logged to: dist/test/nothunks-0.3.0.0-nothunks-test.log
nothunks> 1 of 1 test suites (1 of 1 test cases) passed.
nothunks> Running phase: haddockPhase
nothunks> Preprocessing library for nothunks-0.3.0.0..
nothunks> Running Haddock on library for nothunks-0.3.0.0..
nothunks> Warning: The documentation for the following packages are not installed. No
nothunks> links will be generated to these packages: vector-0.13.2.0
nothunks> Warning: --source-* options are ignored when --hyperlinked-source is enabled.
nothunks> [1 of 1] Compiling NoThunks.Class   ( src/NoThunks/Class.hs, nothing )
nothunks> Haddock coverage:
nothunks> Warning: 'AllowThunksIn' is ambiguous. It is defined
nothunks>     * at src/NoThunks/Class.hs:334:48
nothunks>     * at src/NoThunks/Class.hs:334:1
nothunks>     You may be able to disambiguate the identifier by qualifying it or
nothunks>     by specifying the type/value namespace explicitly.
nothunks>     Defaulting to the one defined at src/NoThunks/Class.hs:334:1
nothunks> Warning: 'InspectHeap' is ambiguous. It is defined
nothunks>     * at src/NoThunks/Class.hs:353:25
nothunks>     * at src/NoThunks/Class.hs:353:1
nothunks>     You may be able to disambiguate the identifier by qualifying it or
nothunks>     by specifying the type/value namespace explicitly.
nothunks>     Defaulting to the one defined at src/NoThunks/Class.hs:353:1
nothunks> Warning: 'InspectHeapNamed' is ambiguous. It is defined
nothunks>     * at src/NoThunks/Class.hs:358:47
nothunks>     * at src/NoThunks/Class.hs:358:1
nothunks>     You may be able to disambiguate the identifier by qualifying it or
nothunks>     by specifying the type/value namespace explicitly.
nothunks>     Defaulting to the one defined at src/NoThunks/Class.hs:358:1
nothunks> Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
nothunks>     * at src/NoThunks/Class.hs:308:27
nothunks>     * at src/NoThunks/Class.hs:308:1
nothunks>     You may be able to disambiguate the identifier by qualifying it or
nothunks>     by specifying the type/value namespace explicitly.
nothunks>     Defaulting to the one defined at src/NoThunks/Class.hs:308:1
nothunks> Warning: 'ThunkInfo' is ambiguous. It is defined
nothunks>     * at src/NoThunks/Class.hs:230:18
nothunks>     * at src/NoThunks/Class.hs:230:1
nothunks>     You may be able to disambiguate the identifier by qualifying it or
nothunks>     by specifying the type/value namespace explicitly.
nothunks>     Defaulting to the one defined at src/NoThunks/Class.hs:230:1
nothunks> Warning: 'GHC' is out of scope.
nothunks>     If you qualify the identifier, haddock can try to link it anyway.
nothunks> Warning: 'a' is out of scope.
nothunks>     If you qualify the identifier, haddock can try to link it anyway.
nothunks>   95% ( 20 / 21) in 'NoThunks.Class'
nothunks>   Missing documentation for:
nothunks>     Module header
nothunks> Warning: NoThunks.Class: could not find link destinations for:
nothunks>       - Data.Vector.Vector
nothunks>       - Data.Vector.Unboxed.Base.Vector
nothunks>       - NoThunks.Class.HasFields
nothunks>       - NoThunks.Class.Elem
nothunks>       - NoThunks.Class.GShowTypeOf
nothunks>       - NoThunks.Class.GWRecordField
nothunks>       - NoThunks.Class.checkContainsThunks
nothunks> Documentation created: dist/doc/html/nothunks/,
nothunks> dist/doc/html/nothunks/nothunks.txt
nothunks> Preprocessing test suite 'nothunks-test' for nothunks-0.3.0.0..
nothunks> Running phase: installPhase
nothunks> Installing library in /nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
nothunks> Running phase: fixupPhase
nothunks> shrinking RPATHs of ELF executables and libraries in /nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0
nothunks> shrinking /nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSnothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg-ghc9.8.1.so
nothunks> checking for references to /build/ in /nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0...
nothunks> patching script interpreter paths in /nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0
nothunks> stripping (with command strip and flags -S -p) in  /nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0/lib
nothunks> shrinking RPATHs of ELF executables and libraries in /nix/store/mzswv9lll0l5d14hwq5lia81ci9nfc41-nothunks-0.3.0.0-doc
nothunks> checking for references to /build/ in /nix/store/mzswv9lll0l5d14hwq5lia81ci9nfc41-nothunks-0.3.0.0-doc...
nothunks> patching script interpreter paths in /nix/store/mzswv9lll0l5d14hwq5lia81ci9nfc41-nothunks-0.3.0.0-doc
nothunks (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/mzswv9lll0l5d14hwq5lia81ci9nfc41-nothunks-0.3.0.0-doc /nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0
nothunks (post)> Pushing 2 paths (96 are already present) using zstd to cache sellout ⏳
nothunks (post)> 
nothunks (post)> Pushing /nix/store/mzswv9lll0l5d14hwq5lia81ci9nfc41-nothunks-0.3.0.0-doc (841.92 KiB)
nothunks (post)> Pushing /nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0 (2.71 MiB)
nothunks (post)> 
nothunks (post)> All done.
nothunks (post)> added 2 signatures
nothunks (post)> added 39 signatures
nothunks (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/mzswv9lll0l5d14hwq5lia81ci9nfc41-nothunks-0.3.0.0-doc /nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0
nothunks (post)> copying 2 paths...
nothunks (post)> copying path '/nix/store/mzswv9lll0l5d14hwq5lia81ci9nfc41-nothunks-0.3.0.0-doc' to 'https://cache.nix-ci.com'...
nothunks (post)> copying path '/nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0' to 'https://cache.nix-ci.com'...
nothunks (post)> copying 1 paths...
nothunks (post)> copying path '/nix/store/f4j26b5i6a9d3qcvfadkl4jqpf5w9cvv-nothunks-0.3.0.0.drv' to 'https://cache.nix-ci.com'...
nothunks (post)> added 0 signatures
nothunks (post)> added 0 signatures
nothunks (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/mzswv9lll0l5d14hwq5lia81ci9nfc41-nothunks-0.3.0.0-doc /nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0
nothunks (post)> copying 2 paths...
nothunks (post)> copying path '/nix/store/mzswv9lll0l5d14hwq5lia81ci9nfc41-nothunks-0.3.0.0-doc' to 'ssh-ng://worker.nix-ci.com'...
nothunks (post)> copying path '/nix/store/vk63dcsz6xnxjdx579c15bvwav7p661l-nothunks-0.3.0.0' to 'ssh-ng://worker.nix-ci.com'...
nothunks (post)> copying 1 paths...
nothunks (post)> copying path '/nix/store/f4j26b5i6a9d3qcvfadkl4jqpf5w9cvv-nothunks-0.3.0.0.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/8vllyaka6r2ssb8x8whnn3sl3aif235b-unordered-containers-0.2.20.drv'...
unordered-containers> Running phase: setupCompilerEnvironmentPhase
unordered-containers> Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
unordered-containers> Running phase: unpackPhase
unordered-containers> unpacking source archive /nix/store/46rvk8vjzsagr58a6pqwimivmr0ahxys-unordered-containers-0.2.20.tar.gz
unordered-containers> source root is unordered-containers-0.2.20
unordered-containers> setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20/unordered-containers.cabal"
unordered-containers> Running phase: patchPhase
unordered-containers> Replace Cabal file with edited version from mirror://hackage/unordered-containers-0.2.20/revision/4.cabal.
unordered-containers> Running phase: compileBuildDriverPhase
unordered-containers> setupCompileFlags: -package-db=/build/tmp.1y4gUiJlUC/setup-package.conf.d -threaded
unordered-containers> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.1y4gUiJlUC/Main.o )
unordered-containers> [2 of 2] Linking Setup
unordered-containers> Running phase: updateAutotoolsGnuConfigScriptsPhase
unordered-containers> Running phase: configurePhase
unordered-containers> configureFlags: --verbose --prefix=/nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/rdhmpkzwzwhiwayj81hlxnzbahjxsp0m-unordered-containers-0.2.20-doc/share/doc/unordered-containers-0.2.20 --with-gcc=gcc --package-db=/build/tmp.1y4gUiJlUC/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
unordered-containers> Using Parsec parser
unordered-containers> Configuring unordered-containers-0.2.20...
unordered-containers> Flags chosen: debug=False
unordered-containers> Dependency base >=4.10 && <5: using base-4.19.0.0
unordered-containers> Dependency deepseq >=1.4.3: using deepseq-1.5.0.0
unordered-containers> Dependency hashable >=1.4 && <1.6: using hashable-1.4.7.0
unordered-containers> Dependency template-haskell <2.24: using template-haskell-2.21.0.0
unordered-containers> Dependency ChasingBottoms: using ChasingBottoms-1.3.1.15
unordered-containers> Dependency HUnit: using HUnit-1.6.2.0
unordered-containers> Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.14.3
unordered-containers> Dependency base: using base-4.19.0.0
unordered-containers> Dependency containers >=0.5.8: using containers-0.6.8
unordered-containers> Dependency hashable: using hashable-1.4.7.0
unordered-containers> Dependency nothunks >=0.1.3: using nothunks-0.3.0.0
unordered-containers> Dependency random: using random-1.2.1.3
unordered-containers> Dependency tasty >=1.4.0.3: using tasty-1.5.3
unordered-containers> Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
unordered-containers> Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11
unordered-containers> Dependency unordered-containers: using unordered-containers-0.2.20
unordered-containers> Source component graph:
unordered-containers>     component lib
unordered-containers>     component test:unordered-containers-tests dependency lib
unordered-containers> Configured component graph:
unordered-containers>     component unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
unordered-containers>         include base-4.19.0.0-b960
unordered-containers>         include deepseq-1.5.0.0-412f
unordered-containers>         include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
unordered-containers>         include template-haskell-2.21.0.0-8831
unordered-containers>     component unordered-containers-0.2.20-2TSXkpknPL65rd0f1WFznb-unordered-containers-tests
unordered-containers>         include ChasingBottoms-1.3.1.15-FxwScYtjqvxDEc2cZ0Gn1W
unordered-containers>         include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
unordered-containers>         include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
unordered-containers>         include base-4.19.0.0-b960
unordered-containers>         include containers-0.6.8-4775
unordered-containers>         include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
unordered-containers>         include nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
unordered-containers>         include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
unordered-containers>         include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
unordered-containers>         include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
unordered-containers>         include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
unordered-containers>         include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
unordered-containers> Linked component graph:
unordered-containers>     unit unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
unordered-containers>         include base-4.19.0.0-b960
unordered-containers>         include deepseq-1.5.0.0-412f
unordered-containers>         include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
unordered-containers>         include template-haskell-2.21.0.0-8831
unordered-containers>         Data.HashMap.Internal=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq:Data.HashSet.Internal
unordered-containers>     unit unordered-containers-0.2.20-2TSXkpknPL65rd0f1WFznb-unordered-containers-tests
unordered-containers>         include ChasingBottoms-1.3.1.15-FxwScYtjqvxDEc2cZ0Gn1W
unordered-containers>         include HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
unordered-containers>         include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
unordered-containers>         include base-4.19.0.0-b960
unordered-containers>         include containers-0.6.8-4775
unordered-containers>         include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
unordered-containers>         include nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
unordered-containers>         include random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
unordered-containers>         include tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
unordered-containers>         include tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
unordered-containers>         include tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
unordered-containers>         include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
unordered-containers> Ready component graph:
unordered-containers>     definite unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
unordered-containers>         depends base-4.19.0.0-b960
unordered-containers>         depends deepseq-1.5.0.0-412f
unordered-containers>         depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
unordered-containers>         depends template-haskell-2.21.0.0-8831
unordered-containers>     definite unordered-containers-0.2.20-2TSXkpknPL65rd0f1WFznb-unordered-containers-tests
unordered-containers>         depends ChasingBottoms-1.3.1.15-FxwScYtjqvxDEc2cZ0Gn1W
unordered-containers>         depends HUnit-1.6.2.0-50gpUMp3FUq9RzcmwNFXK7
unordered-containers>         depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
unordered-containers>         depends base-4.19.0.0-b960
unordered-containers>         depends containers-0.6.8-4775
unordered-containers>         depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
unordered-containers>         depends nothunks-0.3.0.0-LpKvpym0PVoB3OrNohAIGg
unordered-containers>         depends random-1.2.1.3-LaY8qFAq8FCKPWMPExzIGX
unordered-containers>         depends tasty-1.5.3-Hx8ydk7vrhxHd5tQOzwMa
unordered-containers>         depends tasty-hunit-0.10.2-GAT5SRFtb4J1E18xB7FDjP
unordered-containers>         depends tasty-quickcheck-0.11-75RAuw01ZzpJtGBLaWEjo2
unordered-containers>         depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
unordered-containers> Using Cabal-3.10.2.0 compiled by ghc-9.8
unordered-containers> Using compiler: ghc-9.8.1
unordered-containers> Using install prefix:
unordered-containers> /nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20
unordered-containers> Executables installed in:
unordered-containers> /nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20/bin
unordered-containers> Libraries installed in:
unordered-containers> /nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
unordered-containers> Dynamic Libraries installed in:
unordered-containers> /nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
unordered-containers> Private executables installed in:
unordered-containers> /nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20/libexec/x86_64-linux-ghc-9.8.1/unordered-containers-0.2.20
unordered-containers> Data files installed in:
unordered-containers> /nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20/share/x86_64-linux-ghc-9.8.1/unordered-containers-0.2.20
unordered-containers> Documentation installed in:
unordered-containers> /nix/store/rdhmpkzwzwhiwayj81hlxnzbahjxsp0m-unordered-containers-0.2.20-doc/share/doc/unordered-containers-0.2.20
unordered-containers> Configuration files installed in:
unordered-containers> /nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20/etc
unordered-containers> No alex found
unordered-containers> Using ar found on system at:
unordered-containers> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
unordered-containers> No c2hs found
unordered-containers> No cpphs found
unordered-containers> No doctest found
unordered-containers> Using gcc version 14.3.0 given by user at:
unordered-containers> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
unordered-containers> Using ghc version 9.8.1 found on system at:
unordered-containers> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
unordered-containers> Using ghc-pkg version 9.8.1 found on system at:
unordered-containers> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
unordered-containers> No ghcjs found
unordered-containers> No ghcjs-pkg found
unordered-containers> No greencard found
unordered-containers> Using haddock version 2.30.0 found on system at:
unordered-containers> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
unordered-containers> No happy found
unordered-containers> Using haskell-suite found on system at: haskell-suite-dummy-location
unordered-containers> Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
unordered-containers> No hmake found
unordered-containers> Using hpc version 0.69 found on system at:
unordered-containers> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
unordered-containers> Using hsc2hs version 0.68.10 found on system at:
unordered-containers> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
unordered-containers> Using hscolour version 1.25 found on system at:
unordered-containers> /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
unordered-containers> No jhc found
unordered-containers> Using ld found on system at:
unordered-containers> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
unordered-containers> No pkg-config found
unordered-containers> Using runghc version 9.8.1 found on system at:
unordered-containers> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
unordered-containers> Using strip version 2.44 found on system at:
unordered-containers> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
unordered-containers> Using tar found on system at:
unordered-containers> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
unordered-containers> No uhc found
unordered-containers> Running phase: buildPhase
unordered-containers> Preprocessing library for unordered-containers-0.2.20..
unordered-containers> Building library for unordered-containers-0.2.20..
unordered-containers> 
unordered-containers> Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
unordered-containers>     -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
unordered-containers>    |
unordered-containers> 12 | {-# LANGUAGE TypeInType            #-}
unordered-containers>    |              ^^^^^^^^^^
unordered-containers> [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.o, dist/build/Data/HashMap/Internal/Array.dyn_o )
unordered-containers> 
unordered-containers> Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
unordered-containers>     The import of ‘Control.Applicative’ is redundant
unordered-containers>       except perhaps to import instances from ‘Control.Applicative’
unordered-containers>     To import instances alone, use: import Control.Applicative()
unordered-containers>    |
unordered-containers> 83 | import Control.Applicative (liftA2)
unordered-containers>    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
unordered-containers> [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.o, dist/build/Data/HashMap/Internal/List.dyn_o )
unordered-containers> [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.o, dist/build/Data/HashMap/Internal.dyn_o )
unordered-containers> [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.o, dist/build/Data/HashMap/Internal/Debug.dyn_o )
unordered-containers> [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.o, dist/build/Data/HashMap/Internal/Strict.dyn_o )
unordered-containers> [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.o, dist/build/Data/HashSet/Internal.dyn_o )
unordered-containers> [7 of 9] Compiling Data.HashSet     ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
unordered-containers> [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.o, dist/build/Data/HashMap/Strict.dyn_o )
unordered-containers> [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.o, dist/build/Data/HashMap/Lazy.dyn_o )
unordered-containers> 
unordered-containers> Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
unordered-containers>     -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
unordered-containers>    |
unordered-containers> 12 | {-# LANGUAGE TypeInType            #-}
unordered-containers>    |              ^^^^^^^^^^
unordered-containers> [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
unordered-containers> 
unordered-containers> Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
unordered-containers>     The import of ‘Control.Applicative’ is redundant
unordered-containers>       except perhaps to import instances from ‘Control.Applicative’
unordered-containers>     To import instances alone, use: import Control.Applicative()
unordered-containers>    |
unordered-containers> 83 | import Control.Applicative (liftA2)
unordered-containers>    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
unordered-containers> [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
unordered-containers> [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
unordered-containers> [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
unordered-containers> [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
unordered-containers> [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
unordered-containers> [7 of 9] Compiling Data.HashSet     ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
unordered-containers> [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
unordered-containers> [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
unordered-containers> Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20..
unordered-containers> Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20..
unordered-containers> [1 of 9] Compiling Properties.List  ( tests/Properties/List.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/List.o )
unordered-containers> [2 of 9] Compiling Regressions      ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
unordered-containers> 
unordered-containers> tests/Regressions.hs:91:16: warning: [GHC-63394] [-Wx-partial]
unordered-containers>     In the use of ‘head’
unordered-containers>     (imported from Prelude, but defined in GHC.List):
unordered-containers>     "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
unordered-containers>    |
unordered-containers> 91 |       k      = head keys
unordered-containers>    |                ^^^^
unordered-containers> [3 of 9] Compiling Util.Key         ( tests/Util/Key.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Util/Key.o )
unordered-containers> [4 of 9] Compiling Strictness       ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
unordered-containers> [5 of 9] Compiling Properties.HashSet ( tests/Properties/HashSet.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashSet.o )
unordered-containers> [6 of 9] Compiling Properties.HashMapStrict ( tests/Properties/HashMapStrict.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashMapStrict.o )
unordered-containers> [7 of 9] Compiling Properties.HashMapLazy ( tests/Properties/HashMapLazy.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashMapLazy.o )
unordered-containers> [8 of 9] Compiling Properties       ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
unordered-containers> [9 of 9] Compiling Main             ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
unordered-containers> [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
unordered-containers> Running phase: checkPhase
unordered-containers> Running 1 test suites...
unordered-containers> Test suite unordered-containers-tests: RUNNING...
unordered-containers> All
unordered-containers>   Properties
unordered-containers>     Data.HashMap.Lazy
unordered-containers>       instances
unordered-containers>         Eq
unordered-containers>           ==:                              OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           /=:                              OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         Ord
unordered-containers>           compare reflexive:               OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           compare transitive:              OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           compare antisymmetric:           OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           Ord => Eq:                       OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         Read/Show:                         OK (0.07s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         Functor:                           OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         Foldable:                          OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         Bifoldable
unordered-containers>           bifoldMap:                       OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           bifoldr:                         OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           bifoldl:                         OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         Hashable:                          OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       empty
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 1 test.
unordered-containers>       singleton
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       size:                                OK (0.01s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       member:                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       lookup:                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       !?:                                  OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       insert
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       insertWith
unordered-containers>         insertWith:                        OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       delete
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       adjust
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       update
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       alter
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       alterF
unordered-containers>         model
unordered-containers>           []:                              OK (0.02s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           adjust:                          OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           insert:                          OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           insertWith:                      OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           delete:                          OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           lookup:                          OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       isSubmapOf
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         m ⊆ m:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         m1 ⊆ m1 ∪ m2:                      OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         m1 ⊈ m2  ⇒  m1 ∪ m2 ⊈ m1:          OK
unordered-containers>           +++ OK, passed 100 tests; 17 discarded.
unordered-containers>         m1\m2 ⊆ m1:                        OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         m1 ∩ m2 ≠ ∅  ⇒  m1 ⊈ m1\m2 :       OK
unordered-containers>           +++ OK, passed 100 tests; 232 discarded.
unordered-containers>         delete k m ⊆ m:                    OK
unordered-containers>           +++ OK, passed 100 tests; 13 discarded.
unordered-containers>         m ⊈ delete k m :                   OK
unordered-containers>           +++ OK, passed 100 tests; 13 discarded.
unordered-containers>         k ∉ m  ⇒  m ⊆ insert k v m:        OK
unordered-containers>           +++ OK, passed 100 tests; 10 discarded.
unordered-containers>         k ∉ m  ⇒  insert k v m ⊈ m:        OK
unordered-containers>           +++ OK, passed 100 tests; 10 discarded.
unordered-containers>       union
unordered-containers>         model:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       unionWith
unordered-containers>         model:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       unionWithKey
unordered-containers>         model:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       unions
unordered-containers>         model:                             OK (0.26s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.18s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       difference
unordered-containers>         model:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       differenceWith
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       intersection
unordered-containers>         model:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       intersectionWith
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       intersectionWithKey
unordered-containers>         model:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       compose
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       map
unordered-containers>         model:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       traverseWithKey
unordered-containers>         model:                             OK (0.09s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       mapKeys
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.11s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       foldr:                               OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldl:                               OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldrWithKey:                        OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldlWithKey:                        OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldrWithKey':                       OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldlWithKey':                       OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldl':                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldr':                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldMapWithKey:                      OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       filter
unordered-containers>         model:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       filterWithKey
unordered-containers>         model:                             OK (0.31s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.14s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       mapMaybe
unordered-containers>         model:                             OK (0.03s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       mapMaybeWithKey
unordered-containers>         model:                             OK (0.39s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.17s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       elems:                               OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       keys:                                OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       fromList
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       fromListWith
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       fromListWithKey
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       toList:                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>     Data.HashMap.Strict
unordered-containers>       instances
unordered-containers>         Eq
unordered-containers>           ==:                              OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           /=:                              OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         Ord
unordered-containers>           compare reflexive:               OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           compare transitive:              OK (0.02s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           compare antisymmetric:           OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           Ord => Eq:                       OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         Read/Show:                         OK (0.11s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         Functor:                           OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         Foldable:                          OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         Bifoldable
unordered-containers>           bifoldMap:                       OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           bifoldr:                         OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           bifoldl:                         OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         Hashable:                          OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       empty
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 1 test.
unordered-containers>       singleton
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       size:                                OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       member:                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       lookup:                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       !?:                                  OK (0.01s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       insert
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       insertWith
unordered-containers>         insertWith:                        OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       delete
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       adjust
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       update
unordered-containers>         model:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       alter
unordered-containers>         model:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       alterF
unordered-containers>         model
unordered-containers>           []:                              OK (0.06s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           adjust:                          OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           insert:                          OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           insertWith:                      OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           delete:                          OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           lookup:                          OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       isSubmapOf
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         m ⊆ m:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         m1 ⊆ m1 ∪ m2:                      OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         m1 ⊈ m2  ⇒  m1 ∪ m2 ⊈ m1:          OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests; 17 discarded.
unordered-containers>         m1\m2 ⊆ m1:                        OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         m1 ∩ m2 ≠ ∅  ⇒  m1 ⊈ m1\m2 :       OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests; 213 discarded.
unordered-containers>         delete k m ⊆ m:                    OK
unordered-containers>           +++ OK, passed 100 tests; 22 discarded.
unordered-containers>         m ⊈ delete k m :                   OK
unordered-containers>           +++ OK, passed 100 tests; 17 discarded.
unordered-containers>         k ∉ m  ⇒  m ⊆ insert k v m:        OK
unordered-containers>           +++ OK, passed 100 tests; 10 discarded.
unordered-containers>         k ∉ m  ⇒  insert k v m ⊈ m:        OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests; 8 discarded.
unordered-containers>       union
unordered-containers>         model:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       unionWith
unordered-containers>         model:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       unionWithKey
unordered-containers>         model:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.03s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       unions
unordered-containers>         model:                             OK (0.34s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.31s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       difference
unordered-containers>         model:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       differenceWith
unordered-containers>         model:                             OK (0.03s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       intersection
unordered-containers>         model:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       intersectionWith
unordered-containers>         model:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       intersectionWithKey
unordered-containers>         model:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.03s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       compose
unordered-containers>         valid:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       map
unordered-containers>         model:                             OK (0.03s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       traverseWithKey
unordered-containers>         model:                             OK (0.10s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       mapKeys
unordered-containers>         model:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.11s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       foldr:                               OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldl:                               OK (0.01s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldrWithKey:                        OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldlWithKey:                        OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldrWithKey':                       OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldlWithKey':                       OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldl':                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldr':                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldMapWithKey:                      OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       filter
unordered-containers>         model:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       filterWithKey
unordered-containers>         model:                             OK (0.32s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.16s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       mapMaybe
unordered-containers>         model:                             OK (0.03s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       mapMaybeWithKey
unordered-containers>         model:                             OK (0.30s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.19s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       elems:                               OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       keys:                                OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       fromList
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       fromListWith
unordered-containers>         model:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       fromListWithKey
unordered-containers>         model:                             OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         valid:                             OK (0.02s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       toList:                              OK (0.01s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>     Data.HashSet
unordered-containers>       instances
unordered-containers>         Eq
unordered-containers>           ==:                              OK (0.02s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           == permutations:                 OK (0.01s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           /=:                              OK (0.02s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         Ord
unordered-containers>           compare reflexive:               OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           compare transitive:              OK (0.02s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           compare antisymmetric:           OK
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>           Ord => Eq:                       OK (0.02s)
unordered-containers>             +++ OK, passed 100 tests.
unordered-containers>         Read/Show:                         OK (0.10s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         Foldable:                          OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         Hashable:                          OK (0.01s)
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>       size:                                OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       member:                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       insert:                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       delete:                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       union:                               OK (0.02s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       map:                                 OK (0.17s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldr:                               OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       foldl':                              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       filter:                              OK (0.20s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       toList:                              OK (0.01s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>     Data.HashMap.Internal.List
unordered-containers>       isPermutationBy:                     OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       isPermutationBy of different length: OK
unordered-containers>         +++ OK, passed 100 tests; 20 discarded.
unordered-containers>       pUnorderedCompare:                   OK (0.03s)
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       modelUnorderedCompare
unordered-containers>         reflexive:                         OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         anti-symmetric:                    OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>         transitive:                        OK
unordered-containers>           +++ OK, passed 100 tests.
unordered-containers>   Regression tests
unordered-containers>     issue32:                               OK
unordered-containers>     issue39a:                              OK
unordered-containers>     issue39b:                              OK (0.01s)
unordered-containers>       +++ OK, passed 100 tests.
unordered-containers>     issue254 lazy:                         OK
unordered-containers>     issue254 strict:                       OK
unordered-containers>     issue379
unordered-containers>       Lazy.unionWith:                      OK
unordered-containers>       union:                               OK
unordered-containers>       Strict.unionWith:                    OK
unordered-containers>       Strict.unionWithKey:                 OK
unordered-containers>     issue381
unordered-containers>       mapMaybe:                            OK
unordered-containers>       mapMaybeWithKey:                     OK
unordered-containers>     issue382:                              OK
unordered-containers>     issue383:                              OK
unordered-containers>     issue420:                              OK
unordered-containers>   Strictness
unordered-containers>     HashMap.Strict
unordered-containers>       singleton is key-strict:             OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       singleton is value-strict:           OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       member is key-strict:                OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       lookup is key-strict:                OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       lookupDefault is key-strict:         OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       findWithDefault is key-strict:       OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       ! is key-strict:                     OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       delete is key-strict:                OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       adjust is key-strict:                OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       adjust is value-strict:              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       insert is key-strict:                OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       insert is value-strict:              OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       insertWith is key-strict:            OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       insertWith is value-strict:          OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       fromList is key-strict:              OK
unordered-containers>         +++ OK, passed 1 test.
unordered-containers>       fromList is value-strict:            OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       fromListWith is key-strict:          OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers>       fromListWith is value-strict:        OK
unordered-containers>         +++ OK, passed 100 tests.
unordered-containers> 
unordered-containers> All 256 tests passed (0.52s)
unordered-containers> Test suite unordered-containers-tests: PASS
unordered-containers> Test suite logged to:
unordered-containers> dist/test/unordered-containers-0.2.20-unordered-containers-tests.log
unordered-containers> 1 of 1 test suites (1 of 1 test cases) passed.
unordered-containers> Running phase: haddockPhase
unordered-containers> Preprocessing library for unordered-containers-0.2.20..
unordered-containers> Running Haddock on library for unordered-containers-0.2.20..
unordered-containers> Warning: --source-* options are ignored when --hyperlinked-source is enabled.
unordered-containers> 
unordered-containers> Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
unordered-containers>     -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
unordered-containers>    |
unordered-containers> 12 | {-# LANGUAGE TypeInType            #-}
unordered-containers>    |              ^^^^^^^^^^
unordered-containers> [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing )
unordered-containers> 
unordered-containers> Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
unordered-containers>     The import of ‘Control.Applicative’ is redundant
unordered-containers>       except perhaps to import instances from ‘Control.Applicative’
unordered-containers>     To import instances alone, use: import Control.Applicative()
unordered-containers>    |
unordered-containers> 83 | import Control.Applicative (liftA2)
unordered-containers>    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
unordered-containers> [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing )
unordered-containers> [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing )
unordered-containers> [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing )
unordered-containers> [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing )
unordered-containers> [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing )
unordered-containers> [7 of 9] Compiling Data.HashSet     ( Data/HashSet.hs, nothing )
unordered-containers> [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing )
unordered-containers> [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing )
unordered-containers> Haddock coverage:
unordered-containers>   33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
unordered-containers>   Missing documentation for:
unordered-containers>     Array (Data/HashMap/Internal/Array.hs:125)
unordered-containers>     MArray (Data/HashMap/Internal/Array.hs:157)
unordered-containers>     new_ (Data/HashMap/Internal/Array.hs:208)
unordered-containers>     singleton (Data/HashMap/Internal/Array.hs:225)
unordered-containers>     singletonM (Data/HashMap/Internal/Array.hs:229)
unordered-containers>     snoc (Data/HashMap/Internal/Array.hs:233)
unordered-containers>     pair (Data/HashMap/Internal/Array.hs:242)
unordered-containers>     length (Data/HashMap/Internal/Array.hs:154)
unordered-containers>     lengthM (Data/HashMap/Internal/Array.hs:162)
unordered-containers>     read (Data/HashMap/Internal/Array.hs:249)
unordered-containers>     write (Data/HashMap/Internal/Array.hs:255)
unordered-containers>     index (Data/HashMap/Internal/Array.hs:262)
unordered-containers>     indexM (Data/HashMap/Internal/Array.hs:274)
unordered-containers>     index# (Data/HashMap/Internal/Array.hs:268)
unordered-containers>     sameArray1 (Data/HashMap/Internal/Array.hs:140)
unordered-containers>     unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
unordered-containers>     unsafeThaw (Data/HashMap/Internal/Array.hs:286)
unordered-containers>     unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
unordered-containers>     run (Data/HashMap/Internal/Array.hs:292)
unordered-containers>     cloneM (Data/HashMap/Internal/Array.hs:314)
unordered-containers>     foldl (Data/HashMap/Internal/Array.hs:404)
unordered-containers>     foldl' (Data/HashMap/Internal/Array.hs:375)
unordered-containers>     foldr (Data/HashMap/Internal/Array.hs:394)
unordered-containers>     foldr' (Data/HashMap/Internal/Array.hs:385)
unordered-containers>     foldMap (Data/HashMap/Internal/Array.hs:417)
unordered-containers>     thaw (Data/HashMap/Internal/Array.hs:436)
unordered-containers>     map (Data/HashMap/Internal/Array.hs:461)
unordered-containers>     traverse (Data/HashMap/Internal/Array.hs:537)
unordered-containers>     traverse' (Data/HashMap/Internal/Array.hs:553)
unordered-containers>     toList (Data/HashMap/Internal/Array.hs:529)
unordered-containers>     fromList (Data/HashMap/Internal/Array.hs:494)
unordered-containers>     fromList' (Data/HashMap/Internal/Array.hs:506)
unordered-containers>   25% (  1 /  4) in 'Data.HashMap.Internal.List'
unordered-containers>   Missing documentation for:
unordered-containers>     isPermutationBy (Data/HashMap/Internal/List.hs:40)
unordered-containers>     deleteBy (Data/HashMap/Internal/List.hs:83)
unordered-containers>     unorderedCompare (Data/HashMap/Internal/List.hs:68)
unordered-containers> Warning: 'hash' is ambiguous. It is defined
unordered-containers>     * in ‘Data.Hashable.Class’
unordered-containers>     * at Data/HashMap/Internal.hs:183:1
unordered-containers>     You may be able to disambiguate the identifier by qualifying it or
unordered-containers>     by specifying the type/value namespace explicitly.
unordered-containers>     Defaulting to the one defined at Data/HashMap/Internal.hs:183:1
unordered-containers> Warning: 'Leaf' is ambiguous. It is defined
unordered-containers>     * at Data/HashMap/Internal.hs:225:7
unordered-containers>     * at Data/HashMap/Internal.hs:185:1
unordered-containers>     You may be able to disambiguate the identifier by qualifying it or
unordered-containers>     by specifying the type/value namespace explicitly.
unordered-containers>     Defaulting to the one defined at Data/HashMap/Internal.hs:185:1
unordered-containers> Warning: 'lookup' is ambiguous. It is defined
unordered-containers>     * in ‘GHC.List’
unordered-containers>     * at Data/HashMap/Internal.hs:632:1
unordered-containers>     You may be able to disambiguate the identifier by qualifying it or
unordered-containers>     by specifying the type/value namespace explicitly.
unordered-containers>     Defaulting to the one defined at Data/HashMap/Internal.hs:632:1
unordered-containers> Warning: 'update' is ambiguous. It is defined
unordered-containers>     * at Data/HashMap/Internal.hs:1289:1
unordered-containers>     * at Data/HashMap/Internal/Array.hs:341:1
unordered-containers>     You may be able to disambiguate the identifier by qualifying it or
unordered-containers>     by specifying the type/value namespace explicitly.
unordered-containers>     Defaulting to the one defined at Data/HashMap/Internal/Array.hs:341:1
unordered-containers> Warning: 'at' is out of scope.
unordered-containers>     If you qualify the identifier, haddock can try to link it anyway.
unordered-containers> Warning: '!?' is ambiguous. It is defined
unordered-containers>     * in ‘GHC.List’
unordered-containers>     * at Data/HashMap/Internal.hs:741:1
unordered-containers>     You may be able to disambiguate the identifier by qualifying it or
unordered-containers>     by specifying the type/value namespace explicitly.
unordered-containers>     Defaulting to the one defined at Data/HashMap/Internal.hs:741:1
unordered-containers> Warning: 'index' is ambiguous. It is defined
unordered-containers>     * at Data/HashMap/Internal.hs:2460:1
unordered-containers>     * at Data/HashMap/Internal/Array.hs:262:1
unordered-containers>     You may be able to disambiguate the identifier by qualifying it or
unordered-containers>     by specifying the type/value namespace explicitly.
unordered-containers>     Defaulting to the one defined at Data/HashMap/Internal/Array.hs:262:1
unordered-containers> Warning: 'union' is ambiguous. It is defined
unordered-containers>     * in ‘Data.OldList’
unordered-containers>     * at Data/HashMap/Internal.hs:1586:1
unordered-containers>     You may be able to disambiguate the identifier by qualifying it or
unordered-containers>     by specifying the type/value namespace explicitly.
unordered-containers>     Defaulting to the one defined at Data/HashMap/Internal.hs:1586:1
unordered-containers>   88% ( 93 /105) in 'Data.HashMap.Internal'
unordered-containers>   Missing documentation for:
unordered-containers>     Leaf (Data/HashMap/Internal.hs:185)
unordered-containers>     intersectionWithKey# (Data/HashMap/Internal.hs:1855)
unordered-containers>     updateOrConcatWithKey (Data/HashMap/Internal.hs:2368)
unordered-containers>     equalKeys (Data/HashMap/Internal.hs:511)
unordered-containers>     equalKeys1 (Data/HashMap/Internal.hs:495)
unordered-containers>     lookupRecordCollision (Data/HashMap/Internal.hs:678)
unordered-containers>     LookupRes (Data/HashMap/Internal.hs:657)
unordered-containers>     lookupResToMaybe (Data/HashMap/Internal.hs:660)
unordered-containers>     insert' (Data/HashMap/Internal.hs:806)
unordered-containers>     delete' (Data/HashMap/Internal.hs:1124)
unordered-containers>     insertNewKey (Data/HashMap/Internal.hs:848)
unordered-containers>     insertKeyExists (Data/HashMap/Internal.hs:883)
unordered-containers>   50% (  3 /  6) in 'Data.HashMap.Internal.Debug'
unordered-containers>   Missing documentation for:
unordered-containers>     valid (Data/HashMap/Internal/Debug.hs:98)
unordered-containers>     Validity (Data/HashMap/Internal/Debug.hs:43)
unordered-containers>     SubHashPath (Data/HashMap/Internal/Debug.hs:75)
unordered-containers> Warning: 'update' is ambiguous. It is defined
unordered-containers>     * at Data/HashMap/Internal.hs:1289:1
unordered-containers>     * at Data/HashMap/Internal/Array.hs:341:1
unordered-containers>     * at Data/HashMap/Internal/Strict.hs:296:1
unordered-containers>     You may be able to disambiguate the identifier by qualifying it or
unordered-containers>     by specifying the type/value namespace explicitly.
unordered-containers>     Defaulting to the one defined at Data/HashMap/Internal/Strict.hs:296:1
unordered-containers> Warning: 'alter' is ambiguous. It is defined
unordered-containers>     * at Data/HashMap/Internal.hs:1302:1
unordered-containers>     * at Data/HashMap/Internal/Strict.hs:308:1
unordered-containers>     You may be able to disambiguate the identifier by qualifying it or
unordered-containers>     by specifying the type/value namespace explicitly.
unordered-containers>     Defaulting to the one defined at Data/HashMap/Internal/Strict.hs:308:1
unordered-containers> Warning: 'lookup' is ambiguous. It is defined
unordered-containers>     * in ‘GHC.List’
unordered-containers>     * at Data/HashMap/Internal.hs:632:1
unordered-containers>     You may be able to disambiguate the identifier by qualifying it or
unordered-containers>     by specifying the type/value namespace explicitly.
unordered-containers>     Defaulting to the one defined at Data/HashMap/Internal.hs:632:1
unordered-containers> Warning: 'alterF' is ambiguous. It is defined
unordered-containers>     * at Data/HashMap/Internal.hs:1333:1
unordered-containers>     * at Data/HashMap/Internal/Strict.hs:339:1
unordered-containers>     You may be able to disambiguate the identifier by qualifying it or
unordered-containers>     by specifying the type/value namespace explicitly.
unordered-containers>     Defaulting to the one defined at Data/HashMap/Internal/Strict.hs:339:1
unordered-containers> Warning: 'at' is out of scope.
unordered-containers>     If you qualify the identifier, haddock can try to link it anyway.
unordered-containers> Warning: 'map' is ambiguous. It is defined
unordered-containers>     * in ‘GHC.Base’
unordered-containers>     * at Data/HashMap/Internal.hs:1767:1
unordered-containers>     * at Data/HashMap/Internal/Array.hs:461:1
unordered-containers>     * at Data/HashMap/Internal/Strict.hs:557:1
unordered-containers>     You may be able to disambiguate the identifier by qualifying it or
unordered-containers>     by specifying the type/value namespace explicitly.
unordered-containers>     Defaulting to the one defined at Data/HashMap/Internal/Strict.hs:557:1
unordered-containers>  100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
unordered-containers> Warning: 'HashSet' is ambiguous. It is defined
unordered-containers>     * at Data/HashSet/Internal.hs:112:21
unordered-containers>     * at Data/HashSet/Internal.hs:112:1
unordered-containers>     You may be able to disambiguate the identifier by qualifying it or
unordered-containers>     by specifying the type/value namespace explicitly.
unordered-containers>     Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
unordered-containers> Warning: 'empty' is ambiguous. It is defined
unordered-containers>     * at Data/HashMap/Internal.hs:594:1
unordered-containers>     * at Data/HashSet/Internal.hs:255:1
unordered-containers>     You may be able to disambiguate the identifier by qualifying it or
unordered-containers>     by specifying the type/value namespace explicitly.
unordered-containers>     Defaulting to the one defined at Data/HashSet/Internal.hs:255:1
unordered-containers> Warning: 'union' is ambiguous. It is defined
unordered-containers>     * in ‘Data.OldList’
unordered-containers>     * at Data/HashMap/Internal.hs:1586:1
unordered-containers>     * at Data/HashSet/Internal.hs:310:1
unordered-containers>     You may be able to disambiguate the identifier by qualifying it or
unordered-containers>     by specifying the type/value namespace explicitly.
unordered-containers>     Defaulting to the one defined at Data/HashSet/Internal.hs:310:1
unordered-containers>  100% ( 35 / 35) in 'Data.HashSet.Internal'
unordered-containers> Warning: 'HashSet' is ambiguous. It is defined
unordered-containers>     * at Data/HashSet/Internal.hs:112:21
unordered-containers>     * at Data/HashSet/Internal.hs:112:1
unordered-containers>     You may be able to disambiguate the identifier by qualifying it or
unordered-containers>     by specifying the type/value namespace explicitly.
unordered-containers>     Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
unordered-containers>  100% ( 32 / 32) in 'Data.HashSet'
unordered-containers>  100% ( 69 / 69) in 'Data.HashMap.Strict'
unordered-containers>  100% ( 69 / 69) in 'Data.HashMap.Lazy'
unordered-containers> Warning: Data.HashMap.Internal: could not find link destinations for:
unordered-containers>   - Data.HashMap.Internal.D:R:ItemHashMap
unordered-containers> Warning: Data.HashMap.Internal.Strict: could not find link destinations for:
unordered-containers>   - Data.HashMap.Internal.D:R:ItemHashMap
unordered-containers> Warning: Data.HashSet.Internal: could not find link destinations for:
unordered-containers>   - Data.HashSet.Internal.D:R:ItemHashSet
unordered-containers> Warning: Data.HashSet: could not find link destinations for:
unordered-containers>   - Data.HashSet.Internal.D:R:ItemHashSet
unordered-containers> Warning: Data.HashMap.Strict: could not find link destinations for:
unordered-containers>   - Data.HashMap.Internal.D:R:ItemHashMap
unordered-containers> Warning: Data.HashMap.Lazy: could not find link destinations for:
unordered-containers>   - Data.HashMap.Internal.D:R:ItemHashMap
unordered-containers> Documentation created: dist/doc/html/unordered-containers/,
unordered-containers> dist/doc/html/unordered-containers/unordered-containers.txt
unordered-containers> Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20..
unordered-containers> Running phase: installPhase
unordered-containers> Installing library in /nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
unordered-containers> Running phase: fixupPhase
unordered-containers> shrinking RPATHs of ELF executables and libraries in /nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20
unordered-containers> shrinking /nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSunordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq-ghc9.8.1.so
unordered-containers> checking for references to /build/ in /nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20...
unordered-containers> patching script interpreter paths in /nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20
unordered-containers> stripping (with command strip and flags -S -p) in  /nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20/lib
unordered-containers> shrinking RPATHs of ELF executables and libraries in /nix/store/rdhmpkzwzwhiwayj81hlxnzbahjxsp0m-unordered-containers-0.2.20-doc
unordered-containers> checking for references to /build/ in /nix/store/rdhmpkzwzwhiwayj81hlxnzbahjxsp0m-unordered-containers-0.2.20-doc...
unordered-containers> patching script interpreter paths in /nix/store/rdhmpkzwzwhiwayj81hlxnzbahjxsp0m-unordered-containers-0.2.20-doc
unordered-containers (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20 /nix/store/rdhmpkzwzwhiwayj81hlxnzbahjxsp0m-unordered-containers-0.2.20-doc
unordered-containers (post)> Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
unordered-containers (post)> 
unordered-containers (post)> Pushing /nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20 (9.28 MiB)
unordered-containers (post)> Pushing /nix/store/rdhmpkzwzwhiwayj81hlxnzbahjxsp0m-unordered-containers-0.2.20-doc (4.50 MiB)
unordered-containers (post)> 
unordered-containers (post)> All done.
unordered-containers (post)> added 2 signatures
unordered-containers (post)> added 2 signatures
unordered-containers (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20 /nix/store/rdhmpkzwzwhiwayj81hlxnzbahjxsp0m-unordered-containers-0.2.20-doc
unordered-containers (post)> copying 2 paths...
unordered-containers (post)> copying path '/nix/store/rdhmpkzwzwhiwayj81hlxnzbahjxsp0m-unordered-containers-0.2.20-doc' to 'https://cache.nix-ci.com'...
unordered-containers (post)> copying path '/nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20' to 'https://cache.nix-ci.com'...
unordered-containers (post)> copying 1 paths...
unordered-containers (post)> copying path '/nix/store/8vllyaka6r2ssb8x8whnn3sl3aif235b-unordered-containers-0.2.20.drv' to 'https://cache.nix-ci.com'...
unordered-containers (post)> added 0 signatures
unordered-containers (post)> added 0 signatures
unordered-containers (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20 /nix/store/rdhmpkzwzwhiwayj81hlxnzbahjxsp0m-unordered-containers-0.2.20-doc
unordered-containers (post)> copying 2 paths...
unordered-containers (post)> copying path '/nix/store/rdhmpkzwzwhiwayj81hlxnzbahjxsp0m-unordered-containers-0.2.20-doc' to 'ssh-ng://worker.nix-ci.com'...
unordered-containers (post)> copying path '/nix/store/23bcgkqh3ss2a84bs93hbbwzxji21jk4-unordered-containers-0.2.20' to 'ssh-ng://worker.nix-ci.com'...
unordered-containers (post)> copying 1 paths...
unordered-containers (post)> copying path '/nix/store/8vllyaka6r2ssb8x8whnn3sl3aif235b-unordered-containers-0.2.20.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/rkks937kacssls70fwmdpr1784pgjz85-quickcheck-instances-0.3.32.drv'...
quickcheck-instances> Running phase: setupCompilerEnvironmentPhase
quickcheck-instances> Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
quickcheck-instances> Running phase: unpackPhase
quickcheck-instances> unpacking source archive /nix/store/kz0fzqcr8g42rvq6dwlwvzxmg8rjfhqn-quickcheck-instances-0.3.32.tar.gz
quickcheck-instances> source root is quickcheck-instances-0.3.32
quickcheck-instances> setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.32/test/Tests.hs"
quickcheck-instances> Running phase: patchPhase
quickcheck-instances> Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.32/revision/1.cabal.
quickcheck-instances> Running phase: compileBuildDriverPhase
quickcheck-instances> setupCompileFlags: -package-db=/build/tmp.2Nib36VslP/setup-package.conf.d -threaded
quickcheck-instances> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.2Nib36VslP/Main.o )
quickcheck-instances> [2 of 2] Linking Setup
quickcheck-instances> Running phase: updateAutotoolsGnuConfigScriptsPhase
quickcheck-instances> Running phase: configurePhase
quickcheck-instances> configureFlags: --verbose --prefix=/nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/glm8mkb53q97zz2b42svz7hyhjka9rlj-quickcheck-instances-0.3.32-doc/share/doc/quickcheck-instances-0.3.32 --with-gcc=gcc --package-db=/build/tmp.2Nib36VslP/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
quickcheck-instances> Using Parsec parser
quickcheck-instances> Configuring quickcheck-instances-0.3.32...
quickcheck-instances> Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
quickcheck-instances> Dependency QuickCheck >=2.14.2 && <2.15.1: using QuickCheck-2.14.3
quickcheck-instances> Dependency array >=0.5.3.0 && <0.6: using array-0.5.6.0
quickcheck-instances> Dependency base >=4.12.0.0 && <4.22: using base-4.19.0.0
quickcheck-instances> Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.0.2
quickcheck-instances> Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
quickcheck-instances> Dependency containers >=0.6.0.1 && <0.8: using containers-0.6.8
quickcheck-instances> Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
quickcheck-instances> Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.4.7.0
quickcheck-instances> Dependency integer-logarithms >=1.0.3.1 && <1.1: using
quickcheck-instances> integer-logarithms-1.0.4
quickcheck-instances> Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
quickcheck-instances> Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
quickcheck-instances> Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
quickcheck-instances> Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.1
quickcheck-instances> Dependency strict >=0.5 && <0.6: using strict-0.5.1
quickcheck-instances> Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.8
quickcheck-instances> Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1
quickcheck-instances> Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
quickcheck-instances> Dependency these >=1.2.1 && <1.3: using these-1.2.1
quickcheck-instances> Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.7
quickcheck-instances> Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.0
quickcheck-instances> Dependency unordered-containers >=0.2.20 && <0.3: using
quickcheck-instances> unordered-containers-0.2.20
quickcheck-instances> Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
quickcheck-instances> Dependency vector >=0.13.1.0 && <0.14: using vector-0.13.2.0
quickcheck-instances> Dependency QuickCheck: using QuickCheck-2.14.3
quickcheck-instances> Dependency base: using base-4.19.0.0
quickcheck-instances> Dependency containers: using containers-0.6.8
quickcheck-instances> Dependency primitive: using primitive-0.9.1.0
quickcheck-instances> Dependency quickcheck-instances: using quickcheck-instances-0.3.32
quickcheck-instances> Dependency tagged: using tagged-0.8.8
quickcheck-instances> Dependency uuid-types: using uuid-types-1.0.6
quickcheck-instances> Source component graph:
quickcheck-instances>     component lib
quickcheck-instances>     component test:self-test dependency lib
quickcheck-instances> Configured component graph:
quickcheck-instances>     component quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
quickcheck-instances>         include OneTuple-0.4.2-FoSVxZ1Ua1k9qzI3fLkcX3
quickcheck-instances>         include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
quickcheck-instances>         include array-0.5.6.0-dc89
quickcheck-instances>         include base-4.19.0.0-b960
quickcheck-instances>         include bytestring-0.12.0.2-4690
quickcheck-instances>         include case-insensitive-1.2.1.0-4sNw09pp3ywJCN7WmvmsUo
quickcheck-instances>         include containers-0.6.8-4775
quickcheck-instances>         include data-fix-0.3.4-90kAYHfhdX433d7z3npPya
quickcheck-instances>         include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
quickcheck-instances>         include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
quickcheck-instances>         include old-time-1.1.0.4-GyTPzrGYsOf5FPo85tfX5z
quickcheck-instances>         include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
quickcheck-instances>         include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
quickcheck-instances>         include splitmix-0.1.1-AoP57hqMhOYD9c7s1NlK2Y
quickcheck-instances>         include strict-0.5.1-GVSVdbGTOCS56r31yJq782
quickcheck-instances>         include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
quickcheck-instances>         include text-2.1-c36a
quickcheck-instances>         include text-short-0.1.6-4FBuxekPqrd8UqmSusWgg5
quickcheck-instances>         include these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
quickcheck-instances>         include time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
quickcheck-instances>         include transformers-0.6.1.0-c3ec
quickcheck-instances>         include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
quickcheck-instances>         include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
quickcheck-instances>         include vector-0.13.2.0-KITycIPQp0R25115diGgzh
quickcheck-instances>     component quickcheck-instances-0.3.32-EqnsGjJX1nY9SmASoFIwTc-self-test
quickcheck-instances>         include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
quickcheck-instances>         include base-4.19.0.0-b960
quickcheck-instances>         include containers-0.6.8-4775
quickcheck-instances>         include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
quickcheck-instances>         include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
quickcheck-instances>         include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
quickcheck-instances>         include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
quickcheck-instances> Linked component graph:
quickcheck-instances>     unit quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
quickcheck-instances>         include OneTuple-0.4.2-FoSVxZ1Ua1k9qzI3fLkcX3
quickcheck-instances>         include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
quickcheck-instances>         include array-0.5.6.0-dc89
quickcheck-instances>         include base-4.19.0.0-b960
quickcheck-instances>         include bytestring-0.12.0.2-4690
quickcheck-instances>         include case-insensitive-1.2.1.0-4sNw09pp3ywJCN7WmvmsUo
quickcheck-instances>         include containers-0.6.8-4775
quickcheck-instances>         include data-fix-0.3.4-90kAYHfhdX433d7z3npPya
quickcheck-instances>         include hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
quickcheck-instances>         include integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
quickcheck-instances>         include old-time-1.1.0.4-GyTPzrGYsOf5FPo85tfX5z
quickcheck-instances>         include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
quickcheck-instances>         include scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
quickcheck-instances>         include splitmix-0.1.1-AoP57hqMhOYD9c7s1NlK2Y
quickcheck-instances>         include strict-0.5.1-GVSVdbGTOCS56r31yJq782
quickcheck-instances>         include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
quickcheck-instances>         include text-2.1-c36a
quickcheck-instances>         include text-short-0.1.6-4FBuxekPqrd8UqmSusWgg5
quickcheck-instances>         include these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
quickcheck-instances>         include time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
quickcheck-instances>         include transformers-0.6.1.0-c3ec
quickcheck-instances>         include unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
quickcheck-instances>         include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
quickcheck-instances>         include vector-0.13.2.0-KITycIPQp0R25115diGgzh
quickcheck-instances>         Test.QuickCheck.Instances=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA:Test.QuickCheck.Instances.Void
quickcheck-instances>     unit quickcheck-instances-0.3.32-EqnsGjJX1nY9SmASoFIwTc-self-test
quickcheck-instances>         include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
quickcheck-instances>         include base-4.19.0.0-b960
quickcheck-instances>         include containers-0.6.8-4775
quickcheck-instances>         include primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
quickcheck-instances>         include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
quickcheck-instances>         include tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
quickcheck-instances>         include uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
quickcheck-instances> Ready component graph:
quickcheck-instances>     definite quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
quickcheck-instances>         depends OneTuple-0.4.2-FoSVxZ1Ua1k9qzI3fLkcX3
quickcheck-instances>         depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
quickcheck-instances>         depends array-0.5.6.0-dc89
quickcheck-instances>         depends base-4.19.0.0-b960
quickcheck-instances>         depends bytestring-0.12.0.2-4690
quickcheck-instances>         depends case-insensitive-1.2.1.0-4sNw09pp3ywJCN7WmvmsUo
quickcheck-instances>         depends containers-0.6.8-4775
quickcheck-instances>         depends data-fix-0.3.4-90kAYHfhdX433d7z3npPya
quickcheck-instances>         depends hashable-1.4.7.0-Jrw7dwmC3aCEeIVQjKkh3m
quickcheck-instances>         depends integer-logarithms-1.0.4-IZnPj8qGoLo9zs4hkYJadH
quickcheck-instances>         depends old-time-1.1.0.4-GyTPzrGYsOf5FPo85tfX5z
quickcheck-instances>         depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
quickcheck-instances>         depends scientific-0.3.8.0-AAHJ2xFRe5v5s4wRtZjD2X
quickcheck-instances>         depends splitmix-0.1.1-AoP57hqMhOYD9c7s1NlK2Y
quickcheck-instances>         depends strict-0.5.1-GVSVdbGTOCS56r31yJq782
quickcheck-instances>         depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
quickcheck-instances>         depends text-2.1-c36a
quickcheck-instances>         depends text-short-0.1.6-4FBuxekPqrd8UqmSusWgg5
quickcheck-instances>         depends these-1.2.1-B8INZK8jfBp2iDPS6dEUhs
quickcheck-instances>         depends time-compat-1.9.7-IGnpUyczMKVByAqjyfFbdA
quickcheck-instances>         depends transformers-0.6.1.0-c3ec
quickcheck-instances>         depends unordered-containers-0.2.20-AM7Td2IpmdgCRcYRlyW8Xq
quickcheck-instances>         depends uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
quickcheck-instances>         depends vector-0.13.2.0-KITycIPQp0R25115diGgzh
quickcheck-instances>     definite quickcheck-instances-0.3.32-EqnsGjJX1nY9SmASoFIwTc-self-test
quickcheck-instances>         depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
quickcheck-instances>         depends base-4.19.0.0-b960
quickcheck-instances>         depends containers-0.6.8-4775
quickcheck-instances>         depends primitive-0.9.1.0-DeIA1En0tGHWHx5cf6fLi
quickcheck-instances>         depends quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
quickcheck-instances>         depends tagged-0.8.8-9IYNVroNH6YIopP0F3Et98
quickcheck-instances>         depends uuid-types-1.0.6-6gO6eWf1YHLC09OVS7zxKJ
quickcheck-instances> Using Cabal-3.10.2.0 compiled by ghc-9.8
quickcheck-instances> Using compiler: ghc-9.8.1
quickcheck-instances> Using install prefix:
quickcheck-instances> /nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32
quickcheck-instances> Executables installed in:
quickcheck-instances> /nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32/bin
quickcheck-instances> Libraries installed in:
quickcheck-instances> /nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
quickcheck-instances> Dynamic Libraries installed in:
quickcheck-instances> /nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
quickcheck-instances> Private executables installed in:
quickcheck-instances> /nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32/libexec/x86_64-linux-ghc-9.8.1/quickcheck-instances-0.3.32
quickcheck-instances> Data files installed in:
quickcheck-instances> /nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32/share/x86_64-linux-ghc-9.8.1/quickcheck-instances-0.3.32
quickcheck-instances> Documentation installed in:
quickcheck-instances> /nix/store/glm8mkb53q97zz2b42svz7hyhjka9rlj-quickcheck-instances-0.3.32-doc/share/doc/quickcheck-instances-0.3.32
quickcheck-instances> Configuration files installed in:
quickcheck-instances> /nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32/etc
quickcheck-instances> No alex found
quickcheck-instances> Using ar found on system at:
quickcheck-instances> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
quickcheck-instances> No c2hs found
quickcheck-instances> No cpphs found
quickcheck-instances> No doctest found
quickcheck-instances> Using gcc version 14.3.0 given by user at:
quickcheck-instances> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
quickcheck-instances> Using ghc version 9.8.1 found on system at:
quickcheck-instances> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
quickcheck-instances> Using ghc-pkg version 9.8.1 found on system at:
quickcheck-instances> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
quickcheck-instances> No ghcjs found
quickcheck-instances> No ghcjs-pkg found
quickcheck-instances> No greencard found
quickcheck-instances> Using haddock version 2.30.0 found on system at:
quickcheck-instances> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
quickcheck-instances> No happy found
quickcheck-instances> Using haskell-suite found on system at: haskell-suite-dummy-location
quickcheck-instances> Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
quickcheck-instances> No hmake found
quickcheck-instances> Using hpc version 0.69 found on system at:
quickcheck-instances> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
quickcheck-instances> Using hsc2hs version 0.68.10 found on system at:
quickcheck-instances> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
quickcheck-instances> Using hscolour version 1.25 found on system at:
quickcheck-instances> /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
quickcheck-instances> No jhc found
quickcheck-instances> Using ld found on system at:
quickcheck-instances> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
quickcheck-instances> No pkg-config found
quickcheck-instances> Using runghc version 9.8.1 found on system at:
quickcheck-instances> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
quickcheck-instances> Using strip version 2.44 found on system at:
quickcheck-instances> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
quickcheck-instances> Using tar found on system at:
quickcheck-instances> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
quickcheck-instances> No uhc found
quickcheck-instances> Running phase: buildPhase
quickcheck-instances> Preprocessing library for quickcheck-instances-0.3.32..
quickcheck-instances> Building library for quickcheck-instances-0.3.32..
quickcheck-instances> [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, dist/build/Test/QuickCheck/Instances/Containers.o, dist/build/Test/QuickCheck/Instances/Containers.dyn_o )
quickcheck-instances> [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, dist/build/Test/QuickCheck/Instances/CustomPrelude.o, dist/build/Test/QuickCheck/Instances/CustomPrelude.dyn_o )
quickcheck-instances> [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, dist/build/Test/QuickCheck/Instances/CaseInsensitive.o, dist/build/Test/QuickCheck/Instances/CaseInsensitive.dyn_o )
quickcheck-instances> [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, dist/build/Test/QuickCheck/Instances/ByteString.o, dist/build/Test/QuickCheck/Instances/ByteString.dyn_o )
quickcheck-instances> [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, dist/build/Test/QuickCheck/Instances/Array.o, dist/build/Test/QuickCheck/Instances/Array.dyn_o )
quickcheck-instances> [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, dist/build/Test/QuickCheck/Instances/DataFix.o, dist/build/Test/QuickCheck/Instances/DataFix.dyn_o )
quickcheck-instances> [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, dist/build/Test/QuickCheck/Instances/Hashable.o, dist/build/Test/QuickCheck/Instances/Hashable.dyn_o )
quickcheck-instances> [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, dist/build/Test/QuickCheck/Instances/Natural.o, dist/build/Test/QuickCheck/Instances/Natural.dyn_o )
quickcheck-instances> [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, dist/build/Test/QuickCheck/Instances/OldTime.o, dist/build/Test/QuickCheck/Instances/OldTime.dyn_o )
quickcheck-instances> [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, dist/build/Test/QuickCheck/Instances/Primitive.o, dist/build/Test/QuickCheck/Instances/Primitive.dyn_o )
quickcheck-instances> [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, dist/build/Test/QuickCheck/Instances/Array/Byte.o, dist/build/Test/QuickCheck/Instances/Array/Byte.dyn_o )
quickcheck-instances> [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, dist/build/Test/QuickCheck/Instances/Scientific.o, dist/build/Test/QuickCheck/Instances/Scientific.dyn_o )
quickcheck-instances> [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, dist/build/Test/QuickCheck/Instances/Semigroup.o, dist/build/Test/QuickCheck/Instances/Semigroup.dyn_o )
quickcheck-instances> [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, dist/build/Test/QuickCheck/Instances/Solo.o, dist/build/Test/QuickCheck/Instances/Solo.dyn_o )
quickcheck-instances> [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, dist/build/Test/QuickCheck/Instances/Strict.o, dist/build/Test/QuickCheck/Instances/Strict.dyn_o )
quickcheck-instances> [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, dist/build/Test/QuickCheck/Instances/Tagged.o, dist/build/Test/QuickCheck/Instances/Tagged.dyn_o )
quickcheck-instances> [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, dist/build/Test/QuickCheck/Instances/Text.o, dist/build/Test/QuickCheck/Instances/Text.dyn_o )
quickcheck-instances> [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, dist/build/Test/QuickCheck/Instances/Text/Short.o, dist/build/Test/QuickCheck/Instances/Text/Short.dyn_o )
quickcheck-instances> [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, dist/build/Test/QuickCheck/Instances/These.o, dist/build/Test/QuickCheck/Instances/These.dyn_o )
quickcheck-instances> [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, dist/build/Test/QuickCheck/Instances/Time.o, dist/build/Test/QuickCheck/Instances/Time.dyn_o )
quickcheck-instances> [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, dist/build/Test/QuickCheck/Instances/Transformer.o, dist/build/Test/QuickCheck/Instances/Transformer.dyn_o )
quickcheck-instances> [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, dist/build/Test/QuickCheck/Instances/UUID.o, dist/build/Test/QuickCheck/Instances/UUID.dyn_o )
quickcheck-instances> [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, dist/build/Test/QuickCheck/Instances/UnorderedContainers.o, dist/build/Test/QuickCheck/Instances/UnorderedContainers.dyn_o )
quickcheck-instances> [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, dist/build/Test/QuickCheck/Instances/Vector.o, dist/build/Test/QuickCheck/Instances/Vector.dyn_o )
quickcheck-instances> [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, dist/build/Test/QuickCheck/Instances/Void.o, dist/build/Test/QuickCheck/Instances/Void.dyn_o )
quickcheck-instances> [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.o, dist/build/Test/QuickCheck/Instances.dyn_o )
quickcheck-instances> [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, dist/build/Test/QuickCheck/Instances/Containers.p_o )
quickcheck-instances> [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, dist/build/Test/QuickCheck/Instances/CustomPrelude.p_o )
quickcheck-instances> [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, dist/build/Test/QuickCheck/Instances/CaseInsensitive.p_o )
quickcheck-instances> [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, dist/build/Test/QuickCheck/Instances/ByteString.p_o )
quickcheck-instances> [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, dist/build/Test/QuickCheck/Instances/Array.p_o )
quickcheck-instances> [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, dist/build/Test/QuickCheck/Instances/DataFix.p_o )
quickcheck-instances> [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, dist/build/Test/QuickCheck/Instances/Hashable.p_o )
quickcheck-instances> [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, dist/build/Test/QuickCheck/Instances/Natural.p_o )
quickcheck-instances> [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, dist/build/Test/QuickCheck/Instances/OldTime.p_o )
quickcheck-instances> [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, dist/build/Test/QuickCheck/Instances/Primitive.p_o )
quickcheck-instances> [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, dist/build/Test/QuickCheck/Instances/Array/Byte.p_o )
quickcheck-instances> [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, dist/build/Test/QuickCheck/Instances/Scientific.p_o )
quickcheck-instances> [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, dist/build/Test/QuickCheck/Instances/Semigroup.p_o )
quickcheck-instances> [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, dist/build/Test/QuickCheck/Instances/Solo.p_o )
quickcheck-instances> [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, dist/build/Test/QuickCheck/Instances/Strict.p_o )
quickcheck-instances> [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, dist/build/Test/QuickCheck/Instances/Tagged.p_o )
quickcheck-instances> [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, dist/build/Test/QuickCheck/Instances/Text.p_o )
quickcheck-instances> [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, dist/build/Test/QuickCheck/Instances/Text/Short.p_o )
quickcheck-instances> [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, dist/build/Test/QuickCheck/Instances/These.p_o )
quickcheck-instances> [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, dist/build/Test/QuickCheck/Instances/Time.p_o )
quickcheck-instances> [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, dist/build/Test/QuickCheck/Instances/Transformer.p_o )
quickcheck-instances> [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, dist/build/Test/QuickCheck/Instances/UUID.p_o )
quickcheck-instances> [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, dist/build/Test/QuickCheck/Instances/UnorderedContainers.p_o )
quickcheck-instances> [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, dist/build/Test/QuickCheck/Instances/Vector.p_o )
quickcheck-instances> [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, dist/build/Test/QuickCheck/Instances/Void.p_o )
quickcheck-instances> [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
quickcheck-instances> Preprocessing test suite 'self-test' for quickcheck-instances-0.3.32..
quickcheck-instances> Building test suite 'self-test' for quickcheck-instances-0.3.32..
quickcheck-instances> [1 of 1] Compiling Main             ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
quickcheck-instances> [2 of 2] Linking dist/build/self-test/self-test
quickcheck-instances> Running phase: checkPhase
quickcheck-instances> Running 1 test suites...
quickcheck-instances> Test suite self-test: RUNNING...
quickcheck-instances> +++ OK, passed 100 tests.
quickcheck-instances> +++ OK, passed 100 tests.
quickcheck-instances> +++ OK, passed 100 tests.
quickcheck-instances> +++ OK, passed 100 tests.
quickcheck-instances> +++ OK, passed 100 tests.
quickcheck-instances> Test suite self-test: PASS
quickcheck-instances> Test suite logged to: dist/test/quickcheck-instances-0.3.32-self-test.log
quickcheck-instances> 1 of 1 test suites (1 of 1 test cases) passed.
quickcheck-instances> Running phase: haddockPhase
quickcheck-instances> Preprocessing library for quickcheck-instances-0.3.32..
quickcheck-instances> Running Haddock on library for quickcheck-instances-0.3.32..
quickcheck-instances> Warning: The documentation for the following packages are not installed. No
quickcheck-instances> links will be generated to these packages: vector-0.13.2.0
quickcheck-instances> Warning: --source-* options are ignored when --hyperlinked-source is enabled.
quickcheck-instances> [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing )
quickcheck-instances> [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing )
quickcheck-instances> [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing )
quickcheck-instances> [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing )
quickcheck-instances> [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing )
quickcheck-instances> [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing )
quickcheck-instances> [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing )
quickcheck-instances> [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing )
quickcheck-instances> [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing )
quickcheck-instances> [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing )
quickcheck-instances> [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing )
quickcheck-instances> [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing )
quickcheck-instances> [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing )
quickcheck-instances> [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing )
quickcheck-instances> [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing )
quickcheck-instances> [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing )
quickcheck-instances> [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing )
quickcheck-instances> [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing )
quickcheck-instances> [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing )
quickcheck-instances> [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing )
quickcheck-instances> [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing )
quickcheck-instances> [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing )
quickcheck-instances> [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing )
quickcheck-instances> [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing )
quickcheck-instances> [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing )
quickcheck-instances> [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing )
quickcheck-instances> Haddock coverage:
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Containers'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.CaseInsensitive'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.ByteString'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Array'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.DataFix'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Hashable'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Natural'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.OldTime'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Primitive'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Array.Byte'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Scientific'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Semigroup'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Solo'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Strict'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Tagged'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Text'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Text.Short'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.These'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Time'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Transformer'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.UUID'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.UnorderedContainers'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Vector'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>    0% (  0 /  1) in 'Test.QuickCheck.Instances.Void'
quickcheck-instances>   Missing documentation for:
quickcheck-instances>     Module header
quickcheck-instances>  100% (  1 /  1) in 'Test.QuickCheck.Instances'
quickcheck-instances> Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
quickcheck-instances>   - Data.Vector.Vector
quickcheck-instances>   - Data.Vector.Primitive.Vector
quickcheck-instances>   - Data.Vector.Storable.Vector
quickcheck-instances>   - Data.Vector.Unboxed.Base.Unbox
quickcheck-instances>   - Data.Vector.Unboxed.Base.Vector
quickcheck-instances> Documentation created: dist/doc/html/quickcheck-instances/,
quickcheck-instances> dist/doc/html/quickcheck-instances/quickcheck-instances.txt
quickcheck-instances> Preprocessing test suite 'self-test' for quickcheck-instances-0.3.32..
quickcheck-instances> Running phase: installPhase
quickcheck-instances> Installing library in /nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
quickcheck-instances> Running phase: fixupPhase
quickcheck-instances> shrinking RPATHs of ELF executables and libraries in /nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32
quickcheck-instances> shrinking /nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSquickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA-ghc9.8.1.so
quickcheck-instances> checking for references to /build/ in /nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32...
quickcheck-instances> patching script interpreter paths in /nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32
quickcheck-instances> stripping (with command strip and flags -S -p) in  /nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32/lib
quickcheck-instances> shrinking RPATHs of ELF executables and libraries in /nix/store/glm8mkb53q97zz2b42svz7hyhjka9rlj-quickcheck-instances-0.3.32-doc
quickcheck-instances> checking for references to /build/ in /nix/store/glm8mkb53q97zz2b42svz7hyhjka9rlj-quickcheck-instances-0.3.32-doc...
quickcheck-instances> patching script interpreter paths in /nix/store/glm8mkb53q97zz2b42svz7hyhjka9rlj-quickcheck-instances-0.3.32-doc
quickcheck-instances (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/glm8mkb53q97zz2b42svz7hyhjka9rlj-quickcheck-instances-0.3.32-doc /nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32
quickcheck-instances (post)> Pushing 2 paths (130 are already present) using zstd to cache sellout ⏳
quickcheck-instances (post)> 
quickcheck-instances (post)> Pushing /nix/store/glm8mkb53q97zz2b42svz7hyhjka9rlj-quickcheck-instances-0.3.32-doc (1.48 MiB)
quickcheck-instances (post)> Pushing /nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32 (5.35 MiB)
quickcheck-instances (post)> 
quickcheck-instances (post)> All done.
quickcheck-instances (post)> added 2 signatures
quickcheck-instances (post)> added 16 signatures
quickcheck-instances (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/glm8mkb53q97zz2b42svz7hyhjka9rlj-quickcheck-instances-0.3.32-doc /nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32
quickcheck-instances (post)> copying 2 paths...
quickcheck-instances (post)> copying path '/nix/store/glm8mkb53q97zz2b42svz7hyhjka9rlj-quickcheck-instances-0.3.32-doc' to 'https://cache.nix-ci.com'...
quickcheck-instances (post)> copying path '/nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32' to 'https://cache.nix-ci.com'...
quickcheck-instances (post)> copying 1 paths...
quickcheck-instances (post)> copying path '/nix/store/rkks937kacssls70fwmdpr1784pgjz85-quickcheck-instances-0.3.32.drv' to 'https://cache.nix-ci.com'...
quickcheck-instances (post)> added 0 signatures
quickcheck-instances (post)> added 0 signatures
quickcheck-instances (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/glm8mkb53q97zz2b42svz7hyhjka9rlj-quickcheck-instances-0.3.32-doc /nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32
quickcheck-instances (post)> copying 2 paths...
quickcheck-instances (post)> copying path '/nix/store/glm8mkb53q97zz2b42svz7hyhjka9rlj-quickcheck-instances-0.3.32-doc' to 'ssh-ng://worker.nix-ci.com'...
quickcheck-instances (post)> copying path '/nix/store/ml75fpzzcfz6w87jqi8dnmfnq3wmgc5m-quickcheck-instances-0.3.32' to 'ssh-ng://worker.nix-ci.com'...
quickcheck-instances (post)> copying 1 paths...
quickcheck-instances (post)> copying path '/nix/store/rkks937kacssls70fwmdpr1784pgjz85-quickcheck-instances-0.3.32.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/kbkly0bgcxjqkwvwxci02z8fvkrzvaka-extra-1.7.16.drv'...
extra> Running phase: setupCompilerEnvironmentPhase
extra> Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
extra> Running phase: unpackPhase
extra> unpacking source archive /nix/store/zap07ayqyv48lfcxp4yva8sylcvy2knk-extra-1.7.16.tar.gz
extra> source root is extra-1.7.16
extra> setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.7.16/test/TestUtil.hs"
extra> Running phase: patchPhase
extra> Replace Cabal file with edited version from mirror://hackage/extra-1.7.16/revision/1.cabal.
extra> Running phase: compileBuildDriverPhase
extra> setupCompileFlags: -package-db=/build/tmp.CNfAcD8qAC/setup-package.conf.d -threaded
extra> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.CNfAcD8qAC/Main.o )
extra> [2 of 2] Linking Setup
extra> Running phase: updateAutotoolsGnuConfigScriptsPhase
extra> Running phase: configurePhase
extra> configureFlags: --verbose --prefix=/nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/9bn0pi563akh52vz575khy5kfwq823d8-extra-1.7.16-doc/share/doc/extra-1.7.16 --with-gcc=gcc --package-db=/build/tmp.CNfAcD8qAC/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
extra> Using Parsec parser
extra> Configuring extra-1.7.16...
extra> Dependency base >=4.9 && <4.21: using base-4.19.0.0
extra> Dependency clock >=0.7: using clock-0.8.4
extra> Dependency directory: using directory-1.3.8.1
extra> Dependency filepath: using filepath-1.4.100.4
extra> Dependency process: using process-1.6.18.0
extra> Dependency time: using time-1.12.2
extra> Dependency unix: using unix-2.8.3.0
extra> Dependency QuickCheck >=2.10: using QuickCheck-2.14.3
extra> Dependency base >=4 && <5: using base-4.19.0.0
extra> Dependency directory: using directory-1.3.8.1
extra> Dependency extra: using extra-1.7.16
extra> Dependency filepath: using filepath-1.4.100.4
extra> Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.32
extra> Dependency unix: using unix-2.8.3.0
extra> Source component graph:
extra>     component lib
extra>     component test:extra-test dependency lib
extra> Configured component graph:
extra>     component extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
extra>         include base-4.19.0.0-b960
extra>         include clock-0.8.4-E6FqZKWyYxJIJ4JSdLgMz5
extra>         include directory-1.3.8.1-6a8e
extra>         include filepath-1.4.100.4-fa1c
extra>         include process-1.6.18.0-26fa
extra>         include time-1.12.2-d26d
extra>         include unix-2.8.3.0-8aa6
extra>     component extra-1.7.16-KLQi6gAiiYoJUvM66WpSD6-extra-test
extra>         include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
extra>         include base-4.19.0.0-b960
extra>         include directory-1.3.8.1-6a8e
extra>         include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
extra>         include filepath-1.4.100.4-fa1c
extra>         include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
extra>         include unix-2.8.3.0-8aa6
extra> Linked component graph:
extra>     unit extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
extra>         include base-4.19.0.0-b960
extra>         include clock-0.8.4-E6FqZKWyYxJIJ4JSdLgMz5
extra>         include directory-1.3.8.1-6a8e
extra>         include filepath-1.4.100.4-fa1c
extra>         include process-1.6.18.0-26fa
extra>         include time-1.12.2-d26d
extra>         include unix-2.8.3.0-8aa6
extra>         Control.Concurrent.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Control.Exception.Extra,Control.Monad.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Control.Monad.Extra,Data.Either.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.Either.Extra,Data.Foldable.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.Foldable.Extra,Data.IORef.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.IORef.Extra,Data.List.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.Typeable.Extra,Data.Version.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Data.Version.Extra,Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Extra,Numeric.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Numeric.Extra,System.Directory.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:System.Directory.Extra,System.Environment.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:System.Environment.Extra,System.IO.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:System.IO.Extra,System.Info.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:System.Info.Extra,System.Process.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:System.Process.Extra,System.Time.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:System.Time.Extra,Text.Read.Extra=extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ:Text.Read.Extra
extra>     unit extra-1.7.16-KLQi6gAiiYoJUvM66WpSD6-extra-test
extra>         include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
extra>         include base-4.19.0.0-b960
extra>         include directory-1.3.8.1-6a8e
extra>         include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
extra>         include filepath-1.4.100.4-fa1c
extra>         include quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
extra>         include unix-2.8.3.0-8aa6
extra> Ready component graph:
extra>     definite extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
extra>         depends base-4.19.0.0-b960
extra>         depends clock-0.8.4-E6FqZKWyYxJIJ4JSdLgMz5
extra>         depends directory-1.3.8.1-6a8e
extra>         depends filepath-1.4.100.4-fa1c
extra>         depends process-1.6.18.0-26fa
extra>         depends time-1.12.2-d26d
extra>         depends unix-2.8.3.0-8aa6
extra>     definite extra-1.7.16-KLQi6gAiiYoJUvM66WpSD6-extra-test
extra>         depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
extra>         depends base-4.19.0.0-b960
extra>         depends directory-1.3.8.1-6a8e
extra>         depends extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
extra>         depends filepath-1.4.100.4-fa1c
extra>         depends quickcheck-instances-0.3.32-H0OUGiN1mUzItgW0ngVluA
extra>         depends unix-2.8.3.0-8aa6
extra> Using Cabal-3.10.2.0 compiled by ghc-9.8
extra> Using compiler: ghc-9.8.1
extra> Using install prefix: /nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16
extra> Executables installed in:
extra> /nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16/bin
extra> Libraries installed in:
extra> /nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
extra> Dynamic Libraries installed in:
extra> /nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
extra> Private executables installed in:
extra> /nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16/libexec/x86_64-linux-ghc-9.8.1/extra-1.7.16
extra> Data files installed in:
extra> /nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16/share/x86_64-linux-ghc-9.8.1/extra-1.7.16
extra> Documentation installed in:
extra> /nix/store/9bn0pi563akh52vz575khy5kfwq823d8-extra-1.7.16-doc/share/doc/extra-1.7.16
extra> Configuration files installed in:
extra> /nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16/etc
extra> No alex found
extra> Using ar found on system at:
extra> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
extra> No c2hs found
extra> No cpphs found
extra> No doctest found
extra> Using gcc version 14.3.0 given by user at:
extra> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
extra> Using ghc version 9.8.1 found on system at:
extra> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
extra> Using ghc-pkg version 9.8.1 found on system at:
extra> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
extra> No ghcjs found
extra> No ghcjs-pkg found
extra> No greencard found
extra> Using haddock version 2.30.0 found on system at:
extra> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
extra> No happy found
extra> Using haskell-suite found on system at: haskell-suite-dummy-location
extra> Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
extra> No hmake found
extra> Using hpc version 0.69 found on system at:
extra> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
extra> Using hsc2hs version 0.68.10 found on system at:
extra> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
extra> Using hscolour version 1.25 found on system at:
extra> /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
extra> No jhc found
extra> Using ld found on system at:
extra> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
extra> No pkg-config found
extra> Using runghc version 9.8.1 found on system at:
extra> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
extra> Using strip version 2.44 found on system at:
extra> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
extra> Using tar found on system at:
extra> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
extra> No uhc found
extra> Running phase: buildPhase
extra> Preprocessing library for extra-1.7.16..
extra> Building library for extra-1.7.16..
extra> [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.o, dist/build/Data/IORef/Extra.dyn_o )
extra> [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.o, dist/build/Data/Monoid/Extra.dyn_o )
extra> [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.o, dist/build/Data/Tuple/Extra.dyn_o )
extra> [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.o, dist/build/Data/Typeable/Extra.dyn_o )
extra> [ 5 of 22] Compiling Numeric.Extra    ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
extra> [ 6 of 22] Compiling Partial          ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
extra> [ 7 of 22] Compiling Data.List.Extra  ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.o, dist/build/Data/List/Extra.dyn_o )
extra> [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.o, dist/build/Data/Version/Extra.dyn_o )
extra> [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.o, dist/build/Data/List/NonEmpty/Extra.dyn_o )
extra> [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.o, dist/build/Data/Either/Extra.dyn_o )
extra> [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.o, dist/build/Control/Exception/Extra.dyn_o )
extra> [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.o, dist/build/Control/Monad/Extra.dyn_o )
extra> [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.o, dist/build/Data/Foldable/Extra.dyn_o )
extra> [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.o, dist/build/Control/Concurrent/Extra.dyn_o )
extra> [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.o, dist/build/System/Directory/Extra.dyn_o )
extra> [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.o, dist/build/System/Environment/Extra.dyn_o )
extra> [17 of 22] Compiling System.IO.Extra  ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.o, dist/build/System/IO/Extra.dyn_o )
extra> [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.o, dist/build/System/Info/Extra.dyn_o )
extra> [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.o, dist/build/System/Process/Extra.dyn_o )
extra> [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.o, dist/build/System/Time/Extra.dyn_o )
extra> [21 of 22] Compiling Extra            ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
extra> [22 of 22] Compiling Text.Read.Extra  ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.o, dist/build/Text/Read/Extra.dyn_o )
extra> [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
extra> [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
extra> [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
extra> [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
extra> [ 5 of 22] Compiling Numeric.Extra    ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
extra> [ 6 of 22] Compiling Partial          ( src/Partial.hs, dist/build/Partial.p_o )
extra> [ 7 of 22] Compiling Data.List.Extra  ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
extra> [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
extra> [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
extra> [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
extra> [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
extra> [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
extra> [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
extra> [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
extra> [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
extra> [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
extra> [17 of 22] Compiling System.IO.Extra  ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
extra> [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
extra> [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
extra> [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
extra> [21 of 22] Compiling Extra            ( src/Extra.hs, dist/build/Extra.p_o )
extra> [22 of 22] Compiling Text.Read.Extra  ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
extra> Preprocessing test suite 'extra-test' for extra-1.7.16..
extra> Building test suite 'extra-test' for extra-1.7.16..
extra> [1 of 4] Compiling TestUtil         ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
extra> [2 of 4] Compiling TestGen          ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
extra> [3 of 4] Compiling TestCustom       ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
extra> [4 of 4] Compiling Test             ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
extra> [5 of 5] Linking dist/build/extra-test/extra-test
extra> Running phase: checkPhase
extra> Running 1 test suites...
extra> Test suite extra-test: RUNNING...
extra> withTempFile
extra> +++ OK, passed 1 test.
extra> captureOutput
extra> +++ OK, passed 1 test.
extra> \(x :: IO Int) -> void (once x) == pure ()
extra> +++ OK, passed 100 tests.
extra> \(x :: IO Int) -> join (once x) == x
extra> +++ OK, passed 100 tests.
extra> \(x :: IO Int) -> (do y <- once x; y; y) == x
extra> +++ OK, passed 100 tests.
extra> \(x :: IO Int) -> (do y <- once x; y ||| y) == x
extra> +++ OK, passed 100 tests.
extra> \(x :: IO Int) -> join (onceFork x) == x
extra> +++ OK, passed 100 tests.
extra> \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
extra> +++ OK, passed 100 tests.
extra> stringException "test"                           == pure "test"
extra> +++ OK, passed 1 test.
extra> stringException ("test" ++ undefined)            == pure "test<Exception>"
extra> +++ OK, passed 1 test.
extra> stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
extra> +++ OK, passed 1 test.
extra> stringException ['t','e','s','t',undefined]      == pure "test<Exception>"
extra> +++ OK, passed 1 test.
extra> ignore (print 1)    == print 1
extra> +++ OK, passed 1 test.
extra> ignore (fail "die") == pure ()
extra> +++ OK, passed 1 test.
extra> catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
extra> +++ OK, passed 1 test.
extra> seq (errorIO "foo") (print 1) == print 1
extra> +++ OK, passed 1 test.
extra> catch (assertIO True  >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
extra> +++ OK, passed 1 test.
extra> seq (assertIO False) (print 1) == print 1
extra> +++ OK, passed 1 test.
extra> retry 1 (print "x")  == print "x"
extra> +++ OK, passed 1 test.
extra> retry 3 (fail "die") == fail "die"
extra> +++ OK, passed 1 test.
extra> whenJust Nothing  print == pure ()
extra> +++ OK, passed 1 test.
extra> whenJust (Just 1) print == print 1
extra> +++ OK, passed 1 test.
extra> pureIf @Maybe True  5 == Just 5
extra> +++ OK, passed 1 test.
extra> pureIf @Maybe False 5 == Nothing
extra> +++ OK, passed 1 test.
extra> pureIf @[]    True  5 == [5]
extra> +++ OK, passed 1 test.
extra> pureIf @[]    False 5 == []
extra> +++ OK, passed 1 test.
extra> whenMaybe True  (print 1) == fmap Just (print 1)
extra> +++ OK, passed 1 test.
extra> whenMaybe False (print 1) == pure Nothing
extra> +++ OK, passed 1 test.
extra> \(x :: Maybe ()) -> unit x == x
extra> +++ OK, passed 100 tests.
extra> fold1M (\x y -> Just x) [] == undefined
extra> +++ OK, passed 1 test.
extra> fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
extra> +++ OK, passed 1 test.
extra> partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
extra> +++ OK, passed 1 test.
extra> partitionM (const Nothing) [1,2,3] == Nothing
extra> +++ OK, passed 1 test.
extra> loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
extra> +++ OK, passed 1 test.
extra> Just True  ||^ undefined  == Just True
extra> +++ OK, passed 1 test.
extra> Just False ||^ Just True  == Just True
extra> +++ OK, passed 1 test.
extra> Just False ||^ Just False == Just False
extra> +++ OK, passed 1 test.
extra> Just False &&^ undefined  == Just False
extra> +++ OK, passed 1 test.
extra> Just True  &&^ Just True  == Just True
extra> +++ OK, passed 1 test.
extra> Just True  &&^ Just False == Just False
extra> +++ OK, passed 1 test.
extra> anyM Just [False,True ,undefined] == Just True
extra> +++ OK, passed 1 test.
extra> anyM Just [False,False,undefined] == undefined
extra> +++ OK, passed 1 test.
extra> \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
extra> +++ OK, passed 100 tests.
extra> allM Just [True,False,undefined] == Just False
extra> +++ OK, passed 1 test.
extra> allM Just [True,True ,undefined] == undefined
extra> +++ OK, passed 1 test.
extra> \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
extra> +++ OK, passed 100 tests.
extra> orM [Just False,Just True ,undefined] == Just True
extra> +++ OK, passed 1 test.
extra> orM [Just False,Just False,undefined] == undefined
extra> +++ OK, passed 1 test.
extra> \xs -> Just (or xs) == orM (map Just xs)
extra> +++ OK, passed 100 tests.
extra> andM [Just True,Just False,undefined] == Just False
extra> +++ OK, passed 1 test.
extra> andM [Just True,Just True ,undefined] == undefined
extra> +++ OK, passed 1 test.
extra> \xs -> Just (and xs) == andM (map Just xs)
extra> +++ OK, passed 100 tests.
extra> findM (Just . isUpper) "teST"             == Just (Just 'S')
extra> +++ OK, passed 1 test.
extra> findM (Just . isUpper) "test"             == Just Nothing
extra> +++ OK, passed 1 test.
extra> findM (Just . const True) ["x",undefined] == Just (Just "x")
extra> +++ OK, passed 1 test.
extra> fromLeft 1 (Left 3) == 3
extra> +++ OK, passed 1 test.
extra> fromLeft 1 (Right "foo") == 1
extra> +++ OK, passed 1 test.
extra> fromRight 1 (Right 3) == 3
extra> +++ OK, passed 1 test.
extra> fromRight 1 (Left "foo") == 1
extra> +++ OK, passed 1 test.
extra> \x -> fromLeft' (Left  x) == x
extra> +++ OK, passed 100 tests.
extra> \x -> fromLeft' (Right x) == undefined
extra> +++ OK, passed 100 tests.
extra> \x -> fromRight' (Right x) == x
extra> +++ OK, passed 100 tests.
extra> \x -> fromRight' (Left  x) == undefined
extra> +++ OK, passed 100 tests.
extra> \x -> fromEither (Left x ) == x
extra> +++ OK, passed 100 tests.
extra> \x -> fromEither (Right x) == x
extra> +++ OK, passed 100 tests.
extra> \a b -> maybeToEither a (Just b) == Right b
extra> +++ OK, passed 100 tests.
extra> \a -> maybeToEither a Nothing == Left a
extra> +++ OK, passed 100 tests.
extra> \x -> eitherToMaybe (Left x) == Nothing
extra> +++ OK, passed 100 tests.
extra> \x -> eitherToMaybe (Right x) == Just x
extra> +++ OK, passed 100 tests.
extra> mapLeft show (Left 1) == Left "1"
extra> +++ OK, passed 1 test.
extra> mapLeft show (Right True) == Right True
extra> +++ OK, passed 1 test.
extra> mapRight show (Left 1) == Left 1
extra> +++ OK, passed 1 test.
extra> mapRight show (Right True) == Right "True"
extra> +++ OK, passed 1 test.
extra> \xs -> repeatedly (splitAt 3) xs  == chunksOf 3 xs
extra> +++ OK, passed 100 tests.
extra> \xs -> repeatedly word1 (trim xs) == words xs
extra> +++ OK, passed 100 tests.
extra> \xs -> repeatedly line1 xs == lines xs
extra> +++ OK, passed 100 tests.
extra> disjoint [1,2,3] [4,5] == True
extra> +++ OK, passed 1 test.
extra> disjoint [1,2,3] [4,1] == False
extra> +++ OK, passed 1 test.
extra> disjointOrd [1,2,3] [4,5] == True
extra> +++ OK, passed 1 test.
extra> disjointOrd [1,2,3] [4,1] == False
extra> +++ OK, passed 1 test.
extra> disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
extra> +++ OK, passed 1 test.
extra> disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
extra> +++ OK, passed 1 test.
extra> anySame [1,1,2] == True
extra> +++ OK, passed 1 test.
extra> anySame [1,2,3] == False
extra> +++ OK, passed 1 test.
extra> anySame (1:2:1:undefined) == True
extra> +++ OK, passed 1 test.
extra> anySame [] == False
extra> +++ OK, passed 1 test.
extra> \xs -> anySame xs == (length (nub xs) < length xs)
extra> +++ OK, passed 100 tests.
extra> allSame [1,1,2] == False
extra> +++ OK, passed 1 test.
extra> allSame [1,1,1] == True
extra> +++ OK, passed 1 test.
extra> allSame [1]     == True
extra> +++ OK, passed 1 test.
extra> allSame []      == True
extra> +++ OK, passed 1 test.
extra> allSame (1:1:2:undefined) == False
extra> +++ OK, passed 1 test.
extra> \xs -> allSame xs == (length (nub xs) <= 1)
extra> +++ OK, passed 100 tests.
extra> headDef 1 []      == 1
extra> +++ OK, passed 1 test.
extra> headDef 1 [2,3,4] == 2
extra> +++ OK, passed 1 test.
extra> \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
extra> +++ OK, passed 100 tests.
extra> lastDef 1 []      == 1
extra> +++ OK, passed 1 test.
extra> lastDef 1 [2,3,4] == 4
extra> +++ OK, passed 1 test.
extra> \x xs -> lastDef x xs == last (x:xs)
extra> +++ OK, passed 100 tests.
extra> [2,3,4] !? 1    == Just 3
extra> +++ OK, passed 1 test.
extra> [2,3,4] !? (-1) == Nothing
extra> +++ OK, passed 1 test.
extra> []      !? 0    == Nothing
extra> +++ OK, passed 1 test.
extra> notNull []  == False
extra> +++ OK, passed 1 test.
extra> notNull [1] == True
extra> +++ OK, passed 1 test.
extra> \xs -> notNull xs == not (null xs)
extra> +++ OK, passed 100 tests.
extra> list 1 (\v _ -> v - 2) [5,6,7] == 3
extra> +++ OK, passed 1 test.
extra> list 1 (\v _ -> v - 2) []      == 1
extra> +++ OK, passed 1 test.
extra> \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
extra> +++ OK, passed 100 tests.
extra> unsnoc "test" == Just ("tes",'t')
extra> +++ OK, passed 1 test.
extra> unsnoc ""     == Nothing
extra> +++ OK, passed 1 test.
extra> \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
extra> +++ OK, passed 100 tests.
extra> cons 't' "est" == "test"
extra> +++ OK, passed 1 test.
extra> \x xs -> uncons (cons x xs) == Just (x,xs)
extra> +++ OK, passed 100 tests.
extra> snoc "tes" 't' == "test"
extra> +++ OK, passed 1 test.
extra> \xs x -> unsnoc (snoc xs x) == Just (xs,x)
extra> +++ OK, passed 100 tests.
extra> enumerate == [False, True]
extra> +++ OK, passed 1 test.
extra> takeEnd 3 "hello"  == "llo"
extra> +++ OK, passed 1 test.
extra> takeEnd 5 "bye"    == "bye"
extra> +++ OK, passed 1 test.
extra> takeEnd (-1) "bye" == ""
extra> +++ OK, passed 1 test.
extra> \i xs -> takeEnd i xs `isSuffixOf` xs
extra> +++ OK, passed 100 tests.
extra> \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
extra> +++ OK, passed 100 tests.
extra> dropEnd 3 "hello"  == "he"
extra> +++ OK, passed 1 test.
extra> dropEnd 5 "bye"    == ""
extra> +++ OK, passed 1 test.
extra> dropEnd (-1) "bye" == "bye"
extra> +++ OK, passed 1 test.
extra> \i xs -> dropEnd i xs `isPrefixOf` xs
extra> +++ OK, passed 100 tests.
extra> \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
extra> +++ OK, passed 100 tests.
extra> \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
extra> +++ OK, passed 100 tests.
extra> splitAtEnd 3 "hello" == ("he","llo")
extra> +++ OK, passed 1 test.
extra> splitAtEnd 3 "he"    == ("", "he")
extra> +++ OK, passed 1 test.
extra> \i xs -> uncurry (++) (splitAt i xs) == xs
extra> +++ OK, passed 100 tests.
extra> \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
extra> +++ OK, passed 100 tests.
extra> \i xs -> zip [i..] xs == zipFrom i xs
extra> +++ OK, passed 100 tests.
extra> zipFrom False [1..3] == [(False,1),(True, 2)]
extra> +++ OK, passed 1 test.
extra> \i xs -> zipWithFrom (,) i xs == zipFrom i xs
extra> +++ OK, passed 100 tests.
extra> concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
extra> +++ OK, passed 1 test.
extra> concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
extra> +++ OK, passed 1 test.
extra> takeWhileEnd even [2,3,4,6] == [4,6]
extra> +++ OK, passed 1 test.
extra> trim      "  hello   " == "hello"
extra> +++ OK, passed 1 test.
extra> trimStart "  hello   " == "hello   "
extra> +++ OK, passed 1 test.
extra> trimEnd   "  hello   " == "  hello"
extra> +++ OK, passed 1 test.
extra> \s -> trim s == trimEnd (trimStart s)
extra> +++ OK, passed 100 tests.
extra> lower "This is A TEST" == "this is a test"
extra> +++ OK, passed 1 test.
extra> lower "" == ""
extra> +++ OK, passed 1 test.
extra> upper "This is A TEST" == "THIS IS A TEST"
extra> +++ OK, passed 1 test.
extra> upper "" == ""
extra> +++ OK, passed 1 test.
extra> word1 "" == ("", "")
extra> +++ OK, passed 1 test.
extra> word1 "keyword rest of string" == ("keyword","rest of string")
extra> +++ OK, passed 1 test.
extra> word1 "  keyword\n  rest of string" == ("keyword","rest of string")
extra> +++ OK, passed 1 test.
extra> \s -> fst (word1 s) == concat (take 1 $ words s)
extra> +++ OK, passed 100 tests.
extra> \s -> words (snd $ word1 s) == drop 1 (words s)
extra> +++ OK, passed 100 tests.
extra> line1 "" == ("", "")
extra> +++ OK, passed 1 test.
extra> line1 "test" == ("test","")
extra> +++ OK, passed 1 test.
extra> line1 "test\n" == ("test","")
extra> +++ OK, passed 1 test.
extra> line1 "test\nrest" == ("test","rest")
extra> +++ OK, passed 1 test.
extra> line1 "test\nrest\nmore" == ("test","rest\nmore")
extra> +++ OK, passed 1 test.
extra> escapeHTML "this is a test" == "this is a test"
extra> +++ OK, passed 1 test.
extra> escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
extra> +++ OK, passed 1 test.
extra> escapeHTML "t'was another test" == "t&#39;was another test"
extra> +++ OK, passed 1 test.
extra> \xs -> unescapeHTML (escapeHTML xs) == xs
extra> +++ OK, passed 100 tests.
extra> escapeJSON "this is a test" == "this is a test"
extra> +++ OK, passed 1 test.
extra> escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
extra> +++ OK, passed 1 test.
extra> escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
extra> +++ OK, passed 1 test.
extra> \xs -> unescapeJSON (escapeJSON xs) == xs
extra> +++ OK, passed 100 tests.
extra> groupOn abs [1,-1,2] == [[1,-1], [2]]
extra> +++ OK, passed 1 test.
extra> groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
extra> +++ OK, passed 1 test.
extra> maximumOn id [] == undefined
extra> +++ OK, passed 1 test.
extra> maximumOn length ["test","extra","a"] == "extra"
extra> +++ OK, passed 1 test.
extra> minimumOn id [] == undefined
extra> +++ OK, passed 1 test.
extra> minimumOn length ["test","extra","a"] == "a"
extra> +++ OK, passed 1 test.
extra> groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
extra> +++ OK, passed 1 test.
extra> \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
extra> +++ OK, passed 100 tests.
extra> \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
extra> +++ OK, passed 100 tests.
extra> groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
extra> +++ OK, passed 1 test.
extra> groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
extra> +++ OK, passed 1 test.
extra> sum' [1, 2, 3] == 6
extra> +++ OK, passed 1 test.
extra> sumOn' read ["1", "2", "3"] == 6
extra> +++ OK, passed 1 test.
extra> product' [1, 2, 4] == 8
extra> +++ OK, passed 1 test.
extra> productOn' read ["1", "2", "4"] == 8
extra> +++ OK, passed 1 test.
extra> merge "ace" "bd" == "abcde"
extra> +++ OK, passed 1 test.
extra> \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
extra> +++ OK, passed 100 tests.
extra> replace "el" "_" "Hello Bella" == "H_lo B_la"
extra> +++ OK, passed 1 test.
extra> replace "el" "e" "Hello"       == "Helo"
extra> +++ OK, passed 1 test.
extra> replace "" "x" "Hello"         == "xHxexlxlxox"
extra> +++ OK, passed 1 test.
extra> replace "" "x" ""              == "x"
extra> +++ OK, passed 1 test.
extra> \xs ys -> replace xs xs ys == ys
extra> +++ OK, passed 100 tests.
extra> breakEnd isLower "youRE" == ("you","RE")
extra> +++ OK, passed 1 test.
extra> breakEnd isLower "youre" == ("youre","")
extra> +++ OK, passed 1 test.
extra> breakEnd isLower "YOURE" == ("","YOURE")
extra> +++ OK, passed 1 test.
extra> \f xs -> breakEnd (not . f) xs == spanEnd f  xs
extra> +++ OK, passed 100 tests.
extra> spanEnd isUpper "youRE" == ("you","RE")
extra> +++ OK, passed 1 test.
extra> spanEnd (not . isSpace) "x y z" == ("x y ","z")
extra> +++ OK, passed 1 test.
extra> \f xs -> uncurry (++) (spanEnd f xs) == xs
extra> +++ OK, passed 100 tests.
extra> \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
extra> +++ OK, passed 100 tests.
extra> wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
extra> +++ OK, passed 1 test.
extra> \s -> wordsBy isSpace s == words s
extra> +++ OK, passed 100 tests.
extra> linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
extra> +++ OK, passed 1 test.
extra> \s -> linesBy (== '\n') s == lines s
extra> +++ OK, passed 100 tests.
extra> linesBy (== ';') "my;list;here;" == ["my","list","here"]
extra> +++ OK, passed 1 test.
extra> firstJust id [Nothing,Just 3]  == Just 3
extra> +++ OK, passed 1 test.
extra> firstJust id [Nothing,Nothing] == Nothing
extra> +++ OK, passed 1 test.
extra> drop1 ""         == ""
extra> +++ OK, passed 1 test.
extra> drop1 "test"     == "est"
extra> +++ OK, passed 1 test.
extra> \xs -> drop 1 xs == drop1 xs
extra> +++ OK, passed 100 tests.
extra> dropEnd1 ""         == ""
extra> +++ OK, passed 1 test.
extra> dropEnd1 "test"     == "tes"
extra> +++ OK, passed 1 test.
extra> \xs -> dropEnd 1 xs == dropEnd1 xs
extra> +++ OK, passed 100 tests.
extra> mconcatMap Sum [1,2,3] == Sum 6
extra> +++ OK, passed 1 test.
extra> \f xs -> mconcatMap f xs == concatMap f xs
extra> +++ OK, passed 100 tests.
extra> breakOn "::" "a::b::c" == ("a", "::b::c")
extra> +++ OK, passed 1 test.
extra> breakOn "/" "foobar"   == ("foobar", "")
extra> +++ OK, passed 1 test.
extra> \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
extra> +++ OK, passed 100 tests.
extra> breakOnEnd "::" "a::b::c" == ("a::b::", "c")
extra> +++ OK, passed 1 test.
extra> splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
extra> +++ OK, passed 1 test.
extra> splitOn "aaa"  "aaaXaaaXaaaXaaa"  == ["","X","X","X",""]
extra> +++ OK, passed 1 test.
extra> splitOn "x"    "x"                == ["",""]
extra> +++ OK, passed 1 test.
extra> splitOn "x"    ""                 == [""]
extra> +++ OK, passed 1 test.
extra> \s x -> s /= "" ==> intercalate s (splitOn s x) == x
extra> +++ OK, passed 100 tests; 18 discarded.
extra> \c x -> splitOn [c] x                           == split (==c) x
extra> +++ OK, passed 100 tests.
extra> split (== 'a') "aabbaca" == ["","","bb","c",""]
extra> +++ OK, passed 1 test.
extra> split (== 'a') ""        == [""]
extra> +++ OK, passed 1 test.
extra> split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
extra> +++ OK, passed 1 test.
extra> split (== ',') "my,list,here" == ["my","list","here"]
extra> +++ OK, passed 1 test.
extra> dropWhileEnd  isSpace "ab cde  " == "ab cde"
extra> +++ OK, passed 1 test.
extra> dropWhileEnd' isSpace "ab cde  " == "ab cde"
extra> +++ OK, passed 1 test.
extra> last (dropWhileEnd  even [undefined,3]) == undefined
extra> +++ OK, passed 1 test.
extra> last (dropWhileEnd' even [undefined,3]) == 3
extra> +++ OK, passed 1 test.
extra> head (dropWhileEnd  even (3:undefined)) == 3
extra> +++ OK, passed 1 test.
extra> head (dropWhileEnd' even (3:undefined)) == undefined
extra> +++ OK, passed 1 test.
extra> dropPrefix "Mr. " "Mr. Men" == "Men"
extra> +++ OK, passed 1 test.
extra> dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
extra> +++ OK, passed 1 test.
extra> dropSuffix "!" "Hello World!"  == "Hello World"
extra> +++ OK, passed 1 test.
extra> dropSuffix "!" "Hello World!!" == "Hello World!"
extra> +++ OK, passed 1 test.
extra> dropSuffix "!" "Hello World."  == "Hello World."
extra> +++ OK, passed 1 test.
extra> stripSuffix "bar" "foobar" == Just "foo"
extra> +++ OK, passed 1 test.
extra> stripSuffix ""    "baz"    == Just "baz"
extra> +++ OK, passed 1 test.
extra> stripSuffix "foo" "quux"   == Nothing
extra> +++ OK, passed 1 test.
extra> stripInfix "::" "a::b::c" == Just ("a", "b::c")
extra> +++ OK, passed 1 test.
extra> stripInfix "/" "foobar"   == Nothing
extra> +++ OK, passed 1 test.
extra> stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
extra> +++ OK, passed 1 test.
extra> chunksOf 3 "my test" == ["my ","tes","t"]
extra> +++ OK, passed 1 test.
extra> chunksOf 3 "mytest"  == ["myt","est"]
extra> +++ OK, passed 1 test.
extra> chunksOf 8 ""        == []
extra> +++ OK, passed 1 test.
extra> chunksOf 0 "test"    == undefined
extra> +++ OK, passed 1 test.
extra> nubSort "this is a test" == " aehist"
extra> +++ OK, passed 1 test.
extra> \xs -> nubSort xs == nub (sort xs)
extra> +++ OK, passed 100 tests.
extra> nubSortOn length ["a","test","of","this"] == ["a","of","test"]
extra> +++ OK, passed 1 test.
extra> nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
extra> +++ OK, passed 1 test.
extra> nubOrd "this is a test" == "this ae"
extra> +++ OK, passed 1 test.
extra> nubOrd (take 4 ("this" ++ undefined)) == "this"
extra> +++ OK, passed 1 test.
extra> \xs -> nubOrd xs == nub xs
extra> +++ OK, passed 100 tests.
extra> nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
extra> +++ OK, passed 1 test.
extra> nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
extra> +++ OK, passed 1 test.
extra> zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
extra> +++ OK, passed 1 test.
extra> zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
extra> +++ OK, passed 1 test.
extra> zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
extra> +++ OK, passed 1 test.
extra> compareLength [1,2,3] 1 == GT
extra> +++ OK, passed 1 test.
extra> compareLength [1,2] 2 == EQ
extra> +++ OK, passed 1 test.
extra> \(xs :: [Int]) n -> compareLength xs n == compare (length xs) n
extra> +++ OK, passed 100 tests.
extra> compareLength (1:2:3:undefined) 2 == GT
extra> +++ OK, passed 1 test.
extra> comparingLength [1,2,3] [False] == GT
extra> +++ OK, passed 1 test.
extra> comparingLength [1,2] "ab" == EQ
extra> +++ OK, passed 1 test.
extra> \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
extra> +++ OK, passed 100 tests.
extra> comparingLength [1,2] (1:2:3:undefined) == LT
extra> +++ OK, passed 1 test.
extra> comparingLength (1:2:3:undefined) [1,2] == GT
extra> +++ OK, passed 1 test.
extra> mwhen True  "test" == "test"
extra> +++ OK, passed 1 test.
extra> mwhen False "test" == ""
extra> +++ OK, passed 1 test.
extra> first succ (1,"test") == (2,"test")
extra> +++ OK, passed 1 test.
extra> second reverse (1,"test") == (1,"tset")
extra> +++ OK, passed 1 test.
extra> firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
extra> +++ OK, passed 1 test.
extra> secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
extra> +++ OK, passed 1 test.
extra> (succ *** reverse) (1,"test") == (2,"tset")
extra> +++ OK, passed 1 test.
extra> (succ &&& pred) 1 == (2,0)
extra> +++ OK, passed 1 test.
extra> dupe 12 == (12, 12)
extra> +++ OK, passed 1 test.
extra> both succ (1,2) == (2,3)
extra> +++ OK, passed 1 test.
extra> first3 succ (1,1,1) == (2,1,1)
extra> +++ OK, passed 1 test.
extra> second3 succ (1,1,1) == (1,2,1)
extra> +++ OK, passed 1 test.
extra> third3 succ (1,1,1) == (1,1,2)
extra> +++ OK, passed 1 test.
extra> \x -> readVersion (showVersion x) == x
extra> +++ OK, passed 100 tests.
extra> readVersion "hello" == undefined
extra> +++ OK, passed 1 test.
extra> showDP 4 pi == "3.1416"
extra> +++ OK, passed 1 test.
extra> showDP 0 pi == "3"
extra> +++ OK, passed 1 test.
extra> showDP 2 3  == "3.00"
extra> +++ OK, passed 1 test.
extra> withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
extra> +++ OK, passed 1 test.
extra> withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
extra> +++ OK, passed 1 test.
extra> listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
extra> +++ OK, passed 1 test.
extra> listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
extra> +++ OK, passed 1 test.
extra> listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
extra> +++ OK, passed 1 test.
extra> listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
extra> +++ OK, passed 1 test.
extra> listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName)    ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
extra> +++ OK, passed 1 test.
extra> listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
extra> +++ OK, passed 1 test.
extra> isWindows == (os == "mingw32")
extra> +++ OK, passed 1 test.
extra> \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
extra> +++ OK, passed 100 tests.
extra> \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
extra> +++ OK, passed 100 tests.
extra> \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
extra> +++ OK, passed 100 tests.
extra> captureOutput (print 1) == pure ("1\n",())
extra> +++ OK, passed 1 test.
extra> withTempFile doesFileExist == pure True
extra> +++ OK, passed 1 test.
extra> (doesFileExist =<< withTempFile pure) == pure False
extra> +++ OK, passed 1 test.
extra> withTempFile readFile' == pure ""
extra> +++ OK, passed 1 test.
extra> withTempDir doesDirectoryExist == pure True
extra> +++ OK, passed 1 test.
extra> (doesDirectoryExist =<< withTempDir pure) == pure False
extra> +++ OK, passed 1 test.
extra> withTempDir listFiles == pure []
extra> +++ OK, passed 1 test.
extra> fileEq "does_not_exist1" "does_not_exist2" == undefined
extra> +++ OK, passed 1 test.
extra> fileEq "does_not_exist" "does_not_exist" == undefined
extra> +++ OK, passed 1 test.
extra> withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
extra> +++ OK, passed 1 test.
extra> withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
extra> +++ OK, passed 1 test.
extra> withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
extra> +++ OK, passed 1 test.
extra> withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
extra> +++ OK, passed 1 test.
extra> fmap (round . fst) (duration $ sleep 1) == pure 1
extra> +++ OK, passed 1 test.
extra> timeout (-3) (print 1) == pure Nothing
extra> +++ OK, passed 1 test.
extra> timeout 0.1  (print 1) == fmap Just (print 1)
extra> +++ OK, passed 1 test.
extra> do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
extra> 0.100258576
extra> +++ OK, passed 1 test.
extra> timeout 0.1  (sleep 2 >> print 1) == pure Nothing
extra> +++ OK, passed 1 test.
extra> showDuration 3.435   == "3.44s"
extra> +++ OK, passed 1 test.
extra> showDuration 623.8   == "10m24s"
extra> +++ OK, passed 1 test.
extra> showDuration 62003.8 == "17h13m"
extra> +++ OK, passed 1 test.
extra> showDuration 1e8     == "27777h47m"
extra> +++ OK, passed 1 test.
extra> do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
extra> +++ OK, passed 1 test.
extra> do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
extra> +++ OK, passed 1 test.
extra> Extra export
extra> +++ OK, passed 1 test.
extra> withTempFile
extra> ....done
extra> withTempDir
extra> ....done
extra> retry
extra> +++ OK, passed 1 test.
extra> barrier
extra> Success (323 tests)
extra> Test suite extra-test: PASS
extra> Test suite logged to: dist/test/extra-1.7.16-extra-test.log
extra> 1 of 1 test suites (1 of 1 test cases) passed.
extra> Running phase: haddockPhase
extra> Preprocessing library for extra-1.7.16..
extra> Running Haddock on library for extra-1.7.16..
extra> Warning: --source-* options are ignored when --hyperlinked-source is enabled.
extra> [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing )
extra> [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing )
extra> [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing )
extra> [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing )
extra> [ 5 of 22] Compiling Numeric.Extra    ( src/Numeric/Extra.hs, nothing )
extra> [ 6 of 22] Compiling Partial          ( src/Partial.hs, nothing )
extra> [ 7 of 22] Compiling Data.List.Extra  ( src/Data/List/Extra.hs, nothing )
extra> [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing )
extra> [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing )
extra> [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing )
extra> [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing )
extra> [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing )
extra> [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing )
extra> [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing )
extra> [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing )
extra> [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing )
extra> [17 of 22] Compiling System.IO.Extra  ( src/System/IO/Extra.hs, nothing )
extra> [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing )
extra> [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing )
extra> [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing )
extra> [21 of 22] Compiling Extra            ( src/Extra.hs, nothing )
extra> [22 of 22] Compiling Text.Read.Extra  ( src/Text/Read/Extra.hs, nothing )
extra> Haddock coverage:
extra>  100% (  6 /  6) in 'Data.IORef.Extra'
extra>  100% (  4 /  4) in 'Data.Monoid.Extra'
extra>  100% ( 28 / 28) in 'Data.Tuple.Extra'
extra>  100% (  2 /  2) in 'Data.Typeable.Extra'
extra>  100% (  7 /  7) in 'Numeric.Extra'
extra> Warning: '(:)' is out of scope.
extra>     If you qualify the identifier, haddock can try to link it anyway.
extra> Warning: 'unzip' is ambiguous. It is defined
extra>     * in ‘Data.Functor’
extra>     * in ‘GHC.List’
extra>     You may be able to disambiguate the identifier by qualifying it or
extra>     by specifying the type/value namespace explicitly.
extra>     Defaulting to the one defined in ‘GHC.List’
extra> Warning: 'firstJustM' is out of scope.
extra>     If you qualify the identifier, haddock can try to link it anyway.
extra>  100% ( 85 / 85) in 'Data.List.Extra'
extra> Warning: 'Version' is ambiguous. It is defined
extra>     * in ‘Data.Version’
extra>     * in ‘Data.Version’
extra>     You may be able to disambiguate the identifier by qualifying it or
extra>     by specifying the type/value namespace explicitly.
extra>     Defaulting to the one defined in ‘Data.Version’
extra>  100% (  3 /  3) in 'Data.Version.Extra'
extra> Warning: '(!?)' is ambiguous. It is defined
extra>     * in ‘GHC.List’
extra>     * at src/Data/List/NonEmpty/Extra.hs:48:1
extra>     You may be able to disambiguate the identifier by qualifying it or
extra>     by specifying the type/value namespace explicitly.
extra>     Defaulting to the one defined at src/Data/List/NonEmpty/Extra.hs:48:1
extra> Warning: 'union' is ambiguous. It is defined
extra>     * in ‘Data.OldList’
extra>     * at src/Data/List/NonEmpty/Extra.hs:80:1
extra>     You may be able to disambiguate the identifier by qualifying it or
extra>     by specifying the type/value namespace explicitly.
extra>     Defaulting to the one defined at src/Data/List/NonEmpty/Extra.hs:80:1
extra>  100% ( 22 / 22) in 'Data.List.NonEmpty.Extra'
extra> Warning: 'fromJust' is out of scope.
extra>     If you qualify the identifier, haddock can try to link it anyway.
extra>  100% ( 11 / 11) in 'Data.Either.Extra'
extra> Warning: 'ErrorCall' is ambiguous. It is defined
extra>     * in ‘GHC.Exception’
extra>     * in ‘GHC.Exception’
extra>     You may be able to disambiguate the identifier by qualifying it or
extra>     by specifying the type/value namespace explicitly.
extra>     Defaulting to the one defined in ‘GHC.Exception’
extra> Warning: 'AssertionFailed' is ambiguous. It is defined
extra>     * in ‘GHC.IO.Exception’
extra>     * in ‘GHC.IO.Exception’
extra>     You may be able to disambiguate the identifier by qualifying it or
extra>     by specifying the type/value namespace explicitly.
extra>     Defaulting to the one defined in ‘GHC.IO.Exception’
extra> Warning: 'SomeException' is ambiguous. It is defined
extra>     * in ‘GHC.Exception.Type’
extra>     * in ‘GHC.Exception.Type’
extra>     You may be able to disambiguate the identifier by qualifying it or
extra>     by specifying the type/value namespace explicitly.
extra>     Defaulting to the one defined in ‘GHC.Exception.Type’
extra>  100% ( 21 / 21) in 'Control.Exception.Extra'
extra> Warning: 'partition' is out of scope.
extra>     If you qualify the identifier, haddock can try to link it anyway.
extra> Warning: 'mconcatMap' is out of scope.
extra>     If you qualify the identifier, haddock can try to link it anyway.
extra> Warning: 'find' is out of scope.
extra>     If you qualify the identifier, haddock can try to link it anyway.
extra>  100% ( 38 / 38) in 'Control.Monad.Extra'
extra>   92% ( 12 / 13) in 'Data.Foldable.Extra'
extra>   Missing documentation for:
extra>     Module header
extra> Warning: 'Lock' is ambiguous. It is defined
extra>     * at src/Control/Concurrent/Extra.hs:106:16
extra>     * at src/Control/Concurrent/Extra.hs:106:1
extra>     You may be able to disambiguate the identifier by qualifying it or
extra>     by specifying the type/value namespace explicitly.
extra>     Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
extra> Warning: 'Var' is ambiguous. It is defined
extra>     * at src/Control/Concurrent/Extra.hs:146:17
extra>     * at src/Control/Concurrent/Extra.hs:146:1
extra>     You may be able to disambiguate the identifier by qualifying it or
extra>     by specifying the type/value namespace explicitly.
extra>     Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
extra> Warning: 'Barrier' is ambiguous. It is defined
extra>     * at src/Control/Concurrent/Extra.hs:210:21
extra>     * at src/Control/Concurrent/Extra.hs:210:1
extra>     You may be able to disambiguate the identifier by qualifying it or
extra>     by specifying the type/value namespace explicitly.
extra>     Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
extra>  100% ( 27 / 27) in 'Control.Concurrent.Extra'
extra> Warning: 'createDirectory' is ambiguous. It is defined
extra>     * in ‘System.Directory’
extra>     * in ‘System.Posix.Directory’
extra>     You may be able to disambiguate the identifier by qualifying it or
extra>     by specifying the type/value namespace explicitly.
extra>     Defaulting to the one defined in ‘System.Posix.Directory’
extra>  100% (  8 /  8) in 'System.Directory.Extra'
extra>  100% (  2 /  2) in 'System.Environment.Extra'
extra>  100% ( 26 / 26) in 'System.IO.Extra'
extra>  100% (  4 /  4) in 'System.Info.Extra'
extra>  100% (  5 /  5) in 'System.Process.Extra'
extra>  100% (  8 /  8) in 'System.Time.Extra'
extra>  100% (268 /268) in 'Extra'
extra>  100% (  2 /  2) in 'Text.Read.Extra'
extra> Warning: Data.Tuple.Extra: could not find link destinations for:
extra>  - GHC.Generics.Rep1_Solo
extra>  - GHC.Generics.Rep_Solo
extra> Documentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
extra> Preprocessing test suite 'extra-test' for extra-1.7.16..
extra> Running phase: installPhase
extra> Installing library in /nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
extra> Running phase: fixupPhase
extra> shrinking RPATHs of ELF executables and libraries in /nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16
extra> shrinking /nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSextra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ-ghc9.8.1.so
extra> checking for references to /build/ in /nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16...
extra> patching script interpreter paths in /nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16
extra> stripping (with command strip and flags -S -p) in  /nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16/lib
extra> shrinking RPATHs of ELF executables and libraries in /nix/store/9bn0pi563akh52vz575khy5kfwq823d8-extra-1.7.16-doc
extra> checking for references to /build/ in /nix/store/9bn0pi563akh52vz575khy5kfwq823d8-extra-1.7.16-doc...
extra> patching script interpreter paths in /nix/store/9bn0pi563akh52vz575khy5kfwq823d8-extra-1.7.16-doc
extra (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/9bn0pi563akh52vz575khy5kfwq823d8-extra-1.7.16-doc /nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16
extra (post)> Pushing 2 paths (68 are already present) using zstd to cache sellout ⏳
extra (post)> 
extra (post)> Pushing /nix/store/9bn0pi563akh52vz575khy5kfwq823d8-extra-1.7.16-doc (3.06 MiB)
extra (post)> Pushing /nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16 (4.07 MiB)
extra (post)> 
extra (post)> All done.
extra (post)> added 2 signatures
extra (post)> added 2 signatures
extra (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/9bn0pi563akh52vz575khy5kfwq823d8-extra-1.7.16-doc /nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16
extra (post)> copying 2 paths...
extra (post)> copying path '/nix/store/9bn0pi563akh52vz575khy5kfwq823d8-extra-1.7.16-doc' to 'https://cache.nix-ci.com'...
extra (post)> copying path '/nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16' to 'https://cache.nix-ci.com'...
extra (post)> copying 1 paths...
extra (post)> copying path '/nix/store/kbkly0bgcxjqkwvwxci02z8fvkrzvaka-extra-1.7.16.drv' to 'https://cache.nix-ci.com'...
extra (post)> added 0 signatures
extra (post)> added 0 signatures
extra (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/9bn0pi563akh52vz575khy5kfwq823d8-extra-1.7.16-doc /nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16
extra (post)> copying 2 paths...
extra (post)> copying path '/nix/store/9bn0pi563akh52vz575khy5kfwq823d8-extra-1.7.16-doc' to 'ssh-ng://worker.nix-ci.com'...
extra (post)> copying path '/nix/store/rr7qasrzpiwn1mwbpyq46wamk2vhncxp-extra-1.7.16' to 'ssh-ng://worker.nix-ci.com'...
extra (post)> copying 1 paths...
extra (post)> copying path '/nix/store/kbkly0bgcxjqkwvwxci02z8fvkrzvaka-extra-1.7.16.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/zf0xsjlpw0xhpkk7wdrsqp2ag77ycx2a-algebraic-graphs-0.7.drv'...
algebraic-graphs> Running phase: setupCompilerEnvironmentPhase
algebraic-graphs> Build with /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1.
algebraic-graphs> Running phase: unpackPhase
algebraic-graphs> unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
algebraic-graphs> source root is algebraic-graphs-0.7
algebraic-graphs> setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
algebraic-graphs> Running phase: patchPhase
algebraic-graphs> Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
algebraic-graphs> Running phase: compileBuildDriverPhase
algebraic-graphs> setupCompileFlags: -package-db=/build/tmp.uKG7Ht7aE4/setup-package.conf.d -threaded
algebraic-graphs> [1 of 2] Compiling Main             ( Setup.hs, /build/tmp.uKG7Ht7aE4/Main.o )
algebraic-graphs> [2 of 2] Linking Setup
algebraic-graphs> Running phase: updateAutotoolsGnuConfigScriptsPhase
algebraic-graphs> Running phase: configurePhase
algebraic-graphs> configureFlags: --verbose --prefix=/nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/id0zmyaaqz7k22fqngf4r7nlqizdqnxx-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.uKG7Ht7aE4/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/vaix9m2syrilm7hv3690plsk35y0arwm-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/lib
algebraic-graphs> Using Parsec parser
algebraic-graphs> Configuring algebraic-graphs-0.7...
algebraic-graphs> Dependency array >=0.4 && <0.6: using array-0.5.6.0
algebraic-graphs> Dependency base >=4.11 && <5: using base-4.19.0.0
algebraic-graphs> Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
algebraic-graphs> Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
algebraic-graphs> Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
algebraic-graphs> Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.14.3
algebraic-graphs> Dependency algebraic-graphs: using algebraic-graphs-0.7
algebraic-graphs> Dependency array >=0.4 && <0.6: using array-0.5.6.0
algebraic-graphs> Dependency base >=4.11 && <5: using base-4.19.0.0
algebraic-graphs> Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
algebraic-graphs> Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.0.0
algebraic-graphs> Dependency extra >=1.4 && <2: using extra-1.7.16
algebraic-graphs> Dependency inspection-testing >=0.4.2.2 && <0.6: using
algebraic-graphs> inspection-testing-0.5.0.3
algebraic-graphs> Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
algebraic-graphs> Source component graph:
algebraic-graphs>     component lib
algebraic-graphs>     component test:main dependency lib
algebraic-graphs> Configured component graph:
algebraic-graphs>     component algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
algebraic-graphs>         include array-0.5.6.0-dc89
algebraic-graphs>         include base-4.19.0.0-b960
algebraic-graphs>         include containers-0.6.8-4775
algebraic-graphs>         include deepseq-1.5.0.0-412f
algebraic-graphs>         include transformers-0.6.1.0-c3ec
algebraic-graphs>     component algebraic-graphs-0.7-5OeXbbSnUqFIvHqlCjxIaZ-main
algebraic-graphs>         include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
algebraic-graphs>         include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
algebraic-graphs>         include array-0.5.6.0-dc89
algebraic-graphs>         include base-4.19.0.0-b960
algebraic-graphs>         include containers-0.6.8-4775
algebraic-graphs>         include deepseq-1.5.0.0-412f
algebraic-graphs>         include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
algebraic-graphs>         include inspection-testing-0.5.0.3-F5Uf2o8NuFA3RymCMAjQM3
algebraic-graphs>         include transformers-0.6.1.0-c3ec
algebraic-graphs> Linked component graph:
algebraic-graphs>     unit algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
algebraic-graphs>         include array-0.5.6.0-dc89
algebraic-graphs>         include base-4.19.0.0-b960
algebraic-graphs>         include containers-0.6.8-4775
algebraic-graphs>         include deepseq-1.5.0.0-412f
algebraic-graphs>         include transformers-0.6.1.0-c3ec
algebraic-graphs>         Algebra.Graph=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd:Data.Graph.Typed
algebraic-graphs>     unit algebraic-graphs-0.7-5OeXbbSnUqFIvHqlCjxIaZ-main
algebraic-graphs>         include QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
algebraic-graphs>         include algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
algebraic-graphs>         include array-0.5.6.0-dc89
algebraic-graphs>         include base-4.19.0.0-b960
algebraic-graphs>         include containers-0.6.8-4775
algebraic-graphs>         include deepseq-1.5.0.0-412f
algebraic-graphs>         include extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
algebraic-graphs>         include inspection-testing-0.5.0.3-F5Uf2o8NuFA3RymCMAjQM3
algebraic-graphs>         include transformers-0.6.1.0-c3ec
algebraic-graphs> Ready component graph:
algebraic-graphs>     definite algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
algebraic-graphs>         depends array-0.5.6.0-dc89
algebraic-graphs>         depends base-4.19.0.0-b960
algebraic-graphs>         depends containers-0.6.8-4775
algebraic-graphs>         depends deepseq-1.5.0.0-412f
algebraic-graphs>         depends transformers-0.6.1.0-c3ec
algebraic-graphs>     definite algebraic-graphs-0.7-5OeXbbSnUqFIvHqlCjxIaZ-main
algebraic-graphs>         depends QuickCheck-2.14.3-CZaIrof9p8DBixfMI9gJQ8
algebraic-graphs>         depends algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
algebraic-graphs>         depends array-0.5.6.0-dc89
algebraic-graphs>         depends base-4.19.0.0-b960
algebraic-graphs>         depends containers-0.6.8-4775
algebraic-graphs>         depends deepseq-1.5.0.0-412f
algebraic-graphs>         depends extra-1.7.16-3ifrctFL0nTCpkbDIOSQQQ
algebraic-graphs>         depends inspection-testing-0.5.0.3-F5Uf2o8NuFA3RymCMAjQM3
algebraic-graphs>         depends transformers-0.6.1.0-c3ec
algebraic-graphs> Using Cabal-3.10.2.0 compiled by ghc-9.8
algebraic-graphs> Using compiler: ghc-9.8.1
algebraic-graphs> Using install prefix:
algebraic-graphs> /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7
algebraic-graphs> Executables installed in:
algebraic-graphs> /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/bin
algebraic-graphs> Libraries installed in:
algebraic-graphs> /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
algebraic-graphs> Dynamic Libraries installed in:
algebraic-graphs> /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1
algebraic-graphs> Private executables installed in:
algebraic-graphs> /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.8.1/algebraic-graphs-0.7
algebraic-graphs> Data files installed in:
algebraic-graphs> /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.8.1/algebraic-graphs-0.7
algebraic-graphs> Documentation installed in:
algebraic-graphs> /nix/store/id0zmyaaqz7k22fqngf4r7nlqizdqnxx-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
algebraic-graphs> Configuration files installed in:
algebraic-graphs> /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/etc
algebraic-graphs> No alex found
algebraic-graphs> Using ar found on system at:
algebraic-graphs> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
algebraic-graphs> No c2hs found
algebraic-graphs> No cpphs found
algebraic-graphs> No doctest found
algebraic-graphs> Using gcc version 14.3.0 given by user at:
algebraic-graphs> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
algebraic-graphs> Using ghc version 9.8.1 found on system at:
algebraic-graphs> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc
algebraic-graphs> Using ghc-pkg version 9.8.1 found on system at:
algebraic-graphs> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/ghc-pkg-9.8.1
algebraic-graphs> No ghcjs found
algebraic-graphs> No ghcjs-pkg found
algebraic-graphs> No greencard found
algebraic-graphs> Using haddock version 2.30.0 found on system at:
algebraic-graphs> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/haddock-ghc-9.8.1
algebraic-graphs> No happy found
algebraic-graphs> Using haskell-suite found on system at: haskell-suite-dummy-location
algebraic-graphs> Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
algebraic-graphs> No hmake found
algebraic-graphs> Using hpc version 0.69 found on system at:
algebraic-graphs> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hpc-ghc-9.8.1
algebraic-graphs> Using hsc2hs version 0.68.10 found on system at:
algebraic-graphs> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/hsc2hs-ghc-9.8.1
algebraic-graphs> Using hscolour version 1.25 found on system at:
algebraic-graphs> /nix/store/1g19csfql5ihx7cvxzlzald54flbi8il-hscolour-1.25/bin/HsColour
algebraic-graphs> No jhc found
algebraic-graphs> Using ld found on system at:
algebraic-graphs> /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
algebraic-graphs> No pkg-config found
algebraic-graphs> Using runghc version 9.8.1 found on system at:
algebraic-graphs> /nix/store/p5fmlj3ms0iqnv75v8bqhk28x9a0s2hi-ghc-9.8.1/bin/runghc-9.8.1
algebraic-graphs> Using strip version 2.44 found on system at:
algebraic-graphs> /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
algebraic-graphs> Using tar found on system at:
algebraic-graphs> /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
algebraic-graphs> No uhc found
algebraic-graphs> Running phase: buildPhase
algebraic-graphs> Preprocessing library for algebraic-graphs-0.7..
algebraic-graphs> Building library for algebraic-graphs-0.7..
algebraic-graphs> [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.o, dist/build/Algebra/Graph/AdjacencyMap.dyn_o )
algebraic-graphs> [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.o, dist/build/Algebra/Graph/AdjacencyIntMap.dyn_o )
algebraic-graphs> [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.o, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.dyn_o )
algebraic-graphs> [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.o, dist/build/Algebra/Graph/Internal.dyn_o )
algebraic-graphs> [ 5 of 29] Compiling Algebra.Graph    ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
algebraic-graphs> [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, dist/build/Algebra/Graph/HigherKinded/Class.o, dist/build/Algebra/Graph/HigherKinded/Class.dyn_o )
algebraic-graphs> [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.o, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.dyn_o )
algebraic-graphs> [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.o, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.dyn_o )
algebraic-graphs> [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.o, dist/build/Algebra/Graph/Label.dyn_o )
algebraic-graphs> [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.o, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.dyn_o )
algebraic-graphs> [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.o, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.dyn_o )
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘head’
algebraic-graphs>     (imported from Prelude, but defined in GHC.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
algebraic-graphs>     |
algebraic-graphs> 384 |     exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
algebraic-graphs>     |                                           ^^^^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘tail’
algebraic-graphs>     (imported from Prelude, but defined in GHC.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
algebraic-graphs>     |
algebraic-graphs> 391 |              pth' = tail v_pth' -- Here we know that v_pth' starts with v
algebraic-graphs>     |                     ^^^^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘head’
algebraic-graphs>     (imported from Prelude, but defined in GHC.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
algebraic-graphs>     |
algebraic-graphs> 395 |              p_v = fst $ head bnd
algebraic-graphs>     |                          ^^^^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘tail’
algebraic-graphs>     (imported from Prelude, but defined in GHC.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
algebraic-graphs>     |
algebraic-graphs> 397 |              bnd' = tail bnd
algebraic-graphs>     |                     ^^^^
algebraic-graphs> [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.o, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.dyn_o )
algebraic-graphs> [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.o, dist/build/Algebra/Graph/ToGraph.dyn_o )
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 171 |     vertexIntSet :: ToVertex t ~ Int => t -> IntSet
algebraic-graphs>     |                                ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 197 |     preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
algebraic-graphs>     |                             ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 215 |     postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
algebraic-graphs>     |                              ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 303 |     toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
algebraic-graphs>     |                                     ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 312 |     toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
algebraic-graphs>     |                                              ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
algebraic-graphs>     |                                           ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
algebraic-graphs>     |                                                    ^
algebraic-graphs> [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.o, dist/build/Algebra/Graph/Relation.dyn_o )
algebraic-graphs> [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.o, dist/build/Algebra/Graph/Relation/Symmetric.dyn_o )
algebraic-graphs> [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.o, dist/build/Algebra/Graph/NonEmpty.dyn_o )
algebraic-graphs> [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, dist/build/Algebra/Graph/Labelled/AdjacencyMap.o, dist/build/Algebra/Graph/Labelled/AdjacencyMap.dyn_o )
algebraic-graphs> [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.o, dist/build/Algebra/Graph/Labelled.dyn_o )
algebraic-graphs> [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, dist/build/Algebra/Graph/Labelled/Example/Network.o, dist/build/Algebra/Graph/Labelled/Example/Network.dyn_o )
algebraic-graphs> [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, dist/build/Algebra/Graph/Labelled/Example/Automaton.o, dist/build/Algebra/Graph/Labelled/Example/Automaton.dyn_o )
algebraic-graphs> [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.o, dist/build/Algebra/Graph/Export.dyn_o )
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
algebraic-graphs>     |                                         ^
algebraic-graphs> [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, dist/build/Algebra/Graph/Export/Dot.o, dist/build/Algebra/Graph/Export/Dot.dyn_o )
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
algebraic-graphs>     |                                                               ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
algebraic-graphs>     |                                                                              ^
algebraic-graphs> [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.o, dist/build/Algebra/Graph/Undirected.dyn_o )
algebraic-graphs> [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.o, dist/build/Algebra/Graph/Class.dyn_o )
algebraic-graphs> [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, dist/build/Algebra/Graph/Relation/Transitive.o, dist/build/Algebra/Graph/Relation/Transitive.dyn_o )
algebraic-graphs> [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.o, dist/build/Algebra/Graph/Relation/Reflexive.dyn_o )
algebraic-graphs> [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, dist/build/Algebra/Graph/Relation/Preorder.o, dist/build/Algebra/Graph/Relation/Preorder.dyn_o )
algebraic-graphs> [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, dist/build/Algebra/Graph/Example/Todo.o, dist/build/Algebra/Graph/Example/Todo.dyn_o )
algebraic-graphs> [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.o, dist/build/Data/Graph/Typed.dyn_o )
algebraic-graphs> [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
algebraic-graphs> [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
algebraic-graphs> [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.p_o )
algebraic-graphs> [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
algebraic-graphs> [ 5 of 29] Compiling Algebra.Graph    ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
algebraic-graphs> [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, dist/build/Algebra/Graph/HigherKinded/Class.p_o )
algebraic-graphs> [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.p_o )
algebraic-graphs> [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.p_o )
algebraic-graphs> [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
algebraic-graphs> [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.p_o )
algebraic-graphs> [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.p_o )
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘head’
algebraic-graphs>     (imported from Prelude, but defined in GHC.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
algebraic-graphs>     |
algebraic-graphs> 384 |     exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
algebraic-graphs>     |                                           ^^^^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘tail’
algebraic-graphs>     (imported from Prelude, but defined in GHC.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
algebraic-graphs>     |
algebraic-graphs> 391 |              pth' = tail v_pth' -- Here we know that v_pth' starts with v
algebraic-graphs>     |                     ^^^^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘head’
algebraic-graphs>     (imported from Prelude, but defined in GHC.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
algebraic-graphs>     |
algebraic-graphs> 395 |              p_v = fst $ head bnd
algebraic-graphs>     |                          ^^^^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘tail’
algebraic-graphs>     (imported from Prelude, but defined in GHC.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
algebraic-graphs>     |
algebraic-graphs> 397 |              bnd' = tail bnd
algebraic-graphs>     |                     ^^^^
algebraic-graphs> [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.p_o )
algebraic-graphs> [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 171 |     vertexIntSet :: ToVertex t ~ Int => t -> IntSet
algebraic-graphs>     |                                ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 197 |     preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
algebraic-graphs>     |                             ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 215 |     postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
algebraic-graphs>     |                              ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 303 |     toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
algebraic-graphs>     |                                     ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 312 |     toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
algebraic-graphs>     |                                              ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
algebraic-graphs>     |                                           ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
algebraic-graphs>     |                                                    ^
algebraic-graphs> [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
algebraic-graphs> [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.p_o )
algebraic-graphs> [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
algebraic-graphs> [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, dist/build/Algebra/Graph/Labelled/AdjacencyMap.p_o )
algebraic-graphs> [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
algebraic-graphs> [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, dist/build/Algebra/Graph/Labelled/Example/Network.p_o )
algebraic-graphs> [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, dist/build/Algebra/Graph/Labelled/Example/Automaton.p_o )
algebraic-graphs> [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
algebraic-graphs>     |                                         ^
algebraic-graphs> [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, dist/build/Algebra/Graph/Export/Dot.p_o )
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
algebraic-graphs>     |                                                               ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
algebraic-graphs>     |                                                                              ^
algebraic-graphs> [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
algebraic-graphs> [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
algebraic-graphs> [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, dist/build/Algebra/Graph/Relation/Transitive.p_o )
algebraic-graphs> [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.p_o )
algebraic-graphs> [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, dist/build/Algebra/Graph/Relation/Preorder.p_o )
algebraic-graphs> [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, dist/build/Algebra/Graph/Example/Todo.p_o )
algebraic-graphs> [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
algebraic-graphs> Preprocessing test suite 'main' for algebraic-graphs-0.7..
algebraic-graphs> Building test suite 'main' for algebraic-graphs-0.7..
algebraic-graphs> [ 1 of 23] Compiling Algebra.Graph.Test.Arbitrary ( test/Algebra/Graph/Test/Arbitrary.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Arbitrary.o, dist/build/main/main-tmp/Algebra/Graph/Test/Arbitrary.dyn_o )
algebraic-graphs> [ 2 of 23] Compiling Algebra.Graph.Test.API ( test/Algebra/Graph/Test/API.hs, dist/build/main/main-tmp/Algebra/Graph/Test/API.o, dist/build/main/main-tmp/Algebra/Graph/Test/API.dyn_o )
algebraic-graphs> [ 3 of 23] Compiling Algebra.Graph.Test ( test/Algebra/Graph/Test.hs, dist/build/main/main-tmp/Algebra/Graph/Test.o, dist/build/main/main-tmp/Algebra/Graph/Test.dyn_o )
algebraic-graphs> [ 4 of 23] Compiling Algebra.Graph.Test.Acyclic.AdjacencyMap ( test/Algebra/Graph/Test/Acyclic/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Acyclic/AdjacencyMap.dyn_o )
algebraic-graphs> [ 5 of 23] Compiling Algebra.Graph.Test.Bipartite.AdjacencyMap ( test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Bipartite/AdjacencyMap.dyn_o )
algebraic-graphs> [ 6 of 23] Compiling Algebra.Graph.Test.Example.Todo ( test/Algebra/Graph/Test/Example/Todo.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.o, dist/build/main/main-tmp/Algebra/Graph/Test/Example/Todo.dyn_o )
algebraic-graphs> [ 7 of 23] Compiling Algebra.Graph.Test.Export ( test/Algebra/Graph/Test/Export.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Export.o, dist/build/main/main-tmp/Algebra/Graph/Test/Export.dyn_o )
algebraic-graphs> [ 8 of 23] Compiling Algebra.Graph.Test.Generic ( test/Algebra/Graph/Test/Generic.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Generic.o, dist/build/main/main-tmp/Algebra/Graph/Test/Generic.dyn_o )
algebraic-graphs> [ 9 of 23] Compiling Algebra.Graph.Test.AdjacencyMap ( test/Algebra/Graph/Test/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyMap.dyn_o )
algebraic-graphs> [10 of 23] Compiling Algebra.Graph.Test.AdjacencyIntMap ( test/Algebra/Graph/Test/AdjacencyIntMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/AdjacencyIntMap.dyn_o )
algebraic-graphs> [11 of 23] Compiling Algebra.Graph.Test.Graph ( test/Algebra/Graph/Test/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/Graph.dyn_o )
algebraic-graphs> [12 of 23] Compiling Algebra.Graph.Test.Internal ( test/Algebra/Graph/Test/Internal.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Internal.o, dist/build/main/main-tmp/Algebra/Graph/Test/Internal.dyn_o )
algebraic-graphs> [13 of 23] Compiling Algebra.Graph.Test.Label ( test/Algebra/Graph/Test/Label.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Label.o, dist/build/main/main-tmp/Algebra/Graph/Test/Label.dyn_o )
algebraic-graphs> [14 of 23] Compiling Algebra.Graph.Test.Labelled.AdjacencyMap ( test/Algebra/Graph/Test/Labelled/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/AdjacencyMap.dyn_o )
algebraic-graphs> [15 of 23] Compiling Algebra.Graph.Test.Labelled.Graph ( test/Algebra/Graph/Test/Labelled/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/Labelled/Graph.dyn_o )
algebraic-graphs> [16 of 23] Compiling Algebra.Graph.Test.NonEmpty.AdjacencyMap ( test/Algebra/Graph/Test/NonEmpty/AdjacencyMap.hs, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.o, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/AdjacencyMap.dyn_o )
algebraic-graphs> [17 of 23] Compiling Algebra.Graph.Test.NonEmpty.Graph ( test/Algebra/Graph/Test/NonEmpty/Graph.hs, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.o, dist/build/main/main-tmp/Algebra/Graph/Test/NonEmpty/Graph.dyn_o )
algebraic-graphs> [18 of 23] Compiling Algebra.Graph.Test.Relation ( test/Algebra/Graph/Test/Relation.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Relation.o, dist/build/main/main-tmp/Algebra/Graph/Test/Relation.dyn_o )
algebraic-graphs> [19 of 23] Compiling Algebra.Graph.Test.Relation.Symmetric ( test/Algebra/Graph/Test/Relation/Symmetric.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.o, dist/build/main/main-tmp/Algebra/Graph/Test/Relation/Symmetric.dyn_o )
algebraic-graphs> [20 of 23] Compiling Algebra.Graph.Test.RewriteRules ( test/Algebra/Graph/Test/RewriteRules.hs, dist/build/main/main-tmp/Algebra/Graph/Test/RewriteRules.o, dist/build/main/main-tmp/Algebra/Graph/Test/RewriteRules.dyn_o )
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
algebraic-graphs> inspection testing successful
algebraic-graphs>       expected successes: 58
algebraic-graphs> [21 of 23] Compiling Algebra.Graph.Test.Undirected ( test/Algebra/Graph/Test/Undirected.hs, dist/build/main/main-tmp/Algebra/Graph/Test/Undirected.o, dist/build/main/main-tmp/Algebra/Graph/Test/Undirected.dyn_o )
algebraic-graphs> [22 of 23] Compiling Data.Graph.Test.Typed ( test/Data/Graph/Test/Typed.hs, dist/build/main/main-tmp/Data/Graph/Test/Typed.o, dist/build/main/main-tmp/Data/Graph/Test/Typed.dyn_o )
algebraic-graphs> [23 of 23] Compiling Main             ( test/Main.hs, dist/build/main/main-tmp/Main.o, dist/build/main/main-tmp/Main.dyn_o )
algebraic-graphs> [24 of 24] Linking dist/build/main/main
algebraic-graphs> Running phase: checkPhase
algebraic-graphs> Running 1 test suites...
algebraic-graphs> Test suite main: RUNNING...
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.Show ============
algebraic-graphs> OK: show empty                == "empty"
algebraic-graphs> OK: show (shrink 1)           == "vertex 1"
algebraic-graphs> OK: show (shrink $ 1 + 2)     == "vertices [1,2]"
algebraic-graphs> OK: show (shrink $ 1 * 2)     == "(fromJust . toAcyclic) (edge 1 2)"
algebraic-graphs> OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
algebraic-graphs> OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.fromAcyclic ============
algebraic-graphs> OK: fromAcyclic empty                == empty
algebraic-graphs> OK: fromAcyclic . vertex             == vertex
algebraic-graphs> OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
algebraic-graphs> OK: vertexCount . fromAcyclic        == vertexCount
algebraic-graphs> OK: edgeCount   . fromAcyclic        == edgeCount
algebraic-graphs> OK: isAcyclic   . fromAcyclic        == const True
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.empty ============
algebraic-graphs> OK: isEmpty     empty == True
algebraic-graphs> OK: hasVertex x empty == False
algebraic-graphs> OK: vertexCount empty == 0
algebraic-graphs> OK: edgeCount   empty == 0
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.vertex ============
algebraic-graphs> OK: isEmpty     (vertex x) == False
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.vertices ============
algebraic-graphs> OK: vertices []            == empty
algebraic-graphs> OK: vertices [x]           == vertex x
algebraic-graphs> OK: hasVertex x . vertices == elem x
algebraic-graphs> OK: vertexCount . vertices == length . nub
algebraic-graphs> OK: vertexSet   . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.union ============
algebraic-graphs> OK: vertexSet (union x y) == <correct result>
algebraic-graphs> OK: edgeSet   (union x y) == <correct result>
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.join ============
algebraic-graphs> OK: vertexSet (join x y) == <correct result>
algebraic-graphs> OK: edgeSet   (join x y) == <correct result>
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf empty        x          ==  True
algebraic-graphs> OK: isSubgraphOf (vertex x)   empty      ==  False
algebraic-graphs> OK: isSubgraphOf (induce p x) x          ==  True
algebraic-graphs> OK: isSubgraphOf x (transitiveClosure x) ==  True
algebraic-graphs> OK: isSubgraphOf x y                     ==> x <= y
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.isEmpty ============
algebraic-graphs> OK: isEmpty empty                             == True
algebraic-graphs> OK: isEmpty (vertex x)                        == False
algebraic-graphs> OK: isEmpty (removeVertex x $ vertex x)       == True
algebraic-graphs> OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.hasVertex ============
algebraic-graphs> OK: hasVertex x empty            == False
algebraic-graphs> OK: hasVertex x (vertex y)       == (x == y)
algebraic-graphs> OK: hasVertex x . removeVertex x == const False
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.hasEdge ============
algebraic-graphs> OK: hasEdge x y empty            == False
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge 1 2 (shrink $ 1 * 2) == True
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == elem (x,y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.vertexCount ============
algebraic-graphs> OK: vertexCount empty             ==  0
algebraic-graphs> OK: vertexCount (vertex x)        ==  1
algebraic-graphs> OK: vertexCount                   ==  length . vertexList
algebraic-graphs> OK: vertexCount x < vertexCount y ==> x < y
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.edgeCount ============
algebraic-graphs> OK: edgeCount empty            == 0
algebraic-graphs> OK: edgeCount (vertex x)       == 0
algebraic-graphs> OK: edgeCount (shrink $ 1 * 2) == 1
algebraic-graphs> OK: edgeCount                  == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.vertexList ============
algebraic-graphs> OK: vertexList empty      == []
algebraic-graphs> OK: vertexList (vertex x) == [x]
algebraic-graphs> OK: vertexList . vertices == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.edgeList ============
algebraic-graphs> OK: edgeList empty            == []
algebraic-graphs> OK: edgeList (vertex x)       == []
algebraic-graphs> OK: edgeList (shrink $ 2 * 1) == [(2,1)]
algebraic-graphs> OK: edgeList . transpose      == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.adjacencyList ============
algebraic-graphs> OK: adjacencyList empty            == []
algebraic-graphs> OK: adjacencyList (vertex x)       == [(x, [])]
algebraic-graphs> OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.vertexSet ============
algebraic-graphs> OK: vertexSet empty      == Set.empty
algebraic-graphs> OK: vertexSet . vertex   == Set.singleton
algebraic-graphs> OK: vertexSet . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.edgeSet ============
algebraic-graphs> OK: edgeSet empty            == Set.empty
algebraic-graphs> OK: edgeSet (vertex x)       == Set.empty
algebraic-graphs> OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.preSet ============
algebraic-graphs> OK: preSet x empty            == Set.empty
algebraic-graphs> OK: preSet x (vertex x)       == Set.empty
algebraic-graphs> OK: preSet 1 (shrink $ 1 * 2) == Set.empty
algebraic-graphs> OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
algebraic-graphs> OK: Set.member x . preSet x   == const False
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.postSet ============
algebraic-graphs> OK: postSet x empty            == Set.empty
algebraic-graphs> OK: postSet x (vertex x)       == Set.empty
algebraic-graphs> OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
algebraic-graphs> OK: postSet 2 (shrink $ 1 * 2) == Set.empty
algebraic-graphs> OK: Set.member x . postSet x   == const False
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.removeVertex ============
algebraic-graphs> OK: removeVertex x (vertex x)       == empty
algebraic-graphs> OK: removeVertex 1 (vertex 2)       == vertex 2
algebraic-graphs> OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
algebraic-graphs> OK: removeVertex x . removeVertex x == removeVertex x
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.removeEdge ============
algebraic-graphs> OK: removeEdge 1 2 (shrink $ 1 * 2)     == vertices [1,2]
algebraic-graphs> OK: removeEdge x y . removeEdge x y     == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeVertex x     == removeVertex x
algebraic-graphs> OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.transpose ============
algebraic-graphs> OK: transpose empty       == empty
algebraic-graphs> OK: transpose (vertex x)  == vertex x
algebraic-graphs> OK: transpose . transpose == id
algebraic-graphs> OK: edgeList . transpose  == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.induce ============
algebraic-graphs> OK: induce (const True ) x      == x
algebraic-graphs> OK: induce (const False) x      == empty
algebraic-graphs> OK: induce (/= x)               == removeVertex x
algebraic-graphs> OK: induce p . induce q         == induce (\x -> p x && q x)
algebraic-graphs> OK: isSubgraphOf (induce p x) x == True
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.induceJust ============
algebraic-graphs> OK: induceJust (vertex Nothing) == empty
algebraic-graphs> OK: induceJust . vertex . Just  == vertex
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.box ============
algebraic-graphs> OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
algebraic-graphs> 
algebraic-graphs> OK: box x y               ~~ box y x
algebraic-graphs> OK: box x (vertex ())     ~~ x
algebraic-graphs> OK: box x empty           ~~ empty
algebraic-graphs> OK: box x (box y z)       ~~ box (box x y) z
algebraic-graphs> OK: transpose   (box x y) == box (transpose x) (transpose y)
algebraic-graphs> OK: vertexCount (box x y) == vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.transitiveClosure ============
algebraic-graphs> OK: transitiveClosure empty                    == empty
algebraic-graphs> OK: transitiveClosure (vertex x)               == vertex x
algebraic-graphs> OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
algebraic-graphs> OK: transitiveClosure . transitiveClosure      == transitiveClosure
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.topSort ============
algebraic-graphs> OK: topSort empty                          == []
algebraic-graphs> OK: topSort (vertex x)                     == [x]
algebraic-graphs> OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
algebraic-graphs> OK: topSort (join x y)                     == fmap Left (topSort x) ++ fmap Right (topSort y)
algebraic-graphs> OK: Right . topSort                        == AM.topSort . fromAcyclic
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.scc ============
algebraic-graphs> OK:            scc empty               == empty
algebraic-graphs> OK:            scc (vertex x)          == vertex (NonEmpty.vertex x)
algebraic-graphs> OK:            scc (edge 1 1)          == vertex (NonEmpty.edge 1 1)
algebraic-graphs> OK: edgeList $ scc (edge 1 2)          == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
algebraic-graphs> OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.toAcyclic ============
algebraic-graphs> OK: toAcyclic (path    [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
algebraic-graphs> OK: toAcyclic (clique  [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
algebraic-graphs> OK: toAcyclic (circuit [1,2,3]) == Nothing
algebraic-graphs> OK: toAcyclic . fromAcyclic     == Just
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
algebraic-graphs> OK: toAcyclicOrd empty       == empty
algebraic-graphs> OK: toAcyclicOrd . vertex    == vertex
algebraic-graphs> OK: toAcyclicOrd (1 + 2)     == shrink (1 + 2)
algebraic-graphs> OK: toAcyclicOrd (1 * 2)     == shrink (1 * 2)
algebraic-graphs> OK: toAcyclicOrd (2 * 1)     == shrink (1 + 2)
algebraic-graphs> OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
algebraic-graphs> OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.shrink ============
algebraic-graphs> OK: shrink . AM.vertex   == vertex
algebraic-graphs> OK: shrink . AM.vertices == vertices
algebraic-graphs> OK: shrink . fromAcyclic == id
algebraic-graphs> 
algebraic-graphs> ============ Acyclic.AdjacencyMap.consistent ============
algebraic-graphs> OK: Arbitrary
algebraic-graphs> OK: empty
algebraic-graphs> OK: vertex
algebraic-graphs> OK: vertices
algebraic-graphs> OK: union
algebraic-graphs> OK: join
algebraic-graphs> OK: transpose
algebraic-graphs> OK: box
algebraic-graphs> OK: transitiveClosure
algebraic-graphs> OK: scc
algebraic-graphs> OK: toAcyclic
algebraic-graphs> OK: toAcyclicOrd
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap ============
algebraic-graphs> OK: Axioms of graphs
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.fromAdjacencyMap ============
algebraic-graphs> OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.consistent ============
algebraic-graphs> OK: Consistency of the Arbitrary instance
algebraic-graphs> 
algebraic-graphs> OK: consistent empty         == True
algebraic-graphs> OK: consistent (vertex x)    == True
algebraic-graphs> OK: consistent (overlay x y) == True
algebraic-graphs> OK: consistent (connect x y) == True
algebraic-graphs> OK: consistent (edge x y)    == True
algebraic-graphs> OK: consistent (edges xs)    == True
algebraic-graphs> OK: consistent (stars xs)    == True
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.Show ============
algebraic-graphs> OK: show (empty    ) == "empty"
algebraic-graphs> OK: show (1        ) == "vertex 1"
algebraic-graphs> OK: show (1 + 2    ) == "vertices [1,2]"
algebraic-graphs> OK: show (1 * 2    ) == "edge 1 2"
algebraic-graphs> OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
algebraic-graphs> OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
algebraic-graphs> 
algebraic-graphs> OK: show (vertex (-1)                            ) == "vertex (-1)"
algebraic-graphs> OK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
algebraic-graphs> OK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.Ord ============
algebraic-graphs> OK: vertex 1 <  vertex 2
algebraic-graphs> OK: vertex 3 <  edge 1 2
algebraic-graphs> OK: vertex 1 <  edge 1 1
algebraic-graphs> OK: edge 1 1 <  edge 1 2
algebraic-graphs> OK: edge 1 2 <  edge 1 1 + edge 2 2
algebraic-graphs> OK: edge 1 2 <  edge 1 3
algebraic-graphs> OK: x        <= x + y
algebraic-graphs> OK: x + y    <= x * y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.empty ============
algebraic-graphs> OK: isEmpty     empty == True
algebraic-graphs> OK: hasVertex x empty == False
algebraic-graphs> OK: vertexCount empty == 0
algebraic-graphs> OK: edgeCount   empty == 0
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.vertex ============
algebraic-graphs> OK: isEmpty     (vertex x) == False
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.edge ============
algebraic-graphs> OK: edge x y               == connect (vertex x) (vertex y)
algebraic-graphs> OK: hasEdge x y (edge x y) == True
algebraic-graphs> OK: edgeCount   (edge x y) == 1
algebraic-graphs> OK: vertexCount (edge 1 1) == 1
algebraic-graphs> OK: vertexCount (edge 1 2) == 2
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.overlay ============
algebraic-graphs> OK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.connect ============
algebraic-graphs> OK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: vertexCount (connect 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect 1 2) == 1
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.vertices ============
algebraic-graphs> OK: vertices []            == empty
algebraic-graphs> OK: vertices [x]           == vertex x
algebraic-graphs> OK: vertices               == overlays . map vertex
algebraic-graphs> OK: hasVertex x . vertices == elem x
algebraic-graphs> OK: vertexCount . vertices == length . nub
algebraic-graphs> OK: vertexSet   . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.edges ============
algebraic-graphs> OK: edges []          == empty
algebraic-graphs> OK: edges [(x,y)]     == edge x y
algebraic-graphs> OK: edges             == overlays . map (uncurry edge)
algebraic-graphs> OK: edgeCount . edges == length . nub
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.overlays ============
algebraic-graphs> OK: overlays []        == empty
algebraic-graphs> OK: overlays [x]       == x
algebraic-graphs> OK: overlays [x,y]     == overlay x y
algebraic-graphs> OK: overlays           == foldr overlay empty
algebraic-graphs> OK: isEmpty . overlays == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.connects ============
algebraic-graphs> OK: connects []        == empty
algebraic-graphs> OK: connects [x]       == x
algebraic-graphs> OK: connects [x,y]     == connect x y
algebraic-graphs> OK: connects           == foldr connect empty
algebraic-graphs> OK: isEmpty . connects == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.fromAdjacencyIntSets ============
algebraic-graphs> OK: fromAdjacencyIntSets []                                     == empty
algebraic-graphs> OK: fromAdjacencyIntSets [(x, IntSet.empty)]                    == vertex x
algebraic-graphs> OK: fromAdjacencyIntSets [(x, IntSet.singleton y)]              == edge x y
algebraic-graphs> OK: fromAdjacencyIntSets . map (fmap IntSet.fromList)           == stars
algebraic-graphs> OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf empty         x             ==  True
algebraic-graphs> OK: isSubgraphOf (vertex x)    empty         ==  False
algebraic-graphs> OK: isSubgraphOf x             (overlay x y) ==  True
algebraic-graphs> OK: isSubgraphOf (overlay x y) (connect x y) ==  True
algebraic-graphs> OK: isSubgraphOf (path xs)     (circuit xs)  ==  True
algebraic-graphs> OK: isSubgraphOf x y                         ==> x <= y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.toGraph et al. ============
algebraic-graphs> OK: toGraph                    == foldg Empty Vertex Overlay Connect
algebraic-graphs> OK: foldg                      == Algebra.Graph.foldg . toGraph
algebraic-graphs> OK: isEmpty                    == foldg True (const False) (&&) (&&)
algebraic-graphs> OK: size                       == foldg 1 (const 1) (+) (+)
algebraic-graphs> OK: hasVertex x                == foldg False (==x) (||) (||)
algebraic-graphs> OK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
algebraic-graphs> OK: vertexCount                == Set.size . vertexSet
algebraic-graphs> OK: edgeCount                  == Set.size . edgeSet
algebraic-graphs> OK: vertexList                 == Set.toAscList . vertexSet
algebraic-graphs> OK: edgeList                   == Set.toAscList . edgeSet
algebraic-graphs> OK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
algebraic-graphs> OK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
algebraic-graphs> OK: edgeSet                    == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
algebraic-graphs> OK: preSet x                   == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
algebraic-graphs> OK: preIntSet x                == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
algebraic-graphs> OK: postSet x                  == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
algebraic-graphs> OK: postIntSet x               == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
algebraic-graphs> OK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
algebraic-graphs> OK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
algebraic-graphs> OK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
algebraic-graphs> OK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
algebraic-graphs> OK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
algebraic-graphs> OK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
algebraic-graphs> OK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
algebraic-graphs> OK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
algebraic-graphs> OK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
algebraic-graphs> OK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
algebraic-graphs> OK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> OK: toAdjacencyMap             == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: toAdjacencyIntMap          == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.foldg ============
algebraic-graphs> OK: foldg empty vertex        overlay connect        == id
algebraic-graphs> OK: foldg empty vertex        overlay (flip connect) == transpose
algebraic-graphs> OK: foldg 1     (const 1)     (+)     (+)            == size
algebraic-graphs> OK: foldg True  (const False) (&&)    (&&)           == isEmpty
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.isEmpty ============
algebraic-graphs> OK: isEmpty empty                       == True
algebraic-graphs> OK: isEmpty (overlay empty empty)       == True
algebraic-graphs> OK: isEmpty (vertex x)                  == False
algebraic-graphs> OK: isEmpty (removeVertex x $ vertex x) == True
algebraic-graphs> OK: isEmpty (removeEdge x y $ edge x y) == False
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.hasVertex ============
algebraic-graphs> OK: hasVertex x empty            == False
algebraic-graphs> OK: hasVertex x (vertex y)       == (x == y)
algebraic-graphs> OK: hasVertex x . removeVertex x == const False
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.hasEdge ============
algebraic-graphs> OK: hasEdge x y empty            == False
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge x y (edge x y)       == True
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == elem (x,y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.vertexCount ============
algebraic-graphs> OK: vertexCount empty             ==  0
algebraic-graphs> OK: vertexCount (vertex x)        ==  1
algebraic-graphs> OK: vertexCount                   ==  length . vertexList
algebraic-graphs> OK: vertexCount x < vertexCount y ==> x < y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.edgeCount ============
algebraic-graphs> OK: edgeCount empty      == 0
algebraic-graphs> OK: edgeCount (vertex x) == 0
algebraic-graphs> OK: edgeCount (edge x y) == 1
algebraic-graphs> OK: edgeCount            == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.vertexList ============
algebraic-graphs> OK: vertexList empty      == []
algebraic-graphs> OK: vertexList (vertex x) == [x]
algebraic-graphs> OK: vertexList . vertices == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.vertexSet ============
algebraic-graphs> OK: vertexSet empty      == Set.empty
algebraic-graphs> OK: vertexSet . vertex   == Set.singleton
algebraic-graphs> OK: vertexSet . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.vertexIntSet ============
algebraic-graphs> OK: vertexIntSet empty      == IntSet.empty
algebraic-graphs> OK: vertexIntSet . vertex   == IntSet.singleton
algebraic-graphs> OK: vertexIntSet . vertices == IntSet.fromList
algebraic-graphs> OK: vertexIntSet . clique   == IntSet.fromList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.edgeList ============
algebraic-graphs> OK: edgeList empty          == []
algebraic-graphs> OK: edgeList (vertex x)     == []
algebraic-graphs> OK: edgeList (edge x y)     == [(x,y)]
algebraic-graphs> OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
algebraic-graphs> OK: edgeList . edges        == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.edgeSet ============
algebraic-graphs> OK: edgeSet empty      == Set.empty
algebraic-graphs> OK: edgeSet (vertex x) == Set.empty
algebraic-graphs> OK: edgeSet (edge x y) == Set.singleton (x,y)
algebraic-graphs> OK: edgeSet . edges    == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.adjacencyList ============
algebraic-graphs> OK: adjacencyList empty          == []
algebraic-graphs> OK: adjacencyList (vertex x)     == [(x, [])]
algebraic-graphs> OK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [])]
algebraic-graphs> OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.preSet ============
algebraic-graphs> OK: preSet x empty      == Set.empty
algebraic-graphs> OK: preSet x (vertex x) == Set.empty
algebraic-graphs> OK: preSet 1 (edge 1 2) == Set.empty
algebraic-graphs> OK: preSet y (edge x y) == Set.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.preIntSet ============
algebraic-graphs> OK: preIntSet x empty      == IntSet.empty
algebraic-graphs> OK: preIntSet x (vertex x) == IntSet.empty
algebraic-graphs> OK: preIntSet 1 (edge 1 2) == IntSet.empty
algebraic-graphs> OK: preIntSet y (edge x y) == IntSet.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.postSet ============
algebraic-graphs> OK: postSet x empty      == Set.empty
algebraic-graphs> OK: postSet x (vertex x) == Set.empty
algebraic-graphs> OK: postSet x (edge x y) == Set.fromList [y]
algebraic-graphs> OK: postSet 2 (edge 1 2) == Set.empty
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.postIntSet ============
algebraic-graphs> OK: postIntSet x empty      == IntSet.empty
algebraic-graphs> OK: postIntSet x (vertex x) == IntSet.empty
algebraic-graphs> OK: postIntSet 2 (edge 1 2) == IntSet.empty
algebraic-graphs> OK: postIntSet x (edge x y) == IntSet.fromList [y]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.path ============
algebraic-graphs> OK: path []    == empty
algebraic-graphs> OK: path [x]   == vertex x
algebraic-graphs> OK: path [x,y] == edge x y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.circuit ============
algebraic-graphs> OK: circuit []    == empty
algebraic-graphs> OK: circuit [x]   == edge x x
algebraic-graphs> OK: circuit [x,y] == edges [(x,y), (y,x)]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.clique ============
algebraic-graphs> OK: clique []         == empty
algebraic-graphs> OK: clique [x]        == vertex x
algebraic-graphs> OK: clique [x,y]      == edge x y
algebraic-graphs> OK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
algebraic-graphs> OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.biclique ============
algebraic-graphs> OK: biclique []      []      == empty
algebraic-graphs> OK: biclique [x]     []      == vertex x
algebraic-graphs> OK: biclique []      [y]     == vertex y
algebraic-graphs> OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
algebraic-graphs> OK: biclique xs      ys      == connect (vertices xs) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.star ============
algebraic-graphs> OK: star x []    == vertex x
algebraic-graphs> OK: star x [y]   == edge x y
algebraic-graphs> OK: star x [y,z] == edges [(x,y), (x,z)]
algebraic-graphs> OK: star x ys    == connect (vertex x) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.stars ============
algebraic-graphs> OK: stars []                      == empty
algebraic-graphs> OK: stars [(x, [])]               == vertex x
algebraic-graphs> OK: stars [(x, [y])]              == edge x y
algebraic-graphs> OK: stars [(x, ys)]               == star x ys
algebraic-graphs> OK: stars                         == overlays . map (uncurry star)
algebraic-graphs> OK: stars . adjacencyList         == id
algebraic-graphs> OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.tree ============
algebraic-graphs> OK: tree (Node x [])                                         == vertex x
algebraic-graphs> OK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
algebraic-graphs> OK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
algebraic-graphs> OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.forest ============
algebraic-graphs> OK: forest []                                                  == empty
algebraic-graphs> OK: forest [x]                                                 == tree x
algebraic-graphs> OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
algebraic-graphs> OK: forest                                                     == overlays . map tree
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.removeVertex ============
algebraic-graphs> OK: removeVertex x (vertex x)       == empty
algebraic-graphs> OK: removeVertex 1 (vertex 2)       == vertex 2
algebraic-graphs> OK: removeVertex x (edge x x)       == empty
algebraic-graphs> OK: removeVertex 1 (edge 1 2)       == vertex 2
algebraic-graphs> OK: removeVertex x . removeVertex x == removeVertex x
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge x y)       == vertices [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeVertex x == removeVertex x
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == mergeVertices (== x) y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.mergeVertices ============
algebraic-graphs> OK: mergeVertices (const False) x    == id
algebraic-graphs> OK: mergeVertices (== x) y           == replaceVertex x y
algebraic-graphs> OK: mergeVertices even 1 (0 * 2)     == 1 * 1
algebraic-graphs> OK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.transpose ============
algebraic-graphs> OK: transpose empty       == empty
algebraic-graphs> OK: transpose (vertex x)  == vertex x
algebraic-graphs> OK: transpose (edge x y)  == edge y x
algebraic-graphs> OK: transpose . transpose == id
algebraic-graphs> OK: edgeList . transpose  == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.gmap ============
algebraic-graphs> OK: gmap f empty      == empty
algebraic-graphs> OK: gmap f (vertex x) == vertex (f x)
algebraic-graphs> OK: gmap f (edge x y) == edge (f x) (f y)
algebraic-graphs> OK: gmap id           == id
algebraic-graphs> OK: gmap f . gmap g   == gmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.induce ============
algebraic-graphs> OK: induce (const True ) x      == x
algebraic-graphs> OK: induce (const False) x      == empty
algebraic-graphs> OK: induce (/= x)               == removeVertex x
algebraic-graphs> OK: induce p . induce q         == induce (\x -> p x && q x)
algebraic-graphs> OK: isSubgraphOf (induce p x) x == True
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.compose ============
algebraic-graphs> OK: compose empty            x                == empty
algebraic-graphs> OK: compose x                empty            == empty
algebraic-graphs> OK: compose (vertex x)       y                == empty
algebraic-graphs> OK: compose x                (vertex y)       == empty
algebraic-graphs> OK: compose x                (compose y z)    == compose (compose x y) z
algebraic-graphs> OK: compose x                (overlay y z)    == overlay (compose x y) (compose x z)
algebraic-graphs> OK: compose (overlay x y) z                   == overlay (compose x z) (compose y z)
algebraic-graphs> OK: compose (edge x y)       (edge y z)       == edge x z
algebraic-graphs> OK: compose (path    [1..5]) (path    [1..5]) == edges [(1,3),(2,4),(3,5)]
algebraic-graphs> OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.closure ============
algebraic-graphs> OK: closure empty           == empty
algebraic-graphs> OK: closure (vertex x)      == edge x x
algebraic-graphs> OK: closure (edge x x)      == edge x x
algebraic-graphs> OK: closure (edge x y)      == edges [(x,x), (x,y), (y,y)]
algebraic-graphs> OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
algebraic-graphs> OK: closure                 == reflexiveClosure . transitiveClosure
algebraic-graphs> OK: closure                 == transitiveClosure . reflexiveClosure
algebraic-graphs> OK: closure . closure       == closure
algebraic-graphs> OK: postSet x (closure y)   == Set.fromList (reachable y x)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.reflexiveClosure ============
algebraic-graphs> OK: reflexiveClosure empty              == empty
algebraic-graphs> OK: reflexiveClosure (vertex x)         == edge x x
algebraic-graphs> OK: reflexiveClosure (edge x x)         == edge x x
algebraic-graphs> OK: reflexiveClosure (edge x y)         == edges [(x,x), (x,y), (y,y)]
algebraic-graphs> OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.symmetricClosure ============
algebraic-graphs> OK: symmetricClosure empty              == empty
algebraic-graphs> OK: symmetricClosure (vertex x)         == vertex x
algebraic-graphs> OK: symmetricClosure (edge x y)         == edges [(x,y), (y,x)]
algebraic-graphs> OK: symmetricClosure x                  == overlay x (transpose x)
algebraic-graphs> OK: symmetricClosure . symmetricClosure == symmetricClosure
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.transitiveClosure ============
algebraic-graphs> OK: transitiveClosure empty               == empty
algebraic-graphs> OK: transitiveClosure (vertex x)          == vertex x
algebraic-graphs> OK: transitiveClosure (edge x y)          == edge x y
algebraic-graphs> OK: transitiveClosure (path $ nub xs)     == clique (nub $ xs)
algebraic-graphs> OK: transitiveClosure . transitiveClosure == transitiveClosure
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.bfsForest ============
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [0]        == empty
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [1]        == edge 1 2
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [2]        == vertex 2
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [0,1,2]    == vertices [1,2]
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [2,1,0]    == vertices [1,2]
algebraic-graphs> OK: forest $ bfsForest (edge 1 1) [1]        == vertex 1
algebraic-graphs> OK: isSubgraphOf (forest $ bfsForest x vs) x == True
algebraic-graphs> OK: bfsForest x (vertexList x)               == map ( -> Node v []) (nub $ vertexList x)
algebraic-graphs> OK: bfsForest x []                           == []
algebraic-graphs> OK: bfsForest empty vs                       == []
algebraic-graphs> OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4]  == <correct result>
algebraic-graphs> OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.bfs ============
algebraic-graphs> OK: bfs (edge 1 2) [0]                                   == []
algebraic-graphs> OK: bfs (edge 1 2) [1]                                   == [[1], [2]]
algebraic-graphs> OK: bfs (edge 1 2) [2]                                   == [[2]]
algebraic-graphs> OK: bfs (edge 1 2) [1,2]                                 == [[1,2]]
algebraic-graphs> OK: bfs (edge 1 2) [2,1]                                 == [[2,1]]
algebraic-graphs> OK: bfs (edge 1 1) [1]                                   == [[1]]
algebraic-graphs> OK: bfs empty vs                                         == []
algebraic-graphs> OK: bfs x []                                             == []
algebraic-graphs> OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2]                    == [[1,2]]
algebraic-graphs> OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3]                    == [[1,3], [2,4]]
algebraic-graphs> OK: bfs (3 * (1 + 4) * (1 + 5)) [3]                      == [[3], [1,4,5]]
algebraic-graphs> OK: bfs (circuit [1..5] + circuit [5,4..1]) [2]          == [[2], [1,3], [5,4]]
algebraic-graphs> OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
algebraic-graphs> OK: map concat . transpose . map levels . bfsForest x    == bfs x
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.dfsForest ============
algebraic-graphs> OK: forest $ dfsForest empty              == empty
algebraic-graphs> OK: forest $ dfsForest (edge 1 1)         == vertex 1
algebraic-graphs> OK: forest $ dfsForest (edge 1 2)         == edge 1 2
algebraic-graphs> OK: forest $ dfsForest (edge 2 1)         == vertices [1,2]
algebraic-graphs> OK: isSubgraphOf (forest $ dfsForest x) x == True
algebraic-graphs> OK: isDfsForestOf (dfsForest x) x         == True
algebraic-graphs> OK: dfsForest . forest . dfsForest        == dfsForest
algebraic-graphs> OK: dfsForest (vertices vs)               == map (\v -> Node v []) (nub $ sort vs)
algebraic-graphs> OK: dfsForest $ 3 * (1 + 4) * (1 + 5)     == <correct result>
algebraic-graphs> OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.dfsForestFrom ============
algebraic-graphs> OK: forest $ dfsForestFrom empty      vs             == empty
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 1) [1]            == vertex 1
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [0]            == empty
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [1]            == edge 1 2
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [2]            == vertex 2
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [1,2]          == edge 1 2
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [2,1]          == vertices [1,2]
algebraic-graphs> OK: isSubgraphOf (forest $ dfsForestFrom x vs) x     == True
algebraic-graphs> OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
algebraic-graphs> OK: dfsForestFrom x (vertexList x)                   == dfsForest x
algebraic-graphs> OK: dfsForestFrom x []                               == []
algebraic-graphs> OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4]      == <correct result>
algebraic-graphs> OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.dfs ============
algebraic-graphs> OK: dfs empty      vs    == []
algebraic-graphs> OK: dfs (edge 1 1) [1]   == [1]
algebraic-graphs> OK: dfs (edge 1 2) [0]   == []
algebraic-graphs> OK: dfs (edge 1 2) [1]   == [1,2]
algebraic-graphs> OK: dfs (edge 1 2) [2]   == [2]
algebraic-graphs> OK: dfs (edge 1 2) [1,2] == [1,2]
algebraic-graphs> OK: dfs (edge 1 2) [2,1] == [2,1]
algebraic-graphs> OK: dfs x          []    == []
algebraic-graphs> 
algebraic-graphs> OK: and [ hasVertex v x | v <- dfs x vs ]       == True
algebraic-graphs> OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4]           == [1,5,4]
algebraic-graphs> OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.dfs ============
algebraic-graphs> OK: reachable empty              x == []
algebraic-graphs> OK: reachable (vertex 1)         1 == [1]
algebraic-graphs> OK: reachable (edge 1 1)         1 == [1]
algebraic-graphs> OK: reachable (edge 1 2)         0 == []
algebraic-graphs> OK: reachable (edge 1 2)         1 == [1,2]
algebraic-graphs> OK: reachable (edge 1 2)         2 == [2]
algebraic-graphs> OK: reachable (path    [1..8]  ) 4 == [4..8]
algebraic-graphs> OK: reachable (circuit [1..8]  ) 4 == [4..8] ++ [1..3]
algebraic-graphs> OK: reachable (clique  [8,7..1]) 8 == [8] ++ [1..7]
algebraic-graphs> 
algebraic-graphs> OK: and [ hasVertex v x | v <- reachable x y ] == True
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.topSort ============
algebraic-graphs> OK: topSort (1 * 2 + 3 * 1)                    == Right [3,1,2]
algebraic-graphs> OK: topSort (path [1..5])                      == Right [1..5]
algebraic-graphs> OK: topSort (3 * (1 * 4 + 2 * 5))              == Right [3,1,2,4,5]
algebraic-graphs> OK: topSort (1 * 2 + 2 * 1)                    == Left (2 :| [1])
algebraic-graphs> OK: topSort (path [5,4..1] + edge 2 4)         == Left (4 :| [3,2])
algebraic-graphs> OK: topSort (circuit [1..5])                   == Left (3 :| [1,2])
algebraic-graphs> OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
algebraic-graphs> OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3)  == Left (1 :| [2])
algebraic-graphs> OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
algebraic-graphs> OK: topSort . vertices     == Right . nub . sort
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.testIsAcyclic ============
algebraic-graphs> OK: isAcyclic (1 * 2 + 3 * 1) == True
algebraic-graphs> OK: isAcyclic (1 * 2 + 2 * 1) == False
algebraic-graphs> OK: isAcyclic . circuit       == null
algebraic-graphs> OK: isAcyclic                 == isRight . topSort
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.isDfsForestOf ============
algebraic-graphs> OK: isDfsForestOf []                              empty            == True
algebraic-graphs> OK: isDfsForestOf []                              (vertex 1)       == False
algebraic-graphs> OK: isDfsForestOf [Node 1 []]                     (vertex 1)       == True
algebraic-graphs> OK: isDfsForestOf [Node 1 []]                     (vertex 2)       == False
algebraic-graphs> OK: isDfsForestOf [Node 1 [], Node 1 []]          (vertex 1)       == False
algebraic-graphs> OK: isDfsForestOf [Node 1 []]                     (edge 1 1)       == True
algebraic-graphs> OK: isDfsForestOf [Node 1 []]                     (edge 1 2)       == False
algebraic-graphs> OK: isDfsForestOf [Node 1 [], Node 2 []]          (edge 1 2)       == False
algebraic-graphs> OK: isDfsForestOf [Node 2 [], Node 1 []]          (edge 1 2)       == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [Node 2 []]]            (edge 1 2)       == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [], Node 2 []]          (vertices [1,2]) == True
algebraic-graphs> OK: isDfsForestOf [Node 2 [], Node 1 []]          (vertices [1,2]) == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [Node 2 []]]            (vertices [1,2]) == False
algebraic-graphs> OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]]   (path [1,2,3])   == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]]   (path [1,2,3])   == False
algebraic-graphs> OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3])   == True
algebraic-graphs> OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3])   == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3])   == False
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyIntMap.isTopSortOf ============
algebraic-graphs> OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
algebraic-graphs> OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
algebraic-graphs> OK: isTopSortOf []      (1 * 2 + 3 * 1) == False
algebraic-graphs> OK: isTopSortOf []      empty           == True
algebraic-graphs> OK: isTopSortOf [x]     (vertex x)      == True
algebraic-graphs> OK: isTopSortOf [x]     (edge x x)      == False
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap ============
algebraic-graphs> OK: Axioms of graphs
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.consistent ============
algebraic-graphs> OK: Consistency of the Arbitrary instance
algebraic-graphs> 
algebraic-graphs> OK: consistent empty         == True
algebraic-graphs> OK: consistent (vertex x)    == True
algebraic-graphs> OK: consistent (overlay x y) == True
algebraic-graphs> OK: consistent (connect x y) == True
algebraic-graphs> OK: consistent (edge x y)    == True
algebraic-graphs> OK: consistent (edges xs)    == True
algebraic-graphs> OK: consistent (stars xs)    == True
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.Show ============
algebraic-graphs> OK: show (empty    ) == "empty"
algebraic-graphs> OK: show (1        ) == "vertex 1"
algebraic-graphs> OK: show (1 + 2    ) == "vertices [1,2]"
algebraic-graphs> OK: show (1 * 2    ) == "edge 1 2"
algebraic-graphs> OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
algebraic-graphs> OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
algebraic-graphs> 
algebraic-graphs> OK: show (vertex (-1)                            ) == "vertex (-1)"
algebraic-graphs> OK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
algebraic-graphs> OK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.Ord ============
algebraic-graphs> OK: vertex 1 <  vertex 2
algebraic-graphs> OK: vertex 3 <  edge 1 2
algebraic-graphs> OK: vertex 1 <  edge 1 1
algebraic-graphs> OK: edge 1 1 <  edge 1 2
algebraic-graphs> OK: edge 1 2 <  edge 1 1 + edge 2 2
algebraic-graphs> OK: edge 1 2 <  edge 1 3
algebraic-graphs> OK: x        <= x + y
algebraic-graphs> OK: x + y    <= x * y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.empty ============
algebraic-graphs> OK: isEmpty     empty == True
algebraic-graphs> OK: hasVertex x empty == False
algebraic-graphs> OK: vertexCount empty == 0
algebraic-graphs> OK: edgeCount   empty == 0
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.vertex ============
algebraic-graphs> OK: isEmpty     (vertex x) == False
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.edge ============
algebraic-graphs> OK: edge x y               == connect (vertex x) (vertex y)
algebraic-graphs> OK: hasEdge x y (edge x y) == True
algebraic-graphs> OK: edgeCount   (edge x y) == 1
algebraic-graphs> OK: vertexCount (edge 1 1) == 1
algebraic-graphs> OK: vertexCount (edge 1 2) == 2
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.overlay ============
algebraic-graphs> OK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.connect ============
algebraic-graphs> OK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: vertexCount (connect 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect 1 2) == 1
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.vertices ============
algebraic-graphs> OK: vertices []            == empty
algebraic-graphs> OK: vertices [x]           == vertex x
algebraic-graphs> OK: vertices               == overlays . map vertex
algebraic-graphs> OK: hasVertex x . vertices == elem x
algebraic-graphs> OK: vertexCount . vertices == length . nub
algebraic-graphs> OK: vertexSet   . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.edges ============
algebraic-graphs> OK: edges []          == empty
algebraic-graphs> OK: edges [(x,y)]     == edge x y
algebraic-graphs> OK: edges             == overlays . map (uncurry edge)
algebraic-graphs> OK: edgeCount . edges == length . nub
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.overlays ============
algebraic-graphs> OK: overlays []        == empty
algebraic-graphs> OK: overlays [x]       == x
algebraic-graphs> OK: overlays [x,y]     == overlay x y
algebraic-graphs> OK: overlays           == foldr overlay empty
algebraic-graphs> OK: isEmpty . overlays == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.connects ============
algebraic-graphs> OK: connects []        == empty
algebraic-graphs> OK: connects [x]       == x
algebraic-graphs> OK: connects [x,y]     == connect x y
algebraic-graphs> OK: connects           == foldr connect empty
algebraic-graphs> OK: isEmpty . connects == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.fromAdjacencySets ============
algebraic-graphs> OK: fromAdjacencySets []                                  == empty
algebraic-graphs> OK: fromAdjacencySets [(x, Set.empty)]                    == vertex x
algebraic-graphs> OK: fromAdjacencySets [(x, Set.singleton y)]              == edge x y
algebraic-graphs> OK: fromAdjacencySets . map (fmap Set.fromList)           == stars
algebraic-graphs> OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf empty         x             ==  True
algebraic-graphs> OK: isSubgraphOf (vertex x)    empty         ==  False
algebraic-graphs> OK: isSubgraphOf x             (overlay x y) ==  True
algebraic-graphs> OK: isSubgraphOf (overlay x y) (connect x y) ==  True
algebraic-graphs> OK: isSubgraphOf (path xs)     (circuit xs)  ==  True
algebraic-graphs> OK: isSubgraphOf x y                         ==> x <= y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.toGraph et al. ============
algebraic-graphs> OK: toGraph                    == foldg Empty Vertex Overlay Connect
algebraic-graphs> OK: foldg                      == Algebra.Graph.foldg . toGraph
algebraic-graphs> OK: isEmpty                    == foldg True (const False) (&&) (&&)
algebraic-graphs> OK: size                       == foldg 1 (const 1) (+) (+)
algebraic-graphs> OK: hasVertex x                == foldg False (==x) (||) (||)
algebraic-graphs> OK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
algebraic-graphs> OK: vertexCount                == Set.size . vertexSet
algebraic-graphs> OK: edgeCount                  == Set.size . edgeSet
algebraic-graphs> OK: vertexList                 == Set.toAscList . vertexSet
algebraic-graphs> OK: edgeList                   == Set.toAscList . edgeSet
algebraic-graphs> OK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
algebraic-graphs> OK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
algebraic-graphs> OK: edgeSet                    == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
algebraic-graphs> OK: preSet x                   == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
algebraic-graphs> OK: preIntSet x                == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
algebraic-graphs> OK: postSet x                  == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
algebraic-graphs> OK: postIntSet x               == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
algebraic-graphs> OK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
algebraic-graphs> OK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
algebraic-graphs> OK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
algebraic-graphs> OK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
algebraic-graphs> OK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
algebraic-graphs> OK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
algebraic-graphs> OK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
algebraic-graphs> OK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
algebraic-graphs> OK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
algebraic-graphs> OK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
algebraic-graphs> OK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> OK: toAdjacencyMap             == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: toAdjacencyIntMap          == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.foldg ============
algebraic-graphs> OK: foldg empty vertex        overlay connect        == id
algebraic-graphs> OK: foldg empty vertex        overlay (flip connect) == transpose
algebraic-graphs> OK: foldg 1     (const 1)     (+)     (+)            == size
algebraic-graphs> OK: foldg True  (const False) (&&)    (&&)           == isEmpty
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.isEmpty ============
algebraic-graphs> OK: isEmpty empty                       == True
algebraic-graphs> OK: isEmpty (overlay empty empty)       == True
algebraic-graphs> OK: isEmpty (vertex x)                  == False
algebraic-graphs> OK: isEmpty (removeVertex x $ vertex x) == True
algebraic-graphs> OK: isEmpty (removeEdge x y $ edge x y) == False
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.hasVertex ============
algebraic-graphs> OK: hasVertex x empty            == False
algebraic-graphs> OK: hasVertex x (vertex y)       == (x == y)
algebraic-graphs> OK: hasVertex x . removeVertex x == const False
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.hasEdge ============
algebraic-graphs> OK: hasEdge x y empty            == False
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge x y (edge x y)       == True
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == elem (x,y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.vertexCount ============
algebraic-graphs> OK: vertexCount empty             ==  0
algebraic-graphs> OK: vertexCount (vertex x)        ==  1
algebraic-graphs> OK: vertexCount                   ==  length . vertexList
algebraic-graphs> OK: vertexCount x < vertexCount y ==> x < y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.edgeCount ============
algebraic-graphs> OK: edgeCount empty      == 0
algebraic-graphs> OK: edgeCount (vertex x) == 0
algebraic-graphs> OK: edgeCount (edge x y) == 1
algebraic-graphs> OK: edgeCount            == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.vertexList ============
algebraic-graphs> OK: vertexList empty      == []
algebraic-graphs> OK: vertexList (vertex x) == [x]
algebraic-graphs> OK: vertexList . vertices == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.vertexSet ============
algebraic-graphs> OK: vertexSet empty      == Set.empty
algebraic-graphs> OK: vertexSet . vertex   == Set.singleton
algebraic-graphs> OK: vertexSet . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.vertexIntSet ============
algebraic-graphs> OK: vertexIntSet empty      == IntSet.empty
algebraic-graphs> OK: vertexIntSet . vertex   == IntSet.singleton
algebraic-graphs> OK: vertexIntSet . vertices == IntSet.fromList
algebraic-graphs> OK: vertexIntSet . clique   == IntSet.fromList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.edgeList ============
algebraic-graphs> OK: edgeList empty          == []
algebraic-graphs> OK: edgeList (vertex x)     == []
algebraic-graphs> OK: edgeList (edge x y)     == [(x,y)]
algebraic-graphs> OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
algebraic-graphs> OK: edgeList . edges        == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.edgeSet ============
algebraic-graphs> OK: edgeSet empty      == Set.empty
algebraic-graphs> OK: edgeSet (vertex x) == Set.empty
algebraic-graphs> OK: edgeSet (edge x y) == Set.singleton (x,y)
algebraic-graphs> OK: edgeSet . edges    == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.adjacencyList ============
algebraic-graphs> OK: adjacencyList empty          == []
algebraic-graphs> OK: adjacencyList (vertex x)     == [(x, [])]
algebraic-graphs> OK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [])]
algebraic-graphs> OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.preSet ============
algebraic-graphs> OK: preSet x empty      == Set.empty
algebraic-graphs> OK: preSet x (vertex x) == Set.empty
algebraic-graphs> OK: preSet 1 (edge 1 2) == Set.empty
algebraic-graphs> OK: preSet y (edge x y) == Set.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.preIntSet ============
algebraic-graphs> OK: preIntSet x empty      == IntSet.empty
algebraic-graphs> OK: preIntSet x (vertex x) == IntSet.empty
algebraic-graphs> OK: preIntSet 1 (edge 1 2) == IntSet.empty
algebraic-graphs> OK: preIntSet y (edge x y) == IntSet.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.postSet ============
algebraic-graphs> OK: postSet x empty      == Set.empty
algebraic-graphs> OK: postSet x (vertex x) == Set.empty
algebraic-graphs> OK: postSet x (edge x y) == Set.fromList [y]
algebraic-graphs> OK: postSet 2 (edge 1 2) == Set.empty
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.postIntSet ============
algebraic-graphs> OK: postIntSet x empty      == IntSet.empty
algebraic-graphs> OK: postIntSet x (vertex x) == IntSet.empty
algebraic-graphs> OK: postIntSet 2 (edge 1 2) == IntSet.empty
algebraic-graphs> OK: postIntSet x (edge x y) == IntSet.fromList [y]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.path ============
algebraic-graphs> OK: path []    == empty
algebraic-graphs> OK: path [x]   == vertex x
algebraic-graphs> OK: path [x,y] == edge x y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.circuit ============
algebraic-graphs> OK: circuit []    == empty
algebraic-graphs> OK: circuit [x]   == edge x x
algebraic-graphs> OK: circuit [x,y] == edges [(x,y), (y,x)]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.clique ============
algebraic-graphs> OK: clique []         == empty
algebraic-graphs> OK: clique [x]        == vertex x
algebraic-graphs> OK: clique [x,y]      == edge x y
algebraic-graphs> OK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
algebraic-graphs> OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.biclique ============
algebraic-graphs> OK: biclique []      []      == empty
algebraic-graphs> OK: biclique [x]     []      == vertex x
algebraic-graphs> OK: biclique []      [y]     == vertex y
algebraic-graphs> OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
algebraic-graphs> OK: biclique xs      ys      == connect (vertices xs) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.star ============
algebraic-graphs> OK: star x []    == vertex x
algebraic-graphs> OK: star x [y]   == edge x y
algebraic-graphs> OK: star x [y,z] == edges [(x,y), (x,z)]
algebraic-graphs> OK: star x ys    == connect (vertex x) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.stars ============
algebraic-graphs> OK: stars []                      == empty
algebraic-graphs> OK: stars [(x, [])]               == vertex x
algebraic-graphs> OK: stars [(x, [y])]              == edge x y
algebraic-graphs> OK: stars [(x, ys)]               == star x ys
algebraic-graphs> OK: stars                         == overlays . map (uncurry star)
algebraic-graphs> OK: stars . adjacencyList         == id
algebraic-graphs> OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.tree ============
algebraic-graphs> OK: tree (Node x [])                                         == vertex x
algebraic-graphs> OK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
algebraic-graphs> OK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
algebraic-graphs> OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.forest ============
algebraic-graphs> OK: forest []                                                  == empty
algebraic-graphs> OK: forest [x]                                                 == tree x
algebraic-graphs> OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
algebraic-graphs> OK: forest                                                     == overlays . map tree
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.removeVertex ============
algebraic-graphs> OK: removeVertex x (vertex x)       == empty
algebraic-graphs> OK: removeVertex 1 (vertex 2)       == vertex 2
algebraic-graphs> OK: removeVertex x (edge x x)       == empty
algebraic-graphs> OK: removeVertex 1 (edge 1 2)       == vertex 2
algebraic-graphs> OK: removeVertex x . removeVertex x == removeVertex x
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge x y)       == vertices [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeVertex x == removeVertex x
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == mergeVertices (== x) y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.mergeVertices ============
algebraic-graphs> OK: mergeVertices (const False) x    == id
algebraic-graphs> OK: mergeVertices (== x) y           == replaceVertex x y
algebraic-graphs> OK: mergeVertices even 1 (0 * 2)     == 1 * 1
algebraic-graphs> OK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.transpose ============
algebraic-graphs> OK: transpose empty       == empty
algebraic-graphs> OK: transpose (vertex x)  == vertex x
algebraic-graphs> OK: transpose (edge x y)  == edge y x
algebraic-graphs> OK: transpose . transpose == id
algebraic-graphs> OK: edgeList . transpose  == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.gmap ============
algebraic-graphs> OK: gmap f empty      == empty
algebraic-graphs> OK: gmap f (vertex x) == vertex (f x)
algebraic-graphs> OK: gmap f (edge x y) == edge (f x) (f y)
algebraic-graphs> OK: gmap id           == id
algebraic-graphs> OK: gmap f . gmap g   == gmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.induce ============
algebraic-graphs> OK: induce (const True ) x      == x
algebraic-graphs> OK: induce (const False) x      == empty
algebraic-graphs> OK: induce (/= x)               == removeVertex x
algebraic-graphs> OK: induce p . induce q         == induce (\x -> p x && q x)
algebraic-graphs> OK: isSubgraphOf (induce p x) x == True
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.compose ============
algebraic-graphs> OK: compose empty            x                == empty
algebraic-graphs> OK: compose x                empty            == empty
algebraic-graphs> OK: compose (vertex x)       y                == empty
algebraic-graphs> OK: compose x                (vertex y)       == empty
algebraic-graphs> OK: compose x                (compose y z)    == compose (compose x y) z
algebraic-graphs> OK: compose x                (overlay y z)    == overlay (compose x y) (compose x z)
algebraic-graphs> OK: compose (overlay x y) z                   == overlay (compose x z) (compose y z)
algebraic-graphs> OK: compose (edge x y)       (edge y z)       == edge x z
algebraic-graphs> OK: compose (path    [1..5]) (path    [1..5]) == edges [(1,3),(2,4),(3,5)]
algebraic-graphs> OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.closure ============
algebraic-graphs> OK: closure empty           == empty
algebraic-graphs> OK: closure (vertex x)      == edge x x
algebraic-graphs> OK: closure (edge x x)      == edge x x
algebraic-graphs> OK: closure (edge x y)      == edges [(x,x), (x,y), (y,y)]
algebraic-graphs> OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
algebraic-graphs> OK: closure                 == reflexiveClosure . transitiveClosure
algebraic-graphs> OK: closure                 == transitiveClosure . reflexiveClosure
algebraic-graphs> OK: closure . closure       == closure
algebraic-graphs> OK: postSet x (closure y)   == Set.fromList (reachable y x)
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.reflexiveClosure ============
algebraic-graphs> OK: reflexiveClosure empty              == empty
algebraic-graphs> OK: reflexiveClosure (vertex x)         == edge x x
algebraic-graphs> OK: reflexiveClosure (edge x x)         == edge x x
algebraic-graphs> OK: reflexiveClosure (edge x y)         == edges [(x,x), (x,y), (y,y)]
algebraic-graphs> OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.symmetricClosure ============
algebraic-graphs> OK: symmetricClosure empty              == empty
algebraic-graphs> OK: symmetricClosure (vertex x)         == vertex x
algebraic-graphs> OK: symmetricClosure (edge x y)         == edges [(x,y), (y,x)]
algebraic-graphs> OK: symmetricClosure x                  == overlay x (transpose x)
algebraic-graphs> OK: symmetricClosure . symmetricClosure == symmetricClosure
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.transitiveClosure ============
algebraic-graphs> OK: transitiveClosure empty               == empty
algebraic-graphs> OK: transitiveClosure (vertex x)          == vertex x
algebraic-graphs> OK: transitiveClosure (edge x y)          == edge x y
algebraic-graphs> OK: transitiveClosure (path $ nub xs)     == clique (nub $ xs)
algebraic-graphs> OK: transitiveClosure . transitiveClosure == transitiveClosure
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.box ============
algebraic-graphs> OK: box x y               ~~ box y x
algebraic-graphs> OK: box x (overlay y z)   == overlay (box x y) (box x z)
algebraic-graphs> OK: box x (vertex ())     ~~ x
algebraic-graphs> OK: box x empty           ~~ empty
algebraic-graphs> OK: box x (box y z)       ~~ box (box x y) z
algebraic-graphs> OK: transpose   (box x y) == box (transpose x) (transpose y)
algebraic-graphs> OK: vertexCount (box x y) == vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.bfsForest ============
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [0]        == empty
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [1]        == edge 1 2
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [2]        == vertex 2
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [0,1,2]    == vertices [1,2]
algebraic-graphs> OK: forest $ bfsForest (edge 1 2) [2,1,0]    == vertices [1,2]
algebraic-graphs> OK: forest $ bfsForest (edge 1 1) [1]        == vertex 1
algebraic-graphs> OK: isSubgraphOf (forest $ bfsForest x vs) x == True
algebraic-graphs> OK: bfsForest x (vertexList x)               == map ( -> Node v []) (nub $ vertexList x)
algebraic-graphs> OK: bfsForest x []                           == []
algebraic-graphs> OK: bfsForest empty vs                       == []
algebraic-graphs> OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4]  == <correct result>
algebraic-graphs> OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.bfs ============
algebraic-graphs> OK: bfs (edge 1 2) [0]                                   == []
algebraic-graphs> OK: bfs (edge 1 2) [1]                                   == [[1], [2]]
algebraic-graphs> OK: bfs (edge 1 2) [2]                                   == [[2]]
algebraic-graphs> OK: bfs (edge 1 2) [1,2]                                 == [[1,2]]
algebraic-graphs> OK: bfs (edge 1 2) [2,1]                                 == [[2,1]]
algebraic-graphs> OK: bfs (edge 1 1) [1]                                   == [[1]]
algebraic-graphs> OK: bfs empty vs                                         == []
algebraic-graphs> OK: bfs x []                                             == []
algebraic-graphs> OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2]                    == [[1,2]]
algebraic-graphs> OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3]                    == [[1,3], [2,4]]
algebraic-graphs> OK: bfs (3 * (1 + 4) * (1 + 5)) [3]                      == [[3], [1,4,5]]
algebraic-graphs> OK: bfs (circuit [1..5] + circuit [5,4..1]) [2]          == [[2], [1,3], [5,4]]
algebraic-graphs> OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
algebraic-graphs> OK: map concat . transpose . map levels . bfsForest x    == bfs x
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.dfsForest ============
algebraic-graphs> OK: forest $ dfsForest empty              == empty
algebraic-graphs> OK: forest $ dfsForest (edge 1 1)         == vertex 1
algebraic-graphs> OK: forest $ dfsForest (edge 1 2)         == edge 1 2
algebraic-graphs> OK: forest $ dfsForest (edge 2 1)         == vertices [1,2]
algebraic-graphs> OK: isSubgraphOf (forest $ dfsForest x) x == True
algebraic-graphs> OK: isDfsForestOf (dfsForest x) x         == True
algebraic-graphs> OK: dfsForest . forest . dfsForest        == dfsForest
algebraic-graphs> OK: dfsForest (vertices vs)               == map (\v -> Node v []) (nub $ sort vs)
algebraic-graphs> OK: dfsForest $ 3 * (1 + 4) * (1 + 5)     == <correct result>
algebraic-graphs> OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.dfsForestFrom ============
algebraic-graphs> OK: forest $ dfsForestFrom empty      vs             == empty
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 1) [1]            == vertex 1
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [0]            == empty
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [1]            == edge 1 2
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [2]            == vertex 2
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [1,2]          == edge 1 2
algebraic-graphs> OK: forest $ dfsForestFrom (edge 1 2) [2,1]          == vertices [1,2]
algebraic-graphs> OK: isSubgraphOf (forest $ dfsForestFrom x vs) x     == True
algebraic-graphs> OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
algebraic-graphs> OK: dfsForestFrom x (vertexList x)                   == dfsForest x
algebraic-graphs> OK: dfsForestFrom x []                               == []
algebraic-graphs> OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4]      == <correct result>
algebraic-graphs> OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.dfs ============
algebraic-graphs> OK: dfs empty      vs    == []
algebraic-graphs> OK: dfs (edge 1 1) [1]   == [1]
algebraic-graphs> OK: dfs (edge 1 2) [0]   == []
algebraic-graphs> OK: dfs (edge 1 2) [1]   == [1,2]
algebraic-graphs> OK: dfs (edge 1 2) [2]   == [2]
algebraic-graphs> OK: dfs (edge 1 2) [1,2] == [1,2]
algebraic-graphs> OK: dfs (edge 1 2) [2,1] == [2,1]
algebraic-graphs> OK: dfs x          []    == []
algebraic-graphs> 
algebraic-graphs> OK: and [ hasVertex v x | v <- dfs x vs ]       == True
algebraic-graphs> OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4]           == [1,5,4]
algebraic-graphs> OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.dfs ============
algebraic-graphs> OK: reachable empty              x == []
algebraic-graphs> OK: reachable (vertex 1)         1 == [1]
algebraic-graphs> OK: reachable (edge 1 1)         1 == [1]
algebraic-graphs> OK: reachable (edge 1 2)         0 == []
algebraic-graphs> OK: reachable (edge 1 2)         1 == [1,2]
algebraic-graphs> OK: reachable (edge 1 2)         2 == [2]
algebraic-graphs> OK: reachable (path    [1..8]  ) 4 == [4..8]
algebraic-graphs> OK: reachable (circuit [1..8]  ) 4 == [4..8] ++ [1..3]
algebraic-graphs> OK: reachable (clique  [8,7..1]) 8 == [8] ++ [1..7]
algebraic-graphs> 
algebraic-graphs> OK: and [ hasVertex v x | v <- reachable x y ] == True
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.topSort ============
algebraic-graphs> OK: topSort (1 * 2 + 3 * 1)                    == Right [3,1,2]
algebraic-graphs> OK: topSort (path [1..5])                      == Right [1..5]
algebraic-graphs> OK: topSort (3 * (1 * 4 + 2 * 5))              == Right [3,1,2,4,5]
algebraic-graphs> OK: topSort (1 * 2 + 2 * 1)                    == Left (2 :| [1])
algebraic-graphs> OK: topSort (path [5,4..1] + edge 2 4)         == Left (4 :| [3,2])
algebraic-graphs> OK: topSort (circuit [1..5])                   == Left (3 :| [1,2])
algebraic-graphs> OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
algebraic-graphs> OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3)  == Left (1 :| [2])
algebraic-graphs> OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
algebraic-graphs> OK: topSort . vertices     == Right . nub . sort
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.testIsAcyclic ============
algebraic-graphs> OK: isAcyclic (1 * 2 + 3 * 1) == True
algebraic-graphs> OK: isAcyclic (1 * 2 + 2 * 1) == False
algebraic-graphs> OK: isAcyclic . circuit       == null
algebraic-graphs> OK: isAcyclic                 == isRight . topSort
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.isDfsForestOf ============
algebraic-graphs> OK: isDfsForestOf []                              empty            == True
algebraic-graphs> OK: isDfsForestOf []                              (vertex 1)       == False
algebraic-graphs> OK: isDfsForestOf [Node 1 []]                     (vertex 1)       == True
algebraic-graphs> OK: isDfsForestOf [Node 1 []]                     (vertex 2)       == False
algebraic-graphs> OK: isDfsForestOf [Node 1 [], Node 1 []]          (vertex 1)       == False
algebraic-graphs> OK: isDfsForestOf [Node 1 []]                     (edge 1 1)       == True
algebraic-graphs> OK: isDfsForestOf [Node 1 []]                     (edge 1 2)       == False
algebraic-graphs> OK: isDfsForestOf [Node 1 [], Node 2 []]          (edge 1 2)       == False
algebraic-graphs> OK: isDfsForestOf [Node 2 [], Node 1 []]          (edge 1 2)       == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [Node 2 []]]            (edge 1 2)       == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [], Node 2 []]          (vertices [1,2]) == True
algebraic-graphs> OK: isDfsForestOf [Node 2 [], Node 1 []]          (vertices [1,2]) == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [Node 2 []]]            (vertices [1,2]) == False
algebraic-graphs> OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]]   (path [1,2,3])   == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]]   (path [1,2,3])   == False
algebraic-graphs> OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3])   == True
algebraic-graphs> OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3])   == True
algebraic-graphs> OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3])   == False
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.isTopSortOf ============
algebraic-graphs> OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
algebraic-graphs> OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
algebraic-graphs> OK: isTopSortOf []      (1 * 2 + 3 * 1) == False
algebraic-graphs> OK: isTopSortOf []      empty           == True
algebraic-graphs> OK: isTopSortOf [x]     (vertex x)      == True
algebraic-graphs> OK: isTopSortOf [x]     (edge x x)      == False
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.induceJust ============
algebraic-graphs> OK: induceJust (vertex Nothing)                               == empty
algebraic-graphs> OK: induceJust (edge (Just x) Nothing)                        == vertex x
algebraic-graphs> OK: induceJust . gmap Just                                    == id
algebraic-graphs> OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
algebraic-graphs> 
algebraic-graphs> ============ AdjacencyMap.scc ============
algebraic-graphs> OK: scc empty               == empty
algebraic-graphs> OK: scc (vertex x)          == vertex (NonEmpty.vertex x)
algebraic-graphs> OK: scc (vertices xs)       == vertices (map NonEmpty.vertex xs)
algebraic-graphs> OK: scc (edge 1 1)          == vertex (NonEmpty.edge 1 1)
algebraic-graphs> OK: scc (edge 1 2)          == edge   (NonEmpty.vertex 1) (NonEmpty.vertex 2)
algebraic-graphs> OK: scc (circuit (1:xs))    == vertex (NonEmpty.circuit1 (1 :| xs))
algebraic-graphs> OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
algebraic-graphs> OK: isAcyclic . scc == const True
algebraic-graphs> OK: isAcyclic x     == (scc x == gmap NonEmpty.vertex x)
algebraic-graphs> OK: scc g == KL.scc g
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Num ============
algebraic-graphs> OK: 0                     == rightVertex 0
algebraic-graphs> OK: swap 1                == leftVertex 1
algebraic-graphs> OK: swap 1 + 2            == vertices [1] [2]
algebraic-graphs> OK: swap 1 * 2            == edge 1 2
algebraic-graphs> OK: swap 1 + 2 * swap 3   == overlay (leftVertex 1) (edge 3 2)
algebraic-graphs> OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Show ============
algebraic-graphs> OK: show empty                 == "empty"
algebraic-graphs> OK: show 1                     == "rightVertex 1"
algebraic-graphs> OK: show (swap 2)              == "leftVertex 2"
algebraic-graphs> OK: show 1 + 2                 == "vertices [] [1,2]"
algebraic-graphs> OK: show (swap (1 + 2))        == "vertices [1,2] []"
algebraic-graphs> OK: show (swap 1 * 2)          == "edge 1 2"
algebraic-graphs> OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
algebraic-graphs> OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Eq ============
algebraic-graphs> OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
algebraic-graphs> 
algebraic-graphs> OK:         x + y == y + x
algebraic-graphs> OK:   x + (y + z) == (x + y) + z
algebraic-graphs> OK:     x * empty == x
algebraic-graphs> OK:     empty * x == x
algebraic-graphs> OK:         x * y == y * x
algebraic-graphs> OK:   x * (y * z) == (x * y) * z
algebraic-graphs> OK:   x * (y + z) == x * y + x * z
algebraic-graphs> OK:   (x + y) * z == x * z + y * z
algebraic-graphs> OK:     x * y * z == x * y + x * z + y * z
algebraic-graphs> OK:     x + empty == x
algebraic-graphs> OK:     empty + x == x
algebraic-graphs> OK:         x + x == x
algebraic-graphs> OK: x * y + x + y == x * y
algebraic-graphs> OK:     x * x * x == x * x
algebraic-graphs> 
algebraic-graphs> OK:  leftVertex x * leftVertex y  ==  leftVertex x + leftVertex y
algebraic-graphs> OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
algebraic-graphs> OK: leftAdjacencyMap empty           == Map.empty
algebraic-graphs> OK: leftAdjacencyMap (leftVertex x)  == Map.singleton x Set.empty
algebraic-graphs> OK: leftAdjacencyMap (rightVertex x) == Map.empty
algebraic-graphs> OK: leftAdjacencyMap (edge x y)      == Map.singleton x (Set.singleton y)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
algebraic-graphs> OK: rightAdjacencyMap empty           == Map.empty
algebraic-graphs> OK: rightAdjacencyMap (leftVertex x)  == Map.empty
algebraic-graphs> OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
algebraic-graphs> OK: rightAdjacencyMap (edge x y)      == Map.singleton y (Set.singleton x)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.empty ============
algebraic-graphs> OK: isEmpty empty           == True
algebraic-graphs> OK: leftAdjacencyMap empty  == Map.empty
algebraic-graphs> OK: rightAdjacencyMap empty == Map.empty
algebraic-graphs> OK: hasVertex x empty       == False
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.leftVertex ============
algebraic-graphs> OK: leftAdjacencyMap (leftVertex x)  == Map.singleton x Set.empty
algebraic-graphs> OK: rightAdjacencyMap (leftVertex x) == Map.empty
algebraic-graphs> OK: hasLeftVertex x (leftVertex y)   == (x == y)
algebraic-graphs> OK: hasRightVertex x (leftVertex y)  == False
algebraic-graphs> OK: hasEdge x y (leftVertex z)       == False
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.rightVertex ============
algebraic-graphs> OK: leftAdjacencyMap (rightVertex x)  == Map.empty
algebraic-graphs> OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
algebraic-graphs> OK: hasLeftVertex x (rightVertex y)   == False
algebraic-graphs> OK: hasRightVertex x (rightVertex y)  == (x == y)
algebraic-graphs> OK: hasEdge x y (rightVertex z)       == False
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.vertex ============
algebraic-graphs> OK: vertex . Left  == leftVertex
algebraic-graphs> OK: vertex . Right == rightVertex
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.edge ============
algebraic-graphs> OK: edge x y                     == connect (leftVertex x) (rightVertex y)
algebraic-graphs> OK: leftAdjacencyMap (edge x y)  == Map.singleton x (Set.singleton y)
algebraic-graphs> OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
algebraic-graphs> OK: hasEdge x y (edge x y)       == True
algebraic-graphs> OK: hasEdge 1 2 (edge 2 1)       == False
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.overlay ============
algebraic-graphs> OK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.connect ============
algebraic-graphs> OK: connect (leftVertex x)     (leftVertex y)     == vertices [x,y] []
algebraic-graphs> OK: connect (leftVertex x)     (rightVertex y)    == edge x y
algebraic-graphs> OK: connect (rightVertex x)    (leftVertex y)     == edge y x
algebraic-graphs> OK: connect (rightVertex x)    (rightVertex y)    == vertices [] [x,y]
algebraic-graphs> OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
algebraic-graphs> OK: isEmpty     (connect x y)                     == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (connect x y)                     == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect x y)                     >= vertexCount x
algebraic-graphs> OK: vertexCount (connect x y)                     <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y)                     >= edgeCount x
algebraic-graphs> OK: edgeCount   (connect x y)                     >= leftVertexCount x * rightVertexCount y
algebraic-graphs> OK: edgeCount   (connect x y)                     <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.vertices ============
algebraic-graphs> OK: vertices [] []                    == empty
algebraic-graphs> OK: vertices [x] []                   == leftVertex x
algebraic-graphs> OK: vertices [] [x]                   == rightVertex x
algebraic-graphs> OK: vertices xs ys                    == overlays (map leftVertex xs ++ map rightVertex ys)
algebraic-graphs> OK: hasLeftVertex  x (vertices xs ys) == elem x xs
algebraic-graphs> OK: hasRightVertex y (vertices xs ys) == elem y ys
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.edges ============
algebraic-graphs> OK: edges []            == empty
algebraic-graphs> OK: edges [(x,y)]       == edge x y
algebraic-graphs> OK: edges               == overlays . map (uncurry edge)
algebraic-graphs> OK: hasEdge x y . edges == elem (x,y)
algebraic-graphs> OK: edgeCount   . edges == length . nub
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.overlays ============
algebraic-graphs> OK: overlays []        == empty
algebraic-graphs> OK: overlays [x]       == x
algebraic-graphs> OK: overlays [x,y]     == overlay x y
algebraic-graphs> OK: overlays           == foldr overlay empty
algebraic-graphs> OK: isEmpty . overlays == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.connects ============
algebraic-graphs> OK: connects []        == empty
algebraic-graphs> OK: connects [x]       == x
algebraic-graphs> OK: connects [x,y]     == connect x y
algebraic-graphs> OK: connects           == foldr connect empty
algebraic-graphs> OK: isEmpty . connects == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.swap ============
algebraic-graphs> OK: swap empty            == empty
algebraic-graphs> OK: swap . leftVertex     == rightVertex
algebraic-graphs> OK: swap (vertices xs ys) == vertices ys xs
algebraic-graphs> OK: swap (edge x y)       == edge y x
algebraic-graphs> OK: swap . edges          == edges . map Data.Tuple.swap
algebraic-graphs> OK: swap . swap           == id
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.toBipartite ============
algebraic-graphs> OK: toBipartite empty                      == empty
algebraic-graphs> OK: toBipartite (vertex (Left x))          == leftVertex x
algebraic-graphs> OK: toBipartite (vertex (Right x))         == rightVertex x
algebraic-graphs> OK: toBipartite (edge (Left x) (Left y))   == vertices [x,y] []
algebraic-graphs> OK: toBipartite (edge (Left x) (Right y))  == edge x y
algebraic-graphs> OK: toBipartite (edge (Right x) (Left y))  == edge y x
algebraic-graphs> OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
algebraic-graphs> OK: toBipartite . clique                   == uncurry biclique . partitionEithers
algebraic-graphs> OK: toBipartite . fromBipartite            == id
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.toBipartiteWith ============
algebraic-graphs> OK: toBipartiteWith f empty == empty
algebraic-graphs> OK: toBipartiteWith Left x  == vertices (vertexList x) []
algebraic-graphs> OK: toBipartiteWith Right x == vertices [] (vertexList x)
algebraic-graphs> OK: toBipartiteWith f       == toBipartite . gmap f
algebraic-graphs> OK: toBipartiteWith id      == toBipartite
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.fromBipartite ============
algebraic-graphs> OK: fromBipartite empty          == empty
algebraic-graphs> OK: fromBipartite (leftVertex x) == vertex (Left x)
algebraic-graphs> OK: fromBipartite (edge x y)     == edges [(Left x, Right y), (Right y, Left x)]
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
algebraic-graphs> OK: fromBipartiteWith Left Right             == fromBipartite
algebraic-graphs> OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
algebraic-graphs> OK: fromBipartiteWith id id . edges          == symmetricClosure . edges
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.isEmpty ============
algebraic-graphs> OK: isEmpty empty                 == True
algebraic-graphs> OK: isEmpty (overlay empty empty) == True
algebraic-graphs> OK: isEmpty (vertex x)            == False
algebraic-graphs> OK: isEmpty                       == (==) empty
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.hasLeftVertex ============
algebraic-graphs> OK: hasLeftVertex x empty           == False
algebraic-graphs> OK: hasLeftVertex x (leftVertex y)  == (x == y)
algebraic-graphs> OK: hasLeftVertex x (rightVertex y) == False
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.hasRightVertex ============
algebraic-graphs> OK: hasRightVertex x empty           == False
algebraic-graphs> OK: hasRightVertex x (leftVertex y)  == False
algebraic-graphs> OK: hasRightVertex x (rightVertex y) == (x == y)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.hasVertex ============
algebraic-graphs> OK: hasVertex . Left  == hasLeftVertex
algebraic-graphs> OK: hasVertex . Right == hasRightVertex
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.hasEdge ============
algebraic-graphs> OK: hasEdge x y empty      == False
algebraic-graphs> OK: hasEdge x y (vertex z) == False
algebraic-graphs> OK: hasEdge x y (edge x y) == True
algebraic-graphs> OK: hasEdge x y            == elem (x,y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.leftVertexCount ============
algebraic-graphs> OK: leftVertexCount empty           == 0
algebraic-graphs> OK: leftVertexCount (leftVertex x)  == 1
algebraic-graphs> OK: leftVertexCount (rightVertex x) == 0
algebraic-graphs> OK: leftVertexCount (edge x y)      == 1
algebraic-graphs> OK: leftVertexCount . edges         == length . nub . map fst
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.rightVertexCount ============
algebraic-graphs> OK: rightVertexCount empty           == 0
algebraic-graphs> OK: rightVertexCount (leftVertex x)  == 0
algebraic-graphs> OK: rightVertexCount (rightVertex x) == 1
algebraic-graphs> OK: rightVertexCount (edge x y)      == 1
algebraic-graphs> OK: rightVertexCount . edges         == length . nub . map snd
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.vertexCount ============
algebraic-graphs> OK: vertexCount empty      == 0
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: vertexCount (edge x y) == 2
algebraic-graphs> OK: vertexCount x          == leftVertexCount x + rightVertexCount x
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.edgeCount ============
algebraic-graphs> OK: edgeCount empty      == 0
algebraic-graphs> OK: edgeCount (vertex x) == 0
algebraic-graphs> OK: edgeCount (edge x y) == 1
algebraic-graphs> OK: edgeCount . edges    == length . nub
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.leftVertexList ============
algebraic-graphs> OK: leftVertexList empty              == []
algebraic-graphs> OK: leftVertexList (leftVertex x)     == [x]
algebraic-graphs> OK: leftVertexList (rightVertex x)    == []
algebraic-graphs> OK: leftVertexList . flip vertices [] == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.rightVertexList ============
algebraic-graphs> OK: rightVertexList empty           == []
algebraic-graphs> OK: rightVertexList (leftVertex x)  == []
algebraic-graphs> OK: rightVertexList (rightVertex x) == [x]
algebraic-graphs> OK: rightVertexList . vertices []   == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.vertexList ============
algebraic-graphs> OK: vertexList empty                             == []
algebraic-graphs> OK: vertexList (vertex x)                        == [x]
algebraic-graphs> OK: vertexList (edge x y)                        == [Left x, Right y]
algebraic-graphs> OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.edgeList ============
algebraic-graphs> OK: edgeList empty      == []
algebraic-graphs> OK: edgeList (vertex x) == []
algebraic-graphs> OK: edgeList (edge x y) == [(x,y)]
algebraic-graphs> OK: edgeList . edges    == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.leftVertexSet ============
algebraic-graphs> OK: leftVertexSet empty              == Set.empty
algebraic-graphs> OK: leftVertexSet . leftVertex       == Set.singleton
algebraic-graphs> OK: leftVertexSet . rightVertex      == const Set.empty
algebraic-graphs> OK: leftVertexSet . flip vertices [] == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.rightVertexSet ============
algebraic-graphs> OK: rightVertexSet empty         == Set.empty
algebraic-graphs> OK: rightVertexSet . leftVertex  == const Set.empty
algebraic-graphs> OK: rightVertexSet . rightVertex == Set.singleton
algebraic-graphs> OK: rightVertexSet . vertices [] == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.vertexSet ============
algebraic-graphs> OK: vertexSet empty                             == Set.empty
algebraic-graphs> OK: vertexSet . vertex                          == Set.singleton
algebraic-graphs> OK: vertexSet (edge x y)                        == Set.fromList [Left x, Right y]
algebraic-graphs> OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.edgeSet ============
algebraic-graphs> OK: edgeSet empty      == Set.empty
algebraic-graphs> OK: edgeSet (vertex x) == Set.empty
algebraic-graphs> OK: edgeSet (edge x y) == Set.singleton (x,y)
algebraic-graphs> OK: edgeSet . edges    == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
algebraic-graphs> OK: leftAdjacencyList empty            == []
algebraic-graphs> OK: leftAdjacencyList (vertices [] xs) == []
algebraic-graphs> OK: leftAdjacencyList (vertices xs []) == []
algebraic-graphs> OK: leftAdjacencyList (edge x y)       == [(x, [y])]
algebraic-graphs> OK: leftAdjacencyList (star x ys)      == [(x, nub (sort ys))]
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
algebraic-graphs> OK: rightAdjacencyList empty            == []
algebraic-graphs> OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
algebraic-graphs> OK: rightAdjacencyList (vertices xs []) == []
algebraic-graphs> OK: rightAdjacencyList (edge x y)       == [(y, [x])]
algebraic-graphs> OK: rightAdjacencyList (star x ys)      == [(y, [x])  | y <- nub (sort ys)]
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.evenList ============
algebraic-graphs> OK: evenList []                 == Nil
algebraic-graphs> OK: evenList [(1,2), (3,4)]     == [1, 2, 3, 4] :: List Int Int
algebraic-graphs> OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.oddList ============
algebraic-graphs> OK: oddList 1 []                 == Cons 1 Nil
algebraic-graphs> OK: oddList 1 [(2,3), (4,5)]     == [1, 2, 3, 4, 5] :: List Int Int
algebraic-graphs> OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.path ============
algebraic-graphs> OK: path Nil                   == empty
algebraic-graphs> OK: path (Cons x Nil)          == leftVertex x
algebraic-graphs> OK: path (Cons x (Cons y Nil)) == edge x y
algebraic-graphs> OK: path [1, 2, 3, 4, 5]       == edges [(1,2), (3,2), (3,4), (5,4)]
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.circuit ============
algebraic-graphs> OK: circuit []                    == empty
algebraic-graphs> OK: circuit [(x,y)]               == edge x y
algebraic-graphs> OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
algebraic-graphs> OK: circuit . reverse             == swap . circuit . map Data.Tuple.swap
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.biclique ============
algebraic-graphs> OK: biclique [] [] == empty
algebraic-graphs> OK: biclique xs [] == vertices xs []
algebraic-graphs> OK: biclique [] ys == vertices [] ys
algebraic-graphs> OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.star ============
algebraic-graphs> OK: star x []    == leftVertex x
algebraic-graphs> OK: star x [y]   == edge x y
algebraic-graphs> OK: star x [y,z] == edges [(x,y), (x,z)]
algebraic-graphs> OK: star x ys    == connect (leftVertex x) (vertices [] ys)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.stars ============
algebraic-graphs> OK: stars []                      == empty
algebraic-graphs> OK: stars [(x, [])]               == leftVertex x
algebraic-graphs> OK: stars [(x, [y])]              == edge x y
algebraic-graphs> OK: stars [(x, ys)]               == star x ys
algebraic-graphs> OK: star x [y,z]                  == edges [(x,y), (x,z)]
algebraic-graphs> OK: stars                         == overlays . map (uncurry star)
algebraic-graphs> OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.mesh ============
algebraic-graphs> OK: mesh xs []           == empty
algebraic-graphs> OK: mesh [] ys           == empty
algebraic-graphs> OK: mesh [x] [y]         == leftVertex (x,y)
algebraic-graphs> OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
algebraic-graphs> OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.removeLeftVertex ============
algebraic-graphs> OK: removeLeftVertex x (leftVertex x)       == empty
algebraic-graphs> OK: removeLeftVertex 1 (leftVertex 2)       == leftVertex 2
algebraic-graphs> OK: removeLeftVertex x (rightVertex y)      == rightVertex y
algebraic-graphs> OK: removeLeftVertex x (edge x y)           == rightVertex y
algebraic-graphs> OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.removeRightVertex ============
algebraic-graphs> OK: removeRightVertex x (rightVertex x)       == empty
algebraic-graphs> OK: removeRightVertex 1 (rightVertex 2)       == rightVertex 2
algebraic-graphs> OK: removeRightVertex x (leftVertex y)        == leftVertex y
algebraic-graphs> OK: removeRightVertex y (edge x y)            == leftVertex x
algebraic-graphs> OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge x y)            == vertices [x] [y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y      == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeLeftVertex x  == removeLeftVertex x
algebraic-graphs> OK: removeEdge x y . removeRightVertex y == removeRightVertex y
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.bimap ============
algebraic-graphs> OK: bimap f g empty           == empty
algebraic-graphs> OK: bimap f g . vertex        == vertex . Data.Bifunctor.bimap f g
algebraic-graphs> OK: bimap f g (edge x y)      == edge (f x) (g y)
algebraic-graphs> OK: bimap id id               == id
algebraic-graphs> OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.box ============
algebraic-graphs> OK: box (path [0,1]) (path ['a','b']) == <correct result>
algebraic-graphs> 
algebraic-graphs> OK: box x y                ~~ box y x
algebraic-graphs> OK: box x (box y z)        ~~ box (box x y) z
algebraic-graphs> OK: box x (box y z)        ~~ box (box x y) z
algebraic-graphs> OK: box x (leftVertex ())  ~~ x
algebraic-graphs> OK: box x (rightVertex ()) ~~ swap x
algebraic-graphs> OK: box x empty            ~~ empty
algebraic-graphs> OK: vertexCount (box x y)  <= vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount (box x y)    <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
algebraic-graphs> 
algebraic-graphs> OK: box == boxWith (,) (,) (,) (,)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.consistent ============
algebraic-graphs> OK: consistent empty            == True
algebraic-graphs> OK: consistent (vertex x)       == True
algebraic-graphs> OK: consistent (edge x y)       == True
algebraic-graphs> OK: consistent (edges x)        == True
algebraic-graphs> OK: consistent (toBipartite x)  == True
algebraic-graphs> OK: consistent (swap x)         == True
algebraic-graphs> OK: consistent (circuit xs)     == True
algebraic-graphs> OK: consistent (biclique xs ys) == True
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
algebraic-graphs> OK: detectParts empty                                       == Right empty
algebraic-graphs> OK: detectParts (vertex 1)                                  == Right (leftVertex 1)
algebraic-graphs> OK: detectParts (edge 1 1)                                  == Left [1]
algebraic-graphs> OK: detectParts (edge 1 2)                                  == Right (edge 1 2)
algebraic-graphs> OK: detectParts (edge 0 (-1))                               == Right (edge (-1) 0)
algebraic-graphs> OK: detectParts (1 * (2 + 3))                               == Right (edges [(1, 2), (1, 3)])
algebraic-graphs> OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5)                 == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
algebraic-graphs> OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6))               == Left [1, 3, 2, 4, 5]
algebraic-graphs> OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5)           == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
algebraic-graphs> OK: detectParts (1 * 2 * 3)                                 == Left [2, 3, 1]
algebraic-graphs> OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2))                 == Left [2]
algebraic-graphs> OK: detectParts (clique [1..10])                            == Left [1, 2, 3]
algebraic-graphs> OK: detectParts (circuit [1..11])                           == Left [1..11]
algebraic-graphs> OK: detectParts (circuit [1..10])                           == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
algebraic-graphs> OK: detectParts (biclique [] xs)                            == Right (vertices xs [])
algebraic-graphs> OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
algebraic-graphs> OK: isRight (detectParts (star x ys))                       == not (elem x ys)
algebraic-graphs> OK: isRight (detectParts (fromBipartite (toBipartite x)))   == True
algebraic-graphs> 
algebraic-graphs> OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
algebraic-graphs> OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
algebraic-graphs> OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
algebraic-graphs> OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
algebraic-graphs> OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
algebraic-graphs> 
algebraic-graphs> ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
algebraic-graphs> OK: show (matching [])                == "matching []"
algebraic-graphs> OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
algebraic-graphs> 
algebraic-graphs> ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
algebraic-graphs> OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
algebraic-graphs> OK: pairOfLeft (matching [])                 == Map.empty
algebraic-graphs> OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
algebraic-graphs> OK: Map.size . pairOfLeft                    == Map.size . pairOfRight
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
algebraic-graphs> OK: pairOfRight (matching [])                 == Map.empty
algebraic-graphs> OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
algebraic-graphs> OK: Map.size . pairOfRight                    == Map.size . pairOfLeft
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.matching ============
algebraic-graphs> OK: matching [(1,'a'), (1,'b')]                   == matching [(1,'b')]
algebraic-graphs> OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
algebraic-graphs> OK: isMatchingOf (matching []) x               == True
algebraic-graphs> OK: isMatchingOf (matching xs) empty           == null xs
algebraic-graphs> OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
algebraic-graphs> OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
algebraic-graphs> OK: matchingSize (matching [])                 == 0
algebraic-graphs> OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
algebraic-graphs> OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
algebraic-graphs> OK: matchingSize (matching xs)                 <= length xs
algebraic-graphs> OK: matchingSize x                             == Map.size . pairOfLeft
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
algebraic-graphs> OK: maxMatching empty                                          == matching []
algebraic-graphs> OK: maxMatching (vertices xs ys)                               == matching []
algebraic-graphs> OK: maxMatching (path [1,2,3,4])                               == matching [(1,2), (3,4)]
algebraic-graphs> OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
algebraic-graphs> OK: matchingSize (maxMatching (star x (y:ys)))                 == 1
algebraic-graphs> OK: matchingSize (maxMatching (biclique xs ys))                == min (length (nub xs)) (length (nub ys))
algebraic-graphs> OK: isMatchingOf (maxMatching x) x                             == True
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
algebraic-graphs> OK: isVertexCoverOf (xs             , ys             ) empty          == Set.null xs && Set.null ys
algebraic-graphs> OK: isVertexCoverOf (xs             , ys             ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
algebraic-graphs> OK: isVertexCoverOf (Set.empty      , Set.empty      ) (edge x y)     == False
algebraic-graphs> OK: isVertexCoverOf (Set.singleton x, ys             ) (edge x y)     == Set.isSubsetOf ys (Set.singleton y)
algebraic-graphs> OK: isVertexCoverOf (xs             , Set.singleton y) (edge x y)     == Set.isSubsetOf xs (Set.singleton x)
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
algebraic-graphs> OK: minVertexCover empty                              == (Set.empty, Set.empty)
algebraic-graphs> OK: minVertexCover (vertices xs ys)                   == (Set.empty, Set.empty)
algebraic-graphs> OK: minVertexCover (path [1,2,3])                     == (Set.empty, Set.singleton 2)
algebraic-graphs> OK: minVertexCover (star x (1:2:ys))                  == (Set.singleton x, Set.empty)
algebraic-graphs> OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
algebraic-graphs> OK: vertexCoverSize . minVertexCover                  == matchingSize . maxMatching
algebraic-graphs> OK: isVertexCoverOf (minVertexCover x) x              == True
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
algebraic-graphs> OK: isIndependentSetOf (xs             , ys             ) empty          == Set.null xs && Set.null ys
algebraic-graphs> OK: isIndependentSetOf (xs             , ys             ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
algebraic-graphs> OK: isIndependentSetOf (Set.empty      , Set.empty      ) (edge x y)     == True
algebraic-graphs> OK: isIndependentSetOf (Set.singleton x, ys             ) (edge x y)     == Set.null ys
algebraic-graphs> OK: isIndependentSetOf (xs             , Set.singleton y) (edge x y)     == Set.null xs
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
algebraic-graphs> OK: maxIndependentSet empty                                 == (Set.empty, Set.empty)
algebraic-graphs> OK: maxIndependentSet (vertices xs ys)                      == (Set.fromList xs, Set.fromList ys)
algebraic-graphs> OK: maxIndependentSet (path [1,2,3])                        == (Set.fromList [1,3], Set.empty)
algebraic-graphs> OK: maxIndependentSet (star x (1:2:ys))                     == (Set.empty, Set.fromList (1:2:ys))
algebraic-graphs> OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
algebraic-graphs> OK: independentSetSize (maxIndependentSet x)                == vertexCount x - vertexCoverSize (minVertexCover x)
algebraic-graphs> OK: isIndependentSetOf (maxIndependentSet x) x              == True
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
algebraic-graphs> OK: augmentingPath (matching [])      empty            == Left (Set.empty, Set.empty)
algebraic-graphs> OK: augmentingPath (matching [])      (edge 1 2)       == Right [1,2]
algebraic-graphs> OK: augmentingPath (matching [(1,2)]) (path [1,2,3])   == Left (Set.empty, Set.singleton 2)
algebraic-graphs> OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
algebraic-graphs> OK: isLeft (augmentingPath (maxMatching x) x)          == True
algebraic-graphs> 
algebraic-graphs> ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
algebraic-graphs> OK: consistentMatching (matching xs)   == True
algebraic-graphs> OK: consistentMatching (maxMatching x) == True
algebraic-graphs> 
algebraic-graphs> ============ Export.Eq ============
algebraic-graphs> OK: mempty /= literal ""
algebraic-graphs> 
algebraic-graphs> ============ Export.Ord ============
algebraic-graphs> OK: mempty <  literal ""
algebraic-graphs> 
algebraic-graphs> ============ Export.isEmpty ============
algebraic-graphs> OK: isEmpty mempty       == True
algebraic-graphs> OK: isEmpty (literal "") == False
algebraic-graphs> OK: isEmpty x            == (x == mempty)
algebraic-graphs> 
algebraic-graphs> ============ Export.literal ============
algebraic-graphs> OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
algebraic-graphs> OK: literal "I am just a string literal"  == "I am just a string literal"
algebraic-graphs> OK: render . literal                      == id
algebraic-graphs> 
algebraic-graphs> ============ Export.render ============
algebraic-graphs> OK: render (literal "al" <> literal "ga") == "alga"
algebraic-graphs> OK: render mempty                         == mempty
algebraic-graphs> 
algebraic-graphs> ============ Export.<+> ============
algebraic-graphs> OK: x <+> mempty         == x
algebraic-graphs> OK: mempty <+> x         == x
algebraic-graphs> OK: x <+> (y <+> z)      == (x <+> y) <+> z
algebraic-graphs> OK: "name" <+> "surname" == "name surname"
algebraic-graphs> 
algebraic-graphs> ============ Export.brackets ============
algebraic-graphs> OK: brackets "i"    == "[i]"
algebraic-graphs> OK: brackets mempty == "[]"
algebraic-graphs> 
algebraic-graphs> ============ Export.doubleQuotes ============
algebraic-graphs> OK: doubleQuotes "/path/with spaces"   == "\"/path/with spaces\""
algebraic-graphs> OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
algebraic-graphs> 
algebraic-graphs> ============ Export.indent ============
algebraic-graphs> OK: indent 0        == id
algebraic-graphs> OK: indent 1 mempty == " "
algebraic-graphs> 
algebraic-graphs> ============ Export.unlines ============
algebraic-graphs> OK: unlines []                    == mempty
algebraic-graphs> OK: unlines [mempty]              == "\n"
algebraic-graphs> OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
algebraic-graphs> 
algebraic-graphs> ============ Export.export ============
algebraic-graphs> OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
algebraic-graphs> 
algebraic-graphs> ============ Export.Dot.export ============
algebraic-graphs> OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
algebraic-graphs> 
algebraic-graphs> =========== Export.Dot.attributeQuoting ============
algebraic-graphs> OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
algebraic-graphs> 
algebraic-graphs> ============ Export.Dot.exportAsIs ============
algebraic-graphs> OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
algebraic-graphs> 
algebraic-graphs> ============ Export.Dot.exportViaShow ============
algebraic-graphs> OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
algebraic-graphs> 
algebraic-graphs> ============ Graph ============
algebraic-graphs> OK: Axioms of graphs
algebraic-graphs> OK: Theorems of graphs
algebraic-graphs> 
algebraic-graphs> ============ Graph.Ord ============
algebraic-graphs> OK: vertex 1 <  vertex 2
algebraic-graphs> OK: vertex 3 <  edge 1 2
algebraic-graphs> OK: vertex 1 <  edge 1 1
algebraic-graphs> OK: edge 1 1 <  edge 1 2
algebraic-graphs> OK: edge 1 2 <  edge 1 1 + edge 2 2
algebraic-graphs> OK: edge 1 2 <  edge 1 3
algebraic-graphs> OK: x        <= x + y
algebraic-graphs> OK: x + y    <= x * y
algebraic-graphs> 
algebraic-graphs> ============ Graph.empty ============
algebraic-graphs> OK: isEmpty     empty == True
algebraic-graphs> OK: hasVertex x empty == False
algebraic-graphs> OK: vertexCount empty == 0
algebraic-graphs> OK: edgeCount   empty == 0
algebraic-graphs> 
algebraic-graphs> ============ Graph.vertex ============
algebraic-graphs> OK: isEmpty     (vertex x) == False
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ Graph.edge ============
algebraic-graphs> OK: edge x y               == connect (vertex x) (vertex y)
algebraic-graphs> OK: hasEdge x y (edge x y) == True
algebraic-graphs> OK: edgeCount   (edge x y) == 1
algebraic-graphs> OK: vertexCount (edge 1 1) == 1
algebraic-graphs> OK: vertexCount (edge 1 2) == 2
algebraic-graphs> 
algebraic-graphs> ============ Graph.overlay ============
algebraic-graphs> OK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> ============ Graph.connect ============
algebraic-graphs> OK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: vertexCount (connect 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect 1 2) == 1
algebraic-graphs> 
algebraic-graphs> ============ Graph.vertices ============
algebraic-graphs> OK: vertices []            == empty
algebraic-graphs> OK: vertices [x]           == vertex x
algebraic-graphs> OK: vertices               == overlays . map vertex
algebraic-graphs> OK: hasVertex x . vertices == elem x
algebraic-graphs> OK: vertexCount . vertices == length . nub
algebraic-graphs> OK: vertexSet   . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Graph.edges ============
algebraic-graphs> OK: edges []          == empty
algebraic-graphs> OK: edges [(x,y)]     == edge x y
algebraic-graphs> OK: edges             == overlays . map (uncurry edge)
algebraic-graphs> OK: edgeCount . edges == length . nub
algebraic-graphs> 
algebraic-graphs> ============ Graph.overlays ============
algebraic-graphs> OK: overlays []        == empty
algebraic-graphs> OK: overlays [x]       == x
algebraic-graphs> OK: overlays [x,y]     == overlay x y
algebraic-graphs> OK: overlays           == foldr overlay empty
algebraic-graphs> OK: isEmpty . overlays == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Graph.connects ============
algebraic-graphs> OK: connects []        == empty
algebraic-graphs> OK: connects [x]       == x
algebraic-graphs> OK: connects [x,y]     == connect x y
algebraic-graphs> OK: connects           == foldr connect empty
algebraic-graphs> OK: isEmpty . connects == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Graph.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf empty         x             ==  True
algebraic-graphs> OK: isSubgraphOf (vertex x)    empty         ==  False
algebraic-graphs> OK: isSubgraphOf x             (overlay x y) ==  True
algebraic-graphs> OK: isSubgraphOf (overlay x y) (connect x y) ==  True
algebraic-graphs> OK: isSubgraphOf (path xs)     (circuit xs)  ==  True
algebraic-graphs> OK: isSubgraphOf x y                         ==> x <= y
algebraic-graphs> 
algebraic-graphs> ============ Graph.toGraph et al. ============
algebraic-graphs> OK: toGraph                    == foldg Empty Vertex Overlay Connect
algebraic-graphs> OK: foldg                      == Algebra.Graph.foldg . toGraph
algebraic-graphs> OK: isEmpty                    == foldg True (const False) (&&) (&&)
algebraic-graphs> OK: size                       == foldg 1 (const 1) (+) (+)
algebraic-graphs> OK: hasVertex x                == foldg False (==x) (||) (||)
algebraic-graphs> OK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
algebraic-graphs> OK: vertexCount                == Set.size . vertexSet
algebraic-graphs> OK: edgeCount                  == Set.size . edgeSet
algebraic-graphs> OK: vertexList                 == Set.toAscList . vertexSet
algebraic-graphs> OK: edgeList                   == Set.toAscList . edgeSet
algebraic-graphs> OK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
algebraic-graphs> OK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
algebraic-graphs> OK: edgeSet                    == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
algebraic-graphs> OK: preSet x                   == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
algebraic-graphs> OK: preIntSet x                == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
algebraic-graphs> OK: postSet x                  == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
algebraic-graphs> OK: postIntSet x               == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
algebraic-graphs> OK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
algebraic-graphs> OK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
algebraic-graphs> OK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
algebraic-graphs> OK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
algebraic-graphs> OK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
algebraic-graphs> OK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
algebraic-graphs> OK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
algebraic-graphs> OK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
algebraic-graphs> OK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
algebraic-graphs> OK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
algebraic-graphs> OK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> OK: toAdjacencyMap             == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: toAdjacencyIntMap          == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> 
algebraic-graphs> ============ Graph.foldg ============
algebraic-graphs> OK: foldg empty vertex        overlay connect        == id
algebraic-graphs> OK: foldg empty vertex        overlay (flip connect) == transpose
algebraic-graphs> OK: foldg 1     (const 1)     (+)     (+)            == size
algebraic-graphs> OK: foldg True  (const False) (&&)    (&&)           == isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Graph.isEmpty ============
algebraic-graphs> OK: isEmpty empty                       == True
algebraic-graphs> OK: isEmpty (overlay empty empty)       == True
algebraic-graphs> OK: isEmpty (vertex x)                  == False
algebraic-graphs> OK: isEmpty (removeVertex x $ vertex x) == True
algebraic-graphs> OK: isEmpty (removeEdge x y $ edge x y) == False
algebraic-graphs> 
algebraic-graphs> ============ Graph.hasVertex ============
algebraic-graphs> OK: hasVertex x empty            == False
algebraic-graphs> OK: hasVertex x (vertex y)       == (x == y)
algebraic-graphs> OK: hasVertex x . removeVertex x == const False
algebraic-graphs> 
algebraic-graphs> ============ Graph.hasEdge ============
algebraic-graphs> OK: hasEdge x y empty            == False
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge x y (edge x y)       == True
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == elem (x,y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Graph.vertexCount ============
algebraic-graphs> OK: vertexCount empty             ==  0
algebraic-graphs> OK: vertexCount (vertex x)        ==  1
algebraic-graphs> OK: vertexCount                   ==  length . vertexList
algebraic-graphs> OK: vertexCount x < vertexCount y ==> x < y
algebraic-graphs> 
algebraic-graphs> ============ Graph.edgeCount ============
algebraic-graphs> OK: edgeCount empty      == 0
algebraic-graphs> OK: edgeCount (vertex x) == 0
algebraic-graphs> OK: edgeCount (edge x y) == 1
algebraic-graphs> OK: edgeCount            == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Graph.vertexList ============
algebraic-graphs> OK: vertexList empty      == []
algebraic-graphs> OK: vertexList (vertex x) == [x]
algebraic-graphs> OK: vertexList . vertices == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Graph.vertexSet ============
algebraic-graphs> OK: vertexSet empty      == Set.empty
algebraic-graphs> OK: vertexSet . vertex   == Set.singleton
algebraic-graphs> OK: vertexSet . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Graph.vertexIntSet ============
algebraic-graphs> OK: vertexIntSet empty      == IntSet.empty
algebraic-graphs> OK: vertexIntSet . vertex   == IntSet.singleton
algebraic-graphs> OK: vertexIntSet . vertices == IntSet.fromList
algebraic-graphs> OK: vertexIntSet . clique   == IntSet.fromList
algebraic-graphs> 
algebraic-graphs> ============ Graph.edgeList ============
algebraic-graphs> OK: edgeList empty          == []
algebraic-graphs> OK: edgeList (vertex x)     == []
algebraic-graphs> OK: edgeList (edge x y)     == [(x,y)]
algebraic-graphs> OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
algebraic-graphs> OK: edgeList . edges        == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Graph.edgeSet ============
algebraic-graphs> OK: edgeSet empty      == Set.empty
algebraic-graphs> OK: edgeSet (vertex x) == Set.empty
algebraic-graphs> OK: edgeSet (edge x y) == Set.singleton (x,y)
algebraic-graphs> OK: edgeSet . edges    == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Graph.adjacencyList ============
algebraic-graphs> OK: adjacencyList empty          == []
algebraic-graphs> OK: adjacencyList (vertex x)     == [(x, [])]
algebraic-graphs> OK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [])]
algebraic-graphs> OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
algebraic-graphs> 
algebraic-graphs> ============ Graph.preSet ============
algebraic-graphs> OK: preSet x empty      == Set.empty
algebraic-graphs> OK: preSet x (vertex x) == Set.empty
algebraic-graphs> OK: preSet 1 (edge 1 2) == Set.empty
algebraic-graphs> OK: preSet y (edge x y) == Set.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ Graph.preIntSet ============
algebraic-graphs> OK: preIntSet x empty      == IntSet.empty
algebraic-graphs> OK: preIntSet x (vertex x) == IntSet.empty
algebraic-graphs> OK: preIntSet 1 (edge 1 2) == IntSet.empty
algebraic-graphs> OK: preIntSet y (edge x y) == IntSet.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ Graph.postSet ============
algebraic-graphs> OK: postSet x empty      == Set.empty
algebraic-graphs> OK: postSet x (vertex x) == Set.empty
algebraic-graphs> OK: postSet x (edge x y) == Set.fromList [y]
algebraic-graphs> OK: postSet 2 (edge 1 2) == Set.empty
algebraic-graphs> 
algebraic-graphs> ============ Graph.postIntSet ============
algebraic-graphs> OK: postIntSet x empty      == IntSet.empty
algebraic-graphs> OK: postIntSet x (vertex x) == IntSet.empty
algebraic-graphs> OK: postIntSet 2 (edge 1 2) == IntSet.empty
algebraic-graphs> OK: postIntSet x (edge x y) == IntSet.fromList [y]
algebraic-graphs> 
algebraic-graphs> ============ Graph.size ============
algebraic-graphs> OK: size empty         == 1
algebraic-graphs> OK: size (vertex x)    == 1
algebraic-graphs> OK: size (overlay x y) == size x + size y
algebraic-graphs> OK: size (connect x y) == size x + size y
algebraic-graphs> OK: size x             >= 1
algebraic-graphs> OK: size x             >= vertexCount x
algebraic-graphs> 
algebraic-graphs> ============ Graph.path ============
algebraic-graphs> OK: path []    == empty
algebraic-graphs> OK: path [x]   == vertex x
algebraic-graphs> OK: path [x,y] == edge x y
algebraic-graphs> 
algebraic-graphs> ============ Graph.circuit ============
algebraic-graphs> OK: circuit []    == empty
algebraic-graphs> OK: circuit [x]   == edge x x
algebraic-graphs> OK: circuit [x,y] == edges [(x,y), (y,x)]
algebraic-graphs> 
algebraic-graphs> ============ Graph.clique ============
algebraic-graphs> OK: clique []         == empty
algebraic-graphs> OK: clique [x]        == vertex x
algebraic-graphs> OK: clique [x,y]      == edge x y
algebraic-graphs> OK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
algebraic-graphs> OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
algebraic-graphs> 
algebraic-graphs> ============ Graph.biclique ============
algebraic-graphs> OK: biclique []      []      == empty
algebraic-graphs> OK: biclique [x]     []      == vertex x
algebraic-graphs> OK: biclique []      [y]     == vertex y
algebraic-graphs> OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
algebraic-graphs> OK: biclique xs      ys      == connect (vertices xs) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ Graph.star ============
algebraic-graphs> OK: star x []    == vertex x
algebraic-graphs> OK: star x [y]   == edge x y
algebraic-graphs> OK: star x [y,z] == edges [(x,y), (x,z)]
algebraic-graphs> OK: star x ys    == connect (vertex x) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ Graph.stars ============
algebraic-graphs> OK: stars []                      == empty
algebraic-graphs> OK: stars [(x, [])]               == vertex x
algebraic-graphs> OK: stars [(x, [y])]              == edge x y
algebraic-graphs> OK: stars [(x, ys)]               == star x ys
algebraic-graphs> OK: stars                         == overlays . map (uncurry star)
algebraic-graphs> OK: stars . adjacencyList         == id
algebraic-graphs> OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ Graph.tree ============
algebraic-graphs> OK: tree (Node x [])                                         == vertex x
algebraic-graphs> OK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
algebraic-graphs> OK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
algebraic-graphs> OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
algebraic-graphs> 
algebraic-graphs> ============ Graph.forest ============
algebraic-graphs> OK: forest []                                                  == empty
algebraic-graphs> OK: forest [x]                                                 == tree x
algebraic-graphs> OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
algebraic-graphs> OK: forest                                                     == overlays . map tree
algebraic-graphs> 
algebraic-graphs> ============ Graph.removeVertex ============
algebraic-graphs> OK: removeVertex x (vertex x)       == empty
algebraic-graphs> OK: removeVertex 1 (vertex 2)       == vertex 2
algebraic-graphs> OK: removeVertex x (edge x x)       == empty
algebraic-graphs> OK: removeVertex 1 (edge 1 2)       == vertex 2
algebraic-graphs> OK: removeVertex x . removeVertex x == removeVertex x
algebraic-graphs> 
algebraic-graphs> ============ Graph.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge x y)       == vertices [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeVertex x == removeVertex x
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> OK: size (removeEdge x y z)         <= 3 * size z
algebraic-graphs> 
algebraic-graphs> ============ Graph.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == mergeVertices (== x) y
algebraic-graphs> 
algebraic-graphs> ============ Graph.mergeVertices ============
algebraic-graphs> OK: mergeVertices (const False) x    == id
algebraic-graphs> OK: mergeVertices (== x) y           == replaceVertex x y
algebraic-graphs> OK: mergeVertices even 1 (0 * 2)     == 1 * 1
algebraic-graphs> OK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
algebraic-graphs> 
algebraic-graphs> ============ Graph.transpose ============
algebraic-graphs> OK: transpose empty       == empty
algebraic-graphs> OK: transpose (vertex x)  == vertex x
algebraic-graphs> OK: transpose (edge x y)  == edge y x
algebraic-graphs> OK: transpose . transpose == id
algebraic-graphs> OK: edgeList . transpose  == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Graph.gmap ============
algebraic-graphs> OK: gmap f empty      == empty
algebraic-graphs> OK: gmap f (vertex x) == vertex (f x)
algebraic-graphs> OK: gmap f (edge x y) == edge (f x) (f y)
algebraic-graphs> OK: gmap id           == id
algebraic-graphs> OK: gmap f . gmap g   == gmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ Graph.induce ============
algebraic-graphs> OK: induce (const True ) x      == x
algebraic-graphs> OK: induce (const False) x      == empty
algebraic-graphs> OK: induce (/= x)               == removeVertex x
algebraic-graphs> OK: induce p . induce q         == induce (\x -> p x && q x)
algebraic-graphs> OK: isSubgraphOf (induce p x) x == True
algebraic-graphs> 
algebraic-graphs> ============ Graph.induceJust ============
algebraic-graphs> OK: induceJust (vertex Nothing)                               == empty
algebraic-graphs> OK: induceJust (edge (Just x) Nothing)                        == vertex x
algebraic-graphs> OK: induceJust . gmap Just                                    == id
algebraic-graphs> OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
algebraic-graphs> 
algebraic-graphs> ============ Graph.compose ============
algebraic-graphs> OK: compose empty            x                == empty
algebraic-graphs> OK: compose x                empty            == empty
algebraic-graphs> OK: compose (vertex x)       y                == empty
algebraic-graphs> OK: compose x                (vertex y)       == empty
algebraic-graphs> OK: compose x                (compose y z)    == compose (compose x y) z
algebraic-graphs> OK: compose x                (overlay y z)    == overlay (compose x y) (compose x z)
algebraic-graphs> OK: compose (overlay x y) z                   == overlay (compose x z) (compose y z)
algebraic-graphs> OK: compose (edge x y)       (edge y z)       == edge x z
algebraic-graphs> OK: compose (path    [1..5]) (path    [1..5]) == edges [(1,3),(2,4),(3,5)]
algebraic-graphs> OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
algebraic-graphs> OK: size (compose x y)                        <= edgeCount x + edgeCount y + 1
algebraic-graphs> 
algebraic-graphs> ============ Graph.(===) ============
algebraic-graphs> OK:     x === x         == True
algebraic-graphs> OK:     x === x + empty == False
algebraic-graphs> OK: x + y === x + y     == True
algebraic-graphs> OK: 1 + 2 === 2 + 1     == False
algebraic-graphs> OK: x + y === x * y     == False
algebraic-graphs> 
algebraic-graphs> ============ Graph.mesh ============
algebraic-graphs> OK: mesh xs     []    == empty
algebraic-graphs> OK: mesh []     ys    == empty
algebraic-graphs> OK: mesh [x]    [y]   == vertex (x, y)
algebraic-graphs> OK: mesh xs     ys    == box (path xs) (path ys)
algebraic-graphs> OK: mesh [1..3] "ab"  == <correct result>
algebraic-graphs> OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
algebraic-graphs> 
algebraic-graphs> ============ Graph.torus ============
algebraic-graphs> OK: torus xs     []    == empty
algebraic-graphs> OK: torus []     ys    == empty
algebraic-graphs> OK: torus [x]    [y]   == edge (x,y) (x,y)
algebraic-graphs> OK: torus xs     ys    == box (circuit xs) (circuit ys)
algebraic-graphs> OK: torus [1,2]  "ab"  == <correct result>
algebraic-graphs> OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
algebraic-graphs> 
algebraic-graphs> ============ Graph.deBruijn ============
algebraic-graphs> OK:           deBruijn 0 xs               == edge [] []
algebraic-graphs> OK: n > 0 ==> deBruijn n []               == empty
algebraic-graphs> OK:           deBruijn 1 [0,1]            == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
algebraic-graphs> OK:           deBruijn 2 "0"              == edge "00" "00"
algebraic-graphs> OK:           deBruijn 2 "01"             == <correct result>
algebraic-graphs> OK:           transpose   (deBruijn n xs) == gmap reverse $ deBruijn n xs
algebraic-graphs> OK:           vertexCount (deBruijn n xs) == (length $ nub xs)^n
algebraic-graphs> OK: n > 0 ==> edgeCount   (deBruijn n xs) == (length $ nub xs)^(n + 1)
algebraic-graphs> 
algebraic-graphs> ============ Graph.splitVertex ============
algebraic-graphs> OK: splitVertex x []                   == removeVertex x
algebraic-graphs> OK: splitVertex x [x]                  == id
algebraic-graphs> OK: splitVertex x [y]                  == replaceVertex x y
algebraic-graphs> OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
algebraic-graphs> 
algebraic-graphs> ============ Graph.bind ============
algebraic-graphs> OK: bind empty f         == empty
algebraic-graphs> OK: bind (vertex x) f    == f x
algebraic-graphs> OK: bind (edge x y) f    == connect (f x) (f y)
algebraic-graphs> OK: bind (vertices xs) f == overlays (map f xs)
algebraic-graphs> OK: bind x (const empty) == empty
algebraic-graphs> OK: bind x vertex        == x
algebraic-graphs> OK: bind (bind x f) g    == bind x (\y -> bind (f y) g)
algebraic-graphs> 
algebraic-graphs> ============ Graph.simplify ============
algebraic-graphs> OK: simplify              == id
algebraic-graphs> OK: size (simplify x)     <= size x
algebraic-graphs> 
algebraic-graphs> ============ Graph.box ============
algebraic-graphs> OK: box x y               ~~ box y x
algebraic-graphs> OK: box x (overlay y z)   == overlay (box x y) (box x z)
algebraic-graphs> OK: box x (vertex ())     ~~ x
algebraic-graphs> OK: box x empty           ~~ empty
algebraic-graphs> OK: box x (box y z)       ~~ box (box x y) z
algebraic-graphs> OK: transpose   (box x y) == box (transpose x) (transpose y)
algebraic-graphs> OK: vertexCount (box x y) == vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
algebraic-graphs> 
algebraic-graphs> ============ Graph.sparsify ============
algebraic-graphs> OK: sort . reachable x       == sort . rights . reachable (sparsify x) . Right
algebraic-graphs> OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
algebraic-graphs> OK: edgeCount   (sparsify x) <= 3 * size x
algebraic-graphs> OK: size        (sparsify x) <= 3 * size x
algebraic-graphs> 
algebraic-graphs> ============ Graph.sparsifyKL ============
algebraic-graphs> OK: sort . reachable x                 == sort . filter (<= n) . reachable (sparsifyKL n x)
algebraic-graphs> OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
algebraic-graphs> OK: length (edges    $ sparsifyKL n x) <= 3 * size x
algebraic-graphs> 
algebraic-graphs> ============ Graph.context ============
algebraic-graphs> OK: context (const False) x                   == Nothing
algebraic-graphs> OK: context (== 1)        (edge 1 2)          == Just (Context [   ] [2  ])
algebraic-graphs> OK: context (== 2)        (edge 1 2)          == Just (Context [1  ] [   ])
algebraic-graphs> OK: context (const True ) (edge 1 2)          == Just (Context [1  ] [2  ])
algebraic-graphs> OK: context (== 4)        (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
algebraic-graphs> 
algebraic-graphs> ============ Graph.buildg ============
algebraic-graphs> OK: buildg (\e _ _ _ -> e)                                     == empty
algebraic-graphs> OK: buildg (\_ v _ _ -> v x)                                   == vertex x
algebraic-graphs> OK: buildg (\e v o c -> o (foldg e v o c x) (foldg e v o c y)) == overlay x y
algebraic-graphs> OK: buildg (\e v o c -> c (foldg e v o c x) (foldg e v o c y)) == connect x y
algebraic-graphs> OK: buildg (\e v o _ -> foldr o e (map v xs))                  == vertices xs
algebraic-graphs> OK: buildg (\e v o c -> foldg e v o (flip c) g)                == transpose g
algebraic-graphs> 
algebraic-graphs> ============ Internal.List ============
algebraic-graphs> OK: pure 1 <> pure 4 == [1, 4]
algebraic-graphs> 
algebraic-graphs> ============ Graph.Label ============
algebraic-graphs> 
algebraic-graphs> ============ Any: instances ============
algebraic-graphs> OK: Semiring
algebraic-graphs> OK: StarSemiring
algebraic-graphs> OK: Dioid
algebraic-graphs> 
algebraic-graphs> ============ Distance Int: instances ============
algebraic-graphs> OK: Semiring
algebraic-graphs> OK: StarSemiring
algebraic-graphs> OK: Dioid
algebraic-graphs> 
algebraic-graphs> ============ Capacity Int: instances ============
algebraic-graphs> OK: Semiring
algebraic-graphs> OK: StarSemiring
algebraic-graphs> OK: Dioid
algebraic-graphs> 
algebraic-graphs> ============ Minimum (Path Int): instances ============
algebraic-graphs> OK: LeftNearRing
algebraic-graphs> 
algebraic-graphs> ============ PowerSet (Path Int): instances ============
algebraic-graphs> OK: Semiring
algebraic-graphs> OK: Dioid
algebraic-graphs> 
algebraic-graphs> ============ Count Int: instances ============
algebraic-graphs> OK: Semiring
algebraic-graphs> OK: StarSemiring
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.consistent ============
algebraic-graphs> OK: arbitraryLabelledAdjacencyMap
algebraic-graphs> OK: empty
algebraic-graphs> OK: vertex
algebraic-graphs> OK: edge
algebraic-graphs> OK: overlay
algebraic-graphs> OK: connect
algebraic-graphs> OK: vertices
algebraic-graphs> OK: edges
algebraic-graphs> OK: overlays
algebraic-graphs> OK: fromAdjacencyMaps
algebraic-graphs> OK: removeVertex
algebraic-graphs> OK: removeEdge
algebraic-graphs> OK: replaceVertex
algebraic-graphs> OK: replaceEdge
algebraic-graphs> OK: transpose
algebraic-graphs> OK: gmap
algebraic-graphs> OK: emap
algebraic-graphs> OK: induce
algebraic-graphs> OK: closure
algebraic-graphs> OK: reflexiveClosure
algebraic-graphs> OK: symmetricClosure
algebraic-graphs> OK: transitiveClosure
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.empty ============
algebraic-graphs> OK: isEmpty     empty == True
algebraic-graphs> OK: hasVertex x empty == False
algebraic-graphs> OK: vertexCount empty == 0
algebraic-graphs> OK: edgeCount   empty == 0
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.vertex ============
algebraic-graphs> OK: isEmpty     (vertex x) == False
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.edge ============
algebraic-graphs> OK: edge e    x y              == connect e (vertex x) (vertex y)
algebraic-graphs> OK: edge zero x y              == vertices [x,y]
algebraic-graphs> OK: hasEdge   x y (edge e x y) == (e /= mempty)
algebraic-graphs> OK: edgeLabel x y (edge e x y) == e
algebraic-graphs> OK: edgeCount     (edge e x y) == if e == mempty then 0 else 1
algebraic-graphs> OK: vertexCount   (edge e 1 1) == 1
algebraic-graphs> OK: vertexCount   (edge e 1 2) == 2
algebraic-graphs> OK: x -<e>- y                  == edge e x y
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.overlay ============
algebraic-graphs> OK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
algebraic-graphs> OK: edgeLabel x y $ overlay (edge e x y) (edge f    x y) == e <+> f
algebraic-graphs> 
algebraic-graphs> OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
algebraic-graphs> OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f   2 3)) == e <.> f
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.connect ============
algebraic-graphs> OK: isEmpty     (connect e x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect e x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: vertexCount (connect e 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect e 1 2) == if e == zero then 0 else 1
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.vertices ============
algebraic-graphs> OK: vertices []            == empty
algebraic-graphs> OK: vertices [x]           == vertex x
algebraic-graphs> OK: vertices               == overlays . map vertex
algebraic-graphs> OK: hasVertex x . vertices == elem x
algebraic-graphs> OK: vertexCount . vertices == length . nub
algebraic-graphs> OK: vertexSet   . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.edges ============
algebraic-graphs> OK: edges []        == empty
algebraic-graphs> OK: edges [(e,x,y)] == edge e x y
algebraic-graphs> OK: edges           == overlays . map (\(e, x, y) -> edge e x y)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.overlays ============
algebraic-graphs> OK: overlays []        == empty
algebraic-graphs> OK: overlays [x]       == x
algebraic-graphs> OK: overlays [x,y]     == overlay x y
algebraic-graphs> OK: overlays           == foldr overlay empty
algebraic-graphs> OK: isEmpty . overlays == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
algebraic-graphs> OK: fromAdjacencyMaps []                                  == empty
algebraic-graphs> OK: fromAdjacencyMaps [(x, Map.empty)]                    == vertex x
algebraic-graphs> OK: fromAdjacencyMaps [(x, Map.singleton y e)]            == if e == zero then vertices [x,y] else edge e x y
algebraic-graphs> OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf empty      x     ==  True
algebraic-graphs> OK: isSubgraphOf (vertex x) empty ==  False
algebraic-graphs> OK: isSubgraphOf x y              ==> x <= y
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.isEmpty ============
algebraic-graphs> OK: isEmpty empty                         == True
algebraic-graphs> OK: isEmpty (overlay empty empty)         == True
algebraic-graphs> OK: isEmpty (vertex x)                    == False
algebraic-graphs> OK: isEmpty (removeVertex x $ vertex x)   == True
algebraic-graphs> OK: isEmpty (removeEdge x y $ edge e x y) == False
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.hasVertex ============
algebraic-graphs> OK: hasVertex x empty            == False
algebraic-graphs> OK: hasVertex x (vertex y)       == (x == y)
algebraic-graphs> OK: hasVertex x . removeVertex x == const False
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.hasEdge ============
algebraic-graphs> OK: hasEdge x y empty            == False
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge x y (edge e x y)     == (e /= zero)
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.edgeLabel ============
algebraic-graphs> OK: edgeLabel x y empty         == zero
algebraic-graphs> OK: edgeLabel x y (vertex z)    == zero
algebraic-graphs> OK: edgeLabel x y (edge e x y)  == e
algebraic-graphs> OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.vertexCount ============
algebraic-graphs> OK: vertexCount empty             ==  0
algebraic-graphs> OK: vertexCount (vertex x)        ==  1
algebraic-graphs> OK: vertexCount                   ==  length . vertexList
algebraic-graphs> OK: vertexCount x < vertexCount y ==> x < y
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.edgeCount ============
algebraic-graphs> OK: edgeCount empty        == 0
algebraic-graphs> OK: edgeCount (vertex x)   == 0
algebraic-graphs> OK: edgeCount (edge e x y) == if e == zero then 0 else 1
algebraic-graphs> OK: edgeCount              == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.vertexList ============
algebraic-graphs> OK: vertexList empty      == []
algebraic-graphs> OK: vertexList (vertex x) == [x]
algebraic-graphs> OK: vertexList . vertices == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.edgeList ============
algebraic-graphs> OK: edgeList empty        == []
algebraic-graphs> OK: edgeList (vertex x)   == []
algebraic-graphs> OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.vertexSet ============
algebraic-graphs> OK: vertexSet empty      == Set.empty
algebraic-graphs> OK: vertexSet . vertex   == Set.singleton
algebraic-graphs> OK: vertexSet . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.edgeSet ============
algebraic-graphs> OK: edgeSet empty        == Set.empty
algebraic-graphs> OK: edgeSet (vertex x)   == Set.empty
algebraic-graphs> OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.preSet ============
algebraic-graphs> OK: preSet x empty        == Set.empty
algebraic-graphs> OK: preSet x (vertex x)   == Set.empty
algebraic-graphs> OK: preSet 1 (edge e 1 2) == Set.empty
algebraic-graphs> OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.postSet ============
algebraic-graphs> OK: postSet x empty        == Set.empty
algebraic-graphs> OK: postSet x (vertex x)   == Set.empty
algebraic-graphs> OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
algebraic-graphs> OK: postSet 2 (edge e 1 2) == Set.empty
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.skeleton ============
algebraic-graphs> OK: hasEdge x y == hasEdge x y . skeleton
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.removeVertex ============
algebraic-graphs> OK: removeVertex x (vertex x)       == empty
algebraic-graphs> OK: removeVertex 1 (vertex 2)       == vertex 2
algebraic-graphs> OK: removeVertex x (edge e x x)     == empty
algebraic-graphs> OK: removeVertex 1 (edge e 1 2)     == vertex 2
algebraic-graphs> OK: removeVertex x . removeVertex x == removeVertex x
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge e x y)     == vertices [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeVertex x == removeVertex x
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == gmap (\v -> if v == x then y else v)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.replaceEdge ============
algebraic-graphs> OK: replaceEdge e x y z                 == overlay (removeEdge x y z) (edge e x y)
algebraic-graphs> OK: replaceEdge e x y (edge f x y)      == edge e x y
algebraic-graphs> OK: edgeLabel x y (replaceEdge e x y z) == e
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.transpose ============
algebraic-graphs> OK: transpose empty        == empty
algebraic-graphs> OK: transpose (vertex x)   == vertex x
algebraic-graphs> OK: transpose (edge e x y) == edge e y x
algebraic-graphs> OK: transpose . transpose  == id
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.gmap ============
algebraic-graphs> OK: gmap f empty        == empty
algebraic-graphs> OK: gmap f (vertex x)   == vertex (f x)
algebraic-graphs> OK: gmap f (edge e x y) == edge e (f x) (f y)
algebraic-graphs> OK: gmap id             == id
algebraic-graphs> OK: gmap f . gmap g     == gmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.emap ============
algebraic-graphs> OK: emap h empty           == empty
algebraic-graphs> OK: emap h (vertex x)      == vertex x
algebraic-graphs> OK: emap h (edge e x y)    == edge (h e) x y
algebraic-graphs> OK: emap h (overlay x y)   == overlay (emap h x) (emap h y)
algebraic-graphs> OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
algebraic-graphs> OK: emap id                == id
algebraic-graphs> OK: emap g . emap h        == emap (g . h)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.induce ============
algebraic-graphs> OK: induce (const True ) x      == x
algebraic-graphs> OK: induce (const False) x      == empty
algebraic-graphs> OK: induce (/= x)               == removeVertex x
algebraic-graphs> OK: induce p . induce q         == induce (\x -> p x && q x)
algebraic-graphs> OK: isSubgraphOf (induce p x) x == True
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.induceJust ============
algebraic-graphs> OK: induceJust (vertex Nothing)                               == empty
algebraic-graphs> OK: induceJust (edge (Just x) Nothing)                        == vertex x
algebraic-graphs> OK: induceJust . gmap Just                                    == id
algebraic-graphs> OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.closure ============
algebraic-graphs> OK: closure empty         == empty
algebraic-graphs> OK: closure (vertex x)    == edge one x x
algebraic-graphs> OK: closure (edge e x x)  == edge one x x
algebraic-graphs> OK: closure (edge e x y)  == edges [(one,x,x), (e,x,y), (one,y,y)]
algebraic-graphs> OK: closure               == reflexiveClosure . transitiveClosure
algebraic-graphs> OK: closure               == transitiveClosure . reflexiveClosure
algebraic-graphs> OK: closure . closure     == closure
algebraic-graphs> OK: postSet x (closure y) == Set.fromList (reachable y x)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.reflexiveClosure ============
algebraic-graphs> OK: reflexiveClosure empty              == empty
algebraic-graphs> OK: reflexiveClosure (vertex x)         == edge one x x
algebraic-graphs> OK: reflexiveClosure (edge e x x)       == edge one x x
algebraic-graphs> OK: reflexiveClosure (edge e x y)       == edges [(one,x,x), (e,x,y), (one,y,y)]
algebraic-graphs> OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.symmetricClosure ============
algebraic-graphs> OK: symmetricClosure empty              == empty
algebraic-graphs> OK: symmetricClosure (vertex x)         == vertex x
algebraic-graphs> OK: symmetricClosure (edge e x y)       == edges [(e,x,y), (e,y,x)]
algebraic-graphs> OK: symmetricClosure x                  == overlay x (transpose x)
algebraic-graphs> OK: symmetricClosure . symmetricClosure == symmetricClosure
algebraic-graphs> 
algebraic-graphs> ============ Labelled.AdjacencyMap.transitiveClosure ============
algebraic-graphs> OK: transitiveClosure empty               == empty
algebraic-graphs> OK: transitiveClosure (vertex x)          == vertex x
algebraic-graphs> OK: transitiveClosure (edge e x y)        == edge e x y
algebraic-graphs> OK: transitiveClosure . transitiveClosure == transitiveClosure
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.empty ============
algebraic-graphs> OK: isEmpty     empty == True
algebraic-graphs> OK: hasVertex x empty == False
algebraic-graphs> OK: vertexCount empty == 0
algebraic-graphs> OK: edgeCount   empty == 0
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.vertex ============
algebraic-graphs> OK: isEmpty     (vertex x) == False
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.edge ============
algebraic-graphs> OK: edge e    x y              == connect e (vertex x) (vertex y)
algebraic-graphs> OK: edge zero x y              == vertices [x,y]
algebraic-graphs> OK: hasEdge   x y (edge e x y) == (e /= mempty)
algebraic-graphs> OK: edgeLabel x y (edge e x y) == e
algebraic-graphs> OK: edgeCount     (edge e x y) == if e == mempty then 0 else 1
algebraic-graphs> OK: vertexCount   (edge e 1 1) == 1
algebraic-graphs> OK: vertexCount   (edge e 1 2) == 2
algebraic-graphs> OK: x -<e>- y                  == edge e x y
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.overlay ============
algebraic-graphs> OK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
algebraic-graphs> OK: edgeLabel x y $ overlay (edge e x y) (edge f    x y) == e <+> f
algebraic-graphs> 
algebraic-graphs> OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
algebraic-graphs> OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f   2 3)) == e <.> f
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.connect ============
algebraic-graphs> OK: isEmpty     (connect e x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect e x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: vertexCount (connect e 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect e 1 2) == if e == zero then 0 else 1
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.vertices ============
algebraic-graphs> OK: vertices []            == empty
algebraic-graphs> OK: vertices [x]           == vertex x
algebraic-graphs> OK: vertices               == overlays . map vertex
algebraic-graphs> OK: hasVertex x . vertices == elem x
algebraic-graphs> OK: vertexCount . vertices == length . nub
algebraic-graphs> OK: vertexSet   . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.edges ============
algebraic-graphs> OK: edges []        == empty
algebraic-graphs> OK: edges [(e,x,y)] == edge e x y
algebraic-graphs> OK: edges           == overlays . map (\(e, x, y) -> edge e x y)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.overlays ============
algebraic-graphs> OK: overlays []        == empty
algebraic-graphs> OK: overlays [x]       == x
algebraic-graphs> OK: overlays [x,y]     == overlay x y
algebraic-graphs> OK: overlays           == foldr overlay empty
algebraic-graphs> OK: isEmpty . overlays == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.foldg ============
algebraic-graphs> OK: foldg empty     vertex        connect             == id
algebraic-graphs> OK: foldg empty     vertex        (fmap flip connect) == transpose
algebraic-graphs> OK: foldg 1         (const 1)     (const (+))         == size
algebraic-graphs> OK: foldg True      (const False) (const (&&))        == isEmpty
algebraic-graphs> OK: foldg False     (== x)        (const (||))        == hasVertex x
algebraic-graphs> OK: foldg Set.empty Set.singleton (const Set.union)   == vertexSet
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.buildg ============
algebraic-graphs> OK: buildg (\e _ _ -> e)                                   == empty
algebraic-graphs> OK: buildg (\_ v _ -> v x)                                 == vertex x
algebraic-graphs> OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
algebraic-graphs> OK: buildg (\e v c -> foldr (c zero) e (map v xs))         == vertices xs
algebraic-graphs> OK: buildg (\e v c -> foldg e v (flip c) g)                == transpose g
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf empty      x     ==  True
algebraic-graphs> OK: isSubgraphOf (vertex x) empty ==  False
algebraic-graphs> OK: isSubgraphOf x y              ==> x <= y
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.isEmpty ============
algebraic-graphs> OK: isEmpty empty                         == True
algebraic-graphs> OK: isEmpty (overlay empty empty)         == True
algebraic-graphs> OK: isEmpty (vertex x)                    == False
algebraic-graphs> OK: isEmpty (removeVertex x $ vertex x)   == True
algebraic-graphs> OK: isEmpty (removeEdge x y $ edge e x y) == False
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.size ============
algebraic-graphs> OK: size empty         == 1
algebraic-graphs> OK: size (vertex x)    == 1
algebraic-graphs> OK: size (overlay x y) == size x + size y
algebraic-graphs> OK: size (connect x y) == size x + size y
algebraic-graphs> OK: size x             >= 1
algebraic-graphs> OK: size x             >= vertexCount x
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.hasVertex ============
algebraic-graphs> OK: hasVertex x empty            == False
algebraic-graphs> OK: hasVertex x (vertex y)       == (x == y)
algebraic-graphs> OK: hasVertex x . removeVertex x == const False
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.hasEdge ============
algebraic-graphs> OK: hasEdge x y empty            == False
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge x y (edge e x y)     == (e /= zero)
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.edgeLabel ============
algebraic-graphs> OK: edgeLabel x y empty         == zero
algebraic-graphs> OK: edgeLabel x y (vertex z)    == zero
algebraic-graphs> OK: edgeLabel x y (edge e x y)  == e
algebraic-graphs> OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.vertexCount ============
algebraic-graphs> OK: vertexCount empty             ==  0
algebraic-graphs> OK: vertexCount (vertex x)        ==  1
algebraic-graphs> OK: vertexCount                   ==  length . vertexList
algebraic-graphs> OK: vertexCount x < vertexCount y ==> x < y
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.edgeCount ============
algebraic-graphs> OK: edgeCount empty        == 0
algebraic-graphs> OK: edgeCount (vertex x)   == 0
algebraic-graphs> OK: edgeCount (edge e x y) == if e == zero then 0 else 1
algebraic-graphs> OK: edgeCount              == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.vertexList ============
algebraic-graphs> OK: vertexList empty      == []
algebraic-graphs> OK: vertexList (vertex x) == [x]
algebraic-graphs> OK: vertexList . vertices == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.edgeList ============
algebraic-graphs> OK: edgeList empty        == []
algebraic-graphs> OK: edgeList (vertex x)   == []
algebraic-graphs> OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.vertexSet ============
algebraic-graphs> OK: vertexSet empty      == Set.empty
algebraic-graphs> OK: vertexSet . vertex   == Set.singleton
algebraic-graphs> OK: vertexSet . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.edgeSet ============
algebraic-graphs> OK: edgeSet empty        == Set.empty
algebraic-graphs> OK: edgeSet (vertex x)   == Set.empty
algebraic-graphs> OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.preSet ============
algebraic-graphs> OK: preSet x empty        == Set.empty
algebraic-graphs> OK: preSet x (vertex x)   == Set.empty
algebraic-graphs> OK: preSet 1 (edge e 1 2) == Set.empty
algebraic-graphs> OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.postSet ============
algebraic-graphs> OK: postSet x empty        == Set.empty
algebraic-graphs> OK: postSet x (vertex x)   == Set.empty
algebraic-graphs> OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
algebraic-graphs> OK: postSet 2 (edge e 1 2) == Set.empty
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.removeVertex ============
algebraic-graphs> OK: removeVertex x (vertex x)       == empty
algebraic-graphs> OK: removeVertex 1 (vertex 2)       == vertex 2
algebraic-graphs> OK: removeVertex x (edge e x x)     == empty
algebraic-graphs> OK: removeVertex 1 (edge e 1 2)     == vertex 2
algebraic-graphs> OK: removeVertex x . removeVertex x == removeVertex x
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge e x y)     == vertices [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeVertex x == removeVertex x
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == fmap (\v -> if v == x then y else v)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.replaceEdge ============
algebraic-graphs> OK: replaceEdge e x y z                 == overlay (removeEdge x y z) (edge e x y)
algebraic-graphs> OK: replaceEdge e x y (edge f x y)      == edge e x y
algebraic-graphs> OK: edgeLabel x y (replaceEdge e x y z) == e
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.transpose ============
algebraic-graphs> OK: transpose empty        == empty
algebraic-graphs> OK: transpose (vertex x)   == vertex x
algebraic-graphs> OK: transpose (edge e x y) == edge e y x
algebraic-graphs> OK: transpose . transpose == id
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.fmap ============
algebraic-graphs> OK: fmap f empty        == empty
algebraic-graphs> OK: fmap f (vertex x)   == vertex (f x)
algebraic-graphs> OK: fmap f (edge e x y) == edge e (f x) (f y)
algebraic-graphs> OK: fmap id             == id
algebraic-graphs> OK: fmap f . fmap g     == fmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.emap ============
algebraic-graphs> OK: emap h empty           == empty
algebraic-graphs> OK: emap h (vertex x)      == vertex x
algebraic-graphs> OK: emap h (edge e x y)    == edge (h e) x y
algebraic-graphs> OK: emap h (overlay x y)   == overlay (emap h x) (emap h y)
algebraic-graphs> OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
algebraic-graphs> OK: emap id                == id
algebraic-graphs> OK: emap g . emap h        == emap (g . h)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.induce ============
algebraic-graphs> OK: induce (const True ) x      == x
algebraic-graphs> OK: induce (const False) x      == empty
algebraic-graphs> OK: induce (/= x)               == removeVertex x
algebraic-graphs> OK: induce p . induce q         == induce (\x -> p x && q x)
algebraic-graphs> OK: isSubgraphOf (induce p x) x == True
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.induceJust ============
algebraic-graphs> OK: induceJust (vertex Nothing)                               == empty
algebraic-graphs> OK: induceJust (edge (Just x) Nothing)                        == vertex x
algebraic-graphs> OK: induceJust . gmap Just                                    == id
algebraic-graphs> OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.closure ============
algebraic-graphs> OK: closure empty         == empty
algebraic-graphs> OK: closure (vertex x)    == edge one x x
algebraic-graphs> OK: closure (edge e x x)  == edge one x x
algebraic-graphs> OK: closure (edge e x y)  == edges [(one,x,x), (e,x,y), (one,y,y)]
algebraic-graphs> OK: closure               == reflexiveClosure . transitiveClosure
algebraic-graphs> OK: closure               == transitiveClosure . reflexiveClosure
algebraic-graphs> OK: closure . closure     == closure
algebraic-graphs> OK: postSet x (closure y) == Set.fromList (reachable y x)
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.reflexiveClosure ============
algebraic-graphs> OK: reflexiveClosure empty              == empty
algebraic-graphs> OK: reflexiveClosure (vertex x)         == edge one x x
algebraic-graphs> OK: reflexiveClosure (edge e x x)       == edge one x x
algebraic-graphs> OK: reflexiveClosure (edge e x y)       == edges [(one,x,x), (e,x,y), (one,y,y)]
algebraic-graphs> OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.symmetricClosure ============
algebraic-graphs> OK: symmetricClosure empty              == empty
algebraic-graphs> OK: symmetricClosure (vertex x)         == vertex x
algebraic-graphs> OK: symmetricClosure (edge e x y)       == edges [(e,x,y), (e,y,x)]
algebraic-graphs> OK: symmetricClosure x                  == overlay x (transpose x)
algebraic-graphs> OK: symmetricClosure . symmetricClosure == symmetricClosure
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.transitiveClosure ============
algebraic-graphs> OK: transitiveClosure empty               == empty
algebraic-graphs> OK: transitiveClosure (vertex x)          == vertex x
algebraic-graphs> OK: transitiveClosure (edge e x y)        == edge e x y
algebraic-graphs> OK: transitiveClosure . transitiveClosure == transitiveClosure
algebraic-graphs> 
algebraic-graphs> ============ Labelled.Graph.context ============
algebraic-graphs> OK: context (const False) x                   == Nothing
algebraic-graphs> OK: context (== 1)        (edge e 1 2)        == if e == zero then Just (Context [] []) else Just (Context []      [(e,2)])
algebraic-graphs> OK: context (== 2)        (edge e 1 2)        == if e == zero then Just (Context [] []) else Just (Context [(e,1)] []     )
algebraic-graphs> OK: context (const True ) (edge e 1 2)        == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
algebraic-graphs> OK: context (== 4)        (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap ============
algebraic-graphs> OK: Axioms of non-empty graphs
algebraic-graphs> OK: Theorems of non-empty graphs
algebraic-graphs> 
algebraic-graphs> ============ Ord (NonEmpty.AdjacencyMap a) ============
algebraic-graphs> OK: vertex 1 <  vertex 2
algebraic-graphs> OK: vertex 3 <  edge 1 2
algebraic-graphs> OK: vertex 1 <  edge 1 1
algebraic-graphs> OK: edge 1 1 <  edge 1 2
algebraic-graphs> OK: edge 1 2 <  edge 1 1 + edge 2 2
algebraic-graphs> OK: edge 1 2 <  edge 1 3
algebraic-graphs> OK: x        <= x + y
algebraic-graphs> OK: x + y    <= x * y
algebraic-graphs> 
algebraic-graphs> ============ Show (NonEmpty.AdjacencyMap a) ============
algebraic-graphs> OK: show (1         :: AdjacencyMap Int) == "vertex 1"
algebraic-graphs> OK: show (1 + 2     :: AdjacencyMap Int) == "vertices1 [1,2]"
algebraic-graphs> OK: show (1 * 2     :: AdjacencyMap Int) == "edge 1 2"
algebraic-graphs> OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
algebraic-graphs> OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
algebraic-graphs> OK: show (vertex (-1)                             :: AdjacencyMap Int) == "vertex (-1)"
algebraic-graphs> OK: show (vertex (-1) + vertex (-2)               :: AdjacencyMap Int) == "vertices1 [-2,-1]"
algebraic-graphs> OK: show (vertex (-1) * vertex (-2)               :: AdjacencyMap Int) == "edge (-1) (-2)"
algebraic-graphs> OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
algebraic-graphs> OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.toNonEmpty ============
algebraic-graphs> OK: toNonEmpty empty          == Nothing
algebraic-graphs> OK: toNonEmpty . fromNonEmpty == Just
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
algebraic-graphs> OK: isEmpty . fromNonEmpty    == const False
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.vertex ============
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.edge ============
algebraic-graphs> OK: edge x y               == connect (vertex x) (vertex y)
algebraic-graphs> OK: hasEdge x y (edge x y) == True
algebraic-graphs> OK: edgeCount   (edge x y) == 1
algebraic-graphs> OK: vertexCount (edge 1 1) == 1
algebraic-graphs> OK: vertexCount (edge 1 2) == 2
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.overlay ============
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.connect ============
algebraic-graphs> OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: vertexCount (connect 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect 1 2) == 1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.vertices1 ============
algebraic-graphs> OK: vertices1 [x]           == vertex x
algebraic-graphs> OK: hasVertex x . vertices1 == elem x
algebraic-graphs> OK: vertexCount . vertices1 == length . nub
algebraic-graphs> OK: vertexSet   . vertices1 == Set.fromList . toList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.edges1 ============
algebraic-graphs> OK: edges1 [(x,y)]     == edge x y
algebraic-graphs> OK: edges1             == overlays1 . fmap (uncurry edge)
algebraic-graphs> OK: edgeCount . edges1 == length . nub
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.overlays1 ============
algebraic-graphs> OK: overlays1 [x]   == x
algebraic-graphs> OK: overlays1 [x,y] == overlay x y
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.connects1 ============
algebraic-graphs> OK: connects1 [x]   == x
algebraic-graphs> OK: connects1 [x,y] == connect x y
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf x             (overlay x y) ==  True
algebraic-graphs> OK: isSubgraphOf (overlay x y) (connect x y) ==  True
algebraic-graphs> OK: isSubgraphOf (path1 xs)    (circuit1 xs) ==  True
algebraic-graphs> OK: isSubgraphOf x y                         ==> x <= y
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.hasVertex ============
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.hasEdge ============
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge x y (edge x y)       == True
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == elem (x,y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.vertexCount ============
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: vertexCount x          >= 1
algebraic-graphs> OK: vertexCount            == length . vertexList1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.edgeCount ============
algebraic-graphs> OK: edgeCount (vertex x) == 0
algebraic-graphs> OK: edgeCount (edge x y) == 1
algebraic-graphs> OK: edgeCount            == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.vertexList1 ============
algebraic-graphs> OK: vertexList1 (vertex x)  == [x]
algebraic-graphs> OK: vertexList1 . vertices1 == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.edgeList ============
algebraic-graphs> OK: edgeList (vertex x)     == []
algebraic-graphs> OK: edgeList (edge x y)     == [(x,y)]
algebraic-graphs> OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
algebraic-graphs> OK: edgeList . edges1       == nub . sort . toList
algebraic-graphs> OK: edgeList . transpose    == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.vertexSet ============
algebraic-graphs> OK: vertexSet . vertex    == Set.singleton
algebraic-graphs> OK: vertexSet . vertices1 == Set.fromList . toList
algebraic-graphs> OK: vertexSet . clique1   == Set.fromList . toList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.edgeSet ============
algebraic-graphs> OK: edgeSet (vertex x) == Set.empty
algebraic-graphs> OK: edgeSet (edge x y) == Set.singleton (x,y)
algebraic-graphs> OK: edgeSet . edges1   == Set.fromList . toList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.preSet ============
algebraic-graphs> OK: preSet x (vertex x) == Set.empty
algebraic-graphs> OK: preSet 1 (edge 1 2) == Set.empty
algebraic-graphs> OK: preSet y (edge x y) == Set.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.postSet ============
algebraic-graphs> OK: postSet x (vertex x) == Set.empty
algebraic-graphs> OK: postSet x (edge x y) == Set.fromList [y]
algebraic-graphs> OK: postSet 2 (edge 1 2) == Set.empty
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.path1 ============
algebraic-graphs> OK: path1 [x]       == vertex x
algebraic-graphs> OK: path1 [x,y]     == edge x y
algebraic-graphs> OK: path1 . reverse == transpose . path1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.circuit1 ============
algebraic-graphs> OK: circuit1 [x]       == edge x x
algebraic-graphs> OK: circuit1 [x,y]     == edges1 [(x,y), (y,x)]
algebraic-graphs> OK: circuit1 . reverse == transpose . circuit1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.clique1 ============
algebraic-graphs> OK: clique1 [x]        == vertex x
algebraic-graphs> OK: clique1 [x,y]      == edge x y
algebraic-graphs> OK: clique1 [x,y,z]    == edges1 [(x,y), (x,z), (y,z)]
algebraic-graphs> OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
algebraic-graphs> OK: clique1 . reverse  == transpose . clique1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.biclique1 ============
algebraic-graphs> OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
algebraic-graphs> OK: biclique1 xs      ys      == connect (vertices1 xs) (vertices1 ys)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.star ============
algebraic-graphs> OK: star x []    == vertex x
algebraic-graphs> OK: star x [y]   == edge x y
algebraic-graphs> OK: star x [y,z] == edges1 [(x,y), (x,z)]
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.stars1 ============
algebraic-graphs> OK: stars1 [(x, [] )]               == vertex x
algebraic-graphs> OK: stars1 [(x, [y])]               == edge x y
algebraic-graphs> OK: stars1 [(x, ys )]               == star x ys
algebraic-graphs> OK: stars1                          == overlays1 . fmap (uncurry star)
algebraic-graphs> OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.tree ============
algebraic-graphs> OK: tree (Node x [])                                         == vertex x
algebraic-graphs> OK: tree (Node x [Node y [Node z []]])                       == path1 [x,y,z]
algebraic-graphs> OK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
algebraic-graphs> OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.removeVertex1 ============
algebraic-graphs> OK: removeVertex1 x (vertex x)          == Nothing
algebraic-graphs> OK: removeVertex1 1 (vertex 2)          == Just (vertex 2)
algebraic-graphs> OK: removeVertex1 x (edge x x)          == Nothing
algebraic-graphs> OK: removeVertex1 1 (edge 1 2)          == Just (vertex 2)
algebraic-graphs> OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge x y)       == vertices1 [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == mergeVertices (== x) y
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.mergeVertices ============
algebraic-graphs> OK: mergeVertices (const False) x    == id
algebraic-graphs> OK: mergeVertices (== x) y           == replaceVertex x y
algebraic-graphs> OK: mergeVertices even 1 (0 * 2)     == 1 * 1
algebraic-graphs> OK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.transpose ============
algebraic-graphs> OK: transpose (vertex x)  == vertex x
algebraic-graphs> OK: transpose (edge x y)  == edge y x
algebraic-graphs> OK: transpose . transpose == id
algebraic-graphs> OK: edgeList . transpose  == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.gmap ============
algebraic-graphs> OK: gmap f (vertex x) == vertex (f x)
algebraic-graphs> OK: gmap f (edge x y) == edge (f x) (f y)
algebraic-graphs> OK: gmap id           == id
algebraic-graphs> OK: gmap f . gmap g   == gmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.induce1 ============
algebraic-graphs> OK: induce1 (const True ) x == Just x
algebraic-graphs> OK: induce1 (const False) x == Nothing
algebraic-graphs> OK: induce1 (/= x)          == removeVertex1 x
algebraic-graphs> OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.induceJust1 ============
algebraic-graphs> OK: induceJust1 (vertex Nothing)                               == Nothing
algebraic-graphs> OK: induceJust1 (edge (Just x) Nothing)                        == Just (vertex x)
algebraic-graphs> OK: induceJust1 . gmap Just                                    == Just
algebraic-graphs> OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.closure ============
algebraic-graphs> OK: closure (vertex x)      == edge x x
algebraic-graphs> OK: closure (edge x x)      == edge x x
algebraic-graphs> OK: closure (edge x y)      == edges1 [(x,x), (x,y), (y,y)]
algebraic-graphs> OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
algebraic-graphs> OK: closure                 == reflexiveClosure . transitiveClosure
algebraic-graphs> OK: closure                 == transitiveClosure . reflexiveClosure
algebraic-graphs> OK: closure . closure       == closure
algebraic-graphs> OK: postSet x (closure y)   == Set.fromList (reachable y x)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
algebraic-graphs> OK: reflexiveClosure (vertex x)         == edge x x
algebraic-graphs> OK: reflexiveClosure (edge x x)         == edge x x
algebraic-graphs> OK: reflexiveClosure (edge x y)         == edges1 [(x,x), (x,y), (y,y)]
algebraic-graphs> OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.symmetricClosure ============
algebraic-graphs> OK: symmetricClosure (vertex x)         == vertex x
algebraic-graphs> OK: symmetricClosure (edge x y)         == edges1 [(x,y), (y,x)]
algebraic-graphs> OK: symmetricClosure x                  == overlay x (transpose x)
algebraic-graphs> OK: symmetricClosure . symmetricClosure == symmetricClosure
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.AdjacencyMap.transitiveClosure ============
algebraic-graphs> OK: transitiveClosure (vertex x)          == vertex x
algebraic-graphs> OK: transitiveClosure (edge x y)          == edge x y
algebraic-graphs> OK: transitiveClosure (path1 $ nub xs)    == clique1 (nub $ xs)
algebraic-graphs> OK: transitiveClosure . transitiveClosure == transitiveClosure
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.============
algebraic-graphs> OK: Axioms of non-empty graphs
algebraic-graphs> OK: Theorems of non-empty graphs
algebraic-graphs> 
algebraic-graphs> ============ Ord (NonEmpty.Graph a) ============
algebraic-graphs> OK: vertex 1 <  vertex 2
algebraic-graphs> OK: vertex 3 <  edge 1 2
algebraic-graphs> OK: vertex 1 <  edge 1 1
algebraic-graphs> OK: edge 1 1 <  edge 1 2
algebraic-graphs> OK: edge 1 2 <  edge 1 1 + edge 2 2
algebraic-graphs> OK: edge 1 2 <  edge 1 3
algebraic-graphs> OK: x        <= x + y
algebraic-graphs> OK: x + y    <= x * y
algebraic-graphs> 
algebraic-graphs> ============ Functor (NonEmpty.Graph a) ============
algebraic-graphs> OK: fmap f (vertex x) == vertex (f x)
algebraic-graphs> OK: fmap f (edge x y) == edge (f x) (f y)
algebraic-graphs> OK: fmap id           == id
algebraic-graphs> OK: fmap f . fmap g   == fmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ Monad (NonEmpty.Graph a) ============
algebraic-graphs> OK: (vertex x >>= f)     == f x
algebraic-graphs> OK: (edge x y >>= f)     == connect (f x) (f y)
algebraic-graphs> OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
algebraic-graphs> OK: (x >>= vertex)       == x
algebraic-graphs> OK: ((x >>= f) >>= g)    == (x >>= (\y -> (f y) >>= g))
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.toNonEmpty ============
algebraic-graphs> OK: toNonEmpty empty       == Nothing
algebraic-graphs> OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.vertex ============
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> OK: size        (vertex x) == 1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.edge ============
algebraic-graphs> OK: edge x y               == connect (vertex x) (vertex y)
algebraic-graphs> OK: hasEdge x y (edge x y) == True
algebraic-graphs> OK: edgeCount   (edge x y) == 1
algebraic-graphs> OK: vertexCount (edge 1 1) == 1
algebraic-graphs> OK: vertexCount (edge 1 2) == 2
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.overlay ============
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: size        (overlay x y) == size x        + size y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.overlay1 ============
algebraic-graphs> OK:                overlay1 empty x == x
algebraic-graphs> OK: x /= empty ==> overlay1 x     y == overlay (fromJust $ toNonEmpty x) y
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.connect ============
algebraic-graphs> OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: size        (connect x y) == size x        + size y
algebraic-graphs> OK: vertexCount (connect 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect 1 2) == 1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.vertices1 ============
algebraic-graphs> OK: vertices1 [x]           == vertex x
algebraic-graphs> OK: hasVertex x . vertices1 == elem x
algebraic-graphs> OK: vertexCount . vertices1 == length . nub
algebraic-graphs> OK: vertexSet   . vertices1 == Set.fromList . toList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.edges1 ============
algebraic-graphs> OK: edges1 [(x,y)]     == edge x y
algebraic-graphs> OK: edges1             == overlays1 . fmap (uncurry edge)
algebraic-graphs> OK: edgeCount . edges1 == length . nub
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.overlays1 ============
algebraic-graphs> OK: overlays1 [x]   == x
algebraic-graphs> OK: overlays1 [x,y] == overlay x y
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.connects1 ============
algebraic-graphs> OK: connects1 [x]   == x
algebraic-graphs> OK: connects1 [x,y] == connect x y
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.foldg1 ============
algebraic-graphs> OK: foldg1 vertex    overlay connect        == id
algebraic-graphs> OK: foldg1 vertex    overlay (flip connect) == transpose
algebraic-graphs> OK: foldg1 (const 1) (+)     (+)            == size
algebraic-graphs> OK: foldg1 (== x)    (||)    (||)           == hasVertex x
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf x             (overlay x y) ==  True
algebraic-graphs> OK: isSubgraphOf (overlay x y) (connect x y) ==  True
algebraic-graphs> OK: isSubgraphOf (path1 xs)    (circuit1 xs) ==  True
algebraic-graphs> OK: isSubgraphOf x y                         ==> x <= y
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.(===) ============
algebraic-graphs> OK:     x === x     == True
algebraic-graphs> OK: x + y === x + y == True
algebraic-graphs> OK: 1 + 2 === 2 + 1 == False
algebraic-graphs> OK: x + y === x * y == False
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.size ============
algebraic-graphs> OK: size (vertex x)    == 1
algebraic-graphs> OK: size (overlay x y) == size x + size y
algebraic-graphs> OK: size (connect x y) == size x + size y
algebraic-graphs> OK: size x             >= 1
algebraic-graphs> OK: size x             >= vertexCount x
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.hasVertex ============
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.hasEdge ============
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge x y (edge x y)       == True
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == elem (x,y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.vertexCount ============
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: vertexCount x          >= 1
algebraic-graphs> OK: vertexCount            == length . vertexList1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.edgeCount ============
algebraic-graphs> OK: edgeCount (vertex x) == 0
algebraic-graphs> OK: edgeCount (edge x y) == 1
algebraic-graphs> OK: edgeCount            == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.vertexList1 ============
algebraic-graphs> OK: vertexList1 (vertex x)  == [x]
algebraic-graphs> OK: vertexList1 . vertices1 == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.edgeList ============
algebraic-graphs> OK: edgeList (vertex x)     == []
algebraic-graphs> OK: edgeList (edge x y)     == [(x,y)]
algebraic-graphs> OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
algebraic-graphs> OK: edgeList . edges1       == nub . sort . toList
algebraic-graphs> OK: edgeList . transpose    == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.vertexSet ============
algebraic-graphs> OK: vertexSet . vertex    == Set.singleton
algebraic-graphs> OK: vertexSet . vertices1 == Set.fromList . toList
algebraic-graphs> OK: vertexSet . clique1   == Set.fromList . toList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.edgeSet ============
algebraic-graphs> OK: edgeSet (vertex x) == Set.empty
algebraic-graphs> OK: edgeSet (edge x y) == Set.singleton (x,y)
algebraic-graphs> OK: edgeSet . edges1   == Set.fromList . toList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.path1 ============
algebraic-graphs> OK: path1 [x]       == vertex x
algebraic-graphs> OK: path1 [x,y]     == edge x y
algebraic-graphs> OK: path1 . reverse == transpose . path1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.circuit1 ============
algebraic-graphs> OK: circuit1 [x]       == edge x x
algebraic-graphs> OK: circuit1 [x,y]     == edges1 [(x,y), (y,x)]
algebraic-graphs> OK: circuit1 . reverse == transpose . circuit1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.clique1 ============
algebraic-graphs> OK: clique1 [x]        == vertex x
algebraic-graphs> OK: clique1 [x,y]      == edge x y
algebraic-graphs> OK: clique1 [x,y,z]    == edges1 [(x,y), (x,z), (y,z)]
algebraic-graphs> OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
algebraic-graphs> OK: clique1 . reverse  == transpose . clique1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.biclique1 ============
algebraic-graphs> OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
algebraic-graphs> OK: biclique1 xs      ys      == connect (vertices1 xs) (vertices1 ys)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.star ============
algebraic-graphs> OK: star x []    == vertex x
algebraic-graphs> OK: star x [y]   == edge x y
algebraic-graphs> OK: star x [y,z] == edges1 [(x,y), (x,z)]
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.stars1 ============
algebraic-graphs> OK: stars1 [(x, [] )]               == vertex x
algebraic-graphs> OK: stars1 [(x, [y])]               == edge x y
algebraic-graphs> OK: stars1 [(x, ys )]               == star x ys
algebraic-graphs> OK: stars1                          == overlays1 . fmap (uncurry star)
algebraic-graphs> OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.tree ============
algebraic-graphs> OK: tree (Node x [])                                         == vertex x
algebraic-graphs> OK: tree (Node x [Node y [Node z []]])                       == path1 [x,y,z]
algebraic-graphs> OK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
algebraic-graphs> OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.mesh1 ============
algebraic-graphs> OK: mesh1 [x]     [y]        == vertex (x, y)
algebraic-graphs> OK: mesh1 xs      ys         == box (path1 xs) (path1 ys)
algebraic-graphs> OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
algebraic-graphs> OK: size (mesh xs ys)        == max 1 (3 * length xs * length ys - length xs - length ys -1)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.torus1 ============
algebraic-graphs> OK: torus1 [x]   [y]        == edge (x,y) (x,y)
algebraic-graphs> OK: torus1 xs    ys         == box (circuit1 xs) (circuit1 ys)
algebraic-graphs> OK: torus1 [1,2] ['a', 'b'] == <correct result>
algebraic-graphs> OK: size (torus1 xs ys)     == max 1 (3 * length xs * length ys)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.removeVertex1 ============
algebraic-graphs> OK: removeVertex1 x (vertex x)          == Nothing
algebraic-graphs> OK: removeVertex1 1 (vertex 2)          == Just (vertex 2)
algebraic-graphs> OK: removeVertex1 x (edge x x)          == Nothing
algebraic-graphs> OK: removeVertex1 1 (edge 1 2)          == Just (vertex 2)
algebraic-graphs> OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge x y)       == vertices1 [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> OK: size (removeEdge x y z)         <= 3 * size z
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == mergeVertices (== x) y
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.mergeVertices ============
algebraic-graphs> OK: mergeVertices (const False) x    == id
algebraic-graphs> OK: mergeVertices (== x) y           == replaceVertex x y
algebraic-graphs> OK: mergeVertices even 1 (0 * 2)     == 1 * 1
algebraic-graphs> OK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.splitVertex1 ============
algebraic-graphs> OK: splitVertex1 x [x]                 == id
algebraic-graphs> OK: splitVertex1 x [y]                 == replaceVertex x y
algebraic-graphs> OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.transpose ============
algebraic-graphs> OK: transpose (vertex x)  == vertex x
algebraic-graphs> OK: transpose (edge x y)  == edge y x
algebraic-graphs> OK: transpose . transpose == id
algebraic-graphs> OK: transpose (box x y)   == box (transpose x) (transpose y)
algebraic-graphs> OK: edgeList . transpose  == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.induce1 ============
algebraic-graphs> OK: induce1 (const True ) x == Just x
algebraic-graphs> OK: induce1 (const False) x == Nothing
algebraic-graphs> OK: induce1 (/= x)          == removeVertex1 x
algebraic-graphs> OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.induceJust1 ============
algebraic-graphs> OK: induceJust1 (vertex Nothing)                               == Nothing
algebraic-graphs> OK: induceJust1 (edge (Just x) Nothing)                        == Just (vertex x)
algebraic-graphs> OK: induceJust1 . fmap Just                                    == Just
algebraic-graphs> OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.simplify ============
algebraic-graphs> OK: simplify             ==  id
algebraic-graphs> OK: size (simplify x)    <=  size x
algebraic-graphs> OK: simplify 1           === 1
algebraic-graphs> OK: simplify (1 + 1)     === 1
algebraic-graphs> OK: simplify (1 + 2 + 1) === 1 + 2
algebraic-graphs> OK: simplify (1 * 1 * 1) === 1 * 1
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.sparsify ============
algebraic-graphs> OK: sort . reachable x       == sort . rights . reachable (sparsify x) . Right
algebraic-graphs> OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
algebraic-graphs> OK: edgeCount   (sparsify x) <= 3 * size x
algebraic-graphs> OK: size        (sparsify x) <= 3 * size x
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.sparsifyKL ============
algebraic-graphs> OK: sort . reachable x                 == sort . filter (<= n) . reachable (sparsifyKL n x)
algebraic-graphs> OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
algebraic-graphs> OK: length (edges    $ sparsifyKL n x) <= 3 * size x
algebraic-graphs> 
algebraic-graphs> ============ NonEmpty.Graph.box ============
algebraic-graphs> OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
algebraic-graphs> OK: box x y                             ~~ box y x
algebraic-graphs> OK: box x (overlay y z)                 == overlay (box x y) (box x z)
algebraic-graphs> OK: box x (vertex ())                   ~~ x
algebraic-graphs> OK: box x (box y z)                     ~~ box (box x y) z
algebraic-graphs> OK: transpose   (box x y)               == box (transpose x) (transpose y)
algebraic-graphs> OK: vertexCount (box x y)               == vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (box x y)               <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
algebraic-graphs> 
algebraic-graphs> ============ Relation ============
algebraic-graphs> OK: Axioms of graphs
algebraic-graphs> 
algebraic-graphs> ============ Relation.consistent ============
algebraic-graphs> OK: Consistency of the Arbitrary instance
algebraic-graphs> 
algebraic-graphs> OK: consistent empty         == True
algebraic-graphs> OK: consistent (vertex x)    == True
algebraic-graphs> OK: consistent (overlay x y) == True
algebraic-graphs> OK: consistent (connect x y) == True
algebraic-graphs> OK: consistent (edge x y)    == True
algebraic-graphs> OK: consistent (edges xs)    == True
algebraic-graphs> OK: consistent (stars xs)    == True
algebraic-graphs> 
algebraic-graphs> ============ Relation.Show ============
algebraic-graphs> OK: show (empty    ) == "empty"
algebraic-graphs> OK: show (1        ) == "vertex 1"
algebraic-graphs> OK: show (1 + 2    ) == "vertices [1,2]"
algebraic-graphs> OK: show (1 * 2    ) == "edge 1 2"
algebraic-graphs> OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
algebraic-graphs> OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
algebraic-graphs> 
algebraic-graphs> OK: show (vertex (-1)                            ) == "vertex (-1)"
algebraic-graphs> OK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
algebraic-graphs> OK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
algebraic-graphs> 
algebraic-graphs> ============ Relation.Ord ============
algebraic-graphs> OK: vertex 1 <  vertex 2
algebraic-graphs> OK: vertex 3 <  edge 1 2
algebraic-graphs> OK: vertex 1 <  edge 1 1
algebraic-graphs> OK: edge 1 1 <  edge 1 2
algebraic-graphs> OK: edge 1 2 <  edge 1 1 + edge 2 2
algebraic-graphs> OK: edge 1 2 <  edge 1 3
algebraic-graphs> OK: x        <= x + y
algebraic-graphs> OK: x + y    <= x * y
algebraic-graphs> 
algebraic-graphs> ============ Relation.empty ============
algebraic-graphs> OK: isEmpty     empty == True
algebraic-graphs> OK: hasVertex x empty == False
algebraic-graphs> OK: vertexCount empty == 0
algebraic-graphs> OK: edgeCount   empty == 0
algebraic-graphs> 
algebraic-graphs> ============ Relation.vertex ============
algebraic-graphs> OK: isEmpty     (vertex x) == False
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ Relation.edge ============
algebraic-graphs> OK: edge x y               == connect (vertex x) (vertex y)
algebraic-graphs> OK: hasEdge x y (edge x y) == True
algebraic-graphs> OK: edgeCount   (edge x y) == 1
algebraic-graphs> OK: vertexCount (edge 1 1) == 1
algebraic-graphs> OK: vertexCount (edge 1 2) == 2
algebraic-graphs> 
algebraic-graphs> ============ Relation.overlay ============
algebraic-graphs> OK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> ============ Relation.connect ============
algebraic-graphs> OK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= vertexCount x * vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: vertexCount (connect 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect 1 2) == 1
algebraic-graphs> 
algebraic-graphs> ============ Relation.vertices ============
algebraic-graphs> OK: vertices []            == empty
algebraic-graphs> OK: vertices [x]           == vertex x
algebraic-graphs> OK: vertices               == overlays . map vertex
algebraic-graphs> OK: hasVertex x . vertices == elem x
algebraic-graphs> OK: vertexCount . vertices == length . nub
algebraic-graphs> OK: vertexSet   . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Relation.edges ============
algebraic-graphs> OK: edges []          == empty
algebraic-graphs> OK: edges [(x,y)]     == edge x y
algebraic-graphs> OK: edges             == overlays . map (uncurry edge)
algebraic-graphs> OK: edgeCount . edges == length . nub
algebraic-graphs> 
algebraic-graphs> ============ Relation.overlays ============
algebraic-graphs> OK: overlays []        == empty
algebraic-graphs> OK: overlays [x]       == x
algebraic-graphs> OK: overlays [x,y]     == overlay x y
algebraic-graphs> OK: overlays           == foldr overlay empty
algebraic-graphs> OK: isEmpty . overlays == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Relation.connects ============
algebraic-graphs> OK: connects []        == empty
algebraic-graphs> OK: connects [x]       == x
algebraic-graphs> OK: connects [x,y]     == connect x y
algebraic-graphs> OK: connects           == foldr connect empty
algebraic-graphs> OK: isEmpty . connects == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Relation.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf empty         x             ==  True
algebraic-graphs> OK: isSubgraphOf (vertex x)    empty         ==  False
algebraic-graphs> OK: isSubgraphOf x             (overlay x y) ==  True
algebraic-graphs> OK: isSubgraphOf (overlay x y) (connect x y) ==  True
algebraic-graphs> OK: isSubgraphOf (path xs)     (circuit xs)  ==  True
algebraic-graphs> OK: isSubgraphOf x y                         ==> x <= y
algebraic-graphs> 
algebraic-graphs> ============ Relation.toGraph et al. ============
algebraic-graphs> OK: toGraph                    == foldg Empty Vertex Overlay Connect
algebraic-graphs> OK: foldg                      == Algebra.Graph.foldg . toGraph
algebraic-graphs> OK: isEmpty                    == foldg True (const False) (&&) (&&)
algebraic-graphs> OK: size                       == foldg 1 (const 1) (+) (+)
algebraic-graphs> OK: hasVertex x                == foldg False (==x) (||) (||)
algebraic-graphs> OK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
algebraic-graphs> OK: vertexCount                == Set.size . vertexSet
algebraic-graphs> OK: edgeCount                  == Set.size . edgeSet
algebraic-graphs> OK: vertexList                 == Set.toAscList . vertexSet
algebraic-graphs> OK: edgeList                   == Set.toAscList . edgeSet
algebraic-graphs> OK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
algebraic-graphs> OK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
algebraic-graphs> OK: edgeSet                    == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
algebraic-graphs> OK: preSet x                   == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
algebraic-graphs> OK: preIntSet x                == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
algebraic-graphs> OK: postSet x                  == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
algebraic-graphs> OK: postIntSet x               == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
algebraic-graphs> OK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
algebraic-graphs> OK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
algebraic-graphs> OK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
algebraic-graphs> OK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
algebraic-graphs> OK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
algebraic-graphs> OK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
algebraic-graphs> OK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
algebraic-graphs> OK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
algebraic-graphs> OK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
algebraic-graphs> OK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
algebraic-graphs> OK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> OK: toAdjacencyMap             == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: toAdjacencyIntMap          == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> 
algebraic-graphs> ============ Relation.foldg ============
algebraic-graphs> OK: foldg empty vertex        overlay connect        == id
algebraic-graphs> OK: foldg empty vertex        overlay (flip connect) == transpose
algebraic-graphs> OK: foldg 1     (const 1)     (+)     (+)            == size
algebraic-graphs> OK: foldg True  (const False) (&&)    (&&)           == isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Relation.isEmpty ============
algebraic-graphs> OK: isEmpty empty                       == True
algebraic-graphs> OK: isEmpty (overlay empty empty)       == True
algebraic-graphs> OK: isEmpty (vertex x)                  == False
algebraic-graphs> OK: isEmpty (removeVertex x $ vertex x) == True
algebraic-graphs> OK: isEmpty (removeEdge x y $ edge x y) == False
algebraic-graphs> 
algebraic-graphs> ============ Relation.hasVertex ============
algebraic-graphs> OK: hasVertex x empty            == False
algebraic-graphs> OK: hasVertex x (vertex y)       == (x == y)
algebraic-graphs> OK: hasVertex x . removeVertex x == const False
algebraic-graphs> 
algebraic-graphs> ============ Relation.hasEdge ============
algebraic-graphs> OK: hasEdge x y empty            == False
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge x y (edge x y)       == True
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == elem (x,y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Relation.vertexCount ============
algebraic-graphs> OK: vertexCount empty             ==  0
algebraic-graphs> OK: vertexCount (vertex x)        ==  1
algebraic-graphs> OK: vertexCount                   ==  length . vertexList
algebraic-graphs> OK: vertexCount x < vertexCount y ==> x < y
algebraic-graphs> 
algebraic-graphs> ============ Relation.edgeCount ============
algebraic-graphs> OK: edgeCount empty      == 0
algebraic-graphs> OK: edgeCount (vertex x) == 0
algebraic-graphs> OK: edgeCount (edge x y) == 1
algebraic-graphs> OK: edgeCount            == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Relation.vertexList ============
algebraic-graphs> OK: vertexList empty      == []
algebraic-graphs> OK: vertexList (vertex x) == [x]
algebraic-graphs> OK: vertexList . vertices == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Relation.vertexSet ============
algebraic-graphs> OK: vertexSet empty      == Set.empty
algebraic-graphs> OK: vertexSet . vertex   == Set.singleton
algebraic-graphs> OK: vertexSet . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Relation.vertexIntSet ============
algebraic-graphs> OK: vertexIntSet empty      == IntSet.empty
algebraic-graphs> OK: vertexIntSet . vertex   == IntSet.singleton
algebraic-graphs> OK: vertexIntSet . vertices == IntSet.fromList
algebraic-graphs> OK: vertexIntSet . clique   == IntSet.fromList
algebraic-graphs> 
algebraic-graphs> ============ Relation.edgeList ============
algebraic-graphs> OK: edgeList empty          == []
algebraic-graphs> OK: edgeList (vertex x)     == []
algebraic-graphs> OK: edgeList (edge x y)     == [(x,y)]
algebraic-graphs> OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
algebraic-graphs> OK: edgeList . edges        == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Relation.edgeSet ============
algebraic-graphs> OK: edgeSet empty      == Set.empty
algebraic-graphs> OK: edgeSet (vertex x) == Set.empty
algebraic-graphs> OK: edgeSet (edge x y) == Set.singleton (x,y)
algebraic-graphs> OK: edgeSet . edges    == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Relation.adjacencyList ============
algebraic-graphs> OK: adjacencyList empty          == []
algebraic-graphs> OK: adjacencyList (vertex x)     == [(x, [])]
algebraic-graphs> OK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [])]
algebraic-graphs> OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
algebraic-graphs> 
algebraic-graphs> ============ Relation.preSet ============
algebraic-graphs> OK: preSet x empty      == Set.empty
algebraic-graphs> OK: preSet x (vertex x) == Set.empty
algebraic-graphs> OK: preSet 1 (edge 1 2) == Set.empty
algebraic-graphs> OK: preSet y (edge x y) == Set.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ Relation.preIntSet ============
algebraic-graphs> OK: preIntSet x empty      == IntSet.empty
algebraic-graphs> OK: preIntSet x (vertex x) == IntSet.empty
algebraic-graphs> OK: preIntSet 1 (edge 1 2) == IntSet.empty
algebraic-graphs> OK: preIntSet y (edge x y) == IntSet.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ Relation.postSet ============
algebraic-graphs> OK: postSet x empty      == Set.empty
algebraic-graphs> OK: postSet x (vertex x) == Set.empty
algebraic-graphs> OK: postSet x (edge x y) == Set.fromList [y]
algebraic-graphs> OK: postSet 2 (edge 1 2) == Set.empty
algebraic-graphs> 
algebraic-graphs> ============ Relation.postIntSet ============
algebraic-graphs> OK: postIntSet x empty      == IntSet.empty
algebraic-graphs> OK: postIntSet x (vertex x) == IntSet.empty
algebraic-graphs> OK: postIntSet 2 (edge 1 2) == IntSet.empty
algebraic-graphs> OK: postIntSet x (edge x y) == IntSet.fromList [y]
algebraic-graphs> 
algebraic-graphs> ============ Relation.path ============
algebraic-graphs> OK: path []    == empty
algebraic-graphs> OK: path [x]   == vertex x
algebraic-graphs> OK: path [x,y] == edge x y
algebraic-graphs> 
algebraic-graphs> ============ Relation.circuit ============
algebraic-graphs> OK: circuit []    == empty
algebraic-graphs> OK: circuit [x]   == edge x x
algebraic-graphs> OK: circuit [x,y] == edges [(x,y), (y,x)]
algebraic-graphs> 
algebraic-graphs> ============ Relation.clique ============
algebraic-graphs> OK: clique []         == empty
algebraic-graphs> OK: clique [x]        == vertex x
algebraic-graphs> OK: clique [x,y]      == edge x y
algebraic-graphs> OK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
algebraic-graphs> OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
algebraic-graphs> 
algebraic-graphs> ============ Relation.biclique ============
algebraic-graphs> OK: biclique []      []      == empty
algebraic-graphs> OK: biclique [x]     []      == vertex x
algebraic-graphs> OK: biclique []      [y]     == vertex y
algebraic-graphs> OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
algebraic-graphs> OK: biclique xs      ys      == connect (vertices xs) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ Relation.star ============
algebraic-graphs> OK: star x []    == vertex x
algebraic-graphs> OK: star x [y]   == edge x y
algebraic-graphs> OK: star x [y,z] == edges [(x,y), (x,z)]
algebraic-graphs> OK: star x ys    == connect (vertex x) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ Relation.stars ============
algebraic-graphs> OK: stars []                      == empty
algebraic-graphs> OK: stars [(x, [])]               == vertex x
algebraic-graphs> OK: stars [(x, [y])]              == edge x y
algebraic-graphs> OK: stars [(x, ys)]               == star x ys
algebraic-graphs> OK: stars                         == overlays . map (uncurry star)
algebraic-graphs> OK: stars . adjacencyList         == id
algebraic-graphs> OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ Relation.tree ============
algebraic-graphs> OK: tree (Node x [])                                         == vertex x
algebraic-graphs> OK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
algebraic-graphs> OK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
algebraic-graphs> OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
algebraic-graphs> 
algebraic-graphs> ============ Relation.forest ============
algebraic-graphs> OK: forest []                                                  == empty
algebraic-graphs> OK: forest [x]                                                 == tree x
algebraic-graphs> OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
algebraic-graphs> OK: forest                                                     == overlays . map tree
algebraic-graphs> 
algebraic-graphs> ============ Relation.removeVertex ============
algebraic-graphs> OK: removeVertex x (vertex x)       == empty
algebraic-graphs> OK: removeVertex 1 (vertex 2)       == vertex 2
algebraic-graphs> OK: removeVertex x (edge x x)       == empty
algebraic-graphs> OK: removeVertex 1 (edge 1 2)       == vertex 2
algebraic-graphs> OK: removeVertex x . removeVertex x == removeVertex x
algebraic-graphs> 
algebraic-graphs> ============ Relation.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge x y)       == vertices [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeVertex x == removeVertex x
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> 
algebraic-graphs> ============ Relation.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == mergeVertices (== x) y
algebraic-graphs> 
algebraic-graphs> ============ Relation.mergeVertices ============
algebraic-graphs> OK: mergeVertices (const False) x    == id
algebraic-graphs> OK: mergeVertices (== x) y           == replaceVertex x y
algebraic-graphs> OK: mergeVertices even 1 (0 * 2)     == 1 * 1
algebraic-graphs> OK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
algebraic-graphs> 
algebraic-graphs> ============ Relation.transpose ============
algebraic-graphs> OK: transpose empty       == empty
algebraic-graphs> OK: transpose (vertex x)  == vertex x
algebraic-graphs> OK: transpose (edge x y)  == edge y x
algebraic-graphs> OK: transpose . transpose == id
algebraic-graphs> OK: edgeList . transpose  == sort . map swap . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Relation.gmap ============
algebraic-graphs> OK: gmap f empty      == empty
algebraic-graphs> OK: gmap f (vertex x) == vertex (f x)
algebraic-graphs> OK: gmap f (edge x y) == edge (f x) (f y)
algebraic-graphs> OK: gmap id           == id
algebraic-graphs> OK: gmap f . gmap g   == gmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ Relation.induce ============
algebraic-graphs> OK: induce (const True ) x      == x
algebraic-graphs> OK: induce (const False) x      == empty
algebraic-graphs> OK: induce (/= x)               == removeVertex x
algebraic-graphs> OK: induce p . induce q         == induce (\x -> p x && q x)
algebraic-graphs> OK: isSubgraphOf (induce p x) x == True
algebraic-graphs> 
algebraic-graphs> ============ Relation.compose ============
algebraic-graphs> OK: compose empty            x                == empty
algebraic-graphs> OK: compose x                empty            == empty
algebraic-graphs> OK: compose (vertex x)       y                == empty
algebraic-graphs> OK: compose x                (vertex y)       == empty
algebraic-graphs> OK: compose x                (compose y z)    == compose (compose x y) z
algebraic-graphs> OK: compose x                (overlay y z)    == overlay (compose x y) (compose x z)
algebraic-graphs> OK: compose (overlay x y) z                   == overlay (compose x z) (compose y z)
algebraic-graphs> OK: compose (edge x y)       (edge y z)       == edge x z
algebraic-graphs> OK: compose (path    [1..5]) (path    [1..5]) == edges [(1,3),(2,4),(3,5)]
algebraic-graphs> OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
algebraic-graphs> 
algebraic-graphs> ============ Relation.closure ============
algebraic-graphs> OK: closure empty           == empty
algebraic-graphs> OK: closure (vertex x)      == edge x x
algebraic-graphs> OK: closure (edge x x)      == edge x x
algebraic-graphs> OK: closure (edge x y)      == edges [(x,x), (x,y), (y,y)]
algebraic-graphs> OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
algebraic-graphs> OK: closure                 == reflexiveClosure . transitiveClosure
algebraic-graphs> OK: closure                 == transitiveClosure . reflexiveClosure
algebraic-graphs> OK: closure . closure       == closure
algebraic-graphs> OK: postSet x (closure y)   == Set.fromList (reachable y x)
algebraic-graphs> 
algebraic-graphs> ============ Relation.reflexiveClosure ============
algebraic-graphs> OK: reflexiveClosure empty              == empty
algebraic-graphs> OK: reflexiveClosure (vertex x)         == edge x x
algebraic-graphs> OK: reflexiveClosure (edge x x)         == edge x x
algebraic-graphs> OK: reflexiveClosure (edge x y)         == edges [(x,x), (x,y), (y,y)]
algebraic-graphs> OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
algebraic-graphs> 
algebraic-graphs> ============ Relation.symmetricClosure ============
algebraic-graphs> OK: symmetricClosure empty              == empty
algebraic-graphs> OK: symmetricClosure (vertex x)         == vertex x
algebraic-graphs> OK: symmetricClosure (edge x y)         == edges [(x,y), (y,x)]
algebraic-graphs> OK: symmetricClosure x                  == overlay x (transpose x)
algebraic-graphs> OK: symmetricClosure . symmetricClosure == symmetricClosure
algebraic-graphs> 
algebraic-graphs> ============ Relation.transitiveClosure ============
algebraic-graphs> OK: transitiveClosure empty               == empty
algebraic-graphs> OK: transitiveClosure (vertex x)          == vertex x
algebraic-graphs> OK: transitiveClosure (edge x y)          == edge x y
algebraic-graphs> OK: transitiveClosure (path $ nub xs)     == clique (nub $ xs)
algebraic-graphs> OK: transitiveClosure . transitiveClosure == transitiveClosure
algebraic-graphs> 
algebraic-graphs> ============ Relation.induceJust ============
algebraic-graphs> OK: induceJust (vertex Nothing)                               == empty
algebraic-graphs> OK: induceJust (edge (Just x) Nothing)                        == vertex x
algebraic-graphs> OK: induceJust . gmap Just                                    == id
algebraic-graphs> OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
algebraic-graphs> 
algebraic-graphs> ============ ReflexiveRelation ============
algebraic-graphs> OK: Axioms of reflexive graphs
algebraic-graphs> 
algebraic-graphs> ============ TransitiveRelation ============
algebraic-graphs> OK: Axioms of transitive graphs
algebraic-graphs> OK: path xs == (clique xs :: TransitiveRelation Int)
algebraic-graphs> 
algebraic-graphs> ============ PreorderRelation ============
algebraic-graphs> OK: Axioms of preorder graphs
algebraic-graphs> OK: path xs == (clique xs :: PreorderRelation Int)
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation ============
algebraic-graphs> OK: Axioms of undirected graphs
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.consistent ============
algebraic-graphs> OK: Consistency of the Arbitrary instance
algebraic-graphs> 
algebraic-graphs> OK: consistent empty         == True
algebraic-graphs> OK: consistent (vertex x)    == True
algebraic-graphs> OK: consistent (overlay x y) == True
algebraic-graphs> OK: consistent (connect x y) == True
algebraic-graphs> OK: consistent (edge x y)    == True
algebraic-graphs> OK: consistent (edges xs)    == True
algebraic-graphs> OK: consistent (stars xs)    == True
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.Show ============
algebraic-graphs> OK: show (empty    ) == "empty"
algebraic-graphs> OK: show (1        ) == "vertex 1"
algebraic-graphs> OK: show (1 + 2    ) == "vertices [1,2]"
algebraic-graphs> OK: show (1 * 2    ) == "edge 1 2"
algebraic-graphs> OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
algebraic-graphs> OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
algebraic-graphs> 
algebraic-graphs> OK: show (vertex (-1)                            ) == "vertex (-1)"
algebraic-graphs> OK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
algebraic-graphs> OK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
algebraic-graphs> 
algebraic-graphs> OK: show (2 * 1    ) == "edge 1 2"
algebraic-graphs> OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
algebraic-graphs> OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.toSymmetric ============
algebraic-graphs> OK: toSymmetric (edge 1 2)         == edge 1 2
algebraic-graphs> OK: toSymmetric . fromSymmetric    == id
algebraic-graphs> OK: fromSymmetric    . toSymmetric == symmetricClosure
algebraic-graphs> OK: vertexCount      . toSymmetric == vertexCount
algebraic-graphs> OK: (*2) . edgeCount . toSymmetric >= edgeCount
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.fromSymmetric ============
algebraic-graphs> OK: fromSymmetric (edge 1 2)    == edges [(1,2), (2,1)]
algebraic-graphs> OK: vertexCount . fromSymmetric == vertexCount
algebraic-graphs> OK: edgeCount   . fromSymmetric <= (*2) . edgeCount
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.Ord ============
algebraic-graphs> OK: vertex 1 <  vertex 2
algebraic-graphs> OK: vertex 3 <  edge 1 2
algebraic-graphs> OK: vertex 1 <  edge 1 1
algebraic-graphs> OK: edge 1 1 <  edge 1 2
algebraic-graphs> OK: edge 1 2 <  edge 1 1 + edge 2 2
algebraic-graphs> OK: edge 2 1 <  edge 1 3
algebraic-graphs> OK: edge 1 2 == edge 2 1
algebraic-graphs> OK: x        <= x + y
algebraic-graphs> OK: x + y    <= x * y
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.empty ============
algebraic-graphs> OK: isEmpty     empty == True
algebraic-graphs> OK: hasVertex x empty == False
algebraic-graphs> OK: vertexCount empty == 0
algebraic-graphs> OK: edgeCount   empty == 0
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.vertex ============
algebraic-graphs> OK: isEmpty     (vertex x) == False
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.edge ============
algebraic-graphs> OK: edge x y               == connect (vertex x) (vertex y)
algebraic-graphs> OK: edge x y               == edge y x
algebraic-graphs> OK: edge x y               == edges [(x,y), (y,x)]
algebraic-graphs> OK: hasEdge x y (edge x y) == True
algebraic-graphs> OK: edgeCount   (edge x y) == 1
algebraic-graphs> OK: vertexCount (edge 1 1) == 1
algebraic-graphs> OK: vertexCount (edge 1 2) == 2
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.overlay ============
algebraic-graphs> OK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.connect ============
algebraic-graphs> OK: connect x y               == connect y x
algebraic-graphs> OK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= vertexCount x * vertexCount y `div` 2
algebraic-graphs> OK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: vertexCount (connect 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect 1 2) == 1
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.vertices ============
algebraic-graphs> OK: vertices []            == empty
algebraic-graphs> OK: vertices [x]           == vertex x
algebraic-graphs> OK: vertices               == overlays . map vertex
algebraic-graphs> OK: hasVertex x . vertices == elem x
algebraic-graphs> OK: vertexCount . vertices == length . nub
algebraic-graphs> OK: vertexSet   . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.edges ============
algebraic-graphs> OK: edges []             == empty
algebraic-graphs> OK: edges [(x,y)]        == edge x y
algebraic-graphs> OK: edges [(x,y), (y,x)] == edge x y
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.overlays ============
algebraic-graphs> OK: overlays []        == empty
algebraic-graphs> OK: overlays [x]       == x
algebraic-graphs> OK: overlays [x,y]     == overlay x y
algebraic-graphs> OK: overlays           == foldr overlay empty
algebraic-graphs> OK: isEmpty . overlays == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.connects ============
algebraic-graphs> OK: connects []        == empty
algebraic-graphs> OK: connects [x]       == x
algebraic-graphs> OK: connects [x,y]     == connect x y
algebraic-graphs> OK: connects           == foldr connect empty
algebraic-graphs> OK: isEmpty . connects == all isEmpty
algebraic-graphs> OK: connects           == connects . reverse
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf empty         x             ==  True
algebraic-graphs> OK: isSubgraphOf (vertex x)    empty         ==  False
algebraic-graphs> OK: isSubgraphOf x             (overlay x y) ==  True
algebraic-graphs> OK: isSubgraphOf (overlay x y) (connect x y) ==  True
algebraic-graphs> OK: isSubgraphOf (path xs)     (circuit xs)  ==  True
algebraic-graphs> OK: isSubgraphOf x y                         ==> x <= y
algebraic-graphs> OK: isSubgraphOf (edge x y) (edge y x)       ==  True
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.toGraph et al. ============
algebraic-graphs> OK: toGraph                    == foldg Empty Vertex Overlay Connect
algebraic-graphs> OK: foldg                      == Algebra.Graph.foldg . toGraph
algebraic-graphs> OK: isEmpty                    == foldg True (const False) (&&) (&&)
algebraic-graphs> OK: size                       == foldg 1 (const 1) (+) (+)
algebraic-graphs> OK: hasVertex x                == foldg False (==x) (||) (||)
algebraic-graphs> OK: hasEdge x y                == Algebra.Graph.hasEdge x y . toGraph
algebraic-graphs> OK: vertexCount                == Set.size . vertexSet
algebraic-graphs> OK: edgeCount                  == Set.size . edgeSet
algebraic-graphs> OK: vertexList                 == Set.toAscList . vertexSet
algebraic-graphs> OK: edgeList                   == Set.toAscList . edgeSet
algebraic-graphs> OK: vertexSet                  == foldg Set.empty Set.singleton Set.union Set.union
algebraic-graphs> OK: vertexIntSet               == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
algebraic-graphs> OK: adjacencyList              == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
algebraic-graphs> OK: adjacencyMap               == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
algebraic-graphs> OK: adjacencyIntMap            == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
algebraic-graphs> OK: adjacencyMapTranspose      == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
algebraic-graphs> OK: adjacencyIntMapTranspose   == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
algebraic-graphs> OK: dfsForest                  == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
algebraic-graphs> OK: dfsForestFrom              == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
algebraic-graphs> OK: dfs                        == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
algebraic-graphs> OK: reachable                  == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
algebraic-graphs> OK: topSort                    == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
algebraic-graphs> OK: isAcyclic                  == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> OK: toAdjacencyMap             == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyMapTranspose    == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: toAdjacencyIntMap          == foldg empty vertex overlay connect
algebraic-graphs> OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
algebraic-graphs> OK: isDfsForestOf f            == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
algebraic-graphs> OK: isTopSortOf vs             == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.isEmpty ============
algebraic-graphs> OK: isEmpty empty                       == True
algebraic-graphs> OK: isEmpty (overlay empty empty)       == True
algebraic-graphs> OK: isEmpty (vertex x)                  == False
algebraic-graphs> OK: isEmpty (removeVertex x $ vertex x) == True
algebraic-graphs> OK: isEmpty (removeEdge x y $ edge x y) == False
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.hasVertex ============
algebraic-graphs> OK: hasVertex x empty            == False
algebraic-graphs> OK: hasVertex x (vertex y)       == (x == y)
algebraic-graphs> OK: hasVertex x . removeVertex x == const False
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.hasEdge ============
algebraic-graphs> OK: hasEdge x y empty            == False
algebraic-graphs> OK: hasEdge x y (vertex z)       == False
algebraic-graphs> OK: hasEdge x y (edge x y)       == True
algebraic-graphs> OK: hasEdge x y (edge y x)       == True
algebraic-graphs> OK: hasEdge x y . removeEdge x y == const False
algebraic-graphs> OK: hasEdge x y                  == elem (min x y, max x y) . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.vertexCount ============
algebraic-graphs> OK: vertexCount empty             ==  0
algebraic-graphs> OK: vertexCount (vertex x)        ==  1
algebraic-graphs> OK: vertexCount                   ==  length . vertexList
algebraic-graphs> OK: vertexCount x < vertexCount y ==> x < y
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.edgeCount ============
algebraic-graphs> OK: edgeCount empty      == 0
algebraic-graphs> OK: edgeCount (vertex x) == 0
algebraic-graphs> OK: edgeCount (edge x y) == 1
algebraic-graphs> OK: edgeCount            == length . edgeList
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.vertexList ============
algebraic-graphs> OK: vertexList empty      == []
algebraic-graphs> OK: vertexList (vertex x) == [x]
algebraic-graphs> OK: vertexList . vertices == nub . sort
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.vertexSet ============
algebraic-graphs> OK: vertexSet empty      == Set.empty
algebraic-graphs> OK: vertexSet . vertex   == Set.singleton
algebraic-graphs> OK: vertexSet . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.vertexIntSet ============
algebraic-graphs> OK: vertexIntSet empty      == IntSet.empty
algebraic-graphs> OK: vertexIntSet . vertex   == IntSet.singleton
algebraic-graphs> OK: vertexIntSet . vertices == IntSet.fromList
algebraic-graphs> OK: vertexIntSet . clique   == IntSet.fromList
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.edgeList ============
algebraic-graphs> OK: edgeList empty          == []
algebraic-graphs> OK: edgeList (vertex x)     == []
algebraic-graphs> OK: edgeList (edge x y)     == [(min x y, max y x)]
algebraic-graphs> OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.edgeSet ============
algebraic-graphs> OK: edgeSet empty      == Set.empty
algebraic-graphs> OK: edgeSet (vertex x) == Set.empty
algebraic-graphs> OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.adjacencyList ============
algebraic-graphs> OK: adjacencyList empty          == []
algebraic-graphs> OK: adjacencyList (vertex x)     == [(x, [])]
algebraic-graphs> OK: adjacencyList (edge 1 2)     == [(1, [2]), (2, [1])]
algebraic-graphs> OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.neighbours ============
algebraic-graphs> OK: neighbours x empty      == Set.empty
algebraic-graphs> OK: neighbours x (vertex x) == Set.empty
algebraic-graphs> OK: neighbours x (edge x y) == Set.fromList [y]
algebraic-graphs> OK: neighbours y (edge x y) == Set.fromList [x]
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.path ============
algebraic-graphs> OK: path []    == empty
algebraic-graphs> OK: path [x]   == vertex x
algebraic-graphs> OK: path [x,y] == edge x y
algebraic-graphs> OK: path       == path . reverse
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.circuit ============
algebraic-graphs> OK: circuit []    == empty
algebraic-graphs> OK: circuit [x]   == edge x x
algebraic-graphs> OK: circuit [x,y] == edges [(x,y), (y,x)]
algebraic-graphs> OK: circuit       == circuit . reverse
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.clique ============
algebraic-graphs> OK: clique []         == empty
algebraic-graphs> OK: clique [x]        == vertex x
algebraic-graphs> OK: clique [x,y]      == edge x y
algebraic-graphs> OK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
algebraic-graphs> OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
algebraic-graphs> OK: clique            == clique . reverse
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.biclique ============
algebraic-graphs> OK: biclique []      []      == empty
algebraic-graphs> OK: biclique [x]     []      == vertex x
algebraic-graphs> OK: biclique []      [y]     == vertex y
algebraic-graphs> OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
algebraic-graphs> OK: biclique xs      ys      == connect (vertices xs) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.star ============
algebraic-graphs> OK: star x []    == vertex x
algebraic-graphs> OK: star x [y]   == edge x y
algebraic-graphs> OK: star x [y,z] == edges [(x,y), (x,z)]
algebraic-graphs> OK: star x ys    == connect (vertex x) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.stars ============
algebraic-graphs> OK: stars []                      == empty
algebraic-graphs> OK: stars [(x, [])]               == vertex x
algebraic-graphs> OK: stars [(x, [y])]              == edge x y
algebraic-graphs> OK: stars [(x, ys)]               == star x ys
algebraic-graphs> OK: stars                         == overlays . map (uncurry star)
algebraic-graphs> OK: stars . adjacencyList         == id
algebraic-graphs> OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.tree ============
algebraic-graphs> OK: tree (Node x [])                                         == vertex x
algebraic-graphs> OK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
algebraic-graphs> OK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
algebraic-graphs> OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.forest ============
algebraic-graphs> OK: forest []                                                  == empty
algebraic-graphs> OK: forest [x]                                                 == tree x
algebraic-graphs> OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
algebraic-graphs> OK: forest                                                     == overlays . map tree
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.removeVertex ============
algebraic-graphs> OK: removeVertex x (vertex x)       == empty
algebraic-graphs> OK: removeVertex 1 (vertex 2)       == vertex 2
algebraic-graphs> OK: removeVertex x (edge x x)       == empty
algebraic-graphs> OK: removeVertex 1 (edge 1 2)       == vertex 2
algebraic-graphs> OK: removeVertex x . removeVertex x == removeVertex x
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge x y)       == vertices [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeVertex x == removeVertex x
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> OK: removeEdge x y                  == removeEdge y x
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == mergeVertices (== x) y
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.mergeVertices ============
algebraic-graphs> OK: mergeVertices (const False) x    == id
algebraic-graphs> OK: mergeVertices (== x) y           == replaceVertex x y
algebraic-graphs> OK: mergeVertices even 1 (0 * 2)     == 1 * 1
algebraic-graphs> OK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.gmap ============
algebraic-graphs> OK: gmap f empty      == empty
algebraic-graphs> OK: gmap f (vertex x) == vertex (f x)
algebraic-graphs> OK: gmap f (edge x y) == edge (f x) (f y)
algebraic-graphs> OK: gmap id           == id
algebraic-graphs> OK: gmap f . gmap g   == gmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.induce ============
algebraic-graphs> OK: induce (const True ) x      == x
algebraic-graphs> OK: induce (const False) x      == empty
algebraic-graphs> OK: induce (/= x)               == removeVertex x
algebraic-graphs> OK: induce p . induce q         == induce (\x -> p x && q x)
algebraic-graphs> OK: isSubgraphOf (induce p x) x == True
algebraic-graphs> 
algebraic-graphs> ============ Symmetric.Relation.induceJust ============
algebraic-graphs> OK: induceJust (vertex Nothing)                               == empty
algebraic-graphs> OK: induceJust (edge (Just x) Nothing)                        == vertex x
algebraic-graphs> OK: induceJust . gmap Just                                    == id
algebraic-graphs> OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
algebraic-graphs> 
algebraic-graphs> ============ Example.Todo (Holiday) ============
algebraic-graphs> OK: A todo list is semantically Maybe [a]
algebraic-graphs> OK: The overlay operator (+) adds non-dependent items to the todo list
algebraic-graphs> OK: The connect operator (*) adds dependency between items
algebraic-graphs> OK: Contradictory constraints make the todo list impossible to schedule
algebraic-graphs> OK: Introduce item priority to schedule the todo list
algebraic-graphs> OK: Custom connect operators pull/repel arguments during scheduling
algebraic-graphs> 
algebraic-graphs> ============ Example.Todo (Commandline) ============
algebraic-graphs> OK: The pull connect operator maintains command line semantics
algebraic-graphs> OK: Swapping flags are allowed by the commutative overlay opeartor
algebraic-graphs> OK: The usual connect operator breaks semantics
algebraic-graphs> OK: Transform command lines by adding optimisation flag
algebraic-graphs> 
algebraic-graphs> ============ Typed ============
algebraic-graphs> 
algebraic-graphs> ============ Typed.fromAdjacencyMap ============
algebraic-graphs> OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1))                                == array (0,2) [(0,[1]), (1,[]), (2,[0])]
algebraic-graphs> OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1))                                == array (0,1) [(0,[1]), (1,[0])]
algebraic-graphs> OK: map (fromVertexKL h) (vertices $ toGraphKL h)                               == vertexList g
algebraic-graphs> OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
algebraic-graphs> 
algebraic-graphs> ============ Typed.fromAdjacencyIntMap ============
algebraic-graphs> OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1))                             == array (0,2) [(0,[1]), (1,[]), (2,[0])]
algebraic-graphs> OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1))                             == array (0,1) [(0,[1]), (1,[0])]
algebraic-graphs> OK: map (fromVertexKL h) (vertices $ toGraphKL h)                               == IntSet.toAscList (vertexIntSet g)
algebraic-graphs> OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
algebraic-graphs> 
algebraic-graphs> ============ Typed.dfsForest ============
algebraic-graphs> OK: forest (dfsForest % edge 1 1)           == vertex 1
algebraic-graphs> OK: forest (dfsForest % edge 1 2)           == edge 1 2
algebraic-graphs> OK: forest (dfsForest % edge 2 1)           == vertices [1, 2]
algebraic-graphs> OK: isSubgraphOf (forest $ dfsForest % x) x == True
algebraic-graphs> OK: dfsForest % forest (dfsForest % x)      == dfsForest % x
algebraic-graphs> OK: dfsForest % vertices vs                 == map (\v -> Node v []) (nub $ sort vs)
algebraic-graphs> OK: dfsForest % (3 * (1 + 4) * (1 + 5))     == <correct result>
algebraic-graphs> 
algebraic-graphs> ============ Typed.dfsForestFrom ============
algebraic-graphs> OK: forest $ (dfsForestFrom % edge 1 1) [1]         == vertex 1
algebraic-graphs> OK: forest $ (dfsForestFrom % edge 1 2) [0]         == empty
algebraic-graphs> OK: forest $ (dfsForestFrom % edge 1 2) [1]         == edge 1 2
algebraic-graphs> OK: forest $ (dfsForestFrom % edge 1 2) [2]         == vertex 2
algebraic-graphs> OK: forest $ (dfsForestFrom % edge 1 2) [2,1]       == vertices [1,2]
algebraic-graphs> OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
algebraic-graphs> OK: dfsForestFrom % x $ vertexList x                == dfsForest % x
algebraic-graphs> OK: dfsForestFrom % vertices vs $ vs                == map (\v -> Node v []) (nub vs)
algebraic-graphs> OK: dfsForestFrom % x $ []                          == []
algebraic-graphs> OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
algebraic-graphs> 
algebraic-graphs> ============ Typed.dfs ============
algebraic-graphs> OK: dfs % edge 1 1 $ [1]   == [1]
algebraic-graphs> OK: dfs % edge 1 2 $ [0]   == []
algebraic-graphs> OK: dfs % edge 1 2 $ [1]   == [1,2]
algebraic-graphs> OK: dfs % edge 1 2 $ [2]   == [2]
algebraic-graphs> OK: dfs % edge 1 2 $ [1,2] == [1,2]
algebraic-graphs> OK: dfs % edge 1 2 $ [2,1] == [2,1]
algebraic-graphs> OK: dfs % x        $ []    == []
algebraic-graphs> 
algebraic-graphs> OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4]     == [1,5,4]
algebraic-graphs> OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
algebraic-graphs> 
algebraic-graphs> ============ Typed.topSort ============
algebraic-graphs> OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
algebraic-graphs> OK: topSort % (1 * 2 + 2 * 1) == [1,2]
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected ============
algebraic-graphs> OK: Axioms of undirected graphs
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.Show ============
algebraic-graphs> OK: show (empty    ) == "empty"
algebraic-graphs> OK: show (1        ) == "vertex 1"
algebraic-graphs> OK: show (1 + 2    ) == "vertices [1,2]"
algebraic-graphs> OK: show (1 * 2    ) == "edge 1 2"
algebraic-graphs> OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
algebraic-graphs> OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
algebraic-graphs> 
algebraic-graphs> OK: show (vertex (-1)                            ) == "vertex (-1)"
algebraic-graphs> OK: show (vertex (-1) + vertex (-2)              ) == "vertices [-2,-1]"
algebraic-graphs> OK: show (vertex (-2) * vertex (-1)              ) == "edge (-2) (-1)"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
algebraic-graphs> OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
algebraic-graphs> 
algebraic-graphs> OK: show (2 * 1    ) == "edge 1 2"
algebraic-graphs> OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
algebraic-graphs> OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.toUndirected ============
algebraic-graphs> OK: toUndirected (edge 1 2)         == edge 1 2
algebraic-graphs> OK: toUndirected . fromUndirected   == id
algebraic-graphs> OK: vertexCount      . toUndirected == vertexCount
algebraic-graphs> OK: (*2) . edgeCount . toUndirected >= edgeCount
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.fromUndirected ============
algebraic-graphs> OK: fromUndirected (edge 1 2)    == edges [(1,2),(2,1)]
algebraic-graphs> OK: toUndirected . fromUndirected == id
algebraic-graphs> OK: vertexCount . fromUndirected == vertexCount
algebraic-graphs> OK: edgeCount   . fromUndirected <= (*2) . edgeCount
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.complement ================
algebraic-graphs> OK: complement empty              == empty
algebraic-graphs> OK: complement (vertex x)         == vertex x
algebraic-graphs> OK: complement (edge 1 1)         == edge 1 1
algebraic-graphs> OK: complement (edge 1 2)         == vertices [1, 2]
algebraic-graphs> OK: complement (star 1 [2, 3])    == overlay (vertex 1) (edge 2 3)
algebraic-graphs> OK: complement . complement       == id
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.Ord ============
algebraic-graphs> OK: vertex 1 <  vertex 2
algebraic-graphs> OK: vertex 3 <  edge 1 2
algebraic-graphs> OK: vertex 1 <  edge 1 1
algebraic-graphs> OK: edge 1 1 <  edge 1 2
algebraic-graphs> OK: edge 1 2 <  edge 1 1 + edge 2 2
algebraic-graphs> OK: edge 2 1 <  edge 1 3
algebraic-graphs> OK: edge 1 2 == edge 2 1
algebraic-graphs> OK: x        <= x + y
algebraic-graphs> OK: x + y    <= x * y
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.empty ============
algebraic-graphs> OK: isEmpty     empty == True
algebraic-graphs> OK: hasVertex x empty == False
algebraic-graphs> OK: vertexCount empty == 0
algebraic-graphs> OK: edgeCount   empty == 0
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.vertex ============
algebraic-graphs> OK: isEmpty     (vertex x) == False
algebraic-graphs> OK: hasVertex x (vertex y) == (x == y)
algebraic-graphs> OK: vertexCount (vertex x) == 1
algebraic-graphs> OK: edgeCount   (vertex x) == 0
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.edge ============
algebraic-graphs> OK: edge x y               == connect (vertex x) (vertex y)
algebraic-graphs> OK: edge x y               == edge y x
algebraic-graphs> OK: edge x y               == edges [(x,y), (y,x)]
algebraic-graphs> OK: hasEdge x y (edge x y) == True
algebraic-graphs> OK: edgeCount   (edge x y) == 1
algebraic-graphs> OK: vertexCount (edge 1 1) == 1
algebraic-graphs> OK: vertexCount (edge 1 2) == 2
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.overlay ============
algebraic-graphs> OK: isEmpty     (overlay x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (overlay x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (overlay x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (overlay x y) <= edgeCount x   + edgeCount y
algebraic-graphs> OK: vertexCount (overlay 1 2) == 2
algebraic-graphs> OK: edgeCount   (overlay 1 2) == 0
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.connect ============
algebraic-graphs> OK: connect x y               == connect y x
algebraic-graphs> OK: isEmpty     (connect x y) == isEmpty   x   && isEmpty   y
algebraic-graphs> OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
algebraic-graphs> OK: vertexCount (connect x y) >= vertexCount x
algebraic-graphs> OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount x
algebraic-graphs> OK: edgeCount   (connect x y) >= edgeCount y
algebraic-graphs> OK: edgeCount   (connect x y) >= vertexCount x * vertexCount y `div` 2
algebraic-graphs> OK: edgeCount   (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
algebraic-graphs> OK: vertexCount (connect 1 2) == 2
algebraic-graphs> OK: edgeCount   (connect 1 2) == 1
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.vertices ============
algebraic-graphs> OK: vertices []            == empty
algebraic-graphs> OK: vertices [x]           == vertex x
algebraic-graphs> OK: vertices               == overlays . map vertex
algebraic-graphs> OK: hasVertex x . vertices == elem x
algebraic-graphs> OK: vertexCount . vertices == length . nub
algebraic-graphs> OK: vertexSet   . vertices == Set.fromList
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.edges ============
algebraic-graphs> OK: edges []             == empty
algebraic-graphs> OK: edges [(x,y)]        == edge x y
algebraic-graphs> OK: edges [(x,y), (y,x)] == edge x y
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.overlays ============
algebraic-graphs> OK: overlays []        == empty
algebraic-graphs> OK: overlays [x]       == x
algebraic-graphs> OK: overlays [x,y]     == overlay x y
algebraic-graphs> OK: overlays           == foldr overlay empty
algebraic-graphs> OK: isEmpty . overlays == all isEmpty
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.connects ============
algebraic-graphs> OK: connects []        == empty
algebraic-graphs> OK: connects [x]       == x
algebraic-graphs> OK: connects [x,y]     == connect x y
algebraic-graphs> OK: connects           == foldr connect empty
algebraic-graphs> OK: isEmpty . connects == all isEmpty
algebraic-graphs> OK: connects           == connects . reverse
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.isSubgraphOf ============
algebraic-graphs> OK: isSubgraphOf empty         x             ==  True
algebraic-graphs> OK: isSubgraphOf (vertex x)    empty         ==  False
algebraic-graphs> OK: isSubgraphOf x             (overlay x y) ==  True
algebraic-graphs> OK: isSubgraphOf (overlay x y) (connect x y) ==  True
algebraic-graphs> OK: isSubgraphOf (path xs)     (circuit xs)  ==  True
algebraic-graphs> OK: isSubgraphOf x y                         ==> x <= y
algebraic-graphs> OK: isSubgraphOf (edge x y) (edge y x)       ==  True
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.path ============
algebraic-graphs> OK: path []    == empty
algebraic-graphs> OK: path [x]   == vertex x
algebraic-graphs> OK: path [x,y] == edge x y
algebraic-graphs> OK: path       == path . reverse
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.circuit ============
algebraic-graphs> OK: circuit []    == empty
algebraic-graphs> OK: circuit [x]   == edge x x
algebraic-graphs> OK: circuit [x,y] == edges [(x,y), (y,x)]
algebraic-graphs> OK: circuit       == circuit . reverse
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.clique ============
algebraic-graphs> OK: clique []         == empty
algebraic-graphs> OK: clique [x]        == vertex x
algebraic-graphs> OK: clique [x,y]      == edge x y
algebraic-graphs> OK: clique [x,y,z]    == edges [(x,y), (x,z), (y,z)]
algebraic-graphs> OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
algebraic-graphs> OK: clique            == clique . reverse
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.biclique ============
algebraic-graphs> OK: biclique []      []      == empty
algebraic-graphs> OK: biclique [x]     []      == vertex x
algebraic-graphs> OK: biclique []      [y]     == vertex y
algebraic-graphs> OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
algebraic-graphs> OK: biclique xs      ys      == connect (vertices xs) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.star ============
algebraic-graphs> OK: star x []    == vertex x
algebraic-graphs> OK: star x [y]   == edge x y
algebraic-graphs> OK: star x [y,z] == edges [(x,y), (x,z)]
algebraic-graphs> OK: star x ys    == connect (vertex x) (vertices ys)
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.stars ============
algebraic-graphs> OK: stars []                      == empty
algebraic-graphs> OK: stars [(x, [])]               == vertex x
algebraic-graphs> OK: stars [(x, [y])]              == edge x y
algebraic-graphs> OK: stars [(x, ys)]               == star x ys
algebraic-graphs> OK: stars                         == overlays . map (uncurry star)
algebraic-graphs> OK: stars . adjacencyList         == id
algebraic-graphs> OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.tree ============
algebraic-graphs> OK: tree (Node x [])                                         == vertex x
algebraic-graphs> OK: tree (Node x [Node y [Node z []]])                       == path [x,y,z]
algebraic-graphs> OK: tree (Node x [Node y [], Node z []])                     == star x [y,z]
algebraic-graphs> OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.forest ============
algebraic-graphs> OK: forest []                                                  == empty
algebraic-graphs> OK: forest [x]                                                 == tree x
algebraic-graphs> OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
algebraic-graphs> OK: forest                                                     == overlays . map tree
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.removeVertex ============
algebraic-graphs> OK: removeVertex x (vertex x)       == empty
algebraic-graphs> OK: removeVertex 1 (vertex 2)       == vertex 2
algebraic-graphs> OK: removeVertex x (edge x x)       == empty
algebraic-graphs> OK: removeVertex 1 (edge 1 2)       == vertex 2
algebraic-graphs> OK: removeVertex x . removeVertex x == removeVertex x
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.removeEdge ============
algebraic-graphs> OK: removeEdge x y (edge x y)       == vertices [x,y]
algebraic-graphs> OK: removeEdge x y . removeEdge x y == removeEdge x y
algebraic-graphs> OK: removeEdge x y . removeVertex x == removeVertex x
algebraic-graphs> OK: removeEdge 1 1 (1 * 1 * 2 * 2)  == 1 * 2 * 2
algebraic-graphs> OK: removeEdge 1 2 (1 * 1 * 2 * 2)  == 1 * 1 + 2 * 2
algebraic-graphs> OK: removeEdge x y                  == removeEdge y x
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.replaceVertex ============
algebraic-graphs> OK: replaceVertex x x            == id
algebraic-graphs> OK: replaceVertex x y (vertex x) == vertex y
algebraic-graphs> OK: replaceVertex x y            == mergeVertices (== x) y
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.mergeVertices ============
algebraic-graphs> OK: mergeVertices (const False) x    == id
algebraic-graphs> OK: mergeVertices (== x) y           == replaceVertex x y
algebraic-graphs> OK: mergeVertices even 1 (0 * 2)     == 1 * 1
algebraic-graphs> OK: mergeVertices odd  1 (3 + 4 * 5) == 4 * 1
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.gmap ============
algebraic-graphs> OK: gmap f empty      == empty
algebraic-graphs> OK: gmap f (vertex x) == vertex (f x)
algebraic-graphs> OK: gmap f (edge x y) == edge (f x) (f y)
algebraic-graphs> OK: gmap id           == id
algebraic-graphs> OK: gmap f . gmap g   == gmap (f . g)
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.induce ============
algebraic-graphs> OK: induce (const True ) x      == x
algebraic-graphs> OK: induce (const False) x      == empty
algebraic-graphs> OK: induce (/= x)               == removeVertex x
algebraic-graphs> OK: induce p . induce q         == induce (\x -> p x && q x)
algebraic-graphs> OK: isSubgraphOf (induce p x) x == True
algebraic-graphs> 
algebraic-graphs> ============ Graph.Undirected.induceJust ============
algebraic-graphs> OK: induceJust (vertex Nothing)                               == empty
algebraic-graphs> OK: induceJust (edge (Just x) Nothing)                        == vertex x
algebraic-graphs> OK: induceJust . gmap Just                                    == id
algebraic-graphs> OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
algebraic-graphs> Test suite main: PASS
algebraic-graphs> Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
algebraic-graphs> 1 of 1 test suites (1 of 1 test cases) passed.
algebraic-graphs> checkPhase completed in 1 minutes 32 seconds
algebraic-graphs> Running phase: haddockPhase
algebraic-graphs> Preprocessing library for algebraic-graphs-0.7..
algebraic-graphs> Running Haddock on library for algebraic-graphs-0.7..
algebraic-graphs> Warning: --source-* options are ignored when --hyperlinked-source is enabled.
algebraic-graphs> [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing )
algebraic-graphs> [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing )
algebraic-graphs> [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing )
algebraic-graphs> [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing )
algebraic-graphs> [ 5 of 29] Compiling Algebra.Graph    ( src/Algebra/Graph.hs, nothing )
algebraic-graphs> [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing )
algebraic-graphs> [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing )
algebraic-graphs> [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing )
algebraic-graphs> [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing )
algebraic-graphs> [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing )
algebraic-graphs> [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing )
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘head’
algebraic-graphs>     (imported from Prelude, but defined in GHC.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
algebraic-graphs>     |
algebraic-graphs> 384 |     exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
algebraic-graphs>     |                                           ^^^^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘tail’
algebraic-graphs>     (imported from Prelude, but defined in GHC.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
algebraic-graphs>     |
algebraic-graphs> 391 |              pth' = tail v_pth' -- Here we know that v_pth' starts with v
algebraic-graphs>     |                     ^^^^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘head’
algebraic-graphs>     (imported from Prelude, but defined in GHC.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
algebraic-graphs>     |
algebraic-graphs> 395 |              p_v = fst $ head bnd
algebraic-graphs>     |                          ^^^^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
algebraic-graphs>     In the use of ‘tail’
algebraic-graphs>     (imported from Prelude, but defined in GHC.List):
algebraic-graphs>     "This is a partial function, it throws an error on empty lists. Replace it with drop 1, or use pattern matching or Data.List.uncons instead. Consider refactoring to use Data.List.NonEmpty."
algebraic-graphs>     |
algebraic-graphs> 397 |              bnd' = tail bnd
algebraic-graphs>     |                     ^^^^
algebraic-graphs> [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing )
algebraic-graphs> [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing )
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 171 |     vertexIntSet :: ToVertex t ~ Int => t -> IntSet
algebraic-graphs>     |                                ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 197 |     preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
algebraic-graphs>     |                             ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 215 |     postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
algebraic-graphs>     |                              ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 303 |     toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
algebraic-graphs>     |                                     ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 312 |     toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
algebraic-graphs>     |                                              ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
algebraic-graphs>     |                                           ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
algebraic-graphs>     |                                                    ^
algebraic-graphs> [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing )
algebraic-graphs> [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing )
algebraic-graphs> [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing )
algebraic-graphs> [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing )
algebraic-graphs> [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing )
algebraic-graphs> [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing )
algebraic-graphs> [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing )
algebraic-graphs> [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing )
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
algebraic-graphs>     |                                         ^
algebraic-graphs> [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing )
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
algebraic-graphs>     |                                                               ^
algebraic-graphs> 
algebraic-graphs> src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
algebraic-graphs>     The use of ‘~’ without TypeOperators
algebraic-graphs>     will become an error in a future GHC release.
algebraic-graphs>     Suggested fix: Perhaps you intended to use TypeOperators
algebraic-graphs>     |
algebraic-graphs> 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
algebraic-graphs>     |                                                                              ^
algebraic-graphs> [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing )
algebraic-graphs> [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing )
algebraic-graphs> [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing )
algebraic-graphs> [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing )
algebraic-graphs> [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing )
algebraic-graphs> [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing )
algebraic-graphs> [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing )
algebraic-graphs> Haddock coverage:
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs> Warning: 'map' is ambiguous. It is defined
algebraic-graphs>     * in ‘GHC.Base’
algebraic-graphs>     * in ‘Data.Map.Strict.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'foldr' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.Foldable’
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs>  100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
algebraic-graphs> Warning: 'vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:239:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
algebraic-graphs> Warning: 'overlay' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:270:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:270:1
algebraic-graphs> Warning: 'connect' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:292:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:292:1
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs>     * in ‘Data.IntMap.Internal’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs> Warning: 'edge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:252:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:252:1
algebraic-graphs> Warning: 'isSubgraphOf' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:366:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:366:1
algebraic-graphs> Warning: 'stars' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:623:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:611:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:611:1
algebraic-graphs> Warning: 'isEmpty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:389:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:379:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:379:1
algebraic-graphs> Warning: 'hasVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:400:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:390:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:390:1
algebraic-graphs> Warning: 'vertexCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:427:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:417:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
algebraic-graphs> Warning: 'edgeCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:439:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:429:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
algebraic-graphs> Warning: 'hasEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:413:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:403:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:403:1
algebraic-graphs> Warning: 'overlays' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:346:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:336:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:336:1
algebraic-graphs> Warning: 'map' is ambiguous. It is defined
algebraic-graphs>     * in ‘GHC.Base’
algebraic-graphs>     * in ‘Data.IntMap.Strict.Internal’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Map.Strict.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'edgeList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:464:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:454:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:454:1
algebraic-graphs> Warning: 'foldr' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.Foldable’
algebraic-graphs>     * in ‘Data.IntMap.Internal’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'path' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:541:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:529:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:529:1
algebraic-graphs> Warning: 'circuit' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:555:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:543:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:543:1
algebraic-graphs> Warning: 'removeVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:678:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:666:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:666:1
algebraic-graphs> Warning: 'removeEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:691:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:679:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:679:1
algebraic-graphs> Warning: 'vertexList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:450:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:440:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:440:1
algebraic-graphs> Warning: 'vertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:319:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:309:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
algebraic-graphs> Warning: 'star' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:592:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:592:1
algebraic-graphs> Warning: 'edges' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:333:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:323:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:323:1
algebraic-graphs> Warning: 'transpose' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:729:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:717:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:717:1
algebraic-graphs> Warning: 'clique' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:570:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:558:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:558:1
algebraic-graphs> Warning: 'adjacencyList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:502:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:491:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:491:1
algebraic-graphs> Warning: 'tree' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:651:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:639:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:639:1
algebraic-graphs> Warning: 'replaceVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:703:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:691:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:691:1
algebraic-graphs> Warning: 'mergeVertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:716:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:704:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:704:1
algebraic-graphs> Warning: 'reflexiveClosure' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:834:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:873:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:873:1
algebraic-graphs> Warning: 'transitiveClosure' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:861:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:900:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:900:1
algebraic-graphs>  100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
algebraic-graphs>     * in ‘Data.IntMap.Internal’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
algebraic-graphs> Warning: 'map' is ambiguous. It is defined
algebraic-graphs>     * in ‘GHC.Base’
algebraic-graphs>     * in ‘Data.IntMap.Strict.Internal’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.IntSet.Internal’
algebraic-graphs> Warning: 'null' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.Foldable’
algebraic-graphs>     * in ‘Data.IntMap.Internal’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.IntSet.Internal’
algebraic-graphs>   93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
algebraic-graphs>   Missing documentation for:
algebraic-graphs>     Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
algebraic-graphs> Warning: 'List' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Internal.hs:50:18
algebraic-graphs>     * at src/Algebra/Graph/Internal.hs:50:1
algebraic-graphs>     * in ‘GHC.Types’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
algebraic-graphs> Warning: 'toList' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.Foldable’
algebraic-graphs>     * in ‘GHC.IsList’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs>  100% ( 19 / 19) in 'Algebra.Graph.Internal'
algebraic-graphs> Warning: 'Graph' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:183:1
algebraic-graphs>     * in ‘Data.Graph’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph.hs:183:1
algebraic-graphs> Warning: 'Context' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1400:18
algebraic-graphs>     * at src/Algebra/Graph.hs:1400:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:316:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs>     * in ‘GHC.Base’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs> Warning: 'vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:330:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:239:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
algebraic-graphs> Warning: 'overlay' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:362:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:270:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:270:1
algebraic-graphs> Warning: 'connect' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:386:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:292:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:292:1
algebraic-graphs> Warning: 'vertexCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:677:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:427:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:417:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
algebraic-graphs> Warning: 'edgeCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:699:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:439:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:429:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
algebraic-graphs> Warning: 'size' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:602:1
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph.hs:602:1
algebraic-graphs> Warning: 'edge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:343:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:252:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:252:1
algebraic-graphs> Warning: 'isSubgraphOf' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:542:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:366:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:366:1
algebraic-graphs> Warning: 'isEmpty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:584:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:389:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:379:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:379:1
algebraic-graphs> Warning: 'hasVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:616:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:400:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:390:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:390:1
algebraic-graphs> Warning: 'Vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:184:16
algebraic-graphs>     * in ‘Data.Graph’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph.hs:184:16
algebraic-graphs> Warning: 'hasEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:653:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:413:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:403:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:403:1
algebraic-graphs> Warning: 'overlays' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:440:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:346:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:336:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:336:1
algebraic-graphs> Warning: 'vertexSet' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:763:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:466:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:466:1
algebraic-graphs> Warning: 'map' is ambiguous. It is defined
algebraic-graphs>     * in ‘GHC.Base’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'foldr' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.Foldable’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'transpose' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1145:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:729:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:717:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:717:1
algebraic-graphs> Warning: 'vertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:407:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:319:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:309:1
algebraic-graphs>     * in ‘Data.Graph’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
algebraic-graphs> Warning: 'path' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:837:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:541:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:529:1
algebraic-graphs>     * in ‘Data.Graph’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:529:1
algebraic-graphs> Warning: 'circuit' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:858:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:555:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:543:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:543:1
algebraic-graphs> Warning: 'removeVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1052:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:678:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:666:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:666:1
algebraic-graphs> Warning: 'removeEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1067:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:691:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:679:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:679:1
algebraic-graphs> Warning: 'edgeList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:743:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:464:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:454:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:454:1
algebraic-graphs> Warning: 'vertexList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:719:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:450:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:440:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:440:1
algebraic-graphs> Warning: 'star' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:915:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:592:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:592:1
algebraic-graphs> Warning: 'edges' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:423:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:333:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:323:1
algebraic-graphs>     * in ‘Data.Graph’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:323:1
algebraic-graphs> Warning: 'stars' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:937:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:623:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:611:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:611:1
algebraic-graphs> Warning: 'adjacencyList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:805:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:502:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:491:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:491:1
algebraic-graphs> Warning: 'tree' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:951:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:651:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:639:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:639:1
algebraic-graphs> Warning: 'box' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1287:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:835:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:835:1
algebraic-graphs> Warning: 'replaceVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1091:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:703:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:691:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:691:1
algebraic-graphs> Warning: 'mergeVertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1108:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:716:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:704:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:704:1
algebraic-graphs> Warning: 'induce' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1163:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:775:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:763:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:763:1
algebraic-graphs> Warning: 'filter' is ambiguous. It is defined
algebraic-graphs>     * in ‘GHC.List’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs>  100% ( 61 / 61) in 'Algebra.Graph'
algebraic-graphs> Warning: 'Graph' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:183:1
algebraic-graphs>     * at src/Algebra/Graph/HigherKinded/Class.hs:120:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:120:1
algebraic-graphs> Warning: 'vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:330:1
algebraic-graphs>     * at src/Algebra/Graph/HigherKinded/Class.hs:129:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:129:1
algebraic-graphs> Warning: 'connect' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:386:1
algebraic-graphs>     * at src/Algebra/Graph/HigherKinded/Class.hs:122:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:122:5
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:316:1
algebraic-graphs>     * in ‘GHC.Base’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph.hs:316:1
algebraic-graphs> Warning: 'overlay' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:362:1
algebraic-graphs>     * at src/Algebra/Graph/HigherKinded/Class.hs:133:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:133:1
algebraic-graphs> Warning: 'mplus' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'overlays' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:440:1
algebraic-graphs>     * at src/Algebra/Graph/HigherKinded/Class.hs:228:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:228:1
algebraic-graphs> Warning: 'edge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:343:1
algebraic-graphs>     * at src/Algebra/Graph/HigherKinded/Class.hs:186:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:186:1
algebraic-graphs> Warning: 'isSubgraphOf' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:542:1
algebraic-graphs>     * at src/Algebra/Graph/HigherKinded/Class.hs:265:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:265:1
algebraic-graphs> Warning: 'path' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:837:1
algebraic-graphs>     * at src/Algebra/Graph/HigherKinded/Class.hs:289:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:289:1
algebraic-graphs> Warning: 'circuit' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:858:1
algebraic-graphs>     * at src/Algebra/Graph/HigherKinded/Class.hs:303:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:303:1
algebraic-graphs> Warning: 'edges' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:423:1
algebraic-graphs>     * at src/Algebra/Graph/HigherKinded/Class.hs:214:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:214:1
algebraic-graphs> Warning: 'vertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:407:1
algebraic-graphs>     * at src/Algebra/Graph/HigherKinded/Class.hs:201:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:201:1
algebraic-graphs> Warning: 'star' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:915:1
algebraic-graphs>     * at src/Algebra/Graph/HigherKinded/Class.hs:347:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:347:1
algebraic-graphs> Warning: 'tree' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:951:1
algebraic-graphs>     * at src/Algebra/Graph/HigherKinded/Class.hs:378:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:378:1
algebraic-graphs> Warning: 'mesh' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:981:1
algebraic-graphs>     * at src/Algebra/Graph/HigherKinded/Class.hs:408:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:408:1
algebraic-graphs> Warning: 'torus' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1007:1
algebraic-graphs>     * at src/Algebra/Graph/HigherKinded/Class.hs:433:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:433:1
algebraic-graphs> Warning: 'removeVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1052:1
algebraic-graphs>     * at src/Algebra/Graph/HigherKinded/Class.hs:490:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:490:1
algebraic-graphs> Warning: 'replaceVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1091:1
algebraic-graphs>     * at src/Algebra/Graph/HigherKinded/Class.hs:502:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:502:1
algebraic-graphs> Warning: 'mergeVertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1108:1
algebraic-graphs>     * at src/Algebra/Graph/HigherKinded/Class.hs:515:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/HigherKinded/Class.hs:515:1
algebraic-graphs>  100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
algebraic-graphs> Warning: 'AdjacencyMap' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:157:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:159:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:159:1
algebraic-graphs> Warning: 'swap' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
algebraic-graphs>     * in ‘Data.Tuple’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
algebraic-graphs> Warning: 'vertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:407:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:309:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:362:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:362:1
algebraic-graphs> Warning: 'edge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:343:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:252:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:296:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:296:1
algebraic-graphs> Warning: 'overlay' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:362:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:270:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:312:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:312:1
algebraic-graphs> Warning: 'connect' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:386:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:292:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:337:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:337:1
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:316:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
algebraic-graphs> Warning: 'isEmpty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:584:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:379:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:499:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:499:1
algebraic-graphs> Warning: 'hasVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:616:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:390:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:531:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:531:1
algebraic-graphs> Warning: 'hasEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:653:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:403:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:544:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:544:1
algebraic-graphs> Warning: 'vertexCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:677:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:417:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:582:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:582:1
algebraic-graphs> Warning: 'edgeCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:699:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:429:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:594:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:594:1
algebraic-graphs> Warning: 'biclique' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:895:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:575:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:807:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:807:1
algebraic-graphs> Warning: 'overlays' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:440:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:336:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:390:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:390:1
algebraic-graphs> Warning: 'map' is ambiguous. It is defined
algebraic-graphs>     * in ‘GHC.Base’
algebraic-graphs>     * in ‘Data.Map.Strict.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'nub' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'foldr' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.Foldable’
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'edges' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:423:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:323:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:376:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:376:1
algebraic-graphs> Warning: 'vertexList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:719:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:440:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:630:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:630:1
algebraic-graphs> Warning: 'vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:330:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:239:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:283:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:283:1
algebraic-graphs> Warning: 'edgeList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:743:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:454:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:642:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:642:1
algebraic-graphs> Warning: 'star' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:915:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:592:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:822:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:822:1
algebraic-graphs> Warning: 'box' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1287:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:835:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:934:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:934:1
algebraic-graphs> Warning: 'path' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:837:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:529:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:770:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:770:1
algebraic-graphs> Warning: 'circuit' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:858:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:543:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:792:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:792:1
algebraic-graphs>  100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
algebraic-graphs> Warning: 'AdjacencyMap' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:157:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:159:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:159:1
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Sequence.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
algebraic-graphs> Warning: 'edge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:252:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:296:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:296:1
algebraic-graphs> Warning: 'edges' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:323:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:376:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:376:1
algebraic-graphs> Warning: 'circuit' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:543:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:792:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:792:1
algebraic-graphs> Warning: 'vertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:309:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:362:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:362:1
algebraic-graphs> Warning: 'map' is ambiguous. It is defined
algebraic-graphs>     * in ‘GHC.Base’
algebraic-graphs>     * in ‘Data.Map.Strict.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'biclique' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:575:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:807:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:807:1
algebraic-graphs> Warning: 'isRight' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'Matching' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
algebraic-graphs> Warning: 'null' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.Foldable’
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Sequence.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'length' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.Foldable’
algebraic-graphs>     * in ‘Data.Sequence.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Sequence.Internal’
algebraic-graphs> Warning: 'path' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:529:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:770:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:770:1
algebraic-graphs> Warning: 'star' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:592:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:822:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:822:1
algebraic-graphs> Warning: 'vertexCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:417:1
algebraic-graphs>     * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:582:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:582:1
algebraic-graphs>  100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
algebraic-graphs> Warning: 'Optimum' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:442:20
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:442:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
algebraic-graphs> Warning: 'Distance' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:241:22
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:241:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
algebraic-graphs> Warning: 'Minimum' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:314:21
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:314:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
algebraic-graphs> Warning: 'Capacity' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:176:22
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:176:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
algebraic-graphs> Warning: 'Count' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:209:19
algebraic-graphs>     * at src/Algebra/Graph/Label.hs:209:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
algebraic-graphs>  100% ( 37 / 37) in 'Algebra.Graph.Label'
algebraic-graphs> Warning: 'AdjacencyMap' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:157:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
algebraic-graphs> Warning: 'vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:239:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
algebraic-graphs> Warning: 'overlay' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:270:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:253:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:253:1
algebraic-graphs> Warning: 'connect' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:292:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:274:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:274:1
algebraic-graphs> Warning: 'edge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:252:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
algebraic-graphs> Warning: 'isSubgraphOf' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:366:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
algebraic-graphs> Warning: 'hasVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:390:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
algebraic-graphs> Warning: 'vertexCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:417:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:367:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:367:1
algebraic-graphs> Warning: 'edgeCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:429:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:378:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:378:1
algebraic-graphs> Warning: 'hasEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:403:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:356:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:356:1
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs> Warning: 'vertexSet' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:466:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:412:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:412:1
algebraic-graphs> Warning: 'removeEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:679:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:556:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:556:1
algebraic-graphs> Warning: 'edgeList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:454:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:401:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:401:1
algebraic-graphs> Warning: 'star' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:592:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:503:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:503:1
algebraic-graphs> Warning: 'transpose' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:717:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:593:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:593:1
algebraic-graphs> Warning: 'map' is ambiguous. It is defined
algebraic-graphs>     * in ‘GHC.Base’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'replaceVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:691:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:568:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:568:1
algebraic-graphs> Warning: 'mergeVertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:704:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:581:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:581:1
algebraic-graphs> Warning: 'gmap' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:749:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:620:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:620:1
algebraic-graphs> Warning: 'reflexiveClosure' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:873:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:675:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:675:1
algebraic-graphs> Warning: 'transitiveClosure' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:900:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:700:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:700:1
algebraic-graphs> Warning: 'postSet' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:517:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:445:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:445:1
algebraic-graphs>  100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
algebraic-graphs> Warning: 'edge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:252:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs> Warning: 'vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:239:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
algebraic-graphs> Warning: 'isSubgraphOf' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:366:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
algebraic-graphs> Warning: 'map' is ambiguous. It is defined
algebraic-graphs>     * in ‘GHC.Base’
algebraic-graphs>     * in ‘Data.Map.Strict.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'hasVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:390:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
algebraic-graphs> Warning: 'null' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.Foldable’
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'gmap' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:749:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:620:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:620:1
algebraic-graphs>   93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
algebraic-graphs>   Missing documentation for:
algebraic-graphs>     Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
algebraic-graphs> Warning: 'AdjacencyMap' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:96:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:157:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
algebraic-graphs> Warning: 'isSubgraphOf' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:198:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:366:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:335:1
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs> Warning: 'vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:239:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
algebraic-graphs> Warning: 'vertexCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:417:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:367:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:367:1
algebraic-graphs> Warning: 'edgeCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:429:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:378:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:378:1
algebraic-graphs> Warning: 'isEmpty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:210:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:379:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:379:1
algebraic-graphs> Warning: 'hasVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:221:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:390:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:344:1
algebraic-graphs> Warning: 'length' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.Foldable’
algebraic-graphs>     * in ‘Data.List.NonEmpty’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.List.NonEmpty’
algebraic-graphs> Warning: 'vertexSet' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:303:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:466:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:412:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:412:1
algebraic-graphs> Warning: 'edgeSet' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:314:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:478:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:423:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:423:1
algebraic-graphs> Warning: 'induce' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:390:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:763:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:763:1
algebraic-graphs> Warning: 'transitiveClosure' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:440:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:900:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:700:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:700:1
algebraic-graphs> Warning: 'removeVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:352:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:666:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:666:1
algebraic-graphs> Warning: 'removeEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:364:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:679:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:556:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:556:1
algebraic-graphs> Warning: 'edgeList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:281:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:454:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:401:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:401:1
algebraic-graphs> Warning: 'vertexList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:269:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:440:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:440:1
algebraic-graphs> Warning: 'vertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:309:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
algebraic-graphs> Warning: 'transpose' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:376:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:717:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:593:1
algebraic-graphs>     * in ‘Data.List.NonEmpty’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:593:1
algebraic-graphs> Warning: 'map' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.List.NonEmpty’
algebraic-graphs>     * in ‘GHC.Base’
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'scc' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:471:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap/Algorithm.hs:331:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap/Algorithm.hs:331:1
algebraic-graphs> Warning: 'union' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:170:1
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:170:1
algebraic-graphs> Warning: 'box' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:428:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:835:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:835:1
algebraic-graphs>  100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
algebraic-graphs> Warning: 'foldg' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:482:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:98:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
algebraic-graphs> Warning: 'vertexSet' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:763:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:466:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:412:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:162:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
algebraic-graphs> Warning: 'edgeSet' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:783:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:489:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:478:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:423:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:179:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:179:5
algebraic-graphs> Warning: 'preSet' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:503:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:434:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:187:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:187:5
algebraic-graphs> Warning: 'postSet' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:517:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:445:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:205:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:205:5
algebraic-graphs> Warning: 'adjacencyMap' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:167:5
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:443:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:443:1
algebraic-graphs>  100% (  8 /  8) in 'Algebra.Graph.ToGraph'
algebraic-graphs> Warning: 'Relation' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:157:19
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:157:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
algebraic-graphs> Warning: 'vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:330:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:239:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:254:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:254:1
algebraic-graphs> Warning: 'overlay' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:362:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:270:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:283:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:283:1
algebraic-graphs> Warning: 'connect' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:386:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:292:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:304:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:304:1
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:316:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:243:1
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
algebraic-graphs> Warning: 'edge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:343:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:252:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:266:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:266:1
algebraic-graphs> Warning: 'isSubgraphOf' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:542:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:366:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:373:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:373:1
algebraic-graphs> Warning: 'isEmpty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:584:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:389:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:379:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:387:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:106:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:106:5
algebraic-graphs> Warning: 'hasVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:616:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:400:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:390:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:398:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:114:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
algebraic-graphs> Warning: 'vertexCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:677:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:427:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:417:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:423:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:130:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:130:5
algebraic-graphs> Warning: 'edgeCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:699:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:439:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:429:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:435:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:138:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:138:5
algebraic-graphs> Warning: 'hasEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:653:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:413:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:403:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:411:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:122:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
algebraic-graphs> Warning: 'overlays' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:440:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:346:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:336:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:345:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:345:1
algebraic-graphs> Warning: 'vertexSet' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:763:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:466:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:471:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:162:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
algebraic-graphs> Warning: 'map' is ambiguous. It is defined
algebraic-graphs>     * in ‘GHC.Base’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'foldr' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.Foldable’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'path' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:837:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:541:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:529:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:540:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:540:1
algebraic-graphs> Warning: 'circuit' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:858:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:555:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:543:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:554:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:554:1
algebraic-graphs> Warning: 'removeVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1052:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:678:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:666:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:663:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:663:1
algebraic-graphs> Warning: 'removeEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1067:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:691:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:679:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:678:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:678:1
algebraic-graphs> Warning: 'edgeList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:743:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:464:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:454:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:460:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:154:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
algebraic-graphs> Warning: 'vertexList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:719:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:450:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:440:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:446:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:146:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:146:5
algebraic-graphs> Warning: 'vertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:407:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:319:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:309:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:320:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:320:1
algebraic-graphs> Warning: 'star' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:915:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:592:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:603:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:603:1
algebraic-graphs> Warning: 'edges' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:423:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:333:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:323:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:332:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:332:1
algebraic-graphs> Warning: 'transpose' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1145:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:729:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:717:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:716:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:716:1
algebraic-graphs> Warning: 'stars' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:937:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:623:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:611:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:621:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:621:1
algebraic-graphs> Warning: 'adjacencyList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:805:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:502:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:491:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:496:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:223:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:223:5
algebraic-graphs> Warning: 'tree' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:951:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:651:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:639:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:636:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:636:1
algebraic-graphs> Warning: 'replaceVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1091:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:703:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:691:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:690:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:690:1
algebraic-graphs> Warning: 'mergeVertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1108:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:716:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:704:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:703:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:703:1
algebraic-graphs> Warning: 'gmap' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:761:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:749:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:731:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:731:1
algebraic-graphs> Warning: 'induce' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1163:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:775:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:763:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:745:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:745:1
algebraic-graphs> Warning: 'reflexiveClosure' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:834:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:873:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:823:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:823:1
algebraic-graphs> Warning: 'clique' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:878:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:570:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:558:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:569:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:569:1
algebraic-graphs> Warning: 'transitiveClosure' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:861:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:900:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:850:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:850:1
algebraic-graphs> Warning: 'postSet' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:517:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:528:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:205:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:205:5
algebraic-graphs>  100% ( 56 / 56) in 'Algebra.Graph.Relation'
algebraic-graphs> Warning: 'Relation' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:157:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:104:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:104:1
algebraic-graphs> Warning: 'connect' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:386:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:292:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:304:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:252:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:252:1
algebraic-graphs> Warning: 'vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:330:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:239:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:254:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:199:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:199:1
algebraic-graphs> Warning: 'edge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:343:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:252:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:266:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:213:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:213:1
algebraic-graphs> Warning: 'isSubgraphOf' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:542:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:366:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:373:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:322:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:322:1
algebraic-graphs> Warning: 'overlay' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:362:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:270:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:283:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:230:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:230:1
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:316:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:243:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
algebraic-graphs> Warning: 'vertexCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:677:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:427:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:417:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:423:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:130:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:130:5
algebraic-graphs> Warning: 'edgeCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:699:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:439:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:429:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:435:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:138:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:138:5
algebraic-graphs> Warning: 'isEmpty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:584:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:389:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:379:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:387:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:335:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:106:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:106:5
algebraic-graphs> Warning: 'hasVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:616:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:400:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:390:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:398:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:346:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:114:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
algebraic-graphs> Warning: 'edges' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:423:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:333:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:323:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:332:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:279:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:279:1
algebraic-graphs> Warning: 'hasEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:653:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:413:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:403:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:411:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:360:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:122:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
algebraic-graphs> Warning: 'overlays' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:440:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:346:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:336:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:345:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:292:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:292:1
algebraic-graphs> Warning: 'vertexSet' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:763:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:466:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:471:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:422:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:162:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
algebraic-graphs> Warning: 'foldr' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.Foldable’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'path' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:837:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:541:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:529:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:540:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:463:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:463:1
algebraic-graphs> Warning: 'circuit' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:858:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:555:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:543:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:554:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:475:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:475:1
algebraic-graphs> Warning: 'removeVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1052:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:678:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:666:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:663:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:571:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:571:1
algebraic-graphs> Warning: 'removeEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1067:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:691:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:679:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:678:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:585:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:585:1
algebraic-graphs> Warning: 'edgeList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:743:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:464:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:454:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:460:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:411:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:154:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
algebraic-graphs> Warning: 'vertexList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:719:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:450:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:440:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:446:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:395:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:146:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:146:5
algebraic-graphs> Warning: 'vertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:407:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:319:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:309:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:320:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:267:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:267:1
algebraic-graphs> Warning: 'star' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:915:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:592:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:603:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:517:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:517:1
algebraic-graphs> Warning: 'stars' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:937:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:623:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:611:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:621:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:534:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:534:1
algebraic-graphs> Warning: 'adjacencyList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:805:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:502:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:491:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:496:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:451:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:223:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:223:5
algebraic-graphs> Warning: 'map' is ambiguous. It is defined
algebraic-graphs>     * in ‘GHC.Base’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'tree' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:951:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:651:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:639:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:636:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:546:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:546:1
algebraic-graphs> Warning: 'replaceVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1091:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:703:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:691:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:690:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:597:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:597:1
algebraic-graphs> Warning: 'mergeVertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1108:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:716:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:704:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:703:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:610:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:610:1
algebraic-graphs> Warning: 'gmap' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:761:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:749:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:731:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:625:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:625:1
algebraic-graphs> Warning: 'induce' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1163:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:775:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:763:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:745:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:639:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:639:1
algebraic-graphs>  100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
algebraic-graphs> Warning: 'Graph' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:183:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:164:1
algebraic-graphs>     * in ‘Data.Graph’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:164:1
algebraic-graphs> Warning: 'vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:330:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:239:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:257:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:257:1
algebraic-graphs> Warning: 'overlay' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:362:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:270:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:287:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:287:1
algebraic-graphs> Warning: 'connect' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:386:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:292:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:322:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:322:1
algebraic-graphs> Warning: 'vertexCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:677:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:427:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:417:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:490:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:130:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:130:5
algebraic-graphs> Warning: 'edgeCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:699:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:439:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:429:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:508:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:138:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:138:5
algebraic-graphs> Warning: 'size' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:602:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:447:1
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:447:1
algebraic-graphs> Warning: 'edge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:343:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:252:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:270:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:270:1
algebraic-graphs> Warning: 'isSubgraphOf' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:542:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:366:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:410:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:410:1
algebraic-graphs> Warning: 'Vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:184:16
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:164:16
algebraic-graphs>     * in ‘Data.Graph’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:164:16
algebraic-graphs> Warning: 'hasVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:616:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:400:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:390:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:456:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:114:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
algebraic-graphs> Warning: 'hasEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:653:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:413:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:403:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:470:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:122:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
algebraic-graphs> Warning: 'Overlay' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:185:16
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:165:16
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:165:16
algebraic-graphs> Warning: 'Connect' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:186:16
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:166:16
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:166:16
algebraic-graphs> Warning: 'length' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.Foldable’
algebraic-graphs>     * in ‘Data.List.NonEmpty’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.List.NonEmpty’
algebraic-graphs> Warning: 'vertexSet' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:763:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:466:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:561:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:162:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
algebraic-graphs> Warning: 'transpose' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1145:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:729:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:717:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:809:1
algebraic-graphs>     * in ‘Data.List.NonEmpty’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:809:1
algebraic-graphs> Warning: 'removeEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1067:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:691:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:679:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:747:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:747:1
algebraic-graphs> Warning: 'edgeList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:743:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:464:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:454:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:544:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:154:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
algebraic-graphs> Warning: 'vertexList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:719:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:450:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:440:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:146:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:146:5
algebraic-graphs> Warning: 'star' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:915:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:592:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:639:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:639:1
algebraic-graphs> Warning: 'map' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.List.NonEmpty’
algebraic-graphs>     * in ‘GHC.Base’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'box' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1287:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:835:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:909:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:909:1
algebraic-graphs> Warning: 'replaceVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1091:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:703:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:691:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:768:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:768:1
algebraic-graphs> Warning: 'mergeVertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1108:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:716:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:704:1
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:782:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:782:1
algebraic-graphs> Warning: '===' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:562:17
algebraic-graphs>     * at src/Algebra/Graph/NonEmpty.hs:428:17
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/NonEmpty.hs:428:17
algebraic-graphs> Warning: 'filter' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.List.NonEmpty’
algebraic-graphs>     * in ‘GHC.List’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs>  100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
algebraic-graphs> Warning: 'AdjacencyMap' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:157:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:66:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:66:1
algebraic-graphs> Warning: 'isEmpty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:379:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:355:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:106:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:106:5
algebraic-graphs> Warning: 'hasVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:390:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:366:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:114:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
algebraic-graphs> Warning: 'vertexCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:417:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:403:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:130:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:130:5
algebraic-graphs> Warning: 'edgeCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:429:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:415:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:138:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:138:5
algebraic-graphs> Warning: 'connect' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:292:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
algebraic-graphs> Warning: 'vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:239:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
algebraic-graphs> Warning: 'vertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:309:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
algebraic-graphs> Warning: 'hasEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:403:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:122:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
algebraic-graphs> Warning: 'edge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:252:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
algebraic-graphs> Warning: 'overlay' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:270:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
algebraic-graphs> Warning: 'transitiveClosure' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:900:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:706:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:706:1
algebraic-graphs> Warning: 'overlays' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:336:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
algebraic-graphs> Warning: 'vertexSet' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:466:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:450:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:162:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
algebraic-graphs> Warning: 'map' is ambiguous. It is defined
algebraic-graphs>     * in ‘GHC.Base’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Map.Strict.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'foldr' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.Foldable’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'isSubgraphOf' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:366:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
algebraic-graphs> Warning: 'removeVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:666:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:510:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:510:1
algebraic-graphs> Warning: 'removeEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:679:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:523:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:523:1
algebraic-graphs> Warning: 'null' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.Foldable’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'filter' is ambiguous. It is defined
algebraic-graphs>     * in ‘GHC.List’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'edgeList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:454:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:438:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:154:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
algebraic-graphs> Warning: 'vertexList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:440:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:426:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:146:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:146:5
algebraic-graphs> Warning: 'replaceVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:691:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:535:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:535:1
algebraic-graphs> Warning: 'gmap' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:749:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:584:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:584:1
algebraic-graphs> Warning: 'induce' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:763:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:633:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:633:1
algebraic-graphs> Warning: 'edges' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:323:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
algebraic-graphs> Warning: 'reflexiveClosure' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:873:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:679:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:679:1
algebraic-graphs> Warning: 'postSet' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:517:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:486:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:205:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:205:5
algebraic-graphs> Warning: 'transpose' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:717:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:564:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:564:1
algebraic-graphs>  100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
algebraic-graphs> Warning: 'Context' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:675:20
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:675:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
algebraic-graphs> Warning: 'size' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:357:1
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:357:1
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:191:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
algebraic-graphs> Warning: 'vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:203:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
algebraic-graphs> Warning: 'connect' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:288:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
algebraic-graphs> Warning: 'transpose' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:496:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:564:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:564:1
algebraic-graphs> Warning: 'isEmpty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:342:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:355:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:106:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:106:5
algebraic-graphs> Warning: 'hasVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:368:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:366:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:114:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:114:5
algebraic-graphs> Warning: 'vertexSet' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:424:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:450:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:162:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:162:5
algebraic-graphs> Warning: 'foldg' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:145:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:98:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
algebraic-graphs> Warning: 'foldr' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.Foldable’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'map' is ambiguous. It is defined
algebraic-graphs>     * in ‘GHC.Base’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'vertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:303:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
algebraic-graphs> Warning: 'isSubgraphOf' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:180:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
algebraic-graphs> Warning: 'overlay' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:270:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
algebraic-graphs> Warning: 'hasEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:381:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:122:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:122:5
algebraic-graphs> Warning: 'edgeLabel' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:385:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:391:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:391:1
algebraic-graphs> Warning: 'edge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:217:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
algebraic-graphs> Warning: 'transitiveClosure' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:619:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:706:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:706:1
algebraic-graphs> Warning: 'overlays' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:329:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
algebraic-graphs> Warning: 'removeVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:448:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:510:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:510:1
algebraic-graphs> Warning: 'removeEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:461:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:523:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:523:1
algebraic-graphs> Warning: 'null' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.Foldable’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'filter' is ambiguous. It is defined
algebraic-graphs>     * in ‘GHC.List’
algebraic-graphs>     * in ‘Data.IntSet.Internal’
algebraic-graphs>     * in ‘Data.Map.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'edgeList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:413:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:438:1
algebraic-graphs>     * at src/Algebra/Graph/ToGraph.hs:154:5
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:154:5
algebraic-graphs> Warning: 'replaceVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:473:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:535:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:535:1
algebraic-graphs> Warning: 'induce' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:545:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:633:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:633:1
algebraic-graphs> Warning: 'edges' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:315:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
algebraic-graphs> Warning: 'reflexiveClosure' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:592:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:679:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:679:1
algebraic-graphs> Warning: 'Focus' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:642:18
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:642:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
algebraic-graphs>  100% ( 49 / 49) in 'Algebra.Graph.Labelled'
algebraic-graphs>  100% (  6 /  6) in 'Algebra.Graph.Labelled.Example.Network'
algebraic-graphs>  100% (  5 /  5) in 'Algebra.Graph.Labelled.Example.Automaton'
algebraic-graphs> Warning: 'Doc' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Export.hs:57:17
algebraic-graphs>     * at src/Algebra/Graph/Export.hs:57:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
algebraic-graphs>  100% ( 14 / 14) in 'Algebra.Graph.Export'
algebraic-graphs> Warning: 'Style' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Export/Dot.hs:49:18
algebraic-graphs>     * at src/Algebra/Graph/Export/Dot.hs:49:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
algebraic-graphs> Warning: 'export' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Export.hs:186:1
algebraic-graphs>     * at src/Algebra/Graph/Export/Dot.hs:122:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:122:1
algebraic-graphs> Warning: 'Graph' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs>  100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
algebraic-graphs> Warning: 'connect' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:386:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:252:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:325:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:325:1
algebraic-graphs> Warning: 'Graph' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:183:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:178:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:178:1
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:316:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:253:1
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
algebraic-graphs> Warning: 'vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:330:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:199:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:266:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:266:1
algebraic-graphs> Warning: 'overlay' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:362:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:230:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:300:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:300:1
algebraic-graphs> Warning: 'vertexCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:677:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:505:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:505:1
algebraic-graphs> Warning: 'edgeCount' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:699:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:519:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:519:1
algebraic-graphs> Warning: 'size' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:602:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:462:1
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:462:1
algebraic-graphs> Warning: 'edge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:343:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:213:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:281:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:281:1
algebraic-graphs> Warning: 'isSubgraphOf' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:542:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:322:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:424:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:424:1
algebraic-graphs> Warning: 'isEmpty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:584:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:335:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:446:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:446:1
algebraic-graphs> Warning: 'hasVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:616:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:346:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:474:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:474:1
algebraic-graphs> Warning: 'edges' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:423:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:279:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:354:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:354:1
algebraic-graphs> Warning: 'hasEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:653:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:360:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:491:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:491:1
algebraic-graphs> Warning: 'overlays' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:440:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:292:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:369:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:369:1
algebraic-graphs> Warning: 'vertexSet' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:763:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:422:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:557:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:557:1
algebraic-graphs> Warning: 'foldr' is ambiguous. It is defined
algebraic-graphs>     * in ‘Data.Foldable’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'path' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:837:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:463:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:610:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:610:1
algebraic-graphs> Warning: 'circuit' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:858:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:475:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:624:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:624:1
algebraic-graphs> Warning: 'removeVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1052:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:571:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:729:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:729:1
algebraic-graphs> Warning: 'removeEdge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1067:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:585:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:746:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:746:1
algebraic-graphs> Warning: 'edgeList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:743:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:411:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:545:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:545:1
algebraic-graphs> Warning: 'vertexList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:719:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:395:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:531:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:531:1
algebraic-graphs> Warning: 'vertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:407:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:267:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:341:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:341:1
algebraic-graphs> Warning: 'star' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:915:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:517:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:669:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:669:1
algebraic-graphs> Warning: 'stars' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:937:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:534:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:687:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:687:1
algebraic-graphs> Warning: 'adjacencyList' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:805:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:451:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:583:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:583:1
algebraic-graphs> Warning: 'map' is ambiguous. It is defined
algebraic-graphs>     * in ‘GHC.Base’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs> Warning: 'tree' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:951:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:546:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:701:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:701:1
algebraic-graphs> Warning: 'replaceVertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1091:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:597:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:760:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:760:1
algebraic-graphs> Warning: 'mergeVertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1108:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:610:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:775:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:775:1
algebraic-graphs> Warning: 'induce' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:1163:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:639:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:791:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:791:1
algebraic-graphs>  100% ( 50 / 50) in 'Algebra.Graph.Undirected'
algebraic-graphs> Warning: 'Graph' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:183:1
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:109:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:66:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:178:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:178:1
algebraic-graphs> Warning: 'connect' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:386:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:302:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:292:1
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:119:5
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:288:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:268:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:304:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:252:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:325:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:325:1
algebraic-graphs> Warning: 'overlay' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:362:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:280:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:270:1
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:117:5
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:270:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:241:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:283:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:230:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:300:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:300:1
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:316:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:227:1
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:113:5
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:191:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:243:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:253:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
algebraic-graphs> Warning: 'vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:330:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:249:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:239:1
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:115:5
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:203:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:171:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:254:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:199:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:266:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:266:1
algebraic-graphs> Warning: 'overlays' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:440:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:346:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:336:1
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:325:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:329:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:312:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:345:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:292:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:369:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:369:1
algebraic-graphs> Warning: 'edge' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:343:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:262:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:252:1
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:289:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:217:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:185:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:266:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:213:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:281:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:281:1
algebraic-graphs> Warning: 'isSubgraphOf' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:542:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:376:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:366:1
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:361:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:180:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:340:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:373:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:322:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:424:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:424:1
algebraic-graphs> Warning: 'path' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:837:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:541:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:529:1
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:373:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:540:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:463:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:610:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:610:1
algebraic-graphs> Warning: 'circuit' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:858:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:555:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:543:1
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:387:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:554:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:475:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:624:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:624:1
algebraic-graphs> Warning: 'edges' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:423:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:333:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:323:1
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:312:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:315:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:299:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:332:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:279:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:354:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:354:1
algebraic-graphs> Warning: 'vertices' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:407:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:319:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:309:1
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:301:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled.hs:303:1
algebraic-graphs>     * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:288:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:320:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:267:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:341:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:341:1
algebraic-graphs> Warning: 'star' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:915:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:604:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:592:1
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:431:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:603:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:517:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:669:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:669:1
algebraic-graphs> Warning: 'tree' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph.hs:951:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:651:1
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyMap.hs:639:1
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:445:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:636:1
algebraic-graphs>     * at src/Algebra/Graph/Relation/Symmetric.hs:546:1
algebraic-graphs>     * at src/Algebra/Graph/Undirected.hs:701:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:701:1
algebraic-graphs>  100% ( 27 / 27) in 'Algebra.Graph.Class'
algebraic-graphs> Warning: 'TransitiveRelation' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Relation/Transitive.hs:39:32
algebraic-graphs>     * at src/Algebra/Graph/Relation/Transitive.hs:39:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:113:5
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:243:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
algebraic-graphs> Warning: 'path' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:373:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:540:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:540:1
algebraic-graphs> Warning: 'clique' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:402:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:569:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:569:1
algebraic-graphs>  100% (  5 /  5) in 'Algebra.Graph.Relation.Transitive'
algebraic-graphs> Warning: 'ReflexiveRelation' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
algebraic-graphs>     * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
algebraic-graphs> Warning: 'vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:115:5
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:254:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:254:1
algebraic-graphs>  100% (  5 /  5) in 'Algebra.Graph.Relation.Reflexive'
algebraic-graphs> Warning: 'PreorderRelation' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Relation/Preorder.hs:44:30
algebraic-graphs>     * at src/Algebra/Graph/Relation/Preorder.hs:44:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
algebraic-graphs> Warning: 'vertex' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:115:5
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:254:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:254:1
algebraic-graphs> Warning: 'empty' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:113:5
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:243:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
algebraic-graphs> Warning: 'path' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:373:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:540:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:540:1
algebraic-graphs> Warning: 'clique' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/Class.hs:402:1
algebraic-graphs>     * at src/Algebra/Graph/Relation.hs:569:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Algebra/Graph/Relation.hs:569:1
algebraic-graphs>  100% (  5 /  5) in 'Algebra.Graph.Relation.Preorder'
algebraic-graphs>    0% (  0 /  8) in 'Algebra.Graph.Example.Todo'
algebraic-graphs>   Missing documentation for:
algebraic-graphs>     Module header
algebraic-graphs>     Todo (src/Algebra/Graph/Example/Todo.hs:13)
algebraic-graphs>     todo (src/Algebra/Graph/Example/Todo.hs:42)
algebraic-graphs>     low (src/Algebra/Graph/Example/Todo.hs:23)
algebraic-graphs>     high (src/Algebra/Graph/Example/Todo.hs:27)
algebraic-graphs>     ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
algebraic-graphs>     >*< (src/Algebra/Graph/Example/Todo.hs:39)
algebraic-graphs>     priority (src/Algebra/Graph/Example/Todo.hs:31)
algebraic-graphs> Warning: 'GraphKL' is ambiguous. It is defined
algebraic-graphs>     * at src/Data/Graph/Typed.hs:40:18
algebraic-graphs>     * at src/Data/Graph/Typed.hs:40:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
algebraic-graphs> Warning: 'array' is out of scope.
algebraic-graphs>     If you qualify the identifier, haddock can try to link it anyway.
algebraic-graphs> Warning: 'fromAdjacencyMap' is ambiguous. It is defined
algebraic-graphs>     * at src/Algebra/Graph/AdjacencyIntMap.hs:222:1
algebraic-graphs>     * at src/Data/Graph/Typed.hs:60:1
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined at src/Data/Graph/Typed.hs:60:1
algebraic-graphs> Warning: 'map' is ambiguous. It is defined
algebraic-graphs>     * in ‘GHC.Base’
algebraic-graphs>     * in ‘Data.Map.Strict.Internal’
algebraic-graphs>     * in ‘Data.Set.Internal’
algebraic-graphs>     You may be able to disambiguate the identifier by qualifying it or
algebraic-graphs>     by specifying the type/value namespace explicitly.
algebraic-graphs>     Defaulting to the one defined in ‘Data.Set.Internal’
algebraic-graphs>   90% ( 10 / 11) in 'Data.Graph.Typed'
algebraic-graphs>   Missing documentation for:
algebraic-graphs>     scc (src/Data/Graph/Typed.hs:192)
algebraic-graphs> Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
algebraic-graphs>       - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
algebraic-graphs> Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
algebraic-graphs>       - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
algebraic-graphs> Warning: Algebra.Graph.Internal: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Internal.D:R:ItemList
algebraic-graphs> Warning: Algebra.Graph: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Rep_Graph
algebraic-graphs>       - Algebra.Graph.ToGraph.D:R:ToVertexGraph
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexGraph1
algebraic-graphs> Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
algebraic-graphs>       - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
algebraic-graphs>       - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
algebraic-graphs> Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
algebraic-graphs> Warning: Algebra.Graph.Label: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Label.D:R:ItemMinimum
algebraic-graphs>       - Algebra.Graph.Label.D:R:ItemLabel
algebraic-graphs> Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
algebraic-graphs>       - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
algebraic-graphs> Warning: Algebra.Graph.ToGraph: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
algebraic-graphs>       - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
algebraic-graphs>       - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
algebraic-graphs>       - Algebra.Graph.ToGraph.D:R:ToVertexGraph
algebraic-graphs>       - Algebra.Graph.Relation.D:R:ToVertexRelation
algebraic-graphs>       - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
algebraic-graphs>       - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
algebraic-graphs>       - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
algebraic-graphs>       - Algebra.Graph.Labelled.D:R:ToVertexGraph
algebraic-graphs> Warning: Algebra.Graph.Relation: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Relation.D:R:ToVertexRelation
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexRelation0
algebraic-graphs> Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexRelation
algebraic-graphs> Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
algebraic-graphs> Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
algebraic-graphs>       - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexAdjacencyMap
algebraic-graphs> Warning: Algebra.Graph.Labelled: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Labelled.D:R:ToVertexGraph
algebraic-graphs>       - Algebra.Graph.Labelled.Rep_Graph
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexGraph
algebraic-graphs> Warning: Algebra.Graph.Undirected: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Undirected.Rep_Graph
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexGraph0
algebraic-graphs> Warning: Algebra.Graph.Class: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexTuple3
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexTuple2
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexFUN
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexMaybe
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexUnit
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexRelation
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexRelation0
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexAdjacencyMap
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexGraph
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexGraph0
algebraic-graphs>       - Algebra.Graph.Class.D:R:VertexGraph1
algebraic-graphs>       - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
algebraic-graphs>       - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
algebraic-graphs>       - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
algebraic-graphs>       - Algebra.Graph.Example.Todo.D:R:VertexTodo
algebraic-graphs> Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
algebraic-graphs> Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
algebraic-graphs> Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
algebraic-graphs> Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
algebraic-graphs>       - Algebra.Graph.Example.Todo.D:R:VertexTodo
algebraic-graphs> Documentation created: dist/doc/html/algebraic-graphs/,
algebraic-graphs> dist/doc/html/algebraic-graphs/algebraic-graphs.txt
algebraic-graphs> Preprocessing test suite 'main' for algebraic-graphs-0.7..
algebraic-graphs> Running phase: installPhase
algebraic-graphs> Installing library in /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/algebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd
algebraic-graphs> Running phase: fixupPhase
algebraic-graphs> shrinking RPATHs of ELF executables and libraries in /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7
algebraic-graphs> shrinking /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/lib/ghc-9.8.1/lib/x86_64-linux-ghc-9.8.1/libHSalgebraic-graphs-0.7-Fx7xlunZtouKldnM41f8dd-ghc9.8.1.so
algebraic-graphs> checking for references to /build/ in /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7...
algebraic-graphs> patching script interpreter paths in /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7
algebraic-graphs> stripping (with command strip and flags -S -p) in  /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/lib
algebraic-graphs> shrinking RPATHs of ELF executables and libraries in /nix/store/id0zmyaaqz7k22fqngf4r7nlqizdqnxx-algebraic-graphs-0.7-doc
algebraic-graphs> checking for references to /build/ in /nix/store/id0zmyaaqz7k22fqngf4r7nlqizdqnxx-algebraic-graphs-0.7-doc...
algebraic-graphs> patching script interpreter paths in /nix/store/id0zmyaaqz7k22fqngf4r7nlqizdqnxx-algebraic-graphs-0.7-doc
algebraic-graphs (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7 /nix/store/id0zmyaaqz7k22fqngf4r7nlqizdqnxx-algebraic-graphs-0.7-doc
algebraic-graphs (post)> Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
algebraic-graphs (post)> 
algebraic-graphs (post)> Pushing /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7 (24.51 MiB)
algebraic-graphs (post)> Pushing /nix/store/id0zmyaaqz7k22fqngf4r7nlqizdqnxx-algebraic-graphs-0.7-doc (10.46 MiB)
algebraic-graphs (post)> 
algebraic-graphs (post)> All done.
algebraic-graphs (post)> added 2 signatures
algebraic-graphs (post)> added 1 signatures
algebraic-graphs (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7 /nix/store/id0zmyaaqz7k22fqngf4r7nlqizdqnxx-algebraic-graphs-0.7-doc
algebraic-graphs (post)> copying 2 paths...
algebraic-graphs (post)> copying path '/nix/store/id0zmyaaqz7k22fqngf4r7nlqizdqnxx-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
algebraic-graphs (post)> copying path '/nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
algebraic-graphs (post)> copying 1 paths...
algebraic-graphs (post)> copying path '/nix/store/zf0xsjlpw0xhpkk7wdrsqp2ag77ycx2a-algebraic-graphs-0.7.drv' to 'https://cache.nix-ci.com'...
algebraic-graphs (post)> added 0 signatures
algebraic-graphs (post)> added 0 signatures
algebraic-graphs (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7 /nix/store/id0zmyaaqz7k22fqngf4r7nlqizdqnxx-algebraic-graphs-0.7-doc
algebraic-graphs (post)> copying 2 paths...
algebraic-graphs (post)> copying path '/nix/store/id0zmyaaqz7k22fqngf4r7nlqizdqnxx-algebraic-graphs-0.7-doc' to 'ssh-ng://worker.nix-ci.com'...
algebraic-graphs (post)> copying path '/nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7' to 'ssh-ng://worker.nix-ci.com'...
algebraic-graphs (post)> copying 1 paths...
algebraic-graphs (post)> copying path '/nix/store/zf0xsjlpw0xhpkk7wdrsqp2ag77ycx2a-algebraic-graphs-0.7.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/1lydjvm5kqkgnn8qfywwbpl8wqc16mr6-ghc-9.8.1-with-packages.drv'...
ghc> /nix/store/lawl1zml11wy3srb3whqr27rkbd5lfsk-doctest-0.22.6/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/mnr6szf70187dfx62d6x5jcavlz70z1w-hedgehog-1.5/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/hxh4zlinsn8anjbj8lzaas4jv5ank69b-no-recursion-0.3.0.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/d5ri70r4ncf51dpy9n75f2cvisf07mq0-Cabal-3.12.1.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/ki67wl1d1hwixf7dc8nav7rrl1ji85vg-cabal-doctest-1.0.11/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/9wbynvackkyl229j9b7gqpll26c8gjb8-ansi-terminal-1.1.2/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/9wbynvackkyl229j9b7gqpll26c8gjb8-ansi-terminal-1.1.2/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/gd36qyhrj8p1k7dyx5yl1a3w7x72jmif-async-2.2.5/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/gd36qyhrj8p1k7dyx5yl1a3w7x72jmif-async-2.2.5/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/bjfaw2nyc4kxmqfjkfyhw4sp0js11yjc-barbies-2.1.1.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/bjfaw2nyc4kxmqfjkfyhw4sp0js11yjc-barbies-2.1.1.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/gy08isrfll06yd3q7y8ih05pz00plx2z-concurrent-output-1.10.21/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/gy08isrfll06yd3q7y8ih05pz00plx2z-concurrent-output-1.10.21/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/nshyh2llqc5fydy1a32ml5lpqnyr7z7h-lifted-async-0.10.2.7/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/nshyh2llqc5fydy1a32ml5lpqnyr7z7h-lifted-async-0.10.2.7/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/3spsgba5l1aa2zg8dn7qi4kw4ffk9gp9-mmorph-1.2.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/3spsgba5l1aa2zg8dn7qi4kw4ffk9gp9-mmorph-1.2.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/rv8k0dkrks1f05mb33qpjhcbvi9il2f1-monad-control-1.0.3.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/rv8k0dkrks1f05mb33qpjhcbvi9il2f1-monad-control-1.0.3.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/8hfj49l4q4gsp6jwxx10zafmzak0xw05-pretty-show-1.10/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/8hfj49l4q4gsp6jwxx10zafmzak0xw05-pretty-show-1.10/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/bzblizfbnqmz08kq2q5s9r71z5mn5c4r-primitive-0.9.1.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/bzblizfbnqmz08kq2q5s9r71z5mn5c4r-primitive-0.9.1.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/fd49rmwxx3wha0x3lvzjam0amfq3dviw-random-1.2.1.3/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/fd49rmwxx3wha0x3lvzjam0amfq3dviw-random-1.2.1.3/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/anngnqci3b293h2rr4rbikr5ap8jwm6r-resourcet-1.3.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/anngnqci3b293h2rr4rbikr5ap8jwm6r-resourcet-1.3.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/358g1pjwcbi9xsd3kxxnhi2q7q3jbrrj-safe-exceptions-0.1.7.4/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/358g1pjwcbi9xsd3kxxnhi2q7q3jbrrj-safe-exceptions-0.1.7.4/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/1409cg04vadnh2zwm2zixdsqia12rbr5-transformers-base-0.4.6/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/1409cg04vadnh2zwm2zixdsqia12rbr5-transformers-base-0.4.6/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/grygy90rwvpc8vf2mdn4i9fs8jiy1ya1-wl-pprint-annotated-0.1.0.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/grygy90rwvpc8vf2mdn4i9fs8jiy1ya1-wl-pprint-annotated-0.1.0.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/0vk32w4bpl6lwjna4lj2iqfm1s1js87s-Cabal-syntax-3.12.1.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/z3vdwn9rw36p4ks9dgafi3l3ksg39byc-ansi-terminal-types-1.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/z3vdwn9rw36p4ks9dgafi3l3ksg39byc-ansi-terminal-types-1.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/9saapzad9jxpcvag8b447k05pjir991v-hashable-1.4.7.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/9saapzad9jxpcvag8b447k05pjir991v-hashable-1.4.7.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/l6ippx0jyqb2cygzxkh7a34649jnx47a-distributive-0.6.2.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/l6ippx0jyqb2cygzxkh7a34649jnx47a-distributive-0.6.2.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/mijgh91mfn9pg257cl90kqxm50glgkbg-constraints-0.14.2/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/mijgh91mfn9pg257cl90kqxm50glgkbg-constraints-0.14.2/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/4wsbky707b4zg2n9ry8yswyvgd13dyrh-lifted-base-0.2.3.12/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/4wsbky707b4zg2n9ry8yswyvgd13dyrh-lifted-base-0.2.3.12/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/k65nixclvpfan7ycg778l80grjmqdrmp-transformers-compat-0.7.2/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/k65nixclvpfan7ycg778l80grjmqdrmp-transformers-compat-0.7.2/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/si0fbklc2x6qv458pf79v35mrj517r69-splitmix-0.1.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/si0fbklc2x6qv458pf79v35mrj517r69-splitmix-0.1.1/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/dgfiq4pnvyqaclyi71nz5b1liz88gc1r-unliftio-core-0.2.1.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/dgfiq4pnvyqaclyi71nz5b1liz88gc1r-unliftio-core-0.2.1.0/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/fcqmf9ncpk35y6kfq54wjgjm76vkxxh8-base-orphans-0.9.3/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/fcqmf9ncpk35y6kfq54wjgjm76vkxxh8-base-orphans-0.9.3/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/2g7p0mgagawhsmawrx6gmigx8r5lylmb-os-string-2.0.7/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/2g7p0mgagawhsmawrx6gmigx8r5lylmb-os-string-2.0.7/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/64vq09zv1v1wvqg7aixllflkib1xvcxi-tagged-0.8.8/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/64vq09zv1v1wvqg7aixllflkib1xvcxi-tagged-0.8.8/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/cxxdapxw2x92hdr8x73p5gl9w2xdpsd7-boring-0.2.2/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> /nix/store/cxxdapxw2x92hdr8x73p5gl9w2xdpsd7-boring-0.2.2/nix-support:
ghc> propagated-build-inputs: Keeping existing link to /nix/store/6d5gcjgc4wg3jqq7f4gd6asd3z9fs505-algebraic-graphs-0.7/nix-support/propagated-build-inputs
ghc> Warning: include-dirs: /nix/store/q204yf8simr7rhw8s2cmfhfviclka7f7-ghc-9.8.1-with-packages/lib/ghc-9.8.1/lib/../lib/x86_64-linux-ghc-9.8.1/directory-1.3.8.1-6a8e/include doesn't exist or isn't a directory
ghc (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/q204yf8simr7rhw8s2cmfhfviclka7f7-ghc-9.8.1-with-packages
ghc (post)> Pushing 1 paths (148 are already present) using zstd to cache sellout ⏳
ghc (post)> 
ghc (post)> Pushing /nix/store/q204yf8simr7rhw8s2cmfhfviclka7f7-ghc-9.8.1-with-packages (4.90 MiB)
ghc (post)> 
ghc (post)> All done.
ghc (post)> added 1 signatures
ghc (post)> added 1 signatures
ghc (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/q204yf8simr7rhw8s2cmfhfviclka7f7-ghc-9.8.1-with-packages
ghc (post)> copying 1 paths...
ghc (post)> copying path '/nix/store/q204yf8simr7rhw8s2cmfhfviclka7f7-ghc-9.8.1-with-packages' to 'https://cache.nix-ci.com'...
ghc (post)> copying 1 paths...
ghc (post)> copying path '/nix/store/1lydjvm5kqkgnn8qfywwbpl8wqc16mr6-ghc-9.8.1-with-packages.drv' to 'https://cache.nix-ci.com'...
ghc (post)> added 0 signatures
ghc (post)> added 0 signatures
ghc (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/q204yf8simr7rhw8s2cmfhfviclka7f7-ghc-9.8.1-with-packages
ghc (post)> copying 1 paths...
ghc (post)> copying path '/nix/store/q204yf8simr7rhw8s2cmfhfviclka7f7-ghc-9.8.1-with-packages' to 'ssh-ng://worker.nix-ci.com'...
ghc (post)> copying 1 paths...
ghc (post)> copying path '/nix/store/1lydjvm5kqkgnn8qfywwbpl8wqc16mr6-ghc-9.8.1-with-packages.drv' to 'ssh-ng://worker.nix-ci.com'...
building '/nix/store/rbw99i2mvf33z5rhxga3awd4q3cvpa4r-ghc-shell-for-packages-0.drv'...
ghc-shell-for-packages (post)> Uploading paths from nix-ci to cachix cache "sellout" /nix/store/1w08bdciipmbmyqzjh25yrnif14hnvyp-ghc-shell-for-packages-0
ghc-shell-for-packages (post)> Pushing 1 paths (792 are already present) using zstd to cache sellout ⏳
ghc-shell-for-packages (post)> 
ghc-shell-for-packages (post)> Pushing /nix/store/1w08bdciipmbmyqzjh25yrnif14hnvyp-ghc-shell-for-packages-0 (336.00 B)
ghc-shell-for-packages (post)> 
ghc-shell-for-packages (post)> All done.
ghc-shell-for-packages (post)> added 1 signatures
ghc-shell-for-packages (post)> added 258 signatures
ghc-shell-for-packages (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/1w08bdciipmbmyqzjh25yrnif14hnvyp-ghc-shell-for-packages-0
ghc-shell-for-packages (post)> copying 1 paths...
ghc-shell-for-packages (post)> copying path '/nix/store/1w08bdciipmbmyqzjh25yrnif14hnvyp-ghc-shell-for-packages-0' to 'https://cache.nix-ci.com'...
ghc-shell-for-packages (post)> copying 1 paths...
ghc-shell-for-packages (post)> copying path '/nix/store/rbw99i2mvf33z5rhxga3awd4q3cvpa4r-ghc-shell-for-packages-0.drv' to 'https://cache.nix-ci.com'...
ghc-shell-for-packages (post)> added 0 signatures
ghc-shell-for-packages (post)> added 0 signatures
ghc-shell-for-packages (post)> Uploading paths from nix-ci to the NixCI cache /nix/store/1w08bdciipmbmyqzjh25yrnif14hnvyp-ghc-shell-for-packages-0
ghc-shell-for-packages (post)> copying 1 paths...
ghc-shell-for-packages (post)> copying path '/nix/store/1w08bdciipmbmyqzjh25yrnif14hnvyp-ghc-shell-for-packages-0' to 'ssh-ng://worker.nix-ci.com'...
ghc-shell-for-packages (post)> copying 1 paths...
ghc-shell-for-packages (post)> copying path '/nix/store/rbw99i2mvf33z5rhxga3awd4q3cvpa4r-ghc-shell-for-packages-0.drv' to 'ssh-ng://worker.nix-ci.com'...