1. 0.55 s $ /nix/store/9ypz3flqsrl5xl495mm8h645gadjsxi1-coreutils-9.11/bin/timeout --kill-after=15s 7200s /nix/store/23zk8sgzamrbmj1fday15szf7f2279s8-nix-2.34.7/bin/nix --extra-experimental-features nix-command --extra-experimental-features flakes --log-format internal-json build --no-link --print-out-paths git+https://github.com/sellout/duoids?ref=do-helpers&rev=4415bc17d6e7dc493e0ba036c397559d9b43477f#packages.x86_64-linux.default --print-build-logs
  2. 0.99 s warning: ignoring untrusted flake configuration setting 'allow-import-from-derivation'.
  3. 0.99 s Pass '--accept-flake-config' to trust it
  4. 0.99 s warning: ignoring untrusted flake configuration setting 'extra-experimental-features'.
  5. 0.99 s Pass '--accept-flake-config' to trust it
  6. 0.99 s warning: ignoring untrusted flake configuration setting 'extra-substituters'.
  7. 0.99 s Pass '--accept-flake-config' to trust it
  8. 0.99 s warning: ignoring untrusted flake configuration setting 'extra-trusted-public-keys'.
  9. 0.99 s Pass '--accept-flake-config' to trust it
  10. 0.99 s warning: ignoring untrusted flake configuration setting 'sandbox'.
  11. 0.99 s Pass '--accept-flake-config' to trust it
  12. 0.99 s warning: ignoring untrusted flake configuration setting 'use-registries'.
  13. 0.99 s Pass '--accept-flake-config' to trust it
  14. 0.99 s error (ignored): SQLite database '/var/cache/nix-ci-worker/eval-cache-v6/332ac380fc21d537dd399ae00234081c7a9833ea642f2fa8bbeeaa4b8bf81126.sqlite' is busy
  15. 0.99 s
  16. 0.99 s Downloading cached source from https://cache.nix-ci.com
  17. 8.63 s Progress: 1 of 1 downloaded from cache
  18. 13.34 s
  19. 13.70 s Downloading cached glibc-locales-2.40 from https://cache.nix-ci.com
  20. 13.74 s Downloading cached distribution-nixpkgs-1.7.1.1-data from https://cache.nix-ci.com
  21. 13.74 s Downloading cached gnu-config-2024-01 from https://cache.nix-ci.com
  22. 13.74 s Downloading cached xgcc-14.3.0-libgcc from https://cache.nix-ci.com
  23. 13.74 s Downloading cached gcc-14.3.0-libgcc from https://cache.nix-ci.com
  24. 13.74 s Downloading cached libunistring from https://cache.nix-ci.com
  25. 13.74 s Downloading cached publicsuffix-list-0-unstable-2025-03 from https://cache.nix-ci.com
  26. 13.75 s Progress: 0 of 5 built, 1 of 49 downloaded from cache (6 downloading)
  27. 13.76 s Progress: 0 of 5 built, 2 of 49 downloaded from cache (5 downloading)
  28. 13.76 s Downloading cached update-autotools-gnu-config-scripts-hook from https://cache.nix-ci.com
  29. 13.81 s Progress: 0 of 5 built, 3 of 49 downloaded from cache (5 downloading)
  30. 13.81 s Progress: 0 of 5 built, 4 of 49 downloaded from cache (4 downloading)
  31. 13.81 s Progress: 0 of 5 built, 5 of 49 downloaded from cache (3 downloading)
  32. 13.84 s Progress: 0 of 5 built, 6 of 49 downloaded from cache (2 downloading)
  33. 13.84 s Downloading cached libidn2 from https://cache.nix-ci.com
  34. 13.88 s Progress: 0 of 5 built, 7 of 49 downloaded from cache (2 downloading)
  35. 13.89 s Progress: 0 of 5 built, 8 of 49 downloaded from cache (1 downloading)
  36. 13.89 s Downloading cached glibc-2.40 from https://cache.nix-ci.com
  37. 14.19 s Progress: 0 of 5 built, 9 of 49 downloaded from cache (1 downloading)
  38. 14.19 s Downloading cached attr from https://cache.nix-ci.com
  39. 14.19 s Downloading cached bash from https://cache.nix-ci.com
  40. 14.19 s Downloading cached brotli-1.1.0-lib from https://cache.nix-ci.com
  41. 14.19 s Downloading cached bzip2 from https://cache.nix-ci.com
  42. 14.19 s Downloading cached ed from https://cache.nix-ci.com
  43. 14.19 s Downloading cached gawk from https://cache.nix-ci.com
  44. 14.19 s Downloading cached gcc-14.3.0-lib from https://cache.nix-ci.com
  45. 14.19 s Downloading cached gnumake from https://cache.nix-ci.com
  46. 14.19 s Downloading cached gnused from https://cache.nix-ci.com
  47. 14.19 s Downloading cached json-c from https://cache.nix-ci.com
  48. 14.19 s Downloading cached keyutils-1.6.3-lib from https://cache.nix-ci.com
  49. 14.19 s Downloading cached libffi from https://cache.nix-ci.com
  50. 14.19 s Downloading cached libpsl from https://cache.nix-ci.com
  51. 14.19 s Downloading cached nghttp2-1.65.0-lib from https://cache.nix-ci.com
  52. 14.19 s Downloading cached openssl from https://cache.nix-ci.com
  53. 14.27 s Progress: 0 of 5 built, 10 of 49 downloaded from cache (15 downloading)
  54. 14.27 s Downloading cached pcre2 from https://cache.nix-ci.com
  55. 14.27 s Progress: 0 of 5 built, 11 of 49 downloaded from cache (15 downloading)
  56. 14.27 s Downloading cached bzip2-1.0.8-bin from https://cache.nix-ci.com
  57. 14.27 s Progress: 0 of 5 built, 12 of 49 downloaded from cache (15 downloading)
  58. 14.27 s Downloading cached acl from https://cache.nix-ci.com
  59. 14.28 s Progress: 0 of 5 built, 13 of 49 downloaded from cache (15 downloading)
  60. 14.28 s Downloading cached xz from https://cache.nix-ci.com
  61. 14.28 s Progress: 0 of 5 built, 14 of 49 downloaded from cache (15 downloading)
  62. 14.28 s Downloading cached zlib from https://cache.nix-ci.com
  63. 14.29 s Progress: 0 of 5 built, 15 of 49 downloaded from cache (15 downloading)
  64. 14.29 s Downloading cached patch from https://cache.nix-ci.com
  65. 14.29 s Progress: 0 of 5 built, 16 of 49 downloaded from cache (15 downloading)
  66. 14.30 s Progress: 0 of 5 built, 17 of 49 downloaded from cache (14 downloading)
  67. 14.30 s Progress: 0 of 5 built, 18 of 49 downloaded from cache (13 downloading)
  68. 14.30 s Progress: 0 of 5 built, 19 of 49 downloaded from cache (12 downloading)
  69. 14.30 s Progress: 0 of 5 built, 20 of 49 downloaded from cache (11 downloading)
  70. 14.32 s Progress: 0 of 5 built, 21 of 49 downloaded from cache (10 downloading)
  71. 14.34 s Progress: 0 of 5 built, 22 of 49 downloaded from cache (9 downloading)
  72. 14.35 s Progress: 0 of 5 built, 23 of 49 downloaded from cache (8 downloading)
  73. 14.35 s Downloading cached file from https://cache.nix-ci.com
  74. 14.35 s Progress: 0 of 5 built, 24 of 49 downloaded from cache (8 downloading)
  75. 14.35 s Progress: 0 of 5 built, 25 of 49 downloaded from cache (7 downloading)
  76. 14.35 s Downloading cached gnutar from https://cache.nix-ci.com
  77. 14.36 s Progress: 0 of 5 built, 26 of 49 downloaded from cache (7 downloading)
  78. 14.36 s Downloading cached gzip from https://cache.nix-ci.com
  79. 14.38 s Progress: 0 of 4 built, 27 of 49 downloaded from cache (7 downloading)
  80. 14.38 s Downloading cached xz-5.8.1-bin from https://cache.nix-ci.com
  81. 14.41 s Progress: 0 of 4 built, 28 of 49 downloaded from cache (7 downloading)
  82. 14.42 s Progress: 0 of 4 built, 29 of 49 downloaded from cache (6 downloading)
  83. 14.42 s Downloading cached gnugrep from https://cache.nix-ci.com
  84. 14.42 s Progress: 0 of 4 built, 30 of 49 downloaded from cache (6 downloading)
  85. 14.43 s Progress: 0 of 4 built, 31 of 49 downloaded from cache (5 downloading)
  86. 14.43 s Progress: 0 of 4 built, 32 of 49 downloaded from cache (4 downloading)
  87. 14.49 s Progress: 0 of 4 built, 33 of 49 downloaded from cache (3 downloading)
  88. 14.56 s Progress: 0 of 4 built, 34 of 49 downloaded from cache (2 downloading)
  89. 14.56 s Downloading cached gmp-with-cxx from https://cache.nix-ci.com
  90. 14.56 s Downloading cached gmp-with-cxx from https://cache.nix-ci.com
  91. 14.56 s Downloading cached patchelf from https://cache.nix-ci.com
  92. 14.56 s Downloading cached zstd from https://cache.nix-ci.com
  93. 14.58 s Progress: 0 of 4 built, 35 of 49 downloaded from cache (5 downloading)
  94. 14.58 s Downloading cached krb5-1.21.3-lib from https://cache.nix-ci.com
  95. 14.58 s Downloading cached libssh2 from https://cache.nix-ci.com
  96. 14.61 s Progress: 0 of 4 built, 36 of 49 downloaded from cache (6 downloading)
  97. 14.65 s Progress: 0 of 4 built, 37 of 49 downloaded from cache (5 downloading)
  98. 14.67 s Progress: 0 of 4 built, 38 of 49 downloaded from cache (4 downloading)
  99. 14.67 s Downloading cached coreutils from https://cache.nix-ci.com
  100. 14.67 s Progress: 0 of 4 built, 39 of 49 downloaded from cache (4 downloading)
  101. 14.69 s Progress: 0 of 4 built, 40 of 49 downloaded from cache (3 downloading)
  102. 14.75 s Progress: 0 of 4 built, 41 of 49 downloaded from cache (2 downloading)
  103. 14.76 s Progress: 0 of 3 built, 42 of 49 downloaded from cache (1 downloading)
  104. 14.76 s Downloading cached curl from https://cache.nix-ci.com
  105. 14.78 s Progress: 0 of 3 built, 43 of 49 downloaded from cache (1 downloading)
  106. 14.78 s Downloading cached diffutils from https://cache.nix-ci.com
  107. 14.78 s Downloading cached findutils from https://cache.nix-ci.com
  108. 14.88 s Progress: 0 of 3 built, 44 of 49 downloaded from cache (2 downloading)
  109. 14.88 s Progress: 0 of 3 built, 45 of 49 downloaded from cache (1 downloading)
  110. 14.88 s Downloading cached elfutils from https://cache.nix-ci.com
  111. 14.89 s Progress: 0 of 3 built, 46 of 49 downloaded from cache (1 downloading)
  112. 14.89 s Downloading cached stdenv-linux from https://cache.nix-ci.com
  113. 14.94 s Progress: 0 of 3 built, 47 of 49 downloaded from cache (1 downloading)
  114. 14.99 s Progress: 0 of 2 built, 48 of 49 downloaded from cache
  115. 14.99 s Downloading cached cabal2nix from https://cache.nix-ci.com
  116. 15.13 s Progress: 0 of 2 built, 49 of 49 downloaded from cache
  117. 15.17 s Building /nix/store/nxpm47kapyzwc5am8dviymx8p451snhs-cabal2nix-algebraic-graph-duoids.drv
  118. 15.24 s [cabal2nix-algebraic-graph-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/wx018ndlfw7znryzadb67xgxh44kwvj7-cabal2nix-algebraic-graph-duoids
  119. 16.08 s [cabal2nix-algebraic-graph-duoids:post-build] Nothing to push - all store paths are already on Cachix.
  120. 16.10 s [cabal2nix-algebraic-graph-duoids:post-build] Uploading to the NixCI cache: /nix/store/wx018ndlfw7znryzadb67xgxh44kwvj7-cabal2nix-algebraic-graph-duoids
  121. 16.15 s [cabal2nix-algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  122. 16.40 s [cabal2nix-algebraic-graph-duoids:post-build] copying 1 paths...
  123. 16.40 s [cabal2nix-algebraic-graph-duoids:post-build] copying path '/nix/store/wx018ndlfw7znryzadb67xgxh44kwvj7-cabal2nix-algebraic-graph-duoids' to 'https://cache.nix-ci.com'...
  124. 16.51 s [cabal2nix-algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  125. 27.81 s [cabal2nix-algebraic-graph-duoids:post-build] copying 0 paths...
  126. 27.83 s Progress: 1 of 2 built, 49 of 49 downloaded from cache
  127. 27.83 s Progress: 2 of 2 built, 49 of 49 downloaded from cache
  128. 27.86 s Progress: 49 of 49 downloaded from cache
  129. 27.86 s
  130. 27.86 s Building /nix/store/vncd7y87h83mgc2vpixiww33g2xhshqn-cabal2nix-duoidal-transformers.drv
  131. 27.92 s [cabal2nix-duoidal-transformers:post-build] Uploading to cachix cache "sellout": /nix/store/iv86ml3ljmskcrxzqh74bh2i67z17zl1-cabal2nix-duoidal-transformers
  132. 28.34 s [cabal2nix-duoidal-transformers:post-build] Nothing to push - all store paths are already on Cachix.
  133. 28.35 s [cabal2nix-duoidal-transformers:post-build] Uploading to the NixCI cache: /nix/store/iv86ml3ljmskcrxzqh74bh2i67z17zl1-cabal2nix-duoidal-transformers
  134. 28.39 s [cabal2nix-duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  135. 28.61 s [cabal2nix-duoidal-transformers:post-build] copying 1 paths...
  136. 28.61 s [cabal2nix-duoidal-transformers:post-build] copying path '/nix/store/iv86ml3ljmskcrxzqh74bh2i67z17zl1-cabal2nix-duoidal-transformers' to 'https://cache.nix-ci.com'...
  137. 28.73 s [cabal2nix-duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  138. 28.89 s [cabal2nix-duoidal-transformers:post-build] copying 0 paths...
  139. 28.91 s Progress: 1 of 2 built
  140. 28.91 s Progress: 2 of 2 built
  141. 28.91 s
  142. 28.93 s Building /nix/store/1mxp9ardb7si0ifbhrghc4z62f9lq1cx-cabal2nix-duoids.drv
  143. 29.00 s [cabal2nix-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/4f5vmjfqa8j7186my9xgdvbyg494d0yb-cabal2nix-duoids
  144. 29.42 s [cabal2nix-duoids:post-build] Nothing to push - all store paths are already on Cachix.
  145. 29.43 s [cabal2nix-duoids:post-build] Uploading to the NixCI cache: /nix/store/4f5vmjfqa8j7186my9xgdvbyg494d0yb-cabal2nix-duoids
  146. 29.48 s [cabal2nix-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  147. 29.68 s [cabal2nix-duoids:post-build] copying 1 paths...
  148. 29.68 s [cabal2nix-duoids:post-build] copying path '/nix/store/4f5vmjfqa8j7186my9xgdvbyg494d0yb-cabal2nix-duoids' to 'https://cache.nix-ci.com'...
  149. 29.80 s [cabal2nix-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  150. 29.93 s [cabal2nix-duoids:post-build] copying 0 paths...
  151. 29.95 s Progress: 1 of 2 built
  152. 29.95 s Progress: 2 of 2 built
  153. 29.95 s
  154. 29.98 s Building /nix/store/4rrljd81x1h19c879iaq060r52s0g1a0-cabal2nix-duoids-hedgehog.drv
  155. 30.05 s [cabal2nix-duoids-hedgehog:post-build] Uploading to cachix cache "sellout": /nix/store/xx73806hp1dxrdh4kp8jalsriybk4ywv-cabal2nix-duoids-hedgehog
  156. 30.46 s [cabal2nix-duoids-hedgehog:post-build] Nothing to push - all store paths are already on Cachix.
  157. 30.47 s [cabal2nix-duoids-hedgehog:post-build] Uploading to the NixCI cache: /nix/store/xx73806hp1dxrdh4kp8jalsriybk4ywv-cabal2nix-duoids-hedgehog
  158. 30.52 s [cabal2nix-duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  159. 30.73 s [cabal2nix-duoids-hedgehog:post-build] copying 1 paths...
  160. 30.73 s [cabal2nix-duoids-hedgehog:post-build] copying path '/nix/store/xx73806hp1dxrdh4kp8jalsriybk4ywv-cabal2nix-duoids-hedgehog' to 'https://cache.nix-ci.com'...
  161. 31.05 s [cabal2nix-duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  162. 31.19 s [cabal2nix-duoids-hedgehog:post-build] copying 0 paths...
  163. 31.21 s Progress: 1 of 2 built
  164. 31.21 s Progress: 2 of 2 built
  165. 31.62 s
  166. 34.21 s Downloading cached libxcrypt from https://cache.nix-ci.com
  167. 34.25 s Downloading cached colour-2.3.6-data from https://cache.nix-ci.com
  168. 34.25 s Downloading cached die-hook from https://cache.nix-ci.com
  169. 34.25 s Downloading cached pretty-show-1.10-data from https://cache.nix-ci.com
  170. 34.25 s Downloading cached linux-headers from https://cache.nix-ci.com
  171. 34.25 s Downloading cached lndir from https://cache.nix-ci.com
  172. 34.25 s Downloading cached ncurses-6.5-man from https://cache.nix-ci.com
  173. 34.25 s Downloading cached setup-debug-info-dirs-hook from https://cache.nix-ci.com
  174. 34.25 s Downloading cached expand-response-params from https://cache.nix-ci.com
  175. 34.25 s Downloading cached gmp-with-cxx-6.3.0-dev from https://cache.nix-ci.com
  176. 34.25 s Downloading cached libffi-3.4.8-dev from https://cache.nix-ci.com
  177. 34.26 s Downloading cached ncurses from https://cache.nix-ci.com
  178. 34.26 s Downloading cached binutils-2.44-lib from https://cache.nix-ci.com
  179. 34.26 s Downloading cached glibc-2.40-66-bin from https://cache.nix-ci.com
  180. 34.26 s Building /nix/store/18xb04slazjwcsbr2ryj11rkc4ahd7yn-builder.pl.drv
  181. 34.26 s Downloading cached algebraic-graphs-0.7-r3.cabal from https://cache.nix-ci.com
  182. 34.26 s Downloading cached algebraic-graphs from https://cache.nix-ci.com
  183. 34.28 s Building /nix/store/g1p9gxdr6s3znm58grj874jsmhcgvd7c-haskell-generic-builder-test-wrapper.sh.drv
  184. 34.30 s Progress: 0 of 96 built (2 building), 1 of 193 downloaded from cache (15 downloading)
  185. 34.30 s Progress: 0 of 96 built (2 building), 2 of 193 downloaded from cache (14 downloading)
  186. 34.30 s Progress: 0 of 96 built (2 building), 3 of 193 downloaded from cache (13 downloading)
  187. 34.30 s [builder.pl] Phase: patchPhase
  188. 34.30 s [builder.pl] Phase: updateAutotoolsGnuConfigScriptsPhase
  189. 34.30 s Downloading cached dns-root-data-2025-04 from https://cache.nix-ci.com
  190. 34.30 s Downloading cached extra-1.7.16-r1.cabal from https://cache.nix-ci.com
  191. 34.30 s Downloading cached extra from https://cache.nix-ci.com
  192. 34.30 s [builder.pl] Phase: configurePhase
  193. 34.30 s Progress: 0 of 95 built (2 building), 4 of 193 downloaded from cache (15 downloading)
  194. 34.30 s Downloading cached gmp from https://cache.nix-ci.com
  195. 34.31 s [builder.pl] no configure script, doing nothing
  196. 34.31 s [builder.pl] Phase: buildPhase
  197. 34.32 s [builder.pl] Phase: checkPhase
  198. 34.32 s [builder.pl] Phase: installPhase
  199. 34.32 s [builder.pl] no Makefile or custom installPhase, doing nothing
  200. 34.34 s [haskell-generic-builder-test-wrapper.sh:post-build] Uploading to cachix cache "sellout": /nix/store/4aglf609sav489rr35hg8vwpx8zh2cnb-haskell-generic-builder-test-wrapper.sh
  201. 34.78 s [haskell-generic-builder-test-wrapper.sh:post-build] Nothing to push - all store paths are already on Cachix.
  202. 34.80 s [haskell-generic-builder-test-wrapper.sh:post-build] Uploading to the NixCI cache: /nix/store/4aglf609sav489rr35hg8vwpx8zh2cnb-haskell-generic-builder-test-wrapper.sh
  203. 34.84 s [haskell-generic-builder-test-wrapper.sh:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  204. 34.94 s [haskell-generic-builder-test-wrapper.sh:post-build] copying 0 paths...
  205. 35.00 s [haskell-generic-builder-test-wrapper.sh:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  206. 35.02 s [haskell-generic-builder-test-wrapper.sh:post-build] copying 0 paths...
  207. 35.02 s Progress: 1 of 96 built (1 building), 4 of 193 downloaded from cache (16 downloading)
  208. 35.02 s Progress: 1 of 95 built (1 building), 5 of 193 downloaded from cache (15 downloading)
  209. 35.02 s Progress: 1 of 95 built (1 building), 6 of 193 downloaded from cache (14 downloading)
  210. 35.02 s Progress: 1 of 95 built (1 building), 7 of 193 downloaded from cache (13 downloading)
  211. 35.02 s Progress: 1 of 95 built (1 building), 8 of 193 downloaded from cache (12 downloading)
  212. 35.02 s Progress: 1 of 95 built (1 building), 9 of 193 downloaded from cache (11 downloading)
  213. 35.02 s Progress: 1 of 95 built (1 building), 10 of 193 downloaded from cache (10 downloading)
  214. 35.02 s Progress: 1 of 95 built (1 building), 11 of 193 downloaded from cache (9 downloading)
  215. 35.02 s Progress: 1 of 95 built (1 building), 12 of 193 downloaded from cache (8 downloading)
  216. 35.02 s Progress: 1 of 95 built (1 building), 13 of 193 downloaded from cache (7 downloading)
  217. 35.02 s Progress: 1 of 95 built (1 building), 14 of 193 downloaded from cache (6 downloading)
  218. 35.02 s Progress: 1 of 95 built (1 building), 15 of 193 downloaded from cache (5 downloading)
  219. 35.02 s Progress: 1 of 95 built (1 building), 16 of 193 downloaded from cache (4 downloading)
  220. 35.02 s Progress: 1 of 95 built (1 building), 17 of 193 downloaded from cache (3 downloading)
  221. 35.02 s Progress: 1 of 95 built (1 building), 18 of 193 downloaded from cache (2 downloading)
  222. 35.02 s Progress: 1 of 95 built (1 building), 19 of 193 downloaded from cache (1 downloading)
  223. 35.02 s Progress: 1 of 95 built (1 building), 20 of 193 downloaded from cache
  224. 35.02 s [builder.pl] Phase: fixupPhase
  225. 35.03 s [builder.pl] shrinking RPATHs of ELF executables and libraries in /nix/store/2awfh7sr3vf9d0ir666fi5qm03ng35sp-builder.pl
  226. 35.03 s [builder.pl] checking for references to /build/ in /nix/store/2awfh7sr3vf9d0ir666fi5qm03ng35sp-builder.pl...
  227. 35.03 s [builder.pl] patching script interpreter paths in /nix/store/2awfh7sr3vf9d0ir666fi5qm03ng35sp-builder.pl
  228. 35.03 s Downloading cached hscolour from https://cache.nix-ci.com
  229. 35.03 s Downloading cached jailbreak-cabal from https://cache.nix-ci.com
  230. 35.03 s Downloading cached libevent from https://cache.nix-ci.com
  231. 35.03 s Downloading cached libtasn1 from https://cache.nix-ci.com
  232. 35.03 s Downloading cached libxml2 from https://cache.nix-ci.com
  233. 35.03 s Downloading cached make-shell-wrapper-hook from https://cache.nix-ci.com
  234. 35.03 s Downloading cached nettle from https://cache.nix-ci.com
  235. 35.03 s Downloading cached nothunks-0.3.0.0-r1.cabal from https://cache.nix-ci.com
  236. 35.03 s Downloading cached nothunks from https://cache.nix-ci.com
  237. 35.03 s Downloading cached perl from https://cache.nix-ci.com
  238. 35.03 s Downloading cached quickcheck-instances-0.3.32-r1.cabal from https://cache.nix-ci.com
  239. 35.03 s Downloading cached quickcheck-instances from https://cache.nix-ci.com
  240. 35.03 s Downloading cached remove-references-to from https://cache.nix-ci.com
  241. 35.03 s Downloading cached sqlite from https://cache.nix-ci.com
  242. 35.03 s Downloading cached unordered-containers-0.2.20-r4.cabal from https://cache.nix-ci.com
  243. 35.03 s Downloading cached unordered-containers from https://cache.nix-ci.com
  244. 35.05 s [builder.pl:post-build] Uploading to cachix cache "sellout": /nix/store/2awfh7sr3vf9d0ir666fi5qm03ng35sp-builder.pl
  245. 35.58 s [builder.pl:post-build] Nothing to push - all store paths are already on Cachix.
  246. 35.60 s [builder.pl:post-build] Uploading to the NixCI cache: /nix/store/2awfh7sr3vf9d0ir666fi5qm03ng35sp-builder.pl
  247. 35.64 s [builder.pl:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  248. 35.75 s [builder.pl:post-build] copying 0 paths...
  249. 35.81 s [builder.pl:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  250. 35.92 s [builder.pl:post-build] copying 0 paths...
  251. 35.94 s Progress: 2 of 92 built, 20 of 193 downloaded from cache (16 downloading)
  252. 35.94 s Progress: 2 of 91 built, 21 of 193 downloaded from cache (15 downloading)
  253. 35.94 s Progress: 2 of 91 built, 22 of 193 downloaded from cache (14 downloading)
  254. 35.94 s Progress: 2 of 91 built, 23 of 193 downloaded from cache (13 downloading)
  255. 35.94 s Progress: 2 of 91 built, 24 of 193 downloaded from cache (12 downloading)
  256. 35.94 s Progress: 2 of 91 built, 25 of 193 downloaded from cache (11 downloading)
  257. 35.94 s Progress: 2 of 91 built, 26 of 193 downloaded from cache (10 downloading)
  258. 35.94 s Progress: 2 of 91 built, 27 of 193 downloaded from cache (9 downloading)
  259. 35.94 s Progress: 2 of 91 built, 28 of 193 downloaded from cache (8 downloading)
  260. 35.94 s Progress: 2 of 91 built, 29 of 193 downloaded from cache (7 downloading)
  261. 35.94 s Progress: 2 of 91 built, 30 of 193 downloaded from cache (6 downloading)
  262. 35.94 s Progress: 2 of 91 built, 31 of 193 downloaded from cache (5 downloading)
  263. 35.94 s Progress: 2 of 91 built, 32 of 193 downloaded from cache (4 downloading)
  264. 35.94 s Progress: 2 of 91 built, 33 of 193 downloaded from cache (3 downloading)
  265. 35.94 s Progress: 2 of 91 built, 34 of 193 downloaded from cache (2 downloading)
  266. 35.94 s Progress: 2 of 91 built, 35 of 193 downloaded from cache (1 downloading)
  267. 35.94 s Progress: 2 of 91 built, 36 of 193 downloaded from cache
  268. 35.94 s Downloading cached binutils from https://cache.nix-ci.com
  269. 35.94 s Downloading cached glibc-2.40-66-dev from https://cache.nix-ci.com
  270. 35.94 s Downloading cached isl from https://cache.nix-ci.com
  271. 35.94 s Downloading cached mpfr from https://cache.nix-ci.com
  272. 35.94 s Downloading cached ncurses-6.5-dev from https://cache.nix-ci.com
  273. 35.94 s Downloading cached readline from https://cache.nix-ci.com
  274. 35.94 s Downloading cached vector-0.13.2.0-r1.cabal from https://cache.nix-ci.com
  275. 35.94 s Downloading cached vector from https://cache.nix-ci.com
  276. 35.94 s Downloading cached libarchive-3.8.2-lib from https://cache.nix-ci.com
  277. 35.94 s Downloading cached p11-kit from https://cache.nix-ci.com
  278. 35.94 s Downloading cached unbound-1.24.1-lib from https://cache.nix-ci.com
  279. 35.94 s Progress: 2 of 80 built, 37 of 193 downloaded from cache (10 downloading)
  280. 36.01 s Progress: 2 of 80 built, 38 of 193 downloaded from cache (9 downloading)
  281. 36.06 s Progress: 2 of 80 built, 39 of 193 downloaded from cache (8 downloading)
  282. 36.13 s Progress: 2 of 79 built, 40 of 193 downloaded from cache (7 downloading)
  283. 36.13 s Progress: 2 of 78 built, 41 of 193 downloaded from cache (6 downloading)
  284. 36.13 s Downloading cached bash-interactive from https://cache.nix-ci.com
  285. 36.15 s Progress: 2 of 78 built, 42 of 193 downloaded from cache (6 downloading)
  286. 36.15 s Downloading cached libmpc from https://cache.nix-ci.com
  287. 36.29 s Progress: 2 of 78 built, 43 of 193 downloaded from cache (6 downloading)
  288. 36.29 s Progress: 2 of 78 built, 44 of 193 downloaded from cache (5 downloading)
  289. 36.34 s Progress: 2 of 78 built, 45 of 193 downloaded from cache (4 downloading)
  290. 36.37 s Progress: 2 of 78 built, 46 of 193 downloaded from cache (3 downloading)
  291. 36.37 s Downloading cached gnutls from https://cache.nix-ci.com
  292. 36.37 s Progress: 2 of 78 built, 47 of 193 downloaded from cache (3 downloading)
  293. 36.37 s Downloading cached gcc from https://cache.nix-ci.com
  294. 36.47 s Progress: 2 of 78 built, 48 of 193 downloaded from cache (3 downloading)
  295. 36.47 s Downloading cached libmicrohttpd from https://cache.nix-ci.com
  296. 36.53 s Progress: 2 of 78 built, 49 of 193 downloaded from cache (3 downloading)
  297. 36.53 s Downloading cached elfutils-0.192-bin from https://cache.nix-ci.com
  298. 36.62 s Progress: 2 of 78 built, 50 of 193 downloaded from cache (3 downloading)
  299. 36.62 s Downloading cached elfutils-0.192-dev from https://cache.nix-ci.com
  300. 36.68 s Progress: 2 of 78 built, 51 of 193 downloaded from cache (3 downloading)
  301. 36.91 s Progress: 2 of 78 built, 52 of 193 downloaded from cache (2 downloading)
  302. 36.91 s Downloading cached ghc-9.8.4-doc from https://cache.nix-ci.com
  303. 37.76 s Progress: 2 of 78 built, 53 of 193 downloaded from cache (2 downloading)
  304. 37.76 s Downloading cached binutils-wrapper from https://cache.nix-ci.com
  305. 37.76 s Progress: 2 of 78 built, 54 of 193 downloaded from cache (2 downloading)
  306. 39.32 s Progress: 2 of 78 built, 55 of 193 downloaded from cache (1 downloading)
  307. 39.32 s Downloading cached Cabal-syntax-3.12.1.0-doc from https://cache.nix-ci.com
  308. 39.41 s Downloading cached OneTuple-0.4.2-doc from https://cache.nix-ci.com
  309. 39.41 s Downloading cached assoc-1.1.1-doc from https://cache.nix-ci.com
  310. 39.41 s Downloading cached base-orphans-0.9.3-doc from https://cache.nix-ci.com
  311. 39.41 s Downloading cached call-stack-0.4.0-doc from https://cache.nix-ci.com
  312. 39.41 s Downloading cached clock-0.8.4-doc from https://cache.nix-ci.com
  313. 39.41 s Downloading cached code-page-0.2.1-doc from https://cache.nix-ci.com
  314. 39.41 s Downloading cached colour-2.3.6-doc from https://cache.nix-ci.com
  315. 39.41 s Downloading cached erf-2.0.0.0-doc from https://cache.nix-ci.com
  316. 39.41 s Downloading cached ghc-paths-0.1.0.12-doc from https://sellout.cachix.org
  317. 39.41 s Downloading cached haskell-lexer-1.1.2-doc from https://cache.nix-ci.com
  318. 39.41 s Downloading cached integer-logarithms-1.0.4-doc from https://cache.nix-ci.com
  319. 39.41 s Downloading cached inspection-testing-0.5.0.3-doc from https://cache.nix-ci.com
  320. 39.41 s Downloading cached mmorph-1.2.0-doc from https://cache.nix-ci.com
  321. 39.41 s Downloading cached old-locale-1.0.0.7-doc from https://cache.nix-ci.com
  322. 39.44 s Progress: 2 of 77 built, 56 of 193 downloaded from cache (15 downloading)
  323. 39.44 s Downloading cached os-string-2.0.7-doc from https://cache.nix-ci.com
  324. 39.44 s Progress: 2 of 77 built, 57 of 193 downloaded from cache (15 downloading)
  325. 39.44 s Downloading cached prettyprinter-1.7.1-doc from https://cache.nix-ci.com
  326. 39.44 s Progress: 2 of 77 built, 58 of 193 downloaded from cache (15 downloading)
  327. 39.44 s Downloading cached primitive-0.9.1.0-doc from https://cache.nix-ci.com
  328. 39.44 s Progress: 2 of 77 built, 59 of 193 downloaded from cache (15 downloading)
  329. 39.44 s Downloading cached safe-exceptions-0.1.7.4-doc from https://cache.nix-ci.com
  330. 39.45 s Progress: 2 of 77 built, 60 of 193 downloaded from cache (15 downloading)
  331. 39.45 s Downloading cached splitmix-0.1.1-doc from https://cache.nix-ci.com
  332. 39.45 s Progress: 2 of 77 built, 61 of 193 downloaded from cache (15 downloading)
  333. 39.45 s Downloading cached pretty-show-1.10-doc from https://cache.nix-ci.com
  334. 39.46 s Progress: 2 of 77 built, 62 of 193 downloaded from cache (15 downloading)
  335. 39.46 s Downloading cached ansi-terminal-types-1.1-doc from https://cache.nix-ci.com
  336. 39.46 s Progress: 2 of 77 built, 63 of 193 downloaded from cache (15 downloading)
  337. 39.46 s Downloading cached HUnit-1.6.2.0-doc from https://cache.nix-ci.com
  338. 39.46 s Progress: 2 of 77 built, 64 of 193 downloaded from cache (15 downloading)
  339. 39.46 s Downloading cached old-time-1.1.0.4-doc from https://cache.nix-ci.com
  340. 39.46 s Progress: 2 of 77 built, 65 of 193 downloaded from cache (15 downloading)
  341. 39.46 s Downloading cached syb-0.7.2.4-doc from https://cache.nix-ci.com
  342. 39.46 s Progress: 2 of 77 built, 66 of 193 downloaded from cache (15 downloading)
  343. 39.46 s Downloading cached tagged-0.8.8-doc from https://cache.nix-ci.com
  344. 39.46 s Progress: 2 of 77 built, 67 of 193 downloaded from cache (15 downloading)
  345. 39.46 s Downloading cached terminal-size-0.3.4-doc from https://cache.nix-ci.com
  346. 39.51 s Progress: 2 of 77 built, 68 of 193 downloaded from cache (15 downloading)
  347. 39.51 s Downloading cached transformers-base-0.4.6-doc from https://cache.nix-ci.com
  348. 39.51 s Progress: 2 of 77 built, 69 of 193 downloaded from cache (15 downloading)
  349. 39.51 s Downloading cached hashable-1.4.7.0-doc from https://cache.nix-ci.com
  350. 39.51 s Progress: 2 of 77 built, 70 of 193 downloaded from cache (15 downloading)
  351. 39.51 s Downloading cached transformers-compat-0.7.2-doc from https://cache.nix-ci.com
  352. 39.52 s Progress: 2 of 77 built, 71 of 193 downloaded from cache (15 downloading)
  353. 39.52 s Downloading cached random-1.2.1.3-doc from https://cache.nix-ci.com
  354. 39.52 s Progress: 2 of 77 built, 72 of 193 downloaded from cache (15 downloading)
  355. 39.52 s Downloading cached unliftio-core-0.2.1.0-doc from https://cache.nix-ci.com
  356. 39.52 s Progress: 2 of 77 built, 73 of 193 downloaded from cache (15 downloading)
  357. 39.52 s Downloading cached vector-stream-0.1.0.1-doc from https://cache.nix-ci.com
  358. 39.53 s Progress: 2 of 77 built, 74 of 193 downloaded from cache (15 downloading)
  359. 39.53 s Downloading cached wherefrom-compat-0.1.1.1-doc from https://cache.nix-ci.com
  360. 39.53 s Progress: 2 of 77 built, 75 of 193 downloaded from cache (15 downloading)
  361. 39.53 s Downloading cached ansi-terminal-1.1.2-doc from https://cache.nix-ci.com
  362. 39.54 s Progress: 2 of 77 built, 76 of 193 downloaded from cache (15 downloading)
  363. 39.54 s Downloading cached wl-pprint-annotated-0.1.0.1-doc from https://cache.nix-ci.com
  364. 39.55 s Progress: 2 of 77 built, 77 of 193 downloaded from cache (15 downloading)
  365. 39.55 s Downloading cached Cabal-3.12.1.0-doc from https://cache.nix-ci.com
  366. 39.55 s Progress: 2 of 77 built, 78 of 193 downloaded from cache (15 downloading)
  367. 39.56 s Progress: 2 of 77 built, 79 of 193 downloaded from cache (14 downloading)
  368. 39.56 s Downloading cached boring-0.2.2-doc from https://cache.nix-ci.com
  369. 39.56 s Downloading cached distributive-0.6.2.1-doc from https://cache.nix-ci.com
  370. 39.56 s Progress: 2 of 77 built, 80 of 193 downloaded from cache (15 downloading)
  371. 39.56 s Progress: 2 of 77 built, 81 of 193 downloaded from cache (14 downloading)
  372. 39.56 s Progress: 2 of 77 built, 82 of 193 downloaded from cache (13 downloading)
  373. 39.57 s Downloading cached doctest-0.22.6-doc from https://sellout.cachix.org
  374. 39.60 s Progress: 2 of 77 built, 83 of 193 downloaded from cache (13 downloading)
  375. 39.60 s Downloading cached monad-control-1.0.3.1-doc from https://cache.nix-ci.com
  376. 39.62 s Progress: 2 of 77 built, 84 of 193 downloaded from cache (13 downloading)
  377. 39.62 s Downloading cached async-2.2.5-doc from https://cache.nix-ci.com
  378. 39.62 s Downloading cached case-insensitive-1.2.1.0-doc from https://cache.nix-ci.com
  379. 39.62 s Downloading cached data-fix-0.3.4-doc from https://cache.nix-ci.com
  380. 39.62 s Progress: 2 of 77 built, 85 of 193 downloaded from cache (15 downloading)
  381. 39.62 s Downloading cached scientific-0.3.8.0-doc from https://cache.nix-ci.com
  382. 39.63 s Progress: 2 of 77 built, 86 of 193 downloaded from cache (15 downloading)
  383. 39.63 s Downloading cached text-short-0.1.6-doc from https://cache.nix-ci.com
  384. 39.63 s Progress: 2 of 77 built, 87 of 193 downloaded from cache (15 downloading)
  385. 39.63 s Downloading cached resourcet-1.3.0-doc from https://cache.nix-ci.com
  386. 39.63 s Progress: 2 of 77 built, 88 of 193 downloaded from cache (15 downloading)
  387. 39.63 s Downloading cached these-1.2.1-doc from https://cache.nix-ci.com
  388. 39.64 s Progress: 2 of 77 built, 89 of 193 downloaded from cache (15 downloading)
  389. 39.64 s Downloading cached QuickCheck-2.14.3-doc from https://cache.nix-ci.com
  390. 39.64 s Progress: 2 of 77 built, 90 of 193 downloaded from cache (15 downloading)
  391. 39.64 s Downloading cached prettyprinter-ansi-terminal-1.1.3-doc from https://cache.nix-ci.com
  392. 39.65 s Progress: 2 of 77 built, 91 of 193 downloaded from cache (15 downloading)
  393. 39.65 s Downloading cached barbies-2.1.1.0-doc from https://cache.nix-ci.com
  394. 39.66 s Progress: 2 of 77 built, 92 of 193 downloaded from cache (15 downloading)
  395. 39.66 s Downloading cached constraints-0.14.2-doc from https://cache.nix-ci.com
  396. 39.67 s Progress: 2 of 77 built, 93 of 193 downloaded from cache (15 downloading)
  397. 39.67 s Downloading cached time-compat-1.9.7-doc from https://cache.nix-ci.com
  398. 39.67 s Progress: 2 of 77 built, 94 of 193 downloaded from cache (15 downloading)
  399. 39.67 s Downloading cached lifted-base-0.2.3.12-doc from https://cache.nix-ci.com
  400. 39.67 s Progress: 2 of 77 built, 95 of 193 downloaded from cache (15 downloading)
  401. 39.67 s Downloading cached uuid-types-1.0.6-doc from https://cache.nix-ci.com
  402. 39.67 s Progress: 2 of 77 built, 96 of 193 downloaded from cache (15 downloading)
  403. 39.67 s Downloading cached concurrent-output-1.10.21-doc from https://cache.nix-ci.com
  404. 39.68 s Progress: 2 of 77 built, 97 of 193 downloaded from cache (15 downloading)
  405. 39.69 s Progress: 2 of 77 built, 98 of 193 downloaded from cache (14 downloading)
  406. 39.69 s Progress: 2 of 77 built, 99 of 193 downloaded from cache (13 downloading)
  407. 39.69 s Progress: 2 of 77 built, 100 of 193 downloaded from cache (12 downloading)
  408. 39.69 s Downloading cached strict-0.5.1-doc from https://cache.nix-ci.com
  409. 39.69 s Progress: 2 of 77 built, 101 of 193 downloaded from cache (12 downloading)
  410. 39.69 s Downloading cached optparse-applicative-0.18.1.0-doc from https://cache.nix-ci.com
  411. 39.72 s Progress: 2 of 77 built, 102 of 193 downloaded from cache (12 downloading)
  412. 39.72 s Downloading cached ChasingBottoms-1.3.1.15-doc from https://cache.nix-ci.com
  413. 39.72 s Progress: 2 of 77 built, 103 of 193 downloaded from cache (12 downloading)
  414. 39.72 s Progress: 2 of 77 built, 104 of 193 downloaded from cache (11 downloading)
  415. 39.73 s Progress: 2 of 77 built, 105 of 193 downloaded from cache (10 downloading)
  416. 39.73 s Progress: 2 of 77 built, 106 of 193 downloaded from cache (9 downloading)
  417. 39.73 s Downloading cached lifted-async-0.10.2.7-doc from https://cache.nix-ci.com
  418. 39.73 s Progress: 2 of 77 built, 107 of 193 downloaded from cache (9 downloading)
  419. 39.73 s Progress: 2 of 77 built, 108 of 193 downloaded from cache (8 downloading)
  420. 39.74 s Progress: 2 of 77 built, 109 of 193 downloaded from cache (7 downloading)
  421. 39.75 s Progress: 2 of 77 built, 110 of 193 downloaded from cache (6 downloading)
  422. 39.75 s Downloading cached tasty-1.5.3-doc from https://cache.nix-ci.com
  423. 39.77 s Progress: 2 of 77 built, 111 of 193 downloaded from cache (6 downloading)
  424. 39.77 s Downloading cached hedgehog-1.5-doc from https://cache.nix-ci.com
  425. 39.78 s Progress: 2 of 77 built, 112 of 193 downloaded from cache (6 downloading)
  426. 39.78 s Downloading cached cabal-doctest-1.0.11-doc from https://sellout.cachix.org
  427. 39.80 s Progress: 2 of 77 built, 113 of 193 downloaded from cache (6 downloading)
  428. 39.80 s Progress: 2 of 77 built, 114 of 193 downloaded from cache (5 downloading)
  429. 39.80 s Downloading cached tasty-hunit-0.10.2-doc from https://cache.nix-ci.com
  430. 39.80 s Downloading cached tasty-inspection-testing-0.2.1-doc from https://cache.nix-ci.com
  431. 39.80 s Downloading cached tasty-quickcheck-0.11-doc from https://cache.nix-ci.com
  432. 39.85 s Progress: 2 of 77 built, 115 of 193 downloaded from cache (7 downloading)
  433. 39.87 s Progress: 2 of 77 built, 116 of 193 downloaded from cache (6 downloading)
  434. 39.87 s Progress: 2 of 77 built, 117 of 193 downloaded from cache (5 downloading)
  435. 39.87 s Downloading cached tasty-hedgehog-1.4.0.2-doc from https://cache.nix-ci.com
  436. 39.90 s Progress: 2 of 77 built, 118 of 193 downloaded from cache (5 downloading)
  437. 39.94 s Progress: 2 of 77 built, 119 of 193 downloaded from cache (4 downloading)
  438. 39.96 s Progress: 2 of 77 built, 120 of 193 downloaded from cache (3 downloading)
  439. 39.98 s Progress: 2 of 77 built, 121 of 193 downloaded from cache (2 downloading)
  440. 40.07 s Progress: 2 of 77 built, 122 of 193 downloaded from cache (1 downloading)
  441. 40.07 s Downloading cached gcc-wrapper from https://cache.nix-ci.com
  442. 40.13 s Progress: 2 of 77 built, 123 of 193 downloaded from cache (1 downloading)
  443. 40.13 s Downloading cached ghc from https://cache.nix-ci.com
  444. 40.13 s Downloading cached stdenv-linux from https://cache.nix-ci.com
  445. 40.16 s Progress: 2 of 77 built, 124 of 193 downloaded from cache (2 downloading)
  446. 40.18 s Progress: 2 of 77 built, 125 of 193 downloaded from cache (1 downloading)
  447. 47.81 s Progress: 2 of 76 built, 126 of 193 downloaded from cache
  448. 47.81 s Downloading cached Cabal-syntax from https://cache.nix-ci.com
  449. 47.89 s Downloading cached OneTuple from https://cache.nix-ci.com
  450. 47.89 s Downloading cached assoc from https://cache.nix-ci.com
  451. 47.89 s Downloading cached base-orphans from https://cache.nix-ci.com
  452. 47.89 s Downloading cached call-stack from https://cache.nix-ci.com
  453. 47.89 s Downloading cached clock from https://cache.nix-ci.com
  454. 47.89 s Downloading cached code-page from https://cache.nix-ci.com
  455. 47.89 s Downloading cached colour from https://cache.nix-ci.com
  456. 47.89 s Downloading cached erf from https://cache.nix-ci.com
  457. 47.89 s Downloading cached ghc-paths from https://sellout.cachix.org
  458. 47.89 s Downloading cached haskell-lexer from https://cache.nix-ci.com
  459. 47.89 s Downloading cached inspection-testing from https://cache.nix-ci.com
  460. 47.89 s Downloading cached integer-logarithms from https://cache.nix-ci.com
  461. 47.89 s Downloading cached old-locale from https://cache.nix-ci.com
  462. 47.89 s Downloading cached os-string from https://cache.nix-ci.com
  463. 47.89 s Downloading cached prettyprinter from https://cache.nix-ci.com
  464. 47.91 s Progress: 2 of 75 built, 127 of 193 downloaded from cache (15 downloading)
  465. 47.91 s Downloading cached primitive from https://cache.nix-ci.com
  466. 47.92 s Progress: 2 of 75 built, 128 of 193 downloaded from cache (15 downloading)
  467. 47.92 s Downloading cached safe-exceptions from https://cache.nix-ci.com
  468. 47.92 s Progress: 2 of 75 built, 129 of 193 downloaded from cache (15 downloading)
  469. 47.92 s Downloading cached splitmix from https://cache.nix-ci.com
  470. 47.93 s Progress: 2 of 74 built, 130 of 193 downloaded from cache (15 downloading)
  471. 47.93 s Downloading cached syb from https://cache.nix-ci.com
  472. 47.96 s Progress: 2 of 73 built, 131 of 193 downloaded from cache (15 downloading)
  473. 47.96 s Downloading cached tagged from https://cache.nix-ci.com
  474. 47.96 s Progress: 2 of 72 built, 132 of 193 downloaded from cache (15 downloading)
  475. 47.96 s Downloading cached terminal-size from https://cache.nix-ci.com
  476. 47.96 s Progress: 2 of 71 built, 133 of 193 downloaded from cache (15 downloading)
  477. 47.96 s Downloading cached transformers-compat from https://cache.nix-ci.com
  478. 47.97 s Progress: 2 of 71 built, 134 of 193 downloaded from cache (15 downloading)
  479. 47.97 s Downloading cached HUnit from https://cache.nix-ci.com
  480. 47.97 s Progress: 2 of 71 built, 135 of 193 downloaded from cache (15 downloading)
  481. 47.97 s Downloading cached old-time from https://cache.nix-ci.com
  482. 47.99 s Progress: 2 of 70 built, 136 of 193 downloaded from cache (15 downloading)
  483. 47.99 s Downloading cached unliftio-core from https://cache.nix-ci.com
  484. 48.00 s Progress: 2 of 69 built, 137 of 193 downloaded from cache (15 downloading)
  485. 48.00 s Downloading cached vector-stream from https://cache.nix-ci.com
  486. 48.01 s Progress: 2 of 68 built, 138 of 193 downloaded from cache (15 downloading)
  487. 48.01 s Downloading cached random from https://cache.nix-ci.com
  488. 48.01 s Progress: 2 of 67 built, 139 of 193 downloaded from cache (15 downloading)
  489. 48.01 s Downloading cached hashable from https://cache.nix-ci.com
  490. 48.04 s Progress: 2 of 66 built, 140 of 193 downloaded from cache (15 downloading)
  491. 48.04 s Downloading cached ansi-terminal-types from https://cache.nix-ci.com
  492. 48.04 s Progress: 2 of 65 built, 141 of 193 downloaded from cache (15 downloading)
  493. 48.04 s Downloading cached pretty-show from https://cache.nix-ci.com
  494. 48.04 s Progress: 2 of 65 built, 142 of 193 downloaded from cache (15 downloading)
  495. 48.04 s Downloading cached wherefrom-compat from https://cache.nix-ci.com
  496. 48.05 s Progress: 2 of 65 built, 143 of 193 downloaded from cache (15 downloading)
  497. 48.05 s Downloading cached wl-pprint-annotated from https://cache.nix-ci.com
  498. 48.05 s Progress: 2 of 64 built, 144 of 193 downloaded from cache (15 downloading)
  499. 48.05 s Progress: 2 of 63 built, 145 of 193 downloaded from cache (14 downloading)
  500. 48.05 s Downloading cached boring from https://cache.nix-ci.com
  501. 48.05 s Downloading cached distributive from https://cache.nix-ci.com
  502. 48.05 s Progress: 2 of 62 built, 146 of 193 downloaded from cache (15 downloading)
  503. 48.05 s Downloading cached doctest from https://sellout.cachix.org
  504. 48.07 s Progress: 2 of 62 built, 147 of 193 downloaded from cache (15 downloading)
  505. 48.07 s Progress: 2 of 61 built, 148 of 193 downloaded from cache (14 downloading)
  506. 48.07 s Downloading cached transformers-base from https://cache.nix-ci.com
  507. 48.07 s Downloading cached mmorph from https://cache.nix-ci.com
  508. 48.07 s Progress: 2 of 60 built, 149 of 193 downloaded from cache (15 downloading)
  509. 48.07 s Downloading cached resourcet from https://cache.nix-ci.com
  510. 48.08 s Progress: 2 of 59 built, 150 of 193 downloaded from cache (15 downloading)
  511. 48.08 s Progress: 2 of 58 built, 151 of 193 downloaded from cache (14 downloading)
  512. 48.10 s Progress: 2 of 57 built, 152 of 193 downloaded from cache (13 downloading)
  513. 48.11 s Progress: 2 of 56 built, 153 of 193 downloaded from cache (12 downloading)
  514. 48.11 s Progress: 2 of 55 built, 154 of 193 downloaded from cache (11 downloading)
  515. 48.11 s Downloading cached ansi-terminal from https://cache.nix-ci.com
  516. 48.11 s Progress: 2 of 54 built, 155 of 193 downloaded from cache (11 downloading)
  517. 48.11 s Downloading cached barbies from https://cache.nix-ci.com
  518. 48.11 s Progress: 2 of 53 built, 156 of 193 downloaded from cache (11 downloading)
  519. 48.11 s Downloading cached async from https://cache.nix-ci.com
  520. 48.11 s Downloading cached case-insensitive from https://cache.nix-ci.com
  521. 48.11 s Downloading cached constraints from https://cache.nix-ci.com
  522. 48.11 s Downloading cached data-fix from https://cache.nix-ci.com
  523. 48.11 s Downloading cached scientific from https://cache.nix-ci.com
  524. 48.12 s Progress: 2 of 52 built, 157 of 193 downloaded from cache (15 downloading)
  525. 48.12 s Downloading cached text-short from https://cache.nix-ci.com
  526. 48.12 s Progress: 2 of 51 built, 158 of 193 downloaded from cache (15 downloading)
  527. 48.12 s Downloading cached these from https://cache.nix-ci.com
  528. 48.12 s Progress: 2 of 50 built, 159 of 193 downloaded from cache (15 downloading)
  529. 48.12 s Downloading cached monad-control from https://cache.nix-ci.com
  530. 48.14 s Progress: 2 of 49 built, 160 of 193 downloaded from cache (15 downloading)
  531. 48.14 s Downloading cached time-compat from https://cache.nix-ci.com
  532. 48.14 s Progress: 2 of 48 built, 161 of 193 downloaded from cache (15 downloading)
  533. 48.14 s Downloading cached QuickCheck from https://cache.nix-ci.com
  534. 48.15 s Progress: 2 of 47 built, 162 of 193 downloaded from cache (15 downloading)
  535. 48.15 s Downloading cached uuid-types from https://cache.nix-ci.com
  536. 48.16 s Progress: 2 of 46 built, 163 of 193 downloaded from cache (15 downloading)
  537. 48.16 s Downloading cached prettyprinter-ansi-terminal from https://cache.nix-ci.com
  538. 48.17 s Progress: 2 of 45 built, 164 of 193 downloaded from cache (15 downloading)
  539. 48.18 s Progress: 2 of 44 built, 165 of 193 downloaded from cache (14 downloading)
  540. 48.18 s Downloading cached concurrent-output from https://cache.nix-ci.com
  541. 48.18 s Progress: 2 of 43 built, 166 of 193 downloaded from cache (14 downloading)
  542. 48.20 s Progress: 2 of 42 built, 167 of 193 downloaded from cache (13 downloading)
  543. 48.20 s Progress: 2 of 41 built, 168 of 193 downloaded from cache (12 downloading)
  544. 48.20 s Progress: 2 of 40 built, 169 of 193 downloaded from cache (11 downloading)
  545. 48.21 s Progress: 2 of 39 built, 170 of 193 downloaded from cache (10 downloading)
  546. 48.21 s Progress: 2 of 38 built, 171 of 193 downloaded from cache (9 downloading)
  547. 48.21 s Downloading cached lifted-base from https://cache.nix-ci.com
  548. 48.21 s Progress: 2 of 37 built, 172 of 193 downloaded from cache (9 downloading)
  549. 48.21 s Progress: 2 of 36 built, 173 of 193 downloaded from cache (8 downloading)
  550. 48.21 s Downloading cached strict from https://cache.nix-ci.com
  551. 48.24 s Progress: 2 of 35 built, 174 of 193 downloaded from cache (8 downloading)
  552. 48.26 s Progress: 2 of 34 built, 175 of 193 downloaded from cache (7 downloading)
  553. 48.27 s Progress: 2 of 33 built, 176 of 193 downloaded from cache (6 downloading)
  554. 48.27 s Downloading cached optparse-applicative from https://cache.nix-ci.com
  555. 48.27 s Progress: 2 of 33 built, 177 of 193 downloaded from cache (6 downloading)
  556. 48.27 s Progress: 2 of 32 built, 178 of 193 downloaded from cache (5 downloading)
  557. 48.27 s Downloading cached lifted-async from https://cache.nix-ci.com
  558. 48.31 s Progress: 2 of 31 built, 179 of 193 downloaded from cache (5 downloading)
  559. 48.35 s Progress: 2 of 30 built, 180 of 193 downloaded from cache (4 downloading)
  560. 48.35 s Downloading cached hedgehog from https://cache.nix-ci.com
  561. 48.36 s Progress: 2 of 29 built, 181 of 193 downloaded from cache (4 downloading)
  562. 48.36 s Downloading cached ChasingBottoms from https://cache.nix-ci.com
  563. 48.39 s Progress: 2 of 28 built, 182 of 193 downloaded from cache (4 downloading)
  564. 48.39 s Downloading cached tasty from https://cache.nix-ci.com
  565. 48.52 s Progress: 2 of 28 built, 183 of 193 downloaded from cache (4 downloading)
  566. 48.53 s Progress: 2 of 27 built, 184 of 193 downloaded from cache (3 downloading)
  567. 48.53 s Downloading cached tasty-hunit from https://cache.nix-ci.com
  568. 48.53 s Downloading cached tasty-inspection-testing from https://cache.nix-ci.com
  569. 48.53 s Downloading cached tasty-quickcheck from https://cache.nix-ci.com
  570. 48.53 s Progress: 2 of 26 built, 185 of 193 downloaded from cache (5 downloading)
  571. 48.53 s Downloading cached tasty-hedgehog from https://cache.nix-ci.com
  572. 48.54 s Progress: 2 of 25 built, 186 of 193 downloaded from cache (5 downloading)
  573. 48.59 s Progress: 2 of 24 built, 187 of 193 downloaded from cache (4 downloading)
  574. 48.68 s Progress: 2 of 23 built, 188 of 193 downloaded from cache (3 downloading)
  575. 48.69 s Progress: 2 of 22 built, 189 of 193 downloaded from cache (2 downloading)
  576. 48.70 s Progress: 2 of 21 built, 190 of 193 downloaded from cache (1 downloading)
  577. 48.82 s Building /nix/store/lljap5vb616flbyjmw2sc7xvhrmq4gw9-vector-0.13.2.0.drv
  578. 48.82 s Progress: 2 of 20 built (1 building), 191 of 193 downloaded from cache
  579. 48.82 s Downloading cached Cabal from https://cache.nix-ci.com
  580. 48.97 s [vector] Phase: setupCompilerEnvironmentPhase
  581. 48.98 s [vector] Build with /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4.
  582. 49.17 s [vector] Phase: unpackPhase
  583. 49.18 s [vector] unpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
  584. 49.19 s [vector] source root is vector-0.13.2.0
  585. 49.19 s [vector] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
  586. 49.20 s [vector] Phase: patchPhase
  587. 49.20 s [vector] Replace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/1.cabal.
  588. 49.21 s [vector] Phase: compileBuildDriverPhase
  589. 49.23 s [vector] setupCompileFlags: -package-db=/build/tmp.0aWOrGeNum/setup-package.conf.d -threaded
  590. 49.27 s [vector] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.0aWOrGeNum/Main.o )
  591. 49.32 s [vector] [2 of 2] Linking Setup
  592. 49.42 s Progress: 2 of 20 built (1 building), 192 of 193 downloaded from cache
  593. 49.42 s Downloading cached cabal-doctest from https://sellout.cachix.org
  594. 49.63 s Progress: 2 of 19 built (1 building), 193 of 193 downloaded from cache
  595. 49.67 s Building /nix/store/77mqnqcq3cmvbwsahhgpkhiay89afl0k-duoids-0.0.1.0.drv
  596. 49.79 s [duoids] Phase: setupCompilerEnvironmentPhase
  597. 49.80 s [duoids] Build with /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4.
  598. 49.96 s [duoids] Phase: unpackPhase
  599. 49.97 s [duoids] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./core
  600. 49.97 s [duoids] source root is core
  601. 49.98 s [duoids] Phase: patchPhase
  602. 49.99 s [duoids] Phase: compileBuildDriverPhase
  603. 49.99 s [duoids] setupCompileFlags: -package-db=/build/tmp.YBSl1SejAF/setup-package.conf.d -threaded
  604. 50.04 s [duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.YBSl1SejAF/Main.o )
  605. 50.08 s [duoids] [2 of 2] Linking Setup
  606. 50.59 s [vector] Phase: updateAutotoolsGnuConfigScriptsPhase
  607. 50.99 s [vector] Phase: configurePhase
  608. 51.00 s [vector] configureFlags: --verbose --prefix=/nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.0aWOrGeNum/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/lib
  609. 51.01 s [vector] Using Parsec parser
  610. 51.01 s [vector] Configuring vector-0.13.2.0...
  611. 51.28 s [vector] Flags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
  612. 51.28 s [vector] wall=False
  613. 51.28 s [vector] Dependency base >=4.9 && <4.22: using base-4.19.2.0
  614. 51.28 s [vector] Dependency deepseq >=1.1 && <1.6: using deepseq-1.5.1.0
  615. 51.28 s [vector] Dependency primitive >=0.6.4.0 && <0.10: using primitive-0.9.1.0
  616. 51.28 s [vector] Dependency vector-stream >=0.1 && <0.2: using vector-stream-0.1.0.1
  617. 51.28 s [vector] Dependency base: using base-4.19.2.0
  618. 51.28 s [vector] Dependency random >=1.2: using random-1.2.1.3
  619. 51.28 s [vector] Dependency tasty: using tasty-1.5.3
  620. 51.28 s [vector] Dependency vector: using vector-0.13.2.0
  621. 51.28 s [vector] Dependency QuickCheck >=2.9 && <2.16: using QuickCheck-2.14.3
  622. 51.28 s [vector] Dependency base >=4.5 && <5: using base-4.19.2.0
  623. 51.28 s [vector] Dependency base-orphans >=0.6: using base-orphans-0.9.3
  624. 51.28 s [vector] Dependency primitive: using primitive-0.9.1.0
  625. 51.28 s [vector] Dependency random: using random-1.2.1.3
  626. 51.28 s [vector] Dependency tasty: using tasty-1.5.3
  627. 51.28 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  628. 51.28 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11
  629. 51.28 s [vector] Dependency template-haskell: using template-haskell-2.21.0.0
  630. 51.28 s [vector] Dependency transformers >=0.2.0.0: using transformers-0.6.1.0
  631. 51.28 s [vector] Dependency vector: using vector-0.13.2.0
  632. 51.28 s [vector] Dependency QuickCheck >=2.9 && <2.16: using QuickCheck-2.14.3
  633. 51.28 s [vector] Dependency base >=4.5 && <5: using base-4.19.2.0
  634. 51.28 s [vector] Dependency base-orphans >=0.6: using base-orphans-0.9.3
  635. 51.28 s [vector] Dependency primitive: using primitive-0.9.1.0
  636. 51.28 s [vector] Dependency random: using random-1.2.1.3
  637. 51.28 s [vector] Dependency tasty: using tasty-1.5.3
  638. 51.28 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  639. 51.28 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11
  640. 51.28 s [vector] Dependency template-haskell: using template-haskell-2.21.0.0
  641. 51.28 s [vector] Dependency transformers >=0.2.0.0: using transformers-0.6.1.0
  642. 51.28 s [vector] Dependency vector: using vector-0.13.2.0
  643. 51.28 s [vector] Dependency base: using base-4.19.2.0
  644. 51.28 s [vector] Dependency doctest >=0.15 && <0.24: using doctest-0.22.6
  645. 51.28 s [vector] Dependency primitive >=0.6.4.0 && <0.10: using primitive-0.9.1.0
  646. 51.28 s [vector] Dependency vector: using vector-0.13.2.0
  647. 51.28 s [vector] Dependency base: using base-4.19.2.0
  648. 51.28 s [vector] Dependency primitive >=0.6.4.0 && <0.10: using primitive-0.9.1.0
  649. 51.28 s [vector] Dependency tasty: using tasty-1.5.3
  650. 51.28 s [vector] Dependency tasty-inspection-testing >=0.1: using
  651. 51.28 s [vector] tasty-inspection-testing-0.2.1
  652. 51.28 s [vector] Dependency vector: using vector-0.13.2.0
  653. 51.30 s [duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  654. 51.36 s [duoids] Phase: configurePhase
  655. 51.36 s [duoids] configureFlags: --verbose --prefix=/nix/store/yf2y3v8v55lh1mnzpczwv22550aq3c5j-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/x46zwg5cnl417fmf73sw94vq9zzhar0i-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.YBSl1SejAF/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/lib
  656. 51.37 s [duoids] Using Parsec parser
  657. 51.37 s [duoids] Configuring duoids-0.0.1.0...
  658. 51.47 s [vector] Source component graph:
  659. 51.47 s [vector] component lib
  660. 51.47 s [vector] component lib:benchmarks-O2 dependency lib
  661. 51.47 s [vector] component test:vector-doctest dependency lib
  662. 51.47 s [vector] component test:vector-inspection dependency lib
  663. 51.47 s [vector] component test:vector-tests-O0 dependency lib
  664. 51.47 s [vector] component test:vector-tests-O2 dependency lib
  665. 51.47 s [vector] Configured component graph:
  666. 51.47 s [vector] component vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  667. 51.47 s [vector] include base-4.19.2.0-0fde
  668. 51.47 s [vector] include deepseq-1.5.1.0-7f97
  669. 51.47 s [vector] include primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  670. 51.47 s [vector] include vector-stream-0.1.0.1-1ArDOuabiccI208zpeB9Zv
  671. 51.47 s [vector] component vector-0.13.2.0-KjPJfwfBs004HPZguWmR2B-benchmarks-O2
  672. 51.47 s [vector] include base-4.19.2.0-0fde
  673. 51.47 s [vector] include random-1.2.1.3-KGZDfCTowDgJLZ8SS9n703
  674. 51.47 s [vector] include tasty-1.5.3-QOpJMSxeF49XPb7Cb4i95
  675. 51.47 s [vector] include vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  676. 51.47 s [vector] component vector-0.13.2.0-F8sEnT9QefbDMdZWKOMKZt-vector-doctest
  677. 51.47 s [vector] include base-4.19.2.0-0fde
  678. 51.47 s [vector] include doctest-0.22.6-1SxYZzGcAV168a12vQnyDt
  679. 51.47 s [vector] include primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  680. 51.47 s [vector] include vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  681. 51.47 s [vector] component vector-0.13.2.0-HDMf4xbVX6o3s0g5c50SXN-vector-inspection
  682. 51.47 s [vector] include base-4.19.2.0-0fde
  683. 51.47 s [vector] include primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  684. 51.47 s [vector] include tasty-1.5.3-QOpJMSxeF49XPb7Cb4i95
  685. 51.47 s [vector] include tasty-inspection-testing-0.2.1-LFjEz035qHFEbv0KeSKJiX
  686. 51.47 s [vector] include vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  687. 51.47 s [vector] component vector-0.13.2.0-GRgK9AM3EHABO89nlPRwGP-vector-tests-O0
  688. 51.47 s [vector] include QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  689. 51.47 s [vector] include base-4.19.2.0-0fde
  690. 51.47 s [vector] include base-orphans-0.9.3-HQcqw3C6hz5FrbRxPh3iYw
  691. 51.47 s [vector] include primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  692. 51.47 s [vector] include random-1.2.1.3-KGZDfCTowDgJLZ8SS9n703
  693. 51.47 s [vector] include tasty-1.5.3-QOpJMSxeF49XPb7Cb4i95
  694. 51.47 s [vector] include tasty-hunit-0.10.2-GvqyVBRVmj03GFrvo7llW5
  695. 51.47 s [vector] include tasty-quickcheck-0.11-8ASWrIW2G5gKRpKoKDr6x
  696. 51.47 s [vector] include template-haskell-2.21.0.0-8a5d
  697. 51.47 s [vector] include transformers-0.6.1.0-f128
  698. 51.47 s [vector] include vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  699. 51.47 s [vector] component vector-0.13.2.0-D7AQUQBgxiM1nhQiTXrCWQ-vector-tests-O2
  700. 51.47 s [vector] include QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  701. 51.47 s [vector] include base-4.19.2.0-0fde
  702. 51.47 s [vector] include base-orphans-0.9.3-HQcqw3C6hz5FrbRxPh3iYw
  703. 51.47 s [vector] include primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  704. 51.47 s [vector] include random-1.2.1.3-KGZDfCTowDgJLZ8SS9n703
  705. 51.47 s [vector] include tasty-1.5.3-QOpJMSxeF49XPb7Cb4i95
  706. 51.47 s [vector] include tasty-hunit-0.10.2-GvqyVBRVmj03GFrvo7llW5
  707. 51.47 s [vector] include tasty-quickcheck-0.11-8ASWrIW2G5gKRpKoKDr6x
  708. 51.47 s [vector] include template-haskell-2.21.0.0-8a5d
  709. 51.47 s [vector] include transformers-0.6.1.0-f128
  710. 51.47 s [vector] include vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  711. 51.47 s [vector] Linked component graph:
  712. 51.47 s [vector] unit vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  713. 51.47 s [vector] include base-4.19.2.0-0fde
  714. 51.47 s [vector] include deepseq-1.5.1.0-7f97
  715. 51.47 s [vector] include primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  716. 51.47 s [vector] include vector-stream-0.1.0.1-1ArDOuabiccI208zpeB9Zv
  717. 51.47 s [vector] Data.Vector=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9:Data.Vector.Unboxed.Mutable
  718. 51.47 s [vector] unit vector-0.13.2.0-KjPJfwfBs004HPZguWmR2B-benchmarks-O2
  719. 51.47 s [vector] include base-4.19.2.0-0fde
  720. 51.47 s [vector] include random-1.2.1.3-KGZDfCTowDgJLZ8SS9n703
  721. 51.47 s [vector] include tasty-1.5.3-QOpJMSxeF49XPb7Cb4i95
  722. 51.47 s [vector] include vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  723. 51.47 s [vector] Bench.Vector.Algo.AwShCC=vector-0.13.2.0-KjPJfwfBs004HPZguWmR2B-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-KjPJfwfBs004HPZguWmR2B-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-KjPJfwfBs004HPZguWmR2B-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-KjPJfwfBs004HPZguWmR2B-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-KjPJfwfBs004HPZguWmR2B-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-KjPJfwfBs004HPZguWmR2B-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-KjPJfwfBs004HPZguWmR2B-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-KjPJfwfBs004HPZguWmR2B-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-KjPJfwfBs004HPZguWmR2B-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-KjPJfwfBs004HPZguWmR2B-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-KjPJfwfBs004HPZguWmR2B-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-KjPJfwfBs004HPZguWmR2B-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-KjPJfwfBs004HPZguWmR2B-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-KjPJfwfBs004HPZguWmR2B-benchmarks-O2:Bench.Vector.TestData.ParenTree
  724. 51.47 s [vector] unit vector-0.13.2.0-F8sEnT9QefbDMdZWKOMKZt-vector-doctest
  725. 51.47 s [vector] include base-4.19.2.0-0fde
  726. 51.47 s [vector] include doctest-0.22.6-1SxYZzGcAV168a12vQnyDt
  727. 51.47 s [vector] include primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  728. 51.47 s [vector] include vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  729. 51.47 s [vector] unit vector-0.13.2.0-HDMf4xbVX6o3s0g5c50SXN-vector-inspection
  730. 51.47 s [vector] include base-4.19.2.0-0fde
  731. 51.47 s [vector] include primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  732. 51.47 s [vector] include tasty-1.5.3-QOpJMSxeF49XPb7Cb4i95
  733. 51.47 s [vector] include tasty-inspection-testing-0.2.1-LFjEz035qHFEbv0KeSKJiX
  734. 51.47 s [vector] include vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  735. 51.47 s [vector] unit vector-0.13.2.0-GRgK9AM3EHABO89nlPRwGP-vector-tests-O0
  736. 51.47 s [vector] include QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  737. 51.47 s [vector] include base-4.19.2.0-0fde
  738. 51.47 s [vector] include base-orphans-0.9.3-HQcqw3C6hz5FrbRxPh3iYw
  739. 51.47 s [vector] include primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  740. 51.47 s [vector] include random-1.2.1.3-KGZDfCTowDgJLZ8SS9n703
  741. 51.47 s [vector] include tasty-1.5.3-QOpJMSxeF49XPb7Cb4i95
  742. 51.47 s [vector] include tasty-hunit-0.10.2-GvqyVBRVmj03GFrvo7llW5
  743. 51.47 s [vector] include tasty-quickcheck-0.11-8ASWrIW2G5gKRpKoKDr6x
  744. 51.47 s [vector] include template-haskell-2.21.0.0-8a5d
  745. 51.47 s [vector] include transformers-0.6.1.0-f128
  746. 51.47 s [vector] include vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  747. 51.47 s [vector] unit vector-0.13.2.0-D7AQUQBgxiM1nhQiTXrCWQ-vector-tests-O2
  748. 51.47 s [vector] include QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  749. 51.48 s [vector] include base-4.19.2.0-0fde
  750. 51.48 s [vector] include base-orphans-0.9.3-HQcqw3C6hz5FrbRxPh3iYw
  751. 51.48 s [vector] include primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  752. 51.48 s [vector] include random-1.2.1.3-KGZDfCTowDgJLZ8SS9n703
  753. 51.48 s [vector] include tasty-1.5.3-QOpJMSxeF49XPb7Cb4i95
  754. 51.48 s [vector] include tasty-hunit-0.10.2-GvqyVBRVmj03GFrvo7llW5
  755. 51.48 s [vector] include tasty-quickcheck-0.11-8ASWrIW2G5gKRpKoKDr6x
  756. 51.48 s [vector] include template-haskell-2.21.0.0-8a5d
  757. 51.48 s [vector] include transformers-0.6.1.0-f128
  758. 51.48 s [vector] include vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  759. 51.48 s [vector] Ready component graph:
  760. 51.48 s [vector] definite vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  761. 51.48 s [vector] depends base-4.19.2.0-0fde
  762. 51.48 s [vector] depends deepseq-1.5.1.0-7f97
  763. 51.48 s [vector] depends primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  764. 51.48 s [vector] depends vector-stream-0.1.0.1-1ArDOuabiccI208zpeB9Zv
  765. 51.48 s [vector] definite vector-0.13.2.0-KjPJfwfBs004HPZguWmR2B-benchmarks-O2
  766. 51.48 s [vector] depends base-4.19.2.0-0fde
  767. 51.48 s [vector] depends random-1.2.1.3-KGZDfCTowDgJLZ8SS9n703
  768. 51.48 s [vector] depends tasty-1.5.3-QOpJMSxeF49XPb7Cb4i95
  769. 51.48 s [vector] depends vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  770. 51.48 s [vector] definite vector-0.13.2.0-HDMf4xbVX6o3s0g5c50SXN-vector-inspection
  771. 51.49 s [vector] depends base-4.19.2.0-0fde
  772. 51.49 s [vector] depends primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  773. 51.49 s [vector] depends tasty-1.5.3-QOpJMSxeF49XPb7Cb4i95
  774. 51.49 s [vector] depends tasty-inspection-testing-0.2.1-LFjEz035qHFEbv0KeSKJiX
  775. 51.49 s [vector] depends vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  776. 51.49 s [vector] definite vector-0.13.2.0-GRgK9AM3EHABO89nlPRwGP-vector-tests-O0
  777. 51.49 s [vector] depends QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  778. 51.49 s [vector] depends base-4.19.2.0-0fde
  779. 51.49 s [vector] depends base-orphans-0.9.3-HQcqw3C6hz5FrbRxPh3iYw
  780. 51.49 s [vector] depends primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  781. 51.49 s [vector] depends random-1.2.1.3-KGZDfCTowDgJLZ8SS9n703
  782. 51.49 s [vector] depends tasty-1.5.3-QOpJMSxeF49XPb7Cb4i95
  783. 51.49 s [vector] depends tasty-hunit-0.10.2-GvqyVBRVmj03GFrvo7llW5
  784. 51.49 s [vector] depends tasty-quickcheck-0.11-8ASWrIW2G5gKRpKoKDr6x
  785. 51.49 s [vector] depends template-haskell-2.21.0.0-8a5d
  786. 51.49 s [vector] depends transformers-0.6.1.0-f128
  787. 51.49 s [vector] depends vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  788. 51.49 s [vector] definite vector-0.13.2.0-F8sEnT9QefbDMdZWKOMKZt-vector-doctest
  789. 51.49 s [vector] depends base-4.19.2.0-0fde
  790. 51.49 s [vector] depends doctest-0.22.6-1SxYZzGcAV168a12vQnyDt
  791. 51.49 s [vector] depends primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  792. 51.49 s [vector] depends vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  793. 51.49 s [vector] definite vector-0.13.2.0-D7AQUQBgxiM1nhQiTXrCWQ-vector-tests-O2
  794. 51.49 s [vector] depends QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  795. 51.49 s [vector] depends base-4.19.2.0-0fde
  796. 51.49 s [vector] depends base-orphans-0.9.3-HQcqw3C6hz5FrbRxPh3iYw
  797. 51.49 s [vector] depends primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  798. 51.49 s [vector] depends random-1.2.1.3-KGZDfCTowDgJLZ8SS9n703
  799. 51.49 s [vector] depends tasty-1.5.3-QOpJMSxeF49XPb7Cb4i95
  800. 51.49 s [vector] depends tasty-hunit-0.10.2-GvqyVBRVmj03GFrvo7llW5
  801. 51.49 s [vector] depends tasty-quickcheck-0.11-8ASWrIW2G5gKRpKoKDr6x
  802. 51.49 s [vector] depends template-haskell-2.21.0.0-8a5d
  803. 51.49 s [vector] depends transformers-0.6.1.0-f128
  804. 51.49 s [vector] depends vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  805. 51.49 s [vector] Using Cabal-3.10.3.0 compiled by ghc-9.8
  806. 51.49 s [vector] Using compiler: ghc-9.8.4
  807. 51.49 s [vector] Using install prefix:
  808. 51.49 s [vector] /nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0
  809. 51.49 s [vector] Executables installed in:
  810. 51.49 s [vector] /nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0/bin
  811. 51.49 s [vector] Libraries installed in:
  812. 51.49 s [vector] /nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  813. 51.49 s [vector] Dynamic Libraries installed in:
  814. 51.49 s [vector] /nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  815. 51.49 s [vector] Private executables installed in:
  816. 51.49 s [vector] /nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.8.4/vector-0.13.2.0
  817. 51.49 s [vector] Data files installed in:
  818. 51.49 s [vector] /nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0/share/x86_64-linux-ghc-9.8.4/vector-0.13.2.0
  819. 51.49 s [vector] Documentation installed in:
  820. 51.49 s [vector] /nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.8.4/vector-0.13.2.0
  821. 51.49 s [vector] Configuration files installed in:
  822. 51.49 s [vector] /nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0/etc
  823. 51.49 s [vector] No alex found
  824. 51.49 s [vector] Using ar found on system at:
  825. 51.49 s [vector] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  826. 51.49 s [vector] No c2hs found
  827. 51.49 s [vector] No cpphs found
  828. 51.49 s [vector] Using doctest version 0.22.6 found on system at:
  829. 51.49 s [vector] /nix/store/h8km0wljqv9v9b70lmcsxafwlrlbzw3q-doctest-0.22.6/bin/doctest
  830. 51.49 s [vector] Using gcc version 14.3.0 given by user at:
  831. 51.49 s [vector] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  832. 51.49 s [vector] Using ghc version 9.8.4 found on system at:
  833. 51.49 s [vector] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc
  834. 51.49 s [vector] Using ghc-pkg version 9.8.4 found on system at:
  835. 51.49 s [vector] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc-pkg-9.8.4
  836. 51.49 s [vector] No ghcjs found
  837. 51.49 s [vector] No ghcjs-pkg found
  838. 51.49 s [vector] No greencard found
  839. 51.49 s [vector] Using haddock version 2.30.0 found on system at:
  840. 51.49 s [vector] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/haddock-ghc-9.8.4
  841. 51.49 s [vector] No happy found
  842. 51.49 s [vector] Using haskell-suite found on system at: haskell-suite-dummy-location
  843. 51.49 s [vector] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  844. 51.49 s [vector] No hmake found
  845. 51.49 s [vector] Using hpc version 0.69 found on system at:
  846. 51.49 s [vector] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hpc-ghc-9.8.4
  847. 51.49 s [vector] Using hsc2hs version 0.68.10 found on system at:
  848. 51.49 s [vector] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  849. 51.49 s [vector] Using hscolour version 1.25 found on system at:
  850. 51.49 s [vector] /nix/store/r9acd8dqp6xxbhlplifjikwk7bc6w7vf-hscolour-1.25/bin/HsColour
  851. 51.49 s [vector] No jhc found
  852. 51.49 s [vector] Using ld found on system at:
  853. 51.49 s [vector] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  854. 51.49 s [vector] No pkg-config found
  855. 51.49 s [vector] Using runghc version 9.8.4 found on system at:
  856. 51.49 s [vector] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/runghc-9.8.4
  857. 51.49 s [vector] Using strip version 2.44 found on system at:
  858. 51.49 s [vector] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  859. 51.49 s [vector] Using tar found on system at:
  860. 51.49 s [vector] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  861. 51.49 s [vector] No uhc found
  862. 51.59 s [duoids] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  863. 51.68 s [vector] Phase: buildPhase
  864. 51.76 s [vector] Preprocessing library for vector-0.13.2.0..
  865. 51.77 s [vector] Building library for vector-0.13.2.0..
  866. 51.80 s [duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  867. 51.80 s [duoids] >=4.21.0 && <4.22: using base-4.19.2.0
  868. 51.80 s [duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  869. 51.80 s [duoids] >=4.21.0 && <4.22: using base-4.19.2.0
  870. 51.80 s [duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  871. 51.80 s [duoids] <0.25: using doctest-0.22.6
  872. 51.80 s [duoids] Dependency duoids: using duoids-0.0.1.0
  873. 51.80 s [duoids] Source component graph:
  874. 51.80 s [duoids] component lib
  875. 51.80 s [duoids] component test:doctests dependency lib
  876. 51.80 s [duoids] Configured component graph:
  877. 51.80 s [duoids] component duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW
  878. 51.80 s [duoids] include base-4.19.2.0-0fde
  879. 51.80 s [duoids] component duoids-0.0.1.0-5OPRp2J26vU2A5SzJIxtqx-doctests
  880. 51.80 s [duoids] include base-4.19.2.0-0fde
  881. 51.80 s [duoids] include doctest-0.22.6-1SxYZzGcAV168a12vQnyDt
  882. 51.80 s [duoids] include duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW
  883. 51.80 s [duoids] Linked component graph:
  884. 51.80 s [duoids] unit duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW
  885. 51.80 s [duoids] include base-4.19.2.0-0fde
  886. 51.80 s [duoids] Control.Duoidal=duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW:Control.Duoidal,Control.Duoidal.Do=duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW:Control.Duoidal.Do,Control.Duoidal.Either=duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW:Control.Duoidal.Either,Control.Duoidal.Fail=duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW:Control.Duoidal.Fail,Control.Duoidal.Fix=duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW:Control.Duoidal.Fix,Control.Duoidal.Laws=duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW:Control.Duoidal.Laws,Data.Duoid=duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW:Data.Duoid,Data.Duoid.Laws=duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW:Data.Duoid.Laws
  887. 51.80 s [duoids] unit duoids-0.0.1.0-5OPRp2J26vU2A5SzJIxtqx-doctests
  888. 51.80 s [duoids] include base-4.19.2.0-0fde
  889. 51.80 s [duoids] include doctest-0.22.6-1SxYZzGcAV168a12vQnyDt
  890. 51.80 s [duoids] include duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW
  891. 51.80 s [duoids] Ready component graph:
  892. 51.80 s [duoids] definite duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW
  893. 51.80 s [duoids] depends base-4.19.2.0-0fde
  894. 51.80 s [duoids] definite duoids-0.0.1.0-5OPRp2J26vU2A5SzJIxtqx-doctests
  895. 51.80 s [duoids] depends base-4.19.2.0-0fde
  896. 51.80 s [duoids] depends doctest-0.22.6-1SxYZzGcAV168a12vQnyDt
  897. 51.80 s [duoids] depends duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW
  898. 51.80 s [duoids] Using Cabal-3.12.1.0 compiled by ghc-9.8
  899. 51.80 s [duoids] Using compiler: ghc-9.8.4
  900. 51.80 s [duoids] Using install prefix:
  901. 51.80 s [duoids] /nix/store/yf2y3v8v55lh1mnzpczwv22550aq3c5j-duoids-0.0.1.0
  902. 51.80 s [duoids] Executables installed in:
  903. 51.80 s [duoids] /nix/store/yf2y3v8v55lh1mnzpczwv22550aq3c5j-duoids-0.0.1.0/bin
  904. 51.80 s [duoids] Libraries installed in:
  905. 51.80 s [duoids] /nix/store/yf2y3v8v55lh1mnzpczwv22550aq3c5j-duoids-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-65e9/duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW
  906. 51.80 s [duoids] Dynamic Libraries installed in:
  907. 51.80 s [duoids] /nix/store/yf2y3v8v55lh1mnzpczwv22550aq3c5j-duoids-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-65e9
  908. 51.80 s [duoids] Private executables installed in:
  909. 51.80 s [duoids] /nix/store/yf2y3v8v55lh1mnzpczwv22550aq3c5j-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.8.4-65e9/duoids-0.0.1.0
  910. 51.80 s [duoids] Data files installed in:
  911. 51.80 s [duoids] /nix/store/yf2y3v8v55lh1mnzpczwv22550aq3c5j-duoids-0.0.1.0/share/x86_64-linux-ghc-9.8.4-65e9/duoids-0.0.1.0
  912. 51.80 s [duoids] Documentation installed in:
  913. 51.80 s [duoids] /nix/store/x46zwg5cnl417fmf73sw94vq9zzhar0i-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0
  914. 51.80 s [duoids] Configuration files installed in:
  915. 51.80 s [duoids] /nix/store/yf2y3v8v55lh1mnzpczwv22550aq3c5j-duoids-0.0.1.0/etc
  916. 51.80 s [duoids] No alex found
  917. 51.80 s [duoids] Using ar found on system at:
  918. 51.80 s [duoids] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  919. 51.80 s [duoids] No c2hs found
  920. 51.80 s [duoids] No cpphs found
  921. 51.80 s [duoids] Using doctest version 0.22.6 found on system at:
  922. 51.80 s [duoids] /nix/store/h8km0wljqv9v9b70lmcsxafwlrlbzw3q-doctest-0.22.6/bin/doctest
  923. 51.80 s [duoids] Using gcc version 14.3.0 given by user at:
  924. 51.80 s [duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  925. 51.80 s [duoids] Using ghc version 9.8.4 found on system at:
  926. 51.80 s [duoids] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc
  927. 51.80 s [duoids] Using ghc-pkg version 9.8.4 found on system at:
  928. 51.80 s [duoids] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc-pkg-9.8.4
  929. 51.80 s [duoids] No ghcjs found
  930. 51.80 s [duoids] No ghcjs-pkg found
  931. 51.80 s [duoids] No greencard found
  932. 51.80 s [duoids] Using haddock version 2.30.0 found on system at:
  933. 51.80 s [duoids] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/haddock-ghc-9.8.4
  934. 51.80 s [duoids] No happy found
  935. 51.80 s [duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  936. 51.80 s [duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  937. 51.80 s [duoids] No hmake found
  938. 51.80 s [duoids] Using hpc version 0.69 found on system at:
  939. 51.80 s [duoids] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hpc-ghc-9.8.4
  940. 51.80 s [duoids] Using hsc2hs version 0.68.10 found on system at:
  941. 51.80 s [duoids] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  942. 51.80 s [duoids] Using hscolour version 1.25 found on system at:
  943. 51.80 s [duoids] /nix/store/r9acd8dqp6xxbhlplifjikwk7bc6w7vf-hscolour-1.25/bin/HsColour
  944. 51.80 s [duoids] No jhc found
  945. 51.80 s [duoids] Using ld found on system at:
  946. 51.80 s [duoids] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  947. 51.80 s [duoids] No pkg-config found
  948. 51.80 s [duoids] Using runghc version 9.8.4 found on system at:
  949. 51.80 s [duoids] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/runghc-9.8.4
  950. 51.80 s [duoids] Using strip version 2.44 found on system at:
  951. 51.80 s [duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  952. 51.80 s [duoids] Using tar found on system at:
  953. 51.80 s [duoids] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  954. 51.80 s [duoids] No uhc found
  955. 52.11 s [duoids] Phase: buildPhase
  956. 52.15 s [duoids] Preprocessing library for duoids-0.0.1.0...
  957. 52.15 s [duoids] Building library for duoids-0.0.1.0...
  958. 52.22 s [duoids] [1 of 9] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.o, dist/build/Control/Duoidal/Async.dyn_o )
  959. 52.44 s [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 )
  960. 52.47 s [duoids] [2 of 9] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.o, dist/build/Data/Duoid.dyn_o )
  961. 52.49 s [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 )
  962. 52.51 s [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 )
  963. 52.72 s [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 )
  964. 52.72 s [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 )
  965. 52.72 s [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 )
  966. 52.72 s [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 )
  967. 54.10 s [duoids] [3 of 9] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.o, dist/build/Control/Duoidal.dyn_o )
  968. 56.28 s [duoids] [4 of 9] Compiling Control.Duoidal.Fix ( src/Control/Duoidal/Fix.hs, dist/build/Control/Duoidal/Fix.o, dist/build/Control/Duoidal/Fix.dyn_o )
  969. 56.45 s [duoids] [5 of 9] Compiling Control.Duoidal.Fail ( src/Control/Duoidal/Fail.hs, dist/build/Control/Duoidal/Fail.o, dist/build/Control/Duoidal/Fail.dyn_o )
  970. 56.45 s [duoids] [6 of 9] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.o, dist/build/Control/Duoidal/Either.dyn_o )
  971. 56.45 s [duoids] [7 of 9] Compiling Control.Duoidal.Do ( src/Control/Duoidal/Do.hs, dist/build/Control/Duoidal/Do.o, dist/build/Control/Duoidal/Do.dyn_o )
  972. 56.45 s [duoids] [8 of 9] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.o, dist/build/Data/Duoid/Laws.dyn_o )
  973. 56.45 s [duoids] [9 of 9] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.o, dist/build/Control/Duoidal/Laws.dyn_o )
  974. 56.62 s [duoids] [1 of 9] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.p_o )
  975. 57.02 s [duoids] [2 of 9] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.p_o )
  976. 58.69 s [duoids] [3 of 9] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.p_o )
  977. 59.57 s [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 )
  978. 60.63 s [duoids] [4 of 9] Compiling Control.Duoidal.Fix ( src/Control/Duoidal/Fix.hs, dist/build/Control/Duoidal/Fix.p_o )
  979. 60.77 s [duoids] [5 of 9] Compiling Control.Duoidal.Fail ( src/Control/Duoidal/Fail.hs, dist/build/Control/Duoidal/Fail.p_o )
  980. 60.77 s [duoids] [6 of 9] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.p_o )
  981. 60.77 s [duoids] [7 of 9] Compiling Control.Duoidal.Do ( src/Control/Duoidal/Do.hs, dist/build/Control/Duoidal/Do.p_o )
  982. 60.88 s [duoids] [8 of 9] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.p_o )
  983. 60.88 s [duoids] [9 of 9] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.p_o )
  984. 61.64 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  985. 61.64 s [duoids] Building test suite 'doctests' for duoids-0.0.1.0...
  986. 61.70 s [duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  987. 61.91 s [duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  988. 62.17 s [duoids] [3 of 3] Linking dist/build/doctests/doctests
  989. 62.82 s [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 )
  990. 65.91 s [duoids] Phase: checkPhase
  991. 66.17 s [duoids] Running 1 test suites...
  992. 66.18 s [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 )
  993. 66.22 s [duoids] Test suite doctests: RUNNING...
  994. 66.70 s [duoids]
  995. 66.70 s [duoids] on the commandline: warning: [GHC-98887]
  996. 66.70 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  997. 66.70 s [duoids]
  998. 66.70 s [duoids] on the commandline: warning: [GHC-98887]
  999. 66.70 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1000. 66.74 s [duoids]
  1001. 66.74 s [duoids] on the commandline: warning: [GHC-98887]
  1002. 66.74 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1003. 66.74 s [duoids]
  1004. 66.74 s [duoids] on the commandline: warning: [GHC-98887]
  1005. 66.74 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1006. 66.74 s [duoids]
  1007. 66.74 s [duoids] on the commandline: warning: [GHC-98887]
  1008. 66.74 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1009. 66.74 s [duoids]
  1010. 66.74 s [duoids] on the commandline: warning: [GHC-98887]
  1011. 66.74 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1012. 66.74 s [duoids]
  1013. 66.74 s [duoids] on the commandline: warning: [GHC-98887]
  1014. 66.74 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1015. 66.74 s [duoids]
  1016. 66.74 s [duoids] on the commandline: warning: [GHC-98887]
  1017. 66.74 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1018. 66.74 s [duoids]
  1019. 66.74 s [duoids] on the commandline: warning: [GHC-98887]
  1020. 66.74 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1021. 66.74 s [duoids]
  1022. 66.74 s [duoids] on the commandline: warning: [GHC-98887]
  1023. 66.74 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1024. 66.74 s [duoids]
  1025. 66.74 s [duoids] on the commandline: warning: [GHC-98887]
  1026. 66.74 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1027. 66.74 s [duoids]
  1028. 66.74 s [duoids] on the commandline: warning: [GHC-98887]
  1029. 66.74 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1030. 66.74 s [duoids]
  1031. 66.74 s [duoids] on the commandline: warning: [GHC-98887]
  1032. 66.74 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1033. 66.74 s [duoids]
  1034. 66.75 s [duoids] on the commandline: warning: [GHC-98887]
  1035. 66.75 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1036. 66.75 s [duoids]
  1037. 66.75 s [duoids] on the commandline: warning: [GHC-98887]
  1038. 66.75 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1039. 67.13 s [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 )
  1040. 68.19 s [duoids] Examples: 5 Tried: 5 Errors: 0 Failures: 0
  1041. 68.25 s [duoids] Test suite doctests: PASS
  1042. 68.25 s [duoids] Test suite logged to: dist/test/duoids-0.0.1.0-doctests.log
  1043. 68.25 s [duoids] 1 of 1 test suites (1 of 1 test cases) passed.
  1044. 68.27 s [duoids] Phase: haddockPhase
  1045. 68.52 s [duoids] Preprocessing library for duoids-0.0.1.0...
  1046. 68.53 s [duoids] Running Haddock on library for duoids-0.0.1.0...
  1047. 68.73 s [duoids] [1 of 9] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, nothing )
  1048. 68.85 s [duoids] [2 of 9] Compiling Data.Duoid ( src/Data/Duoid.hs, nothing )
  1049. 69.20 s [duoids] [3 of 9] Compiling Control.Duoidal ( src/Control/Duoidal.hs, nothing )
  1050. 69.89 s [duoids] [4 of 9] Compiling Control.Duoidal.Fix ( src/Control/Duoidal/Fix.hs, nothing )
  1051. 69.90 s [duoids] [5 of 9] Compiling Control.Duoidal.Fail ( src/Control/Duoidal/Fail.hs, nothing )
  1052. 69.92 s [duoids] [6 of 9] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, nothing )
  1053. 69.92 s [duoids] [7 of 9] Compiling Control.Duoidal.Do ( src/Control/Duoidal/Do.hs, nothing )
  1054. 69.92 s [duoids] [8 of 9] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, nothing )
  1055. 69.94 s [duoids] [9 of 9] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, nothing )
  1056. 70.03 s [duoids] Haddock coverage:
  1057. 70.03 s [duoids] Warning: 'cancel' is out of scope.
  1058. 70.03 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1059. 70.03 s [duoids] Warning: 'Par' is ambiguous. It is defined
  1060. 70.03 s [duoids] * at src/Data/Duoid.hs:53:17
  1061. 70.03 s [duoids] * at src/Data/Duoid.hs:53:1
  1062. 70.03 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1063. 70.03 s [duoids] by specifying the type/value namespace explicitly.
  1064. 70.03 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:53:1
  1065. 70.03 s [duoids] Warning: 'Seq' is ambiguous. It is defined
  1066. 70.03 s [duoids] * at src/Data/Duoid.hs:59:17
  1067. 70.03 s [duoids] * at src/Data/Duoid.hs:59:1
  1068. 70.03 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1069. 70.03 s [duoids] by specifying the type/value namespace explicitly.
  1070. 70.04 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:59:1
  1071. 70.04 s [duoids] 100% ( 10 / 10) in 'Data.Duoid'
  1072. 70.05 s [duoids] Warning: 'ExceptT' is out of scope.
  1073. 70.05 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1074. 70.05 s [duoids] Warning: 'Parallel' is ambiguous. It is defined
  1075. 70.05 s [duoids] * at src/Control/Duoidal.hs:228:24
  1076. 70.05 s [duoids] * at src/Control/Duoidal.hs:228:1
  1077. 70.05 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1078. 70.05 s [duoids] by specifying the type/value namespace explicitly.
  1079. 70.05 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:228:1
  1080. 70.05 s [duoids] Warning: 'Sequential' is ambiguous. It is defined
  1081. 70.05 s [duoids] * at src/Control/Duoidal.hs:243:26
  1082. 70.05 s [duoids] * at src/Control/Duoidal.hs:243:1
  1083. 70.05 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1084. 70.05 s [duoids] by specifying the type/value namespace explicitly.
  1085. 70.05 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:243:1
  1086. 70.05 s [duoids] Warning: 'NoDefaultPrelude' is out of scope.
  1087. 70.05 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1088. 70.05 s [duoids] Warning: 'Validation' is out of scope.
  1089. 70.05 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1090. 70.05 s [duoids] Warning: 'fail' is out of scope.
  1091. 70.05 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1092. 70.05 s [duoids] Warning: 'MonadFail' is out of scope.
  1093. 70.05 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1094. 70.05 s [duoids] Warning: 'Commutative' is ambiguous. It is defined
  1095. 70.05 s [duoids] * at src/Control/Duoidal.hs:529:27
  1096. 70.05 s [duoids] * at src/Control/Duoidal.hs:529:1
  1097. 70.05 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1098. 70.05 s [duoids] by specifying the type/value namespace explicitly.
  1099. 70.05 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:529:1
  1100. 70.05 s [duoids] Warning: 'Writer' is out of scope.
  1101. 70.05 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1102. 70.05 s [duoids] Warning: 'Set' is out of scope.
  1103. 70.05 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1104. 70.05 s [duoids] Warning: 'Char' is out of scope.
  1105. 70.05 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  1106. 70.06 s [duoids] Warning: 'Const' is ambiguous. It is defined
  1107. 70.06 s [duoids] * in ‘Data.Functor.Const’
  1108. 70.06 s [duoids] * in ‘Data.Functor.Const’
  1109. 70.06 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1110. 70.06 s [duoids] by specifying the type/value namespace explicitly.
  1111. 70.06 s [duoids] Defaulting to the one defined in ‘Data.Functor.Const’
  1112. 70.06 s [duoids] Warning: 'Normal' is ambiguous. It is defined
  1113. 70.06 s [duoids] * at src/Control/Duoidal.hs:279:1
  1114. 70.06 s [duoids] * at src/Data/Duoid.hs:74:1
  1115. 70.06 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  1116. 70.06 s [duoids] by specifying the type/value namespace explicitly.
  1117. 70.06 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:74:1
  1118. 70.06 s [duoids] 46% ( 28 / 60) in 'Control.Duoidal'
  1119. 70.06 s [duoids] Missing documentation for:
  1120. 70.06 s [duoids] DuoidalIO (src/Control/Duoidal.hs:470)
  1121. 70.06 s [duoids] Parallel (src/Control/Duoidal.hs:228)
  1122. 70.06 s [duoids] traverse_ (src/Control/Duoidal.hs:395)
  1123. 70.06 s [duoids] for (src/Control/Duoidal.hs:401)
  1124. 70.06 s [duoids] for_ (src/Control/Duoidal.hs:407)
  1125. 70.06 s [duoids] forever (src/Control/Duoidal.hs:427)
  1126. 70.06 s [duoids] Sequential (src/Control/Duoidal.hs:243)
  1127. 70.06 s [duoids] >> (src/Control/Duoidal.hs:339)
  1128. 70.06 s [duoids] >>= (src/Control/Duoidal.hs:450)
  1129. 70.06 s [duoids] >=> (src/Control/Duoidal.hs:460)
  1130. 70.06 s [duoids] =<< (src/Control/Duoidal.hs:455)
  1131. 70.06 s [duoids] <=< (src/Control/Duoidal.hs:465)
  1132. 70.06 s [duoids] join (src/Control/Duoidal.hs:447)
  1133. 70.06 s [duoids] ap (src/Control/Duoidal.hs:314)
  1134. 70.06 s [duoids] return (src/Control/Duoidal.hs:290)
  1135. 70.06 s [duoids] liftM2 (src/Control/Duoidal.hs:297)
  1136. 70.06 s [duoids] liftM3 (src/Control/Duoidal.hs:304)
  1137. 70.06 s [duoids] mapM (src/Control/Duoidal.hs:392)
  1138. 70.06 s [duoids] mapM_ (src/Control/Duoidal.hs:398)
  1139. 70.06 s [duoids] forM (src/Control/Duoidal.hs:404)
  1140. 70.06 s [duoids] forM_ (src/Control/Duoidal.hs:410)
  1141. 70.06 s [duoids] sequence (src/Control/Duoidal.hs:417)
  1142. 70.06 s [duoids] sequence_ (src/Control/Duoidal.hs:424)
  1143. 70.06 s [duoids] forever' (src/Control/Duoidal.hs:430)
  1144. 70.06 s [duoids] unless' (src/Control/Duoidal.hs:437)
  1145. 70.06 s [duoids] when' (src/Control/Duoidal.hs:444)
  1146. 70.06 s [duoids] normalPure (src/Control/Duoidal.hs:474)
  1147. 70.06 s [duoids] sequentialAp (src/Control/Duoidal.hs:490)
  1148. 70.06 s [duoids] sequentialBind (src/Control/Duoidal.hs:494)
  1149. 70.06 s [duoids] sequentialLiftA2 (src/Control/Duoidal.hs:485)
  1150. 70.06 s [duoids] sequentialPure (src/Control/Duoidal.hs:477)
  1151. 70.06 s [duoids] commutativeAp (src/Control/Duoidal.hs:544)
  1152. 70.06 s [duoids] 100% ( 3 / 3) in 'Control.Duoidal.Fix'
  1153. 70.06 s [duoids] 100% ( 3 / 3) in 'Control.Duoidal.Fail'
  1154. 70.06 s [duoids] 100% ( 2 / 2) in 'Control.Duoidal.Either'
  1155. 70.07 s [duoids] 55% ( 5 / 9) in 'Control.Duoidal.Do'
  1156. 70.07 s [duoids] Missing documentation for:
  1157. 70.07 s [duoids] join (src/Control/Duoidal.hs:447)
  1158. 70.07 s [duoids] return (src/Control/Duoidal.hs:290)
  1159. 70.07 s [duoids] >> (src/Control/Duoidal.hs:339)
  1160. 70.07 s [duoids] >>= (src/Control/Duoidal.hs:450)
  1161. 70.07 s [duoids] 16% ( 2 / 12) in 'Data.Duoid.Laws'
  1162. 70.07 s [duoids] Missing documentation for:
  1163. 70.07 s [duoids] Law (src/Data/Duoid/Laws.hs:27)
  1164. 70.07 s [duoids] Laws (src/Data/Duoid/Laws.hs:49)
  1165. 70.07 s [duoids] getLaws (src/Data/Duoid/Laws.hs:57)
  1166. 70.07 s [duoids] NormalLaws (src/Data/Duoid/Laws.hs:70)
  1167. 70.07 s [duoids] getNormalLaws (src/Data/Duoid/Laws.hs:76)
  1168. 70.07 s [duoids] checkLaw (src/Data/Duoid/Laws.hs:30)
  1169. 70.07 s [duoids] interchangeLaw (src/Data/Duoid/Laws.hs:33)
  1170. 70.07 s [duoids] joinUnitLaw (src/Data/Duoid/Laws.hs:43)
  1171. 70.07 s [duoids] splitUnitLaw (src/Data/Duoid/Laws.hs:40)
  1172. 70.07 s [duoids] swapUnitLaw (src/Data/Duoid/Laws.hs:46)
  1173. 70.07 s [duoids] 50% ( 3 / 6) in 'Control.Duoidal.Laws'
  1174. 70.07 s [duoids] Missing documentation for:
  1175. 70.07 s [duoids] joinUnit (src/Control/Duoidal/Laws.hs:67)
  1176. 70.07 s [duoids] splitUnit (src/Control/Duoidal/Laws.hs:63)
  1177. 70.07 s [duoids] swapUnit (src/Control/Duoidal/Laws.hs:74)
  1178. 72.59 s [duoids] Documentation created: dist/doc/html/duoids/, dist/doc/html/duoids/duoids.txt
  1179. 72.68 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  1180. 72.68 s [duoids] Phase: installPhase
  1181. 72.72 s [duoids] Installing library in /nix/store/yf2y3v8v55lh1mnzpczwv22550aq3c5j-duoids-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-65e9/duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW
  1182. 73.17 s [duoids] Phase: fixupPhase
  1183. 73.20 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/yf2y3v8v55lh1mnzpczwv22550aq3c5j-duoids-0.0.1.0
  1184. 73.22 s [duoids] shrinking /nix/store/yf2y3v8v55lh1mnzpczwv22550aq3c5j-duoids-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-65e9/libHSduoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW-ghc9.8.4.so
  1185. 73.24 s [duoids] checking for references to /build/ in /nix/store/yf2y3v8v55lh1mnzpczwv22550aq3c5j-duoids-0.0.1.0...
  1186. 73.26 s [duoids] patching script interpreter paths in /nix/store/yf2y3v8v55lh1mnzpczwv22550aq3c5j-duoids-0.0.1.0
  1187. 73.27 s [duoids] stripping (with command strip and flags -S -p) in /nix/store/yf2y3v8v55lh1mnzpczwv22550aq3c5j-duoids-0.0.1.0/lib
  1188. 73.57 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/x46zwg5cnl417fmf73sw94vq9zzhar0i-duoids-0.0.1.0-doc
  1189. 73.58 s [duoids] checking for references to /build/ in /nix/store/x46zwg5cnl417fmf73sw94vq9zzhar0i-duoids-0.0.1.0-doc...
  1190. 73.59 s [duoids] patching script interpreter paths in /nix/store/x46zwg5cnl417fmf73sw94vq9zzhar0i-duoids-0.0.1.0-doc
  1191. 73.75 s [duoids:post-build] Uploading to cachix cache "sellout": /nix/store/x46zwg5cnl417fmf73sw94vq9zzhar0i-duoids-0.0.1.0-doc /nix/store/yf2y3v8v55lh1mnzpczwv22550aq3c5j-duoids-0.0.1.0
  1192. 74.34 s [duoids:post-build] Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
  1193. 74.34 s [duoids:post-build]
  1194. 74.78 s [duoids:post-build] Pushing /nix/store/x46zwg5cnl417fmf73sw94vq9zzhar0i-duoids-0.0.1.0-doc (2.08 MiB)
  1195. 74.81 s [duoids:post-build] Pushing /nix/store/yf2y3v8v55lh1mnzpczwv22550aq3c5j-duoids-0.0.1.0 (7.87 MiB)
  1196. 75.93 s [duoids:post-build]
  1197. 75.93 s [duoids:post-build] All done.
  1198. 75.95 s [duoids:post-build] Uploading to the NixCI cache: /nix/store/x46zwg5cnl417fmf73sw94vq9zzhar0i-duoids-0.0.1.0-doc /nix/store/yf2y3v8v55lh1mnzpczwv22550aq3c5j-duoids-0.0.1.0
  1199. 76.01 s [duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1200. 76.05 s [duoids:post-build] copying 2 paths...
  1201. 76.05 s [duoids:post-build] copying path '/nix/store/x46zwg5cnl417fmf73sw94vq9zzhar0i-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  1202. 77.50 s [duoids:post-build] copying path '/nix/store/yf2y3v8v55lh1mnzpczwv22550aq3c5j-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  1203. 79.84 s [duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1204. 80.14 s [duoids:post-build] copying 8 paths...
  1205. 80.18 s [duoids:post-build] copying path '/nix/store/w8a9zv4glrncfrsj63nmga8s8pqhydd0-Cabal-3.12.1.0.tar.gz.drv' to 'https://cache.nix-ci.com'...
  1206. 80.18 s [duoids:post-build] copying path '/nix/store/66i0dqdv2088fqf5lhpd8nprlw6l0hy0-Cabal-syntax-3.12.1.0.tar.gz.drv' to 'https://cache.nix-ci.com'...
  1207. 81.15 s [duoids:post-build] copying path '/nix/store/d5sbr7mjjzrl49miq44yawzgbmjbzypp-Cabal-syntax-3.12.1.0.drv' to 'https://cache.nix-ci.com'...
  1208. 81.72 s [duoids:post-build] copying path '/nix/store/j7kxpdy36hafzi2v5xx51ipw5g2wdd6b-Cabal-3.12.1.0.drv' to 'https://cache.nix-ci.com'...
  1209. 81.93 s [duoids:post-build] copying path '/nix/store/v2yb68js3nyacbyf6hkm95shk1q2i73p-cabal-doctest-1.0.11.drv' to 'https://cache.nix-ci.com'...
  1210. 81.93 s [duoids:post-build] copying path '/nix/store/39np5xwsdravaj04z2spcl7f7vm1f22d-ghc-paths-0.1.0.12.drv' to 'https://cache.nix-ci.com'...
  1211. 82.17 s [duoids:post-build] copying path '/nix/store/xqlmzravqxqw18gf051m7hnf6mflrsyz-doctest-0.22.6.drv' to 'https://cache.nix-ci.com'...
  1212. 82.38 s [duoids:post-build] copying path '/nix/store/77mqnqcq3cmvbwsahhgpkhiay89afl0k-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  1213. 82.62 s Progress: 3 of 19 built (1 building), 193 of 193 downloaded from cache
  1214. 82.68 s Building /nix/store/il05hia28vwb7vrpc8w72q3h36n84q38-duoidal-transformers-0.0.1.0.drv
  1215. 82.73 s Building /nix/store/z8a8kp7lbv96j5vi1fw1n7jpq57afjlp-duoids-hedgehog-0.0.1.0.drv
  1216. 82.73 s [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 )
  1217. 82.73 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
  1218. 82.77 s [duoidal-transformers] Phase: setupCompilerEnvironmentPhase
  1219. 82.78 s [duoidal-transformers] Build with /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4.
  1220. 82.90 s [duoids-hedgehog] Phase: setupCompilerEnvironmentPhase
  1221. 82.90 s [duoids-hedgehog] Build with /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4.
  1222. 82.94 s [duoidal-transformers] Phase: unpackPhase
  1223. 82.94 s [duoidal-transformers] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./transformers
  1224. 82.95 s [duoidal-transformers] source root is transformers
  1225. 82.96 s [duoidal-transformers] Phase: patchPhase
  1226. 82.96 s [duoidal-transformers] Phase: compileBuildDriverPhase
  1227. 82.97 s [duoidal-transformers] setupCompileFlags: -package-db=/build/tmp.wtGRjDerbt/setup-package.conf.d -threaded
  1228. 83.03 s [duoidal-transformers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.wtGRjDerbt/Main.o )
  1229. 83.09 s [duoidal-transformers] [2 of 2] Linking Setup
  1230. 83.13 s [duoids-hedgehog] Phase: unpackPhase
  1231. 83.14 s [duoids-hedgehog] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./hedgehog
  1232. 83.14 s [duoids-hedgehog] source root is hedgehog
  1233. 83.15 s [duoids-hedgehog] Phase: patchPhase
  1234. 83.16 s [duoids-hedgehog] Phase: compileBuildDriverPhase
  1235. 83.17 s [duoids-hedgehog] setupCompileFlags: -package-db=/build/tmp.88G6XkWRSu/setup-package.conf.d -threaded
  1236. 83.23 s [duoids-hedgehog] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.88G6XkWRSu/Main.o )
  1237. 83.28 s [duoids-hedgehog] [2 of 2] Linking Setup
  1238. 84.62 s [duoidal-transformers] Phase: updateAutotoolsGnuConfigScriptsPhase
  1239. 84.65 s [duoidal-transformers] Phase: configurePhase
  1240. 84.69 s [duoidal-transformers] configureFlags: --verbose --prefix=/nix/store/mds268rc67f03n2msm7vmcqk2zdhrjyy-duoidal-transformers-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/nv2kl2l63kalrn9wwvk806a951n1ys68-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.wtGRjDerbt/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/lib
  1241. 84.71 s [duoidal-transformers] Using Parsec parser
  1242. 84.71 s [duoidal-transformers] Configuring duoidal-transformers-0.0.1.0...
  1243. 85.00 s [duoids-hedgehog] Phase: updateAutotoolsGnuConfigScriptsPhase
  1244. 85.05 s [duoids-hedgehog] Phase: configurePhase
  1245. 85.05 s [duoids-hedgehog] configureFlags: --verbose --prefix=/nix/store/xcidrcs0wxz6r6pw7xcxs83akrkddri9-duoids-hedgehog-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/md0247ww7p3rba73wix10y10fq9gvhj7-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.88G6XkWRSu/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/lib
  1246. 85.08 s [duoids-hedgehog] Using Parsec parser
  1247. 85.08 s [duoids-hedgehog] Configuring duoids-hedgehog-0.0.1.0...
  1248. 85.59 s [duoidal-transformers] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  1249. 86.40 s [duoids-hedgehog] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  1250. 86.52 s [duoidal-transformers] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  1251. 86.52 s [duoidal-transformers] >=4.21.0 && <4.22: using base-4.19.2.0
  1252. 86.52 s [duoidal-transformers] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  1253. 86.52 s [duoidal-transformers] Dependency transformers >=0.6.1 && <0.7: using transformers-0.6.1.0
  1254. 86.52 s [duoidal-transformers] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  1255. 86.52 s [duoidal-transformers] >=4.21.0 && <4.22: using base-4.19.2.0
  1256. 86.52 s [duoidal-transformers] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  1257. 86.52 s [duoidal-transformers] <0.25: using doctest-0.22.6
  1258. 86.52 s [duoidal-transformers] Dependency duoidal-transformers: using duoidal-transformers-0.0.1.0
  1259. 86.52 s [duoidal-transformers] Source component graph:
  1260. 86.52 s [duoidal-transformers] component lib
  1261. 86.52 s [duoidal-transformers] component test:doctests dependency lib
  1262. 86.52 s [duoidal-transformers] Configured component graph:
  1263. 86.52 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-UuQrHBGFzpGSiYG0scn3f
  1264. 86.52 s [duoidal-transformers] include base-4.19.2.0-0fde
  1265. 86.52 s [duoidal-transformers] include duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW
  1266. 86.52 s [duoidal-transformers] include transformers-0.6.1.0-f128
  1267. 86.53 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-28l0ychB9zz5AJh969MI3j-doctests
  1268. 86.53 s [duoidal-transformers] include base-4.19.2.0-0fde
  1269. 86.53 s [duoidal-transformers] include doctest-0.22.6-1SxYZzGcAV168a12vQnyDt
  1270. 86.53 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-UuQrHBGFzpGSiYG0scn3f
  1271. 86.53 s [duoidal-transformers] Linked component graph:
  1272. 86.53 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-UuQrHBGFzpGSiYG0scn3f
  1273. 86.53 s [duoidal-transformers] include base-4.19.2.0-0fde
  1274. 86.53 s [duoidal-transformers] include duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW
  1275. 86.53 s [duoidal-transformers] include transformers-0.6.1.0-f128
  1276. 86.53 s [duoidal-transformers] Control.Duoidal.Trans.Class=duoidal-transformers-0.0.1.0-UuQrHBGFzpGSiYG0scn3f:Control.Duoidal.Trans.Class,Control.Duoidal.Trans.Orphans=duoidal-transformers-0.0.1.0-UuQrHBGFzpGSiYG0scn3f:Control.Duoidal.Trans.Orphans
  1277. 86.53 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-28l0ychB9zz5AJh969MI3j-doctests
  1278. 86.53 s [duoidal-transformers] include base-4.19.2.0-0fde
  1279. 86.53 s [duoidal-transformers] include doctest-0.22.6-1SxYZzGcAV168a12vQnyDt
  1280. 86.53 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-UuQrHBGFzpGSiYG0scn3f
  1281. 86.53 s [duoidal-transformers] Ready component graph:
  1282. 86.53 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-UuQrHBGFzpGSiYG0scn3f
  1283. 86.53 s [duoidal-transformers] depends base-4.19.2.0-0fde
  1284. 86.53 s [duoidal-transformers] depends duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW
  1285. 86.53 s [duoidal-transformers] depends transformers-0.6.1.0-f128
  1286. 86.53 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-28l0ychB9zz5AJh969MI3j-doctests
  1287. 86.53 s [duoidal-transformers] depends base-4.19.2.0-0fde
  1288. 86.53 s [duoidal-transformers] depends doctest-0.22.6-1SxYZzGcAV168a12vQnyDt
  1289. 86.53 s [duoidal-transformers] depends duoidal-transformers-0.0.1.0-UuQrHBGFzpGSiYG0scn3f
  1290. 86.53 s [duoidal-transformers] Using Cabal-3.12.1.0 compiled by ghc-9.8
  1291. 86.53 s [duoidal-transformers] Using compiler: ghc-9.8.4
  1292. 86.53 s [duoidal-transformers] Using install prefix:
  1293. 86.53 s [duoidal-transformers] /nix/store/mds268rc67f03n2msm7vmcqk2zdhrjyy-duoidal-transformers-0.0.1.0
  1294. 86.53 s [duoidal-transformers] Executables installed in:
  1295. 86.53 s [duoidal-transformers] /nix/store/mds268rc67f03n2msm7vmcqk2zdhrjyy-duoidal-transformers-0.0.1.0/bin
  1296. 86.53 s [duoidal-transformers] Libraries installed in:
  1297. 86.53 s [duoidal-transformers] /nix/store/mds268rc67f03n2msm7vmcqk2zdhrjyy-duoidal-transformers-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-65e9/duoidal-transformers-0.0.1.0-UuQrHBGFzpGSiYG0scn3f
  1298. 86.53 s [duoidal-transformers] Dynamic Libraries installed in:
  1299. 86.53 s [duoidal-transformers] /nix/store/mds268rc67f03n2msm7vmcqk2zdhrjyy-duoidal-transformers-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-65e9
  1300. 86.53 s [duoidal-transformers] Private executables installed in:
  1301. 86.53 s [duoidal-transformers] /nix/store/mds268rc67f03n2msm7vmcqk2zdhrjyy-duoidal-transformers-0.0.1.0/libexec/x86_64-linux-ghc-9.8.4-65e9/duoidal-transformers-0.0.1.0
  1302. 86.53 s [duoidal-transformers] Data files installed in:
  1303. 86.53 s [duoidal-transformers] /nix/store/mds268rc67f03n2msm7vmcqk2zdhrjyy-duoidal-transformers-0.0.1.0/share/x86_64-linux-ghc-9.8.4-65e9/duoidal-transformers-0.0.1.0
  1304. 86.53 s [duoidal-transformers] Documentation installed in:
  1305. 86.53 s [duoidal-transformers] /nix/store/nv2kl2l63kalrn9wwvk806a951n1ys68-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0
  1306. 86.53 s [duoidal-transformers] Configuration files installed in:
  1307. 86.53 s [duoidal-transformers] /nix/store/mds268rc67f03n2msm7vmcqk2zdhrjyy-duoidal-transformers-0.0.1.0/etc
  1308. 86.53 s [duoidal-transformers] No alex found
  1309. 86.53 s [duoidal-transformers] Using ar found on system at:
  1310. 86.53 s [duoidal-transformers] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  1311. 86.53 s [duoidal-transformers] No c2hs found
  1312. 86.53 s [duoidal-transformers] No cpphs found
  1313. 86.53 s [duoidal-transformers] Using doctest version 0.22.6 found on system at:
  1314. 86.53 s [duoidal-transformers] /nix/store/h8km0wljqv9v9b70lmcsxafwlrlbzw3q-doctest-0.22.6/bin/doctest
  1315. 86.53 s [duoidal-transformers] Using gcc version 14.3.0 given by user at:
  1316. 86.53 s [duoidal-transformers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  1317. 86.53 s [duoidal-transformers] Using ghc version 9.8.4 found on system at:
  1318. 86.53 s [duoidal-transformers] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc
  1319. 86.53 s [duoidal-transformers] Using ghc-pkg version 9.8.4 found on system at:
  1320. 86.53 s [duoidal-transformers] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc-pkg-9.8.4
  1321. 86.53 s [duoidal-transformers] No ghcjs found
  1322. 86.53 s [duoidal-transformers] No ghcjs-pkg found
  1323. 86.53 s [duoidal-transformers] No greencard found
  1324. 86.53 s [duoidal-transformers] Using haddock version 2.30.0 found on system at:
  1325. 86.53 s [duoidal-transformers] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/haddock-ghc-9.8.4
  1326. 86.53 s [duoidal-transformers] No happy found
  1327. 86.53 s [duoidal-transformers] Using haskell-suite found on system at: haskell-suite-dummy-location
  1328. 86.53 s [duoidal-transformers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1329. 86.53 s [duoidal-transformers] No hmake found
  1330. 86.53 s [duoidal-transformers] Using hpc version 0.69 found on system at:
  1331. 86.53 s [duoidal-transformers] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hpc-ghc-9.8.4
  1332. 86.53 s [duoidal-transformers] Using hsc2hs version 0.68.10 found on system at:
  1333. 86.53 s [duoidal-transformers] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  1334. 86.53 s [duoidal-transformers] Using hscolour version 1.25 found on system at:
  1335. 86.53 s [duoidal-transformers] /nix/store/r9acd8dqp6xxbhlplifjikwk7bc6w7vf-hscolour-1.25/bin/HsColour
  1336. 86.53 s [duoidal-transformers] No jhc found
  1337. 86.53 s [duoidal-transformers] Using ld found on system at:
  1338. 86.53 s [duoidal-transformers] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  1339. 86.53 s [duoidal-transformers] No pkg-config found
  1340. 86.53 s [duoidal-transformers] Using runghc version 9.8.4 found on system at:
  1341. 86.53 s [duoidal-transformers] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/runghc-9.8.4
  1342. 86.53 s [duoidal-transformers] Using strip version 2.44 found on system at:
  1343. 86.53 s [duoidal-transformers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  1344. 86.53 s [duoidal-transformers] Using tar found on system at:
  1345. 86.53 s [duoidal-transformers] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  1346. 86.53 s [duoidal-transformers] No uhc found
  1347. 86.95 s [duoidal-transformers] Phase: buildPhase
  1348. 87.04 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  1349. 87.04 s [duoidal-transformers] Building library for duoidal-transformers-0.0.1.0...
  1350. 87.31 s [duoidal-transformers] [1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, dist/build/Control/Duoidal/Trans/Class.o, dist/build/Control/Duoidal/Trans/Class.dyn_o )
  1351. 87.44 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  1352. 87.44 s [duoids-hedgehog] >=4.21.0 && <4.22: using base-4.19.2.0
  1353. 87.44 s [duoids-hedgehog] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  1354. 87.44 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  1355. 87.44 s [duoids-hedgehog] hedgehog-1.5
  1356. 87.44 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  1357. 87.44 s [duoids-hedgehog] >=4.21.0 && <4.22: using base-4.19.2.0
  1358. 87.44 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  1359. 87.44 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  1360. 87.44 s [duoids-hedgehog] hedgehog-1.5
  1361. 87.44 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  1362. 87.44 s [duoids-hedgehog] >=4.21.0 && <4.22: using base-4.19.2.0
  1363. 87.44 s [duoids-hedgehog] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  1364. 87.44 s [duoids-hedgehog] <0.25: using doctest-0.22.6
  1365. 87.44 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  1366. 87.44 s [duoids-hedgehog] Source component graph:
  1367. 87.44 s [duoids-hedgehog] component lib
  1368. 87.44 s [duoids-hedgehog] component test:doctests dependency lib
  1369. 87.44 s [duoids-hedgehog] component test:laws dependency lib
  1370. 87.44 s [duoids-hedgehog] Configured component graph:
  1371. 87.44 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-Bw08evgX6HDE1CE4MFJXj4
  1372. 87.44 s [duoids-hedgehog] include base-4.19.2.0-0fde
  1373. 87.44 s [duoids-hedgehog] include duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW
  1374. 87.44 s [duoids-hedgehog] include hedgehog-1.5-Cya8Y6QE8FkF1j7fe2PPQ4
  1375. 87.44 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-2H53GygNZdC6mQyDqeOoHy-doctests
  1376. 87.45 s [duoids-hedgehog] include base-4.19.2.0-0fde
  1377. 87.45 s [duoids-hedgehog] include doctest-0.22.6-1SxYZzGcAV168a12vQnyDt
  1378. 87.45 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-Bw08evgX6HDE1CE4MFJXj4
  1379. 87.45 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-AK5JP7U11g8GLPGwWkZa1T-laws
  1380. 87.45 s [duoids-hedgehog] include base-4.19.2.0-0fde
  1381. 87.45 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-Bw08evgX6HDE1CE4MFJXj4
  1382. 87.45 s [duoids-hedgehog] include hedgehog-1.5-Cya8Y6QE8FkF1j7fe2PPQ4
  1383. 87.45 s [duoids-hedgehog] Linked component graph:
  1384. 87.45 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-Bw08evgX6HDE1CE4MFJXj4
  1385. 87.45 s [duoids-hedgehog] include base-4.19.2.0-0fde
  1386. 87.45 s [duoids-hedgehog] include duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW
  1387. 87.45 s [duoids-hedgehog] include hedgehog-1.5-Cya8Y6QE8FkF1j7fe2PPQ4
  1388. 87.45 s [duoids-hedgehog] Test.Duoid=duoids-hedgehog-0.0.1.0-Bw08evgX6HDE1CE4MFJXj4:Test.Duoid,Test.Duoidal=duoids-hedgehog-0.0.1.0-Bw08evgX6HDE1CE4MFJXj4:Test.Duoidal
  1389. 87.45 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-2H53GygNZdC6mQyDqeOoHy-doctests
  1390. 87.45 s [duoids-hedgehog] include base-4.19.2.0-0fde
  1391. 87.45 s [duoids-hedgehog] include doctest-0.22.6-1SxYZzGcAV168a12vQnyDt
  1392. 87.45 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-Bw08evgX6HDE1CE4MFJXj4
  1393. 87.45 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-AK5JP7U11g8GLPGwWkZa1T-laws
  1394. 87.45 s [duoids-hedgehog] include base-4.19.2.0-0fde
  1395. 87.45 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-Bw08evgX6HDE1CE4MFJXj4
  1396. 87.45 s [duoids-hedgehog] include hedgehog-1.5-Cya8Y6QE8FkF1j7fe2PPQ4
  1397. 87.45 s [duoids-hedgehog] Ready component graph:
  1398. 87.45 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-Bw08evgX6HDE1CE4MFJXj4
  1399. 87.45 s [duoids-hedgehog] depends base-4.19.2.0-0fde
  1400. 87.45 s [duoids-hedgehog] depends duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW
  1401. 87.45 s [duoids-hedgehog] depends hedgehog-1.5-Cya8Y6QE8FkF1j7fe2PPQ4
  1402. 87.45 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-AK5JP7U11g8GLPGwWkZa1T-laws
  1403. 87.45 s [duoids-hedgehog] depends base-4.19.2.0-0fde
  1404. 87.45 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-Bw08evgX6HDE1CE4MFJXj4
  1405. 87.45 s [duoids-hedgehog] depends hedgehog-1.5-Cya8Y6QE8FkF1j7fe2PPQ4
  1406. 87.45 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-2H53GygNZdC6mQyDqeOoHy-doctests
  1407. 87.45 s [duoids-hedgehog] depends base-4.19.2.0-0fde
  1408. 87.45 s [duoids-hedgehog] depends doctest-0.22.6-1SxYZzGcAV168a12vQnyDt
  1409. 87.45 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-Bw08evgX6HDE1CE4MFJXj4
  1410. 87.45 s [duoids-hedgehog] Using Cabal-3.12.1.0 compiled by ghc-9.8
  1411. 87.45 s [duoids-hedgehog] Using compiler: ghc-9.8.4
  1412. 87.45 s [duoids-hedgehog] Using install prefix:
  1413. 87.45 s [duoids-hedgehog] /nix/store/xcidrcs0wxz6r6pw7xcxs83akrkddri9-duoids-hedgehog-0.0.1.0
  1414. 87.45 s [duoids-hedgehog] Executables installed in:
  1415. 87.45 s [duoids-hedgehog] /nix/store/xcidrcs0wxz6r6pw7xcxs83akrkddri9-duoids-hedgehog-0.0.1.0/bin
  1416. 87.45 s [duoids-hedgehog] Libraries installed in:
  1417. 87.45 s [duoids-hedgehog] /nix/store/xcidrcs0wxz6r6pw7xcxs83akrkddri9-duoids-hedgehog-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-65e9/duoids-hedgehog-0.0.1.0-Bw08evgX6HDE1CE4MFJXj4
  1418. 87.45 s [duoids-hedgehog] Dynamic Libraries installed in:
  1419. 87.45 s [duoids-hedgehog] /nix/store/xcidrcs0wxz6r6pw7xcxs83akrkddri9-duoids-hedgehog-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-65e9
  1420. 87.45 s [duoids-hedgehog] Private executables installed in:
  1421. 87.45 s [duoids-hedgehog] /nix/store/xcidrcs0wxz6r6pw7xcxs83akrkddri9-duoids-hedgehog-0.0.1.0/libexec/x86_64-linux-ghc-9.8.4-65e9/duoids-hedgehog-0.0.1.0
  1422. 87.45 s [duoids-hedgehog] Data files installed in:
  1423. 87.45 s [duoids-hedgehog] /nix/store/xcidrcs0wxz6r6pw7xcxs83akrkddri9-duoids-hedgehog-0.0.1.0/share/x86_64-linux-ghc-9.8.4-65e9/duoids-hedgehog-0.0.1.0
  1424. 87.45 s [duoids-hedgehog] Documentation installed in:
  1425. 87.45 s [duoids-hedgehog] /nix/store/md0247ww7p3rba73wix10y10fq9gvhj7-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0
  1426. 87.45 s [duoids-hedgehog] Configuration files installed in:
  1427. 87.45 s [duoids-hedgehog] /nix/store/xcidrcs0wxz6r6pw7xcxs83akrkddri9-duoids-hedgehog-0.0.1.0/etc
  1428. 87.45 s [duoids-hedgehog] No alex found
  1429. 87.45 s [duoids-hedgehog] Using ar found on system at:
  1430. 87.45 s [duoids-hedgehog] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  1431. 87.45 s [duoids-hedgehog] No c2hs found
  1432. 87.45 s [duoids-hedgehog] No cpphs found
  1433. 87.45 s [duoids-hedgehog] Using doctest version 0.22.6 found on system at:
  1434. 87.45 s [duoids-hedgehog] /nix/store/h8km0wljqv9v9b70lmcsxafwlrlbzw3q-doctest-0.22.6/bin/doctest
  1435. 87.45 s [duoids-hedgehog] Using gcc version 14.3.0 given by user at:
  1436. 87.45 s [duoids-hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  1437. 87.45 s [duoids-hedgehog] Using ghc version 9.8.4 found on system at:
  1438. 87.45 s [duoids-hedgehog] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc
  1439. 87.45 s [duoids-hedgehog] Using ghc-pkg version 9.8.4 found on system at:
  1440. 87.45 s [duoids-hedgehog] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc-pkg-9.8.4
  1441. 87.45 s [duoids-hedgehog] No ghcjs found
  1442. 87.45 s [duoids-hedgehog] No ghcjs-pkg found
  1443. 87.45 s [duoids-hedgehog] No greencard found
  1444. 87.45 s [duoids-hedgehog] Using haddock version 2.30.0 found on system at:
  1445. 87.45 s [duoids-hedgehog] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/haddock-ghc-9.8.4
  1446. 87.45 s [duoids-hedgehog] No happy found
  1447. 87.45 s [duoids-hedgehog] Using haskell-suite found on system at: haskell-suite-dummy-location
  1448. 87.45 s [duoids-hedgehog] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  1449. 87.45 s [duoids-hedgehog] No hmake found
  1450. 87.45 s [duoids-hedgehog] Using hpc version 0.69 found on system at:
  1451. 87.45 s [duoids-hedgehog] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hpc-ghc-9.8.4
  1452. 87.45 s [duoids-hedgehog] Using hsc2hs version 0.68.10 found on system at:
  1453. 87.45 s [duoids-hedgehog] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  1454. 87.45 s [duoids-hedgehog] Using hscolour version 1.25 found on system at:
  1455. 87.45 s [duoids-hedgehog] /nix/store/r9acd8dqp6xxbhlplifjikwk7bc6w7vf-hscolour-1.25/bin/HsColour
  1456. 87.45 s [duoids-hedgehog] No jhc found
  1457. 87.45 s [duoids-hedgehog] Using ld found on system at:
  1458. 87.45 s [duoids-hedgehog] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  1459. 87.45 s [duoids-hedgehog] No pkg-config found
  1460. 87.45 s [duoids-hedgehog] Using runghc version 9.8.4 found on system at:
  1461. 87.45 s [duoids-hedgehog] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/runghc-9.8.4
  1462. 87.45 s [duoids-hedgehog] Using strip version 2.44 found on system at:
  1463. 87.45 s [duoids-hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  1464. 87.45 s [duoids-hedgehog] Using tar found on system at:
  1465. 87.45 s [duoids-hedgehog] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  1466. 87.45 s [duoids-hedgehog] No uhc found
  1467. 87.61 s [duoidal-transformers] [2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, dist/build/Control/Duoidal/Trans/Orphans.o, dist/build/Control/Duoidal/Trans/Orphans.dyn_o )
  1468. 87.90 s [duoids-hedgehog] Phase: buildPhase
  1469. 88.08 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  1470. 88.08 s [duoids-hedgehog] Building library for duoids-hedgehog-0.0.1.0...
  1471. 88.26 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.o, dist/build/Test/Duoid.dyn_o )
  1472. 88.54 s [duoidal-transformers] [1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, dist/build/Control/Duoidal/Trans/Class.p_o )
  1473. 89.15 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.o, dist/build/Test/Duoidal.dyn_o )
  1474. 89.17 s [duoidal-transformers] [2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, dist/build/Control/Duoidal/Trans/Orphans.p_o )
  1475. 89.59 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.p_o )
  1476. 91.71 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.p_o )
  1477. 92.33 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  1478. 92.33 s [duoidal-transformers] Building test suite 'doctests' for duoidal-transformers-0.0.1.0...
  1479. 92.43 s [duoidal-transformers] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  1480. 92.73 s [duoidal-transformers] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  1481. 92.92 s [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 )
  1482. 92.92 s [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 )
  1483. 92.92 s [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 )
  1484. 92.92 s [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 )
  1485. 92.92 s [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 )
  1486. 93.23 s [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 )
  1487. 93.23 s [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 )
  1488. 93.47 s [duoidal-transformers] [3 of 3] Linking dist/build/doctests/doctests
  1489. 95.83 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  1490. 95.83 s [duoids-hedgehog] Building test suite 'laws' for duoids-hedgehog-0.0.1.0...
  1491. 96.03 s [duoids-hedgehog] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  1492. 97.74 s [duoids-hedgehog] [2 of 2] Linking dist/build/laws/laws
  1493. 99.87 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  1494. 99.91 s [duoids-hedgehog] Building test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  1495. 100.02 s [duoids-hedgehog] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  1496. 100.69 s [duoids-hedgehog] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  1497. 101.45 s [duoids-hedgehog] [3 of 3] Linking dist/build/doctests/doctests
  1498. 101.83 s [duoidal-transformers] Phase: checkPhase
  1499. 102.20 s [duoidal-transformers] Running 1 test suites...
  1500. 102.20 s [duoidal-transformers] Test suite doctests: RUNNING...
  1501. 102.62 s [duoidal-transformers]
  1502. 102.62 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  1503. 102.62 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1504. 102.62 s [duoidal-transformers]
  1505. 102.62 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  1506. 102.62 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1507. 102.62 s [duoidal-transformers]
  1508. 102.62 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  1509. 102.62 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1510. 102.86 s [duoidal-transformers] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  1511. 102.91 s [duoidal-transformers] Test suite doctests: PASS
  1512. 102.91 s [duoidal-transformers] Test suite logged to: dist/test/duoidal-transformers-0.0.1.0-doctests.log
  1513. 102.91 s [duoidal-transformers] 1 of 1 test suites (1 of 1 test cases) passed.
  1514. 102.91 s [duoidal-transformers] Phase: haddockPhase
  1515. 103.63 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  1516. 103.63 s [duoidal-transformers] Running Haddock on library for duoidal-transformers-0.0.1.0...
  1517. 103.83 s [duoidal-transformers] [1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, nothing )
  1518. 103.91 s [duoidal-transformers] [2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, nothing )
  1519. 104.23 s [duoidal-transformers] Haddock coverage:
  1520. 104.23 s [duoidal-transformers] 33% ( 1 / 3) in 'Control.Duoidal.Trans.Class'
  1521. 104.23 s [duoidal-transformers] Missing documentation for:
  1522. 104.23 s [duoidal-transformers] DuoidalTrans (src/Control/Duoidal/Trans/Class.hs:18)
  1523. 104.23 s [duoidal-transformers] NormalTrans (src/Control/Duoidal/Trans/Class.hs:22)
  1524. 104.23 s [duoidal-transformers] 100% ( 1 / 1) in 'Control.Duoidal.Trans.Orphans'
  1525. 105.85 s [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 )
  1526. 107.19 s [duoidal-transformers] Documentation created: dist/doc/html/duoidal-transformers/,
  1527. 107.19 s [duoidal-transformers] dist/doc/html/duoidal-transformers/duoidal-transformers.txt
  1528. 107.28 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  1529. 107.30 s [duoidal-transformers] Phase: installPhase
  1530. 107.38 s [duoidal-transformers] Installing library in /nix/store/mds268rc67f03n2msm7vmcqk2zdhrjyy-duoidal-transformers-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-65e9/duoidal-transformers-0.0.1.0-UuQrHBGFzpGSiYG0scn3f
  1531. 108.13 s [duoids-hedgehog] Phase: checkPhase
  1532. 108.19 s [duoidal-transformers] Phase: fixupPhase
  1533. 108.27 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/mds268rc67f03n2msm7vmcqk2zdhrjyy-duoidal-transformers-0.0.1.0
  1534. 108.27 s [duoidal-transformers] shrinking /nix/store/mds268rc67f03n2msm7vmcqk2zdhrjyy-duoidal-transformers-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-65e9/libHSduoidal-transformers-0.0.1.0-UuQrHBGFzpGSiYG0scn3f-ghc9.8.4.so
  1535. 108.28 s [duoidal-transformers] checking for references to /build/ in /nix/store/mds268rc67f03n2msm7vmcqk2zdhrjyy-duoidal-transformers-0.0.1.0...
  1536. 108.31 s [duoidal-transformers] patching script interpreter paths in /nix/store/mds268rc67f03n2msm7vmcqk2zdhrjyy-duoidal-transformers-0.0.1.0
  1537. 108.32 s [duoidal-transformers] stripping (with command strip and flags -S -p) in /nix/store/mds268rc67f03n2msm7vmcqk2zdhrjyy-duoidal-transformers-0.0.1.0/lib
  1538. 108.51 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/nv2kl2l63kalrn9wwvk806a951n1ys68-duoidal-transformers-0.0.1.0-doc
  1539. 108.53 s [duoidal-transformers] checking for references to /build/ in /nix/store/nv2kl2l63kalrn9wwvk806a951n1ys68-duoidal-transformers-0.0.1.0-doc...
  1540. 108.55 s [duoidal-transformers] patching script interpreter paths in /nix/store/nv2kl2l63kalrn9wwvk806a951n1ys68-duoidal-transformers-0.0.1.0-doc
  1541. 108.81 s [duoidal-transformers:post-build] Uploading to cachix cache "sellout": /nix/store/mds268rc67f03n2msm7vmcqk2zdhrjyy-duoidal-transformers-0.0.1.0 /nix/store/nv2kl2l63kalrn9wwvk806a951n1ys68-duoidal-transformers-0.0.1.0-doc
  1542. 109.98 s [duoidal-transformers:post-build] Pushing 2 paths (68 are already present) using zstd to cache sellout ⏳
  1543. 109.98 s [duoidal-transformers:post-build]
  1544. 110.37 s [duoidal-transformers:post-build] Pushing /nix/store/nv2kl2l63kalrn9wwvk806a951n1ys68-duoidal-transformers-0.0.1.0-doc (343.95 KiB)
  1545. 110.48 s [duoidal-transformers:post-build] Pushing /nix/store/mds268rc67f03n2msm7vmcqk2zdhrjyy-duoidal-transformers-0.0.1.0 (634.49 KiB)
  1546. 111.61 s [duoidal-transformers:post-build]
  1547. 111.61 s [duoidal-transformers:post-build] All done.
  1548. 111.91 s [duoidal-transformers:post-build] Uploading to the NixCI cache: /nix/store/mds268rc67f03n2msm7vmcqk2zdhrjyy-duoidal-transformers-0.0.1.0 /nix/store/nv2kl2l63kalrn9wwvk806a951n1ys68-duoidal-transformers-0.0.1.0-doc
  1549. 112.41 s [duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1550. 112.47 s [duoidal-transformers:post-build] copying 2 paths...
  1551. 112.47 s [duoidal-transformers:post-build] copying path '/nix/store/nv2kl2l63kalrn9wwvk806a951n1ys68-duoidal-transformers-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  1552. 113.12 s [duoidal-transformers:post-build] copying path '/nix/store/mds268rc67f03n2msm7vmcqk2zdhrjyy-duoidal-transformers-0.0.1.0' to 'https://cache.nix-ci.com'...
  1553. 114.15 s [duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1554. 114.49 s [duoidal-transformers:post-build] copying 1 paths...
  1555. 114.49 s [duoidal-transformers:post-build] copying path '/nix/store/il05hia28vwb7vrpc8w72q3h36n84q38-duoidal-transformers-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  1556. 114.99 s Progress: 4 of 18 built (2 building), 193 of 193 downloaded from cache
  1557. 114.99 s [duoids-hedgehog] Running 2 test suites...
  1558. 114.99 s [duoids-hedgehog] Test suite laws: RUNNING...
  1559. 114.99 s [duoids-hedgehog] ━━━ Duoid Int ━━━
  1560. 114.99 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1561. 114.99 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1562. 114.99 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1563. 114.99 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1564. 114.99 s [duoids-hedgehog] ✓ 4 succeeded.
  1565. 114.99 s [duoids-hedgehog] ━━━ Duoid Int16 ━━━
  1566. 114.99 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1567. 114.99 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1568. 114.99 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1569. 114.99 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1570. 114.99 s [duoids-hedgehog] ✓ 4 succeeded.
  1571. 114.99 s [duoids-hedgehog] ━━━ Duoid Int32 ━━━
  1572. 114.99 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1573. 114.99 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1574. 114.99 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1575. 114.99 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1576. 114.99 s [duoids-hedgehog] ✓ 4 succeeded.
  1577. 114.99 s [duoids-hedgehog] ━━━ Duoid Int64 ━━━
  1578. 114.99 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1579. 114.99 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1580. 114.99 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1581. 114.99 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1582. 114.99 s [duoids-hedgehog] ✓ 4 succeeded.
  1583. 114.99 s [duoids-hedgehog] ━━━ Duoid Int8 ━━━
  1584. 114.99 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1585. 114.99 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1586. 114.99 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1587. 114.99 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1588. 114.99 s [duoids-hedgehog] ✓ 4 succeeded.
  1589. 114.99 s [duoids-hedgehog] ━━━ Duoid.Normal Natural ━━━
  1590. 114.99 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1591. 114.99 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1592. 114.99 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1593. 114.99 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1594. 114.99 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1595. 114.99 s [duoids-hedgehog] ✓ 5 succeeded.
  1596. 114.99 s [duoids-hedgehog] ━━━ Duoid.Normal (Ratio Natural) ━━━
  1597. 114.99 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1598. 114.99 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1599. 114.99 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1600. 114.99 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1601. 114.99 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1602. 114.99 s [duoids-hedgehog] ✓ 5 succeeded.
  1603. 114.99 s [duoids-hedgehog] ━━━ Duoid (Ratio Integer) ━━━
  1604. 114.99 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1605. 114.99 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1606. 114.99 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1607. 114.99 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1608. 114.99 s [duoids-hedgehog] ✓ 4 succeeded.
  1609. 114.99 s [duoids-hedgehog] ━━━ Duoid.Normal Word ━━━
  1610. 114.99 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1611. 114.99 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1612. 114.99 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1613. 114.99 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1614. 114.99 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1615. 114.99 s [duoids-hedgehog] ✓ 5 succeeded.
  1616. 114.99 s [duoids-hedgehog] ━━━ Duoid.Normal Word16 ━━━
  1617. 114.99 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1618. 114.99 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1619. 114.99 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1620. 115.00 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1621. 115.00 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1622. 115.00 s [duoids-hedgehog] ✓ 5 succeeded.
  1623. 115.00 s [duoids-hedgehog] ━━━ Duoid.Normal Word32 ━━━
  1624. 115.00 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1625. 115.00 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1626. 115.00 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1627. 115.00 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1628. 115.00 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1629. 115.00 s [duoids-hedgehog] ✓ 5 succeeded.
  1630. 115.00 s [duoids-hedgehog] ━━━ Duoid.Normal Word64 ━━━
  1631. 115.00 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1632. 115.00 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1633. 115.00 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1634. 115.00 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1635. 115.00 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1636. 115.00 s [duoids-hedgehog] ✓ 5 succeeded.
  1637. 115.00 s [duoids-hedgehog] ━━━ Duoid.Normal Word8 ━━━
  1638. 115.00 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1639. 115.00 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1640. 115.00 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1641. 115.00 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1642. 115.00 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1643. 115.00 s [duoids-hedgehog] ✓ 5 succeeded.
  1644. 115.00 s [duoids-hedgehog] Test suite laws: PASS
  1645. 115.00 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-laws.log
  1646. 115.00 s [duoids-hedgehog] Test suite doctests: RUNNING...
  1647. 115.00 s [duoids-hedgehog] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  1648. 115.00 s [duoids-hedgehog] Test suite doctests: PASS
  1649. 115.00 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-doctests.log
  1650. 115.00 s [duoids-hedgehog] 2 of 2 test suites (2 of 2 test cases) passed.
  1651. 115.00 s [duoids-hedgehog] Phase: haddockPhase
  1652. 115.00 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  1653. 115.00 s [duoids-hedgehog] Running Haddock on library for duoids-hedgehog-0.0.1.0...
  1654. 115.00 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, nothing )
  1655. 115.00 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, nothing )
  1656. 115.00 s [duoids-hedgehog] Haddock coverage:
  1657. 115.00 s [duoids-hedgehog] 33% ( 1 / 3) in 'Test.Duoid'
  1658. 115.00 s [duoids-hedgehog] Missing documentation for:
  1659. 115.00 s [duoids-hedgehog] validate (src/Test/Duoid.hs:72)
  1660. 115.00 s [duoids-hedgehog] validateNormal (src/Test/Duoid.hs:82)
  1661. 115.00 s [duoids-hedgehog] 50% ( 1 / 2) in 'Test.Duoidal'
  1662. 115.00 s [duoids-hedgehog] Missing documentation for:
  1663. 115.00 s [duoids-hedgehog] validate (src/Test/Duoidal.hs:98)
  1664. 115.12 s [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 )
  1665. 118.00 s [duoids-hedgehog] Documentation created: dist/doc/html/duoids-hedgehog/,
  1666. 118.00 s [duoids-hedgehog] dist/doc/html/duoids-hedgehog/duoids-hedgehog.txt
  1667. 118.11 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  1668. 118.11 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  1669. 118.12 s [duoids-hedgehog] Phase: installPhase
  1670. 118.26 s [duoids-hedgehog] Installing library in /nix/store/xcidrcs0wxz6r6pw7xcxs83akrkddri9-duoids-hedgehog-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-65e9/duoids-hedgehog-0.0.1.0-Bw08evgX6HDE1CE4MFJXj4
  1671. 118.83 s [duoids-hedgehog] Phase: fixupPhase
  1672. 118.89 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/xcidrcs0wxz6r6pw7xcxs83akrkddri9-duoids-hedgehog-0.0.1.0
  1673. 118.89 s [duoids-hedgehog] shrinking /nix/store/xcidrcs0wxz6r6pw7xcxs83akrkddri9-duoids-hedgehog-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-65e9/libHSduoids-hedgehog-0.0.1.0-Bw08evgX6HDE1CE4MFJXj4-ghc9.8.4.so
  1674. 118.90 s [duoids-hedgehog] checking for references to /build/ in /nix/store/xcidrcs0wxz6r6pw7xcxs83akrkddri9-duoids-hedgehog-0.0.1.0...
  1675. 118.96 s [duoids-hedgehog] patching script interpreter paths in /nix/store/xcidrcs0wxz6r6pw7xcxs83akrkddri9-duoids-hedgehog-0.0.1.0
  1676. 118.97 s [duoids-hedgehog] stripping (with command strip and flags -S -p) in /nix/store/xcidrcs0wxz6r6pw7xcxs83akrkddri9-duoids-hedgehog-0.0.1.0/lib
  1677. 119.09 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/md0247ww7p3rba73wix10y10fq9gvhj7-duoids-hedgehog-0.0.1.0-doc
  1678. 119.11 s [duoids-hedgehog] checking for references to /build/ in /nix/store/md0247ww7p3rba73wix10y10fq9gvhj7-duoids-hedgehog-0.0.1.0-doc...
  1679. 119.12 s [duoids-hedgehog] patching script interpreter paths in /nix/store/md0247ww7p3rba73wix10y10fq9gvhj7-duoids-hedgehog-0.0.1.0-doc
  1680. 119.38 s [duoids-hedgehog:post-build] Uploading to cachix cache "sellout": /nix/store/md0247ww7p3rba73wix10y10fq9gvhj7-duoids-hedgehog-0.0.1.0-doc /nix/store/xcidrcs0wxz6r6pw7xcxs83akrkddri9-duoids-hedgehog-0.0.1.0
  1681. 120.61 s [duoids-hedgehog:post-build] Pushing 2 paths (132 are already present) using zstd to cache sellout ⏳
  1682. 120.61 s [duoids-hedgehog:post-build]
  1683. 120.99 s [duoids-hedgehog:post-build] Pushing /nix/store/md0247ww7p3rba73wix10y10fq9gvhj7-duoids-hedgehog-0.0.1.0-doc (297.07 KiB)
  1684. 121.06 s [duoids-hedgehog:post-build] Pushing /nix/store/xcidrcs0wxz6r6pw7xcxs83akrkddri9-duoids-hedgehog-0.0.1.0 (496.08 KiB)
  1685. 122.25 s [duoids-hedgehog:post-build]
  1686. 122.25 s [duoids-hedgehog:post-build] All done.
  1687. 122.49 s [duoids-hedgehog:post-build] Uploading to the NixCI cache: /nix/store/md0247ww7p3rba73wix10y10fq9gvhj7-duoids-hedgehog-0.0.1.0-doc /nix/store/xcidrcs0wxz6r6pw7xcxs83akrkddri9-duoids-hedgehog-0.0.1.0
  1688. 122.97 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1689. 123.08 s [duoids-hedgehog:post-build] copying 2 paths...
  1690. 123.12 s [duoids-hedgehog:post-build] copying path '/nix/store/md0247ww7p3rba73wix10y10fq9gvhj7-duoids-hedgehog-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  1691. 123.85 s [duoids-hedgehog:post-build] copying path '/nix/store/xcidrcs0wxz6r6pw7xcxs83akrkddri9-duoids-hedgehog-0.0.1.0' to 'https://cache.nix-ci.com'...
  1692. 124.94 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1693. 125.35 s [duoids-hedgehog:post-build] copying 1 paths...
  1694. 125.35 s [duoids-hedgehog:post-build] copying path '/nix/store/z8a8kp7lbv96j5vi1fw1n7jpq57afjlp-duoids-hedgehog-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  1695. 125.97 s Progress: 5 of 17 built (1 building), 193 of 193 downloaded from cache
  1696. 128.20 s [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 )
  1697. 129.48 s [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 )
  1698. 130.02 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
  1699. 130.45 s [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 )
  1700. 130.87 s [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 )
  1701. 130.88 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
  1702. 130.88 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
  1703. 130.88 s [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 )
  1704. 138.00 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
  1705. 141.56 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
  1706. 144.99 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
  1707. 145.62 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
  1708. 156.19 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
  1709. 156.19 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
  1710. 179.80 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
  1711. 179.84 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
  1712. 179.84 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
  1713. 179.84 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
  1714. 179.84 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
  1715. 181.10 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
  1716. 181.10 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
  1717. 189.11 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
  1718. 197.16 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
  1719. 205.05 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
  1720. 206.49 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0..
  1721. 206.49 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0..
  1722. 206.59 s [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 )
  1723. 208.82 s [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 )
  1724. 208.82 s [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 )
  1725. 208.99 s [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 )
  1726. 208.99 s [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 )
  1727. 208.99 s [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 )
  1728. 208.99 s [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 )
  1729. 208.99 s [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 )
  1730. 208.99 s [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 )
  1731. 208.99 s [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 )
  1732. 208.99 s [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 )
  1733. 208.99 s [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 )
  1734. 208.99 s [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 )
  1735. 208.99 s [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 )
  1736. 209.29 s [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 )
  1737. 211.82 s [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 )
  1738. 211.87 s [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 )
  1739. 212.32 s [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 )
  1740. 212.32 s [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 )
  1741. 212.32 s [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 )
  1742. 212.32 s [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 )
  1743. 212.32 s [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 )
  1744. 212.32 s [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 )
  1745. 212.32 s [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 )
  1746. 212.32 s [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 )
  1747. 212.32 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  1748. 212.32 s [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 )
  1749. 212.32 s [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 )
  1750. 214.21 s [vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0..
  1751. 214.21 s [vector] Building test suite 'vector-inspection' for vector-0.13.2.0..
  1752. 214.42 s [vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
  1753. 215.24 s [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 )
  1754. 215.24 s [vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
  1755. 216.63 s [vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
  1756. 217.43 s [vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
  1757. 218.47 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0..
  1758. 218.48 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0..
  1759. 218.60 s [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 )
  1760. 218.74 s [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 )
  1761. 220.03 s [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 )
  1762. 220.03 s [vector]
  1763. 220.03 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  1764. 220.03 s [vector] In the use of ‘tail’
  1765. 220.03 s [vector] (imported from Prelude, but defined in GHC.List):
  1766. 220.03 s [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."
  1767. 220.03 s [vector] |
  1768. 220.03 s [vector] 244 | postscanl f z = tail . scanl f z
  1769. 220.03 s [vector] | ^^^^
  1770. 220.03 s [vector]
  1771. 220.03 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  1772. 220.03 s [vector] In the use of ‘tail’
  1773. 220.03 s [vector] (imported from Prelude, but defined in GHC.List):
  1774. 220.03 s [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."
  1775. 220.03 s [vector] |
  1776. 220.03 s [vector] 245 | prescanr f z = tail . scanr f z
  1777. 220.03 s [vector] | ^^^^
  1778. 220.03 s [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 )
  1779. 220.03 s [vector]
  1780. 220.03 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  1781. 220.03 s [vector] In the use of ‘head’
  1782. 220.03 s [vector] (imported from Data.List, but defined in GHC.List):
  1783. 220.03 s [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."
  1784. 220.03 s [vector] |
  1785. 220.03 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  1786. 220.03 s [vector] | ^^^^
  1787. 220.03 s [vector]
  1788. 220.03 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  1789. 220.03 s [vector] In the use of ‘head’
  1790. 220.03 s [vector] (imported from Data.List, but defined in GHC.List):
  1791. 220.03 s [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."
  1792. 220.03 s [vector] |
  1793. 220.03 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  1794. 220.03 s [vector] | ^^^^
  1795. 220.03 s [vector]
  1796. 220.03 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  1797. 220.03 s [vector] In the use of ‘tail’
  1798. 220.03 s [vector] (imported from Data.List, but defined in GHC.List):
  1799. 220.03 s [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."
  1800. 220.03 s [vector] |
  1801. 220.03 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  1802. 220.03 s [vector] | ^^^^
  1803. 220.03 s [vector]
  1804. 220.03 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  1805. 220.03 s [vector] In the use of ‘head’
  1806. 220.04 s [vector] (imported from Data.List, but defined in GHC.List):
  1807. 220.04 s [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."
  1808. 220.04 s [vector] |
  1809. 220.04 s [vector] 439 | = V.uniq `eq` (map head . group)
  1810. 220.04 s [vector] | ^^^^
  1811. 220.87 s [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 )
  1812. 220.98 s [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 )
  1813. 220.98 s [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 )
  1814. 220.98 s [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 )
  1815. 220.98 s [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 )
  1816. 220.98 s [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 )
  1817. 220.98 s [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 )
  1818. 220.98 s [vector]
  1819. 220.98 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  1820. 220.98 s [vector] In the use of ‘head’
  1821. 220.98 s [vector] (imported from Prelude, but defined in GHC.List):
  1822. 220.98 s [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."
  1823. 220.98 s [vector] |
  1824. 220.98 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  1825. 220.98 s [vector] | ^^^^
  1826. 220.98 s [vector]
  1827. 220.98 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  1828. 220.98 s [vector] In the use of ‘tail’
  1829. 220.98 s [vector] (imported from Prelude, but defined in GHC.List):
  1830. 220.98 s [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."
  1831. 220.98 s [vector] |
  1832. 220.98 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  1833. 220.98 s [vector] | ^^^^
  1834. 220.98 s [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 )
  1835. 221.46 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  1836. 222.50 s [vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0..
  1837. 222.59 s [vector] Building test suite 'vector-doctest' for vector-0.13.2.0..
  1838. 222.59 s [vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
  1839. 222.94 s [vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
  1840. 227.21 s [vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0..
  1841. 227.21 s [vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0..
  1842. 227.33 s [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 )
  1843. 227.50 s [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 )
  1844. 235.93 s [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 )
  1845. 235.97 s [vector]
  1846. 235.97 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  1847. 235.97 s [vector] In the use of ‘tail’
  1848. 235.97 s [vector] (imported from Prelude, but defined in GHC.List):
  1849. 235.97 s [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."
  1850. 235.97 s [vector] |
  1851. 235.97 s [vector] 244 | postscanl f z = tail . scanl f z
  1852. 235.97 s [vector] | ^^^^
  1853. 235.97 s [vector]
  1854. 235.97 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  1855. 235.97 s [vector] In the use of ‘tail’
  1856. 235.97 s [vector] (imported from Prelude, but defined in GHC.List):
  1857. 235.97 s [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."
  1858. 235.97 s [vector] |
  1859. 235.97 s [vector] 245 | prescanr f z = tail . scanr f z
  1860. 235.97 s [vector] | ^^^^
  1861. 235.97 s [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 )
  1862. 235.97 s [vector]
  1863. 235.97 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  1864. 235.97 s [vector] In the use of ‘head’
  1865. 235.97 s [vector] (imported from Data.List, but defined in GHC.List):
  1866. 235.97 s [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."
  1867. 235.97 s [vector] |
  1868. 235.97 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  1869. 235.97 s [vector] | ^^^^
  1870. 235.97 s [vector]
  1871. 235.97 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  1872. 235.97 s [vector] In the use of ‘head’
  1873. 235.97 s [vector] (imported from Data.List, but defined in GHC.List):
  1874. 235.97 s [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."
  1875. 235.97 s [vector] |
  1876. 235.97 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  1877. 235.97 s [vector] | ^^^^
  1878. 235.97 s [vector]
  1879. 235.97 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  1880. 235.97 s [vector] In the use of ‘tail’
  1881. 235.97 s [vector] (imported from Data.List, but defined in GHC.List):
  1882. 235.97 s [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."
  1883. 235.97 s [vector] |
  1884. 235.97 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  1885. 235.97 s [vector] | ^^^^
  1886. 235.97 s [vector]
  1887. 235.97 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  1888. 235.97 s [vector] In the use of ‘head’
  1889. 235.97 s [vector] (imported from Data.List, but defined in GHC.List):
  1890. 235.97 s [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."
  1891. 235.97 s [vector] |
  1892. 235.97 s [vector] 439 | = V.uniq `eq` (map head . group)
  1893. 235.97 s [vector] | ^^^^
  1894. 243.84 s [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 )
  1895. 267.02 s [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 )
  1896. 267.06 s [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 )
  1897. 267.06 s [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 )
  1898. 267.06 s [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 )
  1899. 267.06 s [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 )
  1900. 267.06 s [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 )
  1901. 267.06 s [vector]
  1902. 267.06 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  1903. 267.06 s [vector] In the use of ‘head’
  1904. 267.06 s [vector] (imported from Prelude, but defined in GHC.List):
  1905. 267.06 s [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."
  1906. 267.06 s [vector] |
  1907. 267.06 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  1908. 267.06 s [vector] | ^^^^
  1909. 267.06 s [vector]
  1910. 267.06 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  1911. 267.06 s [vector] In the use of ‘tail’
  1912. 267.06 s [vector] (imported from Prelude, but defined in GHC.List):
  1913. 267.06 s [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."
  1914. 267.06 s [vector] |
  1915. 267.06 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  1916. 267.06 s [vector] | ^^^^
  1917. 267.06 s [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 )
  1918. 267.76 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  1919. 268.74 s [vector] buildPhase completed in 3 minutes 37 seconds
  1920. 268.74 s [vector] Phase: checkPhase
  1921. 268.77 s [vector] Running 2 test suites...
  1922. 268.77 s [vector] Test suite vector-tests-O0: RUNNING...
  1923. 268.96 s [vector] toplevel
  1924. 268.96 s [vector] Data.Vector.Fusion.Bundle
  1925. 268.96 s [vector] fromList.toList == id: OK
  1926. 268.96 s [vector] +++ OK, passed 100 tests.
  1927. 268.96 s [vector] toList.fromList == id: OK
  1928. 268.96 s [vector] +++ OK, passed 100 tests.
  1929. 268.96 s [vector] eq: OK
  1930. 268.96 s [vector] +++ OK, passed 100 tests.
  1931. 268.96 s [vector] length: OK
  1932. 268.96 s [vector] +++ OK, passed 100 tests.
  1933. 268.96 s [vector] null: OK
  1934. 268.96 s [vector] +++ OK, passed 100 tests.
  1935. 268.96 s [vector] empty: OK
  1936. 268.96 s [vector] +++ OK, passed 1 test.
  1937. 268.96 s [vector] singleton: OK
  1938. 268.96 s [vector] +++ OK, passed 100 tests.
  1939. 268.96 s [vector] replicate: OK
  1940. 268.96 s [vector] +++ OK, passed 100 tests.
  1941. 268.96 s [vector] cons: OK
  1942. 268.96 s [vector] +++ OK, passed 100 tests.
  1943. 268.96 s [vector] snoc: OK
  1944. 268.96 s [vector] +++ OK, passed 100 tests.
  1945. 268.96 s [vector] append: OK
  1946. 268.96 s [vector] +++ OK, passed 100 tests.
  1947. 268.96 s [vector] head: OK
  1948. 268.96 s [vector] +++ OK, passed 100 tests; 20 discarded.
  1949. 268.96 s [vector] last: OK
  1950. 268.96 s [vector] +++ OK, passed 100 tests; 11 discarded.
  1951. 268.96 s [vector] index: OK
  1952. 268.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1953. 268.96 s [vector] extract: OK
  1954. 268.96 s [vector] +++ OK, passed 100 tests.
  1955. 268.96 s [vector] init: OK
  1956. 268.97 s [vector] +++ OK, passed 100 tests; 18 discarded.
  1957. 268.97 s [vector] tail: OK
  1958. 268.97 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1959. 268.97 s [vector] take: OK
  1960. 268.97 s [vector] +++ OK, passed 100 tests.
  1961. 268.97 s [vector] drop: OK
  1962. 268.97 s [vector] +++ OK, passed 100 tests.
  1963. 268.97 s [vector] map: OK
  1964. 268.97 s [vector] +++ OK, passed 100 tests.
  1965. 268.97 s [vector] zipWith: OK
  1966. 268.97 s [vector] +++ OK, passed 100 tests.
  1967. 268.97 s [vector] zipWith3: OK
  1968. 268.97 s [vector] +++ OK, passed 100 tests.
  1969. 268.97 s [vector] filter: OK
  1970. 268.97 s [vector] +++ OK, passed 100 tests.
  1971. 268.97 s [vector] takeWhile: OK
  1972. 268.97 s [vector] +++ OK, passed 100 tests.
  1973. 268.97 s [vector] dropWhile: OK
  1974. 268.97 s [vector] +++ OK, passed 100 tests.
  1975. 268.97 s [vector] elem: OK
  1976. 268.97 s [vector] +++ OK, passed 100 tests.
  1977. 268.97 s [vector] notElem: OK
  1978. 268.97 s [vector] +++ OK, passed 100 tests.
  1979. 268.97 s [vector] find: OK
  1980. 268.97 s [vector] +++ OK, passed 100 tests.
  1981. 268.97 s [vector] findIndex: OK
  1982. 268.97 s [vector] +++ OK, passed 100 tests.
  1983. 268.97 s [vector] foldl: OK
  1984. 268.97 s [vector] +++ OK, passed 100 tests.
  1985. 268.97 s [vector] foldl1: OK
  1986. 268.97 s [vector] +++ OK, passed 100 tests; 11 discarded.
  1987. 268.97 s [vector] foldl': OK
  1988. 268.97 s [vector] +++ OK, passed 100 tests.
  1989. 268.97 s [vector] foldl1': OK
  1990. 268.97 s [vector] +++ OK, passed 100 tests; 18 discarded.
  1991. 268.97 s [vector] foldr: OK
  1992. 268.97 s [vector] +++ OK, passed 100 tests.
  1993. 268.97 s [vector] foldr1: OK
  1994. 268.97 s [vector] +++ OK, passed 100 tests; 18 discarded.
  1995. 268.97 s [vector] prescanl: OK
  1996. 268.97 s [vector] +++ OK, passed 100 tests.
  1997. 268.97 s [vector] prescanl': OK
  1998. 268.97 s [vector] +++ OK, passed 100 tests.
  1999. 268.97 s [vector] postscanl: OK
  2000. 268.97 s [vector] +++ OK, passed 100 tests.
  2001. 268.97 s [vector] postscanl': OK
  2002. 268.97 s [vector] +++ OK, passed 100 tests.
  2003. 268.97 s [vector] scanl: OK
  2004. 268.97 s [vector] +++ OK, passed 100 tests.
  2005. 268.97 s [vector] scanl': OK
  2006. 268.97 s [vector] +++ OK, passed 100 tests.
  2007. 268.97 s [vector] scanl1: OK
  2008. 268.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2009. 268.97 s [vector] scanl1': OK
  2010. 268.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2011. 268.97 s [vector] concatMap: OK
  2012. 268.97 s [vector] +++ OK, passed 100 tests.
  2013. 268.97 s [vector] unfoldr: OK
  2014. 268.97 s [vector] +++ OK, passed 100 tests.
  2015. 268.97 s [vector] and: OK
  2016. 268.97 s [vector] +++ OK, passed 100 tests.
  2017. 268.97 s [vector] or: OK
  2018. 268.97 s [vector] +++ OK, passed 100 tests.
  2019. 268.97 s [vector] Tests.Vector.Boxed
  2020. 268.97 s [vector] Bool
  2021. 268.97 s [vector] fromList.toList == id: OK
  2022. 268.97 s [vector] +++ OK, passed 100 tests.
  2023. 268.97 s [vector] toList.fromList == id: OK
  2024. 268.97 s [vector] +++ OK, passed 100 tests.
  2025. 268.99 s [vector] unstream.stream == id: OK
  2026. 268.99 s [vector] +++ OK, passed 100 tests.
  2027. 268.99 s [vector] stream.unstream == id: OK
  2028. 268.99 s [vector] +++ OK, passed 100 tests.
  2029. 269.00 s [vector] eq: OK
  2030. 269.00 s [vector] +++ OK, passed 100 tests.
  2031. 269.00 s [vector] length: OK
  2032. 269.00 s [vector] +++ OK, passed 100 tests.
  2033. 269.00 s [vector] null: OK
  2034. 269.00 s [vector] +++ OK, passed 100 tests.
  2035. 269.00 s [vector] index: OK
  2036. 269.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2037. 269.00 s [vector] safeIndex: OK
  2038. 269.01 s [vector] +++ OK, passed 100 tests.
  2039. 269.01 s [vector] head: OK
  2040. 269.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2041. 269.01 s [vector] last: OK
  2042. 269.02 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2043. 269.02 s [vector] unsafeIndex: OK
  2044. 269.02 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2045. 269.02 s [vector] unsafeHead: OK
  2046. 269.02 s [vector] +++ OK, passed 100 tests; 23 discarded.
  2047. 269.03 s [vector] unsafeLast: OK
  2048. 269.03 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2049. 269.03 s [vector] slice: OK
  2050. 269.03 s [vector] +++ OK, passed 100 tests.
  2051. 269.04 s [vector] init: OK
  2052. 269.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2053. 269.04 s [vector] tail: OK
  2054. 269.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2055. 269.04 s [vector] take: OK
  2056. 269.04 s [vector] +++ OK, passed 100 tests.
  2057. 269.04 s [vector] drop: OK
  2058. 269.04 s [vector] +++ OK, passed 100 tests.
  2059. 269.04 s [vector] splitAt: OK
  2060. 269.04 s [vector] +++ OK, passed 100 tests.
  2061. 269.04 s [vector] empty: OK
  2062. 269.04 s [vector] +++ OK, passed 1 test.
  2063. 269.04 s [vector] singleton: OK
  2064. 269.04 s [vector] +++ OK, passed 100 tests.
  2065. 269.04 s [vector] replicate: OK
  2066. 269.04 s [vector] +++ OK, passed 100 tests.
  2067. 269.05 s [vector] generate: OK
  2068. 269.05 s [vector] +++ OK, passed 100 tests.
  2069. 269.05 s [vector] iterateN: OK
  2070. 269.05 s [vector] +++ OK, passed 100 tests.
  2071. 269.05 s [vector] iterateNM: OK (0.05s)
  2072. 269.05 s [vector] +++ OK, passed 100 tests.
  2073. 269.05 s [vector] generateM: OK
  2074. 269.05 s [vector] +++ OK, passed 100 tests.
  2075. 269.05 s [vector] replicateM: OK
  2076. 269.05 s [vector] +++ OK, passed 100 tests.
  2077. 269.05 s [vector] create: OK
  2078. 269.05 s [vector] +++ OK, passed 100 tests.
  2079. 269.05 s [vector] createT: OK
  2080. 269.05 s [vector] +++ OK, passed 100 tests.
  2081. 269.05 s [vector] unfoldr: OK
  2082. 269.05 s [vector] +++ OK, passed 100 tests.
  2083. 269.05 s [vector] unfoldrN: OK
  2084. 269.05 s [vector] +++ OK, passed 100 tests.
  2085. 269.05 s [vector] unfoldrExactN: OK
  2086. 269.05 s [vector] +++ OK, passed 100 tests.
  2087. 269.05 s [vector] unfoldrM: OK
  2088. 269.05 s [vector] +++ OK, passed 100 tests.
  2089. 269.05 s [vector] unfoldrNM: OK
  2090. 269.05 s [vector] +++ OK, passed 100 tests.
  2091. 269.05 s [vector] unfoldrExactNM: OK (0.06s)
  2092. 269.05 s [vector] +++ OK, passed 100 tests.
  2093. 269.05 s [vector] constructN: OK
  2094. 269.05 s [vector] +++ OK, passed 100 tests.
  2095. 269.05 s [vector] constructrN: OK
  2096. 269.05 s [vector] +++ OK, passed 100 tests.
  2097. 269.05 s [vector] cons: OK
  2098. 269.05 s [vector] +++ OK, passed 100 tests.
  2099. 269.05 s [vector] snoc: OK
  2100. 269.06 s [vector] +++ OK, passed 100 tests.
  2101. 269.06 s [vector] append: OK
  2102. 269.06 s [vector] +++ OK, passed 100 tests.
  2103. 269.07 s [vector] concat: OK
  2104. 269.07 s [vector] +++ OK, passed 100 tests.
  2105. 269.07 s [vector] force: OK
  2106. 269.07 s [vector] +++ OK, passed 100 tests.
  2107. 269.07 s [vector] upd: OK
  2108. 269.07 s [vector] +++ OK, passed 100 tests.
  2109. 269.07 s [vector] accum: OK
  2110. 269.07 s [vector] +++ OK, passed 100 tests.
  2111. 269.07 s [vector] reverse: OK
  2112. 269.07 s [vector] +++ OK, passed 100 tests.
  2113. 269.07 s [vector] backpermute: OK
  2114. 269.07 s [vector] +++ OK, passed 100 tests.
  2115. 269.07 s [vector] map: OK
  2116. 269.07 s [vector] +++ OK, passed 100 tests.
  2117. 269.07 s [vector] imap: OK
  2118. 269.07 s [vector] +++ OK, passed 100 tests.
  2119. 269.07 s [vector] concatMap: OK
  2120. 269.07 s [vector] +++ OK, passed 100 tests.
  2121. 269.07 s [vector] mapM: OK
  2122. 269.07 s [vector] +++ OK, passed 100 tests.
  2123. 269.07 s [vector] mapM_: OK (0.01s)
  2124. 269.07 s [vector] +++ OK, passed 100 tests.
  2125. 269.07 s [vector] forM: OK
  2126. 269.07 s [vector] +++ OK, passed 100 tests.
  2127. 269.07 s [vector] forM_: OK (0.01s)
  2128. 269.07 s [vector] +++ OK, passed 100 tests.
  2129. 269.07 s [vector] imapM: OK
  2130. 269.08 s [vector] +++ OK, passed 100 tests.
  2131. 269.08 s [vector] imapM_: OK (0.01s)
  2132. 269.08 s [vector] +++ OK, passed 100 tests.
  2133. 269.08 s [vector] zipWith: OK
  2134. 269.09 s [vector] +++ OK, passed 100 tests.
  2135. 269.09 s [vector] zipWith3: OK
  2136. 269.09 s [vector] +++ OK, passed 100 tests.
  2137. 269.09 s [vector] izipWith: OK
  2138. 269.09 s [vector] +++ OK, passed 100 tests.
  2139. 269.09 s [vector] izipWith3: OK
  2140. 269.09 s [vector] +++ OK, passed 100 tests.
  2141. 269.09 s [vector] izipWithM: OK
  2142. 269.09 s [vector] +++ OK, passed 100 tests.
  2143. 269.09 s [vector] izipWithM_: OK
  2144. 269.09 s [vector] +++ OK, passed 100 tests.
  2145. 269.09 s [vector] zipWithM: OK
  2146. 269.09 s [vector] +++ OK, passed 100 tests.
  2147. 269.10 s [vector] zipWithM_: OK
  2148. 269.10 s [vector] +++ OK, passed 100 tests.
  2149. 269.10 s [vector] filter: OK
  2150. 269.10 s [vector] +++ OK, passed 100 tests.
  2151. 269.11 s [vector] ifilter: OK
  2152. 269.11 s [vector] +++ OK, passed 100 tests.
  2153. 269.13 s [vector] filterM: OK (0.03s)
  2154. 269.13 s [vector] +++ OK, passed 100 tests.
  2155. 269.13 s [vector] uniq: OK
  2156. 269.13 s [vector] +++ OK, passed 100 tests.
  2157. 269.13 s [vector] mapMaybe: OK
  2158. 269.13 s [vector] +++ OK, passed 100 tests.
  2159. 269.13 s [vector] imapMaybe: OK
  2160. 269.13 s [vector] +++ OK, passed 100 tests.
  2161. 269.13 s [vector] takeWhile: OK
  2162. 269.14 s [vector] +++ OK, passed 100 tests.
  2163. 269.14 s [vector] dropWhile: OK
  2164. 269.14 s [vector] +++ OK, passed 100 tests.
  2165. 269.14 s [vector] partition: OK
  2166. 269.14 s [vector] +++ OK, passed 100 tests.
  2167. 269.14 s [vector] partitionWith: OK
  2168. 269.14 s [vector] +++ OK, passed 100 tests.
  2169. 269.14 s [vector] span: OK
  2170. 269.14 s [vector] +++ OK, passed 100 tests.
  2171. 269.14 s [vector] break: OK
  2172. 269.14 s [vector] +++ OK, passed 100 tests.
  2173. 269.14 s [vector] spanR: OK
  2174. 269.14 s [vector] +++ OK, passed 100 tests.
  2175. 269.14 s [vector] breakR: OK
  2176. 269.14 s [vector] +++ OK, passed 100 tests.
  2177. 269.14 s [vector] groupBy: OK
  2178. 269.14 s [vector] +++ OK, passed 100 tests.
  2179. 269.14 s [vector] elem: OK
  2180. 269.14 s [vector] +++ OK, passed 100 tests.
  2181. 269.14 s [vector] notElem: OK
  2182. 269.14 s [vector] +++ OK, passed 100 tests.
  2183. 269.14 s [vector] find: OK
  2184. 269.14 s [vector] +++ OK, passed 100 tests.
  2185. 269.14 s [vector] findIndex: OK
  2186. 269.14 s [vector] +++ OK, passed 100 tests.
  2187. 269.14 s [vector] findIndexR: OK
  2188. 269.15 s [vector] +++ OK, passed 100 tests.
  2189. 269.15 s [vector] findIndices: OK
  2190. 269.15 s [vector] +++ OK, passed 100 tests.
  2191. 269.15 s [vector] elemIndex: OK
  2192. 269.15 s [vector] +++ OK, passed 100 tests.
  2193. 269.15 s [vector] elemIndices: OK
  2194. 269.15 s [vector] +++ OK, passed 100 tests.
  2195. 269.15 s [vector] foldl: OK
  2196. 269.15 s [vector] +++ OK, passed 100 tests.
  2197. 269.15 s [vector] foldl1: OK
  2198. 269.15 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2199. 269.15 s [vector] foldl': OK
  2200. 269.15 s [vector] +++ OK, passed 100 tests.
  2201. 269.15 s [vector] foldl1': OK
  2202. 269.15 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2203. 269.15 s [vector] foldr: OK
  2204. 269.15 s [vector] +++ OK, passed 100 tests.
  2205. 269.15 s [vector] foldr1: OK
  2206. 269.16 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2207. 269.16 s [vector] foldr': OK
  2208. 269.16 s [vector] +++ OK, passed 100 tests.
  2209. 269.16 s [vector] foldr1': OK
  2210. 269.16 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2211. 269.16 s [vector] ifoldl: OK
  2212. 269.16 s [vector] +++ OK, passed 100 tests.
  2213. 269.16 s [vector] ifoldl': OK
  2214. 269.17 s [vector] +++ OK, passed 100 tests.
  2215. 269.17 s [vector] ifoldr: OK
  2216. 269.17 s [vector] +++ OK, passed 100 tests.
  2217. 269.17 s [vector] ifoldr': OK
  2218. 269.17 s [vector] +++ OK, passed 100 tests.
  2219. 269.17 s [vector] ifoldM: OK
  2220. 269.18 s [vector] +++ OK, passed 100 tests.
  2221. 269.19 s [vector] ifoldM': OK
  2222. 269.19 s [vector] +++ OK, passed 100 tests.
  2223. 269.20 s [vector] ifoldM_: OK (0.01s)
  2224. 269.20 s [vector] +++ OK, passed 100 tests.
  2225. 269.21 s [vector] ifoldM'_: OK (0.01s)
  2226. 269.21 s [vector] +++ OK, passed 100 tests.
  2227. 269.21 s [vector] all: OK
  2228. 269.21 s [vector] +++ OK, passed 100 tests.
  2229. 269.21 s [vector] any: OK
  2230. 269.22 s [vector] +++ OK, passed 100 tests.
  2231. 269.22 s [vector] prescanl: OK
  2232. 269.22 s [vector] +++ OK, passed 100 tests.
  2233. 269.22 s [vector] prescanl': OK
  2234. 269.22 s [vector] +++ OK, passed 100 tests.
  2235. 269.22 s [vector] postscanl: OK
  2236. 269.22 s [vector] +++ OK, passed 100 tests.
  2237. 269.22 s [vector] postscanl': OK
  2238. 269.22 s [vector] +++ OK, passed 100 tests.
  2239. 269.22 s [vector] scanl: OK
  2240. 269.22 s [vector] +++ OK, passed 100 tests.
  2241. 269.22 s [vector] scanl': OK
  2242. 269.22 s [vector] +++ OK, passed 100 tests.
  2243. 269.22 s [vector] scanl1: OK
  2244. 269.22 s [vector] +++ OK, passed 100 tests.
  2245. 269.22 s [vector] scanl1': OK
  2246. 269.22 s [vector] +++ OK, passed 100 tests.
  2247. 269.22 s [vector] iscanl: OK
  2248. 269.23 s [vector] +++ OK, passed 100 tests.
  2249. 269.23 s [vector] iscanl': OK
  2250. 269.23 s [vector] +++ OK, passed 100 tests.
  2251. 269.23 s [vector] prescanr: OK
  2252. 269.23 s [vector] +++ OK, passed 100 tests.
  2253. 269.23 s [vector] prescanr': OK
  2254. 269.23 s [vector] +++ OK, passed 100 tests.
  2255. 269.23 s [vector] postscanr: OK
  2256. 269.23 s [vector] +++ OK, passed 100 tests.
  2257. 269.23 s [vector] postscanr': OK
  2258. 269.23 s [vector] +++ OK, passed 100 tests.
  2259. 269.23 s [vector] scanr: OK
  2260. 269.23 s [vector] +++ OK, passed 100 tests.
  2261. 269.23 s [vector] scanr': OK
  2262. 269.23 s [vector] +++ OK, passed 100 tests.
  2263. 269.24 s [vector] scanr1: OK
  2264. 269.24 s [vector] +++ OK, passed 100 tests.
  2265. 269.24 s [vector] scanr1': OK
  2266. 269.24 s [vector] +++ OK, passed 100 tests.
  2267. 269.24 s [vector] iscanr: OK
  2268. 269.24 s [vector] +++ OK, passed 100 tests.
  2269. 269.24 s [vector] iscanr': OK
  2270. 269.24 s [vector] +++ OK, passed 100 tests.
  2271. 269.24 s [vector] mut_read: OK
  2272. 269.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2273. 269.24 s [vector] mut_write: OK
  2274. 269.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2275. 269.24 s [vector] mut_modify: OK
  2276. 269.24 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2277. 269.25 s [vector] mut_generate: OK
  2278. 269.25 s [vector] +++ OK, passed 100 tests.
  2279. 269.26 s [vector] mut_generateM: OK
  2280. 269.27 s [vector] +++ OK, passed 100 tests.
  2281. 269.27 s [vector] mut_mapM_: OK (0.01s)
  2282. 269.27 s [vector] +++ OK, passed 100 tests.
  2283. 269.28 s [vector] mut_imapM_: OK (0.01s)
  2284. 269.29 s [vector] +++ OK, passed 100 tests.
  2285. 269.29 s [vector] mut_forM_: OK
  2286. 269.29 s [vector] +++ OK, passed 100 tests.
  2287. 269.30 s [vector] mut_iforM_: OK (0.01s)
  2288. 269.30 s [vector] +++ OK, passed 100 tests.
  2289. 269.30 s [vector] mut_foldr: OK
  2290. 269.30 s [vector] +++ OK, passed 100 tests.
  2291. 269.30 s [vector] mut_foldr': OK
  2292. 269.31 s [vector] +++ OK, passed 100 tests.
  2293. 269.31 s [vector] mut_foldl: OK
  2294. 269.31 s [vector] +++ OK, passed 100 tests.
  2295. 269.31 s [vector] mut_foldl': OK
  2296. 269.31 s [vector] +++ OK, passed 100 tests.
  2297. 269.31 s [vector] mut_ifoldr: OK
  2298. 269.31 s [vector] +++ OK, passed 100 tests.
  2299. 269.31 s [vector] mut_ifoldr': OK
  2300. 269.31 s [vector] +++ OK, passed 100 tests.
  2301. 269.32 s [vector] mut_ifoldl: OK
  2302. 269.32 s [vector] +++ OK, passed 100 tests.
  2303. 269.32 s [vector] mut_ifoldl': OK
  2304. 269.32 s [vector] +++ OK, passed 100 tests.
  2305. 269.32 s [vector] mut_foldM: OK
  2306. 269.32 s [vector] +++ OK, passed 100 tests.
  2307. 269.32 s [vector] mut_foldM': OK
  2308. 269.32 s [vector] +++ OK, passed 100 tests.
  2309. 269.32 s [vector] mut_foldrM: OK
  2310. 269.32 s [vector] +++ OK, passed 100 tests.
  2311. 269.33 s [vector] mut_foldrM': OK
  2312. 269.33 s [vector] +++ OK, passed 100 tests.
  2313. 269.33 s [vector] mut_ifoldM: OK
  2314. 269.33 s [vector] +++ OK, passed 100 tests.
  2315. 269.33 s [vector] mut_ifoldM': OK
  2316. 269.33 s [vector] +++ OK, passed 100 tests.
  2317. 269.33 s [vector] mut_ifoldrM: OK
  2318. 269.33 s [vector] +++ OK, passed 100 tests.
  2319. 269.34 s [vector] mut_ifoldrM': OK
  2320. 269.34 s [vector] +++ OK, passed 100 tests.
  2321. 269.34 s [vector] compare: OK
  2322. 269.34 s [vector] +++ OK, passed 100 tests.
  2323. 269.34 s [vector] maximum: OK
  2324. 269.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2325. 269.34 s [vector] minimum: OK
  2326. 269.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2327. 269.34 s [vector] minIndex: OK
  2328. 269.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2329. 269.34 s [vector] maxIndex: OK
  2330. 269.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2331. 269.34 s [vector] maximumBy: OK
  2332. 269.34 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2333. 269.34 s [vector] minimumBy: OK
  2334. 269.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2335. 269.34 s [vector] maximumOn: OK
  2336. 269.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2337. 269.34 s [vector] minimumOn: OK
  2338. 269.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2339. 269.34 s [vector] maxIndexBy: OK
  2340. 269.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2341. 269.34 s [vector] minIndexBy: OK
  2342. 269.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2343. 269.34 s [vector] ListFirstMaxIndexWins: OK
  2344. 269.34 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2345. 269.34 s [vector] FalseListFirstMaxIndexWins: OK
  2346. 269.34 s [vector] +++ OK, failed as expected. (after 1 test):
  2347. 269.35 s [vector] Exception:
  2348. 269.35 s [vector] Prelude.foldr1: empty list
  2349. 269.35 s [vector] CallStack (from HasCallStack):
  2350. 269.35 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  2351. 269.35 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  2352. 269.35 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  2353. 269.35 s [vector] []
  2354. 269.35 s [vector] zip: OK
  2355. 269.35 s [vector] +++ OK, passed 100 tests.
  2356. 269.35 s [vector] zip3: OK
  2357. 269.35 s [vector] +++ OK, passed 100 tests.
  2358. 269.35 s [vector] unzip: OK
  2359. 269.35 s [vector] +++ OK, passed 100 tests.
  2360. 269.35 s [vector] unzip3: OK
  2361. 269.35 s [vector] +++ OK, passed 100 tests.
  2362. 269.35 s [vector] indexed: OK
  2363. 269.35 s [vector] +++ OK, passed 100 tests.
  2364. 269.35 s [vector] update: OK
  2365. 269.35 s [vector] +++ OK, passed 100 tests.
  2366. 269.36 s [vector] concat: OK
  2367. 269.36 s [vector] +++ OK, passed 100 tests.
  2368. 269.37 s [vector] mempty: OK
  2369. 269.37 s [vector] +++ OK, passed 1 test.
  2370. 269.37 s [vector] mappend: OK
  2371. 269.37 s [vector] +++ OK, passed 100 tests.
  2372. 269.37 s [vector] mconcat: OK
  2373. 269.37 s [vector] +++ OK, passed 100 tests.
  2374. 269.37 s [vector] fmap: OK
  2375. 269.37 s [vector] +++ OK, passed 100 tests.
  2376. 269.37 s [vector] return: OK
  2377. 269.37 s [vector] +++ OK, passed 100 tests.
  2378. 269.39 s [vector] bind: OK (0.02s)
  2379. 269.39 s [vector] +++ OK, passed 100 tests.
  2380. 269.39 s [vector] mzip: OK
  2381. 269.39 s [vector] +++ OK, passed 100 tests.
  2382. 269.39 s [vector] munzip: OK
  2383. 269.39 s [vector] +++ OK, passed 100 tests.
  2384. 269.39 s [vector] applicative_pure: OK
  2385. 269.39 s [vector] +++ OK, passed 100 tests.
  2386. 269.41 s [vector] applicative_appl: OK (0.02s)
  2387. 269.41 s [vector] +++ OK, passed 100 tests.
  2388. 269.41 s [vector] alternative_empty: OK
  2389. 269.41 s [vector] +++ OK, passed 1 test.
  2390. 269.41 s [vector] alternative_or: OK
  2391. 269.41 s [vector] +++ OK, passed 100 tests.
  2392. 269.45 s [vector] sequence: OK (0.03s)
  2393. 269.45 s [vector] +++ OK, passed 100 tests.
  2394. 269.45 s [vector] sequence_: OK
  2395. 269.45 s [vector] +++ OK, passed 100 tests.
  2396. 269.45 s [vector] glength: OK
  2397. 269.45 s [vector] +++ OK, passed 100 tests.
  2398. 269.45 s [vector] and: OK
  2399. 269.45 s [vector] +++ OK, passed 100 tests.
  2400. 269.45 s [vector] or: OK
  2401. 269.45 s [vector] +++ OK, passed 100 tests.
  2402. 269.45 s [vector] Int
  2403. 269.45 s [vector] fromList.toList == id: OK
  2404. 269.45 s [vector] +++ OK, passed 100 tests.
  2405. 269.45 s [vector] toList.fromList == id: OK
  2406. 269.45 s [vector] +++ OK, passed 100 tests.
  2407. 269.45 s [vector] unstream.stream == id: OK
  2408. 269.45 s [vector] +++ OK, passed 100 tests.
  2409. 269.45 s [vector] stream.unstream == id: OK
  2410. 269.45 s [vector] +++ OK, passed 100 tests.
  2411. 269.45 s [vector] eq: OK
  2412. 269.45 s [vector] +++ OK, passed 100 tests.
  2413. 269.45 s [vector] length: OK
  2414. 269.45 s [vector] +++ OK, passed 100 tests.
  2415. 269.45 s [vector] null: OK
  2416. 269.45 s [vector] +++ OK, passed 100 tests.
  2417. 269.45 s [vector] index: OK
  2418. 269.45 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2419. 269.45 s [vector] safeIndex: OK
  2420. 269.45 s [vector] +++ OK, passed 100 tests.
  2421. 269.45 s [vector] head: OK
  2422. 269.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2423. 269.46 s [vector] last: OK
  2424. 269.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2425. 269.46 s [vector] unsafeIndex: OK
  2426. 269.46 s [vector] +++ OK, passed 100 tests; 21 discarded.
  2427. 269.46 s [vector] unsafeHead: OK
  2428. 269.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2429. 269.46 s [vector] unsafeLast: OK
  2430. 269.46 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2431. 269.46 s [vector] slice: OK
  2432. 269.46 s [vector] +++ OK, passed 100 tests.
  2433. 269.46 s [vector] init: OK
  2434. 269.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2435. 269.46 s [vector] tail: OK
  2436. 269.46 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2437. 269.46 s [vector] take: OK
  2438. 269.46 s [vector] +++ OK, passed 100 tests.
  2439. 269.46 s [vector] drop: OK
  2440. 269.46 s [vector] +++ OK, passed 100 tests.
  2441. 269.46 s [vector] splitAt: OK
  2442. 269.46 s [vector] +++ OK, passed 100 tests.
  2443. 269.46 s [vector] empty: OK
  2444. 269.46 s [vector] +++ OK, passed 1 test.
  2445. 269.46 s [vector] singleton: OK
  2446. 269.46 s [vector] +++ OK, passed 100 tests.
  2447. 269.46 s [vector] replicate: OK
  2448. 269.46 s [vector] +++ OK, passed 100 tests.
  2449. 269.46 s [vector] generate: OK
  2450. 269.46 s [vector] +++ OK, passed 100 tests.
  2451. 269.47 s [vector] iterateN: OK
  2452. 269.47 s [vector] +++ OK, passed 100 tests.
  2453. 269.50 s [vector] iterateNM: OK (0.03s)
  2454. 269.50 s [vector] +++ OK, passed 100 tests.
  2455. 269.51 s [vector] generateM: OK (0.01s)
  2456. 269.51 s [vector] +++ OK, passed 100 tests.
  2457. 269.52 s [vector] replicateM: OK (0.02s)
  2458. 269.52 s [vector] +++ OK, passed 100 tests.
  2459. 269.52 s [vector] create: OK
  2460. 269.52 s [vector] +++ OK, passed 100 tests.
  2461. 269.52 s [vector] createT: OK
  2462. 269.52 s [vector] +++ OK, passed 100 tests.
  2463. 269.52 s [vector] unfoldr: OK
  2464. 269.52 s [vector] +++ OK, passed 100 tests.
  2465. 269.52 s [vector] unfoldrN: OK
  2466. 269.52 s [vector] +++ OK, passed 100 tests.
  2467. 269.52 s [vector] unfoldrExactN: OK
  2468. 269.52 s [vector] +++ OK, passed 100 tests.
  2469. 269.53 s [vector] unfoldrM: OK
  2470. 269.53 s [vector] +++ OK, passed 100 tests.
  2471. 269.53 s [vector] unfoldrNM: OK
  2472. 269.53 s [vector] +++ OK, passed 100 tests.
  2473. 269.55 s [vector] unfoldrExactNM: OK (0.02s)
  2474. 269.56 s [vector] +++ OK, passed 100 tests.
  2475. 269.56 s [vector] constructN: OK
  2476. 269.56 s [vector] +++ OK, passed 100 tests.
  2477. 269.56 s [vector] constructrN: OK
  2478. 269.56 s [vector] +++ OK, passed 100 tests.
  2479. 269.56 s [vector] cons: OK
  2480. 269.56 s [vector] +++ OK, passed 100 tests.
  2481. 269.56 s [vector] snoc: OK
  2482. 269.56 s [vector] +++ OK, passed 100 tests.
  2483. 269.57 s [vector] append: OK
  2484. 269.57 s [vector] +++ OK, passed 100 tests.
  2485. 269.57 s [vector] concat: OK
  2486. 269.57 s [vector] +++ OK, passed 100 tests.
  2487. 269.57 s [vector] force: OK
  2488. 269.57 s [vector] +++ OK, passed 100 tests.
  2489. 269.58 s [vector] upd: OK
  2490. 269.58 s [vector] +++ OK, passed 100 tests.
  2491. 269.58 s [vector] accum: OK
  2492. 269.58 s [vector] +++ OK, passed 100 tests.
  2493. 269.58 s [vector] reverse: OK
  2494. 269.58 s [vector] +++ OK, passed 100 tests.
  2495. 269.58 s [vector] backpermute: OK
  2496. 269.58 s [vector] +++ OK, passed 100 tests.
  2497. 269.58 s [vector] map: OK
  2498. 269.58 s [vector] +++ OK, passed 100 tests.
  2499. 269.59 s [vector] imap: OK
  2500. 269.59 s [vector] +++ OK, passed 100 tests.
  2501. 269.59 s [vector] concatMap: OK
  2502. 269.59 s [vector] +++ OK, passed 100 tests.
  2503. 269.59 s [vector] mapM: OK
  2504. 269.59 s [vector] +++ OK, passed 100 tests.
  2505. 269.60 s [vector] mapM_: OK (0.01s)
  2506. 269.60 s [vector] +++ OK, passed 100 tests.
  2507. 269.60 s [vector] forM: OK
  2508. 269.61 s [vector] +++ OK, passed 100 tests.
  2509. 269.62 s [vector] forM_: OK (0.01s)
  2510. 269.62 s [vector] +++ OK, passed 100 tests.
  2511. 269.62 s [vector] imapM: OK
  2512. 269.63 s [vector] +++ OK, passed 100 tests.
  2513. 269.64 s [vector] imapM_: OK (0.02s)
  2514. 269.64 s [vector] +++ OK, passed 100 tests.
  2515. 269.64 s [vector] zipWith: OK
  2516. 269.64 s [vector] +++ OK, passed 100 tests.
  2517. 269.64 s [vector] zipWith3: OK
  2518. 269.64 s [vector] +++ OK, passed 100 tests.
  2519. 269.65 s [vector] izipWith: OK
  2520. 269.65 s [vector] +++ OK, passed 100 tests.
  2521. 269.65 s [vector] izipWith3: OK
  2522. 269.65 s [vector] +++ OK, passed 100 tests.
  2523. 269.65 s [vector] izipWithM: OK
  2524. 269.65 s [vector] +++ OK, passed 100 tests.
  2525. 269.66 s [vector] izipWithM_: OK
  2526. 269.66 s [vector] +++ OK, passed 100 tests.
  2527. 269.67 s [vector] zipWithM: OK
  2528. 269.67 s [vector] +++ OK, passed 100 tests.
  2529. 269.68 s [vector] zipWithM_: OK (0.01s)
  2530. 269.68 s [vector] +++ OK, passed 100 tests.
  2531. 269.68 s [vector] filter: OK
  2532. 269.68 s [vector] +++ OK, passed 100 tests.
  2533. 269.68 s [vector] ifilter: OK
  2534. 269.69 s [vector] +++ OK, passed 100 tests.
  2535. 269.71 s [vector] filterM: OK (0.02s)
  2536. 269.71 s [vector] +++ OK, passed 100 tests.
  2537. 269.71 s [vector] uniq: OK
  2538. 269.71 s [vector] +++ OK, passed 100 tests.
  2539. 269.71 s [vector] mapMaybe: OK
  2540. 269.71 s [vector] +++ OK, passed 100 tests.
  2541. 269.71 s [vector] imapMaybe: OK
  2542. 269.71 s [vector] +++ OK, passed 100 tests.
  2543. 269.71 s [vector] takeWhile: OK
  2544. 269.71 s [vector] +++ OK, passed 100 tests.
  2545. 269.71 s [vector] dropWhile: OK
  2546. 269.72 s [vector] +++ OK, passed 100 tests.
  2547. 269.72 s [vector] partition: OK
  2548. 269.72 s [vector] +++ OK, passed 100 tests.
  2549. 269.72 s [vector] partitionWith: OK
  2550. 269.72 s [vector] +++ OK, passed 100 tests.
  2551. 269.72 s [vector] span: OK
  2552. 269.72 s [vector] +++ OK, passed 100 tests.
  2553. 269.72 s [vector] break: OK
  2554. 269.72 s [vector] +++ OK, passed 100 tests.
  2555. 269.72 s [vector] spanR: OK
  2556. 269.72 s [vector] +++ OK, passed 100 tests.
  2557. 269.73 s [vector] breakR: OK
  2558. 269.73 s [vector] +++ OK, passed 100 tests.
  2559. 269.73 s [vector] groupBy: OK
  2560. 269.73 s [vector] +++ OK, passed 100 tests.
  2561. 269.73 s [vector] elem: OK
  2562. 269.73 s [vector] +++ OK, passed 100 tests.
  2563. 269.73 s [vector] notElem: OK
  2564. 269.73 s [vector] +++ OK, passed 100 tests.
  2565. 269.73 s [vector] find: OK
  2566. 269.73 s [vector] +++ OK, passed 100 tests.
  2567. 269.73 s [vector] findIndex: OK
  2568. 269.73 s [vector] +++ OK, passed 100 tests.
  2569. 269.73 s [vector] findIndexR: OK
  2570. 269.73 s [vector] +++ OK, passed 100 tests.
  2571. 269.73 s [vector] findIndices: OK
  2572. 269.73 s [vector] +++ OK, passed 100 tests.
  2573. 269.73 s [vector] elemIndex: OK
  2574. 269.73 s [vector] +++ OK, passed 100 tests.
  2575. 269.73 s [vector] elemIndices: OK
  2576. 269.74 s [vector] +++ OK, passed 100 tests.
  2577. 269.74 s [vector] foldl: OK
  2578. 269.74 s [vector] +++ OK, passed 100 tests.
  2579. 269.74 s [vector] foldl1: OK
  2580. 269.74 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2581. 269.75 s [vector] foldl': OK
  2582. 269.75 s [vector] +++ OK, passed 100 tests.
  2583. 269.75 s [vector] foldl1': OK
  2584. 269.76 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2585. 269.76 s [vector] foldr: OK
  2586. 269.77 s [vector] +++ OK, passed 100 tests.
  2587. 269.77 s [vector] foldr1: OK
  2588. 269.77 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2589. 269.78 s [vector] foldr': OK
  2590. 269.78 s [vector] +++ OK, passed 100 tests.
  2591. 269.78 s [vector] foldr1': OK
  2592. 269.78 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2593. 269.78 s [vector] ifoldl: OK
  2594. 269.78 s [vector] +++ OK, passed 100 tests.
  2595. 269.79 s [vector] ifoldl': OK
  2596. 269.79 s [vector] +++ OK, passed 100 tests.
  2597. 269.79 s [vector] ifoldr: OK
  2598. 269.79 s [vector] +++ OK, passed 100 tests.
  2599. 269.79 s [vector] ifoldr': OK
  2600. 269.79 s [vector] +++ OK, passed 100 tests.
  2601. 269.79 s [vector] ifoldM: OK
  2602. 269.79 s [vector] +++ OK, passed 100 tests.
  2603. 269.79 s [vector] ifoldM': OK
  2604. 269.79 s [vector] +++ OK, passed 100 tests.
  2605. 269.81 s [vector] ifoldM_: OK (0.02s)
  2606. 269.81 s [vector] +++ OK, passed 100 tests.
  2607. 269.81 s [vector] ifoldM'_: OK (0.02s)
  2608. 269.81 s [vector] +++ OK, passed 100 tests.
  2609. 269.81 s [vector] all: OK
  2610. 269.81 s [vector] +++ OK, passed 100 tests.
  2611. 269.81 s [vector] any: OK
  2612. 269.81 s [vector] +++ OK, passed 100 tests.
  2613. 269.82 s [vector] prescanl: OK
  2614. 269.82 s [vector] +++ OK, passed 100 tests.
  2615. 269.83 s [vector] prescanl': OK
  2616. 269.83 s [vector] +++ OK, passed 100 tests.
  2617. 269.83 s [vector] postscanl: OK
  2618. 269.83 s [vector] +++ OK, passed 100 tests.
  2619. 269.83 s [vector] postscanl': OK
  2620. 269.83 s [vector] +++ OK, passed 100 tests.
  2621. 269.83 s [vector] scanl: OK
  2622. 269.83 s [vector] +++ OK, passed 100 tests.
  2623. 269.84 s [vector] scanl': OK
  2624. 269.84 s [vector] +++ OK, passed 100 tests.
  2625. 269.84 s [vector] scanl1: OK
  2626. 269.84 s [vector] +++ OK, passed 100 tests.
  2627. 269.84 s [vector] scanl1': OK
  2628. 269.85 s [vector] +++ OK, passed 100 tests.
  2629. 269.85 s [vector] iscanl: OK
  2630. 269.86 s [vector] +++ OK, passed 100 tests.
  2631. 269.86 s [vector] iscanl': OK
  2632. 269.86 s [vector] +++ OK, passed 100 tests.
  2633. 269.86 s [vector] prescanr: OK
  2634. 269.86 s [vector] +++ OK, passed 100 tests.
  2635. 269.86 s [vector] prescanr': OK
  2636. 269.87 s [vector] +++ OK, passed 100 tests.
  2637. 269.87 s [vector] postscanr: OK
  2638. 269.87 s [vector] +++ OK, passed 100 tests.
  2639. 269.87 s [vector] postscanr': OK
  2640. 269.88 s [vector] +++ OK, passed 100 tests.
  2641. 269.88 s [vector] scanr: OK
  2642. 269.88 s [vector] +++ OK, passed 100 tests.
  2643. 269.88 s [vector] scanr': OK
  2644. 269.88 s [vector] +++ OK, passed 100 tests.
  2645. 269.89 s [vector] scanr1: OK
  2646. 269.89 s [vector] +++ OK, passed 100 tests.
  2647. 269.89 s [vector] scanr1': OK
  2648. 269.89 s [vector] +++ OK, passed 100 tests.
  2649. 269.89 s [vector] iscanr: OK
  2650. 269.89 s [vector] +++ OK, passed 100 tests.
  2651. 269.89 s [vector] iscanr': OK
  2652. 269.89 s [vector] +++ OK, passed 100 tests.
  2653. 269.89 s [vector] mut_read: OK
  2654. 269.89 s [vector] +++ OK, passed 100 tests; 10 discarded.
  2655. 269.89 s [vector] mut_write: OK
  2656. 269.89 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2657. 269.90 s [vector] mut_modify: OK
  2658. 269.90 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2659. 269.90 s [vector] mut_generate: OK
  2660. 269.90 s [vector] +++ OK, passed 100 tests.
  2661. 269.91 s [vector] mut_generateM: OK (0.01s)
  2662. 269.91 s [vector] +++ OK, passed 100 tests.
  2663. 269.92 s [vector] mut_mapM_: OK (0.01s)
  2664. 269.92 s [vector] +++ OK, passed 100 tests.
  2665. 269.93 s [vector] mut_imapM_: OK
  2666. 269.93 s [vector] +++ OK, passed 100 tests.
  2667. 269.97 s [vector] mut_forM_: OK (0.02s)
  2668. 269.97 s [vector] +++ OK, passed 100 tests.
  2669. 269.97 s [vector] mut_iforM_: OK (0.02s)
  2670. 269.97 s [vector] +++ OK, passed 100 tests.
  2671. 269.97 s [vector] mut_foldr: OK
  2672. 269.97 s [vector] +++ OK, passed 100 tests.
  2673. 269.97 s [vector] mut_foldr': OK
  2674. 269.97 s [vector] +++ OK, passed 100 tests.
  2675. 269.97 s [vector] mut_foldl: OK
  2676. 269.97 s [vector] +++ OK, passed 100 tests.
  2677. 269.98 s [vector] mut_foldl': OK
  2678. 269.98 s [vector] +++ OK, passed 100 tests.
  2679. 269.98 s [vector] mut_ifoldr: OK
  2680. 269.99 s [vector] +++ OK, passed 100 tests.
  2681. 269.99 s [vector] mut_ifoldr': OK
  2682. 269.99 s [vector] +++ OK, passed 100 tests.
  2683. 269.99 s [vector] mut_ifoldl: OK
  2684. 269.99 s [vector] +++ OK, passed 100 tests.
  2685. 269.99 s [vector] mut_ifoldl': OK
  2686. 269.99 s [vector] +++ OK, passed 100 tests.
  2687. 270.00 s [vector] mut_foldM: OK
  2688. 270.00 s [vector] +++ OK, passed 100 tests.
  2689. 270.00 s [vector] mut_foldM': OK
  2690. 270.01 s [vector] +++ OK, passed 100 tests.
  2691. 270.01 s [vector] mut_foldrM: OK
  2692. 270.01 s [vector] +++ OK, passed 100 tests.
  2693. 270.01 s [vector] mut_foldrM': OK
  2694. 270.01 s [vector] +++ OK, passed 100 tests.
  2695. 270.01 s [vector] mut_ifoldM: OK
  2696. 270.01 s [vector] +++ OK, passed 100 tests.
  2697. 270.01 s [vector] mut_ifoldM': OK
  2698. 270.01 s [vector] +++ OK, passed 100 tests.
  2699. 270.01 s [vector] mut_ifoldrM: OK
  2700. 270.01 s [vector] +++ OK, passed 100 tests.
  2701. 270.01 s [vector] mut_ifoldrM': OK
  2702. 270.01 s [vector] +++ OK, passed 100 tests.
  2703. 270.01 s [vector] compare: OK
  2704. 270.01 s [vector] +++ OK, passed 100 tests.
  2705. 270.01 s [vector] maximum: OK
  2706. 270.01 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2707. 270.02 s [vector] minimum: OK
  2708. 270.02 s [vector] +++ OK, passed 100 tests; 23 discarded.
  2709. 270.02 s [vector] minIndex: OK
  2710. 270.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2711. 270.02 s [vector] maxIndex: OK
  2712. 270.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2713. 270.02 s [vector] maximumBy: OK
  2714. 270.02 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2715. 270.02 s [vector] minimumBy: OK
  2716. 270.02 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2717. 270.02 s [vector] maximumOn: OK
  2718. 270.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2719. 270.02 s [vector] minimumOn: OK
  2720. 270.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2721. 270.02 s [vector] maxIndexBy: OK
  2722. 270.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2723. 270.02 s [vector] minIndexBy: OK
  2724. 270.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2725. 270.02 s [vector] ListFirstMaxIndexWins: OK
  2726. 270.02 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2727. 270.02 s [vector] FalseListFirstMaxIndexWins: OK
  2728. 270.02 s [vector] +++ OK, failed as expected. (after 1 test):
  2729. 270.02 s [vector] Exception:
  2730. 270.02 s [vector] Prelude.foldr1: empty list
  2731. 270.02 s [vector] CallStack (from HasCallStack):
  2732. 270.02 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  2733. 270.02 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  2734. 270.02 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  2735. 270.02 s [vector] []
  2736. 270.03 s [vector] zip: OK
  2737. 270.03 s [vector] +++ OK, passed 100 tests.
  2738. 270.03 s [vector] zip3: OK
  2739. 270.03 s [vector] +++ OK, passed 100 tests.
  2740. 270.03 s [vector] unzip: OK
  2741. 270.03 s [vector] +++ OK, passed 100 tests.
  2742. 270.03 s [vector] unzip3: OK
  2743. 270.03 s [vector] +++ OK, passed 100 tests.
  2744. 270.03 s [vector] indexed: OK
  2745. 270.03 s [vector] +++ OK, passed 100 tests.
  2746. 270.03 s [vector] update: OK
  2747. 270.03 s [vector] +++ OK, passed 100 tests.
  2748. 270.04 s [vector] concat: OK (0.01s)
  2749. 270.04 s [vector] +++ OK, passed 100 tests.
  2750. 270.04 s [vector] mempty: OK
  2751. 270.04 s [vector] +++ OK, passed 1 test.
  2752. 270.05 s [vector] mappend: OK
  2753. 270.05 s [vector] +++ OK, passed 100 tests.
  2754. 270.05 s [vector] mconcat: OK
  2755. 270.05 s [vector] +++ OK, passed 100 tests.
  2756. 270.05 s [vector] fmap: OK
  2757. 270.05 s [vector] +++ OK, passed 100 tests.
  2758. 270.07 s [vector] return: OK
  2759. 270.07 s [vector] +++ OK, passed 100 tests.
  2760. 270.07 s [vector] bind: OK (0.02s)
  2761. 270.07 s [vector] +++ OK, passed 100 tests.
  2762. 270.07 s [vector] mzip: OK
  2763. 270.07 s [vector] +++ OK, passed 100 tests.
  2764. 270.07 s [vector] munzip: OK
  2765. 270.07 s [vector] +++ OK, passed 100 tests.
  2766. 270.07 s [vector] applicative_pure: OK
  2767. 270.07 s [vector] +++ OK, passed 100 tests.
  2768. 270.11 s [vector] applicative_appl: OK (0.02s)
  2769. 270.11 s [vector] +++ OK, passed 100 tests.
  2770. 270.11 s [vector] alternative_empty: OK
  2771. 270.11 s [vector] +++ OK, passed 1 test.
  2772. 270.11 s [vector] alternative_or: OK
  2773. 270.11 s [vector] +++ OK, passed 100 tests.
  2774. 270.15 s [vector] sequence: OK (0.04s)
  2775. 270.15 s [vector] +++ OK, passed 100 tests.
  2776. 270.16 s [vector] sequence_: OK
  2777. 270.16 s [vector] +++ OK, passed 100 tests.
  2778. 270.16 s [vector] glength: OK
  2779. 270.16 s [vector] +++ OK, passed 100 tests.
  2780. 270.16 s [vector] sum: OK
  2781. 270.16 s [vector] +++ OK, passed 100 tests.
  2782. 270.16 s [vector] product: OK
  2783. 270.16 s [vector] +++ OK, passed 100 tests.
  2784. 270.16 s [vector] enumFromN: OK
  2785. 270.16 s [vector] +++ OK, passed 100 tests.
  2786. 270.16 s [vector] enumFromThenN: OK
  2787. 270.16 s [vector] +++ OK, passed 100 tests.
  2788. 270.16 s [vector] enumFromTo: OK
  2789. 270.16 s [vector] +++ OK, passed 100 tests.
  2790. 270.16 s [vector] enumFromThenTo: OK
  2791. 270.16 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2792. 270.16 s [vector] unstream
  2793. 270.16 s [vector] unstream == vunstream (exact): OK
  2794. 270.16 s [vector] +++ OK, passed 100 tests.
  2795. 270.16 s [vector] unstream == vunstream (unknown): OK
  2796. 270.16 s [vector] +++ OK, passed 100 tests.
  2797. 270.16 s [vector] unstreamR ~= vunstream (exact): OK
  2798. 270.16 s [vector] +++ OK, passed 100 tests.
  2799. 270.17 s [vector] unstreamR ~= vunstream (unknown): OK
  2800. 270.17 s [vector] +++ OK, passed 100 tests.
  2801. 270.17 s [vector] Tests.Vector.Primitive
  2802. 270.17 s [vector] Int
  2803. 270.17 s [vector] fromList.toList == id: OK
  2804. 270.17 s [vector] +++ OK, passed 100 tests.
  2805. 270.17 s [vector] toList.fromList == id: OK
  2806. 270.17 s [vector] +++ OK, passed 100 tests.
  2807. 270.17 s [vector] unstream.stream == id: OK
  2808. 270.17 s [vector] +++ OK, passed 100 tests.
  2809. 270.17 s [vector] stream.unstream == id: OK
  2810. 270.17 s [vector] +++ OK, passed 100 tests.
  2811. 270.17 s [vector] eq: OK
  2812. 270.17 s [vector] +++ OK, passed 100 tests.
  2813. 270.17 s [vector] length: OK
  2814. 270.17 s [vector] +++ OK, passed 100 tests.
  2815. 270.17 s [vector] null: OK
  2816. 270.17 s [vector] +++ OK, passed 100 tests.
  2817. 270.17 s [vector] index: OK
  2818. 270.17 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2819. 270.17 s [vector] safeIndex: OK
  2820. 270.17 s [vector] +++ OK, passed 100 tests.
  2821. 270.17 s [vector] head: OK
  2822. 270.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2823. 270.17 s [vector] last: OK
  2824. 270.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2825. 270.17 s [vector] unsafeIndex: OK
  2826. 270.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2827. 270.17 s [vector] unsafeHead: OK
  2828. 270.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2829. 270.17 s [vector] unsafeLast: OK
  2830. 270.18 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2831. 270.18 s [vector] slice: OK
  2832. 270.18 s [vector] +++ OK, passed 100 tests.
  2833. 270.18 s [vector] init: OK
  2834. 270.18 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2835. 270.18 s [vector] tail: OK
  2836. 270.18 s [vector] +++ OK, passed 100 tests; 11 discarded.
  2837. 270.18 s [vector] take: OK
  2838. 270.18 s [vector] +++ OK, passed 100 tests.
  2839. 270.18 s [vector] drop: OK
  2840. 270.18 s [vector] +++ OK, passed 100 tests.
  2841. 270.18 s [vector] splitAt: OK
  2842. 270.18 s [vector] +++ OK, passed 100 tests.
  2843. 270.18 s [vector] empty: OK
  2844. 270.18 s [vector] +++ OK, passed 1 test.
  2845. 270.18 s [vector] singleton: OK
  2846. 270.18 s [vector] +++ OK, passed 100 tests.
  2847. 270.18 s [vector] replicate: OK
  2848. 270.18 s [vector] +++ OK, passed 100 tests.
  2849. 270.18 s [vector] generate: OK
  2850. 270.18 s [vector] +++ OK, passed 100 tests.
  2851. 270.19 s [vector] iterateN: OK
  2852. 270.19 s [vector] +++ OK, passed 100 tests.
  2853. 270.23 s [vector] iterateNM: OK (0.04s)
  2854. 270.23 s [vector] +++ OK, passed 100 tests.
  2855. 270.25 s [vector] generateM: OK (0.03s)
  2856. 270.25 s [vector] +++ OK, passed 100 tests.
  2857. 270.25 s [vector] replicateM: OK
  2858. 270.25 s [vector] +++ OK, passed 100 tests.
  2859. 270.25 s [vector] create: OK
  2860. 270.25 s [vector] +++ OK, passed 100 tests.
  2861. 270.25 s [vector] createT: OK
  2862. 270.25 s [vector] +++ OK, passed 100 tests.
  2863. 270.25 s [vector] unfoldr: OK
  2864. 270.25 s [vector] +++ OK, passed 100 tests.
  2865. 270.25 s [vector] unfoldrN: OK
  2866. 270.26 s [vector] +++ OK, passed 100 tests.
  2867. 270.26 s [vector] unfoldrExactN: OK
  2868. 270.26 s [vector] +++ OK, passed 100 tests.
  2869. 270.26 s [vector] unfoldrM: OK
  2870. 270.27 s [vector] +++ OK, passed 100 tests.
  2871. 270.27 s [vector] unfoldrNM: OK
  2872. 270.27 s [vector] +++ OK, passed 100 tests.
  2873. 270.31 s [vector] unfoldrExactNM: OK (0.04s)
  2874. 270.31 s [vector] +++ OK, passed 100 tests.
  2875. 270.31 s [vector] constructN: OK
  2876. 270.31 s [vector] +++ OK, passed 100 tests.
  2877. 270.31 s [vector] constructrN: OK
  2878. 270.31 s [vector] +++ OK, passed 100 tests.
  2879. 270.31 s [vector] cons: OK
  2880. 270.31 s [vector] +++ OK, passed 100 tests.
  2881. 270.32 s [vector] snoc: OK
  2882. 270.32 s [vector] +++ OK, passed 100 tests.
  2883. 270.33 s [vector] append: OK
  2884. 270.33 s [vector] +++ OK, passed 100 tests.
  2885. 270.33 s [vector] concat: OK (0.02s)
  2886. 270.33 s [vector] +++ OK, passed 100 tests.
  2887. 270.34 s [vector] force: OK
  2888. 270.34 s [vector] +++ OK, passed 100 tests.
  2889. 270.34 s [vector] upd: OK
  2890. 270.34 s [vector] +++ OK, passed 100 tests.
  2891. 270.34 s [vector] accum: OK
  2892. 270.34 s [vector] +++ OK, passed 100 tests.
  2893. 270.34 s [vector] reverse: OK
  2894. 270.34 s [vector] +++ OK, passed 100 tests.
  2895. 270.34 s [vector] backpermute: OK
  2896. 270.34 s [vector] +++ OK, passed 100 tests.
  2897. 270.34 s [vector] map: OK
  2898. 270.34 s [vector] +++ OK, passed 100 tests.
  2899. 270.35 s [vector] imap: OK
  2900. 270.35 s [vector] +++ OK, passed 100 tests.
  2901. 270.35 s [vector] concatMap: OK
  2902. 270.35 s [vector] +++ OK, passed 100 tests.
  2903. 270.35 s [vector] mapM: OK
  2904. 270.37 s [vector] +++ OK, passed 100 tests.
  2905. 270.37 s [vector] mapM_: OK (0.02s)
  2906. 270.37 s [vector] +++ OK, passed 100 tests.
  2907. 270.37 s [vector] forM: OK
  2908. 270.37 s [vector] +++ OK, passed 100 tests.
  2909. 270.39 s [vector] forM_: OK (0.02s)
  2910. 270.39 s [vector] +++ OK, passed 100 tests.
  2911. 270.39 s [vector] imapM: OK
  2912. 270.39 s [vector] +++ OK, passed 100 tests.
  2913. 270.41 s [vector] imapM_: OK (0.01s)
  2914. 270.41 s [vector] +++ OK, passed 100 tests.
  2915. 270.41 s [vector] zipWith: OK
  2916. 270.41 s [vector] +++ OK, passed 100 tests.
  2917. 270.41 s [vector] zipWith3: OK
  2918. 270.41 s [vector] +++ OK, passed 100 tests.
  2919. 270.42 s [vector] izipWith: OK
  2920. 270.42 s [vector] +++ OK, passed 100 tests.
  2921. 270.42 s [vector] izipWith3: OK
  2922. 270.42 s [vector] +++ OK, passed 100 tests.
  2923. 270.42 s [vector] izipWithM: OK
  2924. 270.42 s [vector] +++ OK, passed 100 tests.
  2925. 270.43 s [vector] izipWithM_: OK (0.01s)
  2926. 270.43 s [vector] +++ OK, passed 100 tests.
  2927. 270.43 s [vector] zipWithM: OK
  2928. 270.45 s [vector] +++ OK, passed 100 tests.
  2929. 270.45 s [vector] zipWithM_: OK (0.01s)
  2930. 270.45 s [vector] +++ OK, passed 100 tests.
  2931. 270.47 s [vector] filter: OK
  2932. 270.47 s [vector] +++ OK, passed 100 tests.
  2933. 270.47 s [vector] ifilter: OK
  2934. 270.47 s [vector] +++ OK, passed 100 tests.
  2935. 270.47 s [vector] filterM: OK (0.02s)
  2936. 270.47 s [vector] +++ OK, passed 100 tests.
  2937. 270.48 s [vector] uniq: OK
  2938. 270.48 s [vector] +++ OK, passed 100 tests.
  2939. 270.48 s [vector] mapMaybe: OK
  2940. 270.48 s [vector] +++ OK, passed 100 tests.
  2941. 270.48 s [vector] imapMaybe: OK
  2942. 270.48 s [vector] +++ OK, passed 100 tests.
  2943. 270.49 s [vector] takeWhile: OK
  2944. 270.49 s [vector] +++ OK, passed 100 tests.
  2945. 270.49 s [vector] dropWhile: OK
  2946. 270.49 s [vector] +++ OK, passed 100 tests.
  2947. 270.49 s [vector] partition: OK
  2948. 270.49 s [vector] +++ OK, passed 100 tests.
  2949. 270.49 s [vector] partitionWith: OK
  2950. 270.49 s [vector] +++ OK, passed 100 tests.
  2951. 270.49 s [vector] span: OK
  2952. 270.49 s [vector] +++ OK, passed 100 tests.
  2953. 270.49 s [vector] break: OK
  2954. 270.49 s [vector] +++ OK, passed 100 tests.
  2955. 270.49 s [vector] spanR: OK
  2956. 270.49 s [vector] +++ OK, passed 100 tests.
  2957. 270.49 s [vector] breakR: OK
  2958. 270.49 s [vector] +++ OK, passed 100 tests.
  2959. 270.49 s [vector] groupBy: OK
  2960. 270.49 s [vector] +++ OK, passed 100 tests.
  2961. 270.49 s [vector] elem: OK
  2962. 270.49 s [vector] +++ OK, passed 100 tests.
  2963. 270.49 s [vector] notElem: OK
  2964. 270.50 s [vector] +++ OK, passed 100 tests.
  2965. 270.50 s [vector] find: OK
  2966. 270.50 s [vector] +++ OK, passed 100 tests.
  2967. 270.50 s [vector] findIndex: OK
  2968. 270.50 s [vector] +++ OK, passed 100 tests.
  2969. 270.51 s [vector] findIndexR: OK
  2970. 270.51 s [vector] +++ OK, passed 100 tests.
  2971. 270.51 s [vector] findIndices: OK
  2972. 270.51 s [vector] +++ OK, passed 100 tests.
  2973. 270.51 s [vector] elemIndex: OK
  2974. 270.51 s [vector] +++ OK, passed 100 tests.
  2975. 270.51 s [vector] elemIndices: OK
  2976. 270.51 s [vector] +++ OK, passed 100 tests.
  2977. 270.51 s [vector] foldl: OK
  2978. 270.51 s [vector] +++ OK, passed 100 tests.
  2979. 270.51 s [vector] foldl1: OK
  2980. 270.52 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2981. 270.52 s [vector] foldl': OK
  2982. 270.52 s [vector] +++ OK, passed 100 tests.
  2983. 270.52 s [vector] foldl1': OK
  2984. 270.52 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2985. 270.52 s [vector] foldr: OK
  2986. 270.52 s [vector] +++ OK, passed 100 tests.
  2987. 270.52 s [vector] foldr1: OK
  2988. 270.52 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2989. 270.52 s [vector] foldr': OK
  2990. 270.52 s [vector] +++ OK, passed 100 tests.
  2991. 270.53 s [vector] foldr1': OK
  2992. 270.53 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2993. 270.53 s [vector] ifoldl: OK
  2994. 270.53 s [vector] +++ OK, passed 100 tests.
  2995. 270.53 s [vector] ifoldl': OK
  2996. 270.53 s [vector] +++ OK, passed 100 tests.
  2997. 270.53 s [vector] ifoldr: OK
  2998. 270.53 s [vector] +++ OK, passed 100 tests.
  2999. 270.54 s [vector] ifoldr': OK
  3000. 270.55 s [vector] +++ OK, passed 100 tests.
  3001. 270.55 s [vector] ifoldM: OK
  3002. 270.55 s [vector] +++ OK, passed 100 tests.
  3003. 270.55 s [vector] ifoldM': OK
  3004. 270.55 s [vector] +++ OK, passed 100 tests.
  3005. 270.57 s [vector] ifoldM_: OK (0.02s)
  3006. 270.57 s [vector] +++ OK, passed 100 tests.
  3007. 270.57 s [vector] ifoldM'_: OK (0.01s)
  3008. 270.58 s [vector] +++ OK, passed 100 tests.
  3009. 270.58 s [vector] all: OK
  3010. 270.58 s [vector] +++ OK, passed 100 tests.
  3011. 270.58 s [vector] any: OK
  3012. 270.58 s [vector] +++ OK, passed 100 tests.
  3013. 270.58 s [vector] prescanl: OK
  3014. 270.58 s [vector] +++ OK, passed 100 tests.
  3015. 270.58 s [vector] prescanl': OK
  3016. 270.58 s [vector] +++ OK, passed 100 tests.
  3017. 270.58 s [vector] postscanl: OK
  3018. 270.58 s [vector] +++ OK, passed 100 tests.
  3019. 270.59 s [vector] postscanl': OK
  3020. 270.59 s [vector] +++ OK, passed 100 tests.
  3021. 270.59 s [vector] scanl: OK
  3022. 270.59 s [vector] +++ OK, passed 100 tests.
  3023. 270.60 s [vector] scanl': OK
  3024. 270.60 s [vector] +++ OK, passed 100 tests.
  3025. 270.60 s [vector] scanl1: OK
  3026. 270.60 s [vector] +++ OK, passed 100 tests.
  3027. 270.60 s [vector] scanl1': OK
  3028. 270.60 s [vector] +++ OK, passed 100 tests.
  3029. 270.60 s [vector] iscanl: OK
  3030. 270.61 s [vector] +++ OK, passed 100 tests.
  3031. 270.61 s [vector] iscanl': OK
  3032. 270.61 s [vector] +++ OK, passed 100 tests.
  3033. 270.61 s [vector] prescanr: OK
  3034. 270.61 s [vector] +++ OK, passed 100 tests.
  3035. 270.62 s [vector] prescanr': OK
  3036. 270.62 s [vector] +++ OK, passed 100 tests.
  3037. 270.62 s [vector] postscanr: OK
  3038. 270.62 s [vector] +++ OK, passed 100 tests.
  3039. 270.62 s [vector] postscanr': OK
  3040. 270.62 s [vector] +++ OK, passed 100 tests.
  3041. 270.63 s [vector] scanr: OK
  3042. 270.63 s [vector] +++ OK, passed 100 tests.
  3043. 270.63 s [vector] scanr': OK
  3044. 270.63 s [vector] +++ OK, passed 100 tests.
  3045. 270.66 s [vector] scanr1: OK
  3046. 270.66 s [vector] +++ OK, passed 100 tests.
  3047. 270.66 s [vector] scanr1': OK
  3048. 270.66 s [vector] +++ OK, passed 100 tests.
  3049. 270.66 s [vector] iscanr: OK
  3050. 270.66 s [vector] +++ OK, passed 100 tests.
  3051. 270.66 s [vector] iscanr': OK
  3052. 270.66 s [vector] +++ OK, passed 100 tests.
  3053. 270.66 s [vector] mut_read: OK
  3054. 270.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3055. 270.67 s [vector] mut_write: OK
  3056. 270.67 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3057. 270.67 s [vector] mut_modify: OK
  3058. 270.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3059. 270.67 s [vector] mut_generate: OK
  3060. 270.67 s [vector] +++ OK, passed 100 tests.
  3061. 270.69 s [vector] mut_generateM: OK (0.01s)
  3062. 270.69 s [vector] +++ OK, passed 100 tests.
  3063. 270.72 s [vector] mut_mapM_: OK (0.01s)
  3064. 270.72 s [vector] +++ OK, passed 100 tests.
  3065. 270.73 s [vector] mut_imapM_: OK (0.02s)
  3066. 270.73 s [vector] +++ OK, passed 100 tests.
  3067. 270.75 s [vector] mut_forM_: OK (0.02s)
  3068. 270.75 s [vector] +++ OK, passed 100 tests.
  3069. 270.76 s [vector] mut_iforM_: OK (0.02s)
  3070. 270.76 s [vector] +++ OK, passed 100 tests.
  3071. 270.76 s [vector] mut_foldr: OK
  3072. 270.77 s [vector] +++ OK, passed 100 tests.
  3073. 270.77 s [vector] mut_foldr': OK
  3074. 270.77 s [vector] +++ OK, passed 100 tests.
  3075. 270.78 s [vector] mut_foldl: OK
  3076. 270.78 s [vector] +++ OK, passed 100 tests.
  3077. 270.78 s [vector] mut_foldl': OK
  3078. 270.78 s [vector] +++ OK, passed 100 tests.
  3079. 270.78 s [vector] mut_ifoldr: OK
  3080. 270.78 s [vector] +++ OK, passed 100 tests.
  3081. 270.78 s [vector] mut_ifoldr': OK
  3082. 270.79 s [vector] +++ OK, passed 100 tests.
  3083. 270.79 s [vector] mut_ifoldl: OK
  3084. 270.79 s [vector] +++ OK, passed 100 tests.
  3085. 270.79 s [vector] mut_ifoldl': OK
  3086. 270.79 s [vector] +++ OK, passed 100 tests.
  3087. 270.79 s [vector] mut_foldM: OK
  3088. 270.79 s [vector] +++ OK, passed 100 tests.
  3089. 270.79 s [vector] mut_foldM': OK
  3090. 270.79 s [vector] +++ OK, passed 100 tests.
  3091. 270.79 s [vector] mut_foldrM: OK
  3092. 270.79 s [vector] +++ OK, passed 100 tests.
  3093. 270.79 s [vector] mut_foldrM': OK
  3094. 270.80 s [vector] +++ OK, passed 100 tests.
  3095. 270.80 s [vector] mut_ifoldM: OK
  3096. 270.80 s [vector] +++ OK, passed 100 tests.
  3097. 270.81 s [vector] mut_ifoldM': OK
  3098. 270.81 s [vector] +++ OK, passed 100 tests.
  3099. 270.81 s [vector] mut_ifoldrM: OK
  3100. 270.81 s [vector] +++ OK, passed 100 tests.
  3101. 270.81 s [vector] mut_ifoldrM': OK
  3102. 270.81 s [vector] +++ OK, passed 100 tests.
  3103. 270.81 s [vector] compare: OK
  3104. 270.81 s [vector] +++ OK, passed 100 tests.
  3105. 270.81 s [vector] maximum: OK
  3106. 270.81 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3107. 270.81 s [vector] minimum: OK
  3108. 270.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3109. 270.81 s [vector] minIndex: OK
  3110. 270.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3111. 270.81 s [vector] maxIndex: OK
  3112. 270.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3113. 270.81 s [vector] maximumBy: OK
  3114. 270.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3115. 270.81 s [vector] minimumBy: OK
  3116. 270.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3117. 270.81 s [vector] maximumOn: OK
  3118. 270.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3119. 270.81 s [vector] minimumOn: OK
  3120. 270.82 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3121. 270.82 s [vector] maxIndexBy: OK
  3122. 270.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3123. 270.82 s [vector] minIndexBy: OK
  3124. 270.82 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3125. 270.82 s [vector] ListFirstMaxIndexWins: OK
  3126. 270.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3127. 270.82 s [vector] FalseListFirstMaxIndexWins: OK
  3128. 270.82 s [vector] +++ OK, failed as expected. (after 1 test):
  3129. 270.82 s [vector] Exception:
  3130. 270.82 s [vector] Prelude.foldr1: empty list
  3131. 270.82 s [vector] CallStack (from HasCallStack):
  3132. 270.82 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  3133. 270.82 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  3134. 270.82 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  3135. 270.82 s [vector] []
  3136. 270.82 s [vector] mempty: OK
  3137. 270.82 s [vector] +++ OK, passed 1 test.
  3138. 270.83 s [vector] mappend: OK
  3139. 270.83 s [vector] +++ OK, passed 100 tests.
  3140. 270.84 s [vector] mconcat: OK (0.02s)
  3141. 270.84 s [vector] +++ OK, passed 100 tests.
  3142. 270.84 s [vector] glength: OK
  3143. 270.84 s [vector] +++ OK, passed 100 tests.
  3144. 270.84 s [vector] sum: OK
  3145. 270.84 s [vector] +++ OK, passed 100 tests.
  3146. 270.84 s [vector] product: OK
  3147. 270.84 s [vector] +++ OK, passed 100 tests.
  3148. 270.84 s [vector] enumFromN: OK
  3149. 270.84 s [vector] +++ OK, passed 100 tests.
  3150. 270.84 s [vector] enumFromThenN: OK
  3151. 270.84 s [vector] +++ OK, passed 100 tests.
  3152. 270.84 s [vector] enumFromTo: OK
  3153. 270.84 s [vector] +++ OK, passed 100 tests.
  3154. 270.84 s [vector] enumFromThenTo: OK
  3155. 270.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3156. 270.84 s [vector] Double
  3157. 270.84 s [vector] fromList.toList == id: OK
  3158. 270.84 s [vector] +++ OK, passed 100 tests.
  3159. 270.84 s [vector] toList.fromList == id: OK
  3160. 270.85 s [vector] +++ OK, passed 100 tests.
  3161. 270.85 s [vector] unstream.stream == id: OK
  3162. 270.85 s [vector] +++ OK, passed 100 tests.
  3163. 270.85 s [vector] stream.unstream == id: OK
  3164. 270.85 s [vector] +++ OK, passed 100 tests.
  3165. 270.85 s [vector] eq: OK
  3166. 270.85 s [vector] +++ OK, passed 100 tests.
  3167. 270.85 s [vector] length: OK
  3168. 270.85 s [vector] +++ OK, passed 100 tests.
  3169. 270.85 s [vector] null: OK
  3170. 270.85 s [vector] +++ OK, passed 100 tests.
  3171. 270.85 s [vector] index: OK
  3172. 270.85 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3173. 270.85 s [vector] safeIndex: OK
  3174. 270.85 s [vector] +++ OK, passed 100 tests.
  3175. 270.85 s [vector] head: OK
  3176. 270.85 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3177. 270.85 s [vector] last: OK
  3178. 270.85 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3179. 270.85 s [vector] unsafeIndex: OK
  3180. 270.86 s [vector] +++ OK, passed 100 tests; 11 discarded.
  3181. 270.86 s [vector] unsafeHead: OK
  3182. 270.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3183. 270.86 s [vector] unsafeLast: OK
  3184. 270.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3185. 270.86 s [vector] slice: OK
  3186. 270.86 s [vector] +++ OK, passed 100 tests.
  3187. 270.86 s [vector] init: OK
  3188. 270.86 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3189. 270.86 s [vector] tail: OK
  3190. 270.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3191. 270.86 s [vector] take: OK
  3192. 270.86 s [vector] +++ OK, passed 100 tests.
  3193. 270.86 s [vector] drop: OK
  3194. 270.86 s [vector] +++ OK, passed 100 tests.
  3195. 270.86 s [vector] splitAt: OK
  3196. 270.86 s [vector] +++ OK, passed 100 tests.
  3197. 270.86 s [vector] empty: OK
  3198. 270.86 s [vector] +++ OK, passed 1 test.
  3199. 270.86 s [vector] singleton: OK
  3200. 270.86 s [vector] +++ OK, passed 100 tests.
  3201. 270.86 s [vector] replicate: OK
  3202. 270.86 s [vector] +++ OK, passed 100 tests.
  3203. 270.87 s [vector] generate: OK
  3204. 270.87 s [vector] +++ OK, passed 100 tests.
  3205. 270.87 s [vector] iterateN: OK
  3206. 270.87 s [vector] +++ OK, passed 100 tests.
  3207. 270.93 s [vector] iterateNM: OK (0.05s)
  3208. 270.93 s [vector] +++ OK, passed 100 tests.
  3209. 270.97 s [vector] generateM: OK (0.04s)
  3210. 270.97 s [vector] +++ OK, passed 100 tests.
  3211. 270.98 s [vector] replicateM: OK (0.01s)
  3212. 270.98 s [vector] +++ OK, passed 100 tests.
  3213. 270.98 s [vector] create: OK
  3214. 270.98 s [vector] +++ OK, passed 100 tests.
  3215. 270.98 s [vector] createT: OK
  3216. 270.98 s [vector] +++ OK, passed 100 tests.
  3217. 270.99 s [vector] unfoldr: OK
  3218. 270.99 s [vector] +++ OK, passed 100 tests.
  3219. 270.99 s [vector] unfoldrN: OK
  3220. 270.99 s [vector] +++ OK, passed 100 tests.
  3221. 270.99 s [vector] unfoldrExactN: OK
  3222. 270.99 s [vector] +++ OK, passed 100 tests.
  3223. 271.00 s [vector] unfoldrM: OK
  3224. 271.00 s [vector] +++ OK, passed 100 tests.
  3225. 271.00 s [vector] unfoldrNM: OK
  3226. 271.00 s [vector] +++ OK, passed 100 tests.
  3227. 271.02 s [vector] unfoldrExactNM: OK (0.04s)
  3228. 271.02 s [vector] +++ OK, passed 100 tests.
  3229. 271.03 s [vector] constructN: OK
  3230. 271.03 s [vector] +++ OK, passed 100 tests.
  3231. 271.05 s [vector] constructrN: OK (0.01s)
  3232. 271.05 s [vector] +++ OK, passed 100 tests.
  3233. 271.05 s [vector] cons: OK
  3234. 271.05 s [vector] +++ OK, passed 100 tests.
  3235. 271.05 s [vector] snoc: OK
  3236. 271.05 s [vector] +++ OK, passed 100 tests.
  3237. 271.05 s [vector] append: OK
  3238. 271.07 s [vector] +++ OK, passed 100 tests.
  3239. 271.08 s [vector] concat: OK (0.02s)
  3240. 271.08 s [vector] +++ OK, passed 100 tests.
  3241. 271.09 s [vector] force: OK
  3242. 271.09 s [vector] +++ OK, passed 100 tests.
  3243. 271.10 s [vector] upd: OK
  3244. 271.10 s [vector] +++ OK, passed 100 tests.
  3245. 271.11 s [vector] accum: OK (0.02s)
  3246. 271.11 s [vector] +++ OK, passed 100 tests.
  3247. 271.11 s [vector] reverse: OK
  3248. 271.12 s [vector] +++ OK, passed 100 tests.
  3249. 271.12 s [vector] backpermute: OK
  3250. 271.12 s [vector] +++ OK, passed 100 tests.
  3251. 271.12 s [vector] map: OK
  3252. 271.12 s [vector] +++ OK, passed 100 tests.
  3253. 271.12 s [vector] imap: OK
  3254. 271.12 s [vector] +++ OK, passed 100 tests.
  3255. 271.12 s [vector] concatMap: OK
  3256. 271.12 s [vector] +++ OK, passed 100 tests.
  3257. 271.13 s [vector] mapM: OK
  3258. 271.13 s [vector] +++ OK, passed 100 tests.
  3259. 271.17 s [vector] mapM_: OK (0.04s)
  3260. 271.17 s [vector] +++ OK, passed 100 tests.
  3261. 271.17 s [vector] forM: OK
  3262. 271.19 s [vector] +++ OK, passed 100 tests.
  3263. 271.20 s [vector] forM_: OK (0.03s)
  3264. 271.20 s [vector] +++ OK, passed 100 tests.
  3265. 271.21 s [vector] imapM: OK
  3266. 271.21 s [vector] +++ OK, passed 100 tests.
  3267. 271.26 s [vector] imapM_: OK (0.04s)
  3268. 271.26 s [vector] +++ OK, passed 100 tests.
  3269. 271.27 s [vector] zipWith: OK (0.01s)
  3270. 271.27 s [vector] +++ OK, passed 100 tests.
  3271. 271.28 s [vector] zipWith3: OK (0.01s)
  3272. 271.29 s [vector] +++ OK, passed 100 tests.
  3273. 271.29 s [vector] izipWith: OK
  3274. 271.30 s [vector] +++ OK, passed 100 tests.
  3275. 271.31 s [vector] izipWith3: OK (0.01s)
  3276. 271.31 s [vector] +++ OK, passed 100 tests.
  3277. 271.31 s [vector] izipWithM: OK
  3278. 271.31 s [vector] +++ OK, passed 100 tests.
  3279. 271.37 s [vector] izipWithM_: OK (0.03s)
  3280. 271.37 s [vector] +++ OK, passed 100 tests.
  3281. 271.37 s [vector] zipWithM: OK (0.01s)
  3282. 271.37 s [vector] +++ OK, passed 100 tests.
  3283. 271.39 s [vector] zipWithM_: OK (0.04s)
  3284. 271.39 s [vector] +++ OK, passed 100 tests.
  3285. 271.40 s [vector] filter: OK (0.01s)
  3286. 271.40 s [vector] +++ OK, passed 100 tests.
  3287. 271.40 s [vector] ifilter: OK
  3288. 271.41 s [vector] +++ OK, passed 100 tests.
  3289. 271.46 s [vector] filterM: OK (0.05s)
  3290. 271.46 s [vector] +++ OK, passed 100 tests.
  3291. 271.46 s [vector] uniq: OK
  3292. 271.46 s [vector] +++ OK, passed 100 tests.
  3293. 271.47 s [vector] mapMaybe: OK
  3294. 271.47 s [vector] +++ OK, passed 100 tests.
  3295. 271.48 s [vector] imapMaybe: OK (0.01s)
  3296. 271.48 s [vector] +++ OK, passed 100 tests.
  3297. 271.48 s [vector] takeWhile: OK
  3298. 271.48 s [vector] +++ OK, passed 100 tests.
  3299. 271.49 s [vector] dropWhile: OK
  3300. 271.49 s [vector] +++ OK, passed 100 tests.
  3301. 271.49 s [vector] partition: OK
  3302. 271.49 s [vector] +++ OK, passed 100 tests.
  3303. 271.50 s [vector] partitionWith: OK
  3304. 271.50 s [vector] +++ OK, passed 100 tests.
  3305. 271.50 s [vector] span: OK
  3306. 271.50 s [vector] +++ OK, passed 100 tests.
  3307. 271.50 s [vector] break: OK
  3308. 271.50 s [vector] +++ OK, passed 100 tests.
  3309. 271.50 s [vector] spanR: OK
  3310. 271.50 s [vector] +++ OK, passed 100 tests.
  3311. 271.51 s [vector] breakR: OK
  3312. 271.51 s [vector] +++ OK, passed 100 tests.
  3313. 271.52 s [vector] groupBy: OK (0.01s)
  3314. 271.52 s [vector] +++ OK, passed 100 tests.
  3315. 271.52 s [vector] elem: OK
  3316. 271.52 s [vector] +++ OK, passed 100 tests.
  3317. 271.52 s [vector] notElem: OK
  3318. 271.52 s [vector] +++ OK, passed 100 tests.
  3319. 271.52 s [vector] find: OK
  3320. 271.52 s [vector] +++ OK, passed 100 tests.
  3321. 271.52 s [vector] findIndex: OK
  3322. 271.52 s [vector] +++ OK, passed 100 tests.
  3323. 271.52 s [vector] findIndexR: OK
  3324. 271.53 s [vector] +++ OK, passed 100 tests.
  3325. 271.53 s [vector] findIndices: OK
  3326. 271.53 s [vector] +++ OK, passed 100 tests.
  3327. 271.53 s [vector] elemIndex: OK
  3328. 271.53 s [vector] +++ OK, passed 100 tests.
  3329. 271.53 s [vector] elemIndices: OK
  3330. 271.55 s [vector] +++ OK, passed 100 tests.
  3331. 271.55 s [vector] foldl: OK (0.01s)
  3332. 271.55 s [vector] +++ OK, passed 100 tests.
  3333. 271.57 s [vector] foldl1: OK (0.01s)
  3334. 271.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3335. 271.59 s [vector] foldl': OK (0.01s)
  3336. 271.59 s [vector] +++ OK, passed 100 tests.
  3337. 271.61 s [vector] foldl1': OK (0.01s)
  3338. 271.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3339. 271.61 s [vector] foldr: OK (0.01s)
  3340. 271.61 s [vector] +++ OK, passed 100 tests.
  3341. 271.62 s [vector] foldr1: OK (0.02s)
  3342. 271.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3343. 271.64 s [vector] foldr': OK
  3344. 271.65 s [vector] +++ OK, passed 100 tests.
  3345. 271.67 s [vector] foldr1': OK (0.02s)
  3346. 271.67 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3347. 271.68 s [vector] ifoldl: OK (0.02s)
  3348. 271.68 s [vector] +++ OK, passed 100 tests.
  3349. 271.69 s [vector] ifoldl': OK (0.01s)
  3350. 271.69 s [vector] +++ OK, passed 100 tests.
  3351. 271.71 s [vector] ifoldr: OK (0.01s)
  3352. 271.71 s [vector] +++ OK, passed 100 tests.
  3353. 271.75 s [vector] ifoldr': OK (0.02s)
  3354. 271.75 s [vector] +++ OK, passed 100 tests.
  3355. 271.75 s [vector] ifoldM: OK (0.02s)
  3356. 271.75 s [vector] +++ OK, passed 100 tests.
  3357. 271.77 s [vector] ifoldM': OK (0.02s)
  3358. 271.77 s [vector] +++ OK, passed 100 tests.
  3359. 271.81 s [vector] ifoldM_: OK (0.04s)
  3360. 271.81 s [vector] +++ OK, passed 100 tests.
  3361. 271.85 s [vector] ifoldM'_: OK (0.05s)
  3362. 271.85 s [vector] +++ OK, passed 100 tests.
  3363. 271.85 s [vector] all: OK
  3364. 271.85 s [vector] +++ OK, passed 100 tests.
  3365. 271.87 s [vector] any: OK
  3366. 271.87 s [vector] +++ OK, passed 100 tests.
  3367. 271.88 s [vector] prescanl: OK (0.02s)
  3368. 271.88 s [vector] +++ OK, passed 100 tests.
  3369. 271.88 s [vector] prescanl': OK (0.01s)
  3370. 271.88 s [vector] +++ OK, passed 100 tests.
  3371. 271.90 s [vector] postscanl: OK
  3372. 271.91 s [vector] +++ OK, passed 100 tests.
  3373. 271.91 s [vector] postscanl': OK (0.01s)
  3374. 271.91 s [vector] +++ OK, passed 100 tests.
  3375. 271.93 s [vector] scanl: OK (0.01s)
  3376. 271.93 s [vector] +++ OK, passed 100 tests.
  3377. 271.95 s [vector] scanl': OK (0.02s)
  3378. 271.95 s [vector] +++ OK, passed 100 tests.
  3379. 271.97 s [vector] scanl1: OK (0.02s)
  3380. 271.97 s [vector] +++ OK, passed 100 tests.
  3381. 271.97 s [vector] scanl1': OK (0.02s)
  3382. 271.97 s [vector] +++ OK, passed 100 tests.
  3383. 271.99 s [vector] iscanl: OK (0.02s)
  3384. 271.99 s [vector] +++ OK, passed 100 tests.
  3385. 272.01 s [vector] iscanl': OK (0.02s)
  3386. 272.01 s [vector] +++ OK, passed 100 tests.
  3387. 272.03 s [vector] prescanr: OK (0.01s)
  3388. 272.03 s [vector] +++ OK, passed 100 tests.
  3389. 272.38 s [vector] prescanr': OK (0.02s)
  3390. 272.38 s [vector] +++ OK, passed 100 tests.
  3391. 272.38 s [vector] postscanr: OK (0.02s)
  3392. 272.38 s [vector] +++ OK, passed 100 tests.
  3393. 272.38 s [vector] postscanr': OK (0.01s)
  3394. 272.38 s [vector] +++ OK, passed 100 tests.
  3395. 272.38 s [vector] scanr: OK (0.02s)
  3396. 272.38 s [vector] +++ OK, passed 100 tests.
  3397. 272.39 s [vector] scanr': OK (0.02s)
  3398. 272.39 s [vector] +++ OK, passed 100 tests.
  3399. 272.39 s [vector] scanr1: OK
  3400. 272.39 s [vector] +++ OK, passed 100 tests.
  3401. 272.39 s [vector] scanr1': OK (0.01s)
  3402. 272.39 s [vector] +++ OK, passed 100 tests.
  3403. 272.39 s [vector] iscanr: OK (0.02s)
  3404. 272.39 s [vector] +++ OK, passed 100 tests.
  3405. 272.39 s [vector] iscanr': OK (0.02s)
  3406. 272.39 s [vector] +++ OK, passed 100 tests.
  3407. 272.39 s [vector] mut_read: OK
  3408. 272.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3409. 272.39 s [vector] mut_write: OK
  3410. 272.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3411. 272.39 s [vector] mut_modify: OK
  3412. 272.39 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3413. 272.39 s [vector] mut_generate: OK
  3414. 272.39 s [vector] +++ OK, passed 100 tests.
  3415. 272.39 s [vector] mut_generateM: OK (0.02s)
  3416. 272.39 s [vector] +++ OK, passed 100 tests.
  3417. 272.39 s [vector] mut_mapM_: OK (0.03s)
  3418. 272.39 s [vector] +++ OK, passed 100 tests.
  3419. 272.39 s [vector] mut_imapM_: OK (0.03s)
  3420. 272.39 s [vector] +++ OK, passed 100 tests.
  3421. 272.39 s [vector] mut_forM_: OK (0.04s)
  3422. 272.39 s [vector] +++ OK, passed 100 tests.
  3423. 272.39 s [vector] mut_iforM_: OK (0.04s)
  3424. 272.39 s [vector] +++ OK, passed 100 tests.
  3425. 272.39 s [vector] mut_foldr: OK (0.02s)
  3426. 272.39 s [vector] +++ OK, passed 100 tests.
  3427. 272.39 s [vector] mut_foldr': OK (0.01s)
  3428. 272.39 s [vector] +++ OK, passed 100 tests.
  3429. 272.39 s [vector] mut_foldl: OK (0.02s)
  3430. 272.39 s [vector] +++ OK, passed 100 tests.
  3431. 272.41 s [vector] mut_foldl': OK (0.01s)
  3432. 272.41 s [vector] +++ OK, passed 100 tests.
  3433. 272.43 s [vector] mut_ifoldr: OK (0.01s)
  3434. 272.43 s [vector] +++ OK, passed 100 tests.
  3435. 272.45 s [vector] mut_ifoldr': OK (0.02s)
  3436. 272.45 s [vector] +++ OK, passed 100 tests.
  3437. 272.45 s [vector] mut_ifoldl: OK (0.02s)
  3438. 272.45 s [vector] +++ OK, passed 100 tests.
  3439. 272.47 s [vector] mut_ifoldl': OK (0.02s)
  3440. 272.47 s [vector] +++ OK, passed 100 tests.
  3441. 272.49 s [vector] mut_foldM: OK (0.01s)
  3442. 272.49 s [vector] +++ OK, passed 100 tests.
  3443. 272.51 s [vector] mut_foldM': OK (0.01s)
  3444. 272.51 s [vector] +++ OK, passed 100 tests.
  3445. 272.51 s [vector] mut_foldrM: OK (0.01s)
  3446. 272.51 s [vector] +++ OK, passed 100 tests.
  3447. 272.53 s [vector] mut_foldrM': OK (0.01s)
  3448. 272.53 s [vector] +++ OK, passed 100 tests.
  3449. 272.55 s [vector] mut_ifoldM: OK (0.01s)
  3450. 272.55 s [vector] +++ OK, passed 100 tests.
  3451. 272.55 s [vector] mut_ifoldM': OK (0.01s)
  3452. 272.55 s [vector] +++ OK, passed 100 tests.
  3453. 272.57 s [vector] mut_ifoldrM: OK (0.02s)
  3454. 272.57 s [vector] +++ OK, passed 100 tests.
  3455. 272.58 s [vector] mut_ifoldrM': OK (0.02s)
  3456. 272.58 s [vector] +++ OK, passed 100 tests.
  3457. 272.58 s [vector] compare: OK
  3458. 272.58 s [vector] +++ OK, passed 100 tests.
  3459. 272.58 s [vector] maximum: OK
  3460. 272.58 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3461. 272.58 s [vector] minimum: OK
  3462. 272.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3463. 272.58 s [vector] minIndex: OK
  3464. 272.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3465. 272.59 s [vector] maxIndex: OK
  3466. 272.59 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3467. 272.59 s [vector] maximumBy: OK
  3468. 272.59 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3469. 272.59 s [vector] minimumBy: OK
  3470. 272.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3471. 272.59 s [vector] maximumOn: OK
  3472. 272.59 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3473. 272.59 s [vector] minimumOn: OK
  3474. 272.59 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3475. 272.59 s [vector] maxIndexBy: OK
  3476. 272.59 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3477. 272.59 s [vector] minIndexBy: OK
  3478. 272.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3479. 272.59 s [vector] ListFirstMaxIndexWins: OK
  3480. 272.59 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3481. 272.59 s [vector] FalseListFirstMaxIndexWins: OK
  3482. 272.59 s [vector] +++ OK, failed as expected. (after 1 test):
  3483. 272.59 s [vector] Exception:
  3484. 272.59 s [vector] Prelude.foldr1: empty list
  3485. 272.59 s [vector] CallStack (from HasCallStack):
  3486. 272.59 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  3487. 272.59 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  3488. 272.59 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  3489. 272.59 s [vector] []
  3490. 272.59 s [vector] mempty: OK
  3491. 272.59 s [vector] +++ OK, passed 1 test.
  3492. 272.59 s [vector] mappend: OK
  3493. 272.61 s [vector] +++ OK, passed 100 tests.
  3494. 272.62 s [vector] mconcat: OK (0.03s)
  3495. 272.62 s [vector] +++ OK, passed 100 tests.
  3496. 272.62 s [vector] glength: OK
  3497. 272.62 s [vector] +++ OK, passed 100 tests.
  3498. 272.62 s [vector] sum: OK
  3499. 272.62 s [vector] +++ OK, passed 100 tests.
  3500. 272.62 s [vector] product: OK
  3501. 272.62 s [vector] +++ OK, passed 100 tests.
  3502. 272.62 s [vector] enumFromN: OK
  3503. 272.63 s [vector] +++ OK, passed 100 tests.
  3504. 272.63 s [vector] enumFromThenN: OK
  3505. 272.63 s [vector] +++ OK, passed 100 tests.
  3506. 272.63 s [vector] enumFromTo: OK
  3507. 272.63 s [vector] +++ OK, passed 100 tests.
  3508. 272.63 s [vector] enumFromThenTo: OK
  3509. 272.63 s [vector] +++ OK, passed 100 tests; 1 discarded.
  3510. 272.63 s [vector] unstream
  3511. 272.63 s [vector] unstream == vunstream (exact): OK
  3512. 272.63 s [vector] +++ OK, passed 100 tests.
  3513. 272.63 s [vector] unstream == vunstream (unknown): OK
  3514. 272.63 s [vector] +++ OK, passed 100 tests.
  3515. 272.63 s [vector] unstreamR ~= vunstream (exact): OK
  3516. 272.63 s [vector] +++ OK, passed 100 tests.
  3517. 272.63 s [vector] unstreamR ~= vunstream (unknown): OK
  3518. 272.64 s [vector] +++ OK, passed 100 tests.
  3519. 272.64 s [vector] Tests.Vector.Storable
  3520. 272.64 s [vector] Data.Vector.Storable.Vector (Int)
  3521. 272.64 s [vector] fromList.toList == id: OK
  3522. 272.64 s [vector] +++ OK, passed 100 tests.
  3523. 272.64 s [vector] toList.fromList == id: OK
  3524. 272.64 s [vector] +++ OK, passed 100 tests.
  3525. 272.64 s [vector] unstream.stream == id: OK
  3526. 272.64 s [vector] +++ OK, passed 100 tests.
  3527. 272.64 s [vector] stream.unstream == id: OK
  3528. 272.64 s [vector] +++ OK, passed 100 tests.
  3529. 272.64 s [vector] eq: OK
  3530. 272.64 s [vector] +++ OK, passed 100 tests.
  3531. 272.64 s [vector] length: OK
  3532. 272.64 s [vector] +++ OK, passed 100 tests.
  3533. 272.64 s [vector] null: OK
  3534. 272.64 s [vector] +++ OK, passed 100 tests.
  3535. 272.64 s [vector] index: OK
  3536. 272.64 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3537. 272.64 s [vector] safeIndex: OK
  3538. 272.64 s [vector] +++ OK, passed 100 tests.
  3539. 272.64 s [vector] head: OK
  3540. 272.64 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3541. 272.64 s [vector] last: OK
  3542. 272.64 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3543. 272.64 s [vector] unsafeIndex: OK
  3544. 272.64 s [vector] +++ OK, passed 100 tests; 23 discarded.
  3545. 272.64 s [vector] unsafeHead: OK
  3546. 272.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3547. 272.64 s [vector] unsafeLast: OK
  3548. 272.64 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3549. 272.64 s [vector] slice: OK
  3550. 272.64 s [vector] +++ OK, passed 100 tests.
  3551. 272.64 s [vector] init: OK
  3552. 272.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3553. 272.64 s [vector] tail: OK
  3554. 272.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3555. 272.65 s [vector] take: OK
  3556. 272.65 s [vector] +++ OK, passed 100 tests.
  3557. 272.65 s [vector] drop: OK
  3558. 272.65 s [vector] +++ OK, passed 100 tests.
  3559. 272.65 s [vector] splitAt: OK
  3560. 272.65 s [vector] +++ OK, passed 100 tests.
  3561. 272.65 s [vector] empty: OK
  3562. 272.65 s [vector] +++ OK, passed 1 test.
  3563. 272.65 s [vector] singleton: OK
  3564. 272.65 s [vector] +++ OK, passed 100 tests.
  3565. 272.65 s [vector] replicate: OK
  3566. 272.65 s [vector] +++ OK, passed 100 tests.
  3567. 272.65 s [vector] generate: OK
  3568. 272.65 s [vector] +++ OK, passed 100 tests.
  3569. 272.67 s [vector] iterateN: OK
  3570. 272.67 s [vector] +++ OK, passed 100 tests.
  3571. 272.70 s [vector] iterateNM: OK (0.04s)
  3572. 272.70 s [vector] +++ OK, passed 100 tests.
  3573. 272.72 s [vector] generateM: OK (0.03s)
  3574. 272.72 s [vector] +++ OK, passed 100 tests.
  3575. 272.72 s [vector] replicateM: OK
  3576. 272.72 s [vector] +++ OK, passed 100 tests.
  3577. 272.72 s [vector] create: OK
  3578. 272.72 s [vector] +++ OK, passed 100 tests.
  3579. 272.72 s [vector] createT: OK
  3580. 272.73 s [vector] +++ OK, passed 100 tests.
  3581. 272.73 s [vector] unfoldr: OK
  3582. 272.73 s [vector] +++ OK, passed 100 tests.
  3583. 272.73 s [vector] unfoldrN: OK
  3584. 272.73 s [vector] +++ OK, passed 100 tests.
  3585. 272.73 s [vector] unfoldrExactN: OK
  3586. 272.73 s [vector] +++ OK, passed 100 tests.
  3587. 272.73 s [vector] unfoldrM: OK
  3588. 272.75 s [vector] +++ OK, passed 100 tests.
  3589. 272.75 s [vector] unfoldrNM: OK
  3590. 272.75 s [vector] +++ OK, passed 100 tests.
  3591. 272.77 s [vector] unfoldrExactNM: OK (0.03s)
  3592. 272.77 s [vector] +++ OK, passed 100 tests.
  3593. 272.77 s [vector] constructN: OK
  3594. 272.77 s [vector] +++ OK, passed 100 tests.
  3595. 272.77 s [vector] constructrN: OK
  3596. 272.78 s [vector] +++ OK, passed 100 tests.
  3597. 272.78 s [vector] cons: OK
  3598. 272.78 s [vector] +++ OK, passed 100 tests.
  3599. 272.78 s [vector] snoc: OK
  3600. 272.78 s [vector] +++ OK, passed 100 tests.
  3601. 272.79 s [vector] append: OK
  3602. 272.79 s [vector] +++ OK, passed 100 tests.
  3603. 272.79 s [vector] concat: OK (0.01s)
  3604. 272.79 s [vector] +++ OK, passed 100 tests.
  3605. 272.79 s [vector] force: OK
  3606. 272.79 s [vector] +++ OK, passed 100 tests.
  3607. 272.80 s [vector] upd: OK
  3608. 272.80 s [vector] +++ OK, passed 100 tests.
  3609. 272.80 s [vector] accum: OK
  3610. 272.80 s [vector] +++ OK, passed 100 tests.
  3611. 272.80 s [vector] reverse: OK
  3612. 272.80 s [vector] +++ OK, passed 100 tests.
  3613. 272.80 s [vector] backpermute: OK
  3614. 272.80 s [vector] +++ OK, passed 100 tests.
  3615. 272.80 s [vector] map: OK
  3616. 272.81 s [vector] +++ OK, passed 100 tests.
  3617. 272.81 s [vector] imap: OK
  3618. 272.81 s [vector] +++ OK, passed 100 tests.
  3619. 272.81 s [vector] concatMap: OK
  3620. 272.81 s [vector] +++ OK, passed 100 tests.
  3621. 272.81 s [vector] mapM: OK
  3622. 272.81 s [vector] +++ OK, passed 100 tests.
  3623. 272.83 s [vector] mapM_: OK (0.02s)
  3624. 272.83 s [vector] +++ OK, passed 100 tests.
  3625. 272.83 s [vector] forM: OK
  3626. 272.83 s [vector] +++ OK, passed 100 tests.
  3627. 272.85 s [vector] forM_: OK (0.01s)
  3628. 272.85 s [vector] +++ OK, passed 100 tests.
  3629. 272.85 s [vector] imapM: OK
  3630. 272.85 s [vector] +++ OK, passed 100 tests.
  3631. 272.87 s [vector] imapM_: OK (0.02s)
  3632. 272.87 s [vector] +++ OK, passed 100 tests.
  3633. 272.87 s [vector] zipWith: OK
  3634. 272.87 s [vector] +++ OK, passed 100 tests.
  3635. 272.87 s [vector] zipWith3: OK
  3636. 272.87 s [vector] +++ OK, passed 100 tests.
  3637. 272.87 s [vector] izipWith: OK
  3638. 272.87 s [vector] +++ OK, passed 100 tests.
  3639. 272.87 s [vector] izipWith3: OK
  3640. 272.88 s [vector] +++ OK, passed 100 tests.
  3641. 272.89 s [vector] izipWithM: OK
  3642. 272.89 s [vector] +++ OK, passed 100 tests.
  3643. 272.89 s [vector] izipWithM_: OK (0.01s)
  3644. 272.91 s [vector] +++ OK, passed 100 tests.
  3645. 272.91 s [vector] zipWithM: OK
  3646. 272.91 s [vector] +++ OK, passed 100 tests.
  3647. 272.91 s [vector] zipWithM_: OK (0.01s)
  3648. 272.91 s [vector] +++ OK, passed 100 tests.
  3649. 272.91 s [vector] filter: OK
  3650. 272.91 s [vector] +++ OK, passed 100 tests.
  3651. 272.91 s [vector] ifilter: OK
  3652. 272.91 s [vector] +++ OK, passed 100 tests.
  3653. 272.94 s [vector] filterM: OK (0.03s)
  3654. 272.94 s [vector] +++ OK, passed 100 tests.
  3655. 272.94 s [vector] uniq: OK
  3656. 272.94 s [vector] +++ OK, passed 100 tests.
  3657. 272.95 s [vector] mapMaybe: OK
  3658. 272.95 s [vector] +++ OK, passed 100 tests.
  3659. 272.95 s [vector] imapMaybe: OK
  3660. 272.95 s [vector] +++ OK, passed 100 tests.
  3661. 272.95 s [vector] takeWhile: OK
  3662. 272.95 s [vector] +++ OK, passed 100 tests.
  3663. 272.95 s [vector] dropWhile: OK
  3664. 272.95 s [vector] +++ OK, passed 100 tests.
  3665. 272.96 s [vector] partition: OK
  3666. 272.96 s [vector] +++ OK, passed 100 tests.
  3667. 272.96 s [vector] partitionWith: OK
  3668. 272.96 s [vector] +++ OK, passed 100 tests.
  3669. 272.96 s [vector] span: OK
  3670. 272.96 s [vector] +++ OK, passed 100 tests.
  3671. 272.96 s [vector] break: OK
  3672. 272.96 s [vector] +++ OK, passed 100 tests.
  3673. 272.96 s [vector] spanR: OK
  3674. 272.96 s [vector] +++ OK, passed 100 tests.
  3675. 272.96 s [vector] breakR: OK
  3676. 272.97 s [vector] +++ OK, passed 100 tests.
  3677. 272.97 s [vector] groupBy: OK
  3678. 272.97 s [vector] +++ OK, passed 100 tests.
  3679. 272.97 s [vector] elem: OK
  3680. 272.97 s [vector] +++ OK, passed 100 tests.
  3681. 272.97 s [vector] notElem: OK
  3682. 272.97 s [vector] +++ OK, passed 100 tests.
  3683. 272.97 s [vector] find: OK
  3684. 272.97 s [vector] +++ OK, passed 100 tests.
  3685. 272.97 s [vector] findIndex: OK
  3686. 272.97 s [vector] +++ OK, passed 100 tests.
  3687. 272.97 s [vector] findIndexR: OK
  3688. 272.97 s [vector] +++ OK, passed 100 tests.
  3689. 272.97 s [vector] findIndices: OK
  3690. 272.97 s [vector] +++ OK, passed 100 tests.
  3691. 272.97 s [vector] elemIndex: OK
  3692. 272.97 s [vector] +++ OK, passed 100 tests.
  3693. 272.98 s [vector] elemIndices: OK
  3694. 272.98 s [vector] +++ OK, passed 100 tests.
  3695. 272.98 s [vector] foldl: OK
  3696. 272.98 s [vector] +++ OK, passed 100 tests.
  3697. 272.98 s [vector] foldl1: OK
  3698. 272.99 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3699. 272.99 s [vector] foldl': OK
  3700. 272.99 s [vector] +++ OK, passed 100 tests.
  3701. 272.99 s [vector] foldl1': OK
  3702. 272.99 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3703. 272.99 s [vector] foldr: OK
  3704. 272.99 s [vector] +++ OK, passed 100 tests.
  3705. 272.99 s [vector] foldr1: OK
  3706. 272.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3707. 273.00 s [vector] foldr': OK
  3708. 273.00 s [vector] +++ OK, passed 100 tests.
  3709. 273.00 s [vector] foldr1': OK
  3710. 273.00 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3711. 273.00 s [vector] ifoldl: OK
  3712. 273.00 s [vector] +++ OK, passed 100 tests.
  3713. 273.01 s [vector] ifoldl': OK
  3714. 273.01 s [vector] +++ OK, passed 100 tests.
  3715. 273.01 s [vector] ifoldr: OK
  3716. 273.01 s [vector] +++ OK, passed 100 tests.
  3717. 273.01 s [vector] ifoldr': OK
  3718. 273.02 s [vector] +++ OK, passed 100 tests.
  3719. 273.02 s [vector] ifoldM: OK
  3720. 273.02 s [vector] +++ OK, passed 100 tests.
  3721. 273.03 s [vector] ifoldM': OK
  3722. 273.03 s [vector] +++ OK, passed 100 tests.
  3723. 273.05 s [vector] ifoldM_: OK (0.01s)
  3724. 273.05 s [vector] +++ OK, passed 100 tests.
  3725. 273.05 s [vector] ifoldM'_: OK (0.02s)
  3726. 273.05 s [vector] +++ OK, passed 100 tests.
  3727. 273.05 s [vector] all: OK
  3728. 273.05 s [vector] +++ OK, passed 100 tests.
  3729. 273.05 s [vector] any: OK
  3730. 273.06 s [vector] +++ OK, passed 100 tests.
  3731. 273.06 s [vector] prescanl: OK
  3732. 273.06 s [vector] +++ OK, passed 100 tests.
  3733. 273.06 s [vector] prescanl': OK
  3734. 273.06 s [vector] +++ OK, passed 100 tests.
  3735. 273.06 s [vector] postscanl: OK
  3736. 273.06 s [vector] +++ OK, passed 100 tests.
  3737. 273.06 s [vector] postscanl': OK
  3738. 273.07 s [vector] +++ OK, passed 100 tests.
  3739. 273.07 s [vector] scanl: OK
  3740. 273.07 s [vector] +++ OK, passed 100 tests.
  3741. 273.07 s [vector] scanl': OK
  3742. 273.07 s [vector] +++ OK, passed 100 tests.
  3743. 273.08 s [vector] scanl1: OK
  3744. 273.08 s [vector] +++ OK, passed 100 tests.
  3745. 273.08 s [vector] scanl1': OK
  3746. 273.08 s [vector] +++ OK, passed 100 tests.
  3747. 273.08 s [vector] iscanl: OK
  3748. 273.08 s [vector] +++ OK, passed 100 tests.
  3749. 273.09 s [vector] iscanl': OK
  3750. 273.09 s [vector] +++ OK, passed 100 tests.
  3751. 273.09 s [vector] prescanr: OK
  3752. 273.09 s [vector] +++ OK, passed 100 tests.
  3753. 273.09 s [vector] prescanr': OK
  3754. 273.09 s [vector] +++ OK, passed 100 tests.
  3755. 273.09 s [vector] postscanr: OK
  3756. 273.09 s [vector] +++ OK, passed 100 tests.
  3757. 273.10 s [vector] postscanr': OK
  3758. 273.10 s [vector] +++ OK, passed 100 tests.
  3759. 273.10 s [vector] scanr: OK
  3760. 273.10 s [vector] +++ OK, passed 100 tests.
  3761. 273.10 s [vector] scanr': OK
  3762. 273.10 s [vector] +++ OK, passed 100 tests.
  3763. 273.11 s [vector] scanr1: OK
  3764. 273.11 s [vector] +++ OK, passed 100 tests.
  3765. 273.11 s [vector] scanr1': OK
  3766. 273.11 s [vector] +++ OK, passed 100 tests.
  3767. 273.11 s [vector] iscanr: OK
  3768. 273.11 s [vector] +++ OK, passed 100 tests.
  3769. 273.11 s [vector] iscanr': OK
  3770. 273.11 s [vector] +++ OK, passed 100 tests.
  3771. 273.12 s [vector] mut_read: OK
  3772. 273.12 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3773. 273.12 s [vector] mut_write: OK
  3774. 273.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3775. 273.12 s [vector] mut_modify: OK
  3776. 273.12 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3777. 273.12 s [vector] mut_generate: OK
  3778. 273.13 s [vector] +++ OK, passed 100 tests.
  3779. 273.13 s [vector] mut_generateM: OK (0.01s)
  3780. 273.13 s [vector] +++ OK, passed 100 tests.
  3781. 273.14 s [vector] mut_mapM_: OK (0.01s)
  3782. 273.15 s [vector] +++ OK, passed 100 tests.
  3783. 273.17 s [vector] mut_imapM_: OK (0.01s)
  3784. 273.17 s [vector] +++ OK, passed 100 tests.
  3785. 273.19 s [vector] mut_forM_: OK (0.02s)
  3786. 273.19 s [vector] +++ OK, passed 100 tests.
  3787. 273.20 s [vector] mut_iforM_: OK (0.02s)
  3788. 273.20 s [vector] +++ OK, passed 100 tests.
  3789. 273.20 s [vector] mut_foldr: OK
  3790. 273.20 s [vector] +++ OK, passed 100 tests.
  3791. 273.20 s [vector] mut_foldr': OK
  3792. 273.21 s [vector] +++ OK, passed 100 tests.
  3793. 273.21 s [vector] mut_foldl: OK
  3794. 273.21 s [vector] +++ OK, passed 100 tests.
  3795. 273.21 s [vector] mut_foldl': OK
  3796. 273.22 s [vector] +++ OK, passed 100 tests.
  3797. 273.22 s [vector] mut_ifoldr: OK
  3798. 273.22 s [vector] +++ OK, passed 100 tests.
  3799. 273.22 s [vector] mut_ifoldr': OK
  3800. 273.22 s [vector] +++ OK, passed 100 tests.
  3801. 273.23 s [vector] mut_ifoldl: OK
  3802. 273.23 s [vector] +++ OK, passed 100 tests.
  3803. 273.23 s [vector] mut_ifoldl': OK
  3804. 273.23 s [vector] +++ OK, passed 100 tests.
  3805. 273.23 s [vector] mut_foldM: OK
  3806. 273.23 s [vector] +++ OK, passed 100 tests.
  3807. 273.23 s [vector] mut_foldM': OK
  3808. 273.24 s [vector] +++ OK, passed 100 tests.
  3809. 273.24 s [vector] mut_foldrM: OK
  3810. 273.24 s [vector] +++ OK, passed 100 tests.
  3811. 273.24 s [vector] mut_foldrM': OK
  3812. 273.24 s [vector] +++ OK, passed 100 tests.
  3813. 273.24 s [vector] mut_ifoldM: OK
  3814. 273.25 s [vector] +++ OK, passed 100 tests.
  3815. 273.25 s [vector] mut_ifoldM': OK
  3816. 273.25 s [vector] +++ OK, passed 100 tests.
  3817. 273.25 s [vector] mut_ifoldrM: OK
  3818. 273.25 s [vector] +++ OK, passed 100 tests.
  3819. 273.25 s [vector] mut_ifoldrM': OK
  3820. 273.25 s [vector] +++ OK, passed 100 tests.
  3821. 273.25 s [vector] compare: OK
  3822. 273.26 s [vector] +++ OK, passed 100 tests.
  3823. 273.26 s [vector] maximum: OK
  3824. 273.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3825. 273.26 s [vector] minimum: OK
  3826. 273.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3827. 273.26 s [vector] minIndex: OK
  3828. 273.26 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3829. 273.26 s [vector] maxIndex: OK
  3830. 273.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3831. 273.26 s [vector] maximumBy: OK
  3832. 273.26 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3833. 273.26 s [vector] minimumBy: OK
  3834. 273.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3835. 273.26 s [vector] maximumOn: OK
  3836. 273.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3837. 273.26 s [vector] minimumOn: OK
  3838. 273.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3839. 273.26 s [vector] maxIndexBy: OK
  3840. 273.26 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3841. 273.26 s [vector] minIndexBy: OK
  3842. 273.26 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3843. 273.26 s [vector] ListFirstMaxIndexWins: OK
  3844. 273.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3845. 273.26 s [vector] FalseListFirstMaxIndexWins: OK
  3846. 273.26 s [vector] +++ OK, failed as expected. (after 1 test):
  3847. 273.26 s [vector] Exception:
  3848. 273.26 s [vector] Prelude.foldr1: empty list
  3849. 273.26 s [vector] CallStack (from HasCallStack):
  3850. 273.26 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  3851. 273.26 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  3852. 273.26 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  3853. 273.26 s [vector] []
  3854. 273.26 s [vector] mempty: OK
  3855. 273.26 s [vector] +++ OK, passed 1 test.
  3856. 273.27 s [vector] mappend: OK
  3857. 273.27 s [vector] +++ OK, passed 100 tests.
  3858. 273.28 s [vector] mconcat: OK (0.01s)
  3859. 273.28 s [vector] +++ OK, passed 100 tests.
  3860. 273.28 s [vector] glength: OK
  3861. 273.28 s [vector] +++ OK, passed 100 tests.
  3862. 273.28 s [vector] sum: OK
  3863. 273.28 s [vector] +++ OK, passed 100 tests.
  3864. 273.28 s [vector] product: OK
  3865. 273.28 s [vector] +++ OK, passed 100 tests.
  3866. 273.28 s [vector] enumFromN: OK
  3867. 273.28 s [vector] +++ OK, passed 100 tests.
  3868. 273.28 s [vector] enumFromThenN: OK
  3869. 273.28 s [vector] +++ OK, passed 100 tests.
  3870. 273.28 s [vector] enumFromTo: OK
  3871. 273.28 s [vector] +++ OK, passed 100 tests.
  3872. 273.28 s [vector] enumFromThenTo: OK
  3873. 273.28 s [vector] +++ OK, passed 100 tests; 11 discarded.
  3874. 273.28 s [vector] Data.Vector.Storable.Vector (Double)
  3875. 273.28 s [vector] fromList.toList == id: OK
  3876. 273.28 s [vector] +++ OK, passed 100 tests.
  3877. 273.28 s [vector] toList.fromList == id: OK
  3878. 273.28 s [vector] +++ OK, passed 100 tests.
  3879. 273.28 s [vector] unstream.stream == id: OK
  3880. 273.28 s [vector] +++ OK, passed 100 tests.
  3881. 273.29 s [vector] stream.unstream == id: OK
  3882. 273.29 s [vector] +++ OK, passed 100 tests.
  3883. 273.29 s [vector] eq: OK
  3884. 273.29 s [vector] +++ OK, passed 100 tests.
  3885. 273.29 s [vector] length: OK
  3886. 273.29 s [vector] +++ OK, passed 100 tests.
  3887. 273.29 s [vector] null: OK
  3888. 273.29 s [vector] +++ OK, passed 100 tests.
  3889. 273.29 s [vector] index: OK
  3890. 273.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3891. 273.29 s [vector] safeIndex: OK
  3892. 273.29 s [vector] +++ OK, passed 100 tests.
  3893. 273.29 s [vector] head: OK
  3894. 273.29 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3895. 273.29 s [vector] last: OK
  3896. 273.29 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3897. 273.29 s [vector] unsafeIndex: OK
  3898. 273.29 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3899. 273.29 s [vector] unsafeHead: OK
  3900. 273.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3901. 273.29 s [vector] unsafeLast: OK
  3902. 273.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3903. 273.29 s [vector] slice: OK
  3904. 273.29 s [vector] +++ OK, passed 100 tests.
  3905. 273.29 s [vector] init: OK
  3906. 273.29 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3907. 273.29 s [vector] tail: OK
  3908. 273.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3909. 273.30 s [vector] take: OK
  3910. 273.30 s [vector] +++ OK, passed 100 tests.
  3911. 273.30 s [vector] drop: OK
  3912. 273.30 s [vector] +++ OK, passed 100 tests.
  3913. 273.30 s [vector] splitAt: OK
  3914. 273.30 s [vector] +++ OK, passed 100 tests.
  3915. 273.30 s [vector] empty: OK
  3916. 273.30 s [vector] +++ OK, passed 1 test.
  3917. 273.30 s [vector] singleton: OK
  3918. 273.30 s [vector] +++ OK, passed 100 tests.
  3919. 273.30 s [vector] replicate: OK
  3920. 273.30 s [vector] +++ OK, passed 100 tests.
  3921. 273.30 s [vector] generate: OK
  3922. 273.31 s [vector] +++ OK, passed 100 tests.
  3923. 273.31 s [vector] iterateN: OK
  3924. 273.31 s [vector] +++ OK, passed 100 tests.
  3925. 273.35 s [vector] iterateNM: OK (0.04s)
  3926. 273.35 s [vector] +++ OK, passed 100 tests.
  3927. 273.37 s [vector] generateM: OK (0.02s)
  3928. 273.37 s [vector] +++ OK, passed 100 tests.
  3929. 273.38 s [vector] replicateM: OK (0.01s)
  3930. 273.38 s [vector] +++ OK, passed 100 tests.
  3931. 273.38 s [vector] create: OK
  3932. 273.38 s [vector] +++ OK, passed 100 tests.
  3933. 273.38 s [vector] createT: OK
  3934. 273.38 s [vector] +++ OK, passed 100 tests.
  3935. 273.38 s [vector] unfoldr: OK
  3936. 273.38 s [vector] +++ OK, passed 100 tests.
  3937. 273.38 s [vector] unfoldrN: OK
  3938. 273.38 s [vector] +++ OK, passed 100 tests.
  3939. 273.39 s [vector] unfoldrExactN: OK
  3940. 273.39 s [vector] +++ OK, passed 100 tests.
  3941. 273.39 s [vector] unfoldrM: OK
  3942. 273.39 s [vector] +++ OK, passed 100 tests.
  3943. 273.39 s [vector] unfoldrNM: OK
  3944. 273.39 s [vector] +++ OK, passed 100 tests.
  3945. 273.43 s [vector] unfoldrExactNM: OK (0.03s)
  3946. 273.43 s [vector] +++ OK, passed 100 tests.
  3947. 273.45 s [vector] constructN: OK (0.02s)
  3948. 273.45 s [vector] +++ OK, passed 100 tests.
  3949. 273.46 s [vector] constructrN: OK (0.02s)
  3950. 273.46 s [vector] +++ OK, passed 100 tests.
  3951. 273.46 s [vector] cons: OK
  3952. 273.46 s [vector] +++ OK, passed 100 tests.
  3953. 273.46 s [vector] snoc: OK
  3954. 273.46 s [vector] +++ OK, passed 100 tests.
  3955. 273.46 s [vector] append: OK
  3956. 273.47 s [vector] +++ OK, passed 100 tests.
  3957. 273.49 s [vector] concat: OK (0.02s)
  3958. 273.49 s [vector] +++ OK, passed 100 tests.
  3959. 273.49 s [vector] force: OK
  3960. 273.49 s [vector] +++ OK, passed 100 tests.
  3961. 273.49 s [vector] upd: OK
  3962. 273.49 s [vector] +++ OK, passed 100 tests.
  3963. 273.51 s [vector] accum: OK (0.02s)
  3964. 273.51 s [vector] +++ OK, passed 100 tests.
  3965. 273.51 s [vector] reverse: OK
  3966. 273.51 s [vector] +++ OK, passed 100 tests.
  3967. 273.51 s [vector] backpermute: OK
  3968. 273.52 s [vector] +++ OK, passed 100 tests.
  3969. 273.53 s [vector] map: OK
  3970. 273.53 s [vector] +++ OK, passed 100 tests.
  3971. 273.53 s [vector] imap: OK
  3972. 273.53 s [vector] +++ OK, passed 100 tests.
  3973. 273.54 s [vector] concatMap: OK
  3974. 273.55 s [vector] +++ OK, passed 100 tests.
  3975. 273.55 s [vector] mapM: OK
  3976. 273.55 s [vector] +++ OK, passed 100 tests.
  3977. 273.59 s [vector] mapM_: OK (0.04s)
  3978. 273.59 s [vector] +++ OK, passed 100 tests.
  3979. 273.59 s [vector] forM: OK
  3980. 273.59 s [vector] +++ OK, passed 100 tests.
  3981. 273.63 s [vector] forM_: OK (0.03s)
  3982. 273.63 s [vector] +++ OK, passed 100 tests.
  3983. 273.63 s [vector] imapM: OK (0.01s)
  3984. 273.63 s [vector] +++ OK, passed 100 tests.
  3985. 273.67 s [vector] imapM_: OK (0.03s)
  3986. 273.67 s [vector] +++ OK, passed 100 tests.
  3987. 273.68 s [vector] zipWith: OK (0.01s)
  3988. 273.68 s [vector] +++ OK, passed 100 tests.
  3989. 273.68 s [vector] zipWith3: OK (0.01s)
  3990. 273.68 s [vector] +++ OK, passed 100 tests.
  3991. 273.71 s [vector] izipWith: OK (0.01s)
  3992. 273.71 s [vector] +++ OK, passed 100 tests.
  3993. 273.71 s [vector] izipWith3: OK (0.01s)
  3994. 273.71 s [vector] +++ OK, passed 100 tests.
  3995. 273.73 s [vector] izipWithM: OK (0.01s)
  3996. 273.73 s [vector] +++ OK, passed 100 tests.
  3997. 273.76 s [vector] izipWithM_: OK (0.03s)
  3998. 273.77 s [vector] +++ OK, passed 100 tests.
  3999. 273.77 s [vector] zipWithM: OK
  4000. 273.77 s [vector] +++ OK, passed 100 tests.
  4001. 273.80 s [vector] zipWithM_: OK (0.03s)
  4002. 273.81 s [vector] +++ OK, passed 100 tests.
  4003. 273.81 s [vector] filter: OK (0.01s)
  4004. 273.81 s [vector] +++ OK, passed 100 tests.
  4005. 273.83 s [vector] ifilter: OK (0.01s)
  4006. 273.83 s [vector] +++ OK, passed 100 tests.
  4007. 273.85 s [vector] filterM: OK (0.04s)
  4008. 273.85 s [vector] +++ OK, passed 100 tests.
  4009. 273.86 s [vector] uniq: OK
  4010. 273.87 s [vector] +++ OK, passed 100 tests.
  4011. 273.87 s [vector] mapMaybe: OK
  4012. 273.87 s [vector] +++ OK, passed 100 tests.
  4013. 273.88 s [vector] imapMaybe: OK
  4014. 273.89 s [vector] +++ OK, passed 100 tests.
  4015. 273.89 s [vector] takeWhile: OK
  4016. 273.89 s [vector] +++ OK, passed 100 tests.
  4017. 273.89 s [vector] dropWhile: OK
  4018. 273.89 s [vector] +++ OK, passed 100 tests.
  4019. 273.89 s [vector] partition: OK
  4020. 273.89 s [vector] +++ OK, passed 100 tests.
  4021. 273.90 s [vector] partitionWith: OK (0.01s)
  4022. 273.90 s [vector] +++ OK, passed 100 tests.
  4023. 273.90 s [vector] span: OK
  4024. 273.91 s [vector] +++ OK, passed 100 tests.
  4025. 273.91 s [vector] break: OK
  4026. 273.91 s [vector] +++ OK, passed 100 tests.
  4027. 273.91 s [vector] spanR: OK
  4028. 273.91 s [vector] +++ OK, passed 100 tests.
  4029. 273.91 s [vector] breakR: OK
  4030. 273.91 s [vector] +++ OK, passed 100 tests.
  4031. 273.91 s [vector] groupBy: OK
  4032. 273.91 s [vector] +++ OK, passed 100 tests.
  4033. 273.91 s [vector] elem: OK
  4034. 273.91 s [vector] +++ OK, passed 100 tests.
  4035. 273.91 s [vector] notElem: OK
  4036. 273.92 s [vector] +++ OK, passed 100 tests.
  4037. 273.92 s [vector] find: OK
  4038. 273.92 s [vector] +++ OK, passed 100 tests.
  4039. 273.92 s [vector] findIndex: OK
  4040. 273.92 s [vector] +++ OK, passed 100 tests.
  4041. 273.92 s [vector] findIndexR: OK
  4042. 273.93 s [vector] +++ OK, passed 100 tests.
  4043. 273.93 s [vector] findIndices: OK
  4044. 273.93 s [vector] +++ OK, passed 100 tests.
  4045. 273.93 s [vector] elemIndex: OK
  4046. 273.93 s [vector] +++ OK, passed 100 tests.
  4047. 273.93 s [vector] elemIndices: OK
  4048. 273.93 s [vector] +++ OK, passed 100 tests.
  4049. 273.95 s [vector] foldl: OK (0.01s)
  4050. 273.95 s [vector] +++ OK, passed 100 tests.
  4051. 273.97 s [vector] foldl1: OK (0.02s)
  4052. 273.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4053. 273.99 s [vector] foldl': OK (0.01s)
  4054. 273.99 s [vector] +++ OK, passed 100 tests.
  4055. 273.99 s [vector] foldl1': OK (0.01s)
  4056. 273.99 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4057. 274.01 s [vector] foldr: OK (0.02s)
  4058. 274.01 s [vector] +++ OK, passed 100 tests.
  4059. 274.03 s [vector] foldr1: OK (0.02s)
  4060. 274.03 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4061. 274.05 s [vector] foldr': OK (0.02s)
  4062. 274.05 s [vector] +++ OK, passed 100 tests.
  4063. 274.07 s [vector] foldr1': OK (0.02s)
  4064. 274.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4065. 274.07 s [vector] ifoldl: OK (0.02s)
  4066. 274.07 s [vector] +++ OK, passed 100 tests.
  4067. 274.09 s [vector] ifoldl': OK (0.01s)
  4068. 274.09 s [vector] +++ OK, passed 100 tests.
  4069. 274.11 s [vector] ifoldr: OK (0.01s)
  4070. 274.11 s [vector] +++ OK, passed 100 tests.
  4071. 274.11 s [vector] ifoldr': OK (0.01s)
  4072. 274.11 s [vector] +++ OK, passed 100 tests.
  4073. 274.13 s [vector] ifoldM: OK (0.01s)
  4074. 274.13 s [vector] +++ OK, passed 100 tests.
  4075. 274.15 s [vector] ifoldM': OK (0.01s)
  4076. 274.15 s [vector] +++ OK, passed 100 tests.
  4077. 274.17 s [vector] ifoldM_: OK (0.03s)
  4078. 274.17 s [vector] +++ OK, passed 100 tests.
  4079. 274.21 s [vector] ifoldM'_: OK (0.04s)
  4080. 274.21 s [vector] +++ OK, passed 100 tests.
  4081. 274.21 s [vector] all: OK
  4082. 274.21 s [vector] +++ OK, passed 100 tests.
  4083. 274.21 s [vector] any: OK
  4084. 274.21 s [vector] +++ OK, passed 100 tests.
  4085. 274.23 s [vector] prescanl: OK (0.01s)
  4086. 274.23 s [vector] +++ OK, passed 100 tests.
  4087. 274.25 s [vector] prescanl': OK (0.01s)
  4088. 274.25 s [vector] +++ OK, passed 100 tests.
  4089. 274.25 s [vector] postscanl: OK (0.01s)
  4090. 274.26 s [vector] +++ OK, passed 100 tests.
  4091. 274.27 s [vector] postscanl': OK (0.01s)
  4092. 274.27 s [vector] +++ OK, passed 100 tests.
  4093. 274.29 s [vector] scanl: OK (0.02s)
  4094. 274.29 s [vector] +++ OK, passed 100 tests.
  4095. 274.31 s [vector] scanl': OK (0.02s)
  4096. 274.31 s [vector] +++ OK, passed 100 tests.
  4097. 274.33 s [vector] scanl1: OK (0.02s)
  4098. 274.33 s [vector] +++ OK, passed 100 tests.
  4099. 274.35 s [vector] scanl1': OK (0.02s)
  4100. 274.35 s [vector] +++ OK, passed 100 tests.
  4101. 274.37 s [vector] iscanl: OK (0.02s)
  4102. 274.37 s [vector] +++ OK, passed 100 tests.
  4103. 274.39 s [vector] iscanl': OK (0.01s)
  4104. 274.39 s [vector] +++ OK, passed 100 tests.
  4105. 274.41 s [vector] prescanr: OK (0.02s)
  4106. 274.41 s [vector] +++ OK, passed 100 tests.
  4107. 274.43 s [vector] prescanr': OK (0.02s)
  4108. 274.43 s [vector] +++ OK, passed 100 tests.
  4109. 274.43 s [vector] postscanr: OK (0.02s)
  4110. 274.44 s [vector] +++ OK, passed 100 tests.
  4111. 274.45 s [vector] postscanr': OK (0.01s)
  4112. 274.45 s [vector] +++ OK, passed 100 tests.
  4113. 274.47 s [vector] scanr: OK (0.02s)
  4114. 274.47 s [vector] +++ OK, passed 100 tests.
  4115. 274.49 s [vector] scanr': OK (0.01s)
  4116. 274.49 s [vector] +++ OK, passed 100 tests.
  4117. 274.49 s [vector] scanr1: OK (0.01s)
  4118. 274.49 s [vector] +++ OK, passed 100 tests.
  4119. 274.51 s [vector] scanr1': OK (0.01s)
  4120. 274.51 s [vector] +++ OK, passed 100 tests.
  4121. 274.53 s [vector] iscanr: OK (0.02s)
  4122. 274.53 s [vector] +++ OK, passed 100 tests.
  4123. 274.53 s [vector] iscanr': OK (0.01s)
  4124. 274.53 s [vector] +++ OK, passed 100 tests.
  4125. 274.53 s [vector] mut_read: OK
  4126. 274.53 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4127. 274.54 s [vector] mut_write: OK
  4128. 274.54 s [vector] +++ OK, passed 100 tests; 26 discarded.
  4129. 274.54 s [vector] mut_modify: OK
  4130. 274.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4131. 274.54 s [vector] mut_generate: OK
  4132. 274.55 s [vector] +++ OK, passed 100 tests.
  4133. 274.57 s [vector] mut_generateM: OK (0.02s)
  4134. 274.57 s [vector] +++ OK, passed 100 tests.
  4135. 274.61 s [vector] mut_mapM_: OK (0.03s)
  4136. 274.61 s [vector] +++ OK, passed 100 tests.
  4137. 274.63 s [vector] mut_imapM_: OK (0.04s)
  4138. 274.63 s [vector] +++ OK, passed 100 tests.
  4139. 274.67 s [vector] mut_forM_: OK (0.02s)
  4140. 274.67 s [vector] +++ OK, passed 100 tests.
  4141. 274.71 s [vector] mut_iforM_: OK (0.04s)
  4142. 274.71 s [vector] +++ OK, passed 100 tests.
  4143. 274.73 s [vector] mut_foldr: OK (0.02s)
  4144. 274.73 s [vector] +++ OK, passed 100 tests.
  4145. 274.75 s [vector] mut_foldr': OK (0.01s)
  4146. 274.75 s [vector] +++ OK, passed 100 tests.
  4147. 274.77 s [vector] mut_foldl: OK (0.02s)
  4148. 274.77 s [vector] +++ OK, passed 100 tests.
  4149. 274.77 s [vector] mut_foldl': OK (0.02s)
  4150. 274.77 s [vector] +++ OK, passed 100 tests.
  4151. 274.79 s [vector] mut_ifoldr: OK (0.02s)
  4152. 274.79 s [vector] +++ OK, passed 100 tests.
  4153. 274.81 s [vector] mut_ifoldr': OK (0.02s)
  4154. 274.81 s [vector] +++ OK, passed 100 tests.
  4155. 274.83 s [vector] mut_ifoldl: OK (0.01s)
  4156. 274.83 s [vector] +++ OK, passed 100 tests.
  4157. 274.85 s [vector] mut_ifoldl': OK (0.02s)
  4158. 274.85 s [vector] +++ OK, passed 100 tests.
  4159. 274.86 s [vector] mut_foldM: OK (0.01s)
  4160. 274.86 s [vector] +++ OK, passed 100 tests.
  4161. 274.87 s [vector] mut_foldM': OK (0.01s)
  4162. 274.87 s [vector] +++ OK, passed 100 tests.
  4163. 274.89 s [vector] mut_foldrM: OK (0.02s)
  4164. 274.89 s [vector] +++ OK, passed 100 tests.
  4165. 274.91 s [vector] mut_foldrM': OK (0.02s)
  4166. 274.91 s [vector] +++ OK, passed 100 tests.
  4167. 274.95 s [vector] mut_ifoldM: OK (0.03s)
  4168. 274.95 s [vector] +++ OK, passed 100 tests.
  4169. 274.97 s [vector] mut_ifoldM': OK (0.02s)
  4170. 274.97 s [vector] +++ OK, passed 100 tests.
  4171. 274.99 s [vector] mut_ifoldrM: OK (0.02s)
  4172. 274.99 s [vector] +++ OK, passed 100 tests.
  4173. 274.99 s [vector] mut_ifoldrM': OK (0.02s)
  4174. 274.99 s [vector] +++ OK, passed 100 tests.
  4175. 274.99 s [vector] compare: OK
  4176. 274.99 s [vector] +++ OK, passed 100 tests.
  4177. 274.99 s [vector] maximum: OK
  4178. 274.99 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4179. 274.99 s [vector] minimum: OK
  4180. 274.99 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4181. 274.99 s [vector] minIndex: OK
  4182. 274.99 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4183. 275.00 s [vector] maxIndex: OK
  4184. 275.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4185. 275.00 s [vector] maximumBy: OK
  4186. 275.00 s [vector] +++ OK, passed 100 tests; 24 discarded.
  4187. 275.00 s [vector] minimumBy: OK
  4188. 275.00 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4189. 275.00 s [vector] maximumOn: OK
  4190. 275.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4191. 275.00 s [vector] minimumOn: OK
  4192. 275.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4193. 275.00 s [vector] maxIndexBy: OK
  4194. 275.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4195. 275.00 s [vector] minIndexBy: OK
  4196. 275.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4197. 275.00 s [vector] ListFirstMaxIndexWins: OK
  4198. 275.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4199. 275.00 s [vector] FalseListFirstMaxIndexWins: OK
  4200. 275.00 s [vector] +++ OK, failed as expected. (after 1 test):
  4201. 275.00 s [vector] Exception:
  4202. 275.00 s [vector] Prelude.foldr1: empty list
  4203. 275.00 s [vector] CallStack (from HasCallStack):
  4204. 275.00 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  4205. 275.00 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  4206. 275.00 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  4207. 275.00 s [vector] []
  4208. 275.00 s [vector] mempty: OK
  4209. 275.01 s [vector] +++ OK, passed 1 test.
  4210. 275.01 s [vector] mappend: OK
  4211. 275.01 s [vector] +++ OK, passed 100 tests.
  4212. 275.03 s [vector] mconcat: OK (0.02s)
  4213. 275.03 s [vector] +++ OK, passed 100 tests.
  4214. 275.03 s [vector] glength: OK
  4215. 275.03 s [vector] +++ OK, passed 100 tests.
  4216. 275.03 s [vector] sum: OK
  4217. 275.03 s [vector] +++ OK, passed 100 tests.
  4218. 275.03 s [vector] product: OK
  4219. 275.03 s [vector] +++ OK, passed 100 tests.
  4220. 275.03 s [vector] enumFromN: OK
  4221. 275.03 s [vector] +++ OK, passed 100 tests.
  4222. 275.03 s [vector] enumFromThenN: OK
  4223. 275.03 s [vector] +++ OK, passed 100 tests.
  4224. 275.03 s [vector] enumFromTo: OK
  4225. 275.03 s [vector] +++ OK, passed 100 tests.
  4226. 275.03 s [vector] enumFromThenTo: OK
  4227. 275.03 s [vector] +++ OK, passed 100 tests; 2 discarded.
  4228. 275.03 s [vector] unstream
  4229. 275.03 s [vector] unstream == vunstream (exact): OK
  4230. 275.04 s [vector] +++ OK, passed 100 tests.
  4231. 275.04 s [vector] unstream == vunstream (unknown): OK
  4232. 275.04 s [vector] +++ OK, passed 100 tests.
  4233. 275.04 s [vector] unstreamR ~= vunstream (exact): OK
  4234. 275.04 s [vector] +++ OK, passed 100 tests.
  4235. 275.04 s [vector] unstreamR ~= vunstream (unknown): OK
  4236. 275.04 s [vector] +++ OK, passed 100 tests.
  4237. 275.04 s [vector] Tests.Vector.Strict
  4238. 275.04 s [vector] Bool
  4239. 275.04 s [vector] fromList.toList == id: OK
  4240. 275.04 s [vector] +++ OK, passed 100 tests.
  4241. 275.04 s [vector] toList.fromList == id: OK
  4242. 275.04 s [vector] +++ OK, passed 100 tests.
  4243. 275.04 s [vector] unstream.stream == id: OK
  4244. 275.04 s [vector] +++ OK, passed 100 tests.
  4245. 275.04 s [vector] stream.unstream == id: OK
  4246. 275.04 s [vector] +++ OK, passed 100 tests.
  4247. 275.04 s [vector] eq: OK
  4248. 275.04 s [vector] +++ OK, passed 100 tests.
  4249. 275.04 s [vector] length: OK
  4250. 275.04 s [vector] +++ OK, passed 100 tests.
  4251. 275.04 s [vector] null: OK
  4252. 275.04 s [vector] +++ OK, passed 100 tests.
  4253. 275.04 s [vector] index: OK
  4254. 275.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4255. 275.04 s [vector] safeIndex: OK
  4256. 275.04 s [vector] +++ OK, passed 100 tests.
  4257. 275.04 s [vector] head: OK
  4258. 275.04 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4259. 275.04 s [vector] last: OK
  4260. 275.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4261. 275.05 s [vector] unsafeIndex: OK
  4262. 275.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4263. 275.05 s [vector] unsafeHead: OK
  4264. 275.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4265. 275.05 s [vector] unsafeLast: OK
  4266. 275.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4267. 275.05 s [vector] slice: OK
  4268. 275.05 s [vector] +++ OK, passed 100 tests.
  4269. 275.05 s [vector] init: OK
  4270. 275.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4271. 275.05 s [vector] tail: OK
  4272. 275.05 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4273. 275.05 s [vector] take: OK
  4274. 275.05 s [vector] +++ OK, passed 100 tests.
  4275. 275.05 s [vector] drop: OK
  4276. 275.05 s [vector] +++ OK, passed 100 tests.
  4277. 275.05 s [vector] splitAt: OK
  4278. 275.05 s [vector] +++ OK, passed 100 tests.
  4279. 275.05 s [vector] empty: OK
  4280. 275.05 s [vector] +++ OK, passed 1 test.
  4281. 275.05 s [vector] singleton: OK
  4282. 275.05 s [vector] +++ OK, passed 100 tests.
  4283. 275.05 s [vector] replicate: OK
  4284. 275.05 s [vector] +++ OK, passed 100 tests.
  4285. 275.05 s [vector] generate: OK
  4286. 275.05 s [vector] +++ OK, passed 100 tests.
  4287. 275.07 s [vector] iterateN: OK
  4288. 275.07 s [vector] +++ OK, passed 100 tests.
  4289. 275.11 s [vector] iterateNM: OK (0.04s)
  4290. 275.11 s [vector] +++ OK, passed 100 tests.
  4291. 275.11 s [vector] generateM: OK (0.01s)
  4292. 275.11 s [vector] +++ OK, passed 100 tests.
  4293. 275.12 s [vector] replicateM: OK (0.01s)
  4294. 275.12 s [vector] +++ OK, passed 100 tests.
  4295. 275.12 s [vector] create: OK
  4296. 275.12 s [vector] +++ OK, passed 100 tests.
  4297. 275.12 s [vector] createT: OK
  4298. 275.12 s [vector] +++ OK, passed 100 tests.
  4299. 275.12 s [vector] unfoldr: OK
  4300. 275.12 s [vector] +++ OK, passed 100 tests.
  4301. 275.12 s [vector] unfoldrN: OK
  4302. 275.12 s [vector] +++ OK, passed 100 tests.
  4303. 275.12 s [vector] unfoldrExactN: OK
  4304. 275.12 s [vector] +++ OK, passed 100 tests.
  4305. 275.12 s [vector] unfoldrM: OK
  4306. 275.12 s [vector] +++ OK, passed 100 tests.
  4307. 275.13 s [vector] unfoldrNM: OK
  4308. 275.13 s [vector] +++ OK, passed 100 tests.
  4309. 275.17 s [vector] unfoldrExactNM: OK (0.04s)
  4310. 275.17 s [vector] +++ OK, passed 100 tests.
  4311. 275.18 s [vector] constructN: OK
  4312. 275.18 s [vector] +++ OK, passed 100 tests.
  4313. 275.18 s [vector] constructrN: OK
  4314. 275.18 s [vector] +++ OK, passed 100 tests.
  4315. 275.18 s [vector] cons: OK
  4316. 275.18 s [vector] +++ OK, passed 100 tests.
  4317. 275.18 s [vector] snoc: OK
  4318. 275.18 s [vector] +++ OK, passed 100 tests.
  4319. 275.18 s [vector] append: OK
  4320. 275.19 s [vector] +++ OK, passed 100 tests.
  4321. 275.19 s [vector] concat: OK
  4322. 275.19 s [vector] +++ OK, passed 100 tests.
  4323. 275.19 s [vector] force: OK
  4324. 275.19 s [vector] +++ OK, passed 100 tests.
  4325. 275.19 s [vector] upd: OK
  4326. 275.19 s [vector] +++ OK, passed 100 tests.
  4327. 275.19 s [vector] accum: OK
  4328. 275.19 s [vector] +++ OK, passed 100 tests.
  4329. 275.19 s [vector] reverse: OK
  4330. 275.19 s [vector] +++ OK, passed 100 tests.
  4331. 275.19 s [vector] backpermute: OK
  4332. 275.19 s [vector] +++ OK, passed 100 tests.
  4333. 275.19 s [vector] map: OK
  4334. 275.19 s [vector] +++ OK, passed 100 tests.
  4335. 275.19 s [vector] imap: OK
  4336. 275.20 s [vector] +++ OK, passed 100 tests.
  4337. 275.20 s [vector] concatMap: OK
  4338. 275.20 s [vector] +++ OK, passed 100 tests.
  4339. 275.20 s [vector] mapM: OK
  4340. 275.21 s [vector] +++ OK, passed 100 tests.
  4341. 275.21 s [vector] mapM_: OK (0.01s)
  4342. 275.21 s [vector] +++ OK, passed 100 tests.
  4343. 275.21 s [vector] forM: OK
  4344. 275.21 s [vector] +++ OK, passed 100 tests.
  4345. 275.23 s [vector] forM_: OK (0.01s)
  4346. 275.23 s [vector] +++ OK, passed 100 tests.
  4347. 275.23 s [vector] imapM: OK
  4348. 275.23 s [vector] +++ OK, passed 100 tests.
  4349. 275.24 s [vector] imapM_: OK (0.01s)
  4350. 275.24 s [vector] +++ OK, passed 100 tests.
  4351. 275.24 s [vector] zipWith: OK
  4352. 275.25 s [vector] +++ OK, passed 100 tests.
  4353. 275.25 s [vector] zipWith3: OK
  4354. 275.25 s [vector] +++ OK, passed 100 tests.
  4355. 275.25 s [vector] izipWith: OK
  4356. 275.25 s [vector] +++ OK, passed 100 tests.
  4357. 275.25 s [vector] izipWith3: OK
  4358. 275.25 s [vector] +++ OK, passed 100 tests.
  4359. 275.26 s [vector] izipWithM: OK
  4360. 275.26 s [vector] +++ OK, passed 100 tests.
  4361. 275.27 s [vector] izipWithM_: OK (0.01s)
  4362. 275.27 s [vector] +++ OK, passed 100 tests.
  4363. 275.27 s [vector] zipWithM: OK
  4364. 275.27 s [vector] +++ OK, passed 100 tests.
  4365. 275.27 s [vector] zipWithM_: OK
  4366. 275.27 s [vector] +++ OK, passed 100 tests.
  4367. 275.27 s [vector] filter: OK
  4368. 275.28 s [vector] +++ OK, passed 100 tests.
  4369. 275.28 s [vector] ifilter: OK
  4370. 275.29 s [vector] +++ OK, passed 100 tests.
  4371. 275.29 s [vector] filterM: OK (0.01s)
  4372. 275.29 s [vector] +++ OK, passed 100 tests.
  4373. 275.29 s [vector] uniq: OK
  4374. 275.29 s [vector] +++ OK, passed 100 tests.
  4375. 275.29 s [vector] mapMaybe: OK
  4376. 275.29 s [vector] +++ OK, passed 100 tests.
  4377. 275.30 s [vector] imapMaybe: OK
  4378. 275.30 s [vector] +++ OK, passed 100 tests.
  4379. 275.30 s [vector] takeWhile: OK
  4380. 275.30 s [vector] +++ OK, passed 100 tests.
  4381. 275.30 s [vector] dropWhile: OK
  4382. 275.30 s [vector] +++ OK, passed 100 tests.
  4383. 275.30 s [vector] partition: OK
  4384. 275.30 s [vector] +++ OK, passed 100 tests.
  4385. 275.30 s [vector] partitionWith: OK
  4386. 275.30 s [vector] +++ OK, passed 100 tests.
  4387. 275.30 s [vector] span: OK
  4388. 275.30 s [vector] +++ OK, passed 100 tests.
  4389. 275.30 s [vector] break: OK
  4390. 275.30 s [vector] +++ OK, passed 100 tests.
  4391. 275.30 s [vector] spanR: OK
  4392. 275.30 s [vector] +++ OK, passed 100 tests.
  4393. 275.30 s [vector] breakR: OK
  4394. 275.30 s [vector] +++ OK, passed 100 tests.
  4395. 275.30 s [vector] groupBy: OK
  4396. 275.30 s [vector] +++ OK, passed 100 tests.
  4397. 275.30 s [vector] elem: OK
  4398. 275.30 s [vector] +++ OK, passed 100 tests.
  4399. 275.30 s [vector] notElem: OK
  4400. 275.30 s [vector] +++ OK, passed 100 tests.
  4401. 275.30 s [vector] find: OK
  4402. 275.30 s [vector] +++ OK, passed 100 tests.
  4403. 275.30 s [vector] findIndex: OK
  4404. 275.30 s [vector] +++ OK, passed 100 tests.
  4405. 275.30 s [vector] findIndexR: OK
  4406. 275.31 s [vector] +++ OK, passed 100 tests.
  4407. 275.31 s [vector] findIndices: OK
  4408. 275.31 s [vector] +++ OK, passed 100 tests.
  4409. 275.31 s [vector] elemIndex: OK
  4410. 275.31 s [vector] +++ OK, passed 100 tests.
  4411. 275.31 s [vector] elemIndices: OK
  4412. 275.31 s [vector] +++ OK, passed 100 tests.
  4413. 275.31 s [vector] foldl: OK
  4414. 275.31 s [vector] +++ OK, passed 100 tests.
  4415. 275.31 s [vector] foldl1: OK
  4416. 275.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4417. 275.31 s [vector] foldl': OK
  4418. 275.31 s [vector] +++ OK, passed 100 tests.
  4419. 275.31 s [vector] foldl1': OK
  4420. 275.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4421. 275.31 s [vector] foldr: OK
  4422. 275.31 s [vector] +++ OK, passed 100 tests.
  4423. 275.31 s [vector] foldr1: OK
  4424. 275.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4425. 275.31 s [vector] foldr': OK
  4426. 275.32 s [vector] +++ OK, passed 100 tests.
  4427. 275.32 s [vector] foldr1': OK
  4428. 275.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4429. 275.32 s [vector] ifoldl: OK
  4430. 275.32 s [vector] +++ OK, passed 100 tests.
  4431. 275.32 s [vector] ifoldl': OK
  4432. 275.32 s [vector] +++ OK, passed 100 tests.
  4433. 275.33 s [vector] ifoldr: OK
  4434. 275.33 s [vector] +++ OK, passed 100 tests.
  4435. 275.33 s [vector] ifoldr': OK
  4436. 275.33 s [vector] +++ OK, passed 100 tests.
  4437. 275.33 s [vector] ifoldM: OK
  4438. 275.33 s [vector] +++ OK, passed 100 tests.
  4439. 275.33 s [vector] ifoldM': OK
  4440. 275.34 s [vector] +++ OK, passed 100 tests.
  4441. 275.35 s [vector] ifoldM_: OK (0.01s)
  4442. 275.35 s [vector] +++ OK, passed 100 tests.
  4443. 275.36 s [vector] ifoldM'_: OK (0.01s)
  4444. 275.36 s [vector] +++ OK, passed 100 tests.
  4445. 275.36 s [vector] all: OK
  4446. 275.36 s [vector] +++ OK, passed 100 tests.
  4447. 275.36 s [vector] any: OK
  4448. 275.36 s [vector] +++ OK, passed 100 tests.
  4449. 275.36 s [vector] prescanl: OK
  4450. 275.36 s [vector] +++ OK, passed 100 tests.
  4451. 275.36 s [vector] prescanl': OK
  4452. 275.36 s [vector] +++ OK, passed 100 tests.
  4453. 275.36 s [vector] postscanl: OK
  4454. 275.37 s [vector] +++ OK, passed 100 tests.
  4455. 275.37 s [vector] postscanl': OK
  4456. 275.37 s [vector] +++ OK, passed 100 tests.
  4457. 275.37 s [vector] scanl: OK
  4458. 275.37 s [vector] +++ OK, passed 100 tests.
  4459. 275.37 s [vector] scanl': OK
  4460. 275.37 s [vector] +++ OK, passed 100 tests.
  4461. 275.37 s [vector] scanl1: OK
  4462. 275.37 s [vector] +++ OK, passed 100 tests.
  4463. 275.37 s [vector] scanl1': OK
  4464. 275.37 s [vector] +++ OK, passed 100 tests.
  4465. 275.37 s [vector] iscanl: OK
  4466. 275.38 s [vector] +++ OK, passed 100 tests.
  4467. 275.38 s [vector] iscanl': OK
  4468. 275.38 s [vector] +++ OK, passed 100 tests.
  4469. 275.38 s [vector] prescanr: OK
  4470. 275.38 s [vector] +++ OK, passed 100 tests.
  4471. 275.38 s [vector] prescanr': OK
  4472. 275.38 s [vector] +++ OK, passed 100 tests.
  4473. 275.38 s [vector] postscanr: OK
  4474. 275.38 s [vector] +++ OK, passed 100 tests.
  4475. 275.38 s [vector] postscanr': OK
  4476. 275.38 s [vector] +++ OK, passed 100 tests.
  4477. 275.38 s [vector] scanr: OK
  4478. 275.38 s [vector] +++ OK, passed 100 tests.
  4479. 275.39 s [vector] scanr': OK
  4480. 275.39 s [vector] +++ OK, passed 100 tests.
  4481. 275.39 s [vector] scanr1: OK
  4482. 275.39 s [vector] +++ OK, passed 100 tests.
  4483. 275.39 s [vector] scanr1': OK
  4484. 275.39 s [vector] +++ OK, passed 100 tests.
  4485. 275.39 s [vector] iscanr: OK
  4486. 275.39 s [vector] +++ OK, passed 100 tests.
  4487. 275.39 s [vector] iscanr': OK
  4488. 275.39 s [vector] +++ OK, passed 100 tests.
  4489. 275.39 s [vector] mut_read: OK
  4490. 275.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4491. 275.39 s [vector] mut_write: OK
  4492. 275.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4493. 275.39 s [vector] mut_modify: OK
  4494. 275.40 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4495. 275.40 s [vector] mut_generate: OK
  4496. 275.40 s [vector] +++ OK, passed 100 tests.
  4497. 275.41 s [vector] mut_generateM: OK
  4498. 275.41 s [vector] +++ OK, passed 100 tests.
  4499. 275.42 s [vector] mut_mapM_: OK
  4500. 275.43 s [vector] +++ OK, passed 100 tests.
  4501. 275.43 s [vector] mut_imapM_: OK (0.01s)
  4502. 275.43 s [vector] +++ OK, passed 100 tests.
  4503. 275.45 s [vector] mut_forM_: OK
  4504. 275.45 s [vector] +++ OK, passed 100 tests.
  4505. 275.45 s [vector] mut_iforM_: OK (0.01s)
  4506. 275.45 s [vector] +++ OK, passed 100 tests.
  4507. 275.45 s [vector] mut_foldr: OK
  4508. 275.45 s [vector] +++ OK, passed 100 tests.
  4509. 275.45 s [vector] mut_foldr': OK
  4510. 275.45 s [vector] +++ OK, passed 100 tests.
  4511. 275.45 s [vector] mut_foldl: OK
  4512. 275.45 s [vector] +++ OK, passed 100 tests.
  4513. 275.45 s [vector] mut_foldl': OK
  4514. 275.46 s [vector] +++ OK, passed 100 tests.
  4515. 275.46 s [vector] mut_ifoldr: OK
  4516. 275.46 s [vector] +++ OK, passed 100 tests.
  4517. 275.46 s [vector] mut_ifoldr': OK
  4518. 275.46 s [vector] +++ OK, passed 100 tests.
  4519. 275.46 s [vector] mut_ifoldl: OK
  4520. 275.46 s [vector] +++ OK, passed 100 tests.
  4521. 275.46 s [vector] mut_ifoldl': OK
  4522. 275.47 s [vector] +++ OK, passed 100 tests.
  4523. 275.47 s [vector] mut_foldM: OK
  4524. 275.47 s [vector] +++ OK, passed 100 tests.
  4525. 275.47 s [vector] mut_foldM': OK
  4526. 275.48 s [vector] +++ OK, passed 100 tests.
  4527. 275.48 s [vector] mut_foldrM: OK
  4528. 275.48 s [vector] +++ OK, passed 100 tests.
  4529. 275.48 s [vector] mut_foldrM': OK
  4530. 275.48 s [vector] +++ OK, passed 100 tests.
  4531. 275.48 s [vector] mut_ifoldM: OK
  4532. 275.48 s [vector] +++ OK, passed 100 tests.
  4533. 275.48 s [vector] mut_ifoldM': OK
  4534. 275.48 s [vector] +++ OK, passed 100 tests.
  4535. 275.48 s [vector] mut_ifoldrM: OK
  4536. 275.48 s [vector] +++ OK, passed 100 tests.
  4537. 275.48 s [vector] mut_ifoldrM': OK
  4538. 275.48 s [vector] +++ OK, passed 100 tests.
  4539. 275.48 s [vector] compare: OK
  4540. 275.48 s [vector] +++ OK, passed 100 tests.
  4541. 275.48 s [vector] maximum: OK
  4542. 275.48 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4543. 275.49 s [vector] minimum: OK
  4544. 275.49 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4545. 275.49 s [vector] minIndex: OK
  4546. 275.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4547. 275.49 s [vector] maxIndex: OK
  4548. 275.49 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4549. 275.49 s [vector] maximumBy: OK
  4550. 275.49 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4551. 275.49 s [vector] minimumBy: OK
  4552. 275.49 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4553. 275.49 s [vector] maximumOn: OK
  4554. 275.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4555. 275.49 s [vector] minimumOn: OK
  4556. 275.49 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4557. 275.49 s [vector] maxIndexBy: OK
  4558. 275.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4559. 275.49 s [vector] minIndexBy: OK
  4560. 275.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4561. 275.49 s [vector] ListFirstMaxIndexWins: OK
  4562. 275.49 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4563. 275.49 s [vector] FalseListFirstMaxIndexWins: OK
  4564. 275.49 s [vector] +++ OK, failed as expected. (after 1 test):
  4565. 275.49 s [vector] Exception:
  4566. 275.49 s [vector] Prelude.foldr1: empty list
  4567. 275.49 s [vector] CallStack (from HasCallStack):
  4568. 275.49 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  4569. 275.49 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  4570. 275.49 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  4571. 275.49 s [vector] []
  4572. 275.49 s [vector] zip: OK
  4573. 275.49 s [vector] +++ OK, passed 100 tests.
  4574. 275.49 s [vector] zip3: OK
  4575. 275.49 s [vector] +++ OK, passed 100 tests.
  4576. 275.49 s [vector] unzip: OK
  4577. 275.49 s [vector] +++ OK, passed 100 tests.
  4578. 275.49 s [vector] unzip3: OK
  4579. 275.49 s [vector] +++ OK, passed 100 tests.
  4580. 275.50 s [vector] indexed: OK
  4581. 275.50 s [vector] +++ OK, passed 100 tests.
  4582. 275.51 s [vector] update: OK
  4583. 275.51 s [vector] +++ OK, passed 100 tests.
  4584. 275.51 s [vector] concat: OK
  4585. 275.51 s [vector] +++ OK, passed 100 tests.
  4586. 275.51 s [vector] mempty: OK
  4587. 275.51 s [vector] +++ OK, passed 1 test.
  4588. 275.51 s [vector] mappend: OK
  4589. 275.51 s [vector] +++ OK, passed 100 tests.
  4590. 275.51 s [vector] mconcat: OK
  4591. 275.51 s [vector] +++ OK, passed 100 tests.
  4592. 275.52 s [vector] fmap: OK
  4593. 275.53 s [vector] +++ OK, passed 100 tests.
  4594. 275.53 s [vector] return: OK
  4595. 275.53 s [vector] +++ OK, passed 100 tests.
  4596. 275.53 s [vector] bind: OK
  4597. 275.53 s [vector] +++ OK, passed 100 tests.
  4598. 275.53 s [vector] mzip: OK
  4599. 275.53 s [vector] +++ OK, passed 100 tests.
  4600. 275.53 s [vector] munzip: OK
  4601. 275.53 s [vector] +++ OK, passed 100 tests.
  4602. 275.53 s [vector] applicative_pure: OK
  4603. 275.53 s [vector] +++ OK, passed 100 tests.
  4604. 275.54 s [vector] applicative_appl: OK (0.01s)
  4605. 275.54 s [vector] +++ OK, passed 100 tests.
  4606. 275.54 s [vector] alternative_empty: OK
  4607. 275.54 s [vector] +++ OK, passed 1 test.
  4608. 275.54 s [vector] alternative_or: OK
  4609. 275.54 s [vector] +++ OK, passed 100 tests.
  4610. 275.59 s [vector] sequence: OK (0.04s)
  4611. 275.59 s [vector] +++ OK, passed 100 tests.
  4612. 275.59 s [vector] sequence_: OK
  4613. 275.59 s [vector] +++ OK, passed 100 tests.
  4614. 275.59 s [vector] glength: OK
  4615. 275.59 s [vector] +++ OK, passed 100 tests.
  4616. 275.59 s [vector] and: OK
  4617. 275.59 s [vector] +++ OK, passed 100 tests.
  4618. 275.59 s [vector] or: OK
  4619. 275.59 s [vector] +++ OK, passed 100 tests.
  4620. 275.59 s [vector] Int
  4621. 275.59 s [vector] fromList.toList == id: OK
  4622. 275.59 s [vector] +++ OK, passed 100 tests.
  4623. 275.59 s [vector] toList.fromList == id: OK
  4624. 275.59 s [vector] +++ OK, passed 100 tests.
  4625. 275.59 s [vector] unstream.stream == id: OK
  4626. 275.59 s [vector] +++ OK, passed 100 tests.
  4627. 275.59 s [vector] stream.unstream == id: OK
  4628. 275.59 s [vector] +++ OK, passed 100 tests.
  4629. 275.59 s [vector] eq: OK
  4630. 275.59 s [vector] +++ OK, passed 100 tests.
  4631. 275.59 s [vector] length: OK
  4632. 275.59 s [vector] +++ OK, passed 100 tests.
  4633. 275.59 s [vector] null: OK
  4634. 275.59 s [vector] +++ OK, passed 100 tests.
  4635. 275.59 s [vector] index: OK
  4636. 275.59 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4637. 275.60 s [vector] safeIndex: OK
  4638. 275.60 s [vector] +++ OK, passed 100 tests.
  4639. 275.60 s [vector] head: OK
  4640. 275.60 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4641. 275.60 s [vector] last: OK
  4642. 275.60 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4643. 275.60 s [vector] unsafeIndex: OK
  4644. 275.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4645. 275.60 s [vector] unsafeHead: OK
  4646. 275.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4647. 275.60 s [vector] unsafeLast: OK
  4648. 275.60 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4649. 275.60 s [vector] slice: OK
  4650. 275.60 s [vector] +++ OK, passed 100 tests.
  4651. 275.60 s [vector] init: OK
  4652. 275.60 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4653. 275.60 s [vector] tail: OK
  4654. 275.60 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4655. 275.60 s [vector] take: OK
  4656. 275.60 s [vector] +++ OK, passed 100 tests.
  4657. 275.60 s [vector] drop: OK
  4658. 275.60 s [vector] +++ OK, passed 100 tests.
  4659. 275.60 s [vector] splitAt: OK
  4660. 275.60 s [vector] +++ OK, passed 100 tests.
  4661. 275.60 s [vector] empty: OK
  4662. 275.60 s [vector] +++ OK, passed 1 test.
  4663. 275.60 s [vector] singleton: OK
  4664. 275.60 s [vector] +++ OK, passed 100 tests.
  4665. 275.60 s [vector] replicate: OK
  4666. 275.60 s [vector] +++ OK, passed 100 tests.
  4667. 275.60 s [vector] generate: OK
  4668. 275.60 s [vector] +++ OK, passed 100 tests.
  4669. 275.60 s [vector] iterateN: OK
  4670. 275.61 s [vector] +++ OK, passed 100 tests.
  4671. 275.65 s [vector] iterateNM: OK (0.04s)
  4672. 275.65 s [vector] +++ OK, passed 100 tests.
  4673. 275.66 s [vector] generateM: OK (0.01s)
  4674. 275.66 s [vector] +++ OK, passed 100 tests.
  4675. 275.66 s [vector] replicateM: OK
  4676. 275.66 s [vector] +++ OK, passed 100 tests.
  4677. 275.66 s [vector] create: OK
  4678. 275.66 s [vector] +++ OK, passed 100 tests.
  4679. 275.66 s [vector] createT: OK
  4680. 275.66 s [vector] +++ OK, passed 100 tests.
  4681. 275.66 s [vector] unfoldr: OK
  4682. 275.66 s [vector] +++ OK, passed 100 tests.
  4683. 275.66 s [vector] unfoldrN: OK
  4684. 275.66 s [vector] +++ OK, passed 100 tests.
  4685. 275.67 s [vector] unfoldrExactN: OK
  4686. 275.67 s [vector] +++ OK, passed 100 tests.
  4687. 275.67 s [vector] unfoldrM: OK
  4688. 275.67 s [vector] +++ OK, passed 100 tests.
  4689. 275.67 s [vector] unfoldrNM: OK
  4690. 275.67 s [vector] +++ OK, passed 100 tests.
  4691. 275.71 s [vector] unfoldrExactNM: OK (0.04s)
  4692. 275.71 s [vector] +++ OK, passed 100 tests.
  4693. 275.72 s [vector] constructN: OK
  4694. 275.72 s [vector] +++ OK, passed 100 tests.
  4695. 275.72 s [vector] constructrN: OK
  4696. 275.72 s [vector] +++ OK, passed 100 tests.
  4697. 275.72 s [vector] cons: OK
  4698. 275.72 s [vector] +++ OK, passed 100 tests.
  4699. 275.72 s [vector] snoc: OK
  4700. 275.72 s [vector] +++ OK, passed 100 tests.
  4701. 275.73 s [vector] append: OK
  4702. 275.73 s [vector] +++ OK, passed 100 tests.
  4703. 275.73 s [vector] concat: OK (0.01s)
  4704. 275.73 s [vector] +++ OK, passed 100 tests.
  4705. 275.73 s [vector] force: OK
  4706. 275.73 s [vector] +++ OK, passed 100 tests.
  4707. 275.74 s [vector] upd: OK
  4708. 275.74 s [vector] +++ OK, passed 100 tests.
  4709. 275.74 s [vector] accum: OK
  4710. 275.74 s [vector] +++ OK, passed 100 tests.
  4711. 275.74 s [vector] reverse: OK
  4712. 275.74 s [vector] +++ OK, passed 100 tests.
  4713. 275.74 s [vector] backpermute: OK
  4714. 275.74 s [vector] +++ OK, passed 100 tests.
  4715. 275.74 s [vector] map: OK
  4716. 275.74 s [vector] +++ OK, passed 100 tests.
  4717. 275.74 s [vector] imap: OK
  4718. 275.74 s [vector] +++ OK, passed 100 tests.
  4719. 275.75 s [vector] concatMap: OK
  4720. 275.75 s [vector] +++ OK, passed 100 tests.
  4721. 275.75 s [vector] mapM: OK
  4722. 275.75 s [vector] +++ OK, passed 100 tests.
  4723. 275.76 s [vector] mapM_: OK (0.01s)
  4724. 275.76 s [vector] +++ OK, passed 100 tests.
  4725. 275.77 s [vector] forM: OK
  4726. 275.77 s [vector] +++ OK, passed 100 tests.
  4727. 275.78 s [vector] forM_: OK (0.02s)
  4728. 275.78 s [vector] +++ OK, passed 100 tests.
  4729. 275.79 s [vector] imapM: OK
  4730. 275.79 s [vector] +++ OK, passed 100 tests.
  4731. 275.80 s [vector] imapM_: OK (0.02s)
  4732. 275.80 s [vector] +++ OK, passed 100 tests.
  4733. 275.80 s [vector] zipWith: OK
  4734. 275.80 s [vector] +++ OK, passed 100 tests.
  4735. 275.80 s [vector] zipWith3: OK
  4736. 275.81 s [vector] +++ OK, passed 100 tests.
  4737. 275.81 s [vector] izipWith: OK
  4738. 275.81 s [vector] +++ OK, passed 100 tests.
  4739. 275.81 s [vector] izipWith3: OK
  4740. 275.81 s [vector] +++ OK, passed 100 tests.
  4741. 275.81 s [vector] izipWithM: OK
  4742. 275.83 s [vector] +++ OK, passed 100 tests.
  4743. 275.83 s [vector] izipWithM_: OK (0.01s)
  4744. 275.83 s [vector] +++ OK, passed 100 tests.
  4745. 275.83 s [vector] zipWithM: OK
  4746. 275.83 s [vector] +++ OK, passed 100 tests.
  4747. 275.84 s [vector] zipWithM_: OK (0.01s)
  4748. 275.84 s [vector] +++ OK, passed 100 tests.
  4749. 275.85 s [vector] filter: OK
  4750. 275.85 s [vector] +++ OK, passed 100 tests.
  4751. 275.85 s [vector] ifilter: OK
  4752. 275.85 s [vector] +++ OK, passed 100 tests.
  4753. 275.87 s [vector] filterM: OK (0.02s)
  4754. 275.87 s [vector] +++ OK, passed 100 tests.
  4755. 275.87 s [vector] uniq: OK
  4756. 275.87 s [vector] +++ OK, passed 100 tests.
  4757. 275.87 s [vector] mapMaybe: OK
  4758. 275.87 s [vector] +++ OK, passed 100 tests.
  4759. 275.87 s [vector] imapMaybe: OK
  4760. 275.87 s [vector] +++ OK, passed 100 tests.
  4761. 275.87 s [vector] takeWhile: OK
  4762. 275.87 s [vector] +++ OK, passed 100 tests.
  4763. 275.87 s [vector] dropWhile: OK
  4764. 275.88 s [vector] +++ OK, passed 100 tests.
  4765. 275.88 s [vector] partition: OK
  4766. 275.88 s [vector] +++ OK, passed 100 tests.
  4767. 275.88 s [vector] partitionWith: OK
  4768. 275.88 s [vector] +++ OK, passed 100 tests.
  4769. 275.88 s [vector] span: OK
  4770. 275.88 s [vector] +++ OK, passed 100 tests.
  4771. 275.88 s [vector] break: OK
  4772. 275.88 s [vector] +++ OK, passed 100 tests.
  4773. 275.88 s [vector] spanR: OK
  4774. 275.88 s [vector] +++ OK, passed 100 tests.
  4775. 275.88 s [vector] breakR: OK
  4776. 275.88 s [vector] +++ OK, passed 100 tests.
  4777. 275.88 s [vector] groupBy: OK
  4778. 275.88 s [vector] +++ OK, passed 100 tests.
  4779. 275.88 s [vector] elem: OK
  4780. 275.89 s [vector] +++ OK, passed 100 tests.
  4781. 275.89 s [vector] notElem: OK
  4782. 275.89 s [vector] +++ OK, passed 100 tests.
  4783. 275.89 s [vector] find: OK
  4784. 275.89 s [vector] +++ OK, passed 100 tests.
  4785. 275.89 s [vector] findIndex: OK
  4786. 275.89 s [vector] +++ OK, passed 100 tests.
  4787. 275.89 s [vector] findIndexR: OK
  4788. 275.89 s [vector] +++ OK, passed 100 tests.
  4789. 275.89 s [vector] findIndices: OK
  4790. 275.89 s [vector] +++ OK, passed 100 tests.
  4791. 275.89 s [vector] elemIndex: OK
  4792. 275.89 s [vector] +++ OK, passed 100 tests.
  4793. 275.89 s [vector] elemIndices: OK
  4794. 275.89 s [vector] +++ OK, passed 100 tests.
  4795. 275.89 s [vector] foldl: OK
  4796. 275.89 s [vector] +++ OK, passed 100 tests.
  4797. 275.90 s [vector] foldl1: OK
  4798. 275.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4799. 275.90 s [vector] foldl': OK
  4800. 275.90 s [vector] +++ OK, passed 100 tests.
  4801. 275.90 s [vector] foldl1': OK
  4802. 275.90 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4803. 275.90 s [vector] foldr: OK
  4804. 275.90 s [vector] +++ OK, passed 100 tests.
  4805. 275.90 s [vector] foldr1: OK
  4806. 275.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4807. 275.91 s [vector] foldr': OK
  4808. 275.91 s [vector] +++ OK, passed 100 tests.
  4809. 275.91 s [vector] foldr1': OK
  4810. 275.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4811. 275.91 s [vector] ifoldl: OK
  4812. 275.92 s [vector] +++ OK, passed 100 tests.
  4813. 275.92 s [vector] ifoldl': OK
  4814. 275.92 s [vector] +++ OK, passed 100 tests.
  4815. 275.92 s [vector] ifoldr: OK
  4816. 275.92 s [vector] +++ OK, passed 100 tests.
  4817. 275.93 s [vector] ifoldr': OK
  4818. 275.93 s [vector] +++ OK, passed 100 tests.
  4819. 275.93 s [vector] ifoldM: OK
  4820. 275.93 s [vector] +++ OK, passed 100 tests.
  4821. 275.95 s [vector] ifoldM': OK
  4822. 275.95 s [vector] +++ OK, passed 100 tests.
  4823. 275.97 s [vector] ifoldM_: OK (0.02s)
  4824. 275.97 s [vector] +++ OK, passed 100 tests.
  4825. 275.97 s [vector] ifoldM'_: OK (0.02s)
  4826. 275.97 s [vector] +++ OK, passed 100 tests.
  4827. 275.97 s [vector] all: OK
  4828. 275.97 s [vector] +++ OK, passed 100 tests.
  4829. 275.97 s [vector] any: OK
  4830. 275.97 s [vector] +++ OK, passed 100 tests.
  4831. 275.98 s [vector] prescanl: OK
  4832. 275.98 s [vector] +++ OK, passed 100 tests.
  4833. 275.98 s [vector] prescanl': OK
  4834. 275.98 s [vector] +++ OK, passed 100 tests.
  4835. 275.98 s [vector] postscanl: OK
  4836. 275.98 s [vector] +++ OK, passed 100 tests.
  4837. 275.98 s [vector] postscanl': OK
  4838. 275.98 s [vector] +++ OK, passed 100 tests.
  4839. 275.98 s [vector] scanl: OK
  4840. 275.99 s [vector] +++ OK, passed 100 tests.
  4841. 275.99 s [vector] scanl': OK
  4842. 275.99 s [vector] +++ OK, passed 100 tests.
  4843. 276.00 s [vector] scanl1: OK
  4844. 276.00 s [vector] +++ OK, passed 100 tests.
  4845. 276.00 s [vector] scanl1': OK
  4846. 276.01 s [vector] +++ OK, passed 100 tests.
  4847. 276.01 s [vector] iscanl: OK
  4848. 276.01 s [vector] +++ OK, passed 100 tests.
  4849. 276.01 s [vector] iscanl': OK
  4850. 276.01 s [vector] +++ OK, passed 100 tests.
  4851. 276.01 s [vector] prescanr: OK
  4852. 276.01 s [vector] +++ OK, passed 100 tests.
  4853. 276.02 s [vector] prescanr': OK
  4854. 276.02 s [vector] +++ OK, passed 100 tests.
  4855. 276.02 s [vector] postscanr: OK
  4856. 276.02 s [vector] +++ OK, passed 100 tests.
  4857. 276.02 s [vector] postscanr': OK
  4858. 276.02 s [vector] +++ OK, passed 100 tests.
  4859. 276.02 s [vector] scanr: OK
  4860. 276.03 s [vector] +++ OK, passed 100 tests.
  4861. 276.03 s [vector] scanr': OK
  4862. 276.03 s [vector] +++ OK, passed 100 tests.
  4863. 276.03 s [vector] scanr1: OK
  4864. 276.03 s [vector] +++ OK, passed 100 tests.
  4865. 276.03 s [vector] scanr1': OK
  4866. 276.04 s [vector] +++ OK, passed 100 tests.
  4867. 276.04 s [vector] iscanr: OK
  4868. 276.04 s [vector] +++ OK, passed 100 tests.
  4869. 276.04 s [vector] iscanr': OK
  4870. 276.04 s [vector] +++ OK, passed 100 tests.
  4871. 276.04 s [vector] mut_read: OK
  4872. 276.04 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4873. 276.04 s [vector] mut_write: OK
  4874. 276.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4875. 276.04 s [vector] mut_modify: OK
  4876. 276.04 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4877. 276.05 s [vector] mut_generate: OK
  4878. 276.05 s [vector] +++ OK, passed 100 tests.
  4879. 276.07 s [vector] mut_generateM: OK
  4880. 276.07 s [vector] +++ OK, passed 100 tests.
  4881. 276.07 s [vector] mut_mapM_: OK (0.02s)
  4882. 276.07 s [vector] +++ OK, passed 100 tests.
  4883. 276.09 s [vector] mut_imapM_: OK (0.02s)
  4884. 276.09 s [vector] +++ OK, passed 100 tests.
  4885. 276.11 s [vector] mut_forM_: OK (0.01s)
  4886. 276.11 s [vector] +++ OK, passed 100 tests.
  4887. 276.12 s [vector] mut_iforM_: OK (0.02s)
  4888. 276.12 s [vector] +++ OK, passed 100 tests.
  4889. 276.12 s [vector] mut_foldr: OK
  4890. 276.12 s [vector] +++ OK, passed 100 tests.
  4891. 276.12 s [vector] mut_foldr': OK
  4892. 276.12 s [vector] +++ OK, passed 100 tests.
  4893. 276.12 s [vector] mut_foldl: OK
  4894. 276.12 s [vector] +++ OK, passed 100 tests.
  4895. 276.13 s [vector] mut_foldl': OK
  4896. 276.13 s [vector] +++ OK, passed 100 tests.
  4897. 276.13 s [vector] mut_ifoldr: OK
  4898. 276.13 s [vector] +++ OK, passed 100 tests.
  4899. 276.13 s [vector] mut_ifoldr': OK
  4900. 276.13 s [vector] +++ OK, passed 100 tests.
  4901. 276.14 s [vector] mut_ifoldl: OK
  4902. 276.14 s [vector] +++ OK, passed 100 tests.
  4903. 276.14 s [vector] mut_ifoldl': OK
  4904. 276.14 s [vector] +++ OK, passed 100 tests.
  4905. 276.14 s [vector] mut_foldM: OK
  4906. 276.14 s [vector] +++ OK, passed 100 tests.
  4907. 276.15 s [vector] mut_foldM': OK
  4908. 276.15 s [vector] +++ OK, passed 100 tests.
  4909. 276.15 s [vector] mut_foldrM: OK
  4910. 276.15 s [vector] +++ OK, passed 100 tests.
  4911. 276.15 s [vector] mut_foldrM': OK
  4912. 276.15 s [vector] +++ OK, passed 100 tests.
  4913. 276.15 s [vector] mut_ifoldM: OK
  4914. 276.16 s [vector] +++ OK, passed 100 tests.
  4915. 276.16 s [vector] mut_ifoldM': OK
  4916. 276.16 s [vector] +++ OK, passed 100 tests.
  4917. 276.16 s [vector] mut_ifoldrM: OK
  4918. 276.16 s [vector] +++ OK, passed 100 tests.
  4919. 276.17 s [vector] mut_ifoldrM': OK
  4920. 276.17 s [vector] +++ OK, passed 100 tests.
  4921. 276.17 s [vector] compare: OK
  4922. 276.17 s [vector] +++ OK, passed 100 tests.
  4923. 276.17 s [vector] maximum: OK
  4924. 276.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4925. 276.17 s [vector] minimum: OK
  4926. 276.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4927. 276.17 s [vector] minIndex: OK
  4928. 276.17 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4929. 276.17 s [vector] maxIndex: OK
  4930. 276.17 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4931. 276.17 s [vector] maximumBy: OK
  4932. 276.17 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4933. 276.17 s [vector] minimumBy: OK
  4934. 276.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4935. 276.17 s [vector] maximumOn: OK
  4936. 276.17 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4937. 276.17 s [vector] minimumOn: OK
  4938. 276.17 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4939. 276.17 s [vector] maxIndexBy: OK
  4940. 276.17 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4941. 276.17 s [vector] minIndexBy: OK
  4942. 276.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4943. 276.17 s [vector] ListFirstMaxIndexWins: OK
  4944. 276.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4945. 276.17 s [vector] FalseListFirstMaxIndexWins: OK
  4946. 276.17 s [vector] +++ OK, failed as expected. (after 1 test):
  4947. 276.17 s [vector] Exception:
  4948. 276.17 s [vector] Prelude.foldr1: empty list
  4949. 276.17 s [vector] CallStack (from HasCallStack):
  4950. 276.17 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  4951. 276.17 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  4952. 276.17 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  4953. 276.17 s [vector] []
  4954. 276.17 s [vector] zip: OK
  4955. 276.18 s [vector] +++ OK, passed 100 tests.
  4956. 276.18 s [vector] zip3: OK
  4957. 276.18 s [vector] +++ OK, passed 100 tests.
  4958. 276.18 s [vector] unzip: OK
  4959. 276.18 s [vector] +++ OK, passed 100 tests.
  4960. 276.18 s [vector] unzip3: OK
  4961. 276.18 s [vector] +++ OK, passed 100 tests.
  4962. 276.19 s [vector] indexed: OK
  4963. 276.19 s [vector] +++ OK, passed 100 tests.
  4964. 276.19 s [vector] update: OK
  4965. 276.19 s [vector] +++ OK, passed 100 tests.
  4966. 276.19 s [vector] concat: OK (0.01s)
  4967. 276.19 s [vector] +++ OK, passed 100 tests.
  4968. 276.20 s [vector] mempty: OK
  4969. 276.20 s [vector] +++ OK, passed 1 test.
  4970. 276.20 s [vector] mappend: OK
  4971. 276.20 s [vector] +++ OK, passed 100 tests.
  4972. 276.21 s [vector] mconcat: OK
  4973. 276.21 s [vector] +++ OK, passed 100 tests.
  4974. 276.21 s [vector] fmap: OK
  4975. 276.21 s [vector] +++ OK, passed 100 tests.
  4976. 276.21 s [vector] return: OK
  4977. 276.21 s [vector] +++ OK, passed 100 tests.
  4978. 276.23 s [vector] bind: OK (0.02s)
  4979. 276.23 s [vector] +++ OK, passed 100 tests.
  4980. 276.23 s [vector] mzip: OK
  4981. 276.23 s [vector] +++ OK, passed 100 tests.
  4982. 276.23 s [vector] munzip: OK
  4983. 276.23 s [vector] +++ OK, passed 100 tests.
  4984. 276.25 s [vector] applicative_pure: OK
  4985. 276.25 s [vector] +++ OK, passed 100 tests.
  4986. 276.28 s [vector] applicative_appl: OK (0.04s)
  4987. 276.28 s [vector] +++ OK, passed 100 tests.
  4988. 276.28 s [vector] alternative_empty: OK
  4989. 276.28 s [vector] +++ OK, passed 1 test.
  4990. 276.29 s [vector] alternative_or: OK
  4991. 276.29 s [vector] +++ OK, passed 100 tests.
  4992. 276.30 s [vector] sequence: OK (0.02s)
  4993. 276.30 s [vector] +++ OK, passed 100 tests.
  4994. 276.31 s [vector] sequence_: OK (0.01s)
  4995. 276.31 s [vector] +++ OK, passed 100 tests.
  4996. 276.31 s [vector] glength: OK
  4997. 276.31 s [vector] +++ OK, passed 100 tests.
  4998. 276.31 s [vector] sum: OK
  4999. 276.31 s [vector] +++ OK, passed 100 tests.
  5000. 276.31 s [vector] product: OK
  5001. 276.31 s [vector] +++ OK, passed 100 tests.
  5002. 276.31 s [vector] enumFromN: OK
  5003. 276.31 s [vector] +++ OK, passed 100 tests.
  5004. 276.31 s [vector] enumFromThenN: OK
  5005. 276.31 s [vector] +++ OK, passed 100 tests.
  5006. 276.31 s [vector] enumFromTo: OK
  5007. 276.31 s [vector] +++ OK, passed 100 tests.
  5008. 276.31 s [vector] enumFromThenTo: OK
  5009. 276.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5010. 276.32 s [vector] unstream
  5011. 276.32 s [vector] unstream == vunstream (exact): OK
  5012. 276.32 s [vector] +++ OK, passed 100 tests.
  5013. 276.32 s [vector] unstream == vunstream (unknown): OK
  5014. 276.32 s [vector] +++ OK, passed 100 tests.
  5015. 276.32 s [vector] unstreamR ~= vunstream (exact): OK
  5016. 276.32 s [vector] +++ OK, passed 100 tests.
  5017. 276.32 s [vector] unstreamR ~= vunstream (unknown): OK
  5018. 276.32 s [vector] +++ OK, passed 100 tests.
  5019. 276.32 s [vector] Tests.Vector.Unboxed
  5020. 276.32 s [vector] ()
  5021. 276.32 s [vector] fromList.toList == id: OK
  5022. 276.32 s [vector] +++ OK, passed 100 tests.
  5023. 276.32 s [vector] toList.fromList == id: OK
  5024. 276.32 s [vector] +++ OK, passed 100 tests.
  5025. 276.32 s [vector] unstream.stream == id: OK
  5026. 276.32 s [vector] +++ OK, passed 100 tests.
  5027. 276.32 s [vector] stream.unstream == id: OK
  5028. 276.32 s [vector] +++ OK, passed 100 tests.
  5029. 276.32 s [vector] eq: OK
  5030. 276.33 s [vector] +++ OK, passed 100 tests.
  5031. 276.33 s [vector] length: OK
  5032. 276.33 s [vector] +++ OK, passed 100 tests.
  5033. 276.33 s [vector] null: OK
  5034. 276.33 s [vector] +++ OK, passed 100 tests.
  5035. 276.33 s [vector] index: OK
  5036. 276.33 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5037. 276.33 s [vector] safeIndex: OK
  5038. 276.33 s [vector] +++ OK, passed 100 tests.
  5039. 276.33 s [vector] head: OK
  5040. 276.33 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5041. 276.33 s [vector] last: OK
  5042. 276.33 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5043. 276.33 s [vector] unsafeIndex: OK
  5044. 276.33 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5045. 276.33 s [vector] unsafeHead: OK
  5046. 276.33 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5047. 276.33 s [vector] unsafeLast: OK
  5048. 276.33 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5049. 276.33 s [vector] slice: OK
  5050. 276.33 s [vector] +++ OK, passed 100 tests.
  5051. 276.33 s [vector] init: OK
  5052. 276.33 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5053. 276.33 s [vector] tail: OK
  5054. 276.33 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5055. 276.33 s [vector] take: OK
  5056. 276.33 s [vector] +++ OK, passed 100 tests.
  5057. 276.33 s [vector] drop: OK
  5058. 276.33 s [vector] +++ OK, passed 100 tests.
  5059. 276.34 s [vector] splitAt: OK
  5060. 276.34 s [vector] +++ OK, passed 100 tests.
  5061. 276.34 s [vector] empty: OK
  5062. 276.34 s [vector] +++ OK, passed 1 test.
  5063. 276.34 s [vector] singleton: OK
  5064. 276.34 s [vector] +++ OK, passed 100 tests.
  5065. 276.35 s [vector] replicate: OK
  5066. 276.35 s [vector] +++ OK, passed 100 tests.
  5067. 276.35 s [vector] generate: OK
  5068. 276.35 s [vector] +++ OK, passed 100 tests.
  5069. 276.35 s [vector] iterateN: OK
  5070. 276.35 s [vector] +++ OK, passed 100 tests.
  5071. 276.39 s [vector] iterateNM: OK (0.05s)
  5072. 276.39 s [vector] +++ OK, passed 100 tests.
  5073. 276.40 s [vector] generateM: OK
  5074. 276.40 s [vector] +++ OK, passed 100 tests.
  5075. 276.40 s [vector] replicateM: OK
  5076. 276.40 s [vector] +++ OK, passed 100 tests.
  5077. 276.40 s [vector] create: OK
  5078. 276.40 s [vector] +++ OK, passed 100 tests.
  5079. 276.40 s [vector] createT: OK
  5080. 276.40 s [vector] +++ OK, passed 100 tests.
  5081. 276.40 s [vector] unfoldr: OK
  5082. 276.40 s [vector] +++ OK, passed 100 tests.
  5083. 276.40 s [vector] unfoldrN: OK
  5084. 276.40 s [vector] +++ OK, passed 100 tests.
  5085. 276.40 s [vector] unfoldrExactN: OK
  5086. 276.40 s [vector] +++ OK, passed 100 tests.
  5087. 276.41 s [vector] unfoldrM: OK
  5088. 276.41 s [vector] +++ OK, passed 100 tests.
  5089. 276.41 s [vector] unfoldrNM: OK
  5090. 276.41 s [vector] +++ OK, passed 100 tests.
  5091. 276.44 s [vector] unfoldrExactNM: OK (0.03s)
  5092. 276.44 s [vector] +++ OK, passed 100 tests.
  5093. 276.44 s [vector] constructN: OK
  5094. 276.44 s [vector] +++ OK, passed 100 tests.
  5095. 276.44 s [vector] constructrN: OK
  5096. 276.44 s [vector] +++ OK, passed 100 tests.
  5097. 276.44 s [vector] cons: OK
  5098. 276.45 s [vector] +++ OK, passed 100 tests.
  5099. 276.45 s [vector] snoc: OK
  5100. 276.45 s [vector] +++ OK, passed 100 tests.
  5101. 276.45 s [vector] append: OK
  5102. 276.45 s [vector] +++ OK, passed 100 tests.
  5103. 276.45 s [vector] concat: OK
  5104. 276.45 s [vector] +++ OK, passed 100 tests.
  5105. 276.46 s [vector] force: OK
  5106. 276.46 s [vector] +++ OK, passed 100 tests.
  5107. 276.46 s [vector] upd: OK
  5108. 276.46 s [vector] +++ OK, passed 100 tests.
  5109. 276.46 s [vector] accum: OK
  5110. 276.46 s [vector] +++ OK, passed 100 tests.
  5111. 276.46 s [vector] reverse: OK
  5112. 276.46 s [vector] +++ OK, passed 100 tests.
  5113. 276.46 s [vector] backpermute: OK
  5114. 276.46 s [vector] +++ OK, passed 100 tests.
  5115. 276.46 s [vector] map: OK
  5116. 276.46 s [vector] +++ OK, passed 100 tests.
  5117. 276.47 s [vector] imap: OK
  5118. 276.47 s [vector] +++ OK, passed 100 tests.
  5119. 276.47 s [vector] concatMap: OK
  5120. 276.47 s [vector] +++ OK, passed 100 tests.
  5121. 276.47 s [vector] mapM: OK
  5122. 276.47 s [vector] +++ OK, passed 100 tests.
  5123. 276.48 s [vector] mapM_: OK
  5124. 276.48 s [vector] +++ OK, passed 100 tests.
  5125. 276.48 s [vector] forM: OK
  5126. 276.48 s [vector] +++ OK, passed 100 tests.
  5127. 276.49 s [vector] forM_: OK
  5128. 276.49 s [vector] +++ OK, passed 100 tests.
  5129. 276.49 s [vector] imapM: OK
  5130. 276.49 s [vector] +++ OK, passed 100 tests.
  5131. 276.50 s [vector] imapM_: OK (0.01s)
  5132. 276.50 s [vector] +++ OK, passed 100 tests.
  5133. 276.50 s [vector] zipWith: OK
  5134. 276.50 s [vector] +++ OK, passed 100 tests.
  5135. 276.51 s [vector] zipWith3: OK
  5136. 276.51 s [vector] +++ OK, passed 100 tests.
  5137. 276.51 s [vector] izipWith: OK
  5138. 276.51 s [vector] +++ OK, passed 100 tests.
  5139. 276.51 s [vector] izipWith3: OK
  5140. 276.51 s [vector] +++ OK, passed 100 tests.
  5141. 276.51 s [vector] izipWithM: OK
  5142. 276.51 s [vector] +++ OK, passed 100 tests.
  5143. 276.51 s [vector] izipWithM_: OK
  5144. 276.51 s [vector] +++ OK, passed 100 tests.
  5145. 276.52 s [vector] zipWithM: OK
  5146. 276.52 s [vector] +++ OK, passed 100 tests.
  5147. 276.52 s [vector] zipWithM_: OK
  5148. 276.52 s [vector] +++ OK, passed 100 tests.
  5149. 276.53 s [vector] filter: OK
  5150. 276.53 s [vector] +++ OK, passed 100 tests.
  5151. 276.53 s [vector] ifilter: OK
  5152. 276.53 s [vector] +++ OK, passed 100 tests.
  5153. 276.54 s [vector] filterM: OK (0.02s)
  5154. 276.54 s [vector] +++ OK, passed 100 tests.
  5155. 276.54 s [vector] uniq: OK
  5156. 276.54 s [vector] +++ OK, passed 100 tests.
  5157. 276.54 s [vector] mapMaybe: OK
  5158. 276.54 s [vector] +++ OK, passed 100 tests.
  5159. 276.54 s [vector] imapMaybe: OK
  5160. 276.54 s [vector] +++ OK, passed 100 tests.
  5161. 276.54 s [vector] takeWhile: OK
  5162. 276.55 s [vector] +++ OK, passed 100 tests.
  5163. 276.55 s [vector] dropWhile: OK
  5164. 276.55 s [vector] +++ OK, passed 100 tests.
  5165. 276.55 s [vector] partition: OK
  5166. 276.55 s [vector] +++ OK, passed 100 tests.
  5167. 276.55 s [vector] partitionWith: OK
  5168. 276.55 s [vector] +++ OK, passed 100 tests.
  5169. 276.55 s [vector] span: OK
  5170. 276.55 s [vector] +++ OK, passed 100 tests.
  5171. 276.55 s [vector] break: OK
  5172. 276.55 s [vector] +++ OK, passed 100 tests.
  5173. 276.55 s [vector] spanR: OK
  5174. 276.55 s [vector] +++ OK, passed 100 tests.
  5175. 276.55 s [vector] breakR: OK
  5176. 276.55 s [vector] +++ OK, passed 100 tests.
  5177. 276.55 s [vector] groupBy: OK
  5178. 276.55 s [vector] +++ OK, passed 100 tests.
  5179. 276.55 s [vector] elem: OK
  5180. 276.55 s [vector] +++ OK, passed 100 tests.
  5181. 276.55 s [vector] notElem: OK
  5182. 276.55 s [vector] +++ OK, passed 100 tests.
  5183. 276.55 s [vector] find: OK
  5184. 276.55 s [vector] +++ OK, passed 100 tests.
  5185. 276.55 s [vector] findIndex: OK
  5186. 276.55 s [vector] +++ OK, passed 100 tests.
  5187. 276.55 s [vector] findIndexR: OK
  5188. 276.55 s [vector] +++ OK, passed 100 tests.
  5189. 276.55 s [vector] findIndices: OK
  5190. 276.55 s [vector] +++ OK, passed 100 tests.
  5191. 276.56 s [vector] elemIndex: OK
  5192. 276.56 s [vector] +++ OK, passed 100 tests.
  5193. 276.56 s [vector] elemIndices: OK
  5194. 276.56 s [vector] +++ OK, passed 100 tests.
  5195. 276.56 s [vector] foldl: OK
  5196. 276.56 s [vector] +++ OK, passed 100 tests.
  5197. 276.56 s [vector] foldl1: OK
  5198. 276.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5199. 276.56 s [vector] foldl': OK
  5200. 276.56 s [vector] +++ OK, passed 100 tests.
  5201. 276.56 s [vector] foldl1': OK
  5202. 276.56 s [vector] +++ OK, passed 100 tests; 24 discarded.
  5203. 276.56 s [vector] foldr: OK
  5204. 276.56 s [vector] +++ OK, passed 100 tests.
  5205. 276.56 s [vector] foldr1: OK
  5206. 276.56 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5207. 276.56 s [vector] foldr': OK
  5208. 276.56 s [vector] +++ OK, passed 100 tests.
  5209. 276.56 s [vector] foldr1': OK
  5210. 276.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5211. 276.56 s [vector] ifoldl: OK
  5212. 276.56 s [vector] +++ OK, passed 100 tests.
  5213. 276.56 s [vector] ifoldl': OK
  5214. 276.56 s [vector] +++ OK, passed 100 tests.
  5215. 276.56 s [vector] ifoldr: OK
  5216. 276.56 s [vector] +++ OK, passed 100 tests.
  5217. 276.56 s [vector] ifoldr': OK
  5218. 276.56 s [vector] +++ OK, passed 100 tests.
  5219. 276.56 s [vector] ifoldM: OK
  5220. 276.57 s [vector] +++ OK, passed 100 tests.
  5221. 276.57 s [vector] ifoldM': OK
  5222. 276.57 s [vector] +++ OK, passed 100 tests.
  5223. 276.59 s [vector] ifoldM_: OK
  5224. 276.59 s [vector] +++ OK, passed 100 tests.
  5225. 276.59 s [vector] ifoldM'_: OK (0.01s)
  5226. 276.59 s [vector] +++ OK, passed 100 tests.
  5227. 276.59 s [vector] all: OK
  5228. 276.59 s [vector] +++ OK, passed 100 tests.
  5229. 276.59 s [vector] any: OK
  5230. 276.59 s [vector] +++ OK, passed 100 tests.
  5231. 276.59 s [vector] prescanl: OK
  5232. 276.59 s [vector] +++ OK, passed 100 tests.
  5233. 276.59 s [vector] prescanl': OK
  5234. 276.60 s [vector] +++ OK, passed 100 tests.
  5235. 276.60 s [vector] postscanl: OK
  5236. 276.60 s [vector] +++ OK, passed 100 tests.
  5237. 276.60 s [vector] postscanl': OK
  5238. 276.60 s [vector] +++ OK, passed 100 tests.
  5239. 276.60 s [vector] scanl: OK
  5240. 276.60 s [vector] +++ OK, passed 100 tests.
  5241. 276.60 s [vector] scanl': OK
  5242. 276.60 s [vector] +++ OK, passed 100 tests.
  5243. 276.60 s [vector] scanl1: OK
  5244. 276.60 s [vector] +++ OK, passed 100 tests.
  5245. 276.60 s [vector] scanl1': OK
  5246. 276.60 s [vector] +++ OK, passed 100 tests.
  5247. 276.60 s [vector] iscanl: OK
  5248. 276.60 s [vector] +++ OK, passed 100 tests.
  5249. 276.60 s [vector] iscanl': OK
  5250. 276.60 s [vector] +++ OK, passed 100 tests.
  5251. 276.60 s [vector] prescanr: OK
  5252. 276.60 s [vector] +++ OK, passed 100 tests.
  5253. 276.60 s [vector] prescanr': OK
  5254. 276.61 s [vector] +++ OK, passed 100 tests.
  5255. 276.61 s [vector] postscanr: OK
  5256. 276.61 s [vector] +++ OK, passed 100 tests.
  5257. 276.61 s [vector] postscanr': OK
  5258. 276.61 s [vector] +++ OK, passed 100 tests.
  5259. 276.61 s [vector] scanr: OK
  5260. 276.61 s [vector] +++ OK, passed 100 tests.
  5261. 276.61 s [vector] scanr': OK
  5262. 276.61 s [vector] +++ OK, passed 100 tests.
  5263. 276.61 s [vector] scanr1: OK
  5264. 276.61 s [vector] +++ OK, passed 100 tests.
  5265. 276.61 s [vector] scanr1': OK
  5266. 276.61 s [vector] +++ OK, passed 100 tests.
  5267. 276.61 s [vector] iscanr: OK
  5268. 276.61 s [vector] +++ OK, passed 100 tests.
  5269. 276.61 s [vector] iscanr': OK
  5270. 276.61 s [vector] +++ OK, passed 100 tests.
  5271. 276.61 s [vector] mut_read: OK
  5272. 276.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5273. 276.62 s [vector] mut_write: OK
  5274. 276.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5275. 276.62 s [vector] mut_modify: OK
  5276. 276.62 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5277. 276.62 s [vector] mut_generate: OK
  5278. 276.63 s [vector] +++ OK, passed 100 tests.
  5279. 276.63 s [vector] mut_generateM: OK
  5280. 276.63 s [vector] +++ OK, passed 100 tests.
  5281. 276.64 s [vector] mut_mapM_: OK (0.01s)
  5282. 276.65 s [vector] +++ OK, passed 100 tests.
  5283. 276.65 s [vector] mut_imapM_: OK
  5284. 276.65 s [vector] +++ OK, passed 100 tests.
  5285. 276.65 s [vector] mut_forM_: OK
  5286. 276.66 s [vector] +++ OK, passed 100 tests.
  5287. 276.66 s [vector] mut_iforM_: OK
  5288. 276.66 s [vector] +++ OK, passed 100 tests.
  5289. 276.66 s [vector] mut_foldr: OK
  5290. 276.66 s [vector] +++ OK, passed 100 tests.
  5291. 276.66 s [vector] mut_foldr': OK
  5292. 276.66 s [vector] +++ OK, passed 100 tests.
  5293. 276.66 s [vector] mut_foldl: OK
  5294. 276.66 s [vector] +++ OK, passed 100 tests.
  5295. 276.66 s [vector] mut_foldl': OK
  5296. 276.66 s [vector] +++ OK, passed 100 tests.
  5297. 276.66 s [vector] mut_ifoldr: OK
  5298. 276.67 s [vector] +++ OK, passed 100 tests.
  5299. 276.67 s [vector] mut_ifoldr': OK
  5300. 276.67 s [vector] +++ OK, passed 100 tests.
  5301. 276.67 s [vector] mut_ifoldl: OK
  5302. 276.67 s [vector] +++ OK, passed 100 tests.
  5303. 276.67 s [vector] mut_ifoldl': OK
  5304. 276.67 s [vector] +++ OK, passed 100 tests.
  5305. 276.67 s [vector] mut_foldM: OK
  5306. 276.67 s [vector] +++ OK, passed 100 tests.
  5307. 276.67 s [vector] mut_foldM': OK
  5308. 276.67 s [vector] +++ OK, passed 100 tests.
  5309. 276.68 s [vector] mut_foldrM: OK
  5310. 276.68 s [vector] +++ OK, passed 100 tests.
  5311. 276.68 s [vector] mut_foldrM': OK
  5312. 276.68 s [vector] +++ OK, passed 100 tests.
  5313. 276.68 s [vector] mut_ifoldM: OK
  5314. 276.68 s [vector] +++ OK, passed 100 tests.
  5315. 276.68 s [vector] mut_ifoldM': OK
  5316. 276.68 s [vector] +++ OK, passed 100 tests.
  5317. 276.68 s [vector] mut_ifoldrM: OK
  5318. 276.68 s [vector] +++ OK, passed 100 tests.
  5319. 276.68 s [vector] mut_ifoldrM': OK
  5320. 276.68 s [vector] +++ OK, passed 100 tests.
  5321. 276.68 s [vector] compare: OK
  5322. 276.68 s [vector] +++ OK, passed 100 tests.
  5323. 276.68 s [vector] maximum: OK
  5324. 276.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5325. 276.68 s [vector] minimum: OK
  5326. 276.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5327. 276.68 s [vector] minIndex: OK
  5328. 276.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5329. 276.68 s [vector] maxIndex: OK
  5330. 276.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5331. 276.68 s [vector] maximumBy: OK
  5332. 276.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5333. 276.68 s [vector] minimumBy: OK
  5334. 276.68 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5335. 276.68 s [vector] maximumOn: OK
  5336. 276.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5337. 276.68 s [vector] minimumOn: OK
  5338. 276.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5339. 276.69 s [vector] maxIndexBy: OK
  5340. 276.69 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5341. 276.69 s [vector] minIndexBy: OK
  5342. 276.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5343. 276.69 s [vector] ListFirstMaxIndexWins: OK
  5344. 276.69 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5345. 276.69 s [vector] FalseListFirstMaxIndexWins: OK
  5346. 276.69 s [vector] +++ OK, failed as expected. (after 1 test):
  5347. 276.69 s [vector] Exception:
  5348. 276.69 s [vector] Prelude.foldr1: empty list
  5349. 276.69 s [vector] CallStack (from HasCallStack):
  5350. 276.69 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  5351. 276.69 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  5352. 276.70 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  5353. 276.70 s [vector] []
  5354. 276.70 s [vector] zip: OK
  5355. 276.70 s [vector] +++ OK, passed 100 tests.
  5356. 276.70 s [vector] zip3: OK
  5357. 276.70 s [vector] +++ OK, passed 100 tests.
  5358. 276.70 s [vector] unzip: OK
  5359. 276.70 s [vector] +++ OK, passed 100 tests.
  5360. 276.70 s [vector] unzip3: OK
  5361. 276.70 s [vector] +++ OK, passed 100 tests.
  5362. 276.70 s [vector] indexed: OK
  5363. 276.70 s [vector] +++ OK, passed 100 tests.
  5364. 276.70 s [vector] update: OK
  5365. 276.70 s [vector] +++ OK, passed 100 tests.
  5366. 276.70 s [vector] mempty: OK
  5367. 276.70 s [vector] +++ OK, passed 1 test.
  5368. 276.71 s [vector] mappend: OK
  5369. 276.71 s [vector] +++ OK, passed 100 tests.
  5370. 276.71 s [vector] mconcat: OK
  5371. 276.71 s [vector] +++ OK, passed 100 tests.
  5372. 276.71 s [vector] glength: OK
  5373. 276.71 s [vector] +++ OK, passed 100 tests.
  5374. 276.71 s [vector] (Bool)
  5375. 276.71 s [vector] fromList.toList == id: OK
  5376. 276.71 s [vector] +++ OK, passed 100 tests.
  5377. 276.71 s [vector] toList.fromList == id: OK
  5378. 276.71 s [vector] +++ OK, passed 100 tests.
  5379. 276.71 s [vector] unstream.stream == id: OK
  5380. 276.71 s [vector] +++ OK, passed 100 tests.
  5381. 276.71 s [vector] stream.unstream == id: OK
  5382. 276.71 s [vector] +++ OK, passed 100 tests.
  5383. 276.71 s [vector] eq: OK
  5384. 276.71 s [vector] +++ OK, passed 100 tests.
  5385. 276.71 s [vector] length: OK
  5386. 276.71 s [vector] +++ OK, passed 100 tests.
  5387. 276.71 s [vector] null: OK
  5388. 276.71 s [vector] +++ OK, passed 100 tests.
  5389. 276.71 s [vector] index: OK
  5390. 276.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5391. 276.71 s [vector] safeIndex: OK
  5392. 276.71 s [vector] +++ OK, passed 100 tests.
  5393. 276.71 s [vector] head: OK
  5394. 276.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5395. 276.72 s [vector] last: OK
  5396. 276.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5397. 276.72 s [vector] unsafeIndex: OK
  5398. 276.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5399. 276.72 s [vector] unsafeHead: OK
  5400. 276.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5401. 276.72 s [vector] unsafeLast: OK
  5402. 276.72 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5403. 276.72 s [vector] slice: OK
  5404. 276.72 s [vector] +++ OK, passed 100 tests.
  5405. 276.72 s [vector] init: OK
  5406. 276.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5407. 276.72 s [vector] tail: OK
  5408. 276.72 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5409. 276.72 s [vector] take: OK
  5410. 276.72 s [vector] +++ OK, passed 100 tests.
  5411. 276.72 s [vector] drop: OK
  5412. 276.72 s [vector] +++ OK, passed 100 tests.
  5413. 276.72 s [vector] splitAt: OK
  5414. 276.72 s [vector] +++ OK, passed 100 tests.
  5415. 276.72 s [vector] empty: OK
  5416. 276.72 s [vector] +++ OK, passed 1 test.
  5417. 276.72 s [vector] singleton: OK
  5418. 276.72 s [vector] +++ OK, passed 100 tests.
  5419. 276.72 s [vector] replicate: OK
  5420. 276.72 s [vector] +++ OK, passed 100 tests.
  5421. 276.72 s [vector] generate: OK
  5422. 276.72 s [vector] +++ OK, passed 100 tests.
  5423. 276.73 s [vector] iterateN: OK
  5424. 276.73 s [vector] +++ OK, passed 100 tests.
  5425. 276.77 s [vector] iterateNM: OK (0.03s)
  5426. 276.77 s [vector] +++ OK, passed 100 tests.
  5427. 276.77 s [vector] generateM: OK (0.01s)
  5428. 276.77 s [vector] +++ OK, passed 100 tests.
  5429. 276.77 s [vector] replicateM: OK
  5430. 276.77 s [vector] +++ OK, passed 100 tests.
  5431. 276.77 s [vector] create: OK
  5432. 276.77 s [vector] +++ OK, passed 100 tests.
  5433. 276.78 s [vector] createT: OK
  5434. 276.78 s [vector] +++ OK, passed 100 tests.
  5435. 276.78 s [vector] unfoldr: OK
  5436. 276.78 s [vector] +++ OK, passed 100 tests.
  5437. 276.79 s [vector] unfoldrN: OK
  5438. 276.79 s [vector] +++ OK, passed 100 tests.
  5439. 276.79 s [vector] unfoldrExactN: OK
  5440. 276.79 s [vector] +++ OK, passed 100 tests.
  5441. 276.79 s [vector] unfoldrM: OK
  5442. 276.79 s [vector] +++ OK, passed 100 tests.
  5443. 276.81 s [vector] unfoldrNM: OK
  5444. 276.81 s [vector] +++ OK, passed 100 tests.
  5445. 276.83 s [vector] unfoldrExactNM: OK (0.03s)
  5446. 276.83 s [vector] +++ OK, passed 100 tests.
  5447. 276.83 s [vector] constructN: OK
  5448. 276.83 s [vector] +++ OK, passed 100 tests.
  5449. 276.83 s [vector] constructrN: OK
  5450. 276.83 s [vector] +++ OK, passed 100 tests.
  5451. 276.83 s [vector] cons: OK
  5452. 276.83 s [vector] +++ OK, passed 100 tests.
  5453. 276.83 s [vector] snoc: OK
  5454. 276.83 s [vector] +++ OK, passed 100 tests.
  5455. 276.85 s [vector] append: OK
  5456. 276.85 s [vector] +++ OK, passed 100 tests.
  5457. 276.85 s [vector] concat: OK (0.02s)
  5458. 276.85 s [vector] +++ OK, passed 100 tests.
  5459. 276.85 s [vector] force: OK
  5460. 276.85 s [vector] +++ OK, passed 100 tests.
  5461. 276.85 s [vector] upd: OK
  5462. 276.85 s [vector] +++ OK, passed 100 tests.
  5463. 276.85 s [vector] accum: OK
  5464. 276.86 s [vector] +++ OK, passed 100 tests.
  5465. 276.86 s [vector] reverse: OK
  5466. 276.86 s [vector] +++ OK, passed 100 tests.
  5467. 276.86 s [vector] backpermute: OK
  5468. 276.86 s [vector] +++ OK, passed 100 tests.
  5469. 276.86 s [vector] map: OK
  5470. 276.86 s [vector] +++ OK, passed 100 tests.
  5471. 276.87 s [vector] imap: OK
  5472. 276.87 s [vector] +++ OK, passed 100 tests.
  5473. 276.87 s [vector] concatMap: OK
  5474. 276.87 s [vector] +++ OK, passed 100 tests.
  5475. 276.87 s [vector] mapM: OK
  5476. 276.87 s [vector] +++ OK, passed 100 tests.
  5477. 276.88 s [vector] mapM_: OK (0.01s)
  5478. 276.88 s [vector] +++ OK, passed 100 tests.
  5479. 276.88 s [vector] forM: OK
  5480. 276.89 s [vector] +++ OK, passed 100 tests.
  5481. 276.89 s [vector] forM_: OK (0.01s)
  5482. 276.90 s [vector] +++ OK, passed 100 tests.
  5483. 276.91 s [vector] imapM: OK
  5484. 276.91 s [vector] +++ OK, passed 100 tests.
  5485. 276.91 s [vector] imapM_: OK (0.01s)
  5486. 276.91 s [vector] +++ OK, passed 100 tests.
  5487. 276.91 s [vector] zipWith: OK
  5488. 276.91 s [vector] +++ OK, passed 100 tests.
  5489. 276.91 s [vector] zipWith3: OK
  5490. 276.91 s [vector] +++ OK, passed 100 tests.
  5491. 276.91 s [vector] izipWith: OK
  5492. 276.91 s [vector] +++ OK, passed 100 tests.
  5493. 276.92 s [vector] izipWith3: OK
  5494. 276.92 s [vector] +++ OK, passed 100 tests.
  5495. 276.92 s [vector] izipWithM: OK
  5496. 276.92 s [vector] +++ OK, passed 100 tests.
  5497. 276.92 s [vector] izipWithM_: OK
  5498. 276.92 s [vector] +++ OK, passed 100 tests.
  5499. 276.92 s [vector] zipWithM: OK
  5500. 276.92 s [vector] +++ OK, passed 100 tests.
  5501. 276.94 s [vector] zipWithM_: OK
  5502. 276.94 s [vector] +++ OK, passed 100 tests.
  5503. 276.94 s [vector] filter: OK
  5504. 276.94 s [vector] +++ OK, passed 100 tests.
  5505. 276.94 s [vector] ifilter: OK
  5506. 276.95 s [vector] +++ OK, passed 100 tests.
  5507. 276.97 s [vector] filterM: OK (0.03s)
  5508. 276.97 s [vector] +++ OK, passed 100 tests.
  5509. 276.97 s [vector] uniq: OK
  5510. 276.97 s [vector] +++ OK, passed 100 tests.
  5511. 276.97 s [vector] mapMaybe: OK
  5512. 276.97 s [vector] +++ OK, passed 100 tests.
  5513. 276.97 s [vector] imapMaybe: OK
  5514. 276.98 s [vector] +++ OK, passed 100 tests.
  5515. 276.98 s [vector] takeWhile: OK
  5516. 276.98 s [vector] +++ OK, passed 100 tests.
  5517. 276.98 s [vector] dropWhile: OK
  5518. 276.98 s [vector] +++ OK, passed 100 tests.
  5519. 276.98 s [vector] partition: OK
  5520. 276.98 s [vector] +++ OK, passed 100 tests.
  5521. 276.98 s [vector] partitionWith: OK
  5522. 276.98 s [vector] +++ OK, passed 100 tests.
  5523. 276.98 s [vector] span: OK
  5524. 276.98 s [vector] +++ OK, passed 100 tests.
  5525. 276.98 s [vector] break: OK
  5526. 276.98 s [vector] +++ OK, passed 100 tests.
  5527. 276.98 s [vector] spanR: OK
  5528. 276.98 s [vector] +++ OK, passed 100 tests.
  5529. 276.98 s [vector] breakR: OK
  5530. 276.98 s [vector] +++ OK, passed 100 tests.
  5531. 276.99 s [vector] groupBy: OK
  5532. 276.99 s [vector] +++ OK, passed 100 tests.
  5533. 276.99 s [vector] elem: OK
  5534. 276.99 s [vector] +++ OK, passed 100 tests.
  5535. 276.99 s [vector] notElem: OK
  5536. 276.99 s [vector] +++ OK, passed 100 tests.
  5537. 276.99 s [vector] find: OK
  5538. 276.99 s [vector] +++ OK, passed 100 tests.
  5539. 276.99 s [vector] findIndex: OK
  5540. 276.99 s [vector] +++ OK, passed 100 tests.
  5541. 276.99 s [vector] findIndexR: OK
  5542. 276.99 s [vector] +++ OK, passed 100 tests.
  5543. 276.99 s [vector] findIndices: OK
  5544. 276.99 s [vector] +++ OK, passed 100 tests.
  5545. 276.99 s [vector] elemIndex: OK
  5546. 276.99 s [vector] +++ OK, passed 100 tests.
  5547. 276.99 s [vector] elemIndices: OK
  5548. 276.99 s [vector] +++ OK, passed 100 tests.
  5549. 276.99 s [vector] foldl: OK
  5550. 276.99 s [vector] +++ OK, passed 100 tests.
  5551. 276.99 s [vector] foldl1: OK
  5552. 277.00 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5553. 277.00 s [vector] foldl': OK
  5554. 277.00 s [vector] +++ OK, passed 100 tests.
  5555. 277.00 s [vector] foldl1': OK
  5556. 277.00 s [vector] +++ OK, passed 100 tests; 23 discarded.
  5557. 277.00 s [vector] foldr: OK
  5558. 277.00 s [vector] +++ OK, passed 100 tests.
  5559. 277.00 s [vector] foldr1: OK
  5560. 277.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5561. 277.00 s [vector] foldr': OK
  5562. 277.00 s [vector] +++ OK, passed 100 tests.
  5563. 277.00 s [vector] foldr1': OK
  5564. 277.01 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5565. 277.01 s [vector] ifoldl: OK
  5566. 277.01 s [vector] +++ OK, passed 100 tests.
  5567. 277.01 s [vector] ifoldl': OK
  5568. 277.01 s [vector] +++ OK, passed 100 tests.
  5569. 277.01 s [vector] ifoldr: OK
  5570. 277.01 s [vector] +++ OK, passed 100 tests.
  5571. 277.01 s [vector] ifoldr': OK
  5572. 277.02 s [vector] +++ OK, passed 100 tests.
  5573. 277.02 s [vector] ifoldM: OK
  5574. 277.03 s [vector] +++ OK, passed 100 tests.
  5575. 277.03 s [vector] ifoldM': OK
  5576. 277.03 s [vector] +++ OK, passed 100 tests.
  5577. 277.04 s [vector] ifoldM_: OK (0.01s)
  5578. 277.49 s [vector] +++ OK, passed 100 tests.
  5579. 277.49 s [vector] ifoldM'_: OK (0.01s)
  5580. 277.49 s [vector] +++ OK, passed 100 tests.
  5581. 277.49 s [vector] all: OK
  5582. 277.49 s [vector] +++ OK, passed 100 tests.
  5583. 277.49 s [vector] any: OK
  5584. 277.49 s [vector] +++ OK, passed 100 tests.
  5585. 277.49 s [vector] prescanl: OK
  5586. 277.49 s [vector] +++ OK, passed 100 tests.
  5587. 277.49 s [vector] prescanl': OK
  5588. 277.49 s [vector] +++ OK, passed 100 tests.
  5589. 277.49 s [vector] postscanl: OK
  5590. 277.49 s [vector] +++ OK, passed 100 tests.
  5591. 277.49 s [vector] postscanl': OK
  5592. 277.49 s [vector] +++ OK, passed 100 tests.
  5593. 277.49 s [vector] scanl: OK
  5594. 277.49 s [vector] +++ OK, passed 100 tests.
  5595. 277.49 s [vector] scanl': OK
  5596. 277.49 s [vector] +++ OK, passed 100 tests.
  5597. 277.49 s [vector] scanl1: OK
  5598. 277.49 s [vector] +++ OK, passed 100 tests.
  5599. 277.49 s [vector] scanl1': OK
  5600. 277.49 s [vector] +++ OK, passed 100 tests.
  5601. 277.49 s [vector] iscanl: OK
  5602. 277.49 s [vector] +++ OK, passed 100 tests.
  5603. 277.49 s [vector] iscanl': OK
  5604. 277.49 s [vector] +++ OK, passed 100 tests.
  5605. 277.49 s [vector] prescanr: OK
  5606. 277.49 s [vector] +++ OK, passed 100 tests.
  5607. 277.49 s [vector] prescanr': OK
  5608. 277.49 s [vector] +++ OK, passed 100 tests.
  5609. 277.49 s [vector] postscanr: OK
  5610. 277.49 s [vector] +++ OK, passed 100 tests.
  5611. 277.49 s [vector] postscanr': OK
  5612. 277.49 s [vector] +++ OK, passed 100 tests.
  5613. 277.49 s [vector] scanr: OK
  5614. 277.49 s [vector] +++ OK, passed 100 tests.
  5615. 277.49 s [vector] scanr': OK
  5616. 277.49 s [vector] +++ OK, passed 100 tests.
  5617. 277.49 s [vector] scanr1: OK
  5618. 277.49 s [vector] +++ OK, passed 100 tests.
  5619. 277.49 s [vector] scanr1': OK
  5620. 277.49 s [vector] +++ OK, passed 100 tests.
  5621. 277.49 s [vector] iscanr: OK
  5622. 277.49 s [vector] +++ OK, passed 100 tests.
  5623. 277.49 s [vector] iscanr': OK
  5624. 277.49 s [vector] +++ OK, passed 100 tests.
  5625. 277.49 s [vector] mut_read: OK
  5626. 277.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5627. 277.49 s [vector] mut_write: OK
  5628. 277.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5629. 277.49 s [vector] mut_modify: OK
  5630. 277.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5631. 277.49 s [vector] mut_generate: OK
  5632. 277.49 s [vector] +++ OK, passed 100 tests.
  5633. 277.49 s [vector] mut_generateM: OK
  5634. 277.49 s [vector] +++ OK, passed 100 tests.
  5635. 277.49 s [vector] mut_mapM_: OK (0.01s)
  5636. 277.49 s [vector] +++ OK, passed 100 tests.
  5637. 277.49 s [vector] mut_imapM_: OK (0.01s)
  5638. 277.49 s [vector] +++ OK, passed 100 tests.
  5639. 277.49 s [vector] mut_forM_: OK
  5640. 277.49 s [vector] +++ OK, passed 100 tests.
  5641. 277.49 s [vector] mut_iforM_: OK (0.01s)
  5642. 277.49 s [vector] +++ OK, passed 100 tests.
  5643. 277.49 s [vector] mut_foldr: OK
  5644. 277.49 s [vector] +++ OK, passed 100 tests.
  5645. 277.49 s [vector] mut_foldr': OK
  5646. 277.49 s [vector] +++ OK, passed 100 tests.
  5647. 277.49 s [vector] mut_foldl: OK
  5648. 277.49 s [vector] +++ OK, passed 100 tests.
  5649. 277.49 s [vector] mut_foldl': OK
  5650. 277.49 s [vector] +++ OK, passed 100 tests.
  5651. 277.49 s [vector] mut_ifoldr: OK
  5652. 277.49 s [vector] +++ OK, passed 100 tests.
  5653. 277.49 s [vector] mut_ifoldr': OK
  5654. 277.49 s [vector] +++ OK, passed 100 tests.
  5655. 277.49 s [vector] mut_ifoldl: OK
  5656. 277.49 s [vector] +++ OK, passed 100 tests.
  5657. 277.49 s [vector] mut_ifoldl': OK
  5658. 277.49 s [vector] +++ OK, passed 100 tests.
  5659. 277.49 s [vector] mut_foldM: OK
  5660. 277.49 s [vector] +++ OK, passed 100 tests.
  5661. 277.49 s [vector] mut_foldM': OK
  5662. 277.49 s [vector] +++ OK, passed 100 tests.
  5663. 277.49 s [vector] mut_foldrM: OK
  5664. 277.49 s [vector] +++ OK, passed 100 tests.
  5665. 277.49 s [vector] mut_foldrM': OK
  5666. 277.49 s [vector] +++ OK, passed 100 tests.
  5667. 277.49 s [vector] mut_ifoldM: OK
  5668. 277.49 s [vector] +++ OK, passed 100 tests.
  5669. 277.49 s [vector] mut_ifoldM': OK
  5670. 277.49 s [vector] +++ OK, passed 100 tests.
  5671. 277.49 s [vector] mut_ifoldrM: OK
  5672. 277.49 s [vector] +++ OK, passed 100 tests.
  5673. 277.49 s [vector] mut_ifoldrM': OK
  5674. 277.49 s [vector] +++ OK, passed 100 tests.
  5675. 277.49 s [vector] compare: OK
  5676. 277.49 s [vector] +++ OK, passed 100 tests.
  5677. 277.49 s [vector] maximum: OK
  5678. 277.49 s [vector] +++ OK, passed 100 tests; 22 discarded.
  5679. 277.49 s [vector] minimum: OK
  5680. 277.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5681. 277.49 s [vector] minIndex: OK
  5682. 277.49 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5683. 277.49 s [vector] maxIndex: OK
  5684. 277.49 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5685. 277.50 s [vector] maximumBy: OK
  5686. 277.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5687. 277.50 s [vector] minimumBy: OK
  5688. 277.50 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5689. 277.50 s [vector] maximumOn: OK
  5690. 277.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5691. 277.50 s [vector] minimumOn: OK
  5692. 277.50 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5693. 277.50 s [vector] maxIndexBy: OK
  5694. 277.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5695. 277.50 s [vector] minIndexBy: OK
  5696. 277.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5697. 277.50 s [vector] ListFirstMaxIndexWins: OK
  5698. 277.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5699. 277.50 s [vector] FalseListFirstMaxIndexWins: OK
  5700. 277.50 s [vector] +++ OK, failed as expected. (after 1 test):
  5701. 277.50 s [vector] Exception:
  5702. 277.50 s [vector] Prelude.foldr1: empty list
  5703. 277.50 s [vector] CallStack (from HasCallStack):
  5704. 277.50 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  5705. 277.50 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  5706. 277.50 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  5707. 277.50 s [vector] []
  5708. 277.50 s [vector] zip: OK
  5709. 277.50 s [vector] +++ OK, passed 100 tests.
  5710. 277.50 s [vector] zip3: OK
  5711. 277.50 s [vector] +++ OK, passed 100 tests.
  5712. 277.50 s [vector] unzip: OK
  5713. 277.50 s [vector] +++ OK, passed 100 tests.
  5714. 277.50 s [vector] unzip3: OK
  5715. 277.50 s [vector] +++ OK, passed 100 tests.
  5716. 277.50 s [vector] indexed: OK
  5717. 277.50 s [vector] +++ OK, passed 100 tests.
  5718. 277.50 s [vector] update: OK
  5719. 277.50 s [vector] +++ OK, passed 100 tests.
  5720. 277.50 s [vector] mempty: OK
  5721. 277.50 s [vector] +++ OK, passed 1 test.
  5722. 277.50 s [vector] mappend: OK
  5723. 277.50 s [vector] +++ OK, passed 100 tests.
  5724. 277.50 s [vector] mconcat: OK (0.01s)
  5725. 277.50 s [vector] +++ OK, passed 100 tests.
  5726. 277.50 s [vector] glength: OK
  5727. 277.50 s [vector] +++ OK, passed 100 tests.
  5728. 277.50 s [vector] and: OK
  5729. 277.50 s [vector] +++ OK, passed 100 tests.
  5730. 277.50 s [vector] or: OK
  5731. 277.50 s [vector] +++ OK, passed 100 tests.
  5732. 277.50 s [vector] (Int)
  5733. 277.50 s [vector] fromList.toList == id: OK
  5734. 277.50 s [vector] +++ OK, passed 100 tests.
  5735. 277.50 s [vector] toList.fromList == id: OK
  5736. 277.50 s [vector] +++ OK, passed 100 tests.
  5737. 277.50 s [vector] unstream.stream == id: OK
  5738. 277.50 s [vector] +++ OK, passed 100 tests.
  5739. 277.50 s [vector] stream.unstream == id: OK
  5740. 277.50 s [vector] +++ OK, passed 100 tests.
  5741. 277.50 s [vector] eq: OK
  5742. 277.50 s [vector] +++ OK, passed 100 tests.
  5743. 277.50 s [vector] length: OK
  5744. 277.50 s [vector] +++ OK, passed 100 tests.
  5745. 277.50 s [vector] null: OK
  5746. 277.50 s [vector] +++ OK, passed 100 tests.
  5747. 277.50 s [vector] index: OK
  5748. 277.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5749. 277.50 s [vector] safeIndex: OK
  5750. 277.50 s [vector] +++ OK, passed 100 tests.
  5751. 277.50 s [vector] head: OK
  5752. 277.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5753. 277.50 s [vector] last: OK
  5754. 277.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5755. 277.50 s [vector] unsafeIndex: OK
  5756. 277.50 s [vector] +++ OK, passed 100 tests; 24 discarded.
  5757. 277.50 s [vector] unsafeHead: OK
  5758. 277.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5759. 277.50 s [vector] unsafeLast: OK
  5760. 277.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5761. 277.50 s [vector] slice: OK
  5762. 277.50 s [vector] +++ OK, passed 100 tests.
  5763. 277.50 s [vector] init: OK
  5764. 277.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5765. 277.50 s [vector] tail: OK
  5766. 277.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5767. 277.50 s [vector] take: OK
  5768. 277.50 s [vector] +++ OK, passed 100 tests.
  5769. 277.50 s [vector] drop: OK
  5770. 277.50 s [vector] +++ OK, passed 100 tests.
  5771. 277.50 s [vector] splitAt: OK
  5772. 277.50 s [vector] +++ OK, passed 100 tests.
  5773. 277.50 s [vector] empty: OK
  5774. 277.50 s [vector] +++ OK, passed 1 test.
  5775. 277.50 s [vector] singleton: OK
  5776. 277.50 s [vector] +++ OK, passed 100 tests.
  5777. 277.50 s [vector] replicate: OK
  5778. 277.50 s [vector] +++ OK, passed 100 tests.
  5779. 277.50 s [vector] generate: OK
  5780. 277.50 s [vector] +++ OK, passed 100 tests.
  5781. 277.50 s [vector] iterateN: OK
  5782. 277.50 s [vector] +++ OK, passed 100 tests.
  5783. 277.50 s [vector] iterateNM: OK (0.02s)
  5784. 277.50 s [vector] +++ OK, passed 100 tests.
  5785. 277.50 s [vector] generateM: OK (0.02s)
  5786. 277.50 s [vector] +++ OK, passed 100 tests.
  5787. 277.50 s [vector] replicateM: OK
  5788. 277.50 s [vector] +++ OK, passed 100 tests.
  5789. 277.50 s [vector] create: OK
  5790. 277.50 s [vector] +++ OK, passed 100 tests.
  5791. 277.50 s [vector] createT: OK
  5792. 277.50 s [vector] +++ OK, passed 100 tests.
  5793. 277.50 s [vector] unfoldr: OK
  5794. 277.50 s [vector] +++ OK, passed 100 tests.
  5795. 277.50 s [vector] unfoldrN: OK
  5796. 277.50 s [vector] +++ OK, passed 100 tests.
  5797. 277.50 s [vector] unfoldrExactN: OK
  5798. 277.50 s [vector] +++ OK, passed 100 tests.
  5799. 277.50 s [vector] unfoldrM: OK
  5800. 277.50 s [vector] +++ OK, passed 100 tests.
  5801. 277.50 s [vector] unfoldrNM: OK
  5802. 277.50 s [vector] +++ OK, passed 100 tests.
  5803. 277.50 s [vector] unfoldrExactNM: OK (0.03s)
  5804. 277.50 s [vector] +++ OK, passed 100 tests.
  5805. 277.50 s [vector] constructN: OK
  5806. 277.50 s [vector] +++ OK, passed 100 tests.
  5807. 277.50 s [vector] constructrN: OK
  5808. 277.50 s [vector] +++ OK, passed 100 tests.
  5809. 277.50 s [vector] cons: OK
  5810. 277.50 s [vector] +++ OK, passed 100 tests.
  5811. 277.50 s [vector] snoc: OK
  5812. 277.50 s [vector] +++ OK, passed 100 tests.
  5813. 277.50 s [vector] append: OK
  5814. 277.50 s [vector] +++ OK, passed 100 tests.
  5815. 277.50 s [vector] concat: OK (0.02s)
  5816. 277.50 s [vector] +++ OK, passed 100 tests.
  5817. 277.50 s [vector] force: OK
  5818. 277.50 s [vector] +++ OK, passed 100 tests.
  5819. 277.50 s [vector] upd: OK
  5820. 277.50 s [vector] +++ OK, passed 100 tests.
  5821. 277.50 s [vector] accum: OK
  5822. 277.50 s [vector] +++ OK, passed 100 tests.
  5823. 277.50 s [vector] reverse: OK
  5824. 277.50 s [vector] +++ OK, passed 100 tests.
  5825. 277.50 s [vector] backpermute: OK
  5826. 277.50 s [vector] +++ OK, passed 100 tests.
  5827. 277.50 s [vector] map: OK
  5828. 277.50 s [vector] +++ OK, passed 100 tests.
  5829. 277.50 s [vector] imap: OK
  5830. 277.50 s [vector] +++ OK, passed 100 tests.
  5831. 277.50 s [vector] concatMap: OK
  5832. 277.50 s [vector] +++ OK, passed 100 tests.
  5833. 277.50 s [vector] mapM: OK
  5834. 277.50 s [vector] +++ OK, passed 100 tests.
  5835. 277.50 s [vector] mapM_: OK (0.02s)
  5836. 277.50 s [vector] +++ OK, passed 100 tests.
  5837. 277.50 s [vector] forM: OK
  5838. 277.50 s [vector] +++ OK, passed 100 tests.
  5839. 277.50 s [vector] forM_: OK (0.01s)
  5840. 277.50 s [vector] +++ OK, passed 100 tests.
  5841. 277.50 s [vector] imapM: OK
  5842. 277.50 s [vector] +++ OK, passed 100 tests.
  5843. 277.50 s [vector] imapM_: OK (0.02s)
  5844. 277.50 s [vector] +++ OK, passed 100 tests.
  5845. 277.50 s [vector] zipWith: OK
  5846. 277.50 s [vector] +++ OK, passed 100 tests.
  5847. 277.50 s [vector] zipWith3: OK
  5848. 277.50 s [vector] +++ OK, passed 100 tests.
  5849. 277.50 s [vector] izipWith: OK
  5850. 277.50 s [vector] +++ OK, passed 100 tests.
  5851. 277.50 s [vector] izipWith3: OK
  5852. 277.50 s [vector] +++ OK, passed 100 tests.
  5853. 277.50 s [vector] izipWithM: OK
  5854. 277.50 s [vector] +++ OK, passed 100 tests.
  5855. 277.50 s [vector] izipWithM_: OK (0.01s)
  5856. 277.50 s [vector] +++ OK, passed 100 tests.
  5857. 277.50 s [vector] zipWithM: OK
  5858. 277.50 s [vector] +++ OK, passed 100 tests.
  5859. 277.50 s [vector] zipWithM_: OK (0.01s)
  5860. 277.50 s [vector] +++ OK, passed 100 tests.
  5861. 277.50 s [vector] filter: OK
  5862. 277.50 s [vector] +++ OK, passed 100 tests.
  5863. 277.50 s [vector] ifilter: OK
  5864. 277.50 s [vector] +++ OK, passed 100 tests.
  5865. 277.50 s [vector] filterM: OK (0.02s)
  5866. 277.50 s [vector] +++ OK, passed 100 tests.
  5867. 277.50 s [vector] uniq: OK
  5868. 277.50 s [vector] +++ OK, passed 100 tests.
  5869. 277.50 s [vector] mapMaybe: OK
  5870. 277.51 s [vector] +++ OK, passed 100 tests.
  5871. 277.51 s [vector] imapMaybe: OK
  5872. 277.51 s [vector] +++ OK, passed 100 tests.
  5873. 277.51 s [vector] takeWhile: OK
  5874. 277.51 s [vector] +++ OK, passed 100 tests.
  5875. 277.51 s [vector] dropWhile: OK
  5876. 277.51 s [vector] +++ OK, passed 100 tests.
  5877. 277.51 s [vector] partition: OK
  5878. 277.52 s [vector] +++ OK, passed 100 tests.
  5879. 277.52 s [vector] partitionWith: OK
  5880. 277.52 s [vector] +++ OK, passed 100 tests.
  5881. 277.52 s [vector] span: OK
  5882. 277.52 s [vector] +++ OK, passed 100 tests.
  5883. 277.52 s [vector] break: OK
  5884. 277.52 s [vector] +++ OK, passed 100 tests.
  5885. 277.52 s [vector] spanR: OK
  5886. 277.52 s [vector] +++ OK, passed 100 tests.
  5887. 277.52 s [vector] breakR: OK
  5888. 277.52 s [vector] +++ OK, passed 100 tests.
  5889. 277.52 s [vector] groupBy: OK
  5890. 277.52 s [vector] +++ OK, passed 100 tests.
  5891. 277.52 s [vector] elem: OK
  5892. 277.52 s [vector] +++ OK, passed 100 tests.
  5893. 277.52 s [vector] notElem: OK
  5894. 277.52 s [vector] +++ OK, passed 100 tests.
  5895. 277.52 s [vector] find: OK
  5896. 277.52 s [vector] +++ OK, passed 100 tests.
  5897. 277.52 s [vector] findIndex: OK
  5898. 277.53 s [vector] +++ OK, passed 100 tests.
  5899. 277.53 s [vector] findIndexR: OK
  5900. 277.53 s [vector] +++ OK, passed 100 tests.
  5901. 277.53 s [vector] findIndices: OK
  5902. 277.53 s [vector] +++ OK, passed 100 tests.
  5903. 277.53 s [vector] elemIndex: OK
  5904. 277.53 s [vector] +++ OK, passed 100 tests.
  5905. 277.53 s [vector] elemIndices: OK
  5906. 277.53 s [vector] +++ OK, passed 100 tests.
  5907. 277.53 s [vector] foldl: OK
  5908. 277.53 s [vector] +++ OK, passed 100 tests.
  5909. 277.54 s [vector] foldl1: OK
  5910. 277.54 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5911. 277.54 s [vector] foldl': OK
  5912. 277.54 s [vector] +++ OK, passed 100 tests.
  5913. 277.54 s [vector] foldl1': OK
  5914. 277.54 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5915. 277.55 s [vector] foldr: OK
  5916. 277.55 s [vector] +++ OK, passed 100 tests.
  5917. 277.55 s [vector] foldr1: OK
  5918. 277.55 s [vector] +++ OK, passed 100 tests; 26 discarded.
  5919. 277.55 s [vector] foldr': OK
  5920. 277.55 s [vector] +++ OK, passed 100 tests.
  5921. 277.55 s [vector] foldr1': OK
  5922. 277.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5923. 277.56 s [vector] ifoldl: OK
  5924. 277.56 s [vector] +++ OK, passed 100 tests.
  5925. 277.56 s [vector] ifoldl': OK
  5926. 277.56 s [vector] +++ OK, passed 100 tests.
  5927. 277.56 s [vector] ifoldr: OK
  5928. 277.56 s [vector] +++ OK, passed 100 tests.
  5929. 277.57 s [vector] ifoldr': OK
  5930. 277.57 s [vector] +++ OK, passed 100 tests.
  5931. 277.57 s [vector] ifoldM: OK
  5932. 277.57 s [vector] +++ OK, passed 100 tests.
  5933. 277.57 s [vector] ifoldM': OK
  5934. 277.57 s [vector] +++ OK, passed 100 tests.
  5935. 277.59 s [vector] ifoldM_: OK (0.02s)
  5936. 277.59 s [vector] +++ OK, passed 100 tests.
  5937. 277.61 s [vector] ifoldM'_: OK (0.02s)
  5938. 277.61 s [vector] +++ OK, passed 100 tests.
  5939. 277.61 s [vector] all: OK
  5940. 277.61 s [vector] +++ OK, passed 100 tests.
  5941. 277.61 s [vector] any: OK
  5942. 277.61 s [vector] +++ OK, passed 100 tests.
  5943. 277.61 s [vector] prescanl: OK
  5944. 277.61 s [vector] +++ OK, passed 100 tests.
  5945. 277.62 s [vector] prescanl': OK
  5946. 277.62 s [vector] +++ OK, passed 100 tests.
  5947. 277.62 s [vector] postscanl: OK
  5948. 277.62 s [vector] +++ OK, passed 100 tests.
  5949. 277.62 s [vector] postscanl': OK
  5950. 277.62 s [vector] +++ OK, passed 100 tests.
  5951. 277.62 s [vector] scanl: OK
  5952. 277.63 s [vector] +++ OK, passed 100 tests.
  5953. 277.63 s [vector] scanl': OK
  5954. 277.63 s [vector] +++ OK, passed 100 tests.
  5955. 277.63 s [vector] scanl1: OK
  5956. 277.63 s [vector] +++ OK, passed 100 tests.
  5957. 277.63 s [vector] scanl1': OK
  5958. 277.64 s [vector] +++ OK, passed 100 tests.
  5959. 277.65 s [vector] iscanl: OK (0.01s)
  5960. 277.65 s [vector] +++ OK, passed 100 tests.
  5961. 277.65 s [vector] iscanl': OK
  5962. 277.65 s [vector] +++ OK, passed 100 tests.
  5963. 277.65 s [vector] prescanr: OK
  5964. 277.65 s [vector] +++ OK, passed 100 tests.
  5965. 277.65 s [vector] prescanr': OK
  5966. 277.65 s [vector] +++ OK, passed 100 tests.
  5967. 277.66 s [vector] postscanr: OK
  5968. 277.66 s [vector] +++ OK, passed 100 tests.
  5969. 277.66 s [vector] postscanr': OK
  5970. 277.66 s [vector] +++ OK, passed 100 tests.
  5971. 277.66 s [vector] scanr: OK
  5972. 277.66 s [vector] +++ OK, passed 100 tests.
  5973. 277.67 s [vector] scanr': OK
  5974. 277.67 s [vector] +++ OK, passed 100 tests.
  5975. 277.67 s [vector] scanr1: OK
  5976. 277.67 s [vector] +++ OK, passed 100 tests.
  5977. 277.68 s [vector] scanr1': OK
  5978. 277.68 s [vector] +++ OK, passed 100 tests.
  5979. 277.68 s [vector] iscanr: OK
  5980. 277.68 s [vector] +++ OK, passed 100 tests.
  5981. 277.69 s [vector] iscanr': OK
  5982. 277.69 s [vector] +++ OK, passed 100 tests.
  5983. 277.69 s [vector] mut_read: OK
  5984. 277.69 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5985. 277.69 s [vector] mut_write: OK
  5986. 277.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5987. 277.70 s [vector] mut_modify: OK
  5988. 277.70 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5989. 277.71 s [vector] mut_generate: OK
  5990. 277.71 s [vector] +++ OK, passed 100 tests.
  5991. 277.71 s [vector] mut_generateM: OK (0.01s)
  5992. 277.71 s [vector] +++ OK, passed 100 tests.
  5993. 277.73 s [vector] mut_mapM_: OK (0.02s)
  5994. 277.73 s [vector] +++ OK, passed 100 tests.
  5995. 277.74 s [vector] mut_imapM_: OK (0.02s)
  5996. 277.75 s [vector] +++ OK, passed 100 tests.
  5997. 277.75 s [vector] mut_forM_: OK (0.01s)
  5998. 277.75 s [vector] +++ OK, passed 100 tests.
  5999. 277.76 s [vector] mut_iforM_: OK (0.02s)
  6000. 277.76 s [vector] +++ OK, passed 100 tests.
  6001. 277.76 s [vector] mut_foldr: OK
  6002. 277.76 s [vector] +++ OK, passed 100 tests.
  6003. 277.76 s [vector] mut_foldr': OK
  6004. 277.76 s [vector] +++ OK, passed 100 tests.
  6005. 277.77 s [vector] mut_foldl: OK
  6006. 277.77 s [vector] +++ OK, passed 100 tests.
  6007. 277.77 s [vector] mut_foldl': OK
  6008. 277.77 s [vector] +++ OK, passed 100 tests.
  6009. 277.78 s [vector] mut_ifoldr: OK
  6010. 277.78 s [vector] +++ OK, passed 100 tests.
  6011. 277.78 s [vector] mut_ifoldr': OK
  6012. 277.79 s [vector] +++ OK, passed 100 tests.
  6013. 277.79 s [vector] mut_ifoldl: OK
  6014. 277.79 s [vector] +++ OK, passed 100 tests.
  6015. 277.80 s [vector] mut_ifoldl': OK
  6016. 277.80 s [vector] +++ OK, passed 100 tests.
  6017. 277.80 s [vector] mut_foldM: OK
  6018. 277.80 s [vector] +++ OK, passed 100 tests.
  6019. 277.80 s [vector] mut_foldM': OK
  6020. 277.80 s [vector] +++ OK, passed 100 tests.
  6021. 277.80 s [vector] mut_foldrM: OK
  6022. 277.80 s [vector] +++ OK, passed 100 tests.
  6023. 277.80 s [vector] mut_foldrM': OK
  6024. 277.80 s [vector] +++ OK, passed 100 tests.
  6025. 277.80 s [vector] mut_ifoldM: OK
  6026. 277.80 s [vector] +++ OK, passed 100 tests.
  6027. 277.80 s [vector] mut_ifoldM': OK
  6028. 277.81 s [vector] +++ OK, passed 100 tests.
  6029. 277.81 s [vector] mut_ifoldrM: OK
  6030. 277.82 s [vector] +++ OK, passed 100 tests.
  6031. 277.82 s [vector] mut_ifoldrM': OK
  6032. 277.82 s [vector] +++ OK, passed 100 tests.
  6033. 277.82 s [vector] compare: OK
  6034. 277.82 s [vector] +++ OK, passed 100 tests.
  6035. 277.82 s [vector] maximum: OK
  6036. 277.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6037. 277.82 s [vector] minimum: OK
  6038. 277.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6039. 277.82 s [vector] minIndex: OK
  6040. 277.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6041. 277.82 s [vector] maxIndex: OK
  6042. 277.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6043. 277.82 s [vector] maximumBy: OK
  6044. 277.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6045. 277.82 s [vector] minimumBy: OK
  6046. 277.82 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6047. 277.82 s [vector] maximumOn: OK
  6048. 277.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6049. 277.82 s [vector] minimumOn: OK
  6050. 277.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6051. 277.82 s [vector] maxIndexBy: OK
  6052. 277.82 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6053. 277.82 s [vector] minIndexBy: OK
  6054. 277.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6055. 277.83 s [vector] ListFirstMaxIndexWins: OK
  6056. 277.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6057. 277.83 s [vector] FalseListFirstMaxIndexWins: OK
  6058. 277.83 s [vector] +++ OK, failed as expected. (after 1 test):
  6059. 277.83 s [vector] Exception:
  6060. 277.83 s [vector] Prelude.foldr1: empty list
  6061. 277.83 s [vector] CallStack (from HasCallStack):
  6062. 277.83 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  6063. 277.83 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  6064. 277.83 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6065. 277.83 s [vector] []
  6066. 277.83 s [vector] zip: OK
  6067. 277.83 s [vector] +++ OK, passed 100 tests.
  6068. 277.83 s [vector] zip3: OK
  6069. 277.83 s [vector] +++ OK, passed 100 tests.
  6070. 277.83 s [vector] unzip: OK
  6071. 277.83 s [vector] +++ OK, passed 100 tests.
  6072. 277.83 s [vector] unzip3: OK
  6073. 277.83 s [vector] +++ OK, passed 100 tests.
  6074. 277.85 s [vector] indexed: OK
  6075. 277.85 s [vector] +++ OK, passed 100 tests.
  6076. 277.85 s [vector] update: OK
  6077. 277.85 s [vector] +++ OK, passed 100 tests.
  6078. 277.85 s [vector] mempty: OK
  6079. 277.85 s [vector] +++ OK, passed 1 test.
  6080. 277.85 s [vector] mappend: OK
  6081. 277.85 s [vector] +++ OK, passed 100 tests.
  6082. 277.85 s [vector] mconcat: OK (0.01s)
  6083. 277.85 s [vector] +++ OK, passed 100 tests.
  6084. 277.85 s [vector] glength: OK
  6085. 277.85 s [vector] +++ OK, passed 100 tests.
  6086. 277.85 s [vector] sum: OK
  6087. 277.85 s [vector] +++ OK, passed 100 tests.
  6088. 277.85 s [vector] product: OK
  6089. 277.85 s [vector] +++ OK, passed 100 tests.
  6090. 277.85 s [vector] enumFromN: OK
  6091. 277.85 s [vector] +++ OK, passed 100 tests.
  6092. 277.85 s [vector] enumFromThenN: OK
  6093. 277.85 s [vector] +++ OK, passed 100 tests.
  6094. 277.85 s [vector] enumFromTo: OK
  6095. 277.86 s [vector] +++ OK, passed 100 tests.
  6096. 277.86 s [vector] enumFromThenTo: OK
  6097. 277.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6098. 277.86 s [vector] (Float)
  6099. 277.86 s [vector] fromList.toList == id: OK
  6100. 277.86 s [vector] +++ OK, passed 100 tests.
  6101. 277.86 s [vector] toList.fromList == id: OK
  6102. 277.86 s [vector] +++ OK, passed 100 tests.
  6103. 277.86 s [vector] unstream.stream == id: OK
  6104. 277.86 s [vector] +++ OK, passed 100 tests.
  6105. 277.86 s [vector] stream.unstream == id: OK
  6106. 277.86 s [vector] +++ OK, passed 100 tests.
  6107. 277.86 s [vector] eq: OK
  6108. 277.86 s [vector] +++ OK, passed 100 tests.
  6109. 277.86 s [vector] length: OK
  6110. 277.86 s [vector] +++ OK, passed 100 tests.
  6111. 277.86 s [vector] null: OK
  6112. 277.86 s [vector] +++ OK, passed 100 tests.
  6113. 277.86 s [vector] index: OK
  6114. 277.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6115. 277.86 s [vector] safeIndex: OK
  6116. 277.86 s [vector] +++ OK, passed 100 tests.
  6117. 277.86 s [vector] head: OK
  6118. 277.86 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6119. 277.87 s [vector] last: OK
  6120. 277.87 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6121. 277.87 s [vector] unsafeIndex: OK
  6122. 277.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6123. 277.87 s [vector] unsafeHead: OK
  6124. 277.87 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6125. 277.87 s [vector] unsafeLast: OK
  6126. 277.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6127. 277.87 s [vector] slice: OK
  6128. 277.87 s [vector] +++ OK, passed 100 tests.
  6129. 277.87 s [vector] init: OK
  6130. 277.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6131. 277.87 s [vector] tail: OK
  6132. 277.87 s [vector] +++ OK, passed 100 tests; 34 discarded.
  6133. 277.87 s [vector] take: OK
  6134. 277.87 s [vector] +++ OK, passed 100 tests.
  6135. 277.87 s [vector] drop: OK
  6136. 277.87 s [vector] +++ OK, passed 100 tests.
  6137. 277.88 s [vector] splitAt: OK
  6138. 277.88 s [vector] +++ OK, passed 100 tests.
  6139. 277.88 s [vector] empty: OK
  6140. 277.88 s [vector] +++ OK, passed 1 test.
  6141. 277.88 s [vector] singleton: OK
  6142. 277.88 s [vector] +++ OK, passed 100 tests.
  6143. 277.88 s [vector] replicate: OK
  6144. 277.88 s [vector] +++ OK, passed 100 tests.
  6145. 277.88 s [vector] generate: OK
  6146. 277.88 s [vector] +++ OK, passed 100 tests.
  6147. 277.89 s [vector] iterateN: OK
  6148. 277.89 s [vector] +++ OK, passed 100 tests.
  6149. 277.93 s [vector] iterateNM: OK (0.04s)
  6150. 277.93 s [vector] +++ OK, passed 100 tests.
  6151. 277.97 s [vector] generateM: OK (0.03s)
  6152. 277.97 s [vector] +++ OK, passed 100 tests.
  6153. 277.97 s [vector] replicateM: OK (0.02s)
  6154. 277.97 s [vector] +++ OK, passed 100 tests.
  6155. 277.97 s [vector] create: OK
  6156. 277.97 s [vector] +++ OK, passed 100 tests.
  6157. 277.97 s [vector] createT: OK
  6158. 277.97 s [vector] +++ OK, passed 100 tests.
  6159. 277.97 s [vector] unfoldr: OK
  6160. 277.97 s [vector] +++ OK, passed 100 tests.
  6161. 277.97 s [vector] unfoldrN: OK
  6162. 277.97 s [vector] +++ OK, passed 100 tests.
  6163. 277.98 s [vector] unfoldrExactN: OK
  6164. 277.98 s [vector] +++ OK, passed 100 tests.
  6165. 277.98 s [vector] unfoldrM: OK
  6166. 277.98 s [vector] +++ OK, passed 100 tests.
  6167. 277.98 s [vector] unfoldrNM: OK
  6168. 277.99 s [vector] +++ OK, passed 100 tests.
  6169. 278.03 s [vector] unfoldrExactNM: OK (0.03s)
  6170. 278.03 s [vector] +++ OK, passed 100 tests.
  6171. 278.03 s [vector] constructN: OK (0.02s)
  6172. 278.03 s [vector] +++ OK, passed 100 tests.
  6173. 278.04 s [vector] constructrN: OK
  6174. 278.04 s [vector] +++ OK, passed 100 tests.
  6175. 278.04 s [vector] cons: OK
  6176. 278.04 s [vector] +++ OK, passed 100 tests.
  6177. 278.04 s [vector] snoc: OK
  6178. 278.04 s [vector] +++ OK, passed 100 tests.
  6179. 278.04 s [vector] append: OK
  6180. 278.04 s [vector] +++ OK, passed 100 tests.
  6181. 278.06 s [vector] concat: OK (0.02s)
  6182. 278.07 s [vector] +++ OK, passed 100 tests.
  6183. 278.07 s [vector] force: OK
  6184. 278.07 s [vector] +++ OK, passed 100 tests.
  6185. 278.07 s [vector] upd: OK
  6186. 278.07 s [vector] +++ OK, passed 100 tests.
  6187. 278.08 s [vector] accum: OK (0.01s)
  6188. 278.08 s [vector] +++ OK, passed 100 tests.
  6189. 278.08 s [vector] reverse: OK
  6190. 278.08 s [vector] +++ OK, passed 100 tests.
  6191. 278.08 s [vector] backpermute: OK
  6192. 278.08 s [vector] +++ OK, passed 100 tests.
  6193. 278.09 s [vector] map: OK
  6194. 278.09 s [vector] +++ OK, passed 100 tests.
  6195. 278.09 s [vector] imap: OK
  6196. 278.09 s [vector] +++ OK, passed 100 tests.
  6197. 278.10 s [vector] concatMap: OK
  6198. 278.10 s [vector] +++ OK, passed 100 tests.
  6199. 278.11 s [vector] mapM: OK
  6200. 278.11 s [vector] +++ OK, passed 100 tests.
  6201. 278.14 s [vector] mapM_: OK (0.04s)
  6202. 278.14 s [vector] +++ OK, passed 100 tests.
  6203. 278.15 s [vector] forM: OK
  6204. 278.15 s [vector] +++ OK, passed 100 tests.
  6205. 278.19 s [vector] forM_: OK (0.03s)
  6206. 278.19 s [vector] +++ OK, passed 100 tests.
  6207. 278.21 s [vector] imapM: OK
  6208. 278.21 s [vector] +++ OK, passed 100 tests.
  6209. 278.23 s [vector] imapM_: OK (0.03s)
  6210. 278.23 s [vector] +++ OK, passed 100 tests.
  6211. 278.23 s [vector] zipWith: OK
  6212. 278.23 s [vector] +++ OK, passed 100 tests.
  6213. 278.25 s [vector] zipWith3: OK
  6214. 278.25 s [vector] +++ OK, passed 100 tests.
  6215. 278.25 s [vector] izipWith: OK (0.01s)
  6216. 278.25 s [vector] +++ OK, passed 100 tests.
  6217. 278.26 s [vector] izipWith3: OK (0.01s)
  6218. 278.26 s [vector] +++ OK, passed 100 tests.
  6219. 278.27 s [vector] izipWithM: OK
  6220. 278.27 s [vector] +++ OK, passed 100 tests.
  6221. 278.30 s [vector] izipWithM_: OK (0.03s)
  6222. 278.30 s [vector] +++ OK, passed 100 tests.
  6223. 278.31 s [vector] zipWithM: OK
  6224. 278.31 s [vector] +++ OK, passed 100 tests.
  6225. 278.34 s [vector] zipWithM_: OK (0.03s)
  6226. 278.34 s [vector] +++ OK, passed 100 tests.
  6227. 278.34 s [vector] filter: OK
  6228. 278.34 s [vector] +++ OK, passed 100 tests.
  6229. 278.34 s [vector] ifilter: OK
  6230. 278.35 s [vector] +++ OK, passed 100 tests.
  6231. 278.39 s [vector] filterM: OK (0.04s)
  6232. 278.39 s [vector] +++ OK, passed 100 tests.
  6233. 278.39 s [vector] uniq: OK
  6234. 278.39 s [vector] +++ OK, passed 100 tests.
  6235. 278.40 s [vector] mapMaybe: OK
  6236. 278.40 s [vector] +++ OK, passed 100 tests.
  6237. 278.40 s [vector] imapMaybe: OK
  6238. 278.40 s [vector] +++ OK, passed 100 tests.
  6239. 278.40 s [vector] takeWhile: OK
  6240. 278.40 s [vector] +++ OK, passed 100 tests.
  6241. 278.41 s [vector] dropWhile: OK
  6242. 278.41 s [vector] +++ OK, passed 100 tests.
  6243. 278.41 s [vector] partition: OK
  6244. 278.41 s [vector] +++ OK, passed 100 tests.
  6245. 278.41 s [vector] partitionWith: OK
  6246. 278.41 s [vector] +++ OK, passed 100 tests.
  6247. 278.41 s [vector] span: OK
  6248. 278.41 s [vector] +++ OK, passed 100 tests.
  6249. 278.41 s [vector] break: OK
  6250. 278.41 s [vector] +++ OK, passed 100 tests.
  6251. 278.42 s [vector] spanR: OK
  6252. 278.42 s [vector] +++ OK, passed 100 tests.
  6253. 278.42 s [vector] breakR: OK
  6254. 278.42 s [vector] +++ OK, passed 100 tests.
  6255. 278.42 s [vector] groupBy: OK
  6256. 278.43 s [vector] +++ OK, passed 100 tests.
  6257. 278.43 s [vector] elem: OK
  6258. 278.43 s [vector] +++ OK, passed 100 tests.
  6259. 278.43 s [vector] notElem: OK
  6260. 278.43 s [vector] +++ OK, passed 100 tests.
  6261. 278.43 s [vector] find: OK
  6262. 278.43 s [vector] +++ OK, passed 100 tests.
  6263. 278.43 s [vector] findIndex: OK
  6264. 278.43 s [vector] +++ OK, passed 100 tests.
  6265. 278.43 s [vector] findIndexR: OK
  6266. 278.43 s [vector] +++ OK, passed 100 tests.
  6267. 278.44 s [vector] findIndices: OK
  6268. 278.44 s [vector] +++ OK, passed 100 tests.
  6269. 278.44 s [vector] elemIndex: OK
  6270. 278.44 s [vector] +++ OK, passed 100 tests.
  6271. 278.45 s [vector] elemIndices: OK
  6272. 278.45 s [vector] +++ OK, passed 100 tests.
  6273. 278.45 s [vector] foldl: OK
  6274. 278.45 s [vector] +++ OK, passed 100 tests.
  6275. 278.46 s [vector] foldl1: OK
  6276. 278.47 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6277. 278.47 s [vector] foldl': OK (0.01s)
  6278. 278.47 s [vector] +++ OK, passed 100 tests.
  6279. 278.49 s [vector] foldl1': OK (0.01s)
  6280. 278.49 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6281. 278.50 s [vector] foldr: OK (0.01s)
  6282. 278.50 s [vector] +++ OK, passed 100 tests.
  6283. 278.52 s [vector] foldr1: OK (0.01s)
  6284. 278.52 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6285. 278.52 s [vector] foldr': OK
  6286. 278.52 s [vector] +++ OK, passed 100 tests.
  6287. 278.53 s [vector] foldr1': OK
  6288. 278.53 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6289. 278.55 s [vector] ifoldl: OK (0.02s)
  6290. 278.55 s [vector] +++ OK, passed 100 tests.
  6291. 278.55 s [vector] ifoldl': OK (0.01s)
  6292. 278.55 s [vector] +++ OK, passed 100 tests.
  6293. 278.57 s [vector] ifoldr: OK (0.01s)
  6294. 278.57 s [vector] +++ OK, passed 100 tests.
  6295. 278.57 s [vector] ifoldr': OK
  6296. 278.57 s [vector] +++ OK, passed 100 tests.
  6297. 278.58 s [vector] ifoldM: OK
  6298. 278.58 s [vector] +++ OK, passed 100 tests.
  6299. 278.59 s [vector] ifoldM': OK (0.01s)
  6300. 278.59 s [vector] +++ OK, passed 100 tests.
  6301. 278.63 s [vector] ifoldM_: OK (0.04s)
  6302. 278.63 s [vector] +++ OK, passed 100 tests.
  6303. 278.67 s [vector] ifoldM'_: OK (0.04s)
  6304. 278.67 s [vector] +++ OK, passed 100 tests.
  6305. 278.67 s [vector] all: OK
  6306. 278.67 s [vector] +++ OK, passed 100 tests.
  6307. 278.67 s [vector] any: OK
  6308. 278.67 s [vector] +++ OK, passed 100 tests.
  6309. 278.68 s [vector] prescanl: OK
  6310. 278.69 s [vector] +++ OK, passed 100 tests.
  6311. 278.69 s [vector] prescanl': OK
  6312. 278.69 s [vector] +++ OK, passed 100 tests.
  6313. 278.71 s [vector] postscanl: OK
  6314. 278.71 s [vector] +++ OK, passed 100 tests.
  6315. 278.71 s [vector] postscanl': OK
  6316. 278.71 s [vector] +++ OK, passed 100 tests.
  6317. 278.71 s [vector] scanl: OK
  6318. 278.71 s [vector] +++ OK, passed 100 tests.
  6319. 278.72 s [vector] scanl': OK
  6320. 278.72 s [vector] +++ OK, passed 100 tests.
  6321. 278.72 s [vector] scanl1: OK
  6322. 278.72 s [vector] +++ OK, passed 100 tests.
  6323. 278.73 s [vector] scanl1': OK
  6324. 278.73 s [vector] +++ OK, passed 100 tests.
  6325. 278.74 s [vector] iscanl: OK
  6326. 278.74 s [vector] +++ OK, passed 100 tests.
  6327. 278.75 s [vector] iscanl': OK
  6328. 278.75 s [vector] +++ OK, passed 100 tests.
  6329. 278.76 s [vector] prescanr: OK
  6330. 278.76 s [vector] +++ OK, passed 100 tests.
  6331. 278.76 s [vector] prescanr': OK
  6332. 278.76 s [vector] +++ OK, passed 100 tests.
  6333. 278.77 s [vector] postscanr: OK
  6334. 278.77 s [vector] +++ OK, passed 100 tests.
  6335. 278.79 s [vector] postscanr': OK
  6336. 278.79 s [vector] +++ OK, passed 100 tests.
  6337. 278.79 s [vector] scanr: OK
  6338. 278.79 s [vector] +++ OK, passed 100 tests.
  6339. 278.80 s [vector] scanr': OK
  6340. 278.81 s [vector] +++ OK, passed 100 tests.
  6341. 278.81 s [vector] scanr1: OK
  6342. 278.81 s [vector] +++ OK, passed 100 tests.
  6343. 278.81 s [vector] scanr1': OK
  6344. 278.81 s [vector] +++ OK, passed 100 tests.
  6345. 278.82 s [vector] iscanr: OK
  6346. 278.82 s [vector] +++ OK, passed 100 tests.
  6347. 278.83 s [vector] iscanr': OK
  6348. 278.83 s [vector] +++ OK, passed 100 tests.
  6349. 278.83 s [vector] mut_read: OK
  6350. 278.83 s [vector] +++ OK, passed 100 tests; 24 discarded.
  6351. 278.84 s [vector] mut_write: OK
  6352. 278.84 s [vector] +++ OK, passed 100 tests; 23 discarded.
  6353. 278.84 s [vector] mut_modify: OK
  6354. 278.85 s [vector] +++ OK, passed 100 tests; 23 discarded.
  6355. 278.85 s [vector] mut_generate: OK
  6356. 278.85 s [vector] +++ OK, passed 100 tests.
  6357. 278.87 s [vector] mut_generateM: OK (0.02s)
  6358. 278.87 s [vector] +++ OK, passed 100 tests.
  6359. 278.91 s [vector] mut_mapM_: OK (0.04s)
  6360. 278.91 s [vector] +++ OK, passed 100 tests.
  6361. 278.95 s [vector] mut_imapM_: OK (0.04s)
  6362. 278.95 s [vector] +++ OK, passed 100 tests.
  6363. 278.97 s [vector] mut_forM_: OK (0.03s)
  6364. 278.97 s [vector] +++ OK, passed 100 tests.
  6365. 279.01 s [vector] mut_iforM_: OK (0.04s)
  6366. 279.01 s [vector] +++ OK, passed 100 tests.
  6367. 279.01 s [vector] mut_foldr: OK
  6368. 279.01 s [vector] +++ OK, passed 100 tests.
  6369. 279.02 s [vector] mut_foldr': OK
  6370. 279.02 s [vector] +++ OK, passed 100 tests.
  6371. 279.03 s [vector] mut_foldl: OK
  6372. 279.03 s [vector] +++ OK, passed 100 tests.
  6373. 279.04 s [vector] mut_foldl': OK
  6374. 279.05 s [vector] +++ OK, passed 100 tests.
  6375. 279.05 s [vector] mut_ifoldr: OK
  6376. 279.05 s [vector] +++ OK, passed 100 tests.
  6377. 279.06 s [vector] mut_ifoldr': OK
  6378. 279.06 s [vector] +++ OK, passed 100 tests.
  6379. 279.07 s [vector] mut_ifoldl: OK
  6380. 279.07 s [vector] +++ OK, passed 100 tests.
  6381. 279.08 s [vector] mut_ifoldl': OK
  6382. 279.09 s [vector] +++ OK, passed 100 tests.
  6383. 279.09 s [vector] mut_foldM: OK
  6384. 279.09 s [vector] +++ OK, passed 100 tests.
  6385. 279.09 s [vector] mut_foldM': OK
  6386. 279.09 s [vector] +++ OK, passed 100 tests.
  6387. 279.09 s [vector] mut_foldrM: OK
  6388. 279.09 s [vector] +++ OK, passed 100 tests.
  6389. 279.09 s [vector] mut_foldrM': OK
  6390. 279.10 s [vector] +++ OK, passed 100 tests.
  6391. 279.11 s [vector] mut_ifoldM: OK (0.01s)
  6392. 279.11 s [vector] +++ OK, passed 100 tests.
  6393. 279.12 s [vector] mut_ifoldM': OK
  6394. 279.12 s [vector] +++ OK, passed 100 tests.
  6395. 279.13 s [vector] mut_ifoldrM: OK
  6396. 279.13 s [vector] +++ OK, passed 100 tests.
  6397. 279.13 s [vector] mut_ifoldrM': OK
  6398. 279.13 s [vector] +++ OK, passed 100 tests.
  6399. 279.13 s [vector] compare: OK
  6400. 279.14 s [vector] +++ OK, passed 100 tests.
  6401. 279.14 s [vector] maximum: OK
  6402. 279.14 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6403. 279.14 s [vector] minimum: OK
  6404. 279.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6405. 279.14 s [vector] minIndex: OK
  6406. 279.14 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6407. 279.14 s [vector] maxIndex: OK
  6408. 279.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6409. 279.14 s [vector] maximumBy: OK
  6410. 279.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6411. 279.14 s [vector] minimumBy: OK
  6412. 279.14 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6413. 279.14 s [vector] maximumOn: OK
  6414. 279.14 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6415. 279.14 s [vector] minimumOn: OK
  6416. 279.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6417. 279.14 s [vector] maxIndexBy: OK
  6418. 279.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6419. 279.14 s [vector] minIndexBy: OK
  6420. 279.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6421. 279.14 s [vector] ListFirstMaxIndexWins: OK
  6422. 279.15 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6423. 279.15 s [vector] FalseListFirstMaxIndexWins: OK
  6424. 279.15 s [vector] +++ OK, failed as expected. (after 1 test):
  6425. 279.15 s [vector] Exception:
  6426. 279.15 s [vector] Prelude.foldr1: empty list
  6427. 279.15 s [vector] CallStack (from HasCallStack):
  6428. 279.16 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  6429. 279.16 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  6430. 279.16 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6431. 279.16 s [vector] []
  6432. 279.16 s [vector] zip: OK
  6433. 279.16 s [vector] +++ OK, passed 100 tests.
  6434. 279.16 s [vector] zip3: OK
  6435. 279.16 s [vector] +++ OK, passed 100 tests.
  6436. 279.16 s [vector] unzip: OK
  6437. 279.16 s [vector] +++ OK, passed 100 tests.
  6438. 279.16 s [vector] unzip3: OK
  6439. 279.16 s [vector] +++ OK, passed 100 tests.
  6440. 279.16 s [vector] indexed: OK
  6441. 279.16 s [vector] +++ OK, passed 100 tests.
  6442. 279.16 s [vector] update: OK
  6443. 279.16 s [vector] +++ OK, passed 100 tests.
  6444. 279.17 s [vector] mempty: OK
  6445. 279.17 s [vector] +++ OK, passed 1 test.
  6446. 279.17 s [vector] mappend: OK
  6447. 279.17 s [vector] +++ OK, passed 100 tests.
  6448. 279.18 s [vector] mconcat: OK (0.02s)
  6449. 279.18 s [vector] +++ OK, passed 100 tests.
  6450. 279.18 s [vector] glength: OK
  6451. 279.18 s [vector] +++ OK, passed 100 tests.
  6452. 279.19 s [vector] sum: OK
  6453. 279.19 s [vector] +++ OK, passed 100 tests.
  6454. 279.19 s [vector] product: OK
  6455. 279.19 s [vector] +++ OK, passed 100 tests.
  6456. 279.19 s [vector] enumFromN: OK
  6457. 279.19 s [vector] +++ OK, passed 100 tests.
  6458. 279.19 s [vector] enumFromThenN: OK
  6459. 279.19 s [vector] +++ OK, passed 100 tests.
  6460. 279.19 s [vector] enumFromTo: OK
  6461. 279.19 s [vector] +++ OK, passed 100 tests.
  6462. 279.19 s [vector] enumFromThenTo: OK
  6463. 279.19 s [vector] +++ OK, passed 100 tests.
  6464. 279.19 s [vector] (Double)
  6465. 279.19 s [vector] fromList.toList == id: OK
  6466. 279.19 s [vector] +++ OK, passed 100 tests.
  6467. 279.19 s [vector] toList.fromList == id: OK
  6468. 279.19 s [vector] +++ OK, passed 100 tests.
  6469. 279.19 s [vector] unstream.stream == id: OK
  6470. 279.19 s [vector] +++ OK, passed 100 tests.
  6471. 279.19 s [vector] stream.unstream == id: OK
  6472. 279.19 s [vector] +++ OK, passed 100 tests.
  6473. 279.19 s [vector] eq: OK
  6474. 279.19 s [vector] +++ OK, passed 100 tests.
  6475. 279.19 s [vector] length: OK
  6476. 279.19 s [vector] +++ OK, passed 100 tests.
  6477. 279.19 s [vector] null: OK
  6478. 279.20 s [vector] +++ OK, passed 100 tests.
  6479. 279.20 s [vector] index: OK
  6480. 279.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6481. 279.20 s [vector] safeIndex: OK
  6482. 279.20 s [vector] +++ OK, passed 100 tests.
  6483. 279.20 s [vector] head: OK
  6484. 279.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6485. 279.20 s [vector] last: OK
  6486. 279.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6487. 279.20 s [vector] unsafeIndex: OK
  6488. 279.20 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6489. 279.20 s [vector] unsafeHead: OK
  6490. 279.20 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6491. 279.20 s [vector] unsafeLast: OK
  6492. 279.20 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6493. 279.20 s [vector] slice: OK
  6494. 279.20 s [vector] +++ OK, passed 100 tests.
  6495. 279.20 s [vector] init: OK
  6496. 279.20 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6497. 279.20 s [vector] tail: OK
  6498. 279.20 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6499. 279.20 s [vector] take: OK
  6500. 279.20 s [vector] +++ OK, passed 100 tests.
  6501. 279.20 s [vector] drop: OK
  6502. 279.20 s [vector] +++ OK, passed 100 tests.
  6503. 279.20 s [vector] splitAt: OK
  6504. 279.20 s [vector] +++ OK, passed 100 tests.
  6505. 279.20 s [vector] empty: OK
  6506. 279.20 s [vector] +++ OK, passed 1 test.
  6507. 279.20 s [vector] singleton: OK
  6508. 279.20 s [vector] +++ OK, passed 100 tests.
  6509. 279.20 s [vector] replicate: OK
  6510. 279.20 s [vector] +++ OK, passed 100 tests.
  6511. 279.21 s [vector] generate: OK
  6512. 279.21 s [vector] +++ OK, passed 100 tests.
  6513. 279.23 s [vector] iterateN: OK
  6514. 279.23 s [vector] +++ OK, passed 100 tests.
  6515. 279.26 s [vector] iterateNM: OK (0.04s)
  6516. 279.26 s [vector] +++ OK, passed 100 tests.
  6517. 279.27 s [vector] generateM: OK (0.01s)
  6518. 279.27 s [vector] +++ OK, passed 100 tests.
  6519. 279.27 s [vector] replicateM: OK
  6520. 279.27 s [vector] +++ OK, passed 100 tests.
  6521. 279.27 s [vector] create: OK
  6522. 279.27 s [vector] +++ OK, passed 100 tests.
  6523. 279.27 s [vector] createT: OK
  6524. 279.27 s [vector] +++ OK, passed 100 tests.
  6525. 279.27 s [vector] unfoldr: OK
  6526. 279.27 s [vector] +++ OK, passed 100 tests.
  6527. 279.27 s [vector] unfoldrN: OK
  6528. 279.27 s [vector] +++ OK, passed 100 tests.
  6529. 279.27 s [vector] unfoldrExactN: OK
  6530. 279.28 s [vector] +++ OK, passed 100 tests.
  6531. 279.28 s [vector] unfoldrM: OK
  6532. 279.28 s [vector] +++ OK, passed 100 tests.
  6533. 279.28 s [vector] unfoldrNM: OK
  6534. 279.28 s [vector] +++ OK, passed 100 tests.
  6535. 279.33 s [vector] unfoldrExactNM: OK (0.02s)
  6536. 279.33 s [vector] +++ OK, passed 100 tests.
  6537. 279.34 s [vector] constructN: OK (0.02s)
  6538. 279.34 s [vector] +++ OK, passed 100 tests.
  6539. 279.34 s [vector] constructrN: OK (0.01s)
  6540. 279.34 s [vector] +++ OK, passed 100 tests.
  6541. 279.34 s [vector] cons: OK
  6542. 279.34 s [vector] +++ OK, passed 100 tests.
  6543. 279.35 s [vector] snoc: OK
  6544. 279.35 s [vector] +++ OK, passed 100 tests.
  6545. 279.35 s [vector] append: OK
  6546. 279.35 s [vector] +++ OK, passed 100 tests.
  6547. 279.37 s [vector] concat: OK (0.02s)
  6548. 279.37 s [vector] +++ OK, passed 100 tests.
  6549. 279.37 s [vector] force: OK
  6550. 279.37 s [vector] +++ OK, passed 100 tests.
  6551. 279.39 s [vector] upd: OK
  6552. 279.39 s [vector] +++ OK, passed 100 tests.
  6553. 279.39 s [vector] accum: OK (0.02s)
  6554. 279.39 s [vector] +++ OK, passed 100 tests.
  6555. 279.39 s [vector] reverse: OK
  6556. 279.40 s [vector] +++ OK, passed 100 tests.
  6557. 279.40 s [vector] backpermute: OK
  6558. 279.40 s [vector] +++ OK, passed 100 tests.
  6559. 279.41 s [vector] map: OK
  6560. 279.41 s [vector] +++ OK, passed 100 tests.
  6561. 279.42 s [vector] imap: OK
  6562. 279.43 s [vector] +++ OK, passed 100 tests.
  6563. 279.43 s [vector] concatMap: OK
  6564. 279.43 s [vector] +++ OK, passed 100 tests.
  6565. 279.45 s [vector] mapM: OK (0.01s)
  6566. 279.45 s [vector] +++ OK, passed 100 tests.
  6567. 279.47 s [vector] mapM_: OK (0.03s)
  6568. 279.47 s [vector] +++ OK, passed 100 tests.
  6569. 279.49 s [vector] forM: OK
  6570. 279.49 s [vector] +++ OK, passed 100 tests.
  6571. 279.51 s [vector] forM_: OK (0.03s)
  6572. 279.51 s [vector] +++ OK, passed 100 tests.
  6573. 279.53 s [vector] imapM: OK
  6574. 279.53 s [vector] +++ OK, passed 100 tests.
  6575. 279.55 s [vector] imapM_: OK (0.04s)
  6576. 279.55 s [vector] +++ OK, passed 100 tests.
  6577. 279.56 s [vector] zipWith: OK
  6578. 279.56 s [vector] +++ OK, passed 100 tests.
  6579. 279.57 s [vector] zipWith3: OK (0.01s)
  6580. 279.57 s [vector] +++ OK, passed 100 tests.
  6581. 279.59 s [vector] izipWith: OK (0.01s)
  6582. 279.59 s [vector] +++ OK, passed 100 tests.
  6583. 279.60 s [vector] izipWith3: OK (0.01s)
  6584. 279.61 s [vector] +++ OK, passed 100 tests.
  6585. 279.61 s [vector] izipWithM: OK (0.01s)
  6586. 279.61 s [vector] +++ OK, passed 100 tests.
  6587. 279.64 s [vector] izipWithM_: OK (0.03s)
  6588. 279.64 s [vector] +++ OK, passed 100 tests.
  6589. 279.64 s [vector] zipWithM: OK
  6590. 279.64 s [vector] +++ OK, passed 100 tests.
  6591. 279.69 s [vector] zipWithM_: OK (0.03s)
  6592. 279.69 s [vector] +++ OK, passed 100 tests.
  6593. 279.69 s [vector] filter: OK
  6594. 279.69 s [vector] +++ OK, passed 100 tests.
  6595. 279.71 s [vector] ifilter: OK (0.01s)
  6596. 279.71 s [vector] +++ OK, passed 100 tests.
  6597. 279.75 s [vector] filterM: OK (0.05s)
  6598. 279.75 s [vector] +++ OK, passed 100 tests.
  6599. 279.76 s [vector] uniq: OK
  6600. 279.76 s [vector] +++ OK, passed 100 tests.
  6601. 279.77 s [vector] mapMaybe: OK (0.01s)
  6602. 279.77 s [vector] +++ OK, passed 100 tests.
  6603. 279.78 s [vector] imapMaybe: OK (0.01s)
  6604. 279.78 s [vector] +++ OK, passed 100 tests.
  6605. 279.78 s [vector] takeWhile: OK
  6606. 279.79 s [vector] +++ OK, passed 100 tests.
  6607. 279.79 s [vector] dropWhile: OK
  6608. 279.79 s [vector] +++ OK, passed 100 tests.
  6609. 279.79 s [vector] partition: OK
  6610. 279.79 s [vector] +++ OK, passed 100 tests.
  6611. 279.79 s [vector] partitionWith: OK
  6612. 279.79 s [vector] +++ OK, passed 100 tests.
  6613. 279.79 s [vector] span: OK
  6614. 279.80 s [vector] +++ OK, passed 100 tests.
  6615. 279.81 s [vector] break: OK
  6616. 279.81 s [vector] +++ OK, passed 100 tests.
  6617. 279.81 s [vector] spanR: OK
  6618. 279.81 s [vector] +++ OK, passed 100 tests.
  6619. 279.81 s [vector] breakR: OK
  6620. 279.81 s [vector] +++ OK, passed 100 tests.
  6621. 279.81 s [vector] groupBy: OK (0.01s)
  6622. 279.81 s [vector] +++ OK, passed 100 tests.
  6623. 279.81 s [vector] elem: OK
  6624. 279.81 s [vector] +++ OK, passed 100 tests.
  6625. 279.81 s [vector] notElem: OK
  6626. 279.81 s [vector] +++ OK, passed 100 tests.
  6627. 279.81 s [vector] find: OK
  6628. 279.81 s [vector] +++ OK, passed 100 tests.
  6629. 279.81 s [vector] findIndex: OK
  6630. 279.81 s [vector] +++ OK, passed 100 tests.
  6631. 279.81 s [vector] findIndexR: OK
  6632. 279.82 s [vector] +++ OK, passed 100 tests.
  6633. 279.82 s [vector] findIndices: OK
  6634. 279.82 s [vector] +++ OK, passed 100 tests.
  6635. 279.82 s [vector] elemIndex: OK
  6636. 279.82 s [vector] +++ OK, passed 100 tests.
  6637. 279.83 s [vector] elemIndices: OK
  6638. 279.83 s [vector] +++ OK, passed 100 tests.
  6639. 279.85 s [vector] foldl: OK (0.01s)
  6640. 279.85 s [vector] +++ OK, passed 100 tests.
  6641. 279.85 s [vector] foldl1: OK (0.01s)
  6642. 279.85 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6643. 279.87 s [vector] foldl': OK (0.01s)
  6644. 279.87 s [vector] +++ OK, passed 100 tests.
  6645. 279.88 s [vector] foldl1': OK (0.01s)
  6646. 279.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6647. 279.89 s [vector] foldr: OK (0.01s)
  6648. 279.89 s [vector] +++ OK, passed 100 tests.
  6649. 279.91 s [vector] foldr1: OK (0.01s)
  6650. 279.91 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6651. 279.91 s [vector] foldr': OK (0.01s)
  6652. 279.91 s [vector] +++ OK, passed 100 tests.
  6653. 279.93 s [vector] foldr1': OK (0.01s)
  6654. 279.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6655. 279.94 s [vector] ifoldl: OK (0.01s)
  6656. 279.94 s [vector] +++ OK, passed 100 tests.
  6657. 279.95 s [vector] ifoldl': OK (0.01s)
  6658. 279.95 s [vector] +++ OK, passed 100 tests.
  6659. 279.97 s [vector] ifoldr: OK (0.01s)
  6660. 279.97 s [vector] +++ OK, passed 100 tests.
  6661. 279.97 s [vector] ifoldr': OK (0.01s)
  6662. 279.97 s [vector] +++ OK, passed 100 tests.
  6663. 279.99 s [vector] ifoldM: OK (0.01s)
  6664. 279.99 s [vector] +++ OK, passed 100 tests.
  6665. 280.01 s [vector] ifoldM': OK (0.01s)
  6666. 280.01 s [vector] +++ OK, passed 100 tests.
  6667. 280.05 s [vector] ifoldM_: OK (0.04s)
  6668. 280.05 s [vector] +++ OK, passed 100 tests.
  6669. 280.07 s [vector] ifoldM'_: OK (0.03s)
  6670. 280.07 s [vector] +++ OK, passed 100 tests.
  6671. 280.07 s [vector] all: OK
  6672. 280.07 s [vector] +++ OK, passed 100 tests.
  6673. 280.07 s [vector] any: OK
  6674. 280.07 s [vector] +++ OK, passed 100 tests.
  6675. 280.09 s [vector] prescanl: OK (0.01s)
  6676. 280.09 s [vector] +++ OK, passed 100 tests.
  6677. 280.11 s [vector] prescanl': OK (0.01s)
  6678. 280.11 s [vector] +++ OK, passed 100 tests.
  6679. 280.11 s [vector] postscanl: OK (0.01s)
  6680. 280.11 s [vector] +++ OK, passed 100 tests.
  6681. 280.13 s [vector] postscanl': OK (0.01s)
  6682. 280.13 s [vector] +++ OK, passed 100 tests.
  6683. 280.14 s [vector] scanl: OK (0.01s)
  6684. 280.14 s [vector] +++ OK, passed 100 tests.
  6685. 280.15 s [vector] scanl': OK (0.01s)
  6686. 280.15 s [vector] +++ OK, passed 100 tests.
  6687. 280.17 s [vector] scanl1: OK (0.01s)
  6688. 280.17 s [vector] +++ OK, passed 100 tests.
  6689. 280.17 s [vector] scanl1': OK (0.01s)
  6690. 280.17 s [vector] +++ OK, passed 100 tests.
  6691. 280.19 s [vector] iscanl: OK (0.01s)
  6692. 280.19 s [vector] +++ OK, passed 100 tests.
  6693. 280.20 s [vector] iscanl': OK (0.01s)
  6694. 280.20 s [vector] +++ OK, passed 100 tests.
  6695. 280.21 s [vector] prescanr: OK (0.01s)
  6696. 280.21 s [vector] +++ OK, passed 100 tests.
  6697. 280.23 s [vector] prescanr': OK (0.01s)
  6698. 280.23 s [vector] +++ OK, passed 100 tests.
  6699. 280.23 s [vector] postscanr: OK (0.01s)
  6700. 280.23 s [vector] +++ OK, passed 100 tests.
  6701. 280.25 s [vector] postscanr': OK (0.01s)
  6702. 280.25 s [vector] +++ OK, passed 100 tests.
  6703. 280.26 s [vector] scanr: OK (0.01s)
  6704. 280.26 s [vector] +++ OK, passed 100 tests.
  6705. 280.27 s [vector] scanr': OK (0.01s)
  6706. 280.27 s [vector] +++ OK, passed 100 tests.
  6707. 280.27 s [vector] scanr1: OK (0.01s)
  6708. 280.27 s [vector] +++ OK, passed 100 tests.
  6709. 280.29 s [vector] scanr1': OK
  6710. 280.29 s [vector] +++ OK, passed 100 tests.
  6711. 280.31 s [vector] iscanr: OK (0.01s)
  6712. 280.31 s [vector] +++ OK, passed 100 tests.
  6713. 280.32 s [vector] iscanr': OK (0.01s)
  6714. 280.32 s [vector] +++ OK, passed 100 tests.
  6715. 280.32 s [vector] mut_read: OK
  6716. 280.32 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6717. 280.32 s [vector] mut_write: OK
  6718. 280.32 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6719. 280.32 s [vector] mut_modify: OK
  6720. 280.32 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6721. 280.33 s [vector] mut_generate: OK
  6722. 280.33 s [vector] +++ OK, passed 100 tests.
  6723. 280.35 s [vector] mut_generateM: OK (0.02s)
  6724. 280.35 s [vector] +++ OK, passed 100 tests.
  6725. 280.37 s [vector] mut_mapM_: OK (0.03s)
  6726. 280.37 s [vector] +++ OK, passed 100 tests.
  6727. 280.41 s [vector] mut_imapM_: OK (0.03s)
  6728. 280.41 s [vector] +++ OK, passed 100 tests.
  6729. 280.45 s [vector] mut_forM_: OK (0.03s)
  6730. 280.45 s [vector] +++ OK, passed 100 tests.
  6731. 280.47 s [vector] mut_iforM_: OK (0.03s)
  6732. 280.47 s [vector] +++ OK, passed 100 tests.
  6733. 280.48 s [vector] mut_foldr: OK (0.01s)
  6734. 280.48 s [vector] +++ OK, passed 100 tests.
  6735. 280.49 s [vector] mut_foldr': OK (0.01s)
  6736. 280.49 s [vector] +++ OK, passed 100 tests.
  6737. 280.51 s [vector] mut_foldl: OK (0.01s)
  6738. 280.51 s [vector] +++ OK, passed 100 tests.
  6739. 280.52 s [vector] mut_foldl': OK (0.02s)
  6740. 280.52 s [vector] +++ OK, passed 100 tests.
  6741. 280.53 s [vector] mut_ifoldr: OK (0.01s)
  6742. 280.53 s [vector] +++ OK, passed 100 tests.
  6743. 280.53 s [vector] mut_ifoldr': OK (0.01s)
  6744. 280.53 s [vector] +++ OK, passed 100 tests.
  6745. 280.55 s [vector] mut_ifoldl: OK
  6746. 280.55 s [vector] +++ OK, passed 100 tests.
  6747. 280.57 s [vector] mut_ifoldl': OK (0.01s)
  6748. 280.57 s [vector] +++ OK, passed 100 tests.
  6749. 280.58 s [vector] mut_foldM: OK (0.01s)
  6750. 280.59 s [vector] +++ OK, passed 100 tests.
  6751. 280.59 s [vector] mut_foldM': OK (0.01s)
  6752. 280.59 s [vector] +++ OK, passed 100 tests.
  6753. 280.61 s [vector] mut_foldrM: OK (0.01s)
  6754. 280.61 s [vector] +++ OK, passed 100 tests.
  6755. 280.61 s [vector] mut_foldrM': OK (0.01s)
  6756. 280.61 s [vector] +++ OK, passed 100 tests.
  6757. 280.63 s [vector] mut_ifoldM: OK (0.01s)
  6758. 280.63 s [vector] +++ OK, passed 100 tests.
  6759. 280.65 s [vector] mut_ifoldM': OK (0.01s)
  6760. 280.65 s [vector] +++ OK, passed 100 tests.
  6761. 280.65 s [vector] mut_ifoldrM: OK (0.01s)
  6762. 280.65 s [vector] +++ OK, passed 100 tests.
  6763. 280.66 s [vector] mut_ifoldrM': OK (0.02s)
  6764. 280.66 s [vector] +++ OK, passed 100 tests.
  6765. 280.66 s [vector] compare: OK
  6766. 280.66 s [vector] +++ OK, passed 100 tests.
  6767. 280.66 s [vector] maximum: OK
  6768. 280.67 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6769. 280.67 s [vector] minimum: OK
  6770. 280.67 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6771. 280.67 s [vector] minIndex: OK
  6772. 280.67 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6773. 280.67 s [vector] maxIndex: OK
  6774. 280.67 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6775. 280.67 s [vector] maximumBy: OK
  6776. 280.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6777. 280.67 s [vector] minimumBy: OK
  6778. 280.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6779. 280.67 s [vector] maximumOn: OK
  6780. 280.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6781. 280.67 s [vector] minimumOn: OK
  6782. 280.67 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6783. 280.67 s [vector] maxIndexBy: OK
  6784. 280.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6785. 280.67 s [vector] minIndexBy: OK
  6786. 280.68 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6787. 280.68 s [vector] ListFirstMaxIndexWins: OK
  6788. 280.68 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6789. 280.68 s [vector] FalseListFirstMaxIndexWins: OK
  6790. 280.68 s [vector] +++ OK, failed as expected. (after 1 test):
  6791. 280.68 s [vector] Exception:
  6792. 280.68 s [vector] Prelude.foldr1: empty list
  6793. 280.68 s [vector] CallStack (from HasCallStack):
  6794. 280.68 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  6795. 280.68 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  6796. 280.68 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  6797. 280.68 s [vector] []
  6798. 280.68 s [vector] zip: OK
  6799. 280.68 s [vector] +++ OK, passed 100 tests.
  6800. 280.68 s [vector] zip3: OK
  6801. 280.68 s [vector] +++ OK, passed 100 tests.
  6802. 280.68 s [vector] unzip: OK
  6803. 280.68 s [vector] +++ OK, passed 100 tests.
  6804. 280.69 s [vector] unzip3: OK
  6805. 280.69 s [vector] +++ OK, passed 100 tests.
  6806. 280.69 s [vector] indexed: OK
  6807. 280.69 s [vector] +++ OK, passed 100 tests.
  6808. 280.69 s [vector] update: OK
  6809. 280.69 s [vector] +++ OK, passed 100 tests.
  6810. 280.69 s [vector] mempty: OK
  6811. 280.69 s [vector] +++ OK, passed 1 test.
  6812. 280.71 s [vector] mappend: OK
  6813. 280.71 s [vector] +++ OK, passed 100 tests.
  6814. 280.71 s [vector] mconcat: OK (0.02s)
  6815. 280.71 s [vector] +++ OK, passed 100 tests.
  6816. 280.71 s [vector] glength: OK
  6817. 280.71 s [vector] +++ OK, passed 100 tests.
  6818. 280.71 s [vector] sum: OK
  6819. 280.71 s [vector] +++ OK, passed 100 tests.
  6820. 280.71 s [vector] product: OK
  6821. 280.71 s [vector] +++ OK, passed 100 tests.
  6822. 280.71 s [vector] enumFromN: OK
  6823. 280.71 s [vector] +++ OK, passed 100 tests.
  6824. 280.72 s [vector] enumFromThenN: OK
  6825. 280.72 s [vector] +++ OK, passed 100 tests.
  6826. 280.72 s [vector] enumFromTo: OK
  6827. 280.72 s [vector] +++ OK, passed 100 tests.
  6828. 280.72 s [vector] enumFromThenTo: OK
  6829. 280.72 s [vector] +++ OK, passed 100 tests; 2 discarded.
  6830. 280.72 s [vector] (Int,Bool)
  6831. 280.72 s [vector] fromList.toList == id: OK
  6832. 280.72 s [vector] +++ OK, passed 100 tests.
  6833. 280.72 s [vector] toList.fromList == id: OK
  6834. 280.72 s [vector] +++ OK, passed 100 tests.
  6835. 280.72 s [vector] unstream.stream == id: OK
  6836. 280.72 s [vector] +++ OK, passed 100 tests.
  6837. 280.72 s [vector] stream.unstream == id: OK
  6838. 280.72 s [vector] +++ OK, passed 100 tests.
  6839. 280.72 s [vector] eq: OK
  6840. 280.72 s [vector] +++ OK, passed 100 tests.
  6841. 280.72 s [vector] length: OK
  6842. 280.72 s [vector] +++ OK, passed 100 tests.
  6843. 280.72 s [vector] null: OK
  6844. 280.72 s [vector] +++ OK, passed 100 tests.
  6845. 280.72 s [vector] index: OK
  6846. 280.72 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6847. 280.72 s [vector] safeIndex: OK
  6848. 280.72 s [vector] +++ OK, passed 100 tests.
  6849. 280.72 s [vector] head: OK
  6850. 280.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6851. 280.73 s [vector] last: OK
  6852. 280.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6853. 280.73 s [vector] unsafeIndex: OK
  6854. 280.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6855. 280.73 s [vector] unsafeHead: OK
  6856. 280.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6857. 280.73 s [vector] unsafeLast: OK
  6858. 280.73 s [vector] +++ OK, passed 100 tests; 27 discarded.
  6859. 280.73 s [vector] slice: OK
  6860. 280.73 s [vector] +++ OK, passed 100 tests.
  6861. 280.73 s [vector] init: OK
  6862. 280.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6863. 280.73 s [vector] tail: OK
  6864. 280.73 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6865. 280.73 s [vector] take: OK
  6866. 280.73 s [vector] +++ OK, passed 100 tests.
  6867. 280.73 s [vector] drop: OK
  6868. 280.74 s [vector] +++ OK, passed 100 tests.
  6869. 280.74 s [vector] splitAt: OK
  6870. 280.74 s [vector] +++ OK, passed 100 tests.
  6871. 280.74 s [vector] empty: OK
  6872. 280.74 s [vector] +++ OK, passed 1 test.
  6873. 280.74 s [vector] singleton: OK
  6874. 280.74 s [vector] +++ OK, passed 100 tests.
  6875. 280.74 s [vector] replicate: OK
  6876. 280.74 s [vector] +++ OK, passed 100 tests.
  6877. 280.75 s [vector] generate: OK
  6878. 280.75 s [vector] +++ OK, passed 100 tests.
  6879. 280.75 s [vector] iterateN: OK
  6880. 280.75 s [vector] +++ OK, passed 100 tests.
  6881. 280.79 s [vector] iterateNM: OK (0.03s)
  6882. 280.79 s [vector] +++ OK, passed 100 tests.
  6883. 280.81 s [vector] generateM: OK (0.02s)
  6884. 280.81 s [vector] +++ OK, passed 100 tests.
  6885. 280.81 s [vector] replicateM: OK (0.01s)
  6886. 280.81 s [vector] +++ OK, passed 100 tests.
  6887. 280.81 s [vector] create: OK
  6888. 280.81 s [vector] +++ OK, passed 100 tests.
  6889. 280.81 s [vector] createT: OK
  6890. 280.81 s [vector] +++ OK, passed 100 tests.
  6891. 280.81 s [vector] unfoldr: OK
  6892. 280.81 s [vector] +++ OK, passed 100 tests.
  6893. 280.82 s [vector] unfoldrN: OK
  6894. 280.83 s [vector] +++ OK, passed 100 tests.
  6895. 280.83 s [vector] unfoldrExactN: OK
  6896. 280.83 s [vector] +++ OK, passed 100 tests.
  6897. 280.84 s [vector] unfoldrM: OK
  6898. 280.84 s [vector] +++ OK, passed 100 tests.
  6899. 280.84 s [vector] unfoldrNM: OK
  6900. 280.84 s [vector] +++ OK, passed 100 tests.
  6901. 280.88 s [vector] unfoldrExactNM: OK (0.05s)
  6902. 280.88 s [vector] +++ OK, passed 100 tests.
  6903. 280.88 s [vector] constructN: OK
  6904. 280.88 s [vector] +++ OK, passed 100 tests.
  6905. 280.88 s [vector] constructrN: OK
  6906. 280.88 s [vector] +++ OK, passed 100 tests.
  6907. 280.88 s [vector] cons: OK
  6908. 280.89 s [vector] +++ OK, passed 100 tests.
  6909. 280.89 s [vector] snoc: OK
  6910. 280.89 s [vector] +++ OK, passed 100 tests.
  6911. 280.89 s [vector] append: OK
  6912. 280.89 s [vector] +++ OK, passed 100 tests.
  6913. 280.93 s [vector] concat: OK (0.04s)
  6914. 280.93 s [vector] +++ OK, passed 100 tests.
  6915. 280.93 s [vector] force: OK
  6916. 280.93 s [vector] +++ OK, passed 100 tests.
  6917. 280.94 s [vector] upd: OK
  6918. 280.94 s [vector] +++ OK, passed 100 tests.
  6919. 280.95 s [vector] accum: OK
  6920. 280.95 s [vector] +++ OK, passed 100 tests.
  6921. 280.95 s [vector] reverse: OK
  6922. 280.95 s [vector] +++ OK, passed 100 tests.
  6923. 280.95 s [vector] backpermute: OK
  6924. 280.95 s [vector] +++ OK, passed 100 tests.
  6925. 280.96 s [vector] map: OK
  6926. 280.96 s [vector] +++ OK, passed 100 tests.
  6927. 280.97 s [vector] imap: OK
  6928. 280.97 s [vector] +++ OK, passed 100 tests.
  6929. 280.97 s [vector] concatMap: OK
  6930. 280.97 s [vector] +++ OK, passed 100 tests.
  6931. 280.97 s [vector] mapM: OK
  6932. 280.97 s [vector] +++ OK, passed 100 tests.
  6933. 281.00 s [vector] mapM_: OK (0.03s)
  6934. 281.00 s [vector] +++ OK, passed 100 tests.
  6935. 281.01 s [vector] forM: OK
  6936. 281.01 s [vector] +++ OK, passed 100 tests.
  6937. 281.04 s [vector] forM_: OK (0.04s)
  6938. 281.04 s [vector] +++ OK, passed 100 tests.
  6939. 281.05 s [vector] imapM: OK
  6940. 281.05 s [vector] +++ OK, passed 100 tests.
  6941. 281.08 s [vector] imapM_: OK (0.03s)
  6942. 281.08 s [vector] +++ OK, passed 100 tests.
  6943. 281.08 s [vector] zipWith: OK
  6944. 281.08 s [vector] +++ OK, passed 100 tests.
  6945. 281.08 s [vector] zipWith3: OK
  6946. 281.09 s [vector] +++ OK, passed 100 tests.
  6947. 281.10 s [vector] izipWith: OK
  6948. 281.10 s [vector] +++ OK, passed 100 tests.
  6949. 281.10 s [vector] izipWith3: OK
  6950. 281.10 s [vector] +++ OK, passed 100 tests.
  6951. 281.10 s [vector] izipWithM: OK
  6952. 281.10 s [vector] +++ OK, passed 100 tests.
  6953. 281.13 s [vector] izipWithM_: OK (0.02s)
  6954. 281.13 s [vector] +++ OK, passed 100 tests.
  6955. 281.13 s [vector] zipWithM: OK
  6956. 281.15 s [vector] +++ OK, passed 100 tests.
  6957. 281.16 s [vector] zipWithM_: OK (0.02s)
  6958. 281.16 s [vector] +++ OK, passed 100 tests.
  6959. 281.16 s [vector] filter: OK
  6960. 281.16 s [vector] +++ OK, passed 100 tests.
  6961. 281.16 s [vector] ifilter: OK
  6962. 281.17 s [vector] +++ OK, passed 100 tests.
  6963. 281.20 s [vector] filterM: OK (0.04s)
  6964. 281.21 s [vector] +++ OK, passed 100 tests.
  6965. 281.21 s [vector] uniq: OK
  6966. 281.21 s [vector] +++ OK, passed 100 tests.
  6967. 281.21 s [vector] mapMaybe: OK
  6968. 281.21 s [vector] +++ OK, passed 100 tests.
  6969. 281.21 s [vector] imapMaybe: OK
  6970. 281.21 s [vector] +++ OK, passed 100 tests.
  6971. 281.21 s [vector] takeWhile: OK
  6972. 281.22 s [vector] +++ OK, passed 100 tests.
  6973. 281.22 s [vector] dropWhile: OK
  6974. 281.22 s [vector] +++ OK, passed 100 tests.
  6975. 281.22 s [vector] partition: OK
  6976. 281.23 s [vector] +++ OK, passed 100 tests.
  6977. 281.23 s [vector] partitionWith: OK
  6978. 281.23 s [vector] +++ OK, passed 100 tests.
  6979. 281.23 s [vector] span: OK
  6980. 281.23 s [vector] +++ OK, passed 100 tests.
  6981. 281.24 s [vector] break: OK
  6982. 281.24 s [vector] +++ OK, passed 100 tests.
  6983. 281.24 s [vector] spanR: OK
  6984. 281.24 s [vector] +++ OK, passed 100 tests.
  6985. 281.24 s [vector] breakR: OK
  6986. 281.24 s [vector] +++ OK, passed 100 tests.
  6987. 281.24 s [vector] groupBy: OK
  6988. 281.24 s [vector] +++ OK, passed 100 tests.
  6989. 281.24 s [vector] elem: OK
  6990. 281.25 s [vector] +++ OK, passed 100 tests.
  6991. 281.25 s [vector] notElem: OK
  6992. 281.25 s [vector] +++ OK, passed 100 tests.
  6993. 281.25 s [vector] find: OK
  6994. 281.25 s [vector] +++ OK, passed 100 tests.
  6995. 281.25 s [vector] findIndex: OK
  6996. 281.25 s [vector] +++ OK, passed 100 tests.
  6997. 281.25 s [vector] findIndexR: OK
  6998. 281.25 s [vector] +++ OK, passed 100 tests.
  6999. 281.25 s [vector] findIndices: OK
  7000. 281.25 s [vector] +++ OK, passed 100 tests.
  7001. 281.25 s [vector] elemIndex: OK
  7002. 281.25 s [vector] +++ OK, passed 100 tests.
  7003. 281.26 s [vector] elemIndices: OK
  7004. 281.26 s [vector] +++ OK, passed 100 tests.
  7005. 281.27 s [vector] foldl: OK
  7006. 281.27 s [vector] +++ OK, passed 100 tests.
  7007. 281.27 s [vector] foldl1: OK
  7008. 281.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7009. 281.27 s [vector] foldl': OK
  7010. 281.27 s [vector] +++ OK, passed 100 tests.
  7011. 281.27 s [vector] foldl1': OK
  7012. 281.28 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7013. 281.28 s [vector] foldr: OK
  7014. 281.28 s [vector] +++ OK, passed 100 tests.
  7015. 281.28 s [vector] foldr1: OK
  7016. 281.28 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7017. 281.29 s [vector] foldr': OK
  7018. 281.29 s [vector] +++ OK, passed 100 tests.
  7019. 281.29 s [vector] foldr1': OK
  7020. 281.29 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7021. 281.30 s [vector] ifoldl: OK
  7022. 281.30 s [vector] +++ OK, passed 100 tests.
  7023. 281.31 s [vector] ifoldl': OK
  7024. 281.31 s [vector] +++ OK, passed 100 tests.
  7025. 281.31 s [vector] ifoldr: OK
  7026. 281.31 s [vector] +++ OK, passed 100 tests.
  7027. 281.32 s [vector] ifoldr': OK
  7028. 281.32 s [vector] +++ OK, passed 100 tests.
  7029. 281.32 s [vector] ifoldM: OK
  7030. 281.33 s [vector] +++ OK, passed 100 tests.
  7031. 281.33 s [vector] ifoldM': OK
  7032. 281.33 s [vector] +++ OK, passed 100 tests.
  7033. 281.37 s [vector] ifoldM_: OK (0.03s)
  7034. 281.37 s [vector] +++ OK, passed 100 tests.
  7035. 281.39 s [vector] ifoldM'_: OK (0.03s)
  7036. 281.39 s [vector] +++ OK, passed 100 tests.
  7037. 281.39 s [vector] all: OK
  7038. 281.39 s [vector] +++ OK, passed 100 tests.
  7039. 281.39 s [vector] any: OK
  7040. 281.40 s [vector] +++ OK, passed 100 tests.
  7041. 281.40 s [vector] prescanl: OK
  7042. 281.40 s [vector] +++ OK, passed 100 tests.
  7043. 281.40 s [vector] prescanl': OK
  7044. 281.41 s [vector] +++ OK, passed 100 tests.
  7045. 281.41 s [vector] postscanl: OK
  7046. 281.42 s [vector] +++ OK, passed 100 tests.
  7047. 281.43 s [vector] postscanl': OK
  7048. 281.43 s [vector] +++ OK, passed 100 tests.
  7049. 281.43 s [vector] scanl: OK
  7050. 281.43 s [vector] +++ OK, passed 100 tests.
  7051. 281.43 s [vector] scanl': OK
  7052. 281.43 s [vector] +++ OK, passed 100 tests.
  7053. 281.44 s [vector] scanl1: OK
  7054. 281.45 s [vector] +++ OK, passed 100 tests.
  7055. 281.45 s [vector] scanl1': OK
  7056. 281.45 s [vector] +++ OK, passed 100 tests.
  7057. 281.45 s [vector] iscanl: OK
  7058. 281.45 s [vector] +++ OK, passed 100 tests.
  7059. 281.46 s [vector] iscanl': OK
  7060. 281.46 s [vector] +++ OK, passed 100 tests.
  7061. 281.46 s [vector] prescanr: OK
  7062. 281.46 s [vector] +++ OK, passed 100 tests.
  7063. 281.47 s [vector] prescanr': OK
  7064. 281.47 s [vector] +++ OK, passed 100 tests.
  7065. 281.47 s [vector] postscanr: OK
  7066. 281.48 s [vector] +++ OK, passed 100 tests.
  7067. 281.48 s [vector] postscanr': OK
  7068. 281.48 s [vector] +++ OK, passed 100 tests.
  7069. 281.49 s [vector] scanr: OK
  7070. 281.49 s [vector] +++ OK, passed 100 tests.
  7071. 281.49 s [vector] scanr': OK
  7072. 281.49 s [vector] +++ OK, passed 100 tests.
  7073. 281.50 s [vector] scanr1: OK
  7074. 281.51 s [vector] +++ OK, passed 100 tests.
  7075. 281.51 s [vector] scanr1': OK
  7076. 281.51 s [vector] +++ OK, passed 100 tests.
  7077. 281.51 s [vector] iscanr: OK
  7078. 281.51 s [vector] +++ OK, passed 100 tests.
  7079. 281.51 s [vector] iscanr': OK
  7080. 281.52 s [vector] +++ OK, passed 100 tests.
  7081. 281.52 s [vector] mut_read: OK
  7082. 281.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7083. 281.52 s [vector] mut_write: OK
  7084. 281.52 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7085. 281.52 s [vector] mut_modify: OK
  7086. 281.52 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7087. 281.52 s [vector] mut_generate: OK
  7088. 281.52 s [vector] +++ OK, passed 100 tests.
  7089. 281.55 s [vector] mut_generateM: OK (0.02s)
  7090. 281.55 s [vector] +++ OK, passed 100 tests.
  7091. 281.59 s [vector] mut_mapM_: OK (0.02s)
  7092. 281.59 s [vector] +++ OK, passed 100 tests.
  7093. 281.61 s [vector] mut_imapM_: OK (0.03s)
  7094. 281.61 s [vector] +++ OK, passed 100 tests.
  7095. 281.63 s [vector] mut_forM_: OK (0.03s)
  7096. 281.63 s [vector] +++ OK, passed 100 tests.
  7097. 281.66 s [vector] mut_iforM_: OK (0.03s)
  7098. 281.67 s [vector] +++ OK, passed 100 tests.
  7099. 281.67 s [vector] mut_foldr: OK
  7100. 281.67 s [vector] +++ OK, passed 100 tests.
  7101. 281.67 s [vector] mut_foldr': OK
  7102. 281.67 s [vector] +++ OK, passed 100 tests.
  7103. 281.68 s [vector] mut_foldl: OK
  7104. 281.68 s [vector] +++ OK, passed 100 tests.
  7105. 281.68 s [vector] mut_foldl': OK
  7106. 281.68 s [vector] +++ OK, passed 100 tests.
  7107. 281.69 s [vector] mut_ifoldr: OK
  7108. 281.69 s [vector] +++ OK, passed 100 tests.
  7109. 281.69 s [vector] mut_ifoldr': OK
  7110. 281.69 s [vector] +++ OK, passed 100 tests.
  7111. 281.69 s [vector] mut_ifoldl: OK
  7112. 281.69 s [vector] +++ OK, passed 100 tests.
  7113. 281.70 s [vector] mut_ifoldl': OK
  7114. 281.70 s [vector] +++ OK, passed 100 tests.
  7115. 281.71 s [vector] mut_foldM: OK
  7116. 281.71 s [vector] +++ OK, passed 100 tests.
  7117. 281.71 s [vector] mut_foldM': OK
  7118. 281.71 s [vector] +++ OK, passed 100 tests.
  7119. 281.72 s [vector] mut_foldrM: OK
  7120. 281.72 s [vector] +++ OK, passed 100 tests.
  7121. 281.72 s [vector] mut_foldrM': OK
  7122. 281.73 s [vector] +++ OK, passed 100 tests.
  7123. 281.73 s [vector] mut_ifoldM: OK
  7124. 281.73 s [vector] +++ OK, passed 100 tests.
  7125. 281.73 s [vector] mut_ifoldM': OK
  7126. 281.73 s [vector] +++ OK, passed 100 tests.
  7127. 281.74 s [vector] mut_ifoldrM: OK
  7128. 281.75 s [vector] +++ OK, passed 100 tests.
  7129. 281.75 s [vector] mut_ifoldrM': OK
  7130. 281.75 s [vector] +++ OK, passed 100 tests.
  7131. 281.75 s [vector] compare: OK
  7132. 281.75 s [vector] +++ OK, passed 100 tests.
  7133. 281.75 s [vector] maximum: OK
  7134. 281.75 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7135. 281.76 s [vector] minimum: OK
  7136. 281.76 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7137. 281.76 s [vector] minIndex: OK
  7138. 281.76 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7139. 281.76 s [vector] maxIndex: OK
  7140. 281.76 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7141. 281.76 s [vector] maximumBy: OK
  7142. 281.76 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7143. 281.76 s [vector] minimumBy: OK
  7144. 281.76 s [vector] +++ OK, passed 100 tests; 10 discarded.
  7145. 281.77 s [vector] maximumOn: OK
  7146. 281.77 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7147. 281.77 s [vector] minimumOn: OK
  7148. 281.77 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7149. 281.77 s [vector] maxIndexBy: OK
  7150. 281.77 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7151. 281.77 s [vector] minIndexBy: OK
  7152. 281.77 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7153. 281.77 s [vector] ListFirstMaxIndexWins: OK
  7154. 281.77 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7155. 281.78 s [vector] FalseListFirstMaxIndexWins: OK
  7156. 281.78 s [vector] +++ OK, failed as expected. (after 1 test):
  7157. 281.78 s [vector] Exception:
  7158. 281.78 s [vector] Prelude.foldr1: empty list
  7159. 281.78 s [vector] CallStack (from HasCallStack):
  7160. 281.78 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  7161. 281.78 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  7162. 281.78 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7163. 281.78 s [vector] []
  7164. 281.78 s [vector] zip: OK
  7165. 281.78 s [vector] +++ OK, passed 100 tests.
  7166. 281.79 s [vector] zip3: OK
  7167. 281.79 s [vector] +++ OK, passed 100 tests.
  7168. 281.79 s [vector] unzip: OK
  7169. 281.79 s [vector] +++ OK, passed 100 tests.
  7170. 281.79 s [vector] unzip3: OK
  7171. 281.79 s [vector] +++ OK, passed 100 tests.
  7172. 281.80 s [vector] indexed: OK
  7173. 281.80 s [vector] +++ OK, passed 100 tests.
  7174. 281.80 s [vector] update: OK
  7175. 281.80 s [vector] +++ OK, passed 100 tests.
  7176. 281.80 s [vector] mempty: OK
  7177. 281.80 s [vector] +++ OK, passed 1 test.
  7178. 281.81 s [vector] mappend: OK
  7179. 281.81 s [vector] +++ OK, passed 100 tests.
  7180. 281.84 s [vector] mconcat: OK (0.03s)
  7181. 281.84 s [vector] +++ OK, passed 100 tests.
  7182. 281.84 s [vector] glength: OK
  7183. 281.84 s [vector] +++ OK, passed 100 tests.
  7184. 281.84 s [vector] (Int,Bool,Int)
  7185. 281.84 s [vector] fromList.toList == id: OK
  7186. 281.84 s [vector] +++ OK, passed 100 tests.
  7187. 281.84 s [vector] toList.fromList == id: OK
  7188. 281.84 s [vector] +++ OK, passed 100 tests.
  7189. 281.84 s [vector] unstream.stream == id: OK
  7190. 281.84 s [vector] +++ OK, passed 100 tests.
  7191. 281.85 s [vector] stream.unstream == id: OK
  7192. 281.85 s [vector] +++ OK, passed 100 tests.
  7193. 281.85 s [vector] eq: OK
  7194. 281.85 s [vector] +++ OK, passed 100 tests.
  7195. 281.85 s [vector] length: OK
  7196. 281.85 s [vector] +++ OK, passed 100 tests.
  7197. 281.85 s [vector] null: OK
  7198. 281.85 s [vector] +++ OK, passed 100 tests.
  7199. 281.85 s [vector] index: OK
  7200. 281.85 s [vector] +++ OK, passed 100 tests; 23 discarded.
  7201. 281.85 s [vector] safeIndex: OK
  7202. 281.85 s [vector] +++ OK, passed 100 tests.
  7203. 281.85 s [vector] head: OK
  7204. 281.85 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7205. 281.85 s [vector] last: OK
  7206. 281.85 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7207. 281.85 s [vector] unsafeIndex: OK
  7208. 281.85 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7209. 281.85 s [vector] unsafeHead: OK
  7210. 281.85 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7211. 281.86 s [vector] unsafeLast: OK
  7212. 281.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7213. 281.86 s [vector] slice: OK
  7214. 281.86 s [vector] +++ OK, passed 100 tests.
  7215. 281.86 s [vector] init: OK
  7216. 281.86 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7217. 281.86 s [vector] tail: OK
  7218. 281.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7219. 281.86 s [vector] take: OK
  7220. 281.86 s [vector] +++ OK, passed 100 tests.
  7221. 281.86 s [vector] drop: OK
  7222. 281.86 s [vector] +++ OK, passed 100 tests.
  7223. 281.87 s [vector] splitAt: OK
  7224. 281.87 s [vector] +++ OK, passed 100 tests.
  7225. 281.87 s [vector] empty: OK
  7226. 281.87 s [vector] +++ OK, passed 1 test.
  7227. 281.87 s [vector] singleton: OK
  7228. 281.87 s [vector] +++ OK, passed 100 tests.
  7229. 281.87 s [vector] replicate: OK
  7230. 281.87 s [vector] +++ OK, passed 100 tests.
  7231. 281.87 s [vector] generate: OK
  7232. 281.87 s [vector] +++ OK, passed 100 tests.
  7233. 281.89 s [vector] iterateN: OK
  7234. 281.89 s [vector] +++ OK, passed 100 tests.
  7235. 281.89 s [vector] iterateNM: OK (0.02s)
  7236. 281.89 s [vector] +++ OK, passed 100 tests.
  7237. 281.95 s [vector] generateM: OK (0.04s)
  7238. 281.95 s [vector] +++ OK, passed 100 tests.
  7239. 281.95 s [vector] replicateM: OK (0.01s)
  7240. 281.95 s [vector] +++ OK, passed 100 tests.
  7241. 281.95 s [vector] create: OK
  7242. 281.95 s [vector] +++ OK, passed 100 tests.
  7243. 281.95 s [vector] createT: OK
  7244. 281.95 s [vector] +++ OK, passed 100 tests.
  7245. 281.95 s [vector] unfoldr: OK
  7246. 281.95 s [vector] +++ OK, passed 100 tests.
  7247. 281.95 s [vector] unfoldrN: OK
  7248. 281.95 s [vector] +++ OK, passed 100 tests.
  7249. 281.95 s [vector] unfoldrExactN: OK
  7250. 281.96 s [vector] +++ OK, passed 100 tests.
  7251. 281.96 s [vector] unfoldrM: OK
  7252. 281.96 s [vector] +++ OK, passed 100 tests.
  7253. 281.96 s [vector] unfoldrNM: OK
  7254. 281.96 s [vector] +++ OK, passed 100 tests.
  7255. 282.01 s [vector] unfoldrExactNM: OK (0.04s)
  7256. 282.01 s [vector] +++ OK, passed 100 tests.
  7257. 282.03 s [vector] constructN: OK (0.01s)
  7258. 282.03 s [vector] +++ OK, passed 100 tests.
  7259. 282.03 s [vector] constructrN: OK (0.01s)
  7260. 282.03 s [vector] +++ OK, passed 100 tests.
  7261. 282.03 s [vector] cons: OK
  7262. 282.04 s [vector] +++ OK, passed 100 tests.
  7263. 282.05 s [vector] snoc: OK
  7264. 282.43 s [vector] +++ OK, passed 100 tests.
  7265. 282.43 s [vector] append: OK
  7266. 282.43 s [vector] +++ OK, passed 100 tests.
  7267. 282.43 s [vector] concat: OK (0.08s)
  7268. 282.43 s [vector] +++ OK, passed 100 tests.
  7269. 282.43 s [vector] force: OK
  7270. 282.43 s [vector] +++ OK, passed 100 tests.
  7271. 282.43 s [vector] upd: OK
  7272. 282.43 s [vector] +++ OK, passed 100 tests.
  7273. 282.43 s [vector] accum: OK (0.02s)
  7274. 282.43 s [vector] +++ OK, passed 100 tests.
  7275. 282.43 s [vector] reverse: OK
  7276. 282.43 s [vector] +++ OK, passed 100 tests.
  7277. 282.43 s [vector] backpermute: OK
  7278. 282.43 s [vector] +++ OK, passed 100 tests.
  7279. 282.43 s [vector] map: OK (0.01s)
  7280. 282.43 s [vector] +++ OK, passed 100 tests.
  7281. 282.43 s [vector] imap: OK (0.01s)
  7282. 282.43 s [vector] +++ OK, passed 100 tests.
  7283. 282.43 s [vector] concatMap: OK (0.01s)
  7284. 282.43 s [vector] +++ OK, passed 100 tests.
  7285. 282.43 s [vector] mapM: OK
  7286. 282.43 s [vector] +++ OK, passed 100 tests.
  7287. 282.43 s [vector] mapM_: OK (0.06s)
  7288. 282.43 s [vector] +++ OK, passed 100 tests.
  7289. 282.43 s [vector] forM: OK (0.01s)
  7290. 282.43 s [vector] +++ OK, passed 100 tests.
  7291. 282.43 s [vector] forM_: OK (0.05s)
  7292. 282.43 s [vector] +++ OK, passed 100 tests.
  7293. 282.43 s [vector] imapM: OK (0.01s)
  7294. 282.43 s [vector] +++ OK, passed 100 tests.
  7295. 282.43 s [vector] imapM_: OK (0.05s)
  7296. 282.43 s [vector] +++ OK, passed 100 tests.
  7297. 282.43 s [vector] zipWith: OK
  7298. 282.43 s [vector] +++ OK, passed 100 tests.
  7299. 282.43 s [vector] zipWith3: OK
  7300. 282.43 s [vector] +++ OK, passed 100 tests.
  7301. 282.43 s [vector] izipWith: OK
  7302. 282.43 s [vector] +++ OK, passed 100 tests.
  7303. 282.44 s [vector] izipWith3: OK
  7304. 282.45 s [vector] +++ OK, passed 100 tests.
  7305. 282.47 s [vector] izipWithM: OK (0.01s)
  7306. 282.47 s [vector] +++ OK, passed 100 tests.
  7307. 282.49 s [vector] izipWithM_: OK (0.04s)
  7308. 282.49 s [vector] +++ OK, passed 100 tests.
  7309. 282.52 s [vector] zipWithM: OK
  7310. 282.52 s [vector] +++ OK, passed 100 tests.
  7311. 282.54 s [vector] zipWithM_: OK (0.04s)
  7312. 282.54 s [vector] +++ OK, passed 100 tests.
  7313. 282.54 s [vector] filter: OK
  7314. 282.55 s [vector] +++ OK, passed 100 tests.
  7315. 282.57 s [vector] ifilter: OK
  7316. 282.57 s [vector] +++ OK, passed 100 tests.
  7317. 282.62 s [vector] filterM: OK (0.06s)
  7318. 282.62 s [vector] +++ OK, passed 100 tests.
  7319. 282.62 s [vector] uniq: OK
  7320. 282.62 s [vector] +++ OK, passed 100 tests.
  7321. 282.63 s [vector] mapMaybe: OK
  7322. 282.63 s [vector] +++ OK, passed 100 tests.
  7323. 282.63 s [vector] imapMaybe: OK
  7324. 282.63 s [vector] +++ OK, passed 100 tests.
  7325. 282.63 s [vector] takeWhile: OK
  7326. 282.63 s [vector] +++ OK, passed 100 tests.
  7327. 282.63 s [vector] dropWhile: OK
  7328. 282.63 s [vector] +++ OK, passed 100 tests.
  7329. 282.65 s [vector] partition: OK (0.01s)
  7330. 282.65 s [vector] +++ OK, passed 100 tests.
  7331. 282.65 s [vector] partitionWith: OK
  7332. 282.65 s [vector] +++ OK, passed 100 tests.
  7333. 282.65 s [vector] span: OK
  7334. 282.65 s [vector] +++ OK, passed 100 tests.
  7335. 282.66 s [vector] break: OK
  7336. 282.66 s [vector] +++ OK, passed 100 tests.
  7337. 282.66 s [vector] spanR: OK
  7338. 282.66 s [vector] +++ OK, passed 100 tests.
  7339. 282.67 s [vector] breakR: OK
  7340. 282.67 s [vector] +++ OK, passed 100 tests.
  7341. 282.67 s [vector] groupBy: OK
  7342. 282.67 s [vector] +++ OK, passed 100 tests.
  7343. 282.67 s [vector] elem: OK
  7344. 282.67 s [vector] +++ OK, passed 100 tests.
  7345. 282.68 s [vector] notElem: OK
  7346. 282.68 s [vector] +++ OK, passed 100 tests.
  7347. 282.68 s [vector] find: OK
  7348. 282.68 s [vector] +++ OK, passed 100 tests.
  7349. 282.69 s [vector] findIndex: OK
  7350. 282.69 s [vector] +++ OK, passed 100 tests.
  7351. 282.69 s [vector] findIndexR: OK
  7352. 282.69 s [vector] +++ OK, passed 100 tests.
  7353. 282.70 s [vector] findIndices: OK (0.01s)
  7354. 282.70 s [vector] +++ OK, passed 100 tests.
  7355. 282.71 s [vector] elemIndex: OK
  7356. 282.71 s [vector] +++ OK, passed 100 tests.
  7357. 282.71 s [vector] elemIndices: OK
  7358. 282.71 s [vector] +++ OK, passed 100 tests.
  7359. 282.72 s [vector] foldl: OK
  7360. 282.73 s [vector] +++ OK, passed 100 tests.
  7361. 282.73 s [vector] foldl1: OK
  7362. 282.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7363. 282.73 s [vector] foldl': OK
  7364. 282.73 s [vector] +++ OK, passed 100 tests.
  7365. 282.74 s [vector] foldl1': OK
  7366. 282.74 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7367. 282.75 s [vector] foldr: OK
  7368. 282.75 s [vector] +++ OK, passed 100 tests.
  7369. 282.75 s [vector] foldr1: OK
  7370. 282.75 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7371. 282.76 s [vector] foldr': OK
  7372. 282.77 s [vector] +++ OK, passed 100 tests.
  7373. 282.77 s [vector] foldr1': OK
  7374. 282.77 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7375. 282.77 s [vector] ifoldl: OK
  7376. 282.77 s [vector] +++ OK, passed 100 tests.
  7377. 282.79 s [vector] ifoldl': OK (0.01s)
  7378. 282.79 s [vector] +++ OK, passed 100 tests.
  7379. 282.79 s [vector] ifoldr: OK
  7380. 282.80 s [vector] +++ OK, passed 100 tests.
  7381. 282.81 s [vector] ifoldr': OK
  7382. 282.81 s [vector] +++ OK, passed 100 tests.
  7383. 282.81 s [vector] ifoldM: OK
  7384. 282.81 s [vector] +++ OK, passed 100 tests.
  7385. 282.81 s [vector] ifoldM': OK
  7386. 282.83 s [vector] +++ OK, passed 100 tests.
  7387. 282.87 s [vector] ifoldM_: OK (0.04s)
  7388. 282.87 s [vector] +++ OK, passed 100 tests.
  7389. 282.90 s [vector] ifoldM'_: OK (0.05s)
  7390. 282.91 s [vector] +++ OK, passed 100 tests.
  7391. 282.91 s [vector] all: OK
  7392. 282.91 s [vector] +++ OK, passed 100 tests.
  7393. 282.91 s [vector] any: OK
  7394. 282.91 s [vector] +++ OK, passed 100 tests.
  7395. 282.91 s [vector] prescanl: OK
  7396. 282.91 s [vector] +++ OK, passed 100 tests.
  7397. 282.92 s [vector] prescanl': OK
  7398. 282.92 s [vector] +++ OK, passed 100 tests.
  7399. 282.93 s [vector] postscanl: OK
  7400. 282.93 s [vector] +++ OK, passed 100 tests.
  7401. 282.94 s [vector] postscanl': OK
  7402. 282.94 s [vector] +++ OK, passed 100 tests.
  7403. 282.95 s [vector] scanl: OK
  7404. 282.95 s [vector] +++ OK, passed 100 tests.
  7405. 282.96 s [vector] scanl': OK
  7406. 282.96 s [vector] +++ OK, passed 100 tests.
  7407. 282.97 s [vector] scanl1: OK
  7408. 282.97 s [vector] +++ OK, passed 100 tests.
  7409. 282.98 s [vector] scanl1': OK
  7410. 282.98 s [vector] +++ OK, passed 100 tests.
  7411. 282.99 s [vector] iscanl: OK
  7412. 282.99 s [vector] +++ OK, passed 100 tests.
  7413. 283.00 s [vector] iscanl': OK (0.01s)
  7414. 283.01 s [vector] +++ OK, passed 100 tests.
  7415. 283.01 s [vector] prescanr: OK
  7416. 283.01 s [vector] +++ OK, passed 100 tests.
  7417. 283.01 s [vector] prescanr': OK
  7418. 283.01 s [vector] +++ OK, passed 100 tests.
  7419. 283.02 s [vector] postscanr: OK
  7420. 283.03 s [vector] +++ OK, passed 100 tests.
  7421. 283.03 s [vector] postscanr': OK
  7422. 283.04 s [vector] +++ OK, passed 100 tests.
  7423. 283.05 s [vector] scanr: OK
  7424. 283.05 s [vector] +++ OK, passed 100 tests.
  7425. 283.05 s [vector] scanr': OK
  7426. 283.05 s [vector] +++ OK, passed 100 tests.
  7427. 283.05 s [vector] scanr1: OK
  7428. 283.05 s [vector] +++ OK, passed 100 tests.
  7429. 283.05 s [vector] scanr1': OK
  7430. 283.05 s [vector] +++ OK, passed 100 tests.
  7431. 283.07 s [vector] iscanr: OK
  7432. 283.07 s [vector] +++ OK, passed 100 tests.
  7433. 283.07 s [vector] iscanr': OK
  7434. 283.07 s [vector] +++ OK, passed 100 tests.
  7435. 283.07 s [vector] mut_read: OK
  7436. 283.07 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7437. 283.07 s [vector] mut_write: OK
  7438. 283.07 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7439. 283.08 s [vector] mut_modify: OK
  7440. 283.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7441. 283.08 s [vector] mut_generate: OK
  7442. 283.09 s [vector] +++ OK, passed 100 tests.
  7443. 283.11 s [vector] mut_generateM: OK (0.02s)
  7444. 283.11 s [vector] +++ OK, passed 100 tests.
  7445. 283.15 s [vector] mut_mapM_: OK (0.04s)
  7446. 283.15 s [vector] +++ OK, passed 100 tests.
  7447. 283.19 s [vector] mut_imapM_: OK (0.04s)
  7448. 283.19 s [vector] +++ OK, passed 100 tests.
  7449. 283.21 s [vector] mut_forM_: OK (0.04s)
  7450. 283.21 s [vector] +++ OK, passed 100 tests.
  7451. 283.25 s [vector] mut_iforM_: OK (0.04s)
  7452. 283.25 s [vector] +++ OK, passed 100 tests.
  7453. 283.25 s [vector] mut_foldr: OK
  7454. 283.26 s [vector] +++ OK, passed 100 tests.
  7455. 283.27 s [vector] mut_foldr': OK
  7456. 283.27 s [vector] +++ OK, passed 100 tests.
  7457. 283.27 s [vector] mut_foldl: OK
  7458. 283.27 s [vector] +++ OK, passed 100 tests.
  7459. 283.28 s [vector] mut_foldl': OK
  7460. 283.29 s [vector] +++ OK, passed 100 tests.
  7461. 283.29 s [vector] mut_ifoldr: OK
  7462. 283.29 s [vector] +++ OK, passed 100 tests.
  7463. 283.29 s [vector] mut_ifoldr': OK
  7464. 283.30 s [vector] +++ OK, passed 100 tests.
  7465. 283.30 s [vector] mut_ifoldl: OK
  7466. 283.30 s [vector] +++ OK, passed 100 tests.
  7467. 283.31 s [vector] mut_ifoldl': OK
  7468. 283.31 s [vector] +++ OK, passed 100 tests.
  7469. 283.32 s [vector] mut_foldM: OK
  7470. 283.33 s [vector] +++ OK, passed 100 tests.
  7471. 283.33 s [vector] mut_foldM': OK
  7472. 283.33 s [vector] +++ OK, passed 100 tests.
  7473. 283.33 s [vector] mut_foldrM: OK
  7474. 283.33 s [vector] +++ OK, passed 100 tests.
  7475. 283.34 s [vector] mut_foldrM': OK
  7476. 283.35 s [vector] +++ OK, passed 100 tests.
  7477. 283.36 s [vector] mut_ifoldM: OK
  7478. 283.37 s [vector] +++ OK, passed 100 tests.
  7479. 283.37 s [vector] mut_ifoldM': OK
  7480. 283.37 s [vector] +++ OK, passed 100 tests.
  7481. 283.37 s [vector] mut_ifoldrM: OK
  7482. 283.37 s [vector] +++ OK, passed 100 tests.
  7483. 283.37 s [vector] mut_ifoldrM': OK
  7484. 283.37 s [vector] +++ OK, passed 100 tests.
  7485. 283.37 s [vector] compare: OK
  7486. 283.37 s [vector] +++ OK, passed 100 tests.
  7487. 283.37 s [vector] maximum: OK
  7488. 283.38 s [vector] +++ OK, passed 100 tests; 24 discarded.
  7489. 283.38 s [vector] minimum: OK
  7490. 283.38 s [vector] +++ OK, passed 100 tests; 24 discarded.
  7491. 283.39 s [vector] minIndex: OK
  7492. 283.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7493. 283.39 s [vector] maxIndex: OK
  7494. 283.39 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7495. 283.39 s [vector] maximumBy: OK
  7496. 283.39 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7497. 283.39 s [vector] minimumBy: OK
  7498. 283.39 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7499. 283.39 s [vector] maximumOn: OK
  7500. 283.39 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7501. 283.39 s [vector] minimumOn: OK
  7502. 283.39 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7503. 283.40 s [vector] maxIndexBy: OK
  7504. 283.40 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7505. 283.40 s [vector] minIndexBy: OK
  7506. 283.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7507. 283.40 s [vector] ListFirstMaxIndexWins: OK
  7508. 283.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7509. 283.40 s [vector] FalseListFirstMaxIndexWins: OK
  7510. 283.40 s [vector] +++ OK, failed as expected. (after 1 test):
  7511. 283.40 s [vector] Exception:
  7512. 283.41 s [vector] Prelude.foldr1: empty list
  7513. 283.41 s [vector] CallStack (from HasCallStack):
  7514. 283.41 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  7515. 283.41 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  7516. 283.41 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  7517. 283.41 s [vector] []
  7518. 283.41 s [vector] zip: OK
  7519. 283.41 s [vector] +++ OK, passed 100 tests.
  7520. 283.41 s [vector] zip3: OK
  7521. 283.41 s [vector] +++ OK, passed 100 tests.
  7522. 283.41 s [vector] unzip: OK
  7523. 283.41 s [vector] +++ OK, passed 100 tests.
  7524. 283.43 s [vector] unzip3: OK (0.02s)
  7525. 283.44 s [vector] +++ OK, passed 100 tests.
  7526. 283.44 s [vector] indexed: OK
  7527. 283.44 s [vector] +++ OK, passed 100 tests.
  7528. 283.44 s [vector] update: OK
  7529. 283.44 s [vector] +++ OK, passed 100 tests.
  7530. 283.44 s [vector] mempty: OK
  7531. 283.44 s [vector] +++ OK, passed 1 test.
  7532. 283.45 s [vector] mappend: OK
  7533. 283.45 s [vector] +++ OK, passed 100 tests.
  7534. 283.50 s [vector] mconcat: OK (0.06s)
  7535. 283.50 s [vector] +++ OK, passed 100 tests.
  7536. 283.50 s [vector] glength: OK
  7537. 283.50 s [vector] +++ OK, passed 100 tests.
  7538. 283.50 s [vector] unstream
  7539. 283.50 s [vector] unstream == vunstream (exact): OK
  7540. 283.50 s [vector] +++ OK, passed 100 tests.
  7541. 283.50 s [vector] unstream == vunstream (unknown): OK
  7542. 283.50 s [vector] +++ OK, passed 100 tests.
  7543. 283.51 s [vector] unstreamR ~= vunstream (exact): OK
  7544. 283.51 s [vector] +++ OK, passed 100 tests.
  7545. 283.51 s [vector] unstreamR ~= vunstream (unknown): OK
  7546. 283.51 s [vector] +++ OK, passed 100 tests.
  7547. 283.51 s [vector] Data.Vector.Storable.Vector Alignment
  7548. 283.51 s [vector] Aligned Double: OK
  7549. 283.51 s [vector] Aligned Int: OK
  7550. 283.51 s [vector] Regression tests
  7551. 283.51 s [vector] enumFromTo crash #188
  7552. 283.51 s [vector] Word8: OK
  7553. 283.51 s [vector] Word16: OK
  7554. 283.51 s [vector] Word32: OK
  7555. 283.51 s [vector] Word64: OK
  7556. 283.51 s [vector] Word: OK
  7557. 283.51 s [vector] Int8: OK
  7558. 283.51 s [vector] Int16: OK
  7559. 283.51 s [vector] Int32: OK
  7560. 283.51 s [vector] Int64: OK
  7561. 283.51 s [vector] Int: OK
  7562. 283.51 s [vector] Char: OK
  7563. 283.51 s [vector] Negative tests
  7564. 283.51 s [vector] slice out of bounds #257
  7565. 283.51 s [vector] Boxed
  7566. 283.51 s [vector] Negative ix: OK
  7567. 283.51 s [vector] Negative size: OK
  7568. 283.51 s [vector] Negative ix and size: OK
  7569. 283.51 s [vector] Too large ix: OK
  7570. 283.51 s [vector] Too large size: OK
  7571. 283.51 s [vector] Too large ix and size: OK
  7572. 283.51 s [vector] Overflow: OK
  7573. 283.51 s [vector] OutOfMemory: OK
  7574. 283.51 s [vector] Primitive
  7575. 283.51 s [vector] Negative ix: OK
  7576. 283.51 s [vector] Negative size: OK
  7577. 283.51 s [vector] Negative ix and size: OK
  7578. 283.51 s [vector] Too large ix: OK
  7579. 283.51 s [vector] Too large size: OK
  7580. 283.51 s [vector] Too large ix and size: OK
  7581. 283.51 s [vector] Overflow: OK
  7582. 283.51 s [vector] OutOfMemory: OK
  7583. 283.51 s [vector] Storable
  7584. 283.51 s [vector] Negative ix: OK
  7585. 283.51 s [vector] Negative size: OK
  7586. 283.51 s [vector] Negative ix and size: OK
  7587. 283.51 s [vector] Too large ix: OK
  7588. 283.51 s [vector] Too large size: OK
  7589. 283.51 s [vector] Too large ix and size: OK
  7590. 283.51 s [vector] Overflow: OK
  7591. 283.51 s [vector] OutOfMemory: OK
  7592. 283.51 s [vector] Unboxed
  7593. 283.51 s [vector] Negative ix: OK
  7594. 283.51 s [vector] Negative size: OK
  7595. 283.51 s [vector] Negative ix and size: OK
  7596. 283.51 s [vector] Too large ix: OK
  7597. 283.51 s [vector] Too large size: OK
  7598. 283.51 s [vector] Too large ix and size: OK
  7599. 283.51 s [vector] Overflow: OK
  7600. 283.51 s [vector] OutOfMemory: OK
  7601. 283.51 s [vector] take #282
  7602. 283.51 s [vector] Boxed: OK
  7603. 283.51 s [vector] Primitive: OK
  7604. 283.51 s [vector] Storable: OK
  7605. 283.51 s [vector] Unboxed: OK
  7606. 283.51 s [vector] Data.Vector
  7607. 283.51 s [vector] MonadFix: OK
  7608. 283.51 s [vector] toFromArray: OK
  7609. 283.51 s [vector] toFromArraySlice: OK
  7610. 283.51 s [vector] toFromArraySliceUnsafe: OK
  7611. 283.51 s [vector] toFromMutableArray: OK
  7612. 283.51 s [vector] Data.Vector.Mutable (Move): OK
  7613. 283.51 s [vector] +++ OK, passed 100 tests; 23 discarded.
  7614. 283.51 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  7615. 283.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7616. 283.51 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  7617. 283.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7618. 283.51 s [vector] Data.Vector.Storable.Mutable (Move): OK
  7619. 283.52 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7620. 283.53 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  7621. 283.53 s [vector] +++ OK, passed 1 test.
  7622. 283.53 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK
  7623. 283.53 s [vector] +++ OK, passed 1 test.
  7624. 283.53 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  7625. 283.53 s [vector] +++ OK, passed 100 tests.
  7626. 283.53 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  7627. 283.53 s [vector] +++ OK, passed 100 tests.
  7628. 283.53 s [vector]
  7629. 283.53 s [vector] All 2808 tests passed (14.74s)
  7630. 283.54 s [vector] Test suite vector-tests-O0: PASS
  7631. 283.54 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  7632. 283.54 s [vector] Test suite vector-tests-O2: RUNNING...
  7633. 283.69 s [vector] toplevel
  7634. 283.69 s [vector] Data.Vector.Fusion.Bundle
  7635. 283.69 s [vector] fromList.toList == id: OK
  7636. 283.69 s [vector] +++ OK, passed 100 tests.
  7637. 283.69 s [vector] toList.fromList == id: OK
  7638. 283.69 s [vector] +++ OK, passed 100 tests.
  7639. 283.69 s [vector] eq: OK
  7640. 283.69 s [vector] +++ OK, passed 100 tests.
  7641. 283.69 s [vector] length: OK
  7642. 283.69 s [vector] +++ OK, passed 100 tests.
  7643. 283.69 s [vector] null: OK
  7644. 283.69 s [vector] +++ OK, passed 100 tests.
  7645. 283.69 s [vector] empty: OK
  7646. 283.69 s [vector] +++ OK, passed 1 test.
  7647. 283.70 s [vector] singleton: OK
  7648. 283.70 s [vector] +++ OK, passed 100 tests.
  7649. 283.70 s [vector] replicate: OK
  7650. 283.70 s [vector] +++ OK, passed 100 tests.
  7651. 283.70 s [vector] cons: OK
  7652. 283.70 s [vector] +++ OK, passed 100 tests.
  7653. 283.70 s [vector] snoc: OK
  7654. 283.70 s [vector] +++ OK, passed 100 tests.
  7655. 283.70 s [vector] append: OK
  7656. 283.70 s [vector] +++ OK, passed 100 tests.
  7657. 283.70 s [vector] head: OK
  7658. 283.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7659. 283.70 s [vector] last: OK
  7660. 283.70 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7661. 283.70 s [vector] index: OK
  7662. 283.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7663. 283.70 s [vector] extract: OK
  7664. 283.70 s [vector] +++ OK, passed 100 tests.
  7665. 283.70 s [vector] init: OK
  7666. 283.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7667. 283.70 s [vector] tail: OK
  7668. 283.70 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7669. 283.70 s [vector] take: OK
  7670. 283.70 s [vector] +++ OK, passed 100 tests.
  7671. 283.70 s [vector] drop: OK
  7672. 283.71 s [vector] +++ OK, passed 100 tests.
  7673. 283.71 s [vector] map: OK
  7674. 283.71 s [vector] +++ OK, passed 100 tests.
  7675. 283.71 s [vector] zipWith: OK
  7676. 283.71 s [vector] +++ OK, passed 100 tests.
  7677. 283.71 s [vector] zipWith3: OK
  7678. 283.71 s [vector] +++ OK, passed 100 tests.
  7679. 283.71 s [vector] filter: OK
  7680. 283.71 s [vector] +++ OK, passed 100 tests.
  7681. 283.71 s [vector] takeWhile: OK
  7682. 283.71 s [vector] +++ OK, passed 100 tests.
  7683. 283.71 s [vector] dropWhile: OK
  7684. 283.71 s [vector] +++ OK, passed 100 tests.
  7685. 283.71 s [vector] elem: OK
  7686. 283.71 s [vector] +++ OK, passed 100 tests.
  7687. 283.71 s [vector] notElem: OK
  7688. 283.71 s [vector] +++ OK, passed 100 tests.
  7689. 283.72 s [vector] find: OK
  7690. 283.72 s [vector] +++ OK, passed 100 tests.
  7691. 283.72 s [vector] findIndex: OK
  7692. 283.72 s [vector] +++ OK, passed 100 tests.
  7693. 283.72 s [vector] foldl: OK
  7694. 283.72 s [vector] +++ OK, passed 100 tests.
  7695. 283.72 s [vector] foldl1: OK
  7696. 283.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7697. 283.72 s [vector] foldl': OK
  7698. 283.72 s [vector] +++ OK, passed 100 tests.
  7699. 283.72 s [vector] foldl1': OK
  7700. 283.73 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7701. 283.73 s [vector] foldr: OK
  7702. 283.73 s [vector] +++ OK, passed 100 tests.
  7703. 283.73 s [vector] foldr1: OK
  7704. 283.73 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7705. 283.73 s [vector] prescanl: OK
  7706. 283.73 s [vector] +++ OK, passed 100 tests.
  7707. 283.73 s [vector] prescanl': OK
  7708. 283.73 s [vector] +++ OK, passed 100 tests.
  7709. 283.73 s [vector] postscanl: OK
  7710. 283.73 s [vector] +++ OK, passed 100 tests.
  7711. 283.73 s [vector] postscanl': OK
  7712. 283.73 s [vector] +++ OK, passed 100 tests.
  7713. 283.73 s [vector] scanl: OK
  7714. 283.73 s [vector] +++ OK, passed 100 tests.
  7715. 283.73 s [vector] scanl': OK
  7716. 283.73 s [vector] +++ OK, passed 100 tests.
  7717. 283.73 s [vector] scanl1: OK
  7718. 283.74 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7719. 283.74 s [vector] scanl1': OK
  7720. 283.74 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7721. 283.74 s [vector] concatMap: OK
  7722. 283.74 s [vector] +++ OK, passed 100 tests.
  7723. 283.74 s [vector] unfoldr: OK
  7724. 283.74 s [vector] +++ OK, passed 100 tests.
  7725. 283.74 s [vector] and: OK
  7726. 283.74 s [vector] +++ OK, passed 100 tests.
  7727. 283.74 s [vector] or: OK
  7728. 283.74 s [vector] +++ OK, passed 100 tests.
  7729. 283.74 s [vector] Tests.Vector.Boxed
  7730. 283.74 s [vector] Bool
  7731. 283.74 s [vector] fromList.toList == id: OK
  7732. 283.74 s [vector] +++ OK, passed 100 tests.
  7733. 283.74 s [vector] toList.fromList == id: OK
  7734. 283.74 s [vector] +++ OK, passed 100 tests.
  7735. 283.74 s [vector] unstream.stream == id: OK
  7736. 283.74 s [vector] +++ OK, passed 100 tests.
  7737. 283.74 s [vector] stream.unstream == id: OK
  7738. 283.74 s [vector] +++ OK, passed 100 tests.
  7739. 283.74 s [vector] eq: OK
  7740. 283.74 s [vector] +++ OK, passed 100 tests.
  7741. 283.74 s [vector] length: OK
  7742. 283.74 s [vector] +++ OK, passed 100 tests.
  7743. 283.74 s [vector] null: OK
  7744. 283.74 s [vector] +++ OK, passed 100 tests.
  7745. 283.74 s [vector] index: OK
  7746. 283.74 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7747. 283.74 s [vector] safeIndex: OK
  7748. 283.74 s [vector] +++ OK, passed 100 tests.
  7749. 283.74 s [vector] head: OK
  7750. 283.74 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7751. 283.74 s [vector] last: OK
  7752. 283.74 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7753. 283.74 s [vector] unsafeIndex: OK
  7754. 283.74 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7755. 283.74 s [vector] unsafeHead: OK
  7756. 283.74 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7757. 283.74 s [vector] unsafeLast: OK
  7758. 283.74 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7759. 283.74 s [vector] slice: OK
  7760. 283.74 s [vector] +++ OK, passed 100 tests.
  7761. 283.74 s [vector] init: OK
  7762. 283.74 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7763. 283.74 s [vector] tail: OK
  7764. 283.74 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7765. 283.74 s [vector] take: OK
  7766. 283.74 s [vector] +++ OK, passed 100 tests.
  7767. 283.74 s [vector] drop: OK
  7768. 283.74 s [vector] +++ OK, passed 100 tests.
  7769. 283.74 s [vector] splitAt: OK
  7770. 283.74 s [vector] +++ OK, passed 100 tests.
  7771. 283.75 s [vector] empty: OK
  7772. 283.75 s [vector] +++ OK, passed 1 test.
  7773. 283.75 s [vector] singleton: OK
  7774. 283.75 s [vector] +++ OK, passed 100 tests.
  7775. 283.75 s [vector] replicate: OK
  7776. 283.75 s [vector] +++ OK, passed 100 tests.
  7777. 283.75 s [vector] generate: OK
  7778. 283.75 s [vector] +++ OK, passed 100 tests.
  7779. 283.75 s [vector] iterateN: OK
  7780. 283.75 s [vector] +++ OK, passed 100 tests.
  7781. 283.75 s [vector] iterateNM: OK (0.01s)
  7782. 283.75 s [vector] +++ OK, passed 100 tests.
  7783. 283.75 s [vector] generateM: OK (0.01s)
  7784. 283.75 s [vector] +++ OK, passed 100 tests.
  7785. 283.75 s [vector] replicateM: OK
  7786. 283.75 s [vector] +++ OK, passed 100 tests.
  7787. 283.75 s [vector] create: OK
  7788. 283.75 s [vector] +++ OK, passed 100 tests.
  7789. 283.75 s [vector] createT: OK
  7790. 283.75 s [vector] +++ OK, passed 100 tests.
  7791. 283.75 s [vector] unfoldr: OK
  7792. 283.75 s [vector] +++ OK, passed 100 tests.
  7793. 283.75 s [vector] unfoldrN: OK
  7794. 283.75 s [vector] +++ OK, passed 100 tests.
  7795. 283.75 s [vector] unfoldrExactN: OK
  7796. 283.75 s [vector] +++ OK, passed 100 tests.
  7797. 283.75 s [vector] unfoldrM: OK
  7798. 283.75 s [vector] +++ OK, passed 100 tests.
  7799. 283.75 s [vector] unfoldrNM: OK
  7800. 283.75 s [vector] +++ OK, passed 100 tests.
  7801. 283.75 s [vector] unfoldrExactNM: OK (0.02s)
  7802. 283.76 s [vector] +++ OK, passed 100 tests.
  7803. 283.76 s [vector] constructN: OK
  7804. 283.77 s [vector] +++ OK, passed 100 tests.
  7805. 283.77 s [vector] constructrN: OK
  7806. 283.77 s [vector] +++ OK, passed 100 tests.
  7807. 283.77 s [vector] cons: OK
  7808. 283.77 s [vector] +++ OK, passed 100 tests.
  7809. 283.77 s [vector] snoc: OK
  7810. 283.77 s [vector] +++ OK, passed 100 tests.
  7811. 283.77 s [vector] append: OK
  7812. 283.77 s [vector] +++ OK, passed 100 tests.
  7813. 283.77 s [vector] concat: OK (0.01s)
  7814. 283.77 s [vector] +++ OK, passed 100 tests.
  7815. 283.77 s [vector] force: OK
  7816. 283.77 s [vector] +++ OK, passed 100 tests.
  7817. 283.77 s [vector] upd: OK
  7818. 283.77 s [vector] +++ OK, passed 100 tests.
  7819. 283.77 s [vector] accum: OK
  7820. 283.77 s [vector] +++ OK, passed 100 tests.
  7821. 283.77 s [vector] reverse: OK
  7822. 283.77 s [vector] +++ OK, passed 100 tests.
  7823. 283.77 s [vector] backpermute: OK
  7824. 283.77 s [vector] +++ OK, passed 100 tests.
  7825. 283.77 s [vector] map: OK
  7826. 283.77 s [vector] +++ OK, passed 100 tests.
  7827. 283.77 s [vector] imap: OK
  7828. 283.77 s [vector] +++ OK, passed 100 tests.
  7829. 283.77 s [vector] concatMap: OK
  7830. 283.77 s [vector] +++ OK, passed 100 tests.
  7831. 283.77 s [vector] mapM: OK
  7832. 283.77 s [vector] +++ OK, passed 100 tests.
  7833. 283.77 s [vector] mapM_: OK (0.01s)
  7834. 283.77 s [vector] +++ OK, passed 100 tests.
  7835. 283.77 s [vector] forM: OK
  7836. 283.77 s [vector] +++ OK, passed 100 tests.
  7837. 283.77 s [vector] forM_: OK (0.01s)
  7838. 283.77 s [vector] +++ OK, passed 100 tests.
  7839. 283.77 s [vector] imapM: OK
  7840. 283.77 s [vector] +++ OK, passed 100 tests.
  7841. 283.77 s [vector] imapM_: OK (0.02s)
  7842. 283.77 s [vector] +++ OK, passed 100 tests.
  7843. 283.77 s [vector] zipWith: OK
  7844. 283.77 s [vector] +++ OK, passed 100 tests.
  7845. 283.77 s [vector] zipWith3: OK
  7846. 283.77 s [vector] +++ OK, passed 100 tests.
  7847. 283.77 s [vector] izipWith: OK
  7848. 283.77 s [vector] +++ OK, passed 100 tests.
  7849. 283.77 s [vector] izipWith3: OK
  7850. 283.77 s [vector] +++ OK, passed 100 tests.
  7851. 283.77 s [vector] izipWithM: OK
  7852. 283.77 s [vector] +++ OK, passed 100 tests.
  7853. 283.77 s [vector] izipWithM_: OK
  7854. 283.77 s [vector] +++ OK, passed 100 tests.
  7855. 283.77 s [vector] zipWithM: OK
  7856. 283.77 s [vector] +++ OK, passed 100 tests.
  7857. 283.78 s [vector] zipWithM_: OK
  7858. 283.78 s [vector] +++ OK, passed 100 tests.
  7859. 283.78 s [vector] filter: OK
  7860. 283.78 s [vector] +++ OK, passed 100 tests.
  7861. 283.78 s [vector] ifilter: OK
  7862. 283.78 s [vector] +++ OK, passed 100 tests.
  7863. 283.80 s [vector] filterM: OK (0.02s)
  7864. 283.80 s [vector] +++ OK, passed 100 tests.
  7865. 283.80 s [vector] uniq: OK
  7866. 283.80 s [vector] +++ OK, passed 100 tests.
  7867. 283.80 s [vector] mapMaybe: OK
  7868. 283.80 s [vector] +++ OK, passed 100 tests.
  7869. 283.80 s [vector] imapMaybe: OK
  7870. 283.80 s [vector] +++ OK, passed 100 tests.
  7871. 283.80 s [vector] takeWhile: OK
  7872. 283.80 s [vector] +++ OK, passed 100 tests.
  7873. 283.80 s [vector] dropWhile: OK
  7874. 283.80 s [vector] +++ OK, passed 100 tests.
  7875. 283.80 s [vector] partition: OK
  7876. 283.80 s [vector] +++ OK, passed 100 tests.
  7877. 283.80 s [vector] partitionWith: OK
  7878. 283.80 s [vector] +++ OK, passed 100 tests.
  7879. 283.80 s [vector] span: OK
  7880. 283.80 s [vector] +++ OK, passed 100 tests.
  7881. 283.80 s [vector] break: OK
  7882. 283.81 s [vector] +++ OK, passed 100 tests.
  7883. 283.81 s [vector] spanR: OK
  7884. 283.81 s [vector] +++ OK, passed 100 tests.
  7885. 283.81 s [vector] breakR: OK
  7886. 283.81 s [vector] +++ OK, passed 100 tests.
  7887. 283.81 s [vector] groupBy: OK
  7888. 283.81 s [vector] +++ OK, passed 100 tests.
  7889. 283.81 s [vector] elem: OK
  7890. 283.81 s [vector] +++ OK, passed 100 tests.
  7891. 283.81 s [vector] notElem: OK
  7892. 283.81 s [vector] +++ OK, passed 100 tests.
  7893. 283.81 s [vector] find: OK
  7894. 283.81 s [vector] +++ OK, passed 100 tests.
  7895. 283.81 s [vector] findIndex: OK
  7896. 283.81 s [vector] +++ OK, passed 100 tests.
  7897. 283.81 s [vector] findIndexR: OK
  7898. 283.81 s [vector] +++ OK, passed 100 tests.
  7899. 283.81 s [vector] findIndices: OK
  7900. 283.81 s [vector] +++ OK, passed 100 tests.
  7901. 283.81 s [vector] elemIndex: OK
  7902. 283.81 s [vector] +++ OK, passed 100 tests.
  7903. 283.81 s [vector] elemIndices: OK
  7904. 283.81 s [vector] +++ OK, passed 100 tests.
  7905. 283.81 s [vector] foldl: OK
  7906. 283.81 s [vector] +++ OK, passed 100 tests.
  7907. 283.81 s [vector] foldl1: OK
  7908. 283.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7909. 283.81 s [vector] foldl': OK
  7910. 283.81 s [vector] +++ OK, passed 100 tests.
  7911. 283.81 s [vector] foldl1': OK
  7912. 283.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7913. 283.81 s [vector] foldr: OK
  7914. 283.82 s [vector] +++ OK, passed 100 tests.
  7915. 283.82 s [vector] foldr1: OK
  7916. 283.82 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7917. 283.82 s [vector] foldr': OK
  7918. 283.82 s [vector] +++ OK, passed 100 tests.
  7919. 283.82 s [vector] foldr1': OK
  7920. 283.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7921. 283.82 s [vector] ifoldl: OK
  7922. 283.82 s [vector] +++ OK, passed 100 tests.
  7923. 283.82 s [vector] ifoldl': OK
  7924. 283.82 s [vector] +++ OK, passed 100 tests.
  7925. 283.82 s [vector] ifoldr: OK
  7926. 283.82 s [vector] +++ OK, passed 100 tests.
  7927. 283.82 s [vector] ifoldr': OK
  7928. 283.83 s [vector] +++ OK, passed 100 tests.
  7929. 283.83 s [vector] ifoldM: OK
  7930. 283.83 s [vector] +++ OK, passed 100 tests.
  7931. 283.83 s [vector] ifoldM': OK
  7932. 283.83 s [vector] +++ OK, passed 100 tests.
  7933. 283.85 s [vector] ifoldM_: OK (0.01s)
  7934. 283.85 s [vector] +++ OK, passed 100 tests.
  7935. 283.85 s [vector] ifoldM'_: OK
  7936. 283.85 s [vector] +++ OK, passed 100 tests.
  7937. 283.85 s [vector] all: OK
  7938. 283.85 s [vector] +++ OK, passed 100 tests.
  7939. 283.85 s [vector] any: OK
  7940. 283.85 s [vector] +++ OK, passed 100 tests.
  7941. 283.85 s [vector] prescanl: OK
  7942. 283.85 s [vector] +++ OK, passed 100 tests.
  7943. 283.85 s [vector] prescanl': OK
  7944. 283.85 s [vector] +++ OK, passed 100 tests.
  7945. 283.85 s [vector] postscanl: OK
  7946. 283.85 s [vector] +++ OK, passed 100 tests.
  7947. 283.85 s [vector] postscanl': OK
  7948. 283.86 s [vector] +++ OK, passed 100 tests.
  7949. 283.86 s [vector] scanl: OK
  7950. 283.86 s [vector] +++ OK, passed 100 tests.
  7951. 283.86 s [vector] scanl': OK
  7952. 283.86 s [vector] +++ OK, passed 100 tests.
  7953. 283.86 s [vector] scanl1: OK
  7954. 283.86 s [vector] +++ OK, passed 100 tests.
  7955. 283.86 s [vector] scanl1': OK
  7956. 283.86 s [vector] +++ OK, passed 100 tests.
  7957. 283.86 s [vector] iscanl: OK
  7958. 283.86 s [vector] +++ OK, passed 100 tests.
  7959. 283.86 s [vector] iscanl': OK
  7960. 283.87 s [vector] +++ OK, passed 100 tests.
  7961. 283.87 s [vector] prescanr: OK
  7962. 283.87 s [vector] +++ OK, passed 100 tests.
  7963. 283.87 s [vector] prescanr': OK
  7964. 283.87 s [vector] +++ OK, passed 100 tests.
  7965. 283.87 s [vector] postscanr: OK
  7966. 283.87 s [vector] +++ OK, passed 100 tests.
  7967. 283.87 s [vector] postscanr': OK
  7968. 283.87 s [vector] +++ OK, passed 100 tests.
  7969. 283.87 s [vector] scanr: OK
  7970. 283.87 s [vector] +++ OK, passed 100 tests.
  7971. 283.87 s [vector] scanr': OK
  7972. 283.87 s [vector] +++ OK, passed 100 tests.
  7973. 283.87 s [vector] scanr1: OK
  7974. 283.87 s [vector] +++ OK, passed 100 tests.
  7975. 283.88 s [vector] scanr1': OK
  7976. 283.88 s [vector] +++ OK, passed 100 tests.
  7977. 283.88 s [vector] iscanr: OK
  7978. 283.88 s [vector] +++ OK, passed 100 tests.
  7979. 283.88 s [vector] iscanr': OK
  7980. 283.88 s [vector] +++ OK, passed 100 tests.
  7981. 283.88 s [vector] mut_read: OK
  7982. 283.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7983. 283.88 s [vector] mut_write: OK
  7984. 283.88 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7985. 283.88 s [vector] mut_modify: OK
  7986. 283.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7987. 283.88 s [vector] mut_generate: OK
  7988. 283.89 s [vector] +++ OK, passed 100 tests.
  7989. 283.89 s [vector] mut_generateM: OK
  7990. 283.89 s [vector] +++ OK, passed 100 tests.
  7991. 283.90 s [vector] mut_mapM_: OK
  7992. 283.90 s [vector] +++ OK, passed 100 tests.
  7993. 283.91 s [vector] mut_imapM_: OK
  7994. 283.91 s [vector] +++ OK, passed 100 tests.
  7995. 283.91 s [vector] mut_forM_: OK
  7996. 283.92 s [vector] +++ OK, passed 100 tests.
  7997. 283.92 s [vector] mut_iforM_: OK
  7998. 283.92 s [vector] +++ OK, passed 100 tests.
  7999. 283.92 s [vector] mut_foldr: OK
  8000. 283.92 s [vector] +++ OK, passed 100 tests.
  8001. 283.92 s [vector] mut_foldr': OK
  8002. 283.92 s [vector] +++ OK, passed 100 tests.
  8003. 283.92 s [vector] mut_foldl: OK
  8004. 283.92 s [vector] +++ OK, passed 100 tests.
  8005. 283.93 s [vector] mut_foldl': OK
  8006. 283.93 s [vector] +++ OK, passed 100 tests.
  8007. 283.93 s [vector] mut_ifoldr: OK
  8008. 283.93 s [vector] +++ OK, passed 100 tests.
  8009. 283.93 s [vector] mut_ifoldr': OK
  8010. 283.93 s [vector] +++ OK, passed 100 tests.
  8011. 283.93 s [vector] mut_ifoldl: OK
  8012. 283.93 s [vector] +++ OK, passed 100 tests.
  8013. 283.93 s [vector] mut_ifoldl': OK
  8014. 283.93 s [vector] +++ OK, passed 100 tests.
  8015. 283.93 s [vector] mut_foldM: OK
  8016. 283.93 s [vector] +++ OK, passed 100 tests.
  8017. 283.93 s [vector] mut_foldM': OK
  8018. 283.93 s [vector] +++ OK, passed 100 tests.
  8019. 283.93 s [vector] mut_foldrM: OK
  8020. 283.93 s [vector] +++ OK, passed 100 tests.
  8021. 283.94 s [vector] mut_foldrM': OK
  8022. 283.94 s [vector] +++ OK, passed 100 tests.
  8023. 283.94 s [vector] mut_ifoldM: OK
  8024. 283.94 s [vector] +++ OK, passed 100 tests.
  8025. 283.94 s [vector] mut_ifoldM': OK
  8026. 283.94 s [vector] +++ OK, passed 100 tests.
  8027. 283.94 s [vector] mut_ifoldrM: OK
  8028. 283.94 s [vector] +++ OK, passed 100 tests.
  8029. 283.94 s [vector] mut_ifoldrM': OK
  8030. 283.94 s [vector] +++ OK, passed 100 tests.
  8031. 283.94 s [vector] compare: OK
  8032. 283.94 s [vector] +++ OK, passed 100 tests.
  8033. 283.94 s [vector] maximum: OK
  8034. 283.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8035. 283.94 s [vector] minimum: OK
  8036. 283.94 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8037. 283.95 s [vector] minIndex: OK
  8038. 283.95 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8039. 283.95 s [vector] maxIndex: OK
  8040. 283.95 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8041. 283.95 s [vector] maximumBy: OK
  8042. 283.95 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8043. 283.95 s [vector] minimumBy: OK
  8044. 283.95 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8045. 283.95 s [vector] maximumOn: OK
  8046. 283.95 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8047. 283.95 s [vector] minimumOn: OK
  8048. 283.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8049. 283.95 s [vector] maxIndexBy: OK
  8050. 283.95 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8051. 283.95 s [vector] minIndexBy: OK
  8052. 283.95 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8053. 283.95 s [vector] ListFirstMaxIndexWins: OK
  8054. 283.95 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8055. 283.95 s [vector] FalseListFirstMaxIndexWins: OK
  8056. 283.95 s [vector] +++ OK, failed as expected. (after 1 test):
  8057. 283.95 s [vector] Exception:
  8058. 283.95 s [vector] Prelude.foldr1: empty list
  8059. 283.95 s [vector] CallStack (from HasCallStack):
  8060. 283.95 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  8061. 283.95 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  8062. 283.95 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8063. 283.95 s [vector] []
  8064. 283.95 s [vector] zip: OK
  8065. 283.95 s [vector] +++ OK, passed 100 tests.
  8066. 283.95 s [vector] zip3: OK
  8067. 283.95 s [vector] +++ OK, passed 100 tests.
  8068. 283.95 s [vector] unzip: OK
  8069. 283.95 s [vector] +++ OK, passed 100 tests.
  8070. 283.95 s [vector] unzip3: OK
  8071. 283.95 s [vector] +++ OK, passed 100 tests.
  8072. 283.95 s [vector] indexed: OK
  8073. 283.95 s [vector] +++ OK, passed 100 tests.
  8074. 283.95 s [vector] update: OK
  8075. 283.95 s [vector] +++ OK, passed 100 tests.
  8076. 283.96 s [vector] concat: OK
  8077. 283.96 s [vector] +++ OK, passed 100 tests.
  8078. 283.96 s [vector] mempty: OK
  8079. 283.96 s [vector] +++ OK, passed 1 test.
  8080. 283.97 s [vector] mappend: OK
  8081. 283.97 s [vector] +++ OK, passed 100 tests.
  8082. 283.97 s [vector] mconcat: OK
  8083. 283.97 s [vector] +++ OK, passed 100 tests.
  8084. 283.97 s [vector] fmap: OK
  8085. 283.97 s [vector] +++ OK, passed 100 tests.
  8086. 283.97 s [vector] return: OK
  8087. 283.97 s [vector] +++ OK, passed 100 tests.
  8088. 283.98 s [vector] bind: OK (0.01s)
  8089. 283.98 s [vector] +++ OK, passed 100 tests.
  8090. 283.98 s [vector] mzip: OK
  8091. 283.98 s [vector] +++ OK, passed 100 tests.
  8092. 283.98 s [vector] munzip: OK
  8093. 283.98 s [vector] +++ OK, passed 100 tests.
  8094. 283.98 s [vector] applicative_pure: OK
  8095. 283.99 s [vector] +++ OK, passed 100 tests.
  8096. 284.00 s [vector] applicative_appl: OK (0.02s)
  8097. 284.00 s [vector] +++ OK, passed 100 tests.
  8098. 284.00 s [vector] alternative_empty: OK
  8099. 284.00 s [vector] +++ OK, passed 1 test.
  8100. 284.00 s [vector] alternative_or: OK
  8101. 284.01 s [vector] +++ OK, passed 100 tests.
  8102. 284.05 s [vector] sequence: OK (0.04s)
  8103. 284.05 s [vector] +++ OK, passed 100 tests.
  8104. 284.05 s [vector] sequence_: OK
  8105. 284.05 s [vector] +++ OK, passed 100 tests.
  8106. 284.06 s [vector] glength: OK
  8107. 284.06 s [vector] +++ OK, passed 100 tests.
  8108. 284.06 s [vector] and: OK
  8109. 284.06 s [vector] +++ OK, passed 100 tests.
  8110. 284.06 s [vector] or: OK
  8111. 284.06 s [vector] +++ OK, passed 100 tests.
  8112. 284.06 s [vector] Int
  8113. 284.06 s [vector] fromList.toList == id: OK
  8114. 284.06 s [vector] +++ OK, passed 100 tests.
  8115. 284.06 s [vector] toList.fromList == id: OK
  8116. 284.06 s [vector] +++ OK, passed 100 tests.
  8117. 284.06 s [vector] unstream.stream == id: OK
  8118. 284.06 s [vector] +++ OK, passed 100 tests.
  8119. 284.06 s [vector] stream.unstream == id: OK
  8120. 284.06 s [vector] +++ OK, passed 100 tests.
  8121. 284.06 s [vector] eq: OK
  8122. 284.06 s [vector] +++ OK, passed 100 tests.
  8123. 284.06 s [vector] length: OK
  8124. 284.06 s [vector] +++ OK, passed 100 tests.
  8125. 284.06 s [vector] null: OK
  8126. 284.06 s [vector] +++ OK, passed 100 tests.
  8127. 284.06 s [vector] index: OK
  8128. 284.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8129. 284.06 s [vector] safeIndex: OK
  8130. 284.06 s [vector] +++ OK, passed 100 tests.
  8131. 284.06 s [vector] head: OK
  8132. 284.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8133. 284.06 s [vector] last: OK
  8134. 284.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8135. 284.06 s [vector] unsafeIndex: OK
  8136. 284.06 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8137. 284.06 s [vector] unsafeHead: OK
  8138. 284.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8139. 284.06 s [vector] unsafeLast: OK
  8140. 284.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8141. 284.06 s [vector] slice: OK
  8142. 284.06 s [vector] +++ OK, passed 100 tests.
  8143. 284.06 s [vector] init: OK
  8144. 284.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8145. 284.06 s [vector] tail: OK
  8146. 284.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8147. 284.06 s [vector] take: OK
  8148. 284.07 s [vector] +++ OK, passed 100 tests.
  8149. 284.07 s [vector] drop: OK
  8150. 284.07 s [vector] +++ OK, passed 100 tests.
  8151. 284.07 s [vector] splitAt: OK
  8152. 284.07 s [vector] +++ OK, passed 100 tests.
  8153. 284.07 s [vector] empty: OK
  8154. 284.07 s [vector] +++ OK, passed 1 test.
  8155. 284.07 s [vector] singleton: OK
  8156. 284.07 s [vector] +++ OK, passed 100 tests.
  8157. 284.07 s [vector] replicate: OK
  8158. 284.07 s [vector] +++ OK, passed 100 tests.
  8159. 284.07 s [vector] generate: OK
  8160. 284.07 s [vector] +++ OK, passed 100 tests.
  8161. 284.08 s [vector] iterateN: OK
  8162. 284.08 s [vector] +++ OK, passed 100 tests.
  8163. 284.11 s [vector] iterateNM: OK (0.03s)
  8164. 284.11 s [vector] +++ OK, passed 100 tests.
  8165. 284.11 s [vector] generateM: OK (0.02s)
  8166. 284.11 s [vector] +++ OK, passed 100 tests.
  8167. 284.12 s [vector] replicateM: OK
  8168. 284.12 s [vector] +++ OK, passed 100 tests.
  8169. 284.12 s [vector] create: OK
  8170. 284.12 s [vector] +++ OK, passed 100 tests.
  8171. 284.12 s [vector] createT: OK
  8172. 284.12 s [vector] +++ OK, passed 100 tests.
  8173. 284.12 s [vector] unfoldr: OK
  8174. 284.12 s [vector] +++ OK, passed 100 tests.
  8175. 284.12 s [vector] unfoldrN: OK
  8176. 284.12 s [vector] +++ OK, passed 100 tests.
  8177. 284.12 s [vector] unfoldrExactN: OK
  8178. 284.12 s [vector] +++ OK, passed 100 tests.
  8179. 284.12 s [vector] unfoldrM: OK
  8180. 284.12 s [vector] +++ OK, passed 100 tests.
  8181. 284.13 s [vector] unfoldrNM: OK
  8182. 284.13 s [vector] +++ OK, passed 100 tests.
  8183. 284.13 s [vector] unfoldrExactNM: OK
  8184. 284.14 s [vector] +++ OK, passed 100 tests.
  8185. 284.15 s [vector] constructN: OK (0.01s)
  8186. 284.15 s [vector] +++ OK, passed 100 tests.
  8187. 284.15 s [vector] constructrN: OK
  8188. 284.15 s [vector] +++ OK, passed 100 tests.
  8189. 284.15 s [vector] cons: OK
  8190. 284.15 s [vector] +++ OK, passed 100 tests.
  8191. 284.15 s [vector] snoc: OK
  8192. 284.15 s [vector] +++ OK, passed 100 tests.
  8193. 284.15 s [vector] append: OK
  8194. 284.15 s [vector] +++ OK, passed 100 tests.
  8195. 284.16 s [vector] concat: OK (0.01s)
  8196. 284.16 s [vector] +++ OK, passed 100 tests.
  8197. 284.16 s [vector] force: OK
  8198. 284.16 s [vector] +++ OK, passed 100 tests.
  8199. 284.16 s [vector] upd: OK
  8200. 284.17 s [vector] +++ OK, passed 100 tests.
  8201. 284.17 s [vector] accum: OK
  8202. 284.17 s [vector] +++ OK, passed 100 tests.
  8203. 284.17 s [vector] reverse: OK
  8204. 284.17 s [vector] +++ OK, passed 100 tests.
  8205. 284.17 s [vector] backpermute: OK
  8206. 284.17 s [vector] +++ OK, passed 100 tests.
  8207. 284.17 s [vector] map: OK
  8208. 284.17 s [vector] +++ OK, passed 100 tests.
  8209. 284.17 s [vector] imap: OK
  8210. 284.17 s [vector] +++ OK, passed 100 tests.
  8211. 284.18 s [vector] concatMap: OK
  8212. 284.18 s [vector] +++ OK, passed 100 tests.
  8213. 284.18 s [vector] mapM: OK
  8214. 284.20 s [vector] +++ OK, passed 100 tests.
  8215. 284.20 s [vector] mapM_: OK (0.02s)
  8216. 284.20 s [vector] +++ OK, passed 100 tests.
  8217. 284.21 s [vector] forM: OK
  8218. 284.21 s [vector] +++ OK, passed 100 tests.
  8219. 284.22 s [vector] forM_: OK (0.02s)
  8220. 284.22 s [vector] +++ OK, passed 100 tests.
  8221. 284.22 s [vector] imapM: OK
  8222. 284.24 s [vector] +++ OK, passed 100 tests.
  8223. 284.24 s [vector] imapM_: OK (0.02s)
  8224. 284.24 s [vector] +++ OK, passed 100 tests.
  8225. 284.24 s [vector] zipWith: OK
  8226. 284.24 s [vector] +++ OK, passed 100 tests.
  8227. 284.24 s [vector] zipWith3: OK
  8228. 284.24 s [vector] +++ OK, passed 100 tests.
  8229. 284.24 s [vector] izipWith: OK
  8230. 284.25 s [vector] +++ OK, passed 100 tests.
  8231. 284.25 s [vector] izipWith3: OK
  8232. 284.25 s [vector] +++ OK, passed 100 tests.
  8233. 284.25 s [vector] izipWithM: OK
  8234. 284.26 s [vector] +++ OK, passed 100 tests.
  8235. 284.27 s [vector] izipWithM_: OK (0.01s)
  8236. 284.27 s [vector] +++ OK, passed 100 tests.
  8237. 284.28 s [vector] zipWithM: OK
  8238. 284.28 s [vector] +++ OK, passed 100 tests.
  8239. 284.28 s [vector] zipWithM_: OK (0.01s)
  8240. 284.28 s [vector] +++ OK, passed 100 tests.
  8241. 284.28 s [vector] filter: OK
  8242. 284.28 s [vector] +++ OK, passed 100 tests.
  8243. 284.30 s [vector] ifilter: OK
  8244. 284.30 s [vector] +++ OK, passed 100 tests.
  8245. 284.31 s [vector] filterM: OK (0.03s)
  8246. 284.31 s [vector] +++ OK, passed 100 tests.
  8247. 284.31 s [vector] uniq: OK
  8248. 284.31 s [vector] +++ OK, passed 100 tests.
  8249. 284.31 s [vector] mapMaybe: OK
  8250. 284.31 s [vector] +++ OK, passed 100 tests.
  8251. 284.31 s [vector] imapMaybe: OK
  8252. 284.31 s [vector] +++ OK, passed 100 tests.
  8253. 284.31 s [vector] takeWhile: OK
  8254. 284.31 s [vector] +++ OK, passed 100 tests.
  8255. 284.31 s [vector] dropWhile: OK
  8256. 284.31 s [vector] +++ OK, passed 100 tests.
  8257. 284.31 s [vector] partition: OK
  8258. 284.32 s [vector] +++ OK, passed 100 tests.
  8259. 284.32 s [vector] partitionWith: OK
  8260. 284.32 s [vector] +++ OK, passed 100 tests.
  8261. 284.32 s [vector] span: OK
  8262. 284.32 s [vector] +++ OK, passed 100 tests.
  8263. 284.32 s [vector] break: OK
  8264. 284.32 s [vector] +++ OK, passed 100 tests.
  8265. 284.32 s [vector] spanR: OK
  8266. 284.32 s [vector] +++ OK, passed 100 tests.
  8267. 284.32 s [vector] breakR: OK
  8268. 284.32 s [vector] +++ OK, passed 100 tests.
  8269. 284.32 s [vector] groupBy: OK
  8270. 284.32 s [vector] +++ OK, passed 100 tests.
  8271. 284.32 s [vector] elem: OK
  8272. 284.32 s [vector] +++ OK, passed 100 tests.
  8273. 284.32 s [vector] notElem: OK
  8274. 284.32 s [vector] +++ OK, passed 100 tests.
  8275. 284.32 s [vector] find: OK
  8276. 284.32 s [vector] +++ OK, passed 100 tests.
  8277. 284.32 s [vector] findIndex: OK
  8278. 284.32 s [vector] +++ OK, passed 100 tests.
  8279. 284.33 s [vector] findIndexR: OK
  8280. 284.33 s [vector] +++ OK, passed 100 tests.
  8281. 284.33 s [vector] findIndices: OK
  8282. 284.33 s [vector] +++ OK, passed 100 tests.
  8283. 284.33 s [vector] elemIndex: OK
  8284. 284.33 s [vector] +++ OK, passed 100 tests.
  8285. 284.33 s [vector] elemIndices: OK
  8286. 284.33 s [vector] +++ OK, passed 100 tests.
  8287. 284.33 s [vector] foldl: OK
  8288. 284.33 s [vector] +++ OK, passed 100 tests.
  8289. 284.33 s [vector] foldl1: OK
  8290. 284.33 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8291. 284.33 s [vector] foldl': OK
  8292. 284.33 s [vector] +++ OK, passed 100 tests.
  8293. 284.34 s [vector] foldl1': OK
  8294. 284.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8295. 284.34 s [vector] foldr: OK
  8296. 284.34 s [vector] +++ OK, passed 100 tests.
  8297. 284.34 s [vector] foldr1: OK
  8298. 284.35 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8299. 284.35 s [vector] foldr': OK
  8300. 284.35 s [vector] +++ OK, passed 100 tests.
  8301. 284.35 s [vector] foldr1': OK
  8302. 284.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8303. 284.35 s [vector] ifoldl: OK
  8304. 284.35 s [vector] +++ OK, passed 100 tests.
  8305. 284.36 s [vector] ifoldl': OK
  8306. 284.36 s [vector] +++ OK, passed 100 tests.
  8307. 284.36 s [vector] ifoldr: OK
  8308. 284.36 s [vector] +++ OK, passed 100 tests.
  8309. 284.36 s [vector] ifoldr': OK
  8310. 284.36 s [vector] +++ OK, passed 100 tests.
  8311. 284.37 s [vector] ifoldM: OK
  8312. 284.37 s [vector] +++ OK, passed 100 tests.
  8313. 284.37 s [vector] ifoldM': OK
  8314. 284.38 s [vector] +++ OK, passed 100 tests.
  8315. 284.40 s [vector] ifoldM_: OK (0.02s)
  8316. 284.40 s [vector] +++ OK, passed 100 tests.
  8317. 284.41 s [vector] ifoldM'_: OK (0.02s)
  8318. 284.41 s [vector] +++ OK, passed 100 tests.
  8319. 284.41 s [vector] all: OK
  8320. 284.41 s [vector] +++ OK, passed 100 tests.
  8321. 284.41 s [vector] any: OK
  8322. 284.41 s [vector] +++ OK, passed 100 tests.
  8323. 284.41 s [vector] prescanl: OK
  8324. 284.41 s [vector] +++ OK, passed 100 tests.
  8325. 284.41 s [vector] prescanl': OK
  8326. 284.41 s [vector] +++ OK, passed 100 tests.
  8327. 284.42 s [vector] postscanl: OK
  8328. 284.42 s [vector] +++ OK, passed 100 tests.
  8329. 284.42 s [vector] postscanl': OK
  8330. 284.42 s [vector] +++ OK, passed 100 tests.
  8331. 284.42 s [vector] scanl: OK
  8332. 284.42 s [vector] +++ OK, passed 100 tests.
  8333. 284.43 s [vector] scanl': OK
  8334. 284.43 s [vector] +++ OK, passed 100 tests.
  8335. 284.43 s [vector] scanl1: OK
  8336. 284.43 s [vector] +++ OK, passed 100 tests.
  8337. 284.43 s [vector] scanl1': OK
  8338. 284.43 s [vector] +++ OK, passed 100 tests.
  8339. 284.43 s [vector] iscanl: OK
  8340. 284.43 s [vector] +++ OK, passed 100 tests.
  8341. 284.43 s [vector] iscanl': OK
  8342. 284.44 s [vector] +++ OK, passed 100 tests.
  8343. 284.44 s [vector] prescanr: OK
  8344. 284.44 s [vector] +++ OK, passed 100 tests.
  8345. 284.45 s [vector] prescanr': OK
  8346. 284.45 s [vector] +++ OK, passed 100 tests.
  8347. 284.45 s [vector] postscanr: OK
  8348. 284.45 s [vector] +++ OK, passed 100 tests.
  8349. 284.45 s [vector] postscanr': OK
  8350. 284.45 s [vector] +++ OK, passed 100 tests.
  8351. 284.45 s [vector] scanr: OK
  8352. 284.45 s [vector] +++ OK, passed 100 tests.
  8353. 284.46 s [vector] scanr': OK
  8354. 284.46 s [vector] +++ OK, passed 100 tests.
  8355. 284.46 s [vector] scanr1: OK
  8356. 284.46 s [vector] +++ OK, passed 100 tests.
  8357. 284.46 s [vector] scanr1': OK
  8358. 284.46 s [vector] +++ OK, passed 100 tests.
  8359. 284.47 s [vector] iscanr: OK
  8360. 284.47 s [vector] +++ OK, passed 100 tests.
  8361. 284.47 s [vector] iscanr': OK
  8362. 284.47 s [vector] +++ OK, passed 100 tests.
  8363. 284.47 s [vector] mut_read: OK
  8364. 284.47 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8365. 284.47 s [vector] mut_write: OK
  8366. 284.47 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8367. 284.47 s [vector] mut_modify: OK
  8368. 284.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8369. 284.48 s [vector] mut_generate: OK
  8370. 284.48 s [vector] +++ OK, passed 100 tests.
  8371. 284.48 s [vector] mut_generateM: OK
  8372. 284.49 s [vector] +++ OK, passed 100 tests.
  8373. 284.50 s [vector] mut_mapM_: OK (0.02s)
  8374. 284.50 s [vector] +++ OK, passed 100 tests.
  8375. 284.52 s [vector] mut_imapM_: OK (0.02s)
  8376. 284.52 s [vector] +++ OK, passed 100 tests.
  8377. 284.53 s [vector] mut_forM_: OK (0.02s)
  8378. 284.53 s [vector] +++ OK, passed 100 tests.
  8379. 284.55 s [vector] mut_iforM_: OK (0.02s)
  8380. 284.55 s [vector] +++ OK, passed 100 tests.
  8381. 284.55 s [vector] mut_foldr: OK
  8382. 284.55 s [vector] +++ OK, passed 100 tests.
  8383. 284.55 s [vector] mut_foldr': OK
  8384. 284.55 s [vector] +++ OK, passed 100 tests.
  8385. 284.56 s [vector] mut_foldl: OK
  8386. 284.56 s [vector] +++ OK, passed 100 tests.
  8387. 284.56 s [vector] mut_foldl': OK
  8388. 284.56 s [vector] +++ OK, passed 100 tests.
  8389. 284.57 s [vector] mut_ifoldr: OK
  8390. 284.57 s [vector] +++ OK, passed 100 tests.
  8391. 284.57 s [vector] mut_ifoldr': OK
  8392. 284.57 s [vector] +++ OK, passed 100 tests.
  8393. 284.57 s [vector] mut_ifoldl: OK
  8394. 284.57 s [vector] +++ OK, passed 100 tests.
  8395. 284.58 s [vector] mut_ifoldl': OK
  8396. 284.58 s [vector] +++ OK, passed 100 tests.
  8397. 284.58 s [vector] mut_foldM: OK
  8398. 284.58 s [vector] +++ OK, passed 100 tests.
  8399. 284.58 s [vector] mut_foldM': OK
  8400. 284.58 s [vector] +++ OK, passed 100 tests.
  8401. 284.58 s [vector] mut_foldrM: OK
  8402. 284.58 s [vector] +++ OK, passed 100 tests.
  8403. 284.59 s [vector] mut_foldrM': OK
  8404. 284.59 s [vector] +++ OK, passed 100 tests.
  8405. 284.59 s [vector] mut_ifoldM: OK
  8406. 284.59 s [vector] +++ OK, passed 100 tests.
  8407. 284.59 s [vector] mut_ifoldM': OK
  8408. 284.59 s [vector] +++ OK, passed 100 tests.
  8409. 284.60 s [vector] mut_ifoldrM: OK
  8410. 284.60 s [vector] +++ OK, passed 100 tests.
  8411. 284.60 s [vector] mut_ifoldrM': OK
  8412. 284.60 s [vector] +++ OK, passed 100 tests.
  8413. 284.60 s [vector] compare: OK
  8414. 284.60 s [vector] +++ OK, passed 100 tests.
  8415. 284.60 s [vector] maximum: OK
  8416. 284.60 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8417. 284.60 s [vector] minimum: OK
  8418. 284.60 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8419. 284.60 s [vector] minIndex: OK
  8420. 284.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8421. 284.60 s [vector] maxIndex: OK
  8422. 284.60 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8423. 284.60 s [vector] maximumBy: OK
  8424. 284.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8425. 284.60 s [vector] minimumBy: OK
  8426. 284.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8427. 284.60 s [vector] maximumOn: OK
  8428. 284.60 s [vector] +++ OK, passed 100 tests; 25 discarded.
  8429. 284.60 s [vector] minimumOn: OK
  8430. 284.60 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8431. 284.60 s [vector] maxIndexBy: OK
  8432. 284.60 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8433. 284.60 s [vector] minIndexBy: OK
  8434. 284.60 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8435. 284.60 s [vector] ListFirstMaxIndexWins: OK
  8436. 284.60 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8437. 284.60 s [vector] FalseListFirstMaxIndexWins: OK
  8438. 284.60 s [vector] +++ OK, failed as expected. (after 1 test):
  8439. 284.60 s [vector] Exception:
  8440. 284.60 s [vector] Prelude.foldr1: empty list
  8441. 284.60 s [vector] CallStack (from HasCallStack):
  8442. 284.60 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  8443. 284.60 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  8444. 284.60 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8445. 284.60 s [vector] []
  8446. 284.60 s [vector] zip: OK
  8447. 284.60 s [vector] +++ OK, passed 100 tests.
  8448. 284.60 s [vector] zip3: OK
  8449. 284.61 s [vector] +++ OK, passed 100 tests.
  8450. 284.61 s [vector] unzip: OK
  8451. 284.61 s [vector] +++ OK, passed 100 tests.
  8452. 284.61 s [vector] unzip3: OK
  8453. 284.61 s [vector] +++ OK, passed 100 tests.
  8454. 284.61 s [vector] indexed: OK
  8455. 284.61 s [vector] +++ OK, passed 100 tests.
  8456. 284.61 s [vector] update: OK
  8457. 284.61 s [vector] +++ OK, passed 100 tests.
  8458. 284.62 s [vector] concat: OK
  8459. 284.62 s [vector] +++ OK, passed 100 tests.
  8460. 284.62 s [vector] mempty: OK
  8461. 284.62 s [vector] +++ OK, passed 1 test.
  8462. 284.63 s [vector] mappend: OK
  8463. 284.63 s [vector] +++ OK, passed 100 tests.
  8464. 284.63 s [vector] mconcat: OK (0.01s)
  8465. 284.63 s [vector] +++ OK, passed 100 tests.
  8466. 284.63 s [vector] fmap: OK
  8467. 284.63 s [vector] +++ OK, passed 100 tests.
  8468. 284.63 s [vector] return: OK
  8469. 284.64 s [vector] +++ OK, passed 100 tests.
  8470. 284.65 s [vector] bind: OK (0.02s)
  8471. 284.65 s [vector] +++ OK, passed 100 tests.
  8472. 284.65 s [vector] mzip: OK
  8473. 284.65 s [vector] +++ OK, passed 100 tests.
  8474. 284.65 s [vector] munzip: OK
  8475. 284.65 s [vector] +++ OK, passed 100 tests.
  8476. 284.66 s [vector] applicative_pure: OK
  8477. 284.66 s [vector] +++ OK, passed 100 tests.
  8478. 284.69 s [vector] applicative_appl: OK (0.04s)
  8479. 284.69 s [vector] +++ OK, passed 100 tests.
  8480. 284.69 s [vector] alternative_empty: OK
  8481. 284.69 s [vector] +++ OK, passed 1 test.
  8482. 284.69 s [vector] alternative_or: OK
  8483. 284.69 s [vector] +++ OK, passed 100 tests.
  8484. 284.71 s [vector] sequence: OK (0.02s)
  8485. 284.71 s [vector] +++ OK, passed 100 tests.
  8486. 284.73 s [vector] sequence_: OK
  8487. 284.73 s [vector] +++ OK, passed 100 tests.
  8488. 284.73 s [vector] glength: OK
  8489. 284.73 s [vector] +++ OK, passed 100 tests.
  8490. 284.73 s [vector] sum: OK
  8491. 284.73 s [vector] +++ OK, passed 100 tests.
  8492. 284.73 s [vector] product: OK
  8493. 284.73 s [vector] +++ OK, passed 100 tests.
  8494. 284.73 s [vector] enumFromN: OK
  8495. 284.73 s [vector] +++ OK, passed 100 tests.
  8496. 284.73 s [vector] enumFromThenN: OK
  8497. 284.73 s [vector] +++ OK, passed 100 tests.
  8498. 284.73 s [vector] enumFromTo: OK
  8499. 284.73 s [vector] +++ OK, passed 100 tests.
  8500. 284.73 s [vector] enumFromThenTo: OK
  8501. 284.73 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8502. 284.73 s [vector] unstream
  8503. 284.74 s [vector] unstream == vunstream (exact): OK
  8504. 284.74 s [vector] +++ OK, passed 100 tests.
  8505. 284.74 s [vector] unstream == vunstream (unknown): OK
  8506. 284.74 s [vector] +++ OK, passed 100 tests.
  8507. 284.74 s [vector] unstreamR ~= vunstream (exact): OK
  8508. 284.74 s [vector] +++ OK, passed 100 tests.
  8509. 284.74 s [vector] unstreamR ~= vunstream (unknown): OK
  8510. 284.74 s [vector] +++ OK, passed 100 tests.
  8511. 284.74 s [vector] Tests.Vector.Primitive
  8512. 284.74 s [vector] Int
  8513. 284.74 s [vector] fromList.toList == id: OK
  8514. 284.74 s [vector] +++ OK, passed 100 tests.
  8515. 284.74 s [vector] toList.fromList == id: OK
  8516. 284.74 s [vector] +++ OK, passed 100 tests.
  8517. 284.74 s [vector] unstream.stream == id: OK
  8518. 284.74 s [vector] +++ OK, passed 100 tests.
  8519. 284.74 s [vector] stream.unstream == id: OK
  8520. 284.74 s [vector] +++ OK, passed 100 tests.
  8521. 284.74 s [vector] eq: OK
  8522. 284.74 s [vector] +++ OK, passed 100 tests.
  8523. 284.74 s [vector] length: OK
  8524. 284.74 s [vector] +++ OK, passed 100 tests.
  8525. 284.74 s [vector] null: OK
  8526. 284.74 s [vector] +++ OK, passed 100 tests.
  8527. 284.74 s [vector] index: OK
  8528. 284.74 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8529. 284.74 s [vector] safeIndex: OK
  8530. 284.74 s [vector] +++ OK, passed 100 tests.
  8531. 284.74 s [vector] head: OK
  8532. 284.74 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8533. 284.74 s [vector] last: OK
  8534. 284.74 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8535. 284.74 s [vector] unsafeIndex: OK
  8536. 284.74 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8537. 284.75 s [vector] unsafeHead: OK
  8538. 284.75 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8539. 284.75 s [vector] unsafeLast: OK
  8540. 284.75 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8541. 284.75 s [vector] slice: OK
  8542. 284.75 s [vector] +++ OK, passed 100 tests.
  8543. 284.75 s [vector] init: OK
  8544. 284.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8545. 284.75 s [vector] tail: OK
  8546. 284.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8547. 284.75 s [vector] take: OK
  8548. 284.75 s [vector] +++ OK, passed 100 tests.
  8549. 284.75 s [vector] drop: OK
  8550. 284.75 s [vector] +++ OK, passed 100 tests.
  8551. 284.75 s [vector] splitAt: OK
  8552. 284.75 s [vector] +++ OK, passed 100 tests.
  8553. 284.75 s [vector] empty: OK
  8554. 284.75 s [vector] +++ OK, passed 1 test.
  8555. 284.75 s [vector] singleton: OK
  8556. 284.75 s [vector] +++ OK, passed 100 tests.
  8557. 284.75 s [vector] replicate: OK
  8558. 284.75 s [vector] +++ OK, passed 100 tests.
  8559. 284.75 s [vector] generate: OK
  8560. 284.75 s [vector] +++ OK, passed 100 tests.
  8561. 284.75 s [vector] iterateN: OK
  8562. 284.75 s [vector] +++ OK, passed 100 tests.
  8563. 284.80 s [vector] iterateNM: OK (0.03s)
  8564. 284.80 s [vector] +++ OK, passed 100 tests.
  8565. 284.81 s [vector] generateM: OK (0.01s)
  8566. 284.81 s [vector] +++ OK, passed 100 tests.
  8567. 284.81 s [vector] replicateM: OK (0.01s)
  8568. 284.81 s [vector] +++ OK, passed 100 tests.
  8569. 284.81 s [vector] create: OK
  8570. 284.81 s [vector] +++ OK, passed 100 tests.
  8571. 284.81 s [vector] createT: OK
  8572. 284.81 s [vector] +++ OK, passed 100 tests.
  8573. 284.81 s [vector] unfoldr: OK
  8574. 284.81 s [vector] +++ OK, passed 100 tests.
  8575. 284.81 s [vector] unfoldrN: OK
  8576. 284.81 s [vector] +++ OK, passed 100 tests.
  8577. 284.81 s [vector] unfoldrExactN: OK
  8578. 284.81 s [vector] +++ OK, passed 100 tests.
  8579. 284.82 s [vector] unfoldrM: OK
  8580. 284.83 s [vector] +++ OK, passed 100 tests.
  8581. 284.84 s [vector] unfoldrNM: OK
  8582. 284.84 s [vector] +++ OK, passed 100 tests.
  8583. 284.85 s [vector] unfoldrExactNM: OK (0.02s)
  8584. 284.85 s [vector] +++ OK, passed 100 tests.
  8585. 284.85 s [vector] constructN: OK
  8586. 284.85 s [vector] +++ OK, passed 100 tests.
  8587. 284.85 s [vector] constructrN: OK
  8588. 284.85 s [vector] +++ OK, passed 100 tests.
  8589. 284.86 s [vector] cons: OK
  8590. 284.86 s [vector] +++ OK, passed 100 tests.
  8591. 284.86 s [vector] snoc: OK
  8592. 284.86 s [vector] +++ OK, passed 100 tests.
  8593. 284.86 s [vector] append: OK
  8594. 284.87 s [vector] +++ OK, passed 100 tests.
  8595. 284.88 s [vector] concat: OK (0.02s)
  8596. 284.88 s [vector] +++ OK, passed 100 tests.
  8597. 284.89 s [vector] force: OK
  8598. 284.89 s [vector] +++ OK, passed 100 tests.
  8599. 284.89 s [vector] upd: OK
  8600. 284.89 s [vector] +++ OK, passed 100 tests.
  8601. 284.89 s [vector] accum: OK
  8602. 284.89 s [vector] +++ OK, passed 100 tests.
  8603. 284.89 s [vector] reverse: OK
  8604. 284.89 s [vector] +++ OK, passed 100 tests.
  8605. 284.89 s [vector] backpermute: OK
  8606. 284.89 s [vector] +++ OK, passed 100 tests.
  8607. 284.89 s [vector] map: OK
  8608. 284.89 s [vector] +++ OK, passed 100 tests.
  8609. 284.90 s [vector] imap: OK
  8610. 284.90 s [vector] +++ OK, passed 100 tests.
  8611. 284.90 s [vector] concatMap: OK
  8612. 284.90 s [vector] +++ OK, passed 100 tests.
  8613. 284.90 s [vector] mapM: OK
  8614. 284.91 s [vector] +++ OK, passed 100 tests.
  8615. 284.92 s [vector] mapM_: OK (0.02s)
  8616. 284.92 s [vector] +++ OK, passed 100 tests.
  8617. 284.93 s [vector] forM: OK
  8618. 284.93 s [vector] +++ OK, passed 100 tests.
  8619. 284.93 s [vector] forM_: OK (0.01s)
  8620. 284.93 s [vector] +++ OK, passed 100 tests.
  8621. 284.95 s [vector] imapM: OK
  8622. 284.95 s [vector] +++ OK, passed 100 tests.
  8623. 284.96 s [vector] imapM_: OK (0.02s)
  8624. 284.96 s [vector] +++ OK, passed 100 tests.
  8625. 284.96 s [vector] zipWith: OK
  8626. 284.96 s [vector] +++ OK, passed 100 tests.
  8627. 284.96 s [vector] zipWith3: OK
  8628. 284.96 s [vector] +++ OK, passed 100 tests.
  8629. 284.97 s [vector] izipWith: OK
  8630. 284.97 s [vector] +++ OK, passed 100 tests.
  8631. 284.97 s [vector] izipWith3: OK
  8632. 284.97 s [vector] +++ OK, passed 100 tests.
  8633. 284.97 s [vector] izipWithM: OK
  8634. 284.97 s [vector] +++ OK, passed 100 tests.
  8635. 284.99 s [vector] izipWithM_: OK (0.02s)
  8636. 284.99 s [vector] +++ OK, passed 100 tests.
  8637. 284.99 s [vector] zipWithM: OK
  8638. 284.99 s [vector] +++ OK, passed 100 tests.
  8639. 285.01 s [vector] zipWithM_: OK
  8640. 285.01 s [vector] +++ OK, passed 100 tests.
  8641. 285.01 s [vector] filter: OK
  8642. 285.01 s [vector] +++ OK, passed 100 tests.
  8643. 285.01 s [vector] ifilter: OK
  8644. 285.01 s [vector] +++ OK, passed 100 tests.
  8645. 285.04 s [vector] filterM: OK (0.03s)
  8646. 285.04 s [vector] +++ OK, passed 100 tests.
  8647. 285.04 s [vector] uniq: OK
  8648. 285.04 s [vector] +++ OK, passed 100 tests.
  8649. 285.04 s [vector] mapMaybe: OK
  8650. 285.04 s [vector] +++ OK, passed 100 tests.
  8651. 285.04 s [vector] imapMaybe: OK
  8652. 285.04 s [vector] +++ OK, passed 100 tests.
  8653. 285.04 s [vector] takeWhile: OK
  8654. 285.04 s [vector] +++ OK, passed 100 tests.
  8655. 285.04 s [vector] dropWhile: OK
  8656. 285.04 s [vector] +++ OK, passed 100 tests.
  8657. 285.05 s [vector] partition: OK
  8658. 285.05 s [vector] +++ OK, passed 100 tests.
  8659. 285.05 s [vector] partitionWith: OK
  8660. 285.05 s [vector] +++ OK, passed 100 tests.
  8661. 285.05 s [vector] span: OK
  8662. 285.05 s [vector] +++ OK, passed 100 tests.
  8663. 285.05 s [vector] break: OK
  8664. 285.05 s [vector] +++ OK, passed 100 tests.
  8665. 285.05 s [vector] spanR: OK
  8666. 285.05 s [vector] +++ OK, passed 100 tests.
  8667. 285.05 s [vector] breakR: OK
  8668. 285.05 s [vector] +++ OK, passed 100 tests.
  8669. 285.05 s [vector] groupBy: OK
  8670. 285.05 s [vector] +++ OK, passed 100 tests.
  8671. 285.05 s [vector] elem: OK
  8672. 285.05 s [vector] +++ OK, passed 100 tests.
  8673. 285.05 s [vector] notElem: OK
  8674. 285.05 s [vector] +++ OK, passed 100 tests.
  8675. 285.05 s [vector] find: OK
  8676. 285.05 s [vector] +++ OK, passed 100 tests.
  8677. 285.05 s [vector] findIndex: OK
  8678. 285.05 s [vector] +++ OK, passed 100 tests.
  8679. 285.05 s [vector] findIndexR: OK
  8680. 285.06 s [vector] +++ OK, passed 100 tests.
  8681. 285.06 s [vector] findIndices: OK
  8682. 285.06 s [vector] +++ OK, passed 100 tests.
  8683. 285.06 s [vector] elemIndex: OK
  8684. 285.06 s [vector] +++ OK, passed 100 tests.
  8685. 285.06 s [vector] elemIndices: OK
  8686. 285.06 s [vector] +++ OK, passed 100 tests.
  8687. 285.06 s [vector] foldl: OK
  8688. 285.06 s [vector] +++ OK, passed 100 tests.
  8689. 285.07 s [vector] foldl1: OK
  8690. 285.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8691. 285.07 s [vector] foldl': OK
  8692. 285.07 s [vector] +++ OK, passed 100 tests.
  8693. 285.07 s [vector] foldl1': OK
  8694. 285.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8695. 285.08 s [vector] foldr: OK
  8696. 285.08 s [vector] +++ OK, passed 100 tests.
  8697. 285.08 s [vector] foldr1: OK
  8698. 285.08 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8699. 285.08 s [vector] foldr': OK
  8700. 285.08 s [vector] +++ OK, passed 100 tests.
  8701. 285.08 s [vector] foldr1': OK
  8702. 285.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8703. 285.09 s [vector] ifoldl: OK
  8704. 285.09 s [vector] +++ OK, passed 100 tests.
  8705. 285.09 s [vector] ifoldl': OK
  8706. 285.09 s [vector] +++ OK, passed 100 tests.
  8707. 285.09 s [vector] ifoldr: OK
  8708. 285.09 s [vector] +++ OK, passed 100 tests.
  8709. 285.10 s [vector] ifoldr': OK
  8710. 285.10 s [vector] +++ OK, passed 100 tests.
  8711. 285.10 s [vector] ifoldM: OK
  8712. 285.10 s [vector] +++ OK, passed 100 tests.
  8713. 285.10 s [vector] ifoldM': OK
  8714. 285.11 s [vector] +++ OK, passed 100 tests.
  8715. 285.11 s [vector] ifoldM_: OK (0.01s)
  8716. 285.11 s [vector] +++ OK, passed 100 tests.
  8717. 285.13 s [vector] ifoldM'_: OK
  8718. 285.13 s [vector] +++ OK, passed 100 tests.
  8719. 285.13 s [vector] all: OK
  8720. 285.13 s [vector] +++ OK, passed 100 tests.
  8721. 285.13 s [vector] any: OK
  8722. 285.13 s [vector] +++ OK, passed 100 tests.
  8723. 285.14 s [vector] prescanl: OK
  8724. 285.14 s [vector] +++ OK, passed 100 tests.
  8725. 285.14 s [vector] prescanl': OK
  8726. 285.14 s [vector] +++ OK, passed 100 tests.
  8727. 285.14 s [vector] postscanl: OK
  8728. 285.14 s [vector] +++ OK, passed 100 tests.
  8729. 285.15 s [vector] postscanl': OK
  8730. 285.15 s [vector] +++ OK, passed 100 tests.
  8731. 285.15 s [vector] scanl: OK
  8732. 285.15 s [vector] +++ OK, passed 100 tests.
  8733. 285.15 s [vector] scanl': OK
  8734. 285.15 s [vector] +++ OK, passed 100 tests.
  8735. 285.16 s [vector] scanl1: OK
  8736. 285.16 s [vector] +++ OK, passed 100 tests.
  8737. 285.16 s [vector] scanl1': OK
  8738. 285.16 s [vector] +++ OK, passed 100 tests.
  8739. 285.16 s [vector] iscanl: OK
  8740. 285.16 s [vector] +++ OK, passed 100 tests.
  8741. 285.16 s [vector] iscanl': OK
  8742. 285.16 s [vector] +++ OK, passed 100 tests.
  8743. 285.17 s [vector] prescanr: OK
  8744. 285.18 s [vector] +++ OK, passed 100 tests.
  8745. 285.18 s [vector] prescanr': OK
  8746. 285.18 s [vector] +++ OK, passed 100 tests.
  8747. 285.19 s [vector] postscanr: OK
  8748. 285.19 s [vector] +++ OK, passed 100 tests.
  8749. 285.19 s [vector] postscanr': OK
  8750. 285.19 s [vector] +++ OK, passed 100 tests.
  8751. 285.19 s [vector] scanr: OK
  8752. 285.19 s [vector] +++ OK, passed 100 tests.
  8753. 285.19 s [vector] scanr': OK
  8754. 285.19 s [vector] +++ OK, passed 100 tests.
  8755. 285.19 s [vector] scanr1: OK
  8756. 285.19 s [vector] +++ OK, passed 100 tests.
  8757. 285.19 s [vector] scanr1': OK
  8758. 285.19 s [vector] +++ OK, passed 100 tests.
  8759. 285.19 s [vector] iscanr: OK
  8760. 285.19 s [vector] +++ OK, passed 100 tests.
  8761. 285.19 s [vector] iscanr': OK
  8762. 285.19 s [vector] +++ OK, passed 100 tests.
  8763. 285.19 s [vector] mut_read: OK
  8764. 285.19 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8765. 285.20 s [vector] mut_write: OK
  8766. 285.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8767. 285.20 s [vector] mut_modify: OK
  8768. 285.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8769. 285.21 s [vector] mut_generate: OK
  8770. 285.23 s [vector] +++ OK, passed 100 tests.
  8771. 285.23 s [vector] mut_generateM: OK
  8772. 285.23 s [vector] +++ OK, passed 100 tests.
  8773. 285.23 s [vector] mut_mapM_: OK (0.01s)
  8774. 285.23 s [vector] +++ OK, passed 100 tests.
  8775. 285.24 s [vector] mut_imapM_: OK (0.01s)
  8776. 285.24 s [vector] +++ OK, passed 100 tests.
  8777. 285.25 s [vector] mut_forM_: OK (0.02s)
  8778. 285.25 s [vector] +++ OK, passed 100 tests.
  8779. 285.26 s [vector] mut_iforM_: OK (0.01s)
  8780. 285.26 s [vector] +++ OK, passed 100 tests.
  8781. 285.26 s [vector] mut_foldr: OK
  8782. 285.26 s [vector] +++ OK, passed 100 tests.
  8783. 285.26 s [vector] mut_foldr': OK
  8784. 285.26 s [vector] +++ OK, passed 100 tests.
  8785. 285.27 s [vector] mut_foldl: OK
  8786. 285.27 s [vector] +++ OK, passed 100 tests.
  8787. 285.27 s [vector] mut_foldl': OK
  8788. 285.27 s [vector] +++ OK, passed 100 tests.
  8789. 285.27 s [vector] mut_ifoldr: OK
  8790. 285.27 s [vector] +++ OK, passed 100 tests.
  8791. 285.27 s [vector] mut_ifoldr': OK
  8792. 285.27 s [vector] +++ OK, passed 100 tests.
  8793. 285.28 s [vector] mut_ifoldl: OK
  8794. 285.28 s [vector] +++ OK, passed 100 tests.
  8795. 285.28 s [vector] mut_ifoldl': OK
  8796. 285.28 s [vector] +++ OK, passed 100 tests.
  8797. 285.29 s [vector] mut_foldM: OK
  8798. 285.29 s [vector] +++ OK, passed 100 tests.
  8799. 285.29 s [vector] mut_foldM': OK
  8800. 285.29 s [vector] +++ OK, passed 100 tests.
  8801. 285.29 s [vector] mut_foldrM: OK
  8802. 285.29 s [vector] +++ OK, passed 100 tests.
  8803. 285.29 s [vector] mut_foldrM': OK
  8804. 285.30 s [vector] +++ OK, passed 100 tests.
  8805. 285.30 s [vector] mut_ifoldM: OK
  8806. 285.30 s [vector] +++ OK, passed 100 tests.
  8807. 285.30 s [vector] mut_ifoldM': OK
  8808. 285.30 s [vector] +++ OK, passed 100 tests.
  8809. 285.30 s [vector] mut_ifoldrM: OK
  8810. 285.30 s [vector] +++ OK, passed 100 tests.
  8811. 285.30 s [vector] mut_ifoldrM': OK
  8812. 285.30 s [vector] +++ OK, passed 100 tests.
  8813. 285.30 s [vector] compare: OK
  8814. 285.30 s [vector] +++ OK, passed 100 tests.
  8815. 285.30 s [vector] maximum: OK
  8816. 285.30 s [vector] +++ OK, passed 100 tests; 30 discarded.
  8817. 285.30 s [vector] minimum: OK
  8818. 285.30 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8819. 285.30 s [vector] minIndex: OK
  8820. 285.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8821. 285.30 s [vector] maxIndex: OK
  8822. 285.30 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8823. 285.30 s [vector] maximumBy: OK
  8824. 285.30 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8825. 285.30 s [vector] minimumBy: OK
  8826. 285.30 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8827. 285.30 s [vector] maximumOn: OK
  8828. 285.30 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8829. 285.30 s [vector] minimumOn: OK
  8830. 285.30 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8831. 285.30 s [vector] maxIndexBy: OK
  8832. 285.30 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8833. 285.30 s [vector] minIndexBy: OK
  8834. 285.30 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8835. 285.30 s [vector] ListFirstMaxIndexWins: OK
  8836. 285.30 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8837. 285.30 s [vector] FalseListFirstMaxIndexWins: OK
  8838. 285.31 s [vector] +++ OK, failed as expected. (after 1 test):
  8839. 285.31 s [vector] Exception:
  8840. 285.31 s [vector] Prelude.foldr1: empty list
  8841. 285.31 s [vector] CallStack (from HasCallStack):
  8842. 285.31 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  8843. 285.31 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  8844. 285.31 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  8845. 285.31 s [vector] []
  8846. 285.31 s [vector] mempty: OK
  8847. 285.31 s [vector] +++ OK, passed 1 test.
  8848. 285.31 s [vector] mappend: OK
  8849. 285.31 s [vector] +++ OK, passed 100 tests.
  8850. 285.32 s [vector] mconcat: OK (0.02s)
  8851. 285.32 s [vector] +++ OK, passed 100 tests.
  8852. 285.32 s [vector] glength: OK
  8853. 285.32 s [vector] +++ OK, passed 100 tests.
  8854. 285.32 s [vector] sum: OK
  8855. 285.32 s [vector] +++ OK, passed 100 tests.
  8856. 285.32 s [vector] product: OK
  8857. 285.32 s [vector] +++ OK, passed 100 tests.
  8858. 285.32 s [vector] enumFromN: OK
  8859. 285.32 s [vector] +++ OK, passed 100 tests.
  8860. 285.32 s [vector] enumFromThenN: OK
  8861. 285.32 s [vector] +++ OK, passed 100 tests.
  8862. 285.32 s [vector] enumFromTo: OK
  8863. 285.32 s [vector] +++ OK, passed 100 tests.
  8864. 285.33 s [vector] enumFromThenTo: OK
  8865. 285.33 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8866. 285.33 s [vector] Double
  8867. 285.33 s [vector] fromList.toList == id: OK
  8868. 285.33 s [vector] +++ OK, passed 100 tests.
  8869. 285.33 s [vector] toList.fromList == id: OK
  8870. 285.33 s [vector] +++ OK, passed 100 tests.
  8871. 285.33 s [vector] unstream.stream == id: OK
  8872. 285.33 s [vector] +++ OK, passed 100 tests.
  8873. 285.33 s [vector] stream.unstream == id: OK
  8874. 285.33 s [vector] +++ OK, passed 100 tests.
  8875. 285.33 s [vector] eq: OK
  8876. 285.33 s [vector] +++ OK, passed 100 tests.
  8877. 285.33 s [vector] length: OK
  8878. 285.33 s [vector] +++ OK, passed 100 tests.
  8879. 285.33 s [vector] null: OK
  8880. 285.33 s [vector] +++ OK, passed 100 tests.
  8881. 285.33 s [vector] index: OK
  8882. 285.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8883. 285.33 s [vector] safeIndex: OK
  8884. 285.33 s [vector] +++ OK, passed 100 tests.
  8885. 285.33 s [vector] head: OK
  8886. 285.33 s [vector] +++ OK, passed 100 tests; 24 discarded.
  8887. 285.33 s [vector] last: OK
  8888. 285.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8889. 285.33 s [vector] unsafeIndex: OK
  8890. 285.33 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8891. 285.33 s [vector] unsafeHead: OK
  8892. 285.33 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8893. 285.33 s [vector] unsafeLast: OK
  8894. 285.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8895. 285.34 s [vector] slice: OK
  8896. 285.34 s [vector] +++ OK, passed 100 tests.
  8897. 285.34 s [vector] init: OK
  8898. 285.34 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8899. 285.34 s [vector] tail: OK
  8900. 285.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8901. 285.34 s [vector] take: OK
  8902. 285.34 s [vector] +++ OK, passed 100 tests.
  8903. 285.34 s [vector] drop: OK
  8904. 285.34 s [vector] +++ OK, passed 100 tests.
  8905. 285.34 s [vector] splitAt: OK
  8906. 285.34 s [vector] +++ OK, passed 100 tests.
  8907. 285.34 s [vector] empty: OK
  8908. 285.34 s [vector] +++ OK, passed 1 test.
  8909. 285.35 s [vector] singleton: OK
  8910. 285.35 s [vector] +++ OK, passed 100 tests.
  8911. 285.35 s [vector] replicate: OK
  8912. 285.35 s [vector] +++ OK, passed 100 tests.
  8913. 285.35 s [vector] generate: OK
  8914. 285.35 s [vector] +++ OK, passed 100 tests.
  8915. 285.35 s [vector] iterateN: OK
  8916. 285.35 s [vector] +++ OK, passed 100 tests.
  8917. 285.37 s [vector] iterateNM: OK (0.03s)
  8918. 285.37 s [vector] +++ OK, passed 100 tests.
  8919. 285.39 s [vector] generateM: OK (0.02s)
  8920. 285.39 s [vector] +++ OK, passed 100 tests.
  8921. 285.40 s [vector] replicateM: OK (0.01s)
  8922. 285.40 s [vector] +++ OK, passed 100 tests.
  8923. 285.40 s [vector] create: OK
  8924. 285.40 s [vector] +++ OK, passed 100 tests.
  8925. 285.40 s [vector] createT: OK
  8926. 285.40 s [vector] +++ OK, passed 100 tests.
  8927. 285.40 s [vector] unfoldr: OK
  8928. 285.40 s [vector] +++ OK, passed 100 tests.
  8929. 285.40 s [vector] unfoldrN: OK
  8930. 285.41 s [vector] +++ OK, passed 100 tests.
  8931. 285.41 s [vector] unfoldrExactN: OK
  8932. 285.41 s [vector] +++ OK, passed 100 tests.
  8933. 285.41 s [vector] unfoldrM: OK
  8934. 285.41 s [vector] +++ OK, passed 100 tests.
  8935. 285.41 s [vector] unfoldrNM: OK
  8936. 285.41 s [vector] +++ OK, passed 100 tests.
  8937. 285.43 s [vector] unfoldrExactNM: OK (0.01s)
  8938. 285.43 s [vector] +++ OK, passed 100 tests.
  8939. 285.44 s [vector] constructN: OK (0.01s)
  8940. 285.44 s [vector] +++ OK, passed 100 tests.
  8941. 285.44 s [vector] constructrN: OK (0.01s)
  8942. 285.45 s [vector] +++ OK, passed 100 tests.
  8943. 285.45 s [vector] cons: OK
  8944. 285.45 s [vector] +++ OK, passed 100 tests.
  8945. 285.46 s [vector] snoc: OK
  8946. 285.46 s [vector] +++ OK, passed 100 tests.
  8947. 285.46 s [vector] append: OK
  8948. 285.46 s [vector] +++ OK, passed 100 tests.
  8949. 285.47 s [vector] concat: OK (0.02s)
  8950. 285.47 s [vector] +++ OK, passed 100 tests.
  8951. 285.47 s [vector] force: OK
  8952. 285.49 s [vector] +++ OK, passed 100 tests.
  8953. 285.49 s [vector] upd: OK
  8954. 285.49 s [vector] +++ OK, passed 100 tests.
  8955. 285.49 s [vector] accum: OK (0.01s)
  8956. 285.49 s [vector] +++ OK, passed 100 tests.
  8957. 285.49 s [vector] reverse: OK
  8958. 285.49 s [vector] +++ OK, passed 100 tests.
  8959. 285.49 s [vector] backpermute: OK
  8960. 285.49 s [vector] +++ OK, passed 100 tests.
  8961. 285.51 s [vector] map: OK
  8962. 285.51 s [vector] +++ OK, passed 100 tests.
  8963. 285.51 s [vector] imap: OK
  8964. 285.51 s [vector] +++ OK, passed 100 tests.
  8965. 285.52 s [vector] concatMap: OK
  8966. 285.52 s [vector] +++ OK, passed 100 tests.
  8967. 285.53 s [vector] mapM: OK
  8968. 285.53 s [vector] +++ OK, passed 100 tests.
  8969. 285.56 s [vector] mapM_: OK (0.03s)
  8970. 285.57 s [vector] +++ OK, passed 100 tests.
  8971. 285.57 s [vector] forM: OK
  8972. 285.57 s [vector] +++ OK, passed 100 tests.
  8973. 285.60 s [vector] forM_: OK (0.03s)
  8974. 285.61 s [vector] +++ OK, passed 100 tests.
  8975. 285.61 s [vector] imapM: OK
  8976. 285.61 s [vector] +++ OK, passed 100 tests.
  8977. 285.65 s [vector] imapM_: OK (0.04s)
  8978. 285.65 s [vector] +++ OK, passed 100 tests.
  8979. 285.66 s [vector] zipWith: OK
  8980. 285.66 s [vector] +++ OK, passed 100 tests.
  8981. 285.67 s [vector] zipWith3: OK
  8982. 285.67 s [vector] +++ OK, passed 100 tests.
  8983. 285.67 s [vector] izipWith: OK (0.01s)
  8984. 285.67 s [vector] +++ OK, passed 100 tests.
  8985. 285.69 s [vector] izipWith3: OK (0.01s)
  8986. 285.69 s [vector] +++ OK, passed 100 tests.
  8987. 285.70 s [vector] izipWithM: OK
  8988. 285.70 s [vector] +++ OK, passed 100 tests.
  8989. 285.72 s [vector] izipWithM_: OK (0.03s)
  8990. 285.73 s [vector] +++ OK, passed 100 tests.
  8991. 285.74 s [vector] zipWithM: OK
  8992. 285.74 s [vector] +++ OK, passed 100 tests.
  8993. 285.75 s [vector] zipWithM_: OK (0.02s)
  8994. 285.75 s [vector] +++ OK, passed 100 tests.
  8995. 285.76 s [vector] filter: OK
  8996. 285.76 s [vector] +++ OK, passed 100 tests.
  8997. 285.77 s [vector] ifilter: OK
  8998. 285.77 s [vector] +++ OK, passed 100 tests.
  8999. 285.80 s [vector] filterM: OK (0.04s)
  9000. 285.81 s [vector] +++ OK, passed 100 tests.
  9001. 285.81 s [vector] uniq: OK
  9002. 285.81 s [vector] +++ OK, passed 100 tests.
  9003. 285.81 s [vector] mapMaybe: OK
  9004. 285.81 s [vector] +++ OK, passed 100 tests.
  9005. 285.81 s [vector] imapMaybe: OK
  9006. 285.82 s [vector] +++ OK, passed 100 tests.
  9007. 285.82 s [vector] takeWhile: OK
  9008. 285.83 s [vector] +++ OK, passed 100 tests.
  9009. 285.83 s [vector] dropWhile: OK
  9010. 285.83 s [vector] +++ OK, passed 100 tests.
  9011. 285.83 s [vector] partition: OK
  9012. 285.83 s [vector] +++ OK, passed 100 tests.
  9013. 285.83 s [vector] partitionWith: OK
  9014. 285.83 s [vector] +++ OK, passed 100 tests.
  9015. 285.83 s [vector] span: OK
  9016. 285.83 s [vector] +++ OK, passed 100 tests.
  9017. 285.83 s [vector] break: OK
  9018. 285.83 s [vector] +++ OK, passed 100 tests.
  9019. 285.84 s [vector] spanR: OK
  9020. 285.84 s [vector] +++ OK, passed 100 tests.
  9021. 285.84 s [vector] breakR: OK
  9022. 285.84 s [vector] +++ OK, passed 100 tests.
  9023. 285.85 s [vector] groupBy: OK
  9024. 285.85 s [vector] +++ OK, passed 100 tests.
  9025. 285.85 s [vector] elem: OK
  9026. 285.85 s [vector] +++ OK, passed 100 tests.
  9027. 285.85 s [vector] notElem: OK
  9028. 285.85 s [vector] +++ OK, passed 100 tests.
  9029. 285.85 s [vector] find: OK
  9030. 285.85 s [vector] +++ OK, passed 100 tests.
  9031. 285.85 s [vector] findIndex: OK
  9032. 285.85 s [vector] +++ OK, passed 100 tests.
  9033. 285.85 s [vector] findIndexR: OK
  9034. 285.85 s [vector] +++ OK, passed 100 tests.
  9035. 285.85 s [vector] findIndices: OK
  9036. 285.85 s [vector] +++ OK, passed 100 tests.
  9037. 285.86 s [vector] elemIndex: OK
  9038. 285.87 s [vector] +++ OK, passed 100 tests.
  9039. 285.87 s [vector] elemIndices: OK
  9040. 285.87 s [vector] +++ OK, passed 100 tests.
  9041. 285.87 s [vector] foldl: OK (0.01s)
  9042. 285.87 s [vector] +++ OK, passed 100 tests.
  9043. 285.89 s [vector] foldl1: OK
  9044. 285.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9045. 285.90 s [vector] foldl': OK (0.01s)
  9046. 285.90 s [vector] +++ OK, passed 100 tests.
  9047. 285.91 s [vector] foldl1': OK (0.01s)
  9048. 285.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9049. 285.93 s [vector] foldr: OK (0.01s)
  9050. 285.93 s [vector] +++ OK, passed 100 tests.
  9051. 285.94 s [vector] foldr1: OK (0.01s)
  9052. 285.95 s [vector] +++ OK, passed 100 tests; 24 discarded.
  9053. 285.95 s [vector] foldr': OK (0.01s)
  9054. 285.95 s [vector] +++ OK, passed 100 tests.
  9055. 285.95 s [vector] foldr1': OK (0.01s)
  9056. 285.95 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9057. 285.97 s [vector] ifoldl: OK (0.01s)
  9058. 285.97 s [vector] +++ OK, passed 100 tests.
  9059. 285.97 s [vector] ifoldl': OK (0.01s)
  9060. 285.97 s [vector] +++ OK, passed 100 tests.
  9061. 285.99 s [vector] ifoldr: OK (0.01s)
  9062. 285.99 s [vector] +++ OK, passed 100 tests.
  9063. 286.00 s [vector] ifoldr': OK (0.01s)
  9064. 286.01 s [vector] +++ OK, passed 100 tests.
  9065. 286.02 s [vector] ifoldM: OK (0.01s)
  9066. 286.02 s [vector] +++ OK, passed 100 tests.
  9067. 286.02 s [vector] ifoldM': OK (0.02s)
  9068. 286.02 s [vector] +++ OK, passed 100 tests.
  9069. 286.07 s [vector] ifoldM_: OK (0.02s)
  9070. 286.07 s [vector] +++ OK, passed 100 tests.
  9071. 286.09 s [vector] ifoldM'_: OK (0.03s)
  9072. 286.09 s [vector] +++ OK, passed 100 tests.
  9073. 286.09 s [vector] all: OK
  9074. 286.10 s [vector] +++ OK, passed 100 tests.
  9075. 286.10 s [vector] any: OK
  9076. 286.10 s [vector] +++ OK, passed 100 tests.
  9077. 286.11 s [vector] prescanl: OK (0.01s)
  9078. 286.11 s [vector] +++ OK, passed 100 tests.
  9079. 286.13 s [vector] prescanl': OK (0.01s)
  9080. 286.13 s [vector] +++ OK, passed 100 tests.
  9081. 286.14 s [vector] postscanl: OK (0.01s)
  9082. 286.14 s [vector] +++ OK, passed 100 tests.
  9083. 286.14 s [vector] postscanl': OK (0.01s)
  9084. 286.14 s [vector] +++ OK, passed 100 tests.
  9085. 286.15 s [vector] scanl: OK
  9086. 286.15 s [vector] +++ OK, passed 100 tests.
  9087. 286.16 s [vector] scanl': OK (0.01s)
  9088. 286.16 s [vector] +++ OK, passed 100 tests.
  9089. 286.17 s [vector] scanl1: OK
  9090. 286.17 s [vector] +++ OK, passed 100 tests.
  9091. 286.19 s [vector] scanl1': OK (0.01s)
  9092. 286.19 s [vector] +++ OK, passed 100 tests.
  9093. 286.21 s [vector] iscanl: OK (0.02s)
  9094. 286.21 s [vector] +++ OK, passed 100 tests.
  9095. 286.22 s [vector] iscanl': OK (0.01s)
  9096. 286.23 s [vector] +++ OK, passed 100 tests.
  9097. 286.23 s [vector] prescanr: OK (0.01s)
  9098. 286.24 s [vector] +++ OK, passed 100 tests.
  9099. 286.25 s [vector] prescanr': OK (0.01s)
  9100. 286.25 s [vector] +++ OK, passed 100 tests.
  9101. 286.26 s [vector] postscanr: OK (0.01s)
  9102. 286.26 s [vector] +++ OK, passed 100 tests.
  9103. 286.27 s [vector] postscanr': OK (0.01s)
  9104. 286.27 s [vector] +++ OK, passed 100 tests.
  9105. 286.28 s [vector] scanr: OK (0.01s)
  9106. 286.28 s [vector] +++ OK, passed 100 tests.
  9107. 286.29 s [vector] scanr': OK (0.01s)
  9108. 286.29 s [vector] +++ OK, passed 100 tests.
  9109. 286.30 s [vector] scanr1: OK (0.01s)
  9110. 286.30 s [vector] +++ OK, passed 100 tests.
  9111. 286.31 s [vector] scanr1': OK (0.01s)
  9112. 286.31 s [vector] +++ OK, passed 100 tests.
  9113. 286.33 s [vector] iscanr: OK (0.01s)
  9114. 286.33 s [vector] +++ OK, passed 100 tests.
  9115. 286.33 s [vector] iscanr': OK (0.01s)
  9116. 286.33 s [vector] +++ OK, passed 100 tests.
  9117. 286.33 s [vector] mut_read: OK
  9118. 286.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9119. 286.33 s [vector] mut_write: OK
  9120. 286.33 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9121. 286.33 s [vector] mut_modify: OK
  9122. 286.33 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9123. 286.35 s [vector] mut_generate: OK
  9124. 286.35 s [vector] +++ OK, passed 100 tests.
  9125. 286.37 s [vector] mut_generateM: OK (0.02s)
  9126. 286.37 s [vector] +++ OK, passed 100 tests.
  9127. 286.39 s [vector] mut_mapM_: OK (0.04s)
  9128. 286.39 s [vector] +++ OK, passed 100 tests.
  9129. 286.43 s [vector] mut_imapM_: OK (0.04s)
  9130. 286.43 s [vector] +++ OK, passed 100 tests.
  9131. 286.47 s [vector] mut_forM_: OK (0.04s)
  9132. 286.47 s [vector] +++ OK, passed 100 tests.
  9133. 286.51 s [vector] mut_iforM_: OK (0.03s)
  9134. 286.51 s [vector] +++ OK, passed 100 tests.
  9135. 286.51 s [vector] mut_foldr: OK
  9136. 286.51 s [vector] +++ OK, passed 100 tests.
  9137. 286.53 s [vector] mut_foldr': OK (0.01s)
  9138. 286.53 s [vector] +++ OK, passed 100 tests.
  9139. 286.53 s [vector] mut_foldl: OK (0.01s)
  9140. 286.53 s [vector] +++ OK, passed 100 tests.
  9141. 286.55 s [vector] mut_foldl': OK (0.01s)
  9142. 286.56 s [vector] +++ OK, passed 100 tests.
  9143. 286.57 s [vector] mut_ifoldr: OK (0.01s)
  9144. 286.57 s [vector] +++ OK, passed 100 tests.
  9145. 286.57 s [vector] mut_ifoldr': OK (0.01s)
  9146. 286.57 s [vector] +++ OK, passed 100 tests.
  9147. 286.59 s [vector] mut_ifoldl: OK (0.02s)
  9148. 286.59 s [vector] +++ OK, passed 100 tests.
  9149. 286.61 s [vector] mut_ifoldl': OK (0.01s)
  9150. 286.61 s [vector] +++ OK, passed 100 tests.
  9151. 286.62 s [vector] mut_foldM: OK (0.01s)
  9152. 286.62 s [vector] +++ OK, passed 100 tests.
  9153. 286.63 s [vector] mut_foldM': OK (0.01s)
  9154. 286.63 s [vector] +++ OK, passed 100 tests.
  9155. 286.64 s [vector] mut_foldrM: OK (0.01s)
  9156. 286.64 s [vector] +++ OK, passed 100 tests.
  9157. 286.65 s [vector] mut_foldrM': OK (0.01s)
  9158. 286.65 s [vector] +++ OK, passed 100 tests.
  9159. 286.67 s [vector] mut_ifoldM: OK (0.02s)
  9160. 286.67 s [vector] +++ OK, passed 100 tests.
  9161. 286.67 s [vector] mut_ifoldM': OK (0.01s)
  9162. 286.67 s [vector] +++ OK, passed 100 tests.
  9163. 286.69 s [vector] mut_ifoldrM: OK (0.01s)
  9164. 286.70 s [vector] +++ OK, passed 100 tests.
  9165. 286.70 s [vector] mut_ifoldrM': OK (0.01s)
  9166. 286.70 s [vector] +++ OK, passed 100 tests.
  9167. 286.70 s [vector] compare: OK
  9168. 286.70 s [vector] +++ OK, passed 100 tests.
  9169. 286.70 s [vector] maximum: OK
  9170. 286.70 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9171. 286.70 s [vector] minimum: OK
  9172. 286.70 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9173. 286.70 s [vector] minIndex: OK
  9174. 286.70 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9175. 286.70 s [vector] maxIndex: OK
  9176. 286.70 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9177. 286.70 s [vector] maximumBy: OK
  9178. 286.70 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9179. 286.70 s [vector] minimumBy: OK
  9180. 286.70 s [vector] +++ OK, passed 100 tests; 25 discarded.
  9181. 286.71 s [vector] maximumOn: OK
  9182. 286.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9183. 286.71 s [vector] minimumOn: OK
  9184. 286.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9185. 286.71 s [vector] maxIndexBy: OK
  9186. 286.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9187. 286.71 s [vector] minIndexBy: OK
  9188. 286.71 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9189. 286.71 s [vector] ListFirstMaxIndexWins: OK
  9190. 286.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9191. 286.72 s [vector] FalseListFirstMaxIndexWins: OK
  9192. 286.72 s [vector] +++ OK, failed as expected. (after 1 test):
  9193. 286.72 s [vector] Exception:
  9194. 286.72 s [vector] Prelude.foldr1: empty list
  9195. 286.72 s [vector] CallStack (from HasCallStack):
  9196. 286.72 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  9197. 286.72 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  9198. 286.72 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9199. 286.72 s [vector] []
  9200. 286.72 s [vector] mempty: OK
  9201. 286.72 s [vector] +++ OK, passed 1 test.
  9202. 286.72 s [vector] mappend: OK
  9203. 286.72 s [vector] +++ OK, passed 100 tests.
  9204. 286.73 s [vector] mconcat: OK (0.02s)
  9205. 286.73 s [vector] +++ OK, passed 100 tests.
  9206. 286.73 s [vector] glength: OK
  9207. 286.73 s [vector] +++ OK, passed 100 tests.
  9208. 286.73 s [vector] sum: OK
  9209. 286.73 s [vector] +++ OK, passed 100 tests.
  9210. 286.73 s [vector] product: OK
  9211. 286.73 s [vector] +++ OK, passed 100 tests.
  9212. 286.73 s [vector] enumFromN: OK
  9213. 286.73 s [vector] +++ OK, passed 100 tests.
  9214. 286.73 s [vector] enumFromThenN: OK
  9215. 286.73 s [vector] +++ OK, passed 100 tests.
  9216. 286.73 s [vector] enumFromTo: OK
  9217. 286.73 s [vector] +++ OK, passed 100 tests.
  9218. 286.73 s [vector] enumFromThenTo: OK
  9219. 286.73 s [vector] +++ OK, passed 100 tests; 3 discarded.
  9220. 286.73 s [vector] unstream
  9221. 286.73 s [vector] unstream == vunstream (exact): OK
  9222. 286.73 s [vector] +++ OK, passed 100 tests.
  9223. 286.73 s [vector] unstream == vunstream (unknown): OK
  9224. 286.73 s [vector] +++ OK, passed 100 tests.
  9225. 286.73 s [vector] unstreamR ~= vunstream (exact): OK
  9226. 286.73 s [vector] +++ OK, passed 100 tests.
  9227. 286.73 s [vector] unstreamR ~= vunstream (unknown): OK
  9228. 286.73 s [vector] +++ OK, passed 100 tests.
  9229. 286.73 s [vector] Tests.Vector.Storable
  9230. 286.73 s [vector] Data.Vector.Storable.Vector (Int)
  9231. 286.73 s [vector] fromList.toList == id: OK
  9232. 286.73 s [vector] +++ OK, passed 100 tests.
  9233. 286.73 s [vector] toList.fromList == id: OK
  9234. 286.73 s [vector] +++ OK, passed 100 tests.
  9235. 286.73 s [vector] unstream.stream == id: OK
  9236. 286.73 s [vector] +++ OK, passed 100 tests.
  9237. 286.73 s [vector] stream.unstream == id: OK
  9238. 286.73 s [vector] +++ OK, passed 100 tests.
  9239. 286.73 s [vector] eq: OK
  9240. 286.73 s [vector] +++ OK, passed 100 tests.
  9241. 286.73 s [vector] length: OK
  9242. 286.73 s [vector] +++ OK, passed 100 tests.
  9243. 286.73 s [vector] null: OK
  9244. 286.73 s [vector] +++ OK, passed 100 tests.
  9245. 286.73 s [vector] index: OK
  9246. 286.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9247. 286.74 s [vector] safeIndex: OK
  9248. 286.74 s [vector] +++ OK, passed 100 tests.
  9249. 286.74 s [vector] head: OK
  9250. 286.74 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9251. 286.74 s [vector] last: OK
  9252. 286.74 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9253. 286.74 s [vector] unsafeIndex: OK
  9254. 286.74 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9255. 286.74 s [vector] unsafeHead: OK
  9256. 286.74 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9257. 286.74 s [vector] unsafeLast: OK
  9258. 286.74 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9259. 286.74 s [vector] slice: OK
  9260. 286.74 s [vector] +++ OK, passed 100 tests.
  9261. 286.74 s [vector] init: OK
  9262. 286.74 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9263. 286.74 s [vector] tail: OK
  9264. 286.74 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9265. 286.74 s [vector] take: OK
  9266. 286.74 s [vector] +++ OK, passed 100 tests.
  9267. 286.74 s [vector] drop: OK
  9268. 286.74 s [vector] +++ OK, passed 100 tests.
  9269. 286.74 s [vector] splitAt: OK
  9270. 286.74 s [vector] +++ OK, passed 100 tests.
  9271. 286.74 s [vector] empty: OK
  9272. 286.74 s [vector] +++ OK, passed 1 test.
  9273. 286.74 s [vector] singleton: OK
  9274. 286.74 s [vector] +++ OK, passed 100 tests.
  9275. 286.74 s [vector] replicate: OK
  9276. 286.74 s [vector] +++ OK, passed 100 tests.
  9277. 286.74 s [vector] generate: OK
  9278. 286.75 s [vector] +++ OK, passed 100 tests.
  9279. 286.75 s [vector] iterateN: OK
  9280. 286.75 s [vector] +++ OK, passed 100 tests.
  9281. 286.77 s [vector] iterateNM: OK (0.02s)
  9282. 286.77 s [vector] +++ OK, passed 100 tests.
  9283. 286.78 s [vector] generateM: OK (0.02s)
  9284. 286.78 s [vector] +++ OK, passed 100 tests.
  9285. 286.79 s [vector] replicateM: OK
  9286. 286.79 s [vector] +++ OK, passed 100 tests.
  9287. 286.79 s [vector] create: OK
  9288. 286.79 s [vector] +++ OK, passed 100 tests.
  9289. 286.79 s [vector] createT: OK
  9290. 286.79 s [vector] +++ OK, passed 100 tests.
  9291. 286.79 s [vector] unfoldr: OK
  9292. 286.79 s [vector] +++ OK, passed 100 tests.
  9293. 286.79 s [vector] unfoldrN: OK
  9294. 286.79 s [vector] +++ OK, passed 100 tests.
  9295. 286.79 s [vector] unfoldrExactN: OK
  9296. 286.79 s [vector] +++ OK, passed 100 tests.
  9297. 286.79 s [vector] unfoldrM: OK
  9298. 286.79 s [vector] +++ OK, passed 100 tests.
  9299. 286.79 s [vector] unfoldrNM: OK
  9300. 286.79 s [vector] +++ OK, passed 100 tests.
  9301. 286.81 s [vector] unfoldrExactNM: OK (0.02s)
  9302. 286.81 s [vector] +++ OK, passed 100 tests.
  9303. 286.82 s [vector] constructN: OK
  9304. 286.82 s [vector] +++ OK, passed 100 tests.
  9305. 286.82 s [vector] constructrN: OK
  9306. 286.82 s [vector] +++ OK, passed 100 tests.
  9307. 286.82 s [vector] cons: OK
  9308. 286.82 s [vector] +++ OK, passed 100 tests.
  9309. 286.82 s [vector] snoc: OK
  9310. 286.82 s [vector] +++ OK, passed 100 tests.
  9311. 286.83 s [vector] append: OK
  9312. 286.83 s [vector] +++ OK, passed 100 tests.
  9313. 286.84 s [vector] concat: OK (0.01s)
  9314. 286.84 s [vector] +++ OK, passed 100 tests.
  9315. 286.84 s [vector] force: OK
  9316. 286.84 s [vector] +++ OK, passed 100 tests.
  9317. 286.84 s [vector] upd: OK
  9318. 286.84 s [vector] +++ OK, passed 100 tests.
  9319. 286.84 s [vector] accum: OK
  9320. 286.84 s [vector] +++ OK, passed 100 tests.
  9321. 286.84 s [vector] reverse: OK
  9322. 286.84 s [vector] +++ OK, passed 100 tests.
  9323. 286.84 s [vector] backpermute: OK
  9324. 286.84 s [vector] +++ OK, passed 100 tests.
  9325. 286.84 s [vector] map: OK
  9326. 286.84 s [vector] +++ OK, passed 100 tests.
  9327. 286.85 s [vector] imap: OK
  9328. 286.85 s [vector] +++ OK, passed 100 tests.
  9329. 286.85 s [vector] concatMap: OK
  9330. 286.85 s [vector] +++ OK, passed 100 tests.
  9331. 286.85 s [vector] mapM: OK
  9332. 286.85 s [vector] +++ OK, passed 100 tests.
  9333. 286.86 s [vector] mapM_: OK (0.01s)
  9334. 286.86 s [vector] +++ OK, passed 100 tests.
  9335. 286.87 s [vector] forM: OK
  9336. 286.87 s [vector] +++ OK, passed 100 tests.
  9337. 286.88 s [vector] forM_: OK (0.01s)
  9338. 286.89 s [vector] +++ OK, passed 100 tests.
  9339. 286.89 s [vector] imapM: OK
  9340. 286.89 s [vector] +++ OK, passed 100 tests.
  9341. 286.90 s [vector] imapM_: OK (0.02s)
  9342. 286.90 s [vector] +++ OK, passed 100 tests.
  9343. 286.90 s [vector] zipWith: OK
  9344. 286.90 s [vector] +++ OK, passed 100 tests.
  9345. 286.90 s [vector] zipWith3: OK
  9346. 286.91 s [vector] +++ OK, passed 100 tests.
  9347. 286.91 s [vector] izipWith: OK
  9348. 286.91 s [vector] +++ OK, passed 100 tests.
  9349. 286.91 s [vector] izipWith3: OK
  9350. 286.91 s [vector] +++ OK, passed 100 tests.
  9351. 286.91 s [vector] izipWithM: OK
  9352. 286.91 s [vector] +++ OK, passed 100 tests.
  9353. 286.93 s [vector] izipWithM_: OK (0.01s)
  9354. 286.93 s [vector] +++ OK, passed 100 tests.
  9355. 286.93 s [vector] zipWithM: OK
  9356. 286.93 s [vector] +++ OK, passed 100 tests.
  9357. 286.94 s [vector] zipWithM_: OK (0.01s)
  9358. 286.94 s [vector] +++ OK, passed 100 tests.
  9359. 286.94 s [vector] filter: OK
  9360. 286.94 s [vector] +++ OK, passed 100 tests.
  9361. 286.95 s [vector] ifilter: OK
  9362. 286.95 s [vector] +++ OK, passed 100 tests.
  9363. 286.96 s [vector] filterM: OK (0.02s)
  9364. 286.96 s [vector] +++ OK, passed 100 tests.
  9365. 286.96 s [vector] uniq: OK
  9366. 286.97 s [vector] +++ OK, passed 100 tests.
  9367. 286.97 s [vector] mapMaybe: OK
  9368. 286.97 s [vector] +++ OK, passed 100 tests.
  9369. 286.97 s [vector] imapMaybe: OK
  9370. 286.97 s [vector] +++ OK, passed 100 tests.
  9371. 286.97 s [vector] takeWhile: OK
  9372. 286.97 s [vector] +++ OK, passed 100 tests.
  9373. 286.97 s [vector] dropWhile: OK
  9374. 286.97 s [vector] +++ OK, passed 100 tests.
  9375. 286.97 s [vector] partition: OK
  9376. 286.98 s [vector] +++ OK, passed 100 tests.
  9377. 286.98 s [vector] partitionWith: OK
  9378. 286.98 s [vector] +++ OK, passed 100 tests.
  9379. 286.98 s [vector] span: OK
  9380. 286.98 s [vector] +++ OK, passed 100 tests.
  9381. 286.98 s [vector] break: OK
  9382. 286.98 s [vector] +++ OK, passed 100 tests.
  9383. 286.98 s [vector] spanR: OK
  9384. 286.98 s [vector] +++ OK, passed 100 tests.
  9385. 286.98 s [vector] breakR: OK
  9386. 286.98 s [vector] +++ OK, passed 100 tests.
  9387. 286.98 s [vector] groupBy: OK
  9388. 286.98 s [vector] +++ OK, passed 100 tests.
  9389. 286.98 s [vector] elem: OK
  9390. 286.98 s [vector] +++ OK, passed 100 tests.
  9391. 286.98 s [vector] notElem: OK
  9392. 286.98 s [vector] +++ OK, passed 100 tests.
  9393. 286.99 s [vector] find: OK
  9394. 286.99 s [vector] +++ OK, passed 100 tests.
  9395. 286.99 s [vector] findIndex: OK
  9396. 286.99 s [vector] +++ OK, passed 100 tests.
  9397. 286.99 s [vector] findIndexR: OK
  9398. 286.99 s [vector] +++ OK, passed 100 tests.
  9399. 286.99 s [vector] findIndices: OK
  9400. 286.99 s [vector] +++ OK, passed 100 tests.
  9401. 287.00 s [vector] elemIndex: OK
  9402. 287.00 s [vector] +++ OK, passed 100 tests.
  9403. 287.00 s [vector] elemIndices: OK
  9404. 287.00 s [vector] +++ OK, passed 100 tests.
  9405. 287.00 s [vector] foldl: OK
  9406. 287.00 s [vector] +++ OK, passed 100 tests.
  9407. 287.00 s [vector] foldl1: OK
  9408. 287.00 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9409. 287.00 s [vector] foldl': OK
  9410. 287.00 s [vector] +++ OK, passed 100 tests.
  9411. 287.00 s [vector] foldl1': OK
  9412. 287.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9413. 287.00 s [vector] foldr: OK
  9414. 287.01 s [vector] +++ OK, passed 100 tests.
  9415. 287.01 s [vector] foldr1: OK
  9416. 287.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9417. 287.01 s [vector] foldr': OK
  9418. 287.01 s [vector] +++ OK, passed 100 tests.
  9419. 287.01 s [vector] foldr1': OK
  9420. 287.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9421. 287.02 s [vector] ifoldl: OK
  9422. 287.02 s [vector] +++ OK, passed 100 tests.
  9423. 287.02 s [vector] ifoldl': OK
  9424. 287.02 s [vector] +++ OK, passed 100 tests.
  9425. 287.02 s [vector] ifoldr: OK
  9426. 287.02 s [vector] +++ OK, passed 100 tests.
  9427. 287.03 s [vector] ifoldr': OK
  9428. 287.03 s [vector] +++ OK, passed 100 tests.
  9429. 287.03 s [vector] ifoldM: OK
  9430. 287.03 s [vector] +++ OK, passed 100 tests.
  9431. 287.03 s [vector] ifoldM': OK
  9432. 287.03 s [vector] +++ OK, passed 100 tests.
  9433. 287.05 s [vector] ifoldM_: OK (0.01s)
  9434. 287.51 s [vector] +++ OK, passed 100 tests.
  9435. 287.51 s [vector] ifoldM'_: OK (0.01s)
  9436. 287.51 s [vector] +++ OK, passed 100 tests.
  9437. 287.51 s [vector] all: OK
  9438. 287.51 s [vector] +++ OK, passed 100 tests.
  9439. 287.51 s [vector] any: OK
  9440. 287.51 s [vector] +++ OK, passed 100 tests.
  9441. 287.51 s [vector] prescanl: OK
  9442. 287.51 s [vector] +++ OK, passed 100 tests.
  9443. 287.51 s [vector] prescanl': OK
  9444. 287.51 s [vector] +++ OK, passed 100 tests.
  9445. 287.51 s [vector] postscanl: OK
  9446. 287.51 s [vector] +++ OK, passed 100 tests.
  9447. 287.51 s [vector] postscanl': OK
  9448. 287.51 s [vector] +++ OK, passed 100 tests.
  9449. 287.51 s [vector] scanl: OK
  9450. 287.51 s [vector] +++ OK, passed 100 tests.
  9451. 287.51 s [vector] scanl': OK
  9452. 287.51 s [vector] +++ OK, passed 100 tests.
  9453. 287.51 s [vector] scanl1: OK
  9454. 287.51 s [vector] +++ OK, passed 100 tests.
  9455. 287.51 s [vector] scanl1': OK
  9456. 287.51 s [vector] +++ OK, passed 100 tests.
  9457. 287.51 s [vector] iscanl: OK
  9458. 287.51 s [vector] +++ OK, passed 100 tests.
  9459. 287.51 s [vector] iscanl': OK
  9460. 287.51 s [vector] +++ OK, passed 100 tests.
  9461. 287.51 s [vector] prescanr: OK
  9462. 287.51 s [vector] +++ OK, passed 100 tests.
  9463. 287.51 s [vector] prescanr': OK
  9464. 287.51 s [vector] +++ OK, passed 100 tests.
  9465. 287.51 s [vector] postscanr: OK
  9466. 287.51 s [vector] +++ OK, passed 100 tests.
  9467. 287.51 s [vector] postscanr': OK
  9468. 287.51 s [vector] +++ OK, passed 100 tests.
  9469. 287.51 s [vector] scanr: OK
  9470. 287.51 s [vector] +++ OK, passed 100 tests.
  9471. 287.51 s [vector] scanr': OK
  9472. 287.51 s [vector] +++ OK, passed 100 tests.
  9473. 287.51 s [vector] scanr1: OK
  9474. 287.51 s [vector] +++ OK, passed 100 tests.
  9475. 287.51 s [vector] scanr1': OK
  9476. 287.51 s [vector] +++ OK, passed 100 tests.
  9477. 287.51 s [vector] iscanr: OK
  9478. 287.51 s [vector] +++ OK, passed 100 tests.
  9479. 287.51 s [vector] iscanr': OK
  9480. 287.51 s [vector] +++ OK, passed 100 tests.
  9481. 287.51 s [vector] mut_read: OK
  9482. 287.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9483. 287.51 s [vector] mut_write: OK
  9484. 287.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9485. 287.51 s [vector] mut_modify: OK
  9486. 287.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9487. 287.51 s [vector] mut_generate: OK
  9488. 287.51 s [vector] +++ OK, passed 100 tests.
  9489. 287.51 s [vector] mut_generateM: OK
  9490. 287.51 s [vector] +++ OK, passed 100 tests.
  9491. 287.51 s [vector] mut_mapM_: OK (0.01s)
  9492. 287.51 s [vector] +++ OK, passed 100 tests.
  9493. 287.51 s [vector] mut_imapM_: OK (0.01s)
  9494. 287.51 s [vector] +++ OK, passed 100 tests.
  9495. 287.51 s [vector] mut_forM_: OK (0.01s)
  9496. 287.51 s [vector] +++ OK, passed 100 tests.
  9497. 287.51 s [vector] mut_iforM_: OK (0.01s)
  9498. 287.51 s [vector] +++ OK, passed 100 tests.
  9499. 287.51 s [vector] mut_foldr: OK
  9500. 287.51 s [vector] +++ OK, passed 100 tests.
  9501. 287.51 s [vector] mut_foldr': OK
  9502. 287.51 s [vector] +++ OK, passed 100 tests.
  9503. 287.51 s [vector] mut_foldl: OK
  9504. 287.51 s [vector] +++ OK, passed 100 tests.
  9505. 287.51 s [vector] mut_foldl': OK
  9506. 287.51 s [vector] +++ OK, passed 100 tests.
  9507. 287.51 s [vector] mut_ifoldr: OK
  9508. 287.51 s [vector] +++ OK, passed 100 tests.
  9509. 287.51 s [vector] mut_ifoldr': OK
  9510. 287.52 s [vector] +++ OK, passed 100 tests.
  9511. 287.52 s [vector] mut_ifoldl: OK
  9512. 287.52 s [vector] +++ OK, passed 100 tests.
  9513. 287.52 s [vector] mut_ifoldl': OK
  9514. 287.52 s [vector] +++ OK, passed 100 tests.
  9515. 287.52 s [vector] mut_foldM: OK
  9516. 287.52 s [vector] +++ OK, passed 100 tests.
  9517. 287.52 s [vector] mut_foldM': OK
  9518. 287.52 s [vector] +++ OK, passed 100 tests.
  9519. 287.52 s [vector] mut_foldrM: OK
  9520. 287.52 s [vector] +++ OK, passed 100 tests.
  9521. 287.52 s [vector] mut_foldrM': OK
  9522. 287.52 s [vector] +++ OK, passed 100 tests.
  9523. 287.52 s [vector] mut_ifoldM: OK
  9524. 287.52 s [vector] +++ OK, passed 100 tests.
  9525. 287.52 s [vector] mut_ifoldM': OK
  9526. 287.52 s [vector] +++ OK, passed 100 tests.
  9527. 287.52 s [vector] mut_ifoldrM: OK
  9528. 287.52 s [vector] +++ OK, passed 100 tests.
  9529. 287.52 s [vector] mut_ifoldrM': OK
  9530. 287.52 s [vector] +++ OK, passed 100 tests.
  9531. 287.52 s [vector] compare: OK
  9532. 287.52 s [vector] +++ OK, passed 100 tests.
  9533. 287.52 s [vector] maximum: OK
  9534. 287.52 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9535. 287.52 s [vector] minimum: OK
  9536. 287.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9537. 287.52 s [vector] minIndex: OK
  9538. 287.52 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9539. 287.52 s [vector] maxIndex: OK
  9540. 287.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9541. 287.52 s [vector] maximumBy: OK
  9542. 287.52 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9543. 287.52 s [vector] minimumBy: OK
  9544. 287.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9545. 287.52 s [vector] maximumOn: OK
  9546. 287.52 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9547. 287.52 s [vector] minimumOn: OK
  9548. 287.52 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9549. 287.52 s [vector] maxIndexBy: OK
  9550. 287.52 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9551. 287.52 s [vector] minIndexBy: OK
  9552. 287.52 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9553. 287.52 s [vector] ListFirstMaxIndexWins: OK
  9554. 287.52 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9555. 287.52 s [vector] FalseListFirstMaxIndexWins: OK
  9556. 287.52 s [vector] +++ OK, failed as expected. (after 1 test):
  9557. 287.52 s [vector] Exception:
  9558. 287.52 s [vector] Prelude.foldr1: empty list
  9559. 287.52 s [vector] CallStack (from HasCallStack):
  9560. 287.52 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  9561. 287.52 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  9562. 287.52 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9563. 287.52 s [vector] []
  9564. 287.52 s [vector] mempty: OK
  9565. 287.52 s [vector] +++ OK, passed 1 test.
  9566. 287.52 s [vector] mappend: OK
  9567. 287.52 s [vector] +++ OK, passed 100 tests.
  9568. 287.52 s [vector] mconcat: OK (0.01s)
  9569. 287.52 s [vector] +++ OK, passed 100 tests.
  9570. 287.52 s [vector] glength: OK
  9571. 287.52 s [vector] +++ OK, passed 100 tests.
  9572. 287.52 s [vector] sum: OK
  9573. 287.52 s [vector] +++ OK, passed 100 tests.
  9574. 287.52 s [vector] product: OK
  9575. 287.52 s [vector] +++ OK, passed 100 tests.
  9576. 287.52 s [vector] enumFromN: OK
  9577. 287.52 s [vector] +++ OK, passed 100 tests.
  9578. 287.52 s [vector] enumFromThenN: OK
  9579. 287.52 s [vector] +++ OK, passed 100 tests.
  9580. 287.52 s [vector] enumFromTo: OK
  9581. 287.52 s [vector] +++ OK, passed 100 tests.
  9582. 287.52 s [vector] enumFromThenTo: OK
  9583. 287.52 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9584. 287.52 s [vector] Data.Vector.Storable.Vector (Double)
  9585. 287.52 s [vector] fromList.toList == id: OK
  9586. 287.52 s [vector] +++ OK, passed 100 tests.
  9587. 287.52 s [vector] toList.fromList == id: OK
  9588. 287.52 s [vector] +++ OK, passed 100 tests.
  9589. 287.52 s [vector] unstream.stream == id: OK
  9590. 287.52 s [vector] +++ OK, passed 100 tests.
  9591. 287.52 s [vector] stream.unstream == id: OK
  9592. 287.52 s [vector] +++ OK, passed 100 tests.
  9593. 287.52 s [vector] eq: OK
  9594. 287.52 s [vector] +++ OK, passed 100 tests.
  9595. 287.52 s [vector] length: OK
  9596. 287.52 s [vector] +++ OK, passed 100 tests.
  9597. 287.52 s [vector] null: OK
  9598. 287.52 s [vector] +++ OK, passed 100 tests.
  9599. 287.52 s [vector] index: OK
  9600. 287.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9601. 287.52 s [vector] safeIndex: OK
  9602. 287.52 s [vector] +++ OK, passed 100 tests.
  9603. 287.52 s [vector] head: OK
  9604. 287.52 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9605. 287.52 s [vector] last: OK
  9606. 287.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9607. 287.52 s [vector] unsafeIndex: OK
  9608. 287.52 s [vector] +++ OK, passed 100 tests; 23 discarded.
  9609. 287.52 s [vector] unsafeHead: OK
  9610. 287.52 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9611. 287.52 s [vector] unsafeLast: OK
  9612. 287.52 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9613. 287.52 s [vector] slice: OK
  9614. 287.52 s [vector] +++ OK, passed 100 tests.
  9615. 287.52 s [vector] init: OK
  9616. 287.52 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9617. 287.52 s [vector] tail: OK
  9618. 287.52 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9619. 287.52 s [vector] take: OK
  9620. 287.52 s [vector] +++ OK, passed 100 tests.
  9621. 287.52 s [vector] drop: OK
  9622. 287.52 s [vector] +++ OK, passed 100 tests.
  9623. 287.52 s [vector] splitAt: OK
  9624. 287.52 s [vector] +++ OK, passed 100 tests.
  9625. 287.52 s [vector] empty: OK
  9626. 287.52 s [vector] +++ OK, passed 1 test.
  9627. 287.52 s [vector] singleton: OK
  9628. 287.52 s [vector] +++ OK, passed 100 tests.
  9629. 287.52 s [vector] replicate: OK
  9630. 287.52 s [vector] +++ OK, passed 100 tests.
  9631. 287.52 s [vector] generate: OK
  9632. 287.52 s [vector] +++ OK, passed 100 tests.
  9633. 287.52 s [vector] iterateN: OK
  9634. 287.52 s [vector] +++ OK, passed 100 tests.
  9635. 287.52 s [vector] iterateNM: OK (0.01s)
  9636. 287.52 s [vector] +++ OK, passed 100 tests.
  9637. 287.52 s [vector] generateM: OK (0.03s)
  9638. 287.52 s [vector] +++ OK, passed 100 tests.
  9639. 287.52 s [vector] replicateM: OK
  9640. 287.52 s [vector] +++ OK, passed 100 tests.
  9641. 287.52 s [vector] create: OK
  9642. 287.52 s [vector] +++ OK, passed 100 tests.
  9643. 287.52 s [vector] createT: OK
  9644. 287.52 s [vector] +++ OK, passed 100 tests.
  9645. 287.52 s [vector] unfoldr: OK
  9646. 287.52 s [vector] +++ OK, passed 100 tests.
  9647. 287.52 s [vector] unfoldrN: OK
  9648. 287.52 s [vector] +++ OK, passed 100 tests.
  9649. 287.52 s [vector] unfoldrExactN: OK
  9650. 287.52 s [vector] +++ OK, passed 100 tests.
  9651. 287.52 s [vector] unfoldrM: OK
  9652. 287.52 s [vector] +++ OK, passed 100 tests.
  9653. 287.52 s [vector] unfoldrNM: OK
  9654. 287.52 s [vector] +++ OK, passed 100 tests.
  9655. 287.52 s [vector] unfoldrExactNM: OK
  9656. 287.52 s [vector] +++ OK, passed 100 tests.
  9657. 287.52 s [vector] constructN: OK (0.01s)
  9658. 287.52 s [vector] +++ OK, passed 100 tests.
  9659. 287.52 s [vector] constructrN: OK (0.01s)
  9660. 287.52 s [vector] +++ OK, passed 100 tests.
  9661. 287.52 s [vector] cons: OK
  9662. 287.52 s [vector] +++ OK, passed 100 tests.
  9663. 287.52 s [vector] snoc: OK
  9664. 287.52 s [vector] +++ OK, passed 100 tests.
  9665. 287.52 s [vector] append: OK
  9666. 287.52 s [vector] +++ OK, passed 100 tests.
  9667. 287.52 s [vector] concat: OK (0.02s)
  9668. 287.52 s [vector] +++ OK, passed 100 tests.
  9669. 287.52 s [vector] force: OK
  9670. 287.52 s [vector] +++ OK, passed 100 tests.
  9671. 287.52 s [vector] upd: OK
  9672. 287.52 s [vector] +++ OK, passed 100 tests.
  9673. 287.52 s [vector] accum: OK (0.01s)
  9674. 287.52 s [vector] +++ OK, passed 100 tests.
  9675. 287.52 s [vector] reverse: OK
  9676. 287.52 s [vector] +++ OK, passed 100 tests.
  9677. 287.52 s [vector] backpermute: OK
  9678. 287.52 s [vector] +++ OK, passed 100 tests.
  9679. 287.52 s [vector] map: OK
  9680. 287.52 s [vector] +++ OK, passed 100 tests.
  9681. 287.52 s [vector] imap: OK
  9682. 287.52 s [vector] +++ OK, passed 100 tests.
  9683. 287.52 s [vector] concatMap: OK
  9684. 287.52 s [vector] +++ OK, passed 100 tests.
  9685. 287.52 s [vector] mapM: OK
  9686. 287.52 s [vector] +++ OK, passed 100 tests.
  9687. 287.52 s [vector] mapM_: OK (0.03s)
  9688. 287.52 s [vector] +++ OK, passed 100 tests.
  9689. 287.52 s [vector] forM: OK
  9690. 287.52 s [vector] +++ OK, passed 100 tests.
  9691. 287.52 s [vector] forM_: OK (0.03s)
  9692. 287.52 s [vector] +++ OK, passed 100 tests.
  9693. 287.52 s [vector] imapM: OK
  9694. 287.52 s [vector] +++ OK, passed 100 tests.
  9695. 287.53 s [vector] imapM_: OK (0.04s)
  9696. 287.53 s [vector] +++ OK, passed 100 tests.
  9697. 287.55 s [vector] zipWith: OK (0.01s)
  9698. 287.55 s [vector] +++ OK, passed 100 tests.
  9699. 287.55 s [vector] zipWith3: OK
  9700. 287.55 s [vector] +++ OK, passed 100 tests.
  9701. 287.56 s [vector] izipWith: OK
  9702. 287.56 s [vector] +++ OK, passed 100 tests.
  9703. 287.57 s [vector] izipWith3: OK
  9704. 287.57 s [vector] +++ OK, passed 100 tests.
  9705. 287.59 s [vector] izipWithM: OK (0.01s)
  9706. 287.59 s [vector] +++ OK, passed 100 tests.
  9707. 287.63 s [vector] izipWithM_: OK (0.04s)
  9708. 287.63 s [vector] +++ OK, passed 100 tests.
  9709. 287.63 s [vector] zipWithM: OK (0.01s)
  9710. 287.63 s [vector] +++ OK, passed 100 tests.
  9711. 287.67 s [vector] zipWithM_: OK (0.03s)
  9712. 287.67 s [vector] +++ OK, passed 100 tests.
  9713. 287.68 s [vector] filter: OK
  9714. 287.68 s [vector] +++ OK, passed 100 tests.
  9715. 287.68 s [vector] ifilter: OK
  9716. 287.69 s [vector] +++ OK, passed 100 tests.
  9717. 287.72 s [vector] filterM: OK (0.04s)
  9718. 287.72 s [vector] +++ OK, passed 100 tests.
  9719. 287.72 s [vector] uniq: OK
  9720. 287.73 s [vector] +++ OK, passed 100 tests.
  9721. 287.74 s [vector] mapMaybe: OK
  9722. 287.74 s [vector] +++ OK, passed 100 tests.
  9723. 287.74 s [vector] imapMaybe: OK
  9724. 287.74 s [vector] +++ OK, passed 100 tests.
  9725. 287.75 s [vector] takeWhile: OK
  9726. 287.75 s [vector] +++ OK, passed 100 tests.
  9727. 287.75 s [vector] dropWhile: OK
  9728. 287.75 s [vector] +++ OK, passed 100 tests.
  9729. 287.75 s [vector] partition: OK
  9730. 287.75 s [vector] +++ OK, passed 100 tests.
  9731. 287.76 s [vector] partitionWith: OK
  9732. 287.76 s [vector] +++ OK, passed 100 tests.
  9733. 287.76 s [vector] span: OK
  9734. 287.76 s [vector] +++ OK, passed 100 tests.
  9735. 287.76 s [vector] break: OK
  9736. 287.76 s [vector] +++ OK, passed 100 tests.
  9737. 287.76 s [vector] spanR: OK
  9738. 287.76 s [vector] +++ OK, passed 100 tests.
  9739. 287.76 s [vector] breakR: OK
  9740. 287.76 s [vector] +++ OK, passed 100 tests.
  9741. 287.76 s [vector] groupBy: OK
  9742. 287.76 s [vector] +++ OK, passed 100 tests.
  9743. 287.76 s [vector] elem: OK
  9744. 287.76 s [vector] +++ OK, passed 100 tests.
  9745. 287.76 s [vector] notElem: OK
  9746. 287.76 s [vector] +++ OK, passed 100 tests.
  9747. 287.76 s [vector] find: OK
  9748. 287.76 s [vector] +++ OK, passed 100 tests.
  9749. 287.76 s [vector] findIndex: OK
  9750. 287.77 s [vector] +++ OK, passed 100 tests.
  9751. 287.77 s [vector] findIndexR: OK
  9752. 287.77 s [vector] +++ OK, passed 100 tests.
  9753. 287.77 s [vector] findIndices: OK
  9754. 287.77 s [vector] +++ OK, passed 100 tests.
  9755. 287.77 s [vector] elemIndex: OK
  9756. 287.77 s [vector] +++ OK, passed 100 tests.
  9757. 287.77 s [vector] elemIndices: OK
  9758. 287.78 s [vector] +++ OK, passed 100 tests.
  9759. 287.79 s [vector] foldl: OK (0.01s)
  9760. 287.80 s [vector] +++ OK, passed 100 tests.
  9761. 287.81 s [vector] foldl1: OK (0.01s)
  9762. 287.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9763. 287.82 s [vector] foldl': OK (0.01s)
  9764. 287.82 s [vector] +++ OK, passed 100 tests.
  9765. 287.83 s [vector] foldl1': OK (0.01s)
  9766. 287.83 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9767. 287.83 s [vector] foldr: OK (0.01s)
  9768. 287.83 s [vector] +++ OK, passed 100 tests.
  9769. 287.85 s [vector] foldr1: OK (0.01s)
  9770. 287.85 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9771. 287.87 s [vector] foldr': OK (0.01s)
  9772. 287.87 s [vector] +++ OK, passed 100 tests.
  9773. 287.87 s [vector] foldr1': OK (0.01s)
  9774. 287.87 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9775. 287.89 s [vector] ifoldl: OK (0.01s)
  9776. 287.89 s [vector] +++ OK, passed 100 tests.
  9777. 287.89 s [vector] ifoldl': OK (0.01s)
  9778. 287.89 s [vector] +++ OK, passed 100 tests.
  9779. 287.90 s [vector] ifoldr: OK
  9780. 287.90 s [vector] +++ OK, passed 100 tests.
  9781. 287.93 s [vector] ifoldr': OK (0.01s)
  9782. 287.93 s [vector] +++ OK, passed 100 tests.
  9783. 287.93 s [vector] ifoldM: OK (0.01s)
  9784. 287.93 s [vector] +++ OK, passed 100 tests.
  9785. 287.95 s [vector] ifoldM': OK (0.02s)
  9786. 287.96 s [vector] +++ OK, passed 100 tests.
  9787. 287.99 s [vector] ifoldM_: OK (0.04s)
  9788. 287.99 s [vector] +++ OK, passed 100 tests.
  9789. 288.02 s [vector] ifoldM'_: OK (0.03s)
  9790. 288.02 s [vector] +++ OK, passed 100 tests.
  9791. 288.03 s [vector] all: OK
  9792. 288.03 s [vector] +++ OK, passed 100 tests.
  9793. 288.03 s [vector] any: OK
  9794. 288.03 s [vector] +++ OK, passed 100 tests.
  9795. 288.03 s [vector] prescanl: OK (0.01s)
  9796. 288.03 s [vector] +++ OK, passed 100 tests.
  9797. 288.05 s [vector] prescanl': OK (0.01s)
  9798. 288.06 s [vector] +++ OK, passed 100 tests.
  9799. 288.07 s [vector] postscanl: OK (0.02s)
  9800. 288.07 s [vector] +++ OK, passed 100 tests.
  9801. 288.07 s [vector] postscanl': OK (0.01s)
  9802. 288.07 s [vector] +++ OK, passed 100 tests.
  9803. 288.09 s [vector] scanl: OK (0.01s)
  9804. 288.09 s [vector] +++ OK, passed 100 tests.
  9805. 288.11 s [vector] scanl': OK (0.01s)
  9806. 288.11 s [vector] +++ OK, passed 100 tests.
  9807. 288.11 s [vector] scanl1: OK (0.01s)
  9808. 288.11 s [vector] +++ OK, passed 100 tests.
  9809. 288.13 s [vector] scanl1': OK (0.01s)
  9810. 288.13 s [vector] +++ OK, passed 100 tests.
  9811. 288.13 s [vector] iscanl: OK (0.01s)
  9812. 288.13 s [vector] +++ OK, passed 100 tests.
  9813. 288.15 s [vector] iscanl': OK (0.01s)
  9814. 288.15 s [vector] +++ OK, passed 100 tests.
  9815. 288.17 s [vector] prescanr: OK (0.01s)
  9816. 288.17 s [vector] +++ OK, passed 100 tests.
  9817. 288.17 s [vector] prescanr': OK (0.01s)
  9818. 288.17 s [vector] +++ OK, passed 100 tests.
  9819. 288.19 s [vector] postscanr: OK (0.01s)
  9820. 288.19 s [vector] +++ OK, passed 100 tests.
  9821. 288.20 s [vector] postscanr': OK (0.01s)
  9822. 288.20 s [vector] +++ OK, passed 100 tests.
  9823. 288.21 s [vector] scanr: OK (0.01s)
  9824. 288.21 s [vector] +++ OK, passed 100 tests.
  9825. 288.23 s [vector] scanr': OK (0.01s)
  9826. 288.23 s [vector] +++ OK, passed 100 tests.
  9827. 288.24 s [vector] scanr1: OK (0.01s)
  9828. 288.24 s [vector] +++ OK, passed 100 tests.
  9829. 288.25 s [vector] scanr1': OK (0.01s)
  9830. 288.26 s [vector] +++ OK, passed 100 tests.
  9831. 288.27 s [vector] iscanr: OK (0.01s)
  9832. 288.27 s [vector] +++ OK, passed 100 tests.
  9833. 288.27 s [vector] iscanr': OK (0.01s)
  9834. 288.27 s [vector] +++ OK, passed 100 tests.
  9835. 288.27 s [vector] mut_read: OK
  9836. 288.27 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9837. 288.27 s [vector] mut_write: OK
  9838. 288.27 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9839. 288.27 s [vector] mut_modify: OK
  9840. 288.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9841. 288.29 s [vector] mut_generate: OK
  9842. 288.29 s [vector] +++ OK, passed 100 tests.
  9843. 288.31 s [vector] mut_generateM: OK (0.02s)
  9844. 288.31 s [vector] +++ OK, passed 100 tests.
  9845. 288.33 s [vector] mut_mapM_: OK (0.03s)
  9846. 288.33 s [vector] +++ OK, passed 100 tests.
  9847. 288.37 s [vector] mut_imapM_: OK (0.04s)
  9848. 288.38 s [vector] +++ OK, passed 100 tests.
  9849. 288.41 s [vector] mut_forM_: OK (0.03s)
  9850. 288.41 s [vector] +++ OK, passed 100 tests.
  9851. 288.43 s [vector] mut_iforM_: OK (0.03s)
  9852. 288.43 s [vector] +++ OK, passed 100 tests.
  9853. 288.45 s [vector] mut_foldr: OK (0.01s)
  9854. 288.45 s [vector] +++ OK, passed 100 tests.
  9855. 288.47 s [vector] mut_foldr': OK (0.01s)
  9856. 288.47 s [vector] +++ OK, passed 100 tests.
  9857. 288.47 s [vector] mut_foldl: OK (0.01s)
  9858. 288.47 s [vector] +++ OK, passed 100 tests.
  9859. 288.49 s [vector] mut_foldl': OK (0.01s)
  9860. 288.49 s [vector] +++ OK, passed 100 tests.
  9861. 288.50 s [vector] mut_ifoldr: OK (0.01s)
  9862. 288.50 s [vector] +++ OK, passed 100 tests.
  9863. 288.51 s [vector] mut_ifoldr': OK (0.01s)
  9864. 288.51 s [vector] +++ OK, passed 100 tests.
  9865. 288.51 s [vector] mut_ifoldl: OK (0.01s)
  9866. 288.51 s [vector] +++ OK, passed 100 tests.
  9867. 288.53 s [vector] mut_ifoldl': OK (0.01s)
  9868. 288.53 s [vector] +++ OK, passed 100 tests.
  9869. 288.53 s [vector] mut_foldM: OK (0.01s)
  9870. 288.53 s [vector] +++ OK, passed 100 tests.
  9871. 288.55 s [vector] mut_foldM': OK (0.01s)
  9872. 288.55 s [vector] +++ OK, passed 100 tests.
  9873. 288.57 s [vector] mut_foldrM: OK (0.01s)
  9874. 288.57 s [vector] +++ OK, passed 100 tests.
  9875. 288.57 s [vector] mut_foldrM': OK (0.01s)
  9876. 288.57 s [vector] +++ OK, passed 100 tests.
  9877. 288.59 s [vector] mut_ifoldM: OK (0.01s)
  9878. 288.59 s [vector] +++ OK, passed 100 tests.
  9879. 288.60 s [vector] mut_ifoldM': OK (0.01s)
  9880. 288.60 s [vector] +++ OK, passed 100 tests.
  9881. 288.61 s [vector] mut_ifoldrM: OK (0.01s)
  9882. 288.61 s [vector] +++ OK, passed 100 tests.
  9883. 288.61 s [vector] mut_ifoldrM': OK (0.01s)
  9884. 288.61 s [vector] +++ OK, passed 100 tests.
  9885. 288.61 s [vector] compare: OK
  9886. 288.62 s [vector] +++ OK, passed 100 tests.
  9887. 288.62 s [vector] maximum: OK
  9888. 288.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9889. 288.62 s [vector] minimum: OK
  9890. 288.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9891. 288.62 s [vector] minIndex: OK
  9892. 288.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9893. 288.62 s [vector] maxIndex: OK
  9894. 288.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9895. 288.62 s [vector] maximumBy: OK
  9896. 288.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9897. 288.62 s [vector] minimumBy: OK
  9898. 288.62 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9899. 288.62 s [vector] maximumOn: OK
  9900. 288.62 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9901. 288.62 s [vector] minimumOn: OK
  9902. 288.62 s [vector] +++ OK, passed 100 tests; 27 discarded.
  9903. 288.62 s [vector] maxIndexBy: OK
  9904. 288.62 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9905. 288.62 s [vector] minIndexBy: OK
  9906. 288.62 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9907. 288.62 s [vector] ListFirstMaxIndexWins: OK
  9908. 288.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9909. 288.62 s [vector] FalseListFirstMaxIndexWins: OK
  9910. 288.62 s [vector] +++ OK, failed as expected. (after 1 test):
  9911. 288.62 s [vector] Exception:
  9912. 288.62 s [vector] Prelude.foldr1: empty list
  9913. 288.62 s [vector] CallStack (from HasCallStack):
  9914. 288.62 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  9915. 288.62 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  9916. 288.62 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  9917. 288.62 s [vector] []
  9918. 288.63 s [vector] mempty: OK
  9919. 288.63 s [vector] +++ OK, passed 1 test.
  9920. 288.63 s [vector] mappend: OK
  9921. 288.63 s [vector] +++ OK, passed 100 tests.
  9922. 288.64 s [vector] mconcat: OK (0.02s)
  9923. 288.64 s [vector] +++ OK, passed 100 tests.
  9924. 288.64 s [vector] glength: OK
  9925. 288.64 s [vector] +++ OK, passed 100 tests.
  9926. 288.64 s [vector] sum: OK
  9927. 288.64 s [vector] +++ OK, passed 100 tests.
  9928. 288.64 s [vector] product: OK
  9929. 288.64 s [vector] +++ OK, passed 100 tests.
  9930. 288.64 s [vector] enumFromN: OK
  9931. 288.64 s [vector] +++ OK, passed 100 tests.
  9932. 288.64 s [vector] enumFromThenN: OK
  9933. 288.65 s [vector] +++ OK, passed 100 tests.
  9934. 288.65 s [vector] enumFromTo: OK
  9935. 288.65 s [vector] +++ OK, passed 100 tests.
  9936. 288.65 s [vector] enumFromThenTo: OK
  9937. 288.65 s [vector] +++ OK, passed 100 tests.
  9938. 288.65 s [vector] unstream
  9939. 288.65 s [vector] unstream == vunstream (exact): OK
  9940. 288.65 s [vector] +++ OK, passed 100 tests.
  9941. 288.65 s [vector] unstream == vunstream (unknown): OK
  9942. 288.65 s [vector] +++ OK, passed 100 tests.
  9943. 288.65 s [vector] unstreamR ~= vunstream (exact): OK
  9944. 288.65 s [vector] +++ OK, passed 100 tests.
  9945. 288.65 s [vector] unstreamR ~= vunstream (unknown): OK
  9946. 288.65 s [vector] +++ OK, passed 100 tests.
  9947. 288.65 s [vector] Tests.Vector.Strict
  9948. 288.65 s [vector] Bool
  9949. 288.65 s [vector] fromList.toList == id: OK
  9950. 288.65 s [vector] +++ OK, passed 100 tests.
  9951. 288.65 s [vector] toList.fromList == id: OK
  9952. 288.65 s [vector] +++ OK, passed 100 tests.
  9953. 288.65 s [vector] unstream.stream == id: OK
  9954. 288.65 s [vector] +++ OK, passed 100 tests.
  9955. 288.65 s [vector] stream.unstream == id: OK
  9956. 288.65 s [vector] +++ OK, passed 100 tests.
  9957. 288.65 s [vector] eq: OK
  9958. 288.65 s [vector] +++ OK, passed 100 tests.
  9959. 288.65 s [vector] length: OK
  9960. 288.65 s [vector] +++ OK, passed 100 tests.
  9961. 288.65 s [vector] null: OK
  9962. 288.65 s [vector] +++ OK, passed 100 tests.
  9963. 288.65 s [vector] index: OK
  9964. 288.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9965. 288.65 s [vector] safeIndex: OK
  9966. 288.65 s [vector] +++ OK, passed 100 tests.
  9967. 288.65 s [vector] head: OK
  9968. 288.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9969. 288.65 s [vector] last: OK
  9970. 288.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9971. 288.65 s [vector] unsafeIndex: OK
  9972. 288.65 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9973. 288.65 s [vector] unsafeHead: OK
  9974. 288.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9975. 288.65 s [vector] unsafeLast: OK
  9976. 288.65 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9977. 288.65 s [vector] slice: OK
  9978. 288.65 s [vector] +++ OK, passed 100 tests.
  9979. 288.65 s [vector] init: OK
  9980. 288.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9981. 288.65 s [vector] tail: OK
  9982. 288.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9983. 288.65 s [vector] take: OK
  9984. 288.65 s [vector] +++ OK, passed 100 tests.
  9985. 288.65 s [vector] drop: OK
  9986. 288.65 s [vector] +++ OK, passed 100 tests.
  9987. 288.65 s [vector] splitAt: OK
  9988. 288.65 s [vector] +++ OK, passed 100 tests.
  9989. 288.65 s [vector] empty: OK
  9990. 288.65 s [vector] +++ OK, passed 1 test.
  9991. 288.65 s [vector] singleton: OK
  9992. 288.65 s [vector] +++ OK, passed 100 tests.
  9993. 288.65 s [vector] replicate: OK
  9994. 288.66 s [vector] +++ OK, passed 100 tests.
  9995. 288.66 s [vector] generate: OK
  9996. 288.66 s [vector] +++ OK, passed 100 tests.
  9997. 288.66 s [vector] iterateN: OK
  9998. 288.67 s [vector] +++ OK, passed 100 tests.
  9999. 288.67 s [vector] iterateNM: OK
  10000. 288.67 s [vector] +++ OK, passed 100 tests.
  10001. 288.69 s [vector] generateM: OK (0.01s)
  10002. 288.69 s [vector] +++ OK, passed 100 tests.
  10003. 288.69 s [vector] replicateM: OK (0.02s)
  10004. 288.69 s [vector] +++ OK, passed 100 tests.
  10005. 288.69 s [vector] create: OK
  10006. 288.69 s [vector] +++ OK, passed 100 tests.
  10007. 288.69 s [vector] createT: OK
  10008. 288.69 s [vector] +++ OK, passed 100 tests.
  10009. 288.69 s [vector] unfoldr: OK
  10010. 288.69 s [vector] +++ OK, passed 100 tests.
  10011. 288.69 s [vector] unfoldrN: OK
  10012. 288.69 s [vector] +++ OK, passed 100 tests.
  10013. 288.70 s [vector] unfoldrExactN: OK
  10014. 288.70 s [vector] +++ OK, passed 100 tests.
  10015. 288.70 s [vector] unfoldrM: OK
  10016. 288.70 s [vector] +++ OK, passed 100 tests.
  10017. 288.71 s [vector] unfoldrNM: OK
  10018. 288.71 s [vector] +++ OK, passed 100 tests.
  10019. 288.71 s [vector] unfoldrExactNM: OK (0.01s)
  10020. 288.72 s [vector] +++ OK, passed 100 tests.
  10021. 288.72 s [vector] constructN: OK
  10022. 288.72 s [vector] +++ OK, passed 100 tests.
  10023. 288.72 s [vector] constructrN: OK
  10024. 288.72 s [vector] +++ OK, passed 100 tests.
  10025. 288.72 s [vector] cons: OK
  10026. 288.72 s [vector] +++ OK, passed 100 tests.
  10027. 288.72 s [vector] snoc: OK
  10028. 288.72 s [vector] +++ OK, passed 100 tests.
  10029. 288.72 s [vector] append: OK
  10030. 288.73 s [vector] +++ OK, passed 100 tests.
  10031. 288.73 s [vector] concat: OK
  10032. 288.73 s [vector] +++ OK, passed 100 tests.
  10033. 288.73 s [vector] force: OK
  10034. 288.73 s [vector] +++ OK, passed 100 tests.
  10035. 288.73 s [vector] upd: OK
  10036. 288.73 s [vector] +++ OK, passed 100 tests.
  10037. 288.73 s [vector] accum: OK
  10038. 288.73 s [vector] +++ OK, passed 100 tests.
  10039. 288.73 s [vector] reverse: OK
  10040. 288.74 s [vector] +++ OK, passed 100 tests.
  10041. 288.74 s [vector] backpermute: OK
  10042. 288.74 s [vector] +++ OK, passed 100 tests.
  10043. 288.74 s [vector] map: OK
  10044. 288.74 s [vector] +++ OK, passed 100 tests.
  10045. 288.74 s [vector] imap: OK
  10046. 288.74 s [vector] +++ OK, passed 100 tests.
  10047. 288.74 s [vector] concatMap: OK
  10048. 288.74 s [vector] +++ OK, passed 100 tests.
  10049. 288.75 s [vector] mapM: OK
  10050. 288.75 s [vector] +++ OK, passed 100 tests.
  10051. 288.75 s [vector] mapM_: OK
  10052. 288.75 s [vector] +++ OK, passed 100 tests.
  10053. 288.75 s [vector] forM: OK
  10054. 288.75 s [vector] +++ OK, passed 100 tests.
  10055. 288.76 s [vector] forM_: OK
  10056. 288.76 s [vector] +++ OK, passed 100 tests.
  10057. 288.77 s [vector] imapM: OK
  10058. 288.77 s [vector] +++ OK, passed 100 tests.
  10059. 288.77 s [vector] imapM_: OK
  10060. 288.77 s [vector] +++ OK, passed 100 tests.
  10061. 288.77 s [vector] zipWith: OK
  10062. 288.77 s [vector] +++ OK, passed 100 tests.
  10063. 288.77 s [vector] zipWith3: OK
  10064. 288.77 s [vector] +++ OK, passed 100 tests.
  10065. 288.77 s [vector] izipWith: OK
  10066. 288.77 s [vector] +++ OK, passed 100 tests.
  10067. 288.77 s [vector] izipWith3: OK
  10068. 288.77 s [vector] +++ OK, passed 100 tests.
  10069. 288.78 s [vector] izipWithM: OK
  10070. 288.78 s [vector] +++ OK, passed 100 tests.
  10071. 288.78 s [vector] izipWithM_: OK
  10072. 288.78 s [vector] +++ OK, passed 100 tests.
  10073. 288.78 s [vector] zipWithM: OK
  10074. 288.79 s [vector] +++ OK, passed 100 tests.
  10075. 288.79 s [vector] zipWithM_: OK
  10076. 288.79 s [vector] +++ OK, passed 100 tests.
  10077. 288.79 s [vector] filter: OK
  10078. 288.79 s [vector] +++ OK, passed 100 tests.
  10079. 288.79 s [vector] ifilter: OK
  10080. 288.79 s [vector] +++ OK, passed 100 tests.
  10081. 288.81 s [vector] filterM: OK (0.01s)
  10082. 288.81 s [vector] +++ OK, passed 100 tests.
  10083. 288.81 s [vector] uniq: OK
  10084. 288.81 s [vector] +++ OK, passed 100 tests.
  10085. 288.81 s [vector] mapMaybe: OK
  10086. 288.81 s [vector] +++ OK, passed 100 tests.
  10087. 288.81 s [vector] imapMaybe: OK
  10088. 288.81 s [vector] +++ OK, passed 100 tests.
  10089. 288.81 s [vector] takeWhile: OK
  10090. 288.81 s [vector] +++ OK, passed 100 tests.
  10091. 288.81 s [vector] dropWhile: OK
  10092. 288.81 s [vector] +++ OK, passed 100 tests.
  10093. 288.81 s [vector] partition: OK
  10094. 288.81 s [vector] +++ OK, passed 100 tests.
  10095. 288.81 s [vector] partitionWith: OK
  10096. 288.81 s [vector] +++ OK, passed 100 tests.
  10097. 288.81 s [vector] span: OK
  10098. 288.81 s [vector] +++ OK, passed 100 tests.
  10099. 288.81 s [vector] break: OK
  10100. 288.81 s [vector] +++ OK, passed 100 tests.
  10101. 288.81 s [vector] spanR: OK
  10102. 288.81 s [vector] +++ OK, passed 100 tests.
  10103. 288.81 s [vector] breakR: OK
  10104. 288.81 s [vector] +++ OK, passed 100 tests.
  10105. 288.81 s [vector] groupBy: OK
  10106. 288.81 s [vector] +++ OK, passed 100 tests.
  10107. 288.82 s [vector] elem: OK
  10108. 288.82 s [vector] +++ OK, passed 100 tests.
  10109. 288.82 s [vector] notElem: OK
  10110. 288.82 s [vector] +++ OK, passed 100 tests.
  10111. 288.82 s [vector] find: OK
  10112. 288.82 s [vector] +++ OK, passed 100 tests.
  10113. 288.82 s [vector] findIndex: OK
  10114. 288.82 s [vector] +++ OK, passed 100 tests.
  10115. 288.82 s [vector] findIndexR: OK
  10116. 288.82 s [vector] +++ OK, passed 100 tests.
  10117. 288.82 s [vector] findIndices: OK
  10118. 288.82 s [vector] +++ OK, passed 100 tests.
  10119. 288.82 s [vector] elemIndex: OK
  10120. 288.82 s [vector] +++ OK, passed 100 tests.
  10121. 288.82 s [vector] elemIndices: OK
  10122. 288.82 s [vector] +++ OK, passed 100 tests.
  10123. 288.82 s [vector] foldl: OK
  10124. 288.82 s [vector] +++ OK, passed 100 tests.
  10125. 288.83 s [vector] foldl1: OK
  10126. 288.83 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10127. 288.83 s [vector] foldl': OK
  10128. 288.83 s [vector] +++ OK, passed 100 tests.
  10129. 288.83 s [vector] foldl1': OK
  10130. 288.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10131. 288.83 s [vector] foldr: OK
  10132. 288.83 s [vector] +++ OK, passed 100 tests.
  10133. 288.83 s [vector] foldr1: OK
  10134. 288.83 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10135. 288.83 s [vector] foldr': OK
  10136. 288.83 s [vector] +++ OK, passed 100 tests.
  10137. 288.83 s [vector] foldr1': OK
  10138. 288.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10139. 288.83 s [vector] ifoldl: OK
  10140. 288.83 s [vector] +++ OK, passed 100 tests.
  10141. 288.83 s [vector] ifoldl': OK
  10142. 288.83 s [vector] +++ OK, passed 100 tests.
  10143. 288.83 s [vector] ifoldr: OK
  10144. 288.84 s [vector] +++ OK, passed 100 tests.
  10145. 288.84 s [vector] ifoldr': OK
  10146. 288.84 s [vector] +++ OK, passed 100 tests.
  10147. 288.84 s [vector] ifoldM: OK
  10148. 288.84 s [vector] +++ OK, passed 100 tests.
  10149. 288.85 s [vector] ifoldM': OK
  10150. 288.85 s [vector] +++ OK, passed 100 tests.
  10151. 288.85 s [vector] ifoldM_: OK
  10152. 288.85 s [vector] +++ OK, passed 100 tests.
  10153. 288.86 s [vector] ifoldM'_: OK (0.01s)
  10154. 288.86 s [vector] +++ OK, passed 100 tests.
  10155. 288.86 s [vector] all: OK
  10156. 288.86 s [vector] +++ OK, passed 100 tests.
  10157. 288.86 s [vector] any: OK
  10158. 288.86 s [vector] +++ OK, passed 100 tests.
  10159. 288.86 s [vector] prescanl: OK
  10160. 288.86 s [vector] +++ OK, passed 100 tests.
  10161. 288.86 s [vector] prescanl': OK
  10162. 288.86 s [vector] +++ OK, passed 100 tests.
  10163. 288.87 s [vector] postscanl: OK
  10164. 288.87 s [vector] +++ OK, passed 100 tests.
  10165. 288.87 s [vector] postscanl': OK
  10166. 288.87 s [vector] +++ OK, passed 100 tests.
  10167. 288.87 s [vector] scanl: OK
  10168. 288.87 s [vector] +++ OK, passed 100 tests.
  10169. 288.87 s [vector] scanl': OK
  10170. 288.87 s [vector] +++ OK, passed 100 tests.
  10171. 288.87 s [vector] scanl1: OK
  10172. 288.87 s [vector] +++ OK, passed 100 tests.
  10173. 288.87 s [vector] scanl1': OK
  10174. 288.87 s [vector] +++ OK, passed 100 tests.
  10175. 288.87 s [vector] iscanl: OK
  10176. 288.87 s [vector] +++ OK, passed 100 tests.
  10177. 288.88 s [vector] iscanl': OK
  10178. 288.88 s [vector] +++ OK, passed 100 tests.
  10179. 288.88 s [vector] prescanr: OK
  10180. 288.88 s [vector] +++ OK, passed 100 tests.
  10181. 288.88 s [vector] prescanr': OK
  10182. 288.88 s [vector] +++ OK, passed 100 tests.
  10183. 288.88 s [vector] postscanr: OK
  10184. 288.88 s [vector] +++ OK, passed 100 tests.
  10185. 288.88 s [vector] postscanr': OK
  10186. 288.88 s [vector] +++ OK, passed 100 tests.
  10187. 288.88 s [vector] scanr: OK
  10188. 288.88 s [vector] +++ OK, passed 100 tests.
  10189. 288.89 s [vector] scanr': OK
  10190. 288.89 s [vector] +++ OK, passed 100 tests.
  10191. 288.89 s [vector] scanr1: OK
  10192. 288.89 s [vector] +++ OK, passed 100 tests.
  10193. 288.89 s [vector] scanr1': OK
  10194. 288.89 s [vector] +++ OK, passed 100 tests.
  10195. 288.89 s [vector] iscanr: OK
  10196. 288.89 s [vector] +++ OK, passed 100 tests.
  10197. 288.89 s [vector] iscanr': OK
  10198. 288.89 s [vector] +++ OK, passed 100 tests.
  10199. 288.89 s [vector] mut_read: OK
  10200. 288.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10201. 288.89 s [vector] mut_write: OK
  10202. 288.89 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10203. 288.89 s [vector] mut_modify: OK
  10204. 288.89 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10205. 288.89 s [vector] mut_generate: OK
  10206. 288.89 s [vector] +++ OK, passed 100 tests.
  10207. 288.90 s [vector] mut_generateM: OK
  10208. 288.90 s [vector] +++ OK, passed 100 tests.
  10209. 288.91 s [vector] mut_mapM_: OK (0.01s)
  10210. 288.91 s [vector] +++ OK, passed 100 tests.
  10211. 288.93 s [vector] mut_imapM_: OK (0.01s)
  10212. 288.93 s [vector] +++ OK, passed 100 tests.
  10213. 288.93 s [vector] mut_forM_: OK
  10214. 288.93 s [vector] +++ OK, passed 100 tests.
  10215. 288.94 s [vector] mut_iforM_: OK
  10216. 288.94 s [vector] +++ OK, passed 100 tests.
  10217. 288.94 s [vector] mut_foldr: OK
  10218. 288.94 s [vector] +++ OK, passed 100 tests.
  10219. 288.94 s [vector] mut_foldr': OK
  10220. 288.94 s [vector] +++ OK, passed 100 tests.
  10221. 288.94 s [vector] mut_foldl: OK
  10222. 288.94 s [vector] +++ OK, passed 100 tests.
  10223. 288.95 s [vector] mut_foldl': OK
  10224. 288.95 s [vector] +++ OK, passed 100 tests.
  10225. 288.95 s [vector] mut_ifoldr: OK
  10226. 288.95 s [vector] +++ OK, passed 100 tests.
  10227. 288.95 s [vector] mut_ifoldr': OK
  10228. 288.95 s [vector] +++ OK, passed 100 tests.
  10229. 288.96 s [vector] mut_ifoldl: OK
  10230. 288.96 s [vector] +++ OK, passed 100 tests.
  10231. 288.96 s [vector] mut_ifoldl': OK
  10232. 288.96 s [vector] +++ OK, passed 100 tests.
  10233. 288.97 s [vector] mut_foldM: OK
  10234. 288.97 s [vector] +++ OK, passed 100 tests.
  10235. 288.97 s [vector] mut_foldM': OK
  10236. 288.97 s [vector] +++ OK, passed 100 tests.
  10237. 288.97 s [vector] mut_foldrM: OK
  10238. 288.97 s [vector] +++ OK, passed 100 tests.
  10239. 288.97 s [vector] mut_foldrM': OK
  10240. 288.97 s [vector] +++ OK, passed 100 tests.
  10241. 288.97 s [vector] mut_ifoldM: OK
  10242. 288.97 s [vector] +++ OK, passed 100 tests.
  10243. 288.97 s [vector] mut_ifoldM': OK
  10244. 288.97 s [vector] +++ OK, passed 100 tests.
  10245. 288.98 s [vector] mut_ifoldrM: OK
  10246. 288.98 s [vector] +++ OK, passed 100 tests.
  10247. 288.98 s [vector] mut_ifoldrM': OK
  10248. 288.98 s [vector] +++ OK, passed 100 tests.
  10249. 288.98 s [vector] compare: OK
  10250. 288.98 s [vector] +++ OK, passed 100 tests.
  10251. 288.98 s [vector] maximum: OK
  10252. 288.98 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10253. 288.98 s [vector] minimum: OK
  10254. 288.98 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10255. 288.98 s [vector] minIndex: OK
  10256. 288.98 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10257. 288.98 s [vector] maxIndex: OK
  10258. 288.98 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10259. 288.98 s [vector] maximumBy: OK
  10260. 288.98 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10261. 288.98 s [vector] minimumBy: OK
  10262. 288.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10263. 288.98 s [vector] maximumOn: OK
  10264. 288.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10265. 288.98 s [vector] minimumOn: OK
  10266. 288.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10267. 288.98 s [vector] maxIndexBy: OK
  10268. 288.98 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10269. 288.98 s [vector] minIndexBy: OK
  10270. 288.98 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10271. 288.98 s [vector] ListFirstMaxIndexWins: OK
  10272. 288.98 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10273. 288.98 s [vector] FalseListFirstMaxIndexWins: OK
  10274. 288.98 s [vector] +++ OK, failed as expected. (after 1 test):
  10275. 288.99 s [vector] Exception:
  10276. 288.99 s [vector] Prelude.foldr1: empty list
  10277. 288.99 s [vector] CallStack (from HasCallStack):
  10278. 288.99 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  10279. 288.99 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  10280. 288.99 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10281. 288.99 s [vector] []
  10282. 288.99 s [vector] zip: OK
  10283. 288.99 s [vector] +++ OK, passed 100 tests.
  10284. 288.99 s [vector] zip3: OK
  10285. 288.99 s [vector] +++ OK, passed 100 tests.
  10286. 288.99 s [vector] unzip: OK
  10287. 288.99 s [vector] +++ OK, passed 100 tests.
  10288. 288.99 s [vector] unzip3: OK
  10289. 288.99 s [vector] +++ OK, passed 100 tests.
  10290. 288.99 s [vector] indexed: OK
  10291. 288.99 s [vector] +++ OK, passed 100 tests.
  10292. 288.99 s [vector] update: OK
  10293. 288.99 s [vector] +++ OK, passed 100 tests.
  10294. 288.99 s [vector] concat: OK
  10295. 288.99 s [vector] +++ OK, passed 100 tests.
  10296. 288.99 s [vector] mempty: OK
  10297. 288.99 s [vector] +++ OK, passed 1 test.
  10298. 288.99 s [vector] mappend: OK
  10299. 288.99 s [vector] +++ OK, passed 100 tests.
  10300. 289.00 s [vector] mconcat: OK
  10301. 289.00 s [vector] +++ OK, passed 100 tests.
  10302. 289.00 s [vector] fmap: OK
  10303. 289.00 s [vector] +++ OK, passed 100 tests.
  10304. 289.01 s [vector] return: OK
  10305. 289.01 s [vector] +++ OK, passed 100 tests.
  10306. 289.01 s [vector] bind: OK
  10307. 289.01 s [vector] +++ OK, passed 100 tests.
  10308. 289.01 s [vector] mzip: OK
  10309. 289.01 s [vector] +++ OK, passed 100 tests.
  10310. 289.01 s [vector] munzip: OK
  10311. 289.01 s [vector] +++ OK, passed 100 tests.
  10312. 289.01 s [vector] applicative_pure: OK
  10313. 289.01 s [vector] +++ OK, passed 100 tests.
  10314. 289.02 s [vector] applicative_appl: OK (0.01s)
  10315. 289.02 s [vector] +++ OK, passed 100 tests.
  10316. 289.02 s [vector] alternative_empty: OK
  10317. 289.02 s [vector] +++ OK, passed 1 test.
  10318. 289.02 s [vector] alternative_or: OK
  10319. 289.03 s [vector] +++ OK, passed 100 tests.
  10320. 289.05 s [vector] sequence: OK (0.01s)
  10321. 289.05 s [vector] +++ OK, passed 100 tests.
  10322. 289.05 s [vector] sequence_: OK
  10323. 289.05 s [vector] +++ OK, passed 100 tests.
  10324. 289.05 s [vector] glength: OK
  10325. 289.05 s [vector] +++ OK, passed 100 tests.
  10326. 289.05 s [vector] and: OK
  10327. 289.05 s [vector] +++ OK, passed 100 tests.
  10328. 289.05 s [vector] or: OK
  10329. 289.05 s [vector] +++ OK, passed 100 tests.
  10330. 289.05 s [vector] Int
  10331. 289.05 s [vector] fromList.toList == id: OK
  10332. 289.05 s [vector] +++ OK, passed 100 tests.
  10333. 289.05 s [vector] toList.fromList == id: OK
  10334. 289.05 s [vector] +++ OK, passed 100 tests.
  10335. 289.05 s [vector] unstream.stream == id: OK
  10336. 289.05 s [vector] +++ OK, passed 100 tests.
  10337. 289.05 s [vector] stream.unstream == id: OK
  10338. 289.05 s [vector] +++ OK, passed 100 tests.
  10339. 289.05 s [vector] eq: OK
  10340. 289.05 s [vector] +++ OK, passed 100 tests.
  10341. 289.05 s [vector] length: OK
  10342. 289.05 s [vector] +++ OK, passed 100 tests.
  10343. 289.05 s [vector] null: OK
  10344. 289.05 s [vector] +++ OK, passed 100 tests.
  10345. 289.05 s [vector] index: OK
  10346. 289.05 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10347. 289.05 s [vector] safeIndex: OK
  10348. 289.05 s [vector] +++ OK, passed 100 tests.
  10349. 289.05 s [vector] head: OK
  10350. 289.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10351. 289.05 s [vector] last: OK
  10352. 289.05 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10353. 289.05 s [vector] unsafeIndex: OK
  10354. 289.05 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10355. 289.05 s [vector] unsafeHead: OK
  10356. 289.05 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10357. 289.06 s [vector] unsafeLast: OK
  10358. 289.06 s [vector] +++ OK, passed 100 tests; 25 discarded.
  10359. 289.06 s [vector] slice: OK
  10360. 289.06 s [vector] +++ OK, passed 100 tests.
  10361. 289.06 s [vector] init: OK
  10362. 289.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10363. 289.06 s [vector] tail: OK
  10364. 289.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10365. 289.06 s [vector] take: OK
  10366. 289.06 s [vector] +++ OK, passed 100 tests.
  10367. 289.06 s [vector] drop: OK
  10368. 289.06 s [vector] +++ OK, passed 100 tests.
  10369. 289.06 s [vector] splitAt: OK
  10370. 289.06 s [vector] +++ OK, passed 100 tests.
  10371. 289.06 s [vector] empty: OK
  10372. 289.06 s [vector] +++ OK, passed 1 test.
  10373. 289.06 s [vector] singleton: OK
  10374. 289.06 s [vector] +++ OK, passed 100 tests.
  10375. 289.06 s [vector] replicate: OK
  10376. 289.06 s [vector] +++ OK, passed 100 tests.
  10377. 289.06 s [vector] generate: OK
  10378. 289.09 s [vector] +++ OK, passed 100 tests.
  10379. 289.10 s [vector] iterateN: OK
  10380. 289.10 s [vector] +++ OK, passed 100 tests.
  10381. 289.10 s [vector] iterateNM: OK (0.01s)
  10382. 289.10 s [vector] +++ OK, passed 100 tests.
  10383. 289.10 s [vector] generateM: OK (0.02s)
  10384. 289.10 s [vector] +++ OK, passed 100 tests.
  10385. 289.10 s [vector] replicateM: OK
  10386. 289.11 s [vector] +++ OK, passed 100 tests.
  10387. 289.11 s [vector] create: OK
  10388. 289.11 s [vector] +++ OK, passed 100 tests.
  10389. 289.11 s [vector] createT: OK
  10390. 289.11 s [vector] +++ OK, passed 100 tests.
  10391. 289.11 s [vector] unfoldr: OK
  10392. 289.11 s [vector] +++ OK, passed 100 tests.
  10393. 289.11 s [vector] unfoldrN: OK
  10394. 289.11 s [vector] +++ OK, passed 100 tests.
  10395. 289.11 s [vector] unfoldrExactN: OK
  10396. 289.11 s [vector] +++ OK, passed 100 tests.
  10397. 289.11 s [vector] unfoldrM: OK
  10398. 289.11 s [vector] +++ OK, passed 100 tests.
  10399. 289.11 s [vector] unfoldrNM: OK
  10400. 289.11 s [vector] +++ OK, passed 100 tests.
  10401. 289.12 s [vector] unfoldrExactNM: OK
  10402. 289.12 s [vector] +++ OK, passed 100 tests.
  10403. 289.13 s [vector] constructN: OK
  10404. 289.13 s [vector] +++ OK, passed 100 tests.
  10405. 289.13 s [vector] constructrN: OK
  10406. 289.13 s [vector] +++ OK, passed 100 tests.
  10407. 289.13 s [vector] cons: OK
  10408. 289.13 s [vector] +++ OK, passed 100 tests.
  10409. 289.13 s [vector] snoc: OK
  10410. 289.13 s [vector] +++ OK, passed 100 tests.
  10411. 289.13 s [vector] append: OK
  10412. 289.13 s [vector] +++ OK, passed 100 tests.
  10413. 289.14 s [vector] concat: OK
  10414. 289.14 s [vector] +++ OK, passed 100 tests.
  10415. 289.14 s [vector] force: OK
  10416. 289.14 s [vector] +++ OK, passed 100 tests.
  10417. 289.14 s [vector] upd: OK
  10418. 289.14 s [vector] +++ OK, passed 100 tests.
  10419. 289.14 s [vector] accum: OK
  10420. 289.14 s [vector] +++ OK, passed 100 tests.
  10421. 289.14 s [vector] reverse: OK
  10422. 289.14 s [vector] +++ OK, passed 100 tests.
  10423. 289.14 s [vector] backpermute: OK
  10424. 289.14 s [vector] +++ OK, passed 100 tests.
  10425. 289.15 s [vector] map: OK
  10426. 289.15 s [vector] +++ OK, passed 100 tests.
  10427. 289.15 s [vector] imap: OK
  10428. 289.15 s [vector] +++ OK, passed 100 tests.
  10429. 289.15 s [vector] concatMap: OK
  10430. 289.15 s [vector] +++ OK, passed 100 tests.
  10431. 289.15 s [vector] mapM: OK
  10432. 289.15 s [vector] +++ OK, passed 100 tests.
  10433. 289.16 s [vector] mapM_: OK (0.01s)
  10434. 289.17 s [vector] +++ OK, passed 100 tests.
  10435. 289.17 s [vector] forM: OK
  10436. 289.17 s [vector] +++ OK, passed 100 tests.
  10437. 289.18 s [vector] forM_: OK (0.01s)
  10438. 289.19 s [vector] +++ OK, passed 100 tests.
  10439. 289.19 s [vector] imapM: OK
  10440. 289.19 s [vector] +++ OK, passed 100 tests.
  10441. 289.19 s [vector] imapM_: OK (0.01s)
  10442. 289.19 s [vector] +++ OK, passed 100 tests.
  10443. 289.20 s [vector] zipWith: OK
  10444. 289.20 s [vector] +++ OK, passed 100 tests.
  10445. 289.20 s [vector] zipWith3: OK
  10446. 289.21 s [vector] +++ OK, passed 100 tests.
  10447. 289.21 s [vector] izipWith: OK
  10448. 289.21 s [vector] +++ OK, passed 100 tests.
  10449. 289.21 s [vector] izipWith3: OK
  10450. 289.21 s [vector] +++ OK, passed 100 tests.
  10451. 289.22 s [vector] izipWithM: OK
  10452. 289.22 s [vector] +++ OK, passed 100 tests.
  10453. 289.22 s [vector] izipWithM_: OK (0.01s)
  10454. 289.22 s [vector] +++ OK, passed 100 tests.
  10455. 289.22 s [vector] zipWithM: OK
  10456. 289.22 s [vector] +++ OK, passed 100 tests.
  10457. 289.22 s [vector] zipWithM_: OK
  10458. 289.23 s [vector] +++ OK, passed 100 tests.
  10459. 289.23 s [vector] filter: OK
  10460. 289.23 s [vector] +++ OK, passed 100 tests.
  10461. 289.23 s [vector] ifilter: OK
  10462. 289.23 s [vector] +++ OK, passed 100 tests.
  10463. 289.25 s [vector] filterM: OK (0.02s)
  10464. 289.25 s [vector] +++ OK, passed 100 tests.
  10465. 289.25 s [vector] uniq: OK
  10466. 289.25 s [vector] +++ OK, passed 100 tests.
  10467. 289.25 s [vector] mapMaybe: OK
  10468. 289.25 s [vector] +++ OK, passed 100 tests.
  10469. 289.26 s [vector] imapMaybe: OK
  10470. 289.26 s [vector] +++ OK, passed 100 tests.
  10471. 289.26 s [vector] takeWhile: OK
  10472. 289.26 s [vector] +++ OK, passed 100 tests.
  10473. 289.26 s [vector] dropWhile: OK
  10474. 289.26 s [vector] +++ OK, passed 100 tests.
  10475. 289.26 s [vector] partition: OK
  10476. 289.26 s [vector] +++ OK, passed 100 tests.
  10477. 289.26 s [vector] partitionWith: OK
  10478. 289.26 s [vector] +++ OK, passed 100 tests.
  10479. 289.26 s [vector] span: OK
  10480. 289.26 s [vector] +++ OK, passed 100 tests.
  10481. 289.26 s [vector] break: OK
  10482. 289.26 s [vector] +++ OK, passed 100 tests.
  10483. 289.26 s [vector] spanR: OK
  10484. 289.26 s [vector] +++ OK, passed 100 tests.
  10485. 289.26 s [vector] breakR: OK
  10486. 289.26 s [vector] +++ OK, passed 100 tests.
  10487. 289.26 s [vector] groupBy: OK
  10488. 289.26 s [vector] +++ OK, passed 100 tests.
  10489. 289.27 s [vector] elem: OK
  10490. 289.27 s [vector] +++ OK, passed 100 tests.
  10491. 289.27 s [vector] notElem: OK
  10492. 289.27 s [vector] +++ OK, passed 100 tests.
  10493. 289.27 s [vector] find: OK
  10494. 289.27 s [vector] +++ OK, passed 100 tests.
  10495. 289.27 s [vector] findIndex: OK
  10496. 289.27 s [vector] +++ OK, passed 100 tests.
  10497. 289.28 s [vector] findIndexR: OK
  10498. 289.28 s [vector] +++ OK, passed 100 tests.
  10499. 289.28 s [vector] findIndices: OK
  10500. 289.28 s [vector] +++ OK, passed 100 tests.
  10501. 289.28 s [vector] elemIndex: OK
  10502. 289.28 s [vector] +++ OK, passed 100 tests.
  10503. 289.28 s [vector] elemIndices: OK
  10504. 289.28 s [vector] +++ OK, passed 100 tests.
  10505. 289.28 s [vector] foldl: OK
  10506. 289.28 s [vector] +++ OK, passed 100 tests.
  10507. 289.28 s [vector] foldl1: OK
  10508. 289.28 s [vector] +++ OK, passed 100 tests; 25 discarded.
  10509. 289.28 s [vector] foldl': OK
  10510. 289.28 s [vector] +++ OK, passed 100 tests.
  10511. 289.28 s [vector] foldl1': OK
  10512. 289.28 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10513. 289.28 s [vector] foldr: OK
  10514. 289.28 s [vector] +++ OK, passed 100 tests.
  10515. 289.28 s [vector] foldr1: OK
  10516. 289.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10517. 289.28 s [vector] foldr': OK
  10518. 289.28 s [vector] +++ OK, passed 100 tests.
  10519. 289.28 s [vector] foldr1': OK
  10520. 289.29 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10521. 289.29 s [vector] ifoldl: OK
  10522. 289.29 s [vector] +++ OK, passed 100 tests.
  10523. 289.29 s [vector] ifoldl': OK
  10524. 289.29 s [vector] +++ OK, passed 100 tests.
  10525. 289.30 s [vector] ifoldr: OK
  10526. 289.30 s [vector] +++ OK, passed 100 tests.
  10527. 289.30 s [vector] ifoldr': OK
  10528. 289.30 s [vector] +++ OK, passed 100 tests.
  10529. 289.30 s [vector] ifoldM: OK
  10530. 289.30 s [vector] +++ OK, passed 100 tests.
  10531. 289.31 s [vector] ifoldM': OK
  10532. 289.31 s [vector] +++ OK, passed 100 tests.
  10533. 289.33 s [vector] ifoldM_: OK (0.01s)
  10534. 289.33 s [vector] +++ OK, passed 100 tests.
  10535. 289.33 s [vector] ifoldM'_: OK (0.01s)
  10536. 289.33 s [vector] +++ OK, passed 100 tests.
  10537. 289.33 s [vector] all: OK
  10538. 289.33 s [vector] +++ OK, passed 100 tests.
  10539. 289.33 s [vector] any: OK
  10540. 289.33 s [vector] +++ OK, passed 100 tests.
  10541. 289.33 s [vector] prescanl: OK
  10542. 289.33 s [vector] +++ OK, passed 100 tests.
  10543. 289.33 s [vector] prescanl': OK
  10544. 289.33 s [vector] +++ OK, passed 100 tests.
  10545. 289.34 s [vector] postscanl: OK
  10546. 289.34 s [vector] +++ OK, passed 100 tests.
  10547. 289.34 s [vector] postscanl': OK
  10548. 289.34 s [vector] +++ OK, passed 100 tests.
  10549. 289.34 s [vector] scanl: OK
  10550. 289.34 s [vector] +++ OK, passed 100 tests.
  10551. 289.34 s [vector] scanl': OK
  10552. 289.34 s [vector] +++ OK, passed 100 tests.
  10553. 289.34 s [vector] scanl1: OK
  10554. 289.35 s [vector] +++ OK, passed 100 tests.
  10555. 289.35 s [vector] scanl1': OK
  10556. 289.35 s [vector] +++ OK, passed 100 tests.
  10557. 289.35 s [vector] iscanl: OK
  10558. 289.36 s [vector] +++ OK, passed 100 tests.
  10559. 289.36 s [vector] iscanl': OK
  10560. 289.36 s [vector] +++ OK, passed 100 tests.
  10561. 289.36 s [vector] prescanr: OK
  10562. 289.36 s [vector] +++ OK, passed 100 tests.
  10563. 289.36 s [vector] prescanr': OK
  10564. 289.36 s [vector] +++ OK, passed 100 tests.
  10565. 289.36 s [vector] postscanr: OK
  10566. 289.36 s [vector] +++ OK, passed 100 tests.
  10567. 289.36 s [vector] postscanr': OK
  10568. 289.36 s [vector] +++ OK, passed 100 tests.
  10569. 289.37 s [vector] scanr: OK
  10570. 289.37 s [vector] +++ OK, passed 100 tests.
  10571. 289.37 s [vector] scanr': OK
  10572. 289.37 s [vector] +++ OK, passed 100 tests.
  10573. 289.37 s [vector] scanr1: OK
  10574. 289.37 s [vector] +++ OK, passed 100 tests.
  10575. 289.37 s [vector] scanr1': OK
  10576. 289.37 s [vector] +++ OK, passed 100 tests.
  10577. 289.38 s [vector] iscanr: OK
  10578. 289.38 s [vector] +++ OK, passed 100 tests.
  10579. 289.38 s [vector] iscanr': OK
  10580. 289.38 s [vector] +++ OK, passed 100 tests.
  10581. 289.38 s [vector] mut_read: OK
  10582. 289.38 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10583. 289.38 s [vector] mut_write: OK
  10584. 289.38 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10585. 289.38 s [vector] mut_modify: OK
  10586. 289.38 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10587. 289.39 s [vector] mut_generate: OK
  10588. 289.39 s [vector] +++ OK, passed 100 tests.
  10589. 289.39 s [vector] mut_generateM: OK
  10590. 289.39 s [vector] +++ OK, passed 100 tests.
  10591. 289.41 s [vector] mut_mapM_: OK (0.01s)
  10592. 289.41 s [vector] +++ OK, passed 100 tests.
  10593. 289.43 s [vector] mut_imapM_: OK (0.02s)
  10594. 289.43 s [vector] +++ OK, passed 100 tests.
  10595. 289.43 s [vector] mut_forM_: OK (0.01s)
  10596. 289.43 s [vector] +++ OK, passed 100 tests.
  10597. 289.45 s [vector] mut_iforM_: OK (0.01s)
  10598. 289.45 s [vector] +++ OK, passed 100 tests.
  10599. 289.45 s [vector] mut_foldr: OK
  10600. 289.45 s [vector] +++ OK, passed 100 tests.
  10601. 289.45 s [vector] mut_foldr': OK
  10602. 289.45 s [vector] +++ OK, passed 100 tests.
  10603. 289.45 s [vector] mut_foldl: OK
  10604. 289.45 s [vector] +++ OK, passed 100 tests.
  10605. 289.45 s [vector] mut_foldl': OK
  10606. 289.45 s [vector] +++ OK, passed 100 tests.
  10607. 289.45 s [vector] mut_ifoldr: OK
  10608. 289.45 s [vector] +++ OK, passed 100 tests.
  10609. 289.46 s [vector] mut_ifoldr': OK
  10610. 289.46 s [vector] +++ OK, passed 100 tests.
  10611. 289.46 s [vector] mut_ifoldl: OK
  10612. 289.46 s [vector] +++ OK, passed 100 tests.
  10613. 289.46 s [vector] mut_ifoldl': OK
  10614. 289.47 s [vector] +++ OK, passed 100 tests.
  10615. 289.47 s [vector] mut_foldM: OK
  10616. 289.47 s [vector] +++ OK, passed 100 tests.
  10617. 289.47 s [vector] mut_foldM': OK
  10618. 289.47 s [vector] +++ OK, passed 100 tests.
  10619. 289.47 s [vector] mut_foldrM: OK
  10620. 289.47 s [vector] +++ OK, passed 100 tests.
  10621. 289.48 s [vector] mut_foldrM': OK
  10622. 289.48 s [vector] +++ OK, passed 100 tests.
  10623. 289.48 s [vector] mut_ifoldM: OK
  10624. 289.48 s [vector] +++ OK, passed 100 tests.
  10625. 289.49 s [vector] mut_ifoldM': OK
  10626. 289.49 s [vector] +++ OK, passed 100 tests.
  10627. 289.49 s [vector] mut_ifoldrM: OK
  10628. 289.49 s [vector] +++ OK, passed 100 tests.
  10629. 289.49 s [vector] mut_ifoldrM': OK
  10630. 289.49 s [vector] +++ OK, passed 100 tests.
  10631. 289.49 s [vector] compare: OK
  10632. 289.49 s [vector] +++ OK, passed 100 tests.
  10633. 289.49 s [vector] maximum: OK
  10634. 289.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10635. 289.49 s [vector] minimum: OK
  10636. 289.49 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10637. 289.49 s [vector] minIndex: OK
  10638. 289.49 s [vector] +++ OK, passed 100 tests; 27 discarded.
  10639. 289.49 s [vector] maxIndex: OK
  10640. 289.49 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10641. 289.49 s [vector] maximumBy: OK
  10642. 289.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10643. 289.49 s [vector] minimumBy: OK
  10644. 289.49 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10645. 289.50 s [vector] maximumOn: OK
  10646. 289.50 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10647. 289.50 s [vector] minimumOn: OK
  10648. 289.50 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10649. 289.50 s [vector] maxIndexBy: OK
  10650. 289.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10651. 289.50 s [vector] minIndexBy: OK
  10652. 289.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10653. 289.50 s [vector] ListFirstMaxIndexWins: OK
  10654. 289.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10655. 289.50 s [vector] FalseListFirstMaxIndexWins: OK
  10656. 289.50 s [vector] +++ OK, failed as expected. (after 1 test):
  10657. 289.50 s [vector] Exception:
  10658. 289.50 s [vector] Prelude.foldr1: empty list
  10659. 289.50 s [vector] CallStack (from HasCallStack):
  10660. 289.50 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  10661. 289.50 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  10662. 289.50 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  10663. 289.50 s [vector] []
  10664. 289.50 s [vector] zip: OK
  10665. 289.50 s [vector] +++ OK, passed 100 tests.
  10666. 289.50 s [vector] zip3: OK
  10667. 289.50 s [vector] +++ OK, passed 100 tests.
  10668. 289.50 s [vector] unzip: OK
  10669. 289.50 s [vector] +++ OK, passed 100 tests.
  10670. 289.50 s [vector] unzip3: OK
  10671. 289.51 s [vector] +++ OK, passed 100 tests.
  10672. 289.51 s [vector] indexed: OK
  10673. 289.51 s [vector] +++ OK, passed 100 tests.
  10674. 289.51 s [vector] update: OK
  10675. 289.51 s [vector] +++ OK, passed 100 tests.
  10676. 289.52 s [vector] concat: OK (0.01s)
  10677. 289.52 s [vector] +++ OK, passed 100 tests.
  10678. 289.52 s [vector] mempty: OK
  10679. 289.52 s [vector] +++ OK, passed 1 test.
  10680. 289.52 s [vector] mappend: OK
  10681. 289.52 s [vector] +++ OK, passed 100 tests.
  10682. 289.52 s [vector] mconcat: OK
  10683. 289.53 s [vector] +++ OK, passed 100 tests.
  10684. 289.53 s [vector] fmap: OK
  10685. 289.53 s [vector] +++ OK, passed 100 tests.
  10686. 289.53 s [vector] return: OK
  10687. 289.53 s [vector] +++ OK, passed 100 tests.
  10688. 289.54 s [vector] bind: OK (0.02s)
  10689. 289.54 s [vector] +++ OK, passed 100 tests.
  10690. 289.54 s [vector] mzip: OK
  10691. 289.54 s [vector] +++ OK, passed 100 tests.
  10692. 289.54 s [vector] munzip: OK
  10693. 289.54 s [vector] +++ OK, passed 100 tests.
  10694. 289.54 s [vector] applicative_pure: OK
  10695. 289.54 s [vector] +++ OK, passed 100 tests.
  10696. 289.57 s [vector] applicative_appl: OK (0.02s)
  10697. 289.57 s [vector] +++ OK, passed 100 tests.
  10698. 289.57 s [vector] alternative_empty: OK
  10699. 289.57 s [vector] +++ OK, passed 1 test.
  10700. 289.60 s [vector] alternative_or: OK
  10701. 289.60 s [vector] +++ OK, passed 100 tests.
  10702. 289.61 s [vector] sequence: OK (0.03s)
  10703. 289.61 s [vector] +++ OK, passed 100 tests.
  10704. 289.61 s [vector] sequence_: OK (0.01s)
  10705. 289.61 s [vector] +++ OK, passed 100 tests.
  10706. 289.61 s [vector] glength: OK
  10707. 289.61 s [vector] +++ OK, passed 100 tests.
  10708. 289.61 s [vector] sum: OK
  10709. 289.61 s [vector] +++ OK, passed 100 tests.
  10710. 289.61 s [vector] product: OK
  10711. 289.61 s [vector] +++ OK, passed 100 tests.
  10712. 289.61 s [vector] enumFromN: OK
  10713. 289.61 s [vector] +++ OK, passed 100 tests.
  10714. 289.61 s [vector] enumFromThenN: OK
  10715. 289.61 s [vector] +++ OK, passed 100 tests.
  10716. 289.61 s [vector] enumFromTo: OK
  10717. 289.61 s [vector] +++ OK, passed 100 tests.
  10718. 289.61 s [vector] enumFromThenTo: OK
  10719. 289.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10720. 289.61 s [vector] unstream
  10721. 289.61 s [vector] unstream == vunstream (exact): OK
  10722. 289.61 s [vector] +++ OK, passed 100 tests.
  10723. 289.61 s [vector] unstream == vunstream (unknown): OK
  10724. 289.61 s [vector] +++ OK, passed 100 tests.
  10725. 289.61 s [vector] unstreamR ~= vunstream (exact): OK
  10726. 289.61 s [vector] +++ OK, passed 100 tests.
  10727. 289.62 s [vector] unstreamR ~= vunstream (unknown): OK
  10728. 289.62 s [vector] +++ OK, passed 100 tests.
  10729. 289.62 s [vector] Tests.Vector.Unboxed
  10730. 289.62 s [vector] ()
  10731. 289.62 s [vector] fromList.toList == id: OK
  10732. 289.62 s [vector] +++ OK, passed 100 tests.
  10733. 289.62 s [vector] toList.fromList == id: OK
  10734. 289.62 s [vector] +++ OK, passed 100 tests.
  10735. 289.62 s [vector] unstream.stream == id: OK
  10736. 289.62 s [vector] +++ OK, passed 100 tests.
  10737. 289.62 s [vector] stream.unstream == id: OK
  10738. 289.62 s [vector] +++ OK, passed 100 tests.
  10739. 289.62 s [vector] eq: OK
  10740. 289.62 s [vector] +++ OK, passed 100 tests.
  10741. 289.62 s [vector] length: OK
  10742. 289.62 s [vector] +++ OK, passed 100 tests.
  10743. 289.62 s [vector] null: OK
  10744. 289.62 s [vector] +++ OK, passed 100 tests.
  10745. 289.62 s [vector] index: OK
  10746. 289.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10747. 289.62 s [vector] safeIndex: OK
  10748. 289.62 s [vector] +++ OK, passed 100 tests.
  10749. 289.62 s [vector] head: OK
  10750. 289.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10751. 289.62 s [vector] last: OK
  10752. 289.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10753. 289.62 s [vector] unsafeIndex: OK
  10754. 289.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10755. 289.62 s [vector] unsafeHead: OK
  10756. 289.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10757. 289.62 s [vector] unsafeLast: OK
  10758. 289.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10759. 289.62 s [vector] slice: OK
  10760. 289.62 s [vector] +++ OK, passed 100 tests.
  10761. 289.62 s [vector] init: OK
  10762. 289.62 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10763. 289.62 s [vector] tail: OK
  10764. 289.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10765. 289.62 s [vector] take: OK
  10766. 289.62 s [vector] +++ OK, passed 100 tests.
  10767. 289.62 s [vector] drop: OK
  10768. 289.62 s [vector] +++ OK, passed 100 tests.
  10769. 289.62 s [vector] splitAt: OK
  10770. 289.62 s [vector] +++ OK, passed 100 tests.
  10771. 289.62 s [vector] empty: OK
  10772. 289.62 s [vector] +++ OK, passed 1 test.
  10773. 289.62 s [vector] singleton: OK
  10774. 289.62 s [vector] +++ OK, passed 100 tests.
  10775. 289.62 s [vector] replicate: OK
  10776. 289.62 s [vector] +++ OK, passed 100 tests.
  10777. 289.62 s [vector] generate: OK
  10778. 289.62 s [vector] +++ OK, passed 100 tests.
  10779. 289.63 s [vector] iterateN: OK
  10780. 289.63 s [vector] +++ OK, passed 100 tests.
  10781. 289.65 s [vector] iterateNM: OK (0.01s)
  10782. 289.65 s [vector] +++ OK, passed 100 tests.
  10783. 289.65 s [vector] generateM: OK (0.01s)
  10784. 289.65 s [vector] +++ OK, passed 100 tests.
  10785. 289.67 s [vector] replicateM: OK (0.02s)
  10786. 289.67 s [vector] +++ OK, passed 100 tests.
  10787. 289.67 s [vector] create: OK
  10788. 289.67 s [vector] +++ OK, passed 100 tests.
  10789. 289.67 s [vector] createT: OK
  10790. 289.67 s [vector] +++ OK, passed 100 tests.
  10791. 289.67 s [vector] unfoldr: OK
  10792. 289.67 s [vector] +++ OK, passed 100 tests.
  10793. 289.67 s [vector] unfoldrN: OK
  10794. 289.67 s [vector] +++ OK, passed 100 tests.
  10795. 289.67 s [vector] unfoldrExactN: OK
  10796. 289.67 s [vector] +++ OK, passed 100 tests.
  10797. 289.68 s [vector] unfoldrM: OK
  10798. 289.69 s [vector] +++ OK, passed 100 tests.
  10799. 289.70 s [vector] unfoldrNM: OK
  10800. 289.70 s [vector] +++ OK, passed 100 tests.
  10801. 289.70 s [vector] unfoldrExactNM: OK (0.01s)
  10802. 289.70 s [vector] +++ OK, passed 100 tests.
  10803. 289.70 s [vector] constructN: OK
  10804. 289.70 s [vector] +++ OK, passed 100 tests.
  10805. 289.70 s [vector] constructrN: OK
  10806. 289.70 s [vector] +++ OK, passed 100 tests.
  10807. 289.70 s [vector] cons: OK
  10808. 289.70 s [vector] +++ OK, passed 100 tests.
  10809. 289.70 s [vector] snoc: OK
  10810. 289.71 s [vector] +++ OK, passed 100 tests.
  10811. 289.71 s [vector] append: OK
  10812. 289.71 s [vector] +++ OK, passed 100 tests.
  10813. 289.71 s [vector] concat: OK (0.01s)
  10814. 289.71 s [vector] +++ OK, passed 100 tests.
  10815. 289.71 s [vector] force: OK
  10816. 289.71 s [vector] +++ OK, passed 100 tests.
  10817. 289.71 s [vector] upd: OK
  10818. 289.71 s [vector] +++ OK, passed 100 tests.
  10819. 289.71 s [vector] accum: OK
  10820. 289.71 s [vector] +++ OK, passed 100 tests.
  10821. 289.71 s [vector] reverse: OK
  10822. 289.71 s [vector] +++ OK, passed 100 tests.
  10823. 289.71 s [vector] backpermute: OK
  10824. 289.71 s [vector] +++ OK, passed 100 tests.
  10825. 289.72 s [vector] map: OK
  10826. 289.72 s [vector] +++ OK, passed 100 tests.
  10827. 289.72 s [vector] imap: OK
  10828. 289.72 s [vector] +++ OK, passed 100 tests.
  10829. 289.72 s [vector] concatMap: OK
  10830. 289.72 s [vector] +++ OK, passed 100 tests.
  10831. 289.72 s [vector] mapM: OK
  10832. 289.73 s [vector] +++ OK, passed 100 tests.
  10833. 289.73 s [vector] mapM_: OK
  10834. 289.73 s [vector] +++ OK, passed 100 tests.
  10835. 289.73 s [vector] forM: OK
  10836. 289.73 s [vector] +++ OK, passed 100 tests.
  10837. 289.74 s [vector] forM_: OK
  10838. 289.74 s [vector] +++ OK, passed 100 tests.
  10839. 289.74 s [vector] imapM: OK
  10840. 289.74 s [vector] +++ OK, passed 100 tests.
  10841. 289.75 s [vector] imapM_: OK
  10842. 289.75 s [vector] +++ OK, passed 100 tests.
  10843. 289.75 s [vector] zipWith: OK
  10844. 289.75 s [vector] +++ OK, passed 100 tests.
  10845. 289.75 s [vector] zipWith3: OK
  10846. 289.75 s [vector] +++ OK, passed 100 tests.
  10847. 289.75 s [vector] izipWith: OK
  10848. 289.75 s [vector] +++ OK, passed 100 tests.
  10849. 289.75 s [vector] izipWith3: OK
  10850. 289.75 s [vector] +++ OK, passed 100 tests.
  10851. 289.75 s [vector] izipWithM: OK
  10852. 289.75 s [vector] +++ OK, passed 100 tests.
  10853. 289.76 s [vector] izipWithM_: OK
  10854. 289.76 s [vector] +++ OK, passed 100 tests.
  10855. 289.77 s [vector] zipWithM: OK
  10856. 289.77 s [vector] +++ OK, passed 100 tests.
  10857. 289.77 s [vector] zipWithM_: OK
  10858. 289.77 s [vector] +++ OK, passed 100 tests.
  10859. 289.77 s [vector] filter: OK
  10860. 289.77 s [vector] +++ OK, passed 100 tests.
  10861. 289.77 s [vector] ifilter: OK
  10862. 289.77 s [vector] +++ OK, passed 100 tests.
  10863. 289.79 s [vector] filterM: OK (0.02s)
  10864. 289.79 s [vector] +++ OK, passed 100 tests.
  10865. 289.79 s [vector] uniq: OK
  10866. 289.79 s [vector] +++ OK, passed 100 tests.
  10867. 289.79 s [vector] mapMaybe: OK
  10868. 289.79 s [vector] +++ OK, passed 100 tests.
  10869. 289.79 s [vector] imapMaybe: OK
  10870. 289.79 s [vector] +++ OK, passed 100 tests.
  10871. 289.79 s [vector] takeWhile: OK
  10872. 289.79 s [vector] +++ OK, passed 100 tests.
  10873. 289.79 s [vector] dropWhile: OK
  10874. 289.79 s [vector] +++ OK, passed 100 tests.
  10875. 289.79 s [vector] partition: OK
  10876. 289.79 s [vector] +++ OK, passed 100 tests.
  10877. 289.79 s [vector] partitionWith: OK
  10878. 289.79 s [vector] +++ OK, passed 100 tests.
  10879. 289.79 s [vector] span: OK
  10880. 289.79 s [vector] +++ OK, passed 100 tests.
  10881. 289.79 s [vector] break: OK
  10882. 289.79 s [vector] +++ OK, passed 100 tests.
  10883. 289.79 s [vector] spanR: OK
  10884. 289.79 s [vector] +++ OK, passed 100 tests.
  10885. 289.79 s [vector] breakR: OK
  10886. 289.79 s [vector] +++ OK, passed 100 tests.
  10887. 289.79 s [vector] groupBy: OK
  10888. 289.79 s [vector] +++ OK, passed 100 tests.
  10889. 289.79 s [vector] elem: OK
  10890. 289.79 s [vector] +++ OK, passed 100 tests.
  10891. 289.80 s [vector] notElem: OK
  10892. 289.80 s [vector] +++ OK, passed 100 tests.
  10893. 289.80 s [vector] find: OK
  10894. 289.80 s [vector] +++ OK, passed 100 tests.
  10895. 289.80 s [vector] findIndex: OK
  10896. 289.80 s [vector] +++ OK, passed 100 tests.
  10897. 289.80 s [vector] findIndexR: OK
  10898. 289.80 s [vector] +++ OK, passed 100 tests.
  10899. 289.80 s [vector] findIndices: OK
  10900. 289.80 s [vector] +++ OK, passed 100 tests.
  10901. 289.80 s [vector] elemIndex: OK
  10902. 289.80 s [vector] +++ OK, passed 100 tests.
  10903. 289.80 s [vector] elemIndices: OK
  10904. 289.80 s [vector] +++ OK, passed 100 tests.
  10905. 289.80 s [vector] foldl: OK
  10906. 289.80 s [vector] +++ OK, passed 100 tests.
  10907. 289.80 s [vector] foldl1: OK
  10908. 289.80 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10909. 289.80 s [vector] foldl': OK
  10910. 289.80 s [vector] +++ OK, passed 100 tests.
  10911. 289.80 s [vector] foldl1': OK
  10912. 289.80 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10913. 289.80 s [vector] foldr: OK
  10914. 289.80 s [vector] +++ OK, passed 100 tests.
  10915. 289.80 s [vector] foldr1: OK
  10916. 289.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10917. 289.80 s [vector] foldr': OK
  10918. 289.80 s [vector] +++ OK, passed 100 tests.
  10919. 289.80 s [vector] foldr1': OK
  10920. 289.80 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10921. 289.80 s [vector] ifoldl: OK
  10922. 289.80 s [vector] +++ OK, passed 100 tests.
  10923. 289.80 s [vector] ifoldl': OK
  10924. 289.80 s [vector] +++ OK, passed 100 tests.
  10925. 289.81 s [vector] ifoldr: OK
  10926. 289.81 s [vector] +++ OK, passed 100 tests.
  10927. 289.81 s [vector] ifoldr': OK
  10928. 289.81 s [vector] +++ OK, passed 100 tests.
  10929. 289.81 s [vector] ifoldM: OK
  10930. 289.81 s [vector] +++ OK, passed 100 tests.
  10931. 289.81 s [vector] ifoldM': OK
  10932. 289.81 s [vector] +++ OK, passed 100 tests.
  10933. 289.83 s [vector] ifoldM_: OK (0.01s)
  10934. 289.83 s [vector] +++ OK, passed 100 tests.
  10935. 289.83 s [vector] ifoldM'_: OK
  10936. 289.83 s [vector] +++ OK, passed 100 tests.
  10937. 289.83 s [vector] all: OK
  10938. 289.83 s [vector] +++ OK, passed 100 tests.
  10939. 289.83 s [vector] any: OK
  10940. 289.83 s [vector] +++ OK, passed 100 tests.
  10941. 289.83 s [vector] prescanl: OK
  10942. 289.83 s [vector] +++ OK, passed 100 tests.
  10943. 289.83 s [vector] prescanl': OK
  10944. 289.83 s [vector] +++ OK, passed 100 tests.
  10945. 289.83 s [vector] postscanl: OK
  10946. 289.83 s [vector] +++ OK, passed 100 tests.
  10947. 289.83 s [vector] postscanl': OK
  10948. 289.83 s [vector] +++ OK, passed 100 tests.
  10949. 289.83 s [vector] scanl: OK
  10950. 289.83 s [vector] +++ OK, passed 100 tests.
  10951. 289.83 s [vector] scanl': OK
  10952. 289.83 s [vector] +++ OK, passed 100 tests.
  10953. 289.83 s [vector] scanl1: OK
  10954. 289.83 s [vector] +++ OK, passed 100 tests.
  10955. 289.83 s [vector] scanl1': OK
  10956. 289.83 s [vector] +++ OK, passed 100 tests.
  10957. 289.83 s [vector] iscanl: OK
  10958. 289.84 s [vector] +++ OK, passed 100 tests.
  10959. 289.84 s [vector] iscanl': OK
  10960. 289.84 s [vector] +++ OK, passed 100 tests.
  10961. 289.84 s [vector] prescanr: OK
  10962. 289.84 s [vector] +++ OK, passed 100 tests.
  10963. 289.84 s [vector] prescanr': OK
  10964. 289.84 s [vector] +++ OK, passed 100 tests.
  10965. 289.84 s [vector] postscanr: OK
  10966. 289.84 s [vector] +++ OK, passed 100 tests.
  10967. 289.84 s [vector] postscanr': OK
  10968. 289.84 s [vector] +++ OK, passed 100 tests.
  10969. 289.84 s [vector] scanr: OK
  10970. 289.84 s [vector] +++ OK, passed 100 tests.
  10971. 289.84 s [vector] scanr': OK
  10972. 289.84 s [vector] +++ OK, passed 100 tests.
  10973. 289.84 s [vector] scanr1: OK
  10974. 289.84 s [vector] +++ OK, passed 100 tests.
  10975. 289.84 s [vector] scanr1': OK
  10976. 289.84 s [vector] +++ OK, passed 100 tests.
  10977. 289.84 s [vector] iscanr: OK
  10978. 289.84 s [vector] +++ OK, passed 100 tests.
  10979. 289.85 s [vector] iscanr': OK
  10980. 289.85 s [vector] +++ OK, passed 100 tests.
  10981. 289.85 s [vector] mut_read: OK
  10982. 289.85 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10983. 289.85 s [vector] mut_write: OK
  10984. 289.85 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10985. 289.85 s [vector] mut_modify: OK
  10986. 289.85 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10987. 289.85 s [vector] mut_generate: OK
  10988. 289.85 s [vector] +++ OK, passed 100 tests.
  10989. 289.85 s [vector] mut_generateM: OK
  10990. 289.85 s [vector] +++ OK, passed 100 tests.
  10991. 289.86 s [vector] mut_mapM_: OK
  10992. 289.86 s [vector] +++ OK, passed 100 tests.
  10993. 289.87 s [vector] mut_imapM_: OK
  10994. 289.87 s [vector] +++ OK, passed 100 tests.
  10995. 289.87 s [vector] mut_forM_: OK
  10996. 289.87 s [vector] +++ OK, passed 100 tests.
  10997. 289.88 s [vector] mut_iforM_: OK
  10998. 289.88 s [vector] +++ OK, passed 100 tests.
  10999. 289.88 s [vector] mut_foldr: OK
  11000. 289.88 s [vector] +++ OK, passed 100 tests.
  11001. 289.88 s [vector] mut_foldr': OK
  11002. 289.88 s [vector] +++ OK, passed 100 tests.
  11003. 289.88 s [vector] mut_foldl: OK
  11004. 289.88 s [vector] +++ OK, passed 100 tests.
  11005. 289.88 s [vector] mut_foldl': OK
  11006. 289.88 s [vector] +++ OK, passed 100 tests.
  11007. 289.88 s [vector] mut_ifoldr: OK
  11008. 289.88 s [vector] +++ OK, passed 100 tests.
  11009. 289.89 s [vector] mut_ifoldr': OK
  11010. 289.89 s [vector] +++ OK, passed 100 tests.
  11011. 289.89 s [vector] mut_ifoldl: OK
  11012. 289.89 s [vector] +++ OK, passed 100 tests.
  11013. 289.89 s [vector] mut_ifoldl': OK
  11014. 289.89 s [vector] +++ OK, passed 100 tests.
  11015. 289.89 s [vector] mut_foldM: OK
  11016. 289.89 s [vector] +++ OK, passed 100 tests.
  11017. 289.89 s [vector] mut_foldM': OK
  11018. 289.89 s [vector] +++ OK, passed 100 tests.
  11019. 289.89 s [vector] mut_foldrM: OK
  11020. 289.89 s [vector] +++ OK, passed 100 tests.
  11021. 289.89 s [vector] mut_foldrM': OK
  11022. 289.89 s [vector] +++ OK, passed 100 tests.
  11023. 289.90 s [vector] mut_ifoldM: OK
  11024. 289.90 s [vector] +++ OK, passed 100 tests.
  11025. 289.90 s [vector] mut_ifoldM': OK
  11026. 289.90 s [vector] +++ OK, passed 100 tests.
  11027. 289.90 s [vector] mut_ifoldrM: OK
  11028. 289.90 s [vector] +++ OK, passed 100 tests.
  11029. 289.90 s [vector] mut_ifoldrM': OK
  11030. 289.90 s [vector] +++ OK, passed 100 tests.
  11031. 289.90 s [vector] compare: OK
  11032. 289.90 s [vector] +++ OK, passed 100 tests.
  11033. 289.90 s [vector] maximum: OK
  11034. 289.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11035. 289.90 s [vector] minimum: OK
  11036. 289.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11037. 289.90 s [vector] minIndex: OK
  11038. 289.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11039. 289.90 s [vector] maxIndex: OK
  11040. 289.90 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11041. 289.90 s [vector] maximumBy: OK
  11042. 289.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11043. 289.90 s [vector] minimumBy: OK
  11044. 289.90 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11045. 289.90 s [vector] maximumOn: OK
  11046. 289.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11047. 289.90 s [vector] minimumOn: OK
  11048. 289.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11049. 289.90 s [vector] maxIndexBy: OK
  11050. 289.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11051. 289.90 s [vector] minIndexBy: OK
  11052. 289.90 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11053. 289.90 s [vector] ListFirstMaxIndexWins: OK
  11054. 289.90 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11055. 289.90 s [vector] FalseListFirstMaxIndexWins: OK
  11056. 289.91 s [vector] +++ OK, failed as expected. (after 1 test):
  11057. 289.91 s [vector] Exception:
  11058. 289.91 s [vector] Prelude.foldr1: empty list
  11059. 289.91 s [vector] CallStack (from HasCallStack):
  11060. 289.91 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  11061. 289.91 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  11062. 289.91 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11063. 289.91 s [vector] []
  11064. 289.91 s [vector] zip: OK
  11065. 289.91 s [vector] +++ OK, passed 100 tests.
  11066. 289.91 s [vector] zip3: OK
  11067. 289.91 s [vector] +++ OK, passed 100 tests.
  11068. 289.91 s [vector] unzip: OK
  11069. 289.91 s [vector] +++ OK, passed 100 tests.
  11070. 289.91 s [vector] unzip3: OK
  11071. 289.91 s [vector] +++ OK, passed 100 tests.
  11072. 289.91 s [vector] indexed: OK
  11073. 289.91 s [vector] +++ OK, passed 100 tests.
  11074. 289.91 s [vector] update: OK
  11075. 289.91 s [vector] +++ OK, passed 100 tests.
  11076. 289.91 s [vector] mempty: OK
  11077. 289.91 s [vector] +++ OK, passed 1 test.
  11078. 289.91 s [vector] mappend: OK
  11079. 289.91 s [vector] +++ OK, passed 100 tests.
  11080. 289.92 s [vector] mconcat: OK
  11081. 289.92 s [vector] +++ OK, passed 100 tests.
  11082. 289.92 s [vector] glength: OK
  11083. 289.92 s [vector] +++ OK, passed 100 tests.
  11084. 289.92 s [vector] (Bool)
  11085. 289.92 s [vector] fromList.toList == id: OK
  11086. 289.92 s [vector] +++ OK, passed 100 tests.
  11087. 289.92 s [vector] toList.fromList == id: OK
  11088. 289.92 s [vector] +++ OK, passed 100 tests.
  11089. 289.92 s [vector] unstream.stream == id: OK
  11090. 289.92 s [vector] +++ OK, passed 100 tests.
  11091. 289.92 s [vector] stream.unstream == id: OK
  11092. 289.92 s [vector] +++ OK, passed 100 tests.
  11093. 289.92 s [vector] eq: OK
  11094. 289.92 s [vector] +++ OK, passed 100 tests.
  11095. 289.92 s [vector] length: OK
  11096. 289.92 s [vector] +++ OK, passed 100 tests.
  11097. 289.92 s [vector] null: OK
  11098. 289.92 s [vector] +++ OK, passed 100 tests.
  11099. 289.92 s [vector] index: OK
  11100. 289.93 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11101. 289.93 s [vector] safeIndex: OK
  11102. 289.93 s [vector] +++ OK, passed 100 tests.
  11103. 289.93 s [vector] head: OK
  11104. 289.93 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11105. 289.93 s [vector] last: OK
  11106. 289.93 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11107. 289.93 s [vector] unsafeIndex: OK
  11108. 289.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11109. 289.93 s [vector] unsafeHead: OK
  11110. 289.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11111. 289.93 s [vector] unsafeLast: OK
  11112. 289.93 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11113. 289.93 s [vector] slice: OK
  11114. 289.93 s [vector] +++ OK, passed 100 tests.
  11115. 289.93 s [vector] init: OK
  11116. 289.93 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11117. 289.93 s [vector] tail: OK
  11118. 289.93 s [vector] +++ OK, passed 100 tests; 10 discarded.
  11119. 289.93 s [vector] take: OK
  11120. 289.93 s [vector] +++ OK, passed 100 tests.
  11121. 289.93 s [vector] drop: OK
  11122. 289.93 s [vector] +++ OK, passed 100 tests.
  11123. 289.93 s [vector] splitAt: OK
  11124. 289.93 s [vector] +++ OK, passed 100 tests.
  11125. 289.93 s [vector] empty: OK
  11126. 289.93 s [vector] +++ OK, passed 1 test.
  11127. 289.93 s [vector] singleton: OK
  11128. 289.93 s [vector] +++ OK, passed 100 tests.
  11129. 289.93 s [vector] replicate: OK
  11130. 289.93 s [vector] +++ OK, passed 100 tests.
  11131. 289.93 s [vector] generate: OK
  11132. 289.93 s [vector] +++ OK, passed 100 tests.
  11133. 289.95 s [vector] iterateN: OK
  11134. 289.95 s [vector] +++ OK, passed 100 tests.
  11135. 289.95 s [vector] iterateNM: OK (0.02s)
  11136. 289.95 s [vector] +++ OK, passed 100 tests.
  11137. 289.97 s [vector] generateM: OK (0.01s)
  11138. 289.97 s [vector] +++ OK, passed 100 tests.
  11139. 289.97 s [vector] replicateM: OK
  11140. 289.97 s [vector] +++ OK, passed 100 tests.
  11141. 289.97 s [vector] create: OK
  11142. 289.97 s [vector] +++ OK, passed 100 tests.
  11143. 289.97 s [vector] createT: OK
  11144. 289.97 s [vector] +++ OK, passed 100 tests.
  11145. 289.97 s [vector] unfoldr: OK
  11146. 289.97 s [vector] +++ OK, passed 100 tests.
  11147. 289.97 s [vector] unfoldrN: OK
  11148. 289.97 s [vector] +++ OK, passed 100 tests.
  11149. 289.97 s [vector] unfoldrExactN: OK
  11150. 289.97 s [vector] +++ OK, passed 100 tests.
  11151. 289.97 s [vector] unfoldrM: OK
  11152. 289.97 s [vector] +++ OK, passed 100 tests.
  11153. 289.98 s [vector] unfoldrNM: OK
  11154. 289.98 s [vector] +++ OK, passed 100 tests.
  11155. 289.99 s [vector] unfoldrExactNM: OK (0.02s)
  11156. 289.99 s [vector] +++ OK, passed 100 tests.
  11157. 290.00 s [vector] constructN: OK
  11158. 290.00 s [vector] +++ OK, passed 100 tests.
  11159. 290.00 s [vector] constructrN: OK
  11160. 290.00 s [vector] +++ OK, passed 100 tests.
  11161. 290.01 s [vector] cons: OK
  11162. 290.01 s [vector] +++ OK, passed 100 tests.
  11163. 290.01 s [vector] snoc: OK
  11164. 290.01 s [vector] +++ OK, passed 100 tests.
  11165. 290.01 s [vector] append: OK
  11166. 290.01 s [vector] +++ OK, passed 100 tests.
  11167. 290.01 s [vector] concat: OK (0.01s)
  11168. 290.02 s [vector] +++ OK, passed 100 tests.
  11169. 290.02 s [vector] force: OK
  11170. 290.02 s [vector] +++ OK, passed 100 tests.
  11171. 290.02 s [vector] upd: OK
  11172. 290.02 s [vector] +++ OK, passed 100 tests.
  11173. 290.03 s [vector] accum: OK
  11174. 290.03 s [vector] +++ OK, passed 100 tests.
  11175. 290.03 s [vector] reverse: OK
  11176. 290.03 s [vector] +++ OK, passed 100 tests.
  11177. 290.04 s [vector] backpermute: OK
  11178. 290.04 s [vector] +++ OK, passed 100 tests.
  11179. 290.04 s [vector] map: OK
  11180. 290.05 s [vector] +++ OK, passed 100 tests.
  11181. 290.05 s [vector] imap: OK
  11182. 290.05 s [vector] +++ OK, passed 100 tests.
  11183. 290.05 s [vector] concatMap: OK
  11184. 290.05 s [vector] +++ OK, passed 100 tests.
  11185. 290.05 s [vector] mapM: OK
  11186. 290.05 s [vector] +++ OK, passed 100 tests.
  11187. 290.05 s [vector] mapM_: OK
  11188. 290.05 s [vector] +++ OK, passed 100 tests.
  11189. 290.05 s [vector] forM: OK
  11190. 290.05 s [vector] +++ OK, passed 100 tests.
  11191. 290.05 s [vector] forM_: OK (0.01s)
  11192. 290.05 s [vector] +++ OK, passed 100 tests.
  11193. 290.06 s [vector] imapM: OK
  11194. 290.06 s [vector] +++ OK, passed 100 tests.
  11195. 290.06 s [vector] imapM_: OK
  11196. 290.06 s [vector] +++ OK, passed 100 tests.
  11197. 290.06 s [vector] zipWith: OK
  11198. 290.06 s [vector] +++ OK, passed 100 tests.
  11199. 290.07 s [vector] zipWith3: OK
  11200. 290.07 s [vector] +++ OK, passed 100 tests.
  11201. 290.07 s [vector] izipWith: OK
  11202. 290.07 s [vector] +++ OK, passed 100 tests.
  11203. 290.07 s [vector] izipWith3: OK
  11204. 290.07 s [vector] +++ OK, passed 100 tests.
  11205. 290.07 s [vector] izipWithM: OK
  11206. 290.07 s [vector] +++ OK, passed 100 tests.
  11207. 290.08 s [vector] izipWithM_: OK
  11208. 290.08 s [vector] +++ OK, passed 100 tests.
  11209. 290.08 s [vector] zipWithM: OK
  11210. 290.08 s [vector] +++ OK, passed 100 tests.
  11211. 290.09 s [vector] zipWithM_: OK
  11212. 290.09 s [vector] +++ OK, passed 100 tests.
  11213. 290.09 s [vector] filter: OK
  11214. 290.09 s [vector] +++ OK, passed 100 tests.
  11215. 290.09 s [vector] ifilter: OK
  11216. 290.09 s [vector] +++ OK, passed 100 tests.
  11217. 290.11 s [vector] filterM: OK (0.02s)
  11218. 290.11 s [vector] +++ OK, passed 100 tests.
  11219. 290.11 s [vector] uniq: OK
  11220. 290.11 s [vector] +++ OK, passed 100 tests.
  11221. 290.11 s [vector] mapMaybe: OK
  11222. 290.11 s [vector] +++ OK, passed 100 tests.
  11223. 290.11 s [vector] imapMaybe: OK
  11224. 290.11 s [vector] +++ OK, passed 100 tests.
  11225. 290.11 s [vector] takeWhile: OK
  11226. 290.11 s [vector] +++ OK, passed 100 tests.
  11227. 290.12 s [vector] dropWhile: OK
  11228. 290.12 s [vector] +++ OK, passed 100 tests.
  11229. 290.12 s [vector] partition: OK
  11230. 290.12 s [vector] +++ OK, passed 100 tests.
  11231. 290.12 s [vector] partitionWith: OK
  11232. 290.12 s [vector] +++ OK, passed 100 tests.
  11233. 290.12 s [vector] span: OK
  11234. 290.12 s [vector] +++ OK, passed 100 tests.
  11235. 290.12 s [vector] break: OK
  11236. 290.12 s [vector] +++ OK, passed 100 tests.
  11237. 290.12 s [vector] spanR: OK
  11238. 290.12 s [vector] +++ OK, passed 100 tests.
  11239. 290.13 s [vector] breakR: OK
  11240. 290.13 s [vector] +++ OK, passed 100 tests.
  11241. 290.13 s [vector] groupBy: OK
  11242. 290.13 s [vector] +++ OK, passed 100 tests.
  11243. 290.13 s [vector] elem: OK
  11244. 290.13 s [vector] +++ OK, passed 100 tests.
  11245. 290.13 s [vector] notElem: OK
  11246. 290.13 s [vector] +++ OK, passed 100 tests.
  11247. 290.13 s [vector] find: OK
  11248. 290.13 s [vector] +++ OK, passed 100 tests.
  11249. 290.13 s [vector] findIndex: OK
  11250. 290.13 s [vector] +++ OK, passed 100 tests.
  11251. 290.13 s [vector] findIndexR: OK
  11252. 290.13 s [vector] +++ OK, passed 100 tests.
  11253. 290.13 s [vector] findIndices: OK
  11254. 290.13 s [vector] +++ OK, passed 100 tests.
  11255. 290.13 s [vector] elemIndex: OK
  11256. 290.13 s [vector] +++ OK, passed 100 tests.
  11257. 290.13 s [vector] elemIndices: OK
  11258. 290.13 s [vector] +++ OK, passed 100 tests.
  11259. 290.13 s [vector] foldl: OK
  11260. 290.14 s [vector] +++ OK, passed 100 tests.
  11261. 290.14 s [vector] foldl1: OK
  11262. 290.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11263. 290.14 s [vector] foldl': OK
  11264. 290.14 s [vector] +++ OK, passed 100 tests.
  11265. 290.14 s [vector] foldl1': OK
  11266. 290.14 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11267. 290.14 s [vector] foldr: OK
  11268. 290.14 s [vector] +++ OK, passed 100 tests.
  11269. 290.14 s [vector] foldr1: OK
  11270. 290.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11271. 290.14 s [vector] foldr': OK
  11272. 290.14 s [vector] +++ OK, passed 100 tests.
  11273. 290.15 s [vector] foldr1': OK
  11274. 290.15 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11275. 290.15 s [vector] ifoldl: OK
  11276. 290.15 s [vector] +++ OK, passed 100 tests.
  11277. 290.15 s [vector] ifoldl': OK
  11278. 290.15 s [vector] +++ OK, passed 100 tests.
  11279. 290.15 s [vector] ifoldr: OK
  11280. 290.15 s [vector] +++ OK, passed 100 tests.
  11281. 290.16 s [vector] ifoldr': OK
  11282. 290.16 s [vector] +++ OK, passed 100 tests.
  11283. 290.16 s [vector] ifoldM: OK
  11284. 290.16 s [vector] +++ OK, passed 100 tests.
  11285. 290.16 s [vector] ifoldM': OK
  11286. 290.16 s [vector] +++ OK, passed 100 tests.
  11287. 290.17 s [vector] ifoldM_: OK (0.01s)
  11288. 290.17 s [vector] +++ OK, passed 100 tests.
  11289. 290.17 s [vector] ifoldM'_: OK
  11290. 290.17 s [vector] +++ OK, passed 100 tests.
  11291. 290.17 s [vector] all: OK
  11292. 290.17 s [vector] +++ OK, passed 100 tests.
  11293. 290.17 s [vector] any: OK
  11294. 290.17 s [vector] +++ OK, passed 100 tests.
  11295. 290.17 s [vector] prescanl: OK
  11296. 290.17 s [vector] +++ OK, passed 100 tests.
  11297. 290.17 s [vector] prescanl': OK
  11298. 290.18 s [vector] +++ OK, passed 100 tests.
  11299. 290.18 s [vector] postscanl: OK
  11300. 290.18 s [vector] +++ OK, passed 100 tests.
  11301. 290.18 s [vector] postscanl': OK
  11302. 290.18 s [vector] +++ OK, passed 100 tests.
  11303. 290.18 s [vector] scanl: OK
  11304. 290.18 s [vector] +++ OK, passed 100 tests.
  11305. 290.18 s [vector] scanl': OK
  11306. 290.18 s [vector] +++ OK, passed 100 tests.
  11307. 290.18 s [vector] scanl1: OK
  11308. 290.18 s [vector] +++ OK, passed 100 tests.
  11309. 290.18 s [vector] scanl1': OK
  11310. 290.18 s [vector] +++ OK, passed 100 tests.
  11311. 290.19 s [vector] iscanl: OK
  11312. 290.19 s [vector] +++ OK, passed 100 tests.
  11313. 290.19 s [vector] iscanl': OK
  11314. 290.19 s [vector] +++ OK, passed 100 tests.
  11315. 290.19 s [vector] prescanr: OK
  11316. 290.19 s [vector] +++ OK, passed 100 tests.
  11317. 290.19 s [vector] prescanr': OK
  11318. 290.19 s [vector] +++ OK, passed 100 tests.
  11319. 290.20 s [vector] postscanr: OK
  11320. 290.20 s [vector] +++ OK, passed 100 tests.
  11321. 290.20 s [vector] postscanr': OK
  11322. 290.20 s [vector] +++ OK, passed 100 tests.
  11323. 290.20 s [vector] scanr: OK
  11324. 290.20 s [vector] +++ OK, passed 100 tests.
  11325. 290.20 s [vector] scanr': OK
  11326. 290.20 s [vector] +++ OK, passed 100 tests.
  11327. 290.20 s [vector] scanr1: OK
  11328. 290.20 s [vector] +++ OK, passed 100 tests.
  11329. 290.20 s [vector] scanr1': OK
  11330. 290.20 s [vector] +++ OK, passed 100 tests.
  11331. 290.21 s [vector] iscanr: OK
  11332. 290.21 s [vector] +++ OK, passed 100 tests.
  11333. 290.21 s [vector] iscanr': OK
  11334. 290.21 s [vector] +++ OK, passed 100 tests.
  11335. 290.21 s [vector] mut_read: OK
  11336. 290.21 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11337. 290.21 s [vector] mut_write: OK
  11338. 290.21 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11339. 290.21 s [vector] mut_modify: OK
  11340. 290.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11341. 290.21 s [vector] mut_generate: OK
  11342. 290.21 s [vector] +++ OK, passed 100 tests.
  11343. 290.22 s [vector] mut_generateM: OK
  11344. 290.22 s [vector] +++ OK, passed 100 tests.
  11345. 290.23 s [vector] mut_mapM_: OK
  11346. 290.23 s [vector] +++ OK, passed 100 tests.
  11347. 290.24 s [vector] mut_imapM_: OK
  11348. 290.25 s [vector] +++ OK, passed 100 tests.
  11349. 290.25 s [vector] mut_forM_: OK
  11350. 290.25 s [vector] +++ OK, passed 100 tests.
  11351. 290.25 s [vector] mut_iforM_: OK
  11352. 290.25 s [vector] +++ OK, passed 100 tests.
  11353. 290.25 s [vector] mut_foldr: OK
  11354. 290.25 s [vector] +++ OK, passed 100 tests.
  11355. 290.25 s [vector] mut_foldr': OK
  11356. 290.25 s [vector] +++ OK, passed 100 tests.
  11357. 290.26 s [vector] mut_foldl: OK
  11358. 290.26 s [vector] +++ OK, passed 100 tests.
  11359. 290.26 s [vector] mut_foldl': OK
  11360. 290.26 s [vector] +++ OK, passed 100 tests.
  11361. 290.26 s [vector] mut_ifoldr: OK
  11362. 290.26 s [vector] +++ OK, passed 100 tests.
  11363. 290.26 s [vector] mut_ifoldr': OK
  11364. 290.26 s [vector] +++ OK, passed 100 tests.
  11365. 290.26 s [vector] mut_ifoldl: OK
  11366. 290.26 s [vector] +++ OK, passed 100 tests.
  11367. 290.27 s [vector] mut_ifoldl': OK
  11368. 290.27 s [vector] +++ OK, passed 100 tests.
  11369. 290.27 s [vector] mut_foldM: OK
  11370. 290.27 s [vector] +++ OK, passed 100 tests.
  11371. 290.27 s [vector] mut_foldM': OK
  11372. 290.27 s [vector] +++ OK, passed 100 tests.
  11373. 290.27 s [vector] mut_foldrM: OK
  11374. 290.27 s [vector] +++ OK, passed 100 tests.
  11375. 290.27 s [vector] mut_foldrM': OK
  11376. 290.27 s [vector] +++ OK, passed 100 tests.
  11377. 290.27 s [vector] mut_ifoldM: OK
  11378. 290.28 s [vector] +++ OK, passed 100 tests.
  11379. 290.28 s [vector] mut_ifoldM': OK
  11380. 290.28 s [vector] +++ OK, passed 100 tests.
  11381. 290.28 s [vector] mut_ifoldrM: OK
  11382. 290.28 s [vector] +++ OK, passed 100 tests.
  11383. 290.28 s [vector] mut_ifoldrM': OK
  11384. 290.28 s [vector] +++ OK, passed 100 tests.
  11385. 290.28 s [vector] compare: OK
  11386. 290.28 s [vector] +++ OK, passed 100 tests.
  11387. 290.28 s [vector] maximum: OK
  11388. 290.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11389. 290.28 s [vector] minimum: OK
  11390. 290.28 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11391. 290.28 s [vector] minIndex: OK
  11392. 290.28 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11393. 290.28 s [vector] maxIndex: OK
  11394. 290.28 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11395. 290.28 s [vector] maximumBy: OK
  11396. 290.28 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11397. 290.28 s [vector] minimumBy: OK
  11398. 290.28 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11399. 290.28 s [vector] maximumOn: OK
  11400. 290.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11401. 290.28 s [vector] minimumOn: OK
  11402. 290.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11403. 290.28 s [vector] maxIndexBy: OK
  11404. 290.28 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11405. 290.28 s [vector] minIndexBy: OK
  11406. 290.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11407. 290.28 s [vector] ListFirstMaxIndexWins: OK
  11408. 290.28 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11409. 290.28 s [vector] FalseListFirstMaxIndexWins: OK
  11410. 290.28 s [vector] +++ OK, failed as expected. (after 1 test):
  11411. 290.28 s [vector] Exception:
  11412. 290.28 s [vector] Prelude.foldr1: empty list
  11413. 290.28 s [vector] CallStack (from HasCallStack):
  11414. 290.28 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  11415. 290.28 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  11416. 290.28 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11417. 290.28 s [vector] []
  11418. 290.29 s [vector] zip: OK
  11419. 290.29 s [vector] +++ OK, passed 100 tests.
  11420. 290.29 s [vector] zip3: OK
  11421. 290.29 s [vector] +++ OK, passed 100 tests.
  11422. 290.29 s [vector] unzip: OK
  11423. 290.29 s [vector] +++ OK, passed 100 tests.
  11424. 290.29 s [vector] unzip3: OK
  11425. 290.29 s [vector] +++ OK, passed 100 tests.
  11426. 290.29 s [vector] indexed: OK
  11427. 290.29 s [vector] +++ OK, passed 100 tests.
  11428. 290.29 s [vector] update: OK
  11429. 290.29 s [vector] +++ OK, passed 100 tests.
  11430. 290.29 s [vector] mempty: OK
  11431. 290.29 s [vector] +++ OK, passed 1 test.
  11432. 290.31 s [vector] mappend: OK
  11433. 290.31 s [vector] +++ OK, passed 100 tests.
  11434. 290.32 s [vector] mconcat: OK (0.02s)
  11435. 290.32 s [vector] +++ OK, passed 100 tests.
  11436. 290.32 s [vector] glength: OK
  11437. 290.32 s [vector] +++ OK, passed 100 tests.
  11438. 290.32 s [vector] and: OK
  11439. 290.32 s [vector] +++ OK, passed 100 tests.
  11440. 290.32 s [vector] or: OK
  11441. 290.32 s [vector] +++ OK, passed 100 tests.
  11442. 290.32 s [vector] (Int)
  11443. 290.32 s [vector] fromList.toList == id: OK
  11444. 290.32 s [vector] +++ OK, passed 100 tests.
  11445. 290.32 s [vector] toList.fromList == id: OK
  11446. 290.32 s [vector] +++ OK, passed 100 tests.
  11447. 290.32 s [vector] unstream.stream == id: OK
  11448. 290.32 s [vector] +++ OK, passed 100 tests.
  11449. 290.32 s [vector] stream.unstream == id: OK
  11450. 290.32 s [vector] +++ OK, passed 100 tests.
  11451. 290.32 s [vector] eq: OK
  11452. 290.32 s [vector] +++ OK, passed 100 tests.
  11453. 290.32 s [vector] length: OK
  11454. 290.32 s [vector] +++ OK, passed 100 tests.
  11455. 290.32 s [vector] null: OK
  11456. 290.32 s [vector] +++ OK, passed 100 tests.
  11457. 290.32 s [vector] index: OK
  11458. 290.32 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11459. 290.32 s [vector] safeIndex: OK
  11460. 290.32 s [vector] +++ OK, passed 100 tests.
  11461. 290.32 s [vector] head: OK
  11462. 290.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11463. 290.32 s [vector] last: OK
  11464. 290.32 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11465. 290.32 s [vector] unsafeIndex: OK
  11466. 290.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11467. 290.32 s [vector] unsafeHead: OK
  11468. 290.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11469. 290.32 s [vector] unsafeLast: OK
  11470. 290.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11471. 290.32 s [vector] slice: OK
  11472. 290.32 s [vector] +++ OK, passed 100 tests.
  11473. 290.32 s [vector] init: OK
  11474. 290.33 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11475. 290.33 s [vector] tail: OK
  11476. 290.33 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11477. 290.33 s [vector] take: OK
  11478. 290.33 s [vector] +++ OK, passed 100 tests.
  11479. 290.33 s [vector] drop: OK
  11480. 290.33 s [vector] +++ OK, passed 100 tests.
  11481. 290.33 s [vector] splitAt: OK
  11482. 290.33 s [vector] +++ OK, passed 100 tests.
  11483. 290.33 s [vector] empty: OK
  11484. 290.33 s [vector] +++ OK, passed 1 test.
  11485. 290.33 s [vector] singleton: OK
  11486. 290.33 s [vector] +++ OK, passed 100 tests.
  11487. 290.33 s [vector] replicate: OK
  11488. 290.33 s [vector] +++ OK, passed 100 tests.
  11489. 290.33 s [vector] generate: OK
  11490. 290.33 s [vector] +++ OK, passed 100 tests.
  11491. 290.33 s [vector] iterateN: OK
  11492. 290.33 s [vector] +++ OK, passed 100 tests.
  11493. 290.35 s [vector] iterateNM: OK (0.01s)
  11494. 290.35 s [vector] +++ OK, passed 100 tests.
  11495. 290.37 s [vector] generateM: OK (0.01s)
  11496. 290.37 s [vector] +++ OK, passed 100 tests.
  11497. 290.38 s [vector] replicateM: OK (0.02s)
  11498. 290.38 s [vector] +++ OK, passed 100 tests.
  11499. 290.38 s [vector] create: OK
  11500. 290.38 s [vector] +++ OK, passed 100 tests.
  11501. 290.38 s [vector] createT: OK
  11502. 290.38 s [vector] +++ OK, passed 100 tests.
  11503. 290.38 s [vector] unfoldr: OK
  11504. 290.38 s [vector] +++ OK, passed 100 tests.
  11505. 290.38 s [vector] unfoldrN: OK
  11506. 290.38 s [vector] +++ OK, passed 100 tests.
  11507. 290.38 s [vector] unfoldrExactN: OK
  11508. 290.38 s [vector] +++ OK, passed 100 tests.
  11509. 290.39 s [vector] unfoldrM: OK
  11510. 290.39 s [vector] +++ OK, passed 100 tests.
  11511. 290.39 s [vector] unfoldrNM: OK
  11512. 290.39 s [vector] +++ OK, passed 100 tests.
  11513. 290.40 s [vector] unfoldrExactNM: OK (0.02s)
  11514. 290.41 s [vector] +++ OK, passed 100 tests.
  11515. 290.41 s [vector] constructN: OK
  11516. 290.41 s [vector] +++ OK, passed 100 tests.
  11517. 290.41 s [vector] constructrN: OK
  11518. 290.41 s [vector] +++ OK, passed 100 tests.
  11519. 290.41 s [vector] cons: OK
  11520. 290.41 s [vector] +++ OK, passed 100 tests.
  11521. 290.41 s [vector] snoc: OK
  11522. 290.41 s [vector] +++ OK, passed 100 tests.
  11523. 290.41 s [vector] append: OK
  11524. 290.41 s [vector] +++ OK, passed 100 tests.
  11525. 290.43 s [vector] concat: OK (0.02s)
  11526. 290.43 s [vector] +++ OK, passed 100 tests.
  11527. 290.43 s [vector] force: OK
  11528. 290.43 s [vector] +++ OK, passed 100 tests.
  11529. 290.43 s [vector] upd: OK
  11530. 290.43 s [vector] +++ OK, passed 100 tests.
  11531. 290.44 s [vector] accum: OK
  11532. 290.44 s [vector] +++ OK, passed 100 tests.
  11533. 290.44 s [vector] reverse: OK
  11534. 290.44 s [vector] +++ OK, passed 100 tests.
  11535. 290.44 s [vector] backpermute: OK
  11536. 290.44 s [vector] +++ OK, passed 100 tests.
  11537. 290.44 s [vector] map: OK
  11538. 290.44 s [vector] +++ OK, passed 100 tests.
  11539. 290.44 s [vector] imap: OK
  11540. 290.45 s [vector] +++ OK, passed 100 tests.
  11541. 290.45 s [vector] concatMap: OK
  11542. 290.45 s [vector] +++ OK, passed 100 tests.
  11543. 290.45 s [vector] mapM: OK
  11544. 290.45 s [vector] +++ OK, passed 100 tests.
  11545. 290.46 s [vector] mapM_: OK (0.01s)
  11546. 290.47 s [vector] +++ OK, passed 100 tests.
  11547. 290.47 s [vector] forM: OK
  11548. 290.47 s [vector] +++ OK, passed 100 tests.
  11549. 290.47 s [vector] forM_: OK (0.01s)
  11550. 290.47 s [vector] +++ OK, passed 100 tests.
  11551. 290.47 s [vector] imapM: OK
  11552. 290.47 s [vector] +++ OK, passed 100 tests.
  11553. 290.49 s [vector] imapM_: OK (0.01s)
  11554. 290.49 s [vector] +++ OK, passed 100 tests.
  11555. 290.49 s [vector] zipWith: OK
  11556. 290.49 s [vector] +++ OK, passed 100 tests.
  11557. 290.49 s [vector] zipWith3: OK
  11558. 290.49 s [vector] +++ OK, passed 100 tests.
  11559. 290.50 s [vector] izipWith: OK
  11560. 290.50 s [vector] +++ OK, passed 100 tests.
  11561. 290.51 s [vector] izipWith3: OK
  11562. 290.51 s [vector] +++ OK, passed 100 tests.
  11563. 290.51 s [vector] izipWithM: OK
  11564. 290.51 s [vector] +++ OK, passed 100 tests.
  11565. 290.52 s [vector] izipWithM_: OK (0.02s)
  11566. 290.52 s [vector] +++ OK, passed 100 tests.
  11567. 290.52 s [vector] zipWithM: OK
  11568. 290.53 s [vector] +++ OK, passed 100 tests.
  11569. 290.53 s [vector] zipWithM_: OK
  11570. 290.53 s [vector] +++ OK, passed 100 tests.
  11571. 290.54 s [vector] filter: OK
  11572. 290.54 s [vector] +++ OK, passed 100 tests.
  11573. 290.56 s [vector] ifilter: OK
  11574. 290.56 s [vector] +++ OK, passed 100 tests.
  11575. 290.57 s [vector] filterM: OK (0.03s)
  11576. 290.57 s [vector] +++ OK, passed 100 tests.
  11577. 290.57 s [vector] uniq: OK
  11578. 290.57 s [vector] +++ OK, passed 100 tests.
  11579. 290.57 s [vector] mapMaybe: OK
  11580. 290.57 s [vector] +++ OK, passed 100 tests.
  11581. 290.57 s [vector] imapMaybe: OK
  11582. 290.57 s [vector] +++ OK, passed 100 tests.
  11583. 290.57 s [vector] takeWhile: OK
  11584. 290.57 s [vector] +++ OK, passed 100 tests.
  11585. 290.57 s [vector] dropWhile: OK
  11586. 290.57 s [vector] +++ OK, passed 100 tests.
  11587. 290.57 s [vector] partition: OK
  11588. 290.57 s [vector] +++ OK, passed 100 tests.
  11589. 290.58 s [vector] partitionWith: OK
  11590. 290.58 s [vector] +++ OK, passed 100 tests.
  11591. 290.58 s [vector] span: OK
  11592. 290.58 s [vector] +++ OK, passed 100 tests.
  11593. 290.58 s [vector] break: OK
  11594. 290.58 s [vector] +++ OK, passed 100 tests.
  11595. 290.58 s [vector] spanR: OK
  11596. 290.58 s [vector] +++ OK, passed 100 tests.
  11597. 290.58 s [vector] breakR: OK
  11598. 290.58 s [vector] +++ OK, passed 100 tests.
  11599. 290.58 s [vector] groupBy: OK
  11600. 290.58 s [vector] +++ OK, passed 100 tests.
  11601. 290.58 s [vector] elem: OK
  11602. 290.58 s [vector] +++ OK, passed 100 tests.
  11603. 290.58 s [vector] notElem: OK
  11604. 290.58 s [vector] +++ OK, passed 100 tests.
  11605. 290.58 s [vector] find: OK
  11606. 290.58 s [vector] +++ OK, passed 100 tests.
  11607. 290.58 s [vector] findIndex: OK
  11608. 290.58 s [vector] +++ OK, passed 100 tests.
  11609. 290.58 s [vector] findIndexR: OK
  11610. 290.58 s [vector] +++ OK, passed 100 tests.
  11611. 290.59 s [vector] findIndices: OK
  11612. 290.59 s [vector] +++ OK, passed 100 tests.
  11613. 290.59 s [vector] elemIndex: OK
  11614. 290.59 s [vector] +++ OK, passed 100 tests.
  11615. 290.59 s [vector] elemIndices: OK
  11616. 290.59 s [vector] +++ OK, passed 100 tests.
  11617. 290.59 s [vector] foldl: OK
  11618. 290.59 s [vector] +++ OK, passed 100 tests.
  11619. 290.59 s [vector] foldl1: OK
  11620. 290.59 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11621. 290.59 s [vector] foldl': OK
  11622. 290.59 s [vector] +++ OK, passed 100 tests.
  11623. 290.59 s [vector] foldl1': OK
  11624. 290.59 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11625. 290.60 s [vector] foldr: OK
  11626. 290.60 s [vector] +++ OK, passed 100 tests.
  11627. 290.60 s [vector] foldr1: OK
  11628. 290.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11629. 290.61 s [vector] foldr': OK
  11630. 290.61 s [vector] +++ OK, passed 100 tests.
  11631. 290.61 s [vector] foldr1': OK
  11632. 290.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11633. 290.61 s [vector] ifoldl: OK
  11634. 290.61 s [vector] +++ OK, passed 100 tests.
  11635. 290.61 s [vector] ifoldl': OK
  11636. 290.61 s [vector] +++ OK, passed 100 tests.
  11637. 290.62 s [vector] ifoldr: OK
  11638. 290.62 s [vector] +++ OK, passed 100 tests.
  11639. 290.62 s [vector] ifoldr': OK
  11640. 290.62 s [vector] +++ OK, passed 100 tests.
  11641. 290.63 s [vector] ifoldM: OK
  11642. 290.63 s [vector] +++ OK, passed 100 tests.
  11643. 290.63 s [vector] ifoldM': OK
  11644. 290.63 s [vector] +++ OK, passed 100 tests.
  11645. 290.65 s [vector] ifoldM_: OK (0.01s)
  11646. 290.65 s [vector] +++ OK, passed 100 tests.
  11647. 290.65 s [vector] ifoldM'_: OK (0.02s)
  11648. 290.65 s [vector] +++ OK, passed 100 tests.
  11649. 290.65 s [vector] all: OK
  11650. 290.65 s [vector] +++ OK, passed 100 tests.
  11651. 290.65 s [vector] any: OK
  11652. 290.65 s [vector] +++ OK, passed 100 tests.
  11653. 290.66 s [vector] prescanl: OK
  11654. 290.66 s [vector] +++ OK, passed 100 tests.
  11655. 290.66 s [vector] prescanl': OK
  11656. 290.66 s [vector] +++ OK, passed 100 tests.
  11657. 290.66 s [vector] postscanl: OK
  11658. 290.66 s [vector] +++ OK, passed 100 tests.
  11659. 290.66 s [vector] postscanl': OK
  11660. 290.66 s [vector] +++ OK, passed 100 tests.
  11661. 290.67 s [vector] scanl: OK
  11662. 290.67 s [vector] +++ OK, passed 100 tests.
  11663. 290.67 s [vector] scanl': OK
  11664. 290.67 s [vector] +++ OK, passed 100 tests.
  11665. 290.67 s [vector] scanl1: OK
  11666. 290.67 s [vector] +++ OK, passed 100 tests.
  11667. 290.67 s [vector] scanl1': OK
  11668. 290.67 s [vector] +++ OK, passed 100 tests.
  11669. 290.67 s [vector] iscanl: OK
  11670. 290.68 s [vector] +++ OK, passed 100 tests.
  11671. 290.68 s [vector] iscanl': OK
  11672. 290.68 s [vector] +++ OK, passed 100 tests.
  11673. 290.69 s [vector] prescanr: OK
  11674. 290.69 s [vector] +++ OK, passed 100 tests.
  11675. 290.69 s [vector] prescanr': OK
  11676. 290.70 s [vector] +++ OK, passed 100 tests.
  11677. 290.70 s [vector] postscanr: OK
  11678. 290.70 s [vector] +++ OK, passed 100 tests.
  11679. 290.70 s [vector] postscanr': OK
  11680. 290.70 s [vector] +++ OK, passed 100 tests.
  11681. 290.70 s [vector] scanr: OK
  11682. 290.70 s [vector] +++ OK, passed 100 tests.
  11683. 290.70 s [vector] scanr': OK
  11684. 290.70 s [vector] +++ OK, passed 100 tests.
  11685. 290.70 s [vector] scanr1: OK
  11686. 290.70 s [vector] +++ OK, passed 100 tests.
  11687. 290.71 s [vector] scanr1': OK
  11688. 290.71 s [vector] +++ OK, passed 100 tests.
  11689. 290.71 s [vector] iscanr: OK
  11690. 290.71 s [vector] +++ OK, passed 100 tests.
  11691. 290.71 s [vector] iscanr': OK
  11692. 290.71 s [vector] +++ OK, passed 100 tests.
  11693. 290.71 s [vector] mut_read: OK
  11694. 290.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11695. 290.71 s [vector] mut_write: OK
  11696. 290.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11697. 290.71 s [vector] mut_modify: OK
  11698. 290.71 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11699. 290.72 s [vector] mut_generate: OK
  11700. 290.72 s [vector] +++ OK, passed 100 tests.
  11701. 290.72 s [vector] mut_generateM: OK
  11702. 290.72 s [vector] +++ OK, passed 100 tests.
  11703. 290.73 s [vector] mut_mapM_: OK
  11704. 290.73 s [vector] +++ OK, passed 100 tests.
  11705. 290.75 s [vector] mut_imapM_: OK (0.01s)
  11706. 290.75 s [vector] +++ OK, passed 100 tests.
  11707. 290.75 s [vector] mut_forM_: OK (0.01s)
  11708. 290.75 s [vector] +++ OK, passed 100 tests.
  11709. 290.76 s [vector] mut_iforM_: OK (0.01s)
  11710. 290.76 s [vector] +++ OK, passed 100 tests.
  11711. 290.77 s [vector] mut_foldr: OK
  11712. 290.77 s [vector] +++ OK, passed 100 tests.
  11713. 290.77 s [vector] mut_foldr': OK
  11714. 290.77 s [vector] +++ OK, passed 100 tests.
  11715. 290.77 s [vector] mut_foldl: OK
  11716. 290.77 s [vector] +++ OK, passed 100 tests.
  11717. 290.77 s [vector] mut_foldl': OK
  11718. 290.77 s [vector] +++ OK, passed 100 tests.
  11719. 290.78 s [vector] mut_ifoldr: OK
  11720. 290.78 s [vector] +++ OK, passed 100 tests.
  11721. 290.78 s [vector] mut_ifoldr': OK
  11722. 290.79 s [vector] +++ OK, passed 100 tests.
  11723. 290.79 s [vector] mut_ifoldl: OK
  11724. 290.79 s [vector] +++ OK, passed 100 tests.
  11725. 290.79 s [vector] mut_ifoldl': OK
  11726. 290.79 s [vector] +++ OK, passed 100 tests.
  11727. 290.79 s [vector] mut_foldM: OK
  11728. 290.79 s [vector] +++ OK, passed 100 tests.
  11729. 290.80 s [vector] mut_foldM': OK
  11730. 290.80 s [vector] +++ OK, passed 100 tests.
  11731. 290.80 s [vector] mut_foldrM: OK
  11732. 290.80 s [vector] +++ OK, passed 100 tests.
  11733. 290.80 s [vector] mut_foldrM': OK
  11734. 290.80 s [vector] +++ OK, passed 100 tests.
  11735. 290.80 s [vector] mut_ifoldM: OK
  11736. 290.81 s [vector] +++ OK, passed 100 tests.
  11737. 290.81 s [vector] mut_ifoldM': OK
  11738. 290.81 s [vector] +++ OK, passed 100 tests.
  11739. 290.81 s [vector] mut_ifoldrM: OK
  11740. 290.81 s [vector] +++ OK, passed 100 tests.
  11741. 290.81 s [vector] mut_ifoldrM': OK
  11742. 290.81 s [vector] +++ OK, passed 100 tests.
  11743. 290.81 s [vector] compare: OK
  11744. 290.81 s [vector] +++ OK, passed 100 tests.
  11745. 290.81 s [vector] maximum: OK
  11746. 290.81 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11747. 290.81 s [vector] minimum: OK
  11748. 290.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11749. 290.81 s [vector] minIndex: OK
  11750. 290.81 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11751. 290.81 s [vector] maxIndex: OK
  11752. 290.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11753. 290.81 s [vector] maximumBy: OK
  11754. 290.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11755. 290.81 s [vector] minimumBy: OK
  11756. 290.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11757. 290.81 s [vector] maximumOn: OK
  11758. 290.81 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11759. 290.81 s [vector] minimumOn: OK
  11760. 290.81 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11761. 290.82 s [vector] maxIndexBy: OK
  11762. 290.82 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11763. 290.82 s [vector] minIndexBy: OK
  11764. 290.82 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11765. 290.82 s [vector] ListFirstMaxIndexWins: OK
  11766. 290.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11767. 290.82 s [vector] FalseListFirstMaxIndexWins: OK
  11768. 290.82 s [vector] +++ OK, failed as expected. (after 1 test):
  11769. 290.82 s [vector] Exception:
  11770. 290.82 s [vector] Prelude.foldr1: empty list
  11771. 290.82 s [vector] CallStack (from HasCallStack):
  11772. 290.82 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  11773. 290.82 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  11774. 290.82 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  11775. 290.82 s [vector] []
  11776. 290.82 s [vector] zip: OK
  11777. 290.82 s [vector] +++ OK, passed 100 tests.
  11778. 290.82 s [vector] zip3: OK
  11779. 290.82 s [vector] +++ OK, passed 100 tests.
  11780. 290.82 s [vector] unzip: OK
  11781. 290.82 s [vector] +++ OK, passed 100 tests.
  11782. 290.82 s [vector] unzip3: OK
  11783. 290.82 s [vector] +++ OK, passed 100 tests.
  11784. 290.82 s [vector] indexed: OK
  11785. 290.82 s [vector] +++ OK, passed 100 tests.
  11786. 290.82 s [vector] update: OK
  11787. 290.82 s [vector] +++ OK, passed 100 tests.
  11788. 290.82 s [vector] mempty: OK
  11789. 290.82 s [vector] +++ OK, passed 1 test.
  11790. 290.83 s [vector] mappend: OK
  11791. 290.83 s [vector] +++ OK, passed 100 tests.
  11792. 290.84 s [vector] mconcat: OK (0.01s)
  11793. 290.84 s [vector] +++ OK, passed 100 tests.
  11794. 290.84 s [vector] glength: OK
  11795. 290.84 s [vector] +++ OK, passed 100 tests.
  11796. 290.84 s [vector] sum: OK
  11797. 290.84 s [vector] +++ OK, passed 100 tests.
  11798. 290.84 s [vector] product: OK
  11799. 290.84 s [vector] +++ OK, passed 100 tests.
  11800. 290.84 s [vector] enumFromN: OK
  11801. 290.84 s [vector] +++ OK, passed 100 tests.
  11802. 290.84 s [vector] enumFromThenN: OK
  11803. 290.84 s [vector] +++ OK, passed 100 tests.
  11804. 290.85 s [vector] enumFromTo: OK
  11805. 290.85 s [vector] +++ OK, passed 100 tests.
  11806. 290.85 s [vector] enumFromThenTo: OK
  11807. 290.85 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11808. 290.85 s [vector] (Float)
  11809. 290.85 s [vector] fromList.toList == id: OK
  11810. 290.85 s [vector] +++ OK, passed 100 tests.
  11811. 290.85 s [vector] toList.fromList == id: OK
  11812. 290.85 s [vector] +++ OK, passed 100 tests.
  11813. 290.85 s [vector] unstream.stream == id: OK
  11814. 290.85 s [vector] +++ OK, passed 100 tests.
  11815. 290.85 s [vector] stream.unstream == id: OK
  11816. 290.85 s [vector] +++ OK, passed 100 tests.
  11817. 290.85 s [vector] eq: OK
  11818. 290.85 s [vector] +++ OK, passed 100 tests.
  11819. 290.85 s [vector] length: OK
  11820. 290.85 s [vector] +++ OK, passed 100 tests.
  11821. 290.86 s [vector] null: OK
  11822. 290.86 s [vector] +++ OK, passed 100 tests.
  11823. 290.86 s [vector] index: OK
  11824. 290.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11825. 290.86 s [vector] safeIndex: OK
  11826. 290.86 s [vector] +++ OK, passed 100 tests.
  11827. 290.86 s [vector] head: OK
  11828. 290.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11829. 290.86 s [vector] last: OK
  11830. 290.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11831. 290.86 s [vector] unsafeIndex: OK
  11832. 290.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11833. 290.86 s [vector] unsafeHead: OK
  11834. 290.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11835. 290.86 s [vector] unsafeLast: OK
  11836. 290.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11837. 290.86 s [vector] slice: OK
  11838. 290.86 s [vector] +++ OK, passed 100 tests.
  11839. 290.86 s [vector] init: OK
  11840. 290.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11841. 290.86 s [vector] tail: OK
  11842. 290.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11843. 290.86 s [vector] take: OK
  11844. 290.86 s [vector] +++ OK, passed 100 tests.
  11845. 290.86 s [vector] drop: OK
  11846. 290.86 s [vector] +++ OK, passed 100 tests.
  11847. 290.86 s [vector] splitAt: OK
  11848. 290.86 s [vector] +++ OK, passed 100 tests.
  11849. 290.86 s [vector] empty: OK
  11850. 290.86 s [vector] +++ OK, passed 1 test.
  11851. 290.86 s [vector] singleton: OK
  11852. 290.86 s [vector] +++ OK, passed 100 tests.
  11853. 290.86 s [vector] replicate: OK
  11854. 290.86 s [vector] +++ OK, passed 100 tests.
  11855. 290.86 s [vector] generate: OK
  11856. 290.87 s [vector] +++ OK, passed 100 tests.
  11857. 290.87 s [vector] iterateN: OK
  11858. 290.87 s [vector] +++ OK, passed 100 tests.
  11859. 290.90 s [vector] iterateNM: OK (0.01s)
  11860. 290.90 s [vector] +++ OK, passed 100 tests.
  11861. 290.91 s [vector] generateM: OK (0.03s)
  11862. 290.91 s [vector] +++ OK, passed 100 tests.
  11863. 290.92 s [vector] replicateM: OK
  11864. 290.92 s [vector] +++ OK, passed 100 tests.
  11865. 290.92 s [vector] create: OK
  11866. 290.92 s [vector] +++ OK, passed 100 tests.
  11867. 290.92 s [vector] createT: OK
  11868. 290.92 s [vector] +++ OK, passed 100 tests.
  11869. 290.92 s [vector] unfoldr: OK
  11870. 290.92 s [vector] +++ OK, passed 100 tests.
  11871. 290.92 s [vector] unfoldrN: OK
  11872. 290.92 s [vector] +++ OK, passed 100 tests.
  11873. 290.92 s [vector] unfoldrExactN: OK
  11874. 290.92 s [vector] +++ OK, passed 100 tests.
  11875. 290.92 s [vector] unfoldrM: OK
  11876. 290.93 s [vector] +++ OK, passed 100 tests.
  11877. 290.93 s [vector] unfoldrNM: OK (0.01s)
  11878. 290.93 s [vector] +++ OK, passed 100 tests.
  11879. 290.95 s [vector] unfoldrExactNM: OK (0.02s)
  11880. 290.95 s [vector] +++ OK, passed 100 tests.
  11881. 290.96 s [vector] constructN: OK
  11882. 290.96 s [vector] +++ OK, passed 100 tests.
  11883. 290.98 s [vector] constructrN: OK (0.02s)
  11884. 290.98 s [vector] +++ OK, passed 100 tests.
  11885. 290.98 s [vector] cons: OK
  11886. 290.98 s [vector] +++ OK, passed 100 tests.
  11887. 290.98 s [vector] snoc: OK
  11888. 290.98 s [vector] +++ OK, passed 100 tests.
  11889. 290.98 s [vector] append: OK
  11890. 290.98 s [vector] +++ OK, passed 100 tests.
  11891. 291.01 s [vector] concat: OK (0.01s)
  11892. 291.01 s [vector] +++ OK, passed 100 tests.
  11893. 291.01 s [vector] force: OK
  11894. 291.01 s [vector] +++ OK, passed 100 tests.
  11895. 291.01 s [vector] upd: OK
  11896. 291.01 s [vector] +++ OK, passed 100 tests.
  11897. 291.02 s [vector] accum: OK
  11898. 291.02 s [vector] +++ OK, passed 100 tests.
  11899. 291.02 s [vector] reverse: OK
  11900. 291.03 s [vector] +++ OK, passed 100 tests.
  11901. 291.03 s [vector] backpermute: OK
  11902. 291.03 s [vector] +++ OK, passed 100 tests.
  11903. 291.03 s [vector] map: OK
  11904. 291.03 s [vector] +++ OK, passed 100 tests.
  11905. 291.03 s [vector] imap: OK
  11906. 291.03 s [vector] +++ OK, passed 100 tests.
  11907. 291.03 s [vector] concatMap: OK
  11908. 291.03 s [vector] +++ OK, passed 100 tests.
  11909. 291.04 s [vector] mapM: OK
  11910. 291.04 s [vector] +++ OK, passed 100 tests.
  11911. 291.07 s [vector] mapM_: OK (0.03s)
  11912. 291.07 s [vector] +++ OK, passed 100 tests.
  11913. 291.07 s [vector] forM: OK
  11914. 291.07 s [vector] +++ OK, passed 100 tests.
  11915. 291.11 s [vector] forM_: OK (0.03s)
  11916. 291.11 s [vector] +++ OK, passed 100 tests.
  11917. 291.11 s [vector] imapM: OK
  11918. 291.11 s [vector] +++ OK, passed 100 tests.
  11919. 291.15 s [vector] imapM_: OK (0.03s)
  11920. 291.15 s [vector] +++ OK, passed 100 tests.
  11921. 291.15 s [vector] zipWith: OK
  11922. 291.15 s [vector] +++ OK, passed 100 tests.
  11923. 291.16 s [vector] zipWith3: OK
  11924. 291.16 s [vector] +++ OK, passed 100 tests.
  11925. 291.17 s [vector] izipWith: OK
  11926. 291.17 s [vector] +++ OK, passed 100 tests.
  11927. 291.18 s [vector] izipWith3: OK
  11928. 291.19 s [vector] +++ OK, passed 100 tests.
  11929. 291.20 s [vector] izipWithM: OK
  11930. 291.20 s [vector] +++ OK, passed 100 tests.
  11931. 291.21 s [vector] izipWithM_: OK (0.02s)
  11932. 291.21 s [vector] +++ OK, passed 100 tests.
  11933. 291.22 s [vector] zipWithM: OK
  11934. 291.22 s [vector] +++ OK, passed 100 tests.
  11935. 291.24 s [vector] zipWithM_: OK (0.03s)
  11936. 291.24 s [vector] +++ OK, passed 100 tests.
  11937. 291.24 s [vector] filter: OK
  11938. 291.24 s [vector] +++ OK, passed 100 tests.
  11939. 291.25 s [vector] ifilter: OK
  11940. 291.25 s [vector] +++ OK, passed 100 tests.
  11941. 291.29 s [vector] filterM: OK (0.04s)
  11942. 291.29 s [vector] +++ OK, passed 100 tests.
  11943. 291.29 s [vector] uniq: OK
  11944. 291.30 s [vector] +++ OK, passed 100 tests.
  11945. 291.30 s [vector] mapMaybe: OK
  11946. 291.30 s [vector] +++ OK, passed 100 tests.
  11947. 291.30 s [vector] imapMaybe: OK
  11948. 291.30 s [vector] +++ OK, passed 100 tests.
  11949. 291.30 s [vector] takeWhile: OK
  11950. 291.30 s [vector] +++ OK, passed 100 tests.
  11951. 291.30 s [vector] dropWhile: OK
  11952. 291.31 s [vector] +++ OK, passed 100 tests.
  11953. 291.31 s [vector] partition: OK
  11954. 291.31 s [vector] +++ OK, passed 100 tests.
  11955. 291.31 s [vector] partitionWith: OK
  11956. 291.32 s [vector] +++ OK, passed 100 tests.
  11957. 291.32 s [vector] span: OK
  11958. 291.32 s [vector] +++ OK, passed 100 tests.
  11959. 291.32 s [vector] break: OK
  11960. 291.32 s [vector] +++ OK, passed 100 tests.
  11961. 291.32 s [vector] spanR: OK
  11962. 291.32 s [vector] +++ OK, passed 100 tests.
  11963. 291.32 s [vector] breakR: OK
  11964. 291.32 s [vector] +++ OK, passed 100 tests.
  11965. 291.32 s [vector] groupBy: OK
  11966. 291.32 s [vector] +++ OK, passed 100 tests.
  11967. 291.32 s [vector] elem: OK
  11968. 291.33 s [vector] +++ OK, passed 100 tests.
  11969. 291.33 s [vector] notElem: OK
  11970. 291.33 s [vector] +++ OK, passed 100 tests.
  11971. 291.33 s [vector] find: OK
  11972. 291.33 s [vector] +++ OK, passed 100 tests.
  11973. 291.33 s [vector] findIndex: OK
  11974. 291.33 s [vector] +++ OK, passed 100 tests.
  11975. 291.34 s [vector] findIndexR: OK
  11976. 291.34 s [vector] +++ OK, passed 100 tests.
  11977. 291.35 s [vector] findIndices: OK
  11978. 291.35 s [vector] +++ OK, passed 100 tests.
  11979. 291.35 s [vector] elemIndex: OK
  11980. 291.35 s [vector] +++ OK, passed 100 tests.
  11981. 291.35 s [vector] elemIndices: OK
  11982. 291.35 s [vector] +++ OK, passed 100 tests.
  11983. 291.36 s [vector] foldl: OK
  11984. 291.36 s [vector] +++ OK, passed 100 tests.
  11985. 291.37 s [vector] foldl1: OK
  11986. 291.37 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11987. 291.37 s [vector] foldl': OK
  11988. 291.37 s [vector] +++ OK, passed 100 tests.
  11989. 291.37 s [vector] foldl1': OK
  11990. 291.37 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11991. 291.37 s [vector] foldr: OK
  11992. 291.37 s [vector] +++ OK, passed 100 tests.
  11993. 291.37 s [vector] foldr1: OK
  11994. 291.37 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11995. 291.38 s [vector] foldr': OK
  11996. 291.38 s [vector] +++ OK, passed 100 tests.
  11997. 291.39 s [vector] foldr1': OK
  11998. 291.39 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11999. 291.40 s [vector] ifoldl: OK
  12000. 291.40 s [vector] +++ OK, passed 100 tests.
  12001. 291.41 s [vector] ifoldl': OK
  12002. 291.41 s [vector] +++ OK, passed 100 tests.
  12003. 291.41 s [vector] ifoldr: OK
  12004. 291.41 s [vector] +++ OK, passed 100 tests.
  12005. 291.41 s [vector] ifoldr': OK
  12006. 291.41 s [vector] +++ OK, passed 100 tests.
  12007. 291.42 s [vector] ifoldM: OK
  12008. 291.42 s [vector] +++ OK, passed 100 tests.
  12009. 291.43 s [vector] ifoldM': OK
  12010. 291.43 s [vector] +++ OK, passed 100 tests.
  12011. 291.47 s [vector] ifoldM_: OK (0.03s)
  12012. 291.47 s [vector] +++ OK, passed 100 tests.
  12013. 291.49 s [vector] ifoldM'_: OK (0.03s)
  12014. 291.49 s [vector] +++ OK, passed 100 tests.
  12015. 291.49 s [vector] all: OK
  12016. 291.49 s [vector] +++ OK, passed 100 tests.
  12017. 291.49 s [vector] any: OK
  12018. 291.49 s [vector] +++ OK, passed 100 tests.
  12019. 291.50 s [vector] prescanl: OK
  12020. 291.50 s [vector] +++ OK, passed 100 tests.
  12021. 291.51 s [vector] prescanl': OK
  12022. 291.51 s [vector] +++ OK, passed 100 tests.
  12023. 291.53 s [vector] postscanl: OK
  12024. 291.53 s [vector] +++ OK, passed 100 tests.
  12025. 291.53 s [vector] postscanl': OK
  12026. 291.53 s [vector] +++ OK, passed 100 tests.
  12027. 291.53 s [vector] scanl: OK
  12028. 291.53 s [vector] +++ OK, passed 100 tests.
  12029. 291.54 s [vector] scanl': OK
  12030. 291.54 s [vector] +++ OK, passed 100 tests.
  12031. 291.54 s [vector] scanl1: OK
  12032. 291.54 s [vector] +++ OK, passed 100 tests.
  12033. 291.55 s [vector] scanl1': OK
  12034. 291.55 s [vector] +++ OK, passed 100 tests.
  12035. 291.57 s [vector] iscanl: OK
  12036. 291.57 s [vector] +++ OK, passed 100 tests.
  12037. 291.58 s [vector] iscanl': OK (0.01s)
  12038. 291.58 s [vector] +++ OK, passed 100 tests.
  12039. 291.58 s [vector] prescanr: OK
  12040. 291.58 s [vector] +++ OK, passed 100 tests.
  12041. 291.58 s [vector] prescanr': OK
  12042. 291.58 s [vector] +++ OK, passed 100 tests.
  12043. 291.59 s [vector] postscanr: OK
  12044. 291.59 s [vector] +++ OK, passed 100 tests.
  12045. 291.60 s [vector] postscanr': OK
  12046. 291.60 s [vector] +++ OK, passed 100 tests.
  12047. 291.61 s [vector] scanr: OK
  12048. 291.61 s [vector] +++ OK, passed 100 tests.
  12049. 291.62 s [vector] scanr': OK
  12050. 291.63 s [vector] +++ OK, passed 100 tests.
  12051. 291.63 s [vector] scanr1: OK
  12052. 291.63 s [vector] +++ OK, passed 100 tests.
  12053. 291.64 s [vector] scanr1': OK
  12054. 291.64 s [vector] +++ OK, passed 100 tests.
  12055. 291.64 s [vector] iscanr: OK
  12056. 291.64 s [vector] +++ OK, passed 100 tests.
  12057. 291.64 s [vector] iscanr': OK
  12058. 291.64 s [vector] +++ OK, passed 100 tests.
  12059. 291.64 s [vector] mut_read: OK
  12060. 291.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12061. 291.65 s [vector] mut_write: OK
  12062. 291.65 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12063. 291.65 s [vector] mut_modify: OK
  12064. 291.65 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12065. 291.65 s [vector] mut_generate: OK
  12066. 291.65 s [vector] +++ OK, passed 100 tests.
  12067. 291.67 s [vector] mut_generateM: OK (0.01s)
  12068. 291.67 s [vector] +++ OK, passed 100 tests.
  12069. 291.69 s [vector] mut_mapM_: OK (0.02s)
  12070. 291.69 s [vector] +++ OK, passed 100 tests.
  12071. 291.71 s [vector] mut_imapM_: OK (0.03s)
  12072. 291.71 s [vector] +++ OK, passed 100 tests.
  12073. 291.75 s [vector] mut_forM_: OK (0.03s)
  12074. 291.75 s [vector] +++ OK, passed 100 tests.
  12075. 291.79 s [vector] mut_iforM_: OK (0.03s)
  12076. 291.79 s [vector] +++ OK, passed 100 tests.
  12077. 291.79 s [vector] mut_foldr: OK
  12078. 291.79 s [vector] +++ OK, passed 100 tests.
  12079. 291.80 s [vector] mut_foldr': OK
  12080. 291.80 s [vector] +++ OK, passed 100 tests.
  12081. 291.81 s [vector] mut_foldl: OK
  12082. 291.81 s [vector] +++ OK, passed 100 tests.
  12083. 291.81 s [vector] mut_foldl': OK
  12084. 291.81 s [vector] +++ OK, passed 100 tests.
  12085. 291.83 s [vector] mut_ifoldr: OK
  12086. 291.83 s [vector] +++ OK, passed 100 tests.
  12087. 291.83 s [vector] mut_ifoldr': OK
  12088. 291.83 s [vector] +++ OK, passed 100 tests.
  12089. 291.83 s [vector] mut_ifoldl: OK
  12090. 291.83 s [vector] +++ OK, passed 100 tests.
  12091. 291.85 s [vector] mut_ifoldl': OK
  12092. 291.85 s [vector] +++ OK, passed 100 tests.
  12093. 291.85 s [vector] mut_foldM: OK
  12094. 291.85 s [vector] +++ OK, passed 100 tests.
  12095. 291.87 s [vector] mut_foldM': OK
  12096. 291.87 s [vector] +++ OK, passed 100 tests.
  12097. 291.87 s [vector] mut_foldrM: OK
  12098. 291.87 s [vector] +++ OK, passed 100 tests.
  12099. 291.87 s [vector] mut_foldrM': OK
  12100. 291.87 s [vector] +++ OK, passed 100 tests.
  12101. 291.88 s [vector] mut_ifoldM: OK
  12102. 291.88 s [vector] +++ OK, passed 100 tests.
  12103. 291.89 s [vector] mut_ifoldM': OK
  12104. 291.89 s [vector] +++ OK, passed 100 tests.
  12105. 291.89 s [vector] mut_ifoldrM: OK
  12106. 291.89 s [vector] +++ OK, passed 100 tests.
  12107. 291.90 s [vector] mut_ifoldrM': OK
  12108. 291.90 s [vector] +++ OK, passed 100 tests.
  12109. 291.90 s [vector] compare: OK
  12110. 291.90 s [vector] +++ OK, passed 100 tests.
  12111. 291.90 s [vector] maximum: OK
  12112. 291.90 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12113. 291.90 s [vector] minimum: OK
  12114. 291.90 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12115. 291.90 s [vector] minIndex: OK
  12116. 291.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12117. 291.90 s [vector] maxIndex: OK
  12118. 291.90 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12119. 291.90 s [vector] maximumBy: OK
  12120. 291.90 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12121. 291.90 s [vector] minimumBy: OK
  12122. 291.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12123. 291.91 s [vector] maximumOn: OK
  12124. 291.91 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12125. 291.91 s [vector] minimumOn: OK
  12126. 291.91 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12127. 291.91 s [vector] maxIndexBy: OK
  12128. 291.91 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12129. 291.91 s [vector] minIndexBy: OK
  12130. 291.91 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12131. 291.91 s [vector] ListFirstMaxIndexWins: OK
  12132. 291.91 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12133. 291.91 s [vector] FalseListFirstMaxIndexWins: OK
  12134. 291.91 s [vector] +++ OK, failed as expected. (after 1 test):
  12135. 291.91 s [vector] Exception:
  12136. 291.91 s [vector] Prelude.foldr1: empty list
  12137. 291.91 s [vector] CallStack (from HasCallStack):
  12138. 291.91 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  12139. 291.91 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  12140. 291.91 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12141. 291.91 s [vector] []
  12142. 291.91 s [vector] zip: OK
  12143. 291.91 s [vector] +++ OK, passed 100 tests.
  12144. 291.91 s [vector] zip3: OK
  12145. 291.91 s [vector] +++ OK, passed 100 tests.
  12146. 291.91 s [vector] unzip: OK
  12147. 291.91 s [vector] +++ OK, passed 100 tests.
  12148. 291.92 s [vector] unzip3: OK
  12149. 291.92 s [vector] +++ OK, passed 100 tests.
  12150. 291.92 s [vector] indexed: OK
  12151. 291.92 s [vector] +++ OK, passed 100 tests.
  12152. 291.92 s [vector] update: OK
  12153. 291.92 s [vector] +++ OK, passed 100 tests.
  12154. 291.92 s [vector] mempty: OK
  12155. 291.92 s [vector] +++ OK, passed 1 test.
  12156. 291.92 s [vector] mappend: OK
  12157. 291.93 s [vector] +++ OK, passed 100 tests.
  12158. 291.94 s [vector] mconcat: OK (0.02s)
  12159. 291.95 s [vector] +++ OK, passed 100 tests.
  12160. 291.95 s [vector] glength: OK
  12161. 291.95 s [vector] +++ OK, passed 100 tests.
  12162. 291.95 s [vector] sum: OK
  12163. 291.95 s [vector] +++ OK, passed 100 tests.
  12164. 291.95 s [vector] product: OK
  12165. 291.95 s [vector] +++ OK, passed 100 tests.
  12166. 291.95 s [vector] enumFromN: OK
  12167. 291.95 s [vector] +++ OK, passed 100 tests.
  12168. 291.95 s [vector] enumFromThenN: OK
  12169. 291.95 s [vector] +++ OK, passed 100 tests.
  12170. 291.95 s [vector] enumFromTo: OK
  12171. 291.95 s [vector] +++ OK, passed 100 tests.
  12172. 291.95 s [vector] enumFromThenTo: OK
  12173. 291.95 s [vector] +++ OK, passed 100 tests; 2 discarded.
  12174. 291.95 s [vector] (Double)
  12175. 291.95 s [vector] fromList.toList == id: OK
  12176. 291.95 s [vector] +++ OK, passed 100 tests.
  12177. 291.95 s [vector] toList.fromList == id: OK
  12178. 291.95 s [vector] +++ OK, passed 100 tests.
  12179. 291.95 s [vector] unstream.stream == id: OK
  12180. 291.95 s [vector] +++ OK, passed 100 tests.
  12181. 291.95 s [vector] stream.unstream == id: OK
  12182. 291.95 s [vector] +++ OK, passed 100 tests.
  12183. 291.95 s [vector] eq: OK
  12184. 291.95 s [vector] +++ OK, passed 100 tests.
  12185. 291.95 s [vector] length: OK
  12186. 291.95 s [vector] +++ OK, passed 100 tests.
  12187. 291.96 s [vector] null: OK
  12188. 291.96 s [vector] +++ OK, passed 100 tests.
  12189. 291.96 s [vector] index: OK
  12190. 291.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12191. 291.96 s [vector] safeIndex: OK
  12192. 291.96 s [vector] +++ OK, passed 100 tests.
  12193. 291.96 s [vector] head: OK
  12194. 291.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12195. 291.96 s [vector] last: OK
  12196. 291.96 s [vector] +++ OK, passed 100 tests; 23 discarded.
  12197. 291.96 s [vector] unsafeIndex: OK
  12198. 291.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12199. 291.96 s [vector] unsafeHead: OK
  12200. 291.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12201. 291.96 s [vector] unsafeLast: OK
  12202. 291.96 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12203. 291.96 s [vector] slice: OK
  12204. 291.96 s [vector] +++ OK, passed 100 tests.
  12205. 291.96 s [vector] init: OK
  12206. 291.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12207. 291.96 s [vector] tail: OK
  12208. 291.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12209. 291.96 s [vector] take: OK
  12210. 291.96 s [vector] +++ OK, passed 100 tests.
  12211. 291.96 s [vector] drop: OK
  12212. 291.96 s [vector] +++ OK, passed 100 tests.
  12213. 291.96 s [vector] splitAt: OK
  12214. 291.96 s [vector] +++ OK, passed 100 tests.
  12215. 291.96 s [vector] empty: OK
  12216. 291.96 s [vector] +++ OK, passed 1 test.
  12217. 291.96 s [vector] singleton: OK
  12218. 291.96 s [vector] +++ OK, passed 100 tests.
  12219. 291.96 s [vector] replicate: OK
  12220. 291.96 s [vector] +++ OK, passed 100 tests.
  12221. 291.96 s [vector] generate: OK
  12222. 291.97 s [vector] +++ OK, passed 100 tests.
  12223. 291.97 s [vector] iterateN: OK
  12224. 291.97 s [vector] +++ OK, passed 100 tests.
  12225. 291.99 s [vector] iterateNM: OK (0.01s)
  12226. 291.99 s [vector] +++ OK, passed 100 tests.
  12227. 292.01 s [vector] generateM: OK (0.02s)
  12228. 292.01 s [vector] +++ OK, passed 100 tests.
  12229. 292.01 s [vector] replicateM: OK
  12230. 292.01 s [vector] +++ OK, passed 100 tests.
  12231. 292.01 s [vector] create: OK
  12232. 292.01 s [vector] +++ OK, passed 100 tests.
  12233. 292.01 s [vector] createT: OK
  12234. 292.01 s [vector] +++ OK, passed 100 tests.
  12235. 292.01 s [vector] unfoldr: OK
  12236. 292.01 s [vector] +++ OK, passed 100 tests.
  12237. 292.01 s [vector] unfoldrN: OK
  12238. 292.01 s [vector] +++ OK, passed 100 tests.
  12239. 292.01 s [vector] unfoldrExactN: OK
  12240. 292.01 s [vector] +++ OK, passed 100 tests.
  12241. 292.01 s [vector] unfoldrM: OK
  12242. 292.01 s [vector] +++ OK, passed 100 tests.
  12243. 292.03 s [vector] unfoldrNM: OK
  12244. 292.03 s [vector] +++ OK, passed 100 tests.
  12245. 292.04 s [vector] unfoldrExactNM: OK (0.01s)
  12246. 292.04 s [vector] +++ OK, passed 100 tests.
  12247. 292.05 s [vector] constructN: OK (0.01s)
  12248. 292.05 s [vector] +++ OK, passed 100 tests.
  12249. 292.05 s [vector] constructrN: OK (0.01s)
  12250. 292.05 s [vector] +++ OK, passed 100 tests.
  12251. 292.05 s [vector] cons: OK
  12252. 292.05 s [vector] +++ OK, passed 100 tests.
  12253. 292.05 s [vector] snoc: OK
  12254. 292.05 s [vector] +++ OK, passed 100 tests.
  12255. 292.05 s [vector] append: OK
  12256. 292.05 s [vector] +++ OK, passed 100 tests.
  12257. 292.08 s [vector] concat: OK (0.02s)
  12258. 292.57 s [vector] +++ OK, passed 100 tests.
  12259. 292.57 s [vector] force: OK
  12260. 292.57 s [vector] +++ OK, passed 100 tests.
  12261. 292.57 s [vector] upd: OK
  12262. 292.57 s [vector] +++ OK, passed 100 tests.
  12263. 292.57 s [vector] accum: OK (0.01s)
  12264. 292.57 s [vector] +++ OK, passed 100 tests.
  12265. 292.57 s [vector] reverse: OK
  12266. 292.57 s [vector] +++ OK, passed 100 tests.
  12267. 292.57 s [vector] backpermute: OK
  12268. 292.57 s [vector] +++ OK, passed 100 tests.
  12269. 292.57 s [vector] map: OK
  12270. 292.57 s [vector] +++ OK, passed 100 tests.
  12271. 292.57 s [vector] imap: OK
  12272. 292.57 s [vector] +++ OK, passed 100 tests.
  12273. 292.57 s [vector] concatMap: OK
  12274. 292.57 s [vector] +++ OK, passed 100 tests.
  12275. 292.57 s [vector] mapM: OK
  12276. 292.57 s [vector] +++ OK, passed 100 tests.
  12277. 292.57 s [vector] mapM_: OK (0.03s)
  12278. 292.57 s [vector] +++ OK, passed 100 tests.
  12279. 292.57 s [vector] forM: OK
  12280. 292.57 s [vector] +++ OK, passed 100 tests.
  12281. 292.57 s [vector] forM_: OK (0.03s)
  12282. 292.57 s [vector] +++ OK, passed 100 tests.
  12283. 292.57 s [vector] imapM: OK
  12284. 292.57 s [vector] +++ OK, passed 100 tests.
  12285. 292.57 s [vector] imapM_: OK (0.03s)
  12286. 292.57 s [vector] +++ OK, passed 100 tests.
  12287. 292.57 s [vector] zipWith: OK
  12288. 292.57 s [vector] +++ OK, passed 100 tests.
  12289. 292.57 s [vector] zipWith3: OK (0.01s)
  12290. 292.57 s [vector] +++ OK, passed 100 tests.
  12291. 292.57 s [vector] izipWith: OK
  12292. 292.57 s [vector] +++ OK, passed 100 tests.
  12293. 292.57 s [vector] izipWith3: OK
  12294. 292.57 s [vector] +++ OK, passed 100 tests.
  12295. 292.57 s [vector] izipWithM: OK (0.01s)
  12296. 292.57 s [vector] +++ OK, passed 100 tests.
  12297. 292.57 s [vector] izipWithM_: OK (0.03s)
  12298. 292.57 s [vector] +++ OK, passed 100 tests.
  12299. 292.57 s [vector] zipWithM: OK
  12300. 292.57 s [vector] +++ OK, passed 100 tests.
  12301. 292.57 s [vector] zipWithM_: OK (0.02s)
  12302. 292.57 s [vector] +++ OK, passed 100 tests.
  12303. 292.57 s [vector] filter: OK
  12304. 292.57 s [vector] +++ OK, passed 100 tests.
  12305. 292.57 s [vector] ifilter: OK
  12306. 292.57 s [vector] +++ OK, passed 100 tests.
  12307. 292.57 s [vector] filterM: OK (0.04s)
  12308. 292.57 s [vector] +++ OK, passed 100 tests.
  12309. 292.57 s [vector] uniq: OK
  12310. 292.57 s [vector] +++ OK, passed 100 tests.
  12311. 292.57 s [vector] mapMaybe: OK
  12312. 292.57 s [vector] +++ OK, passed 100 tests.
  12313. 292.57 s [vector] imapMaybe: OK
  12314. 292.57 s [vector] +++ OK, passed 100 tests.
  12315. 292.57 s [vector] takeWhile: OK
  12316. 292.57 s [vector] +++ OK, passed 100 tests.
  12317. 292.57 s [vector] dropWhile: OK
  12318. 292.57 s [vector] +++ OK, passed 100 tests.
  12319. 292.57 s [vector] partition: OK
  12320. 292.57 s [vector] +++ OK, passed 100 tests.
  12321. 292.57 s [vector] partitionWith: OK
  12322. 292.57 s [vector] +++ OK, passed 100 tests.
  12323. 292.57 s [vector] span: OK
  12324. 292.57 s [vector] +++ OK, passed 100 tests.
  12325. 292.57 s [vector] break: OK
  12326. 292.57 s [vector] +++ OK, passed 100 tests.
  12327. 292.57 s [vector] spanR: OK
  12328. 292.57 s [vector] +++ OK, passed 100 tests.
  12329. 292.57 s [vector] breakR: OK
  12330. 292.57 s [vector] +++ OK, passed 100 tests.
  12331. 292.57 s [vector] groupBy: OK
  12332. 292.57 s [vector] +++ OK, passed 100 tests.
  12333. 292.57 s [vector] elem: OK
  12334. 292.57 s [vector] +++ OK, passed 100 tests.
  12335. 292.57 s [vector] notElem: OK
  12336. 292.57 s [vector] +++ OK, passed 100 tests.
  12337. 292.57 s [vector] find: OK
  12338. 292.57 s [vector] +++ OK, passed 100 tests.
  12339. 292.57 s [vector] findIndex: OK
  12340. 292.57 s [vector] +++ OK, passed 100 tests.
  12341. 292.57 s [vector] findIndexR: OK
  12342. 292.57 s [vector] +++ OK, passed 100 tests.
  12343. 292.57 s [vector] findIndices: OK
  12344. 292.57 s [vector] +++ OK, passed 100 tests.
  12345. 292.57 s [vector] elemIndex: OK
  12346. 292.57 s [vector] +++ OK, passed 100 tests.
  12347. 292.57 s [vector] elemIndices: OK
  12348. 292.57 s [vector] +++ OK, passed 100 tests.
  12349. 292.57 s [vector] foldl: OK (0.01s)
  12350. 292.57 s [vector] +++ OK, passed 100 tests.
  12351. 292.57 s [vector] foldl1: OK
  12352. 292.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12353. 292.57 s [vector] foldl': OK
  12354. 292.57 s [vector] +++ OK, passed 100 tests.
  12355. 292.57 s [vector] foldl1': OK
  12356. 292.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12357. 292.57 s [vector] foldr: OK
  12358. 292.57 s [vector] +++ OK, passed 100 tests.
  12359. 292.57 s [vector] foldr1: OK (0.01s)
  12360. 292.57 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12361. 292.57 s [vector] foldr': OK (0.01s)
  12362. 292.57 s [vector] +++ OK, passed 100 tests.
  12363. 292.57 s [vector] foldr1': OK (0.02s)
  12364. 292.57 s [vector] +++ OK, passed 100 tests; 24 discarded.
  12365. 292.57 s [vector] ifoldl: OK (0.02s)
  12366. 292.57 s [vector] +++ OK, passed 100 tests.
  12367. 292.59 s [vector] ifoldl': OK (0.01s)
  12368. 292.59 s [vector] +++ OK, passed 100 tests.
  12369. 292.59 s [vector] ifoldr: OK (0.01s)
  12370. 292.59 s [vector] +++ OK, passed 100 tests.
  12371. 292.61 s [vector] ifoldr': OK (0.01s)
  12372. 292.61 s [vector] +++ OK, passed 100 tests.
  12373. 292.61 s [vector] ifoldM: OK (0.01s)
  12374. 292.61 s [vector] +++ OK, passed 100 tests.
  12375. 292.62 s [vector] ifoldM': OK (0.01s)
  12376. 292.62 s [vector] +++ OK, passed 100 tests.
  12377. 292.67 s [vector] ifoldM_: OK (0.02s)
  12378. 292.67 s [vector] +++ OK, passed 100 tests.
  12379. 292.69 s [vector] ifoldM'_: OK (0.03s)
  12380. 292.69 s [vector] +++ OK, passed 100 tests.
  12381. 292.69 s [vector] all: OK
  12382. 292.70 s [vector] +++ OK, passed 100 tests.
  12383. 292.70 s [vector] any: OK
  12384. 292.70 s [vector] +++ OK, passed 100 tests.
  12385. 292.71 s [vector] prescanl: OK (0.02s)
  12386. 292.71 s [vector] +++ OK, passed 100 tests.
  12387. 292.73 s [vector] prescanl': OK (0.01s)
  12388. 292.73 s [vector] +++ OK, passed 100 tests.
  12389. 292.74 s [vector] postscanl: OK (0.01s)
  12390. 292.74 s [vector] +++ OK, passed 100 tests.
  12391. 292.74 s [vector] postscanl': OK (0.01s)
  12392. 292.74 s [vector] +++ OK, passed 100 tests.
  12393. 292.77 s [vector] scanl: OK
  12394. 292.77 s [vector] +++ OK, passed 100 tests.
  12395. 292.77 s [vector] scanl': OK (0.01s)
  12396. 292.77 s [vector] +++ OK, passed 100 tests.
  12397. 292.78 s [vector] scanl1: OK (0.01s)
  12398. 292.78 s [vector] +++ OK, passed 100 tests.
  12399. 292.79 s [vector] scanl1': OK (0.01s)
  12400. 292.79 s [vector] +++ OK, passed 100 tests.
  12401. 292.81 s [vector] iscanl: OK (0.02s)
  12402. 292.81 s [vector] +++ OK, passed 100 tests.
  12403. 292.83 s [vector] iscanl': OK (0.01s)
  12404. 292.83 s [vector] +++ OK, passed 100 tests.
  12405. 292.83 s [vector] prescanr: OK (0.01s)
  12406. 292.83 s [vector] +++ OK, passed 100 tests.
  12407. 292.85 s [vector] prescanr': OK (0.01s)
  12408. 292.86 s [vector] +++ OK, passed 100 tests.
  12409. 292.87 s [vector] postscanr: OK (0.01s)
  12410. 292.87 s [vector] +++ OK, passed 100 tests.
  12411. 292.87 s [vector] postscanr': OK (0.01s)
  12412. 292.87 s [vector] +++ OK, passed 100 tests.
  12413. 292.89 s [vector] scanr: OK (0.01s)
  12414. 292.89 s [vector] +++ OK, passed 100 tests.
  12415. 292.91 s [vector] scanr': OK (0.01s)
  12416. 292.91 s [vector] +++ OK, passed 100 tests.
  12417. 292.91 s [vector] scanr1: OK (0.01s)
  12418. 292.91 s [vector] +++ OK, passed 100 tests.
  12419. 292.93 s [vector] scanr1': OK (0.01s)
  12420. 292.93 s [vector] +++ OK, passed 100 tests.
  12421. 292.93 s [vector] iscanr: OK (0.01s)
  12422. 292.93 s [vector] +++ OK, passed 100 tests.
  12423. 292.94 s [vector] iscanr': OK (0.02s)
  12424. 292.94 s [vector] +++ OK, passed 100 tests.
  12425. 292.94 s [vector] mut_read: OK
  12426. 292.94 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12427. 292.95 s [vector] mut_write: OK
  12428. 292.95 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12429. 292.95 s [vector] mut_modify: OK
  12430. 292.95 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12431. 292.95 s [vector] mut_generate: OK
  12432. 292.95 s [vector] +++ OK, passed 100 tests.
  12433. 292.97 s [vector] mut_generateM: OK (0.02s)
  12434. 292.97 s [vector] +++ OK, passed 100 tests.
  12435. 293.01 s [vector] mut_mapM_: OK (0.03s)
  12436. 293.01 s [vector] +++ OK, passed 100 tests.
  12437. 293.03 s [vector] mut_imapM_: OK (0.03s)
  12438. 293.03 s [vector] +++ OK, passed 100 tests.
  12439. 293.07 s [vector] mut_forM_: OK (0.03s)
  12440. 293.07 s [vector] +++ OK, passed 100 tests.
  12441. 293.11 s [vector] mut_iforM_: OK (0.04s)
  12442. 293.11 s [vector] +++ OK, passed 100 tests.
  12443. 293.12 s [vector] mut_foldr: OK (0.01s)
  12444. 293.12 s [vector] +++ OK, passed 100 tests.
  12445. 293.13 s [vector] mut_foldr': OK (0.01s)
  12446. 293.13 s [vector] +++ OK, passed 100 tests.
  12447. 293.14 s [vector] mut_foldl: OK
  12448. 293.15 s [vector] +++ OK, passed 100 tests.
  12449. 293.15 s [vector] mut_foldl': OK (0.01s)
  12450. 293.15 s [vector] +++ OK, passed 100 tests.
  12451. 293.16 s [vector] mut_ifoldr: OK (0.01s)
  12452. 293.16 s [vector] +++ OK, passed 100 tests.
  12453. 293.17 s [vector] mut_ifoldr': OK (0.01s)
  12454. 293.17 s [vector] +++ OK, passed 100 tests.
  12455. 293.19 s [vector] mut_ifoldl: OK (0.01s)
  12456. 293.19 s [vector] +++ OK, passed 100 tests.
  12457. 293.19 s [vector] mut_ifoldl': OK (0.01s)
  12458. 293.19 s [vector] +++ OK, passed 100 tests.
  12459. 293.21 s [vector] mut_foldM: OK (0.01s)
  12460. 293.21 s [vector] +++ OK, passed 100 tests.
  12461. 293.21 s [vector] mut_foldM': OK (0.01s)
  12462. 293.21 s [vector] +++ OK, passed 100 tests.
  12463. 293.23 s [vector] mut_foldrM: OK (0.01s)
  12464. 293.23 s [vector] +++ OK, passed 100 tests.
  12465. 293.24 s [vector] mut_foldrM': OK (0.01s)
  12466. 293.24 s [vector] +++ OK, passed 100 tests.
  12467. 293.25 s [vector] mut_ifoldM: OK (0.01s)
  12468. 293.25 s [vector] +++ OK, passed 100 tests.
  12469. 293.27 s [vector] mut_ifoldM': OK (0.01s)
  12470. 293.27 s [vector] +++ OK, passed 100 tests.
  12471. 293.28 s [vector] mut_ifoldrM: OK (0.01s)
  12472. 293.28 s [vector] +++ OK, passed 100 tests.
  12473. 293.29 s [vector] mut_ifoldrM': OK (0.01s)
  12474. 293.29 s [vector] +++ OK, passed 100 tests.
  12475. 293.29 s [vector] compare: OK
  12476. 293.29 s [vector] +++ OK, passed 100 tests.
  12477. 293.29 s [vector] maximum: OK
  12478. 293.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12479. 293.29 s [vector] minimum: OK
  12480. 293.29 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12481. 293.29 s [vector] minIndex: OK
  12482. 293.29 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12483. 293.29 s [vector] maxIndex: OK
  12484. 293.29 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12485. 293.29 s [vector] maximumBy: OK
  12486. 293.29 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12487. 293.29 s [vector] minimumBy: OK
  12488. 293.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12489. 293.29 s [vector] maximumOn: OK
  12490. 293.29 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12491. 293.29 s [vector] minimumOn: OK
  12492. 293.29 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12493. 293.29 s [vector] maxIndexBy: OK
  12494. 293.29 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12495. 293.29 s [vector] minIndexBy: OK
  12496. 293.29 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12497. 293.29 s [vector] ListFirstMaxIndexWins: OK
  12498. 293.29 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12499. 293.30 s [vector] FalseListFirstMaxIndexWins: OK
  12500. 293.30 s [vector] +++ OK, failed as expected. (after 1 test):
  12501. 293.30 s [vector] Exception:
  12502. 293.30 s [vector] Prelude.foldr1: empty list
  12503. 293.30 s [vector] CallStack (from HasCallStack):
  12504. 293.30 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  12505. 293.30 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  12506. 293.30 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12507. 293.30 s [vector] []
  12508. 293.30 s [vector] zip: OK
  12509. 293.30 s [vector] +++ OK, passed 100 tests.
  12510. 293.30 s [vector] zip3: OK
  12511. 293.30 s [vector] +++ OK, passed 100 tests.
  12512. 293.30 s [vector] unzip: OK
  12513. 293.30 s [vector] +++ OK, passed 100 tests.
  12514. 293.30 s [vector] unzip3: OK
  12515. 293.30 s [vector] +++ OK, passed 100 tests.
  12516. 293.31 s [vector] indexed: OK
  12517. 293.31 s [vector] +++ OK, passed 100 tests.
  12518. 293.31 s [vector] update: OK
  12519. 293.31 s [vector] +++ OK, passed 100 tests.
  12520. 293.31 s [vector] mempty: OK
  12521. 293.31 s [vector] +++ OK, passed 1 test.
  12522. 293.31 s [vector] mappend: OK
  12523. 293.31 s [vector] +++ OK, passed 100 tests.
  12524. 293.33 s [vector] mconcat: OK (0.02s)
  12525. 293.33 s [vector] +++ OK, passed 100 tests.
  12526. 293.33 s [vector] glength: OK
  12527. 293.33 s [vector] +++ OK, passed 100 tests.
  12528. 293.33 s [vector] sum: OK
  12529. 293.33 s [vector] +++ OK, passed 100 tests.
  12530. 293.33 s [vector] product: OK
  12531. 293.33 s [vector] +++ OK, passed 100 tests.
  12532. 293.33 s [vector] enumFromN: OK
  12533. 293.33 s [vector] +++ OK, passed 100 tests.
  12534. 293.33 s [vector] enumFromThenN: OK
  12535. 293.33 s [vector] +++ OK, passed 100 tests.
  12536. 293.33 s [vector] enumFromTo: OK
  12537. 293.33 s [vector] +++ OK, passed 100 tests.
  12538. 293.33 s [vector] enumFromThenTo: OK
  12539. 293.33 s [vector] +++ OK, passed 100 tests.
  12540. 293.33 s [vector] (Int,Bool)
  12541. 293.33 s [vector] fromList.toList == id: OK
  12542. 293.33 s [vector] +++ OK, passed 100 tests.
  12543. 293.33 s [vector] toList.fromList == id: OK
  12544. 293.33 s [vector] +++ OK, passed 100 tests.
  12545. 293.34 s [vector] unstream.stream == id: OK
  12546. 293.34 s [vector] +++ OK, passed 100 tests.
  12547. 293.34 s [vector] stream.unstream == id: OK
  12548. 293.34 s [vector] +++ OK, passed 100 tests.
  12549. 293.34 s [vector] eq: OK
  12550. 293.34 s [vector] +++ OK, passed 100 tests.
  12551. 293.34 s [vector] length: OK
  12552. 293.34 s [vector] +++ OK, passed 100 tests.
  12553. 293.34 s [vector] null: OK
  12554. 293.34 s [vector] +++ OK, passed 100 tests.
  12555. 293.34 s [vector] index: OK
  12556. 293.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12557. 293.34 s [vector] safeIndex: OK
  12558. 293.34 s [vector] +++ OK, passed 100 tests.
  12559. 293.34 s [vector] head: OK
  12560. 293.34 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12561. 293.34 s [vector] last: OK
  12562. 293.34 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12563. 293.34 s [vector] unsafeIndex: OK
  12564. 293.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12565. 293.35 s [vector] unsafeHead: OK
  12566. 293.35 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12567. 293.35 s [vector] unsafeLast: OK
  12568. 293.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12569. 293.35 s [vector] slice: OK
  12570. 293.35 s [vector] +++ OK, passed 100 tests.
  12571. 293.35 s [vector] init: OK
  12572. 293.35 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12573. 293.35 s [vector] tail: OK
  12574. 293.35 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12575. 293.35 s [vector] take: OK
  12576. 293.35 s [vector] +++ OK, passed 100 tests.
  12577. 293.35 s [vector] drop: OK
  12578. 293.35 s [vector] +++ OK, passed 100 tests.
  12579. 293.35 s [vector] splitAt: OK
  12580. 293.35 s [vector] +++ OK, passed 100 tests.
  12581. 293.35 s [vector] empty: OK
  12582. 293.35 s [vector] +++ OK, passed 1 test.
  12583. 293.35 s [vector] singleton: OK
  12584. 293.35 s [vector] +++ OK, passed 100 tests.
  12585. 293.35 s [vector] replicate: OK
  12586. 293.35 s [vector] +++ OK, passed 100 tests.
  12587. 293.36 s [vector] generate: OK
  12588. 293.36 s [vector] +++ OK, passed 100 tests.
  12589. 293.36 s [vector] iterateN: OK
  12590. 293.36 s [vector] +++ OK, passed 100 tests.
  12591. 293.37 s [vector] iterateNM: OK
  12592. 293.37 s [vector] +++ OK, passed 100 tests.
  12593. 293.41 s [vector] generateM: OK (0.03s)
  12594. 293.41 s [vector] +++ OK, passed 100 tests.
  12595. 293.42 s [vector] replicateM: OK (0.01s)
  12596. 293.42 s [vector] +++ OK, passed 100 tests.
  12597. 293.42 s [vector] create: OK
  12598. 293.42 s [vector] +++ OK, passed 100 tests.
  12599. 293.42 s [vector] createT: OK
  12600. 293.42 s [vector] +++ OK, passed 100 tests.
  12601. 293.42 s [vector] unfoldr: OK
  12602. 293.42 s [vector] +++ OK, passed 100 tests.
  12603. 293.43 s [vector] unfoldrN: OK
  12604. 293.43 s [vector] +++ OK, passed 100 tests.
  12605. 293.43 s [vector] unfoldrExactN: OK
  12606. 293.43 s [vector] +++ OK, passed 100 tests.
  12607. 293.43 s [vector] unfoldrM: OK
  12608. 293.43 s [vector] +++ OK, passed 100 tests.
  12609. 293.43 s [vector] unfoldrNM: OK
  12610. 293.43 s [vector] +++ OK, passed 100 tests.
  12611. 293.45 s [vector] unfoldrExactNM: OK (0.01s)
  12612. 293.45 s [vector] +++ OK, passed 100 tests.
  12613. 293.45 s [vector] constructN: OK
  12614. 293.45 s [vector] +++ OK, passed 100 tests.
  12615. 293.46 s [vector] constructrN: OK
  12616. 293.46 s [vector] +++ OK, passed 100 tests.
  12617. 293.46 s [vector] cons: OK
  12618. 293.46 s [vector] +++ OK, passed 100 tests.
  12619. 293.46 s [vector] snoc: OK
  12620. 293.46 s [vector] +++ OK, passed 100 tests.
  12621. 293.46 s [vector] append: OK
  12622. 293.46 s [vector] +++ OK, passed 100 tests.
  12623. 293.50 s [vector] concat: OK (0.02s)
  12624. 293.50 s [vector] +++ OK, passed 100 tests.
  12625. 293.50 s [vector] force: OK
  12626. 293.50 s [vector] +++ OK, passed 100 tests.
  12627. 293.50 s [vector] upd: OK
  12628. 293.50 s [vector] +++ OK, passed 100 tests.
  12629. 293.51 s [vector] accum: OK
  12630. 293.51 s [vector] +++ OK, passed 100 tests.
  12631. 293.51 s [vector] reverse: OK
  12632. 293.51 s [vector] +++ OK, passed 100 tests.
  12633. 293.51 s [vector] backpermute: OK
  12634. 293.51 s [vector] +++ OK, passed 100 tests.
  12635. 293.51 s [vector] map: OK
  12636. 293.51 s [vector] +++ OK, passed 100 tests.
  12637. 293.51 s [vector] imap: OK
  12638. 293.52 s [vector] +++ OK, passed 100 tests.
  12639. 293.52 s [vector] concatMap: OK
  12640. 293.52 s [vector] +++ OK, passed 100 tests.
  12641. 293.52 s [vector] mapM: OK
  12642. 293.53 s [vector] +++ OK, passed 100 tests.
  12643. 293.55 s [vector] mapM_: OK (0.02s)
  12644. 293.55 s [vector] +++ OK, passed 100 tests.
  12645. 293.55 s [vector] forM: OK
  12646. 293.55 s [vector] +++ OK, passed 100 tests.
  12647. 293.57 s [vector] forM_: OK (0.02s)
  12648. 293.57 s [vector] +++ OK, passed 100 tests.
  12649. 293.57 s [vector] imapM: OK
  12650. 293.57 s [vector] +++ OK, passed 100 tests.
  12651. 293.60 s [vector] imapM_: OK (0.03s)
  12652. 293.61 s [vector] +++ OK, passed 100 tests.
  12653. 293.61 s [vector] zipWith: OK
  12654. 293.61 s [vector] +++ OK, passed 100 tests.
  12655. 293.61 s [vector] zipWith3: OK
  12656. 293.61 s [vector] +++ OK, passed 100 tests.
  12657. 293.61 s [vector] izipWith: OK
  12658. 293.61 s [vector] +++ OK, passed 100 tests.
  12659. 293.61 s [vector] izipWith3: OK
  12660. 293.62 s [vector] +++ OK, passed 100 tests.
  12661. 293.62 s [vector] izipWithM: OK
  12662. 293.62 s [vector] +++ OK, passed 100 tests.
  12663. 293.64 s [vector] izipWithM_: OK (0.02s)
  12664. 293.65 s [vector] +++ OK, passed 100 tests.
  12665. 293.65 s [vector] zipWithM: OK
  12666. 293.65 s [vector] +++ OK, passed 100 tests.
  12667. 293.66 s [vector] zipWithM_: OK (0.02s)
  12668. 293.66 s [vector] +++ OK, passed 100 tests.
  12669. 293.67 s [vector] filter: OK
  12670. 293.67 s [vector] +++ OK, passed 100 tests.
  12671. 293.67 s [vector] ifilter: OK
  12672. 293.67 s [vector] +++ OK, passed 100 tests.
  12673. 293.70 s [vector] filterM: OK (0.04s)
  12674. 293.70 s [vector] +++ OK, passed 100 tests.
  12675. 293.71 s [vector] uniq: OK
  12676. 293.71 s [vector] +++ OK, passed 100 tests.
  12677. 293.71 s [vector] mapMaybe: OK
  12678. 293.71 s [vector] +++ OK, passed 100 tests.
  12679. 293.71 s [vector] imapMaybe: OK
  12680. 293.71 s [vector] +++ OK, passed 100 tests.
  12681. 293.71 s [vector] takeWhile: OK
  12682. 293.71 s [vector] +++ OK, passed 100 tests.
  12683. 293.71 s [vector] dropWhile: OK
  12684. 293.71 s [vector] +++ OK, passed 100 tests.
  12685. 293.71 s [vector] partition: OK
  12686. 293.71 s [vector] +++ OK, passed 100 tests.
  12687. 293.72 s [vector] partitionWith: OK
  12688. 293.72 s [vector] +++ OK, passed 100 tests.
  12689. 293.72 s [vector] span: OK
  12690. 293.72 s [vector] +++ OK, passed 100 tests.
  12691. 293.72 s [vector] break: OK
  12692. 293.72 s [vector] +++ OK, passed 100 tests.
  12693. 293.72 s [vector] spanR: OK
  12694. 293.72 s [vector] +++ OK, passed 100 tests.
  12695. 293.72 s [vector] breakR: OK
  12696. 293.73 s [vector] +++ OK, passed 100 tests.
  12697. 293.73 s [vector] groupBy: OK
  12698. 293.73 s [vector] +++ OK, passed 100 tests.
  12699. 293.73 s [vector] elem: OK
  12700. 293.73 s [vector] +++ OK, passed 100 tests.
  12701. 293.73 s [vector] notElem: OK
  12702. 293.73 s [vector] +++ OK, passed 100 tests.
  12703. 293.73 s [vector] find: OK
  12704. 293.73 s [vector] +++ OK, passed 100 tests.
  12705. 293.73 s [vector] findIndex: OK
  12706. 293.73 s [vector] +++ OK, passed 100 tests.
  12707. 293.73 s [vector] findIndexR: OK
  12708. 293.73 s [vector] +++ OK, passed 100 tests.
  12709. 293.74 s [vector] findIndices: OK
  12710. 293.74 s [vector] +++ OK, passed 100 tests.
  12711. 293.74 s [vector] elemIndex: OK
  12712. 293.75 s [vector] +++ OK, passed 100 tests.
  12713. 293.75 s [vector] elemIndices: OK
  12714. 293.75 s [vector] +++ OK, passed 100 tests.
  12715. 293.75 s [vector] foldl: OK
  12716. 293.75 s [vector] +++ OK, passed 100 tests.
  12717. 293.75 s [vector] foldl1: OK
  12718. 293.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12719. 293.75 s [vector] foldl': OK
  12720. 293.75 s [vector] +++ OK, passed 100 tests.
  12721. 293.75 s [vector] foldl1': OK
  12722. 293.75 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12723. 293.75 s [vector] foldr: OK
  12724. 293.75 s [vector] +++ OK, passed 100 tests.
  12725. 293.76 s [vector] foldr1: OK
  12726. 293.76 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12727. 293.76 s [vector] foldr': OK
  12728. 293.76 s [vector] +++ OK, passed 100 tests.
  12729. 293.76 s [vector] foldr1': OK
  12730. 293.76 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12731. 293.77 s [vector] ifoldl: OK
  12732. 293.77 s [vector] +++ OK, passed 100 tests.
  12733. 293.77 s [vector] ifoldl': OK
  12734. 293.77 s [vector] +++ OK, passed 100 tests.
  12735. 293.78 s [vector] ifoldr: OK
  12736. 293.78 s [vector] +++ OK, passed 100 tests.
  12737. 293.78 s [vector] ifoldr': OK
  12738. 293.78 s [vector] +++ OK, passed 100 tests.
  12739. 293.78 s [vector] ifoldM: OK
  12740. 293.78 s [vector] +++ OK, passed 100 tests.
  12741. 293.79 s [vector] ifoldM': OK
  12742. 293.79 s [vector] +++ OK, passed 100 tests.
  12743. 293.81 s [vector] ifoldM_: OK (0.02s)
  12744. 293.81 s [vector] +++ OK, passed 100 tests.
  12745. 293.83 s [vector] ifoldM'_: OK (0.03s)
  12746. 293.83 s [vector] +++ OK, passed 100 tests.
  12747. 293.83 s [vector] all: OK
  12748. 293.83 s [vector] +++ OK, passed 100 tests.
  12749. 293.83 s [vector] any: OK
  12750. 293.83 s [vector] +++ OK, passed 100 tests.
  12751. 293.84 s [vector] prescanl: OK
  12752. 293.84 s [vector] +++ OK, passed 100 tests.
  12753. 293.85 s [vector] prescanl': OK
  12754. 293.85 s [vector] +++ OK, passed 100 tests.
  12755. 293.85 s [vector] postscanl: OK
  12756. 293.85 s [vector] +++ OK, passed 100 tests.
  12757. 293.85 s [vector] postscanl': OK
  12758. 293.85 s [vector] +++ OK, passed 100 tests.
  12759. 293.86 s [vector] scanl: OK
  12760. 293.86 s [vector] +++ OK, passed 100 tests.
  12761. 293.86 s [vector] scanl': OK
  12762. 293.86 s [vector] +++ OK, passed 100 tests.
  12763. 293.87 s [vector] scanl1: OK
  12764. 293.87 s [vector] +++ OK, passed 100 tests.
  12765. 293.87 s [vector] scanl1': OK
  12766. 293.87 s [vector] +++ OK, passed 100 tests.
  12767. 293.87 s [vector] iscanl: OK
  12768. 293.87 s [vector] +++ OK, passed 100 tests.
  12769. 293.88 s [vector] iscanl': OK
  12770. 293.88 s [vector] +++ OK, passed 100 tests.
  12771. 293.89 s [vector] prescanr: OK
  12772. 293.89 s [vector] +++ OK, passed 100 tests.
  12773. 293.89 s [vector] prescanr': OK
  12774. 293.89 s [vector] +++ OK, passed 100 tests.
  12775. 293.89 s [vector] postscanr: OK
  12776. 293.89 s [vector] +++ OK, passed 100 tests.
  12777. 293.89 s [vector] postscanr': OK
  12778. 293.89 s [vector] +++ OK, passed 100 tests.
  12779. 293.90 s [vector] scanr: OK
  12780. 293.90 s [vector] +++ OK, passed 100 tests.
  12781. 293.90 s [vector] scanr': OK
  12782. 293.91 s [vector] +++ OK, passed 100 tests.
  12783. 293.91 s [vector] scanr1: OK
  12784. 293.91 s [vector] +++ OK, passed 100 tests.
  12785. 293.91 s [vector] scanr1': OK
  12786. 293.91 s [vector] +++ OK, passed 100 tests.
  12787. 293.91 s [vector] iscanr: OK
  12788. 293.91 s [vector] +++ OK, passed 100 tests.
  12789. 293.92 s [vector] iscanr': OK
  12790. 293.92 s [vector] +++ OK, passed 100 tests.
  12791. 293.92 s [vector] mut_read: OK
  12792. 293.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12793. 293.92 s [vector] mut_write: OK
  12794. 293.92 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12795. 293.92 s [vector] mut_modify: OK
  12796. 293.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12797. 293.93 s [vector] mut_generate: OK
  12798. 293.93 s [vector] +++ OK, passed 100 tests.
  12799. 293.93 s [vector] mut_generateM: OK
  12800. 293.93 s [vector] +++ OK, passed 100 tests.
  12801. 293.95 s [vector] mut_mapM_: OK (0.02s)
  12802. 293.95 s [vector] +++ OK, passed 100 tests.
  12803. 293.97 s [vector] mut_imapM_: OK (0.02s)
  12804. 293.97 s [vector] +++ OK, passed 100 tests.
  12805. 293.99 s [vector] mut_forM_: OK (0.02s)
  12806. 293.99 s [vector] +++ OK, passed 100 tests.
  12807. 294.02 s [vector] mut_iforM_: OK (0.02s)
  12808. 294.02 s [vector] +++ OK, passed 100 tests.
  12809. 294.03 s [vector] mut_foldr: OK
  12810. 294.03 s [vector] +++ OK, passed 100 tests.
  12811. 294.04 s [vector] mut_foldr': OK
  12812. 294.04 s [vector] +++ OK, passed 100 tests.
  12813. 294.04 s [vector] mut_foldl: OK
  12814. 294.04 s [vector] +++ OK, passed 100 tests.
  12815. 294.04 s [vector] mut_foldl': OK
  12816. 294.05 s [vector] +++ OK, passed 100 tests.
  12817. 294.05 s [vector] mut_ifoldr: OK
  12818. 294.05 s [vector] +++ OK, passed 100 tests.
  12819. 294.05 s [vector] mut_ifoldr': OK
  12820. 294.05 s [vector] +++ OK, passed 100 tests.
  12821. 294.05 s [vector] mut_ifoldl: OK
  12822. 294.05 s [vector] +++ OK, passed 100 tests.
  12823. 294.05 s [vector] mut_ifoldl': OK
  12824. 294.05 s [vector] +++ OK, passed 100 tests.
  12825. 294.05 s [vector] mut_foldM: OK
  12826. 294.05 s [vector] +++ OK, passed 100 tests.
  12827. 294.06 s [vector] mut_foldM': OK
  12828. 294.06 s [vector] +++ OK, passed 100 tests.
  12829. 294.06 s [vector] mut_foldrM: OK
  12830. 294.06 s [vector] +++ OK, passed 100 tests.
  12831. 294.07 s [vector] mut_foldrM': OK
  12832. 294.07 s [vector] +++ OK, passed 100 tests.
  12833. 294.07 s [vector] mut_ifoldM: OK
  12834. 294.07 s [vector] +++ OK, passed 100 tests.
  12835. 294.07 s [vector] mut_ifoldM': OK
  12836. 294.07 s [vector] +++ OK, passed 100 tests.
  12837. 294.07 s [vector] mut_ifoldrM: OK
  12838. 294.07 s [vector] +++ OK, passed 100 tests.
  12839. 294.07 s [vector] mut_ifoldrM': OK
  12840. 294.07 s [vector] +++ OK, passed 100 tests.
  12841. 294.07 s [vector] compare: OK
  12842. 294.08 s [vector] +++ OK, passed 100 tests.
  12843. 294.08 s [vector] maximum: OK
  12844. 294.08 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12845. 294.08 s [vector] minimum: OK
  12846. 294.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12847. 294.08 s [vector] minIndex: OK
  12848. 294.08 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12849. 294.08 s [vector] maxIndex: OK
  12850. 294.08 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12851. 294.08 s [vector] maximumBy: OK
  12852. 294.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12853. 294.08 s [vector] minimumBy: OK
  12854. 294.08 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12855. 294.08 s [vector] maximumOn: OK
  12856. 294.08 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12857. 294.08 s [vector] minimumOn: OK
  12858. 294.08 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12859. 294.08 s [vector] maxIndexBy: OK
  12860. 294.08 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12861. 294.08 s [vector] minIndexBy: OK
  12862. 294.08 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12863. 294.08 s [vector] ListFirstMaxIndexWins: OK
  12864. 294.08 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12865. 294.08 s [vector] FalseListFirstMaxIndexWins: OK
  12866. 294.09 s [vector] +++ OK, failed as expected. (after 1 test):
  12867. 294.09 s [vector] Exception:
  12868. 294.09 s [vector] Prelude.foldr1: empty list
  12869. 294.09 s [vector] CallStack (from HasCallStack):
  12870. 294.09 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  12871. 294.09 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  12872. 294.09 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  12873. 294.09 s [vector] []
  12874. 294.09 s [vector] zip: OK
  12875. 294.09 s [vector] +++ OK, passed 100 tests.
  12876. 294.09 s [vector] zip3: OK
  12877. 294.09 s [vector] +++ OK, passed 100 tests.
  12878. 294.09 s [vector] unzip: OK
  12879. 294.09 s [vector] +++ OK, passed 100 tests.
  12880. 294.09 s [vector] unzip3: OK
  12881. 294.09 s [vector] +++ OK, passed 100 tests.
  12882. 294.10 s [vector] indexed: OK
  12883. 294.10 s [vector] +++ OK, passed 100 tests.
  12884. 294.10 s [vector] update: OK
  12885. 294.10 s [vector] +++ OK, passed 100 tests.
  12886. 294.10 s [vector] mempty: OK
  12887. 294.11 s [vector] +++ OK, passed 1 test.
  12888. 294.11 s [vector] mappend: OK
  12889. 294.11 s [vector] +++ OK, passed 100 tests.
  12890. 294.13 s [vector] mconcat: OK (0.04s)
  12891. 294.13 s [vector] +++ OK, passed 100 tests.
  12892. 294.14 s [vector] glength: OK
  12893. 294.14 s [vector] +++ OK, passed 100 tests.
  12894. 294.14 s [vector] (Int,Bool,Int)
  12895. 294.14 s [vector] fromList.toList == id: OK
  12896. 294.14 s [vector] +++ OK, passed 100 tests.
  12897. 294.14 s [vector] toList.fromList == id: OK
  12898. 294.14 s [vector] +++ OK, passed 100 tests.
  12899. 294.14 s [vector] unstream.stream == id: OK
  12900. 294.14 s [vector] +++ OK, passed 100 tests.
  12901. 294.14 s [vector] stream.unstream == id: OK
  12902. 294.14 s [vector] +++ OK, passed 100 tests.
  12903. 294.14 s [vector] eq: OK
  12904. 294.14 s [vector] +++ OK, passed 100 tests.
  12905. 294.14 s [vector] length: OK
  12906. 294.14 s [vector] +++ OK, passed 100 tests.
  12907. 294.14 s [vector] null: OK
  12908. 294.14 s [vector] +++ OK, passed 100 tests.
  12909. 294.14 s [vector] index: OK
  12910. 294.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12911. 294.14 s [vector] safeIndex: OK
  12912. 294.15 s [vector] +++ OK, passed 100 tests.
  12913. 294.15 s [vector] head: OK
  12914. 294.15 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12915. 294.15 s [vector] last: OK
  12916. 294.15 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12917. 294.15 s [vector] unsafeIndex: OK
  12918. 294.15 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12919. 294.15 s [vector] unsafeHead: OK
  12920. 294.15 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12921. 294.15 s [vector] unsafeLast: OK
  12922. 294.15 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12923. 294.15 s [vector] slice: OK
  12924. 294.15 s [vector] +++ OK, passed 100 tests.
  12925. 294.15 s [vector] init: OK
  12926. 294.15 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12927. 294.15 s [vector] tail: OK
  12928. 294.15 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12929. 294.15 s [vector] take: OK
  12930. 294.15 s [vector] +++ OK, passed 100 tests.
  12931. 294.16 s [vector] drop: OK
  12932. 294.16 s [vector] +++ OK, passed 100 tests.
  12933. 294.16 s [vector] splitAt: OK
  12934. 294.16 s [vector] +++ OK, passed 100 tests.
  12935. 294.16 s [vector] empty: OK
  12936. 294.16 s [vector] +++ OK, passed 1 test.
  12937. 294.16 s [vector] singleton: OK
  12938. 294.16 s [vector] +++ OK, passed 100 tests.
  12939. 294.16 s [vector] replicate: OK
  12940. 294.16 s [vector] +++ OK, passed 100 tests.
  12941. 294.16 s [vector] generate: OK
  12942. 294.16 s [vector] +++ OK, passed 100 tests.
  12943. 294.16 s [vector] iterateN: OK
  12944. 294.17 s [vector] +++ OK, passed 100 tests.
  12945. 294.19 s [vector] iterateNM: OK (0.01s)
  12946. 294.19 s [vector] +++ OK, passed 100 tests.
  12947. 294.21 s [vector] generateM: OK (0.03s)
  12948. 294.21 s [vector] +++ OK, passed 100 tests.
  12949. 294.21 s [vector] replicateM: OK (0.01s)
  12950. 294.21 s [vector] +++ OK, passed 100 tests.
  12951. 294.22 s [vector] create: OK
  12952. 294.22 s [vector] +++ OK, passed 100 tests.
  12953. 294.22 s [vector] createT: OK
  12954. 294.22 s [vector] +++ OK, passed 100 tests.
  12955. 294.22 s [vector] unfoldr: OK
  12956. 294.22 s [vector] +++ OK, passed 100 tests.
  12957. 294.22 s [vector] unfoldrN: OK
  12958. 294.22 s [vector] +++ OK, passed 100 tests.
  12959. 294.22 s [vector] unfoldrExactN: OK
  12960. 294.22 s [vector] +++ OK, passed 100 tests.
  12961. 294.23 s [vector] unfoldrM: OK
  12962. 294.23 s [vector] +++ OK, passed 100 tests.
  12963. 294.23 s [vector] unfoldrNM: OK
  12964. 294.23 s [vector] +++ OK, passed 100 tests.
  12965. 294.25 s [vector] unfoldrExactNM: OK (0.02s)
  12966. 294.25 s [vector] +++ OK, passed 100 tests.
  12967. 294.25 s [vector] constructN: OK
  12968. 294.25 s [vector] +++ OK, passed 100 tests.
  12969. 294.26 s [vector] constructrN: OK
  12970. 294.26 s [vector] +++ OK, passed 100 tests.
  12971. 294.26 s [vector] cons: OK
  12972. 294.26 s [vector] +++ OK, passed 100 tests.
  12973. 294.26 s [vector] snoc: OK
  12974. 294.26 s [vector] +++ OK, passed 100 tests.
  12975. 294.27 s [vector] append: OK
  12976. 294.27 s [vector] +++ OK, passed 100 tests.
  12977. 294.31 s [vector] concat: OK (0.04s)
  12978. 294.31 s [vector] +++ OK, passed 100 tests.
  12979. 294.31 s [vector] force: OK
  12980. 294.31 s [vector] +++ OK, passed 100 tests.
  12981. 294.32 s [vector] upd: OK
  12982. 294.32 s [vector] +++ OK, passed 100 tests.
  12983. 294.32 s [vector] accum: OK
  12984. 294.32 s [vector] +++ OK, passed 100 tests.
  12985. 294.32 s [vector] reverse: OK
  12986. 294.33 s [vector] +++ OK, passed 100 tests.
  12987. 294.34 s [vector] backpermute: OK
  12988. 294.34 s [vector] +++ OK, passed 100 tests.
  12989. 294.34 s [vector] map: OK
  12990. 294.35 s [vector] +++ OK, passed 100 tests.
  12991. 294.35 s [vector] imap: OK
  12992. 294.35 s [vector] +++ OK, passed 100 tests.
  12993. 294.35 s [vector] concatMap: OK
  12994. 294.35 s [vector] +++ OK, passed 100 tests.
  12995. 294.35 s [vector] mapM: OK
  12996. 294.35 s [vector] +++ OK, passed 100 tests.
  12997. 294.39 s [vector] mapM_: OK (0.03s)
  12998. 294.39 s [vector] +++ OK, passed 100 tests.
  12999. 294.39 s [vector] forM: OK
  13000. 294.39 s [vector] +++ OK, passed 100 tests.
  13001. 294.43 s [vector] forM_: OK (0.04s)
  13002. 294.43 s [vector] +++ OK, passed 100 tests.
  13003. 294.43 s [vector] imapM: OK
  13004. 294.43 s [vector] +++ OK, passed 100 tests.
  13005. 294.47 s [vector] imapM_: OK (0.03s)
  13006. 294.47 s [vector] +++ OK, passed 100 tests.
  13007. 294.47 s [vector] zipWith: OK
  13008. 294.47 s [vector] +++ OK, passed 100 tests.
  13009. 294.47 s [vector] zipWith3: OK
  13010. 294.47 s [vector] +++ OK, passed 100 tests.
  13011. 294.48 s [vector] izipWith: OK
  13012. 294.48 s [vector] +++ OK, passed 100 tests.
  13013. 294.49 s [vector] izipWith3: OK
  13014. 294.49 s [vector] +++ OK, passed 100 tests.
  13015. 294.49 s [vector] izipWithM: OK
  13016. 294.49 s [vector] +++ OK, passed 100 tests.
  13017. 294.53 s [vector] izipWithM_: OK (0.03s)
  13018. 294.53 s [vector] +++ OK, passed 100 tests.
  13019. 294.53 s [vector] zipWithM: OK
  13020. 294.53 s [vector] +++ OK, passed 100 tests.
  13021. 294.56 s [vector] zipWithM_: OK (0.03s)
  13022. 294.56 s [vector] +++ OK, passed 100 tests.
  13023. 294.56 s [vector] filter: OK
  13024. 294.56 s [vector] +++ OK, passed 100 tests.
  13025. 294.57 s [vector] ifilter: OK
  13026. 294.57 s [vector] +++ OK, passed 100 tests.
  13027. 294.61 s [vector] filterM: OK (0.05s)
  13028. 294.61 s [vector] +++ OK, passed 100 tests.
  13029. 294.62 s [vector] uniq: OK
  13030. 294.62 s [vector] +++ OK, passed 100 tests.
  13031. 294.62 s [vector] mapMaybe: OK
  13032. 294.62 s [vector] +++ OK, passed 100 tests.
  13033. 294.62 s [vector] imapMaybe: OK
  13034. 294.62 s [vector] +++ OK, passed 100 tests.
  13035. 294.62 s [vector] takeWhile: OK
  13036. 294.63 s [vector] +++ OK, passed 100 tests.
  13037. 294.63 s [vector] dropWhile: OK
  13038. 294.63 s [vector] +++ OK, passed 100 tests.
  13039. 294.63 s [vector] partition: OK
  13040. 294.63 s [vector] +++ OK, passed 100 tests.
  13041. 294.64 s [vector] partitionWith: OK
  13042. 294.64 s [vector] +++ OK, passed 100 tests.
  13043. 294.64 s [vector] span: OK
  13044. 294.64 s [vector] +++ OK, passed 100 tests.
  13045. 294.64 s [vector] break: OK
  13046. 294.64 s [vector] +++ OK, passed 100 tests.
  13047. 294.65 s [vector] spanR: OK
  13048. 294.65 s [vector] +++ OK, passed 100 tests.
  13049. 294.65 s [vector] breakR: OK
  13050. 294.65 s [vector] +++ OK, passed 100 tests.
  13051. 294.65 s [vector] groupBy: OK
  13052. 294.65 s [vector] +++ OK, passed 100 tests.
  13053. 294.65 s [vector] elem: OK
  13054. 294.65 s [vector] +++ OK, passed 100 tests.
  13055. 294.65 s [vector] notElem: OK
  13056. 294.66 s [vector] +++ OK, passed 100 tests.
  13057. 294.66 s [vector] find: OK
  13058. 294.66 s [vector] +++ OK, passed 100 tests.
  13059. 294.66 s [vector] findIndex: OK
  13060. 294.66 s [vector] +++ OK, passed 100 tests.
  13061. 294.66 s [vector] findIndexR: OK
  13062. 294.66 s [vector] +++ OK, passed 100 tests.
  13063. 294.66 s [vector] findIndices: OK
  13064. 294.66 s [vector] +++ OK, passed 100 tests.
  13065. 294.67 s [vector] elemIndex: OK
  13066. 294.67 s [vector] +++ OK, passed 100 tests.
  13067. 294.67 s [vector] elemIndices: OK
  13068. 294.67 s [vector] +++ OK, passed 100 tests.
  13069. 294.67 s [vector] foldl: OK
  13070. 294.67 s [vector] +++ OK, passed 100 tests.
  13071. 294.67 s [vector] foldl1: OK
  13072. 294.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13073. 294.68 s [vector] foldl': OK
  13074. 294.68 s [vector] +++ OK, passed 100 tests.
  13075. 294.68 s [vector] foldl1': OK
  13076. 294.69 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13077. 294.69 s [vector] foldr: OK
  13078. 294.69 s [vector] +++ OK, passed 100 tests.
  13079. 294.69 s [vector] foldr1: OK
  13080. 294.69 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13081. 294.70 s [vector] foldr': OK
  13082. 294.70 s [vector] +++ OK, passed 100 tests.
  13083. 294.71 s [vector] foldr1': OK
  13084. 294.71 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13085. 294.71 s [vector] ifoldl: OK
  13086. 294.71 s [vector] +++ OK, passed 100 tests.
  13087. 294.72 s [vector] ifoldl': OK
  13088. 294.73 s [vector] +++ OK, passed 100 tests.
  13089. 294.73 s [vector] ifoldr: OK
  13090. 294.73 s [vector] +++ OK, passed 100 tests.
  13091. 294.73 s [vector] ifoldr': OK
  13092. 294.73 s [vector] +++ OK, passed 100 tests.
  13093. 294.74 s [vector] ifoldM: OK
  13094. 294.75 s [vector] +++ OK, passed 100 tests.
  13095. 294.75 s [vector] ifoldM': OK
  13096. 294.76 s [vector] +++ OK, passed 100 tests.
  13097. 294.79 s [vector] ifoldM_: OK (0.03s)
  13098. 294.80 s [vector] +++ OK, passed 100 tests.
  13099. 294.81 s [vector] ifoldM'_: OK (0.04s)
  13100. 294.82 s [vector] +++ OK, passed 100 tests.
  13101. 294.82 s [vector] all: OK
  13102. 294.82 s [vector] +++ OK, passed 100 tests.
  13103. 294.82 s [vector] any: OK
  13104. 294.82 s [vector] +++ OK, passed 100 tests.
  13105. 294.82 s [vector] prescanl: OK
  13106. 294.82 s [vector] +++ OK, passed 100 tests.
  13107. 294.83 s [vector] prescanl': OK
  13108. 294.83 s [vector] +++ OK, passed 100 tests.
  13109. 294.84 s [vector] postscanl: OK
  13110. 294.84 s [vector] +++ OK, passed 100 tests.
  13111. 294.84 s [vector] postscanl': OK
  13112. 294.84 s [vector] +++ OK, passed 100 tests.
  13113. 294.85 s [vector] scanl: OK
  13114. 294.85 s [vector] +++ OK, passed 100 tests.
  13115. 294.85 s [vector] scanl': OK
  13116. 294.86 s [vector] +++ OK, passed 100 tests.
  13117. 294.87 s [vector] scanl1: OK
  13118. 294.87 s [vector] +++ OK, passed 100 tests.
  13119. 294.87 s [vector] scanl1': OK
  13120. 294.87 s [vector] +++ OK, passed 100 tests.
  13121. 294.88 s [vector] iscanl: OK
  13122. 294.88 s [vector] +++ OK, passed 100 tests.
  13123. 294.88 s [vector] iscanl': OK
  13124. 294.89 s [vector] +++ OK, passed 100 tests.
  13125. 294.89 s [vector] prescanr: OK
  13126. 294.89 s [vector] +++ OK, passed 100 tests.
  13127. 294.89 s [vector] prescanr': OK
  13128. 294.89 s [vector] +++ OK, passed 100 tests.
  13129. 294.90 s [vector] postscanr: OK
  13130. 294.90 s [vector] +++ OK, passed 100 tests.
  13131. 294.91 s [vector] postscanr': OK
  13132. 294.91 s [vector] +++ OK, passed 100 tests.
  13133. 294.91 s [vector] scanr: OK
  13134. 294.91 s [vector] +++ OK, passed 100 tests.
  13135. 294.93 s [vector] scanr': OK
  13136. 294.93 s [vector] +++ OK, passed 100 tests.
  13137. 294.93 s [vector] scanr1: OK
  13138. 294.93 s [vector] +++ OK, passed 100 tests.
  13139. 294.95 s [vector] scanr1': OK
  13140. 294.95 s [vector] +++ OK, passed 100 tests.
  13141. 294.95 s [vector] iscanr: OK
  13142. 294.95 s [vector] +++ OK, passed 100 tests.
  13143. 294.95 s [vector] iscanr': OK
  13144. 294.95 s [vector] +++ OK, passed 100 tests.
  13145. 294.95 s [vector] mut_read: OK
  13146. 294.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13147. 294.95 s [vector] mut_write: OK
  13148. 294.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13149. 294.95 s [vector] mut_modify: OK
  13150. 294.95 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13151. 294.95 s [vector] mut_generate: OK
  13152. 294.95 s [vector] +++ OK, passed 100 tests.
  13153. 294.97 s [vector] mut_generateM: OK (0.02s)
  13154. 294.97 s [vector] +++ OK, passed 100 tests.
  13155. 295.01 s [vector] mut_mapM_: OK (0.03s)
  13156. 295.01 s [vector] +++ OK, passed 100 tests.
  13157. 295.03 s [vector] mut_imapM_: OK (0.03s)
  13158. 295.03 s [vector] +++ OK, passed 100 tests.
  13159. 295.07 s [vector] mut_forM_: OK (0.04s)
  13160. 295.07 s [vector] +++ OK, passed 100 tests.
  13161. 295.11 s [vector] mut_iforM_: OK (0.04s)
  13162. 295.11 s [vector] +++ OK, passed 100 tests.
  13163. 295.11 s [vector] mut_foldr: OK
  13164. 295.11 s [vector] +++ OK, passed 100 tests.
  13165. 295.12 s [vector] mut_foldr': OK
  13166. 295.12 s [vector] +++ OK, passed 100 tests.
  13167. 295.13 s [vector] mut_foldl: OK
  13168. 295.13 s [vector] +++ OK, passed 100 tests.
  13169. 295.13 s [vector] mut_foldl': OK
  13170. 295.13 s [vector] +++ OK, passed 100 tests.
  13171. 295.13 s [vector] mut_ifoldr: OK
  13172. 295.14 s [vector] +++ OK, passed 100 tests.
  13173. 295.15 s [vector] mut_ifoldr': OK
  13174. 295.15 s [vector] +++ OK, passed 100 tests.
  13175. 295.15 s [vector] mut_ifoldl: OK
  13176. 295.15 s [vector] +++ OK, passed 100 tests.
  13177. 295.15 s [vector] mut_ifoldl': OK
  13178. 295.15 s [vector] +++ OK, passed 100 tests.
  13179. 295.16 s [vector] mut_foldM: OK
  13180. 295.16 s [vector] +++ OK, passed 100 tests.
  13181. 295.16 s [vector] mut_foldM': OK
  13182. 295.16 s [vector] +++ OK, passed 100 tests.
  13183. 295.17 s [vector] mut_foldrM: OK
  13184. 295.17 s [vector] +++ OK, passed 100 tests.
  13185. 295.17 s [vector] mut_foldrM': OK
  13186. 295.17 s [vector] +++ OK, passed 100 tests.
  13187. 295.18 s [vector] mut_ifoldM: OK
  13188. 295.18 s [vector] +++ OK, passed 100 tests.
  13189. 295.18 s [vector] mut_ifoldM': OK
  13190. 295.18 s [vector] +++ OK, passed 100 tests.
  13191. 295.19 s [vector] mut_ifoldrM: OK
  13192. 295.19 s [vector] +++ OK, passed 100 tests.
  13193. 295.19 s [vector] mut_ifoldrM': OK
  13194. 295.19 s [vector] +++ OK, passed 100 tests.
  13195. 295.20 s [vector] compare: OK
  13196. 295.20 s [vector] +++ OK, passed 100 tests.
  13197. 295.20 s [vector] maximum: OK
  13198. 295.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13199. 295.20 s [vector] minimum: OK
  13200. 295.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13201. 295.20 s [vector] minIndex: OK
  13202. 295.20 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13203. 295.20 s [vector] maxIndex: OK
  13204. 295.20 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13205. 295.20 s [vector] maximumBy: OK
  13206. 295.20 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13207. 295.20 s [vector] minimumBy: OK
  13208. 295.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13209. 295.20 s [vector] maximumOn: OK
  13210. 295.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13211. 295.21 s [vector] minimumOn: OK
  13212. 295.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13213. 295.21 s [vector] maxIndexBy: OK
  13214. 295.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13215. 295.21 s [vector] minIndexBy: OK
  13216. 295.21 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13217. 295.21 s [vector] ListFirstMaxIndexWins: OK
  13218. 295.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13219. 295.21 s [vector] FalseListFirstMaxIndexWins: OK
  13220. 295.21 s [vector] +++ OK, failed as expected. (after 1 test):
  13221. 295.21 s [vector] Exception:
  13222. 295.21 s [vector] Prelude.foldr1: empty list
  13223. 295.21 s [vector] CallStack (from HasCallStack):
  13224. 295.21 s [vector] error, called at libraries/base/GHC/List.hs:2004:3 in base:GHC.List
  13225. 295.21 s [vector] errorEmptyList, called at libraries/base/GHC/List.hs:693:30 in base:GHC.List
  13226. 295.21 s [vector] foldr1, called at libraries/base/Data/Foldable.hs:741:15 in base:Data.Foldable
  13227. 295.21 s [vector] []
  13228. 295.21 s [vector] zip: OK
  13229. 295.21 s [vector] +++ OK, passed 100 tests.
  13230. 295.22 s [vector] zip3: OK
  13231. 295.22 s [vector] +++ OK, passed 100 tests.
  13232. 295.22 s [vector] unzip: OK
  13233. 295.22 s [vector] +++ OK, passed 100 tests.
  13234. 295.22 s [vector] unzip3: OK
  13235. 295.23 s [vector] +++ OK, passed 100 tests.
  13236. 295.23 s [vector] indexed: OK
  13237. 295.23 s [vector] +++ OK, passed 100 tests.
  13238. 295.23 s [vector] update: OK
  13239. 295.23 s [vector] +++ OK, passed 100 tests.
  13240. 295.23 s [vector] mempty: OK
  13241. 295.23 s [vector] +++ OK, passed 1 test.
  13242. 295.23 s [vector] mappend: OK
  13243. 295.23 s [vector] +++ OK, passed 100 tests.
  13244. 295.28 s [vector] mconcat: OK (0.05s)
  13245. 295.28 s [vector] +++ OK, passed 100 tests.
  13246. 295.28 s [vector] glength: OK
  13247. 295.28 s [vector] +++ OK, passed 100 tests.
  13248. 295.28 s [vector] unstream
  13249. 295.28 s [vector] unstream == vunstream (exact): OK
  13250. 295.28 s [vector] +++ OK, passed 100 tests.
  13251. 295.28 s [vector] unstream == vunstream (unknown): OK
  13252. 295.28 s [vector] +++ OK, passed 100 tests.
  13253. 295.28 s [vector] unstreamR ~= vunstream (exact): OK
  13254. 295.28 s [vector] +++ OK, passed 100 tests.
  13255. 295.28 s [vector] unstreamR ~= vunstream (unknown): OK
  13256. 295.28 s [vector] +++ OK, passed 100 tests.
  13257. 295.28 s [vector] Data.Vector.Storable.Vector Alignment
  13258. 295.28 s [vector] Aligned Double: OK
  13259. 295.28 s [vector] Aligned Int: OK
  13260. 295.28 s [vector] Regression tests
  13261. 295.28 s [vector] enumFromTo crash #188
  13262. 295.28 s [vector] Word8: OK
  13263. 295.28 s [vector] Word16: OK
  13264. 295.28 s [vector] Word32: OK
  13265. 295.28 s [vector] Word64: OK
  13266. 295.28 s [vector] Word: OK
  13267. 295.28 s [vector] Int8: OK
  13268. 295.28 s [vector] Int16: OK
  13269. 295.28 s [vector] Int32: OK
  13270. 295.28 s [vector] Int64: OK
  13271. 295.28 s [vector] Int: OK
  13272. 295.28 s [vector] Char: OK
  13273. 295.28 s [vector] Negative tests
  13274. 295.28 s [vector] slice out of bounds #257
  13275. 295.28 s [vector] Boxed
  13276. 295.28 s [vector] Negative ix: OK
  13277. 295.28 s [vector] Negative size: OK
  13278. 295.28 s [vector] Negative ix and size: OK
  13279. 295.28 s [vector] Too large ix: OK
  13280. 295.28 s [vector] Too large size: OK
  13281. 295.28 s [vector] Too large ix and size: OK
  13282. 295.28 s [vector] Overflow: OK
  13283. 295.28 s [vector] OutOfMemory: OK
  13284. 295.28 s [vector] Primitive
  13285. 295.28 s [vector] Negative ix: OK
  13286. 295.28 s [vector] Negative size: OK
  13287. 295.28 s [vector] Negative ix and size: OK
  13288. 295.28 s [vector] Too large ix: OK
  13289. 295.28 s [vector] Too large size: OK
  13290. 295.28 s [vector] Too large ix and size: OK
  13291. 295.28 s [vector] Overflow: OK
  13292. 295.28 s [vector] OutOfMemory: OK
  13293. 295.28 s [vector] Storable
  13294. 295.28 s [vector] Negative ix: OK
  13295. 295.28 s [vector] Negative size: OK
  13296. 295.28 s [vector] Negative ix and size: OK
  13297. 295.28 s [vector] Too large ix: OK
  13298. 295.29 s [vector] Too large size: OK
  13299. 295.29 s [vector] Too large ix and size: OK
  13300. 295.29 s [vector] Overflow: OK
  13301. 295.29 s [vector] OutOfMemory: OK
  13302. 295.29 s [vector] Unboxed
  13303. 295.29 s [vector] Negative ix: OK
  13304. 295.29 s [vector] Negative size: OK
  13305. 295.29 s [vector] Negative ix and size: OK
  13306. 295.29 s [vector] Too large ix: OK
  13307. 295.29 s [vector] Too large size: OK
  13308. 295.29 s [vector] Too large ix and size: OK
  13309. 295.29 s [vector] Overflow: OK
  13310. 295.29 s [vector] OutOfMemory: OK
  13311. 295.29 s [vector] take #282
  13312. 295.29 s [vector] Boxed: OK
  13313. 295.29 s [vector] Primitive: OK
  13314. 295.29 s [vector] Storable: OK
  13315. 295.29 s [vector] Unboxed: OK
  13316. 295.29 s [vector] Data.Vector
  13317. 295.29 s [vector] MonadFix: OK
  13318. 295.29 s [vector] toFromArray: OK
  13319. 295.29 s [vector] toFromArraySlice: OK
  13320. 295.29 s [vector] toFromArraySliceUnsafe: OK
  13321. 295.29 s [vector] toFromMutableArray: OK
  13322. 295.29 s [vector] Data.Vector.Mutable (Move): OK
  13323. 295.29 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13324. 295.29 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  13325. 295.29 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13326. 295.29 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  13327. 295.29 s [vector] +++ OK, passed 100 tests; 22 discarded.
  13328. 295.29 s [vector] Data.Vector.Storable.Mutable (Move): OK
  13329. 295.29 s [vector] +++ OK, passed 100 tests; 13 discarded.
  13330. 295.29 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  13331. 295.29 s [vector] +++ OK, passed 1 test.
  13332. 295.30 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK
  13333. 295.30 s [vector] +++ OK, passed 1 test.
  13334. 295.30 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  13335. 295.30 s [vector] +++ OK, passed 100 tests.
  13336. 295.30 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  13337. 295.30 s [vector] +++ OK, passed 100 tests.
  13338. 295.30 s [vector]
  13339. 295.30 s [vector] All 2808 tests passed (11.75s)
  13340. 295.30 s [vector] Test suite vector-tests-O2: PASS
  13341. 295.31 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  13342. 295.31 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  13343. 295.31 s [vector] Phase: haddockPhase
  13344. 295.32 s [vector] Phase: installPhase
  13345. 295.36 s [vector] Installing library in /nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  13346. 295.95 s [vector] Installing internal library benchmarks-O2 in /nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/vector-0.13.2.0-KjPJfwfBs004HPZguWmR2B-benchmarks-O2
  13347. 296.18 s [vector] Phase: fixupPhase
  13348. 296.20 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0
  13349. 296.20 s [vector] shrinking /nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSvector-0.13.2.0-KjPJfwfBs004HPZguWmR2B-benchmarks-O2-ghc9.8.4.so
  13350. 296.21 s [vector] shrinking /nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSvector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9-ghc9.8.4.so
  13351. 296.24 s [vector] checking for references to /build/ in /nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0...
  13352. 296.27 s [vector] patching script interpreter paths in /nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0
  13353. 296.28 s [vector] stripping (with command strip and flags -S -p) in /nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0/lib
  13354. 296.91 s [vector:post-build] Uploading to cachix cache "sellout": /nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0
  13355. 297.40 s [vector:post-build] Pushing 1 paths (93 are already present) using zstd to cache sellout ⏳
  13356. 297.40 s [vector:post-build]
  13357. 297.76 s [vector:post-build] Pushing /nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0 (57.19 MiB)
  13358. 299.46 s [vector:post-build]
  13359. 299.46 s [vector:post-build] All done.
  13360. 299.63 s [vector:post-build] Uploading to the NixCI cache: /nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0
  13361. 300.03 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13362. 300.11 s [vector:post-build] copying 1 paths...
  13363. 300.11 s [vector:post-build] copying path '/nix/store/r23dv4smys8ajx3diys5xjah93v8shk7-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  13364. 317.31 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13365. 317.62 s [vector:post-build] copying 1 paths...
  13366. 317.62 s [vector:post-build] copying path '/nix/store/lljap5vb616flbyjmw2sc7xvhrmq4gw9-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...
  13367. 318.01 s Progress: 6 of 16 built, 193 of 193 downloaded from cache
  13368. 318.12 s Building /nix/store/9f2k1llsbmcxcvaaf71ki69kjvr7akw9-nothunks-0.3.0.0.drv
  13369. 318.31 s [nothunks] Phase: setupCompilerEnvironmentPhase
  13370. 318.32 s [nothunks] Build with /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4.
  13371. 318.69 s [nothunks] Phase: unpackPhase
  13372. 318.74 s [nothunks] unpacking source archive /nix/store/wzdyx5j9ylkjc475kaylxv5w38vhyy44-nothunks-0.3.0.0.tar.gz
  13373. 318.74 s [nothunks] source root is nothunks-0.3.0.0
  13374. 318.76 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.0.0/test/Test/NoThunks/Class.hs"
  13375. 318.76 s [nothunks] Phase: patchPhase
  13376. 318.77 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.0.0/revision/1.cabal.
  13377. 318.78 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  13378. 318.79 s [nothunks] Phase: compileBuildDriverPhase
  13379. 318.80 s [nothunks] setupCompileFlags: -package-db=/build/tmp.NYtPRTzHwF/setup-package.conf.d -threaded
  13380. 318.85 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.NYtPRTzHwF/Main.o )
  13381. 318.97 s [nothunks] [2 of 2] Linking Setup
  13382. 320.63 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  13383. 320.64 s [nothunks] Phase: configurePhase
  13384. 320.65 s [nothunks] configureFlags: --verbose --prefix=/nix/store/asj2lrsgds1plpghx2msmkd70fn0j9ya-nothunks-0.3.0.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/jfrgqzlb4a1xcp3b8r0i7f9kkv91gv71-nothunks-0.3.0.0-doc/share/doc/nothunks-0.3.0.0 --with-gcc=gcc --package-db=/build/tmp.NYtPRTzHwF/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  13385. 320.66 s [nothunks] Using Parsec parser
  13386. 320.66 s [nothunks] Configuring nothunks-0.3.0.0...
  13387. 321.06 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  13388. 321.06 s [nothunks] Dependency base: using base-4.19.2.0
  13389. 321.06 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.1.0
  13390. 321.06 s [nothunks] Dependency containers: using containers-0.6.8
  13391. 321.06 s [nothunks] Dependency ghc-heap: using ghc-heap-9.8.4
  13392. 321.06 s [nothunks] Dependency stm: using stm-2.5.3.1
  13393. 321.06 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1.1
  13394. 321.06 s [nothunks] Dependency time: using time-1.12.2
  13395. 321.06 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  13396. 321.06 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.2: using wherefrom-compat-0.1.1.1
  13397. 321.06 s [nothunks] Dependency base: using base-4.19.2.0
  13398. 321.06 s [nothunks] Dependency containers: using containers-0.6.8
  13399. 321.06 s [nothunks] Dependency ghc-prim: using ghc-prim-0.11.0
  13400. 321.06 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  13401. 321.06 s [nothunks] Dependency nothunks: using nothunks-0.3.0.0
  13402. 321.06 s [nothunks] Dependency random: using random-1.2.1.3
  13403. 321.06 s [nothunks] Dependency stm: using stm-2.5.3.1
  13404. 321.06 s [nothunks] Dependency tasty: using tasty-1.5.3
  13405. 321.06 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  13406. 321.39 s [nothunks] Source component graph:
  13407. 321.39 s [nothunks] component lib
  13408. 321.39 s [nothunks] component test:nothunks-test dependency lib
  13409. 321.39 s [nothunks] Configured component graph:
  13410. 321.39 s [nothunks] component nothunks-0.3.0.0-vowkruDfwdFxgmkFexrFK
  13411. 321.39 s [nothunks] include base-4.19.2.0-0fde
  13412. 321.39 s [nothunks] include bytestring-0.12.1.0-c522
  13413. 321.39 s [nothunks] include containers-0.6.8-ddec
  13414. 321.39 s [nothunks] include ghc-heap-9.8.4-1f41
  13415. 321.39 s [nothunks] include stm-2.5.3.1-4fc6
  13416. 321.39 s [nothunks] include text-2.1.1-fd6a
  13417. 321.39 s [nothunks] include time-1.12.2-a970
  13418. 321.39 s [nothunks] include vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  13419. 321.39 s [nothunks] include wherefrom-compat-0.1.1.1-DYuQoo4PT41AhREgC36Xwb
  13420. 321.39 s [nothunks] component nothunks-0.3.0.0-3Ewe7k9kJzZANLl6hDVYnx-nothunks-test
  13421. 321.39 s [nothunks] include base-4.19.2.0-0fde
  13422. 321.39 s [nothunks] include containers-0.6.8-ddec
  13423. 321.39 s [nothunks] include ghc-prim-0.11.0-ce3f
  13424. 321.39 s [nothunks] include hedgehog-1.5-Cya8Y6QE8FkF1j7fe2PPQ4
  13425. 321.39 s [nothunks] include nothunks-0.3.0.0-vowkruDfwdFxgmkFexrFK
  13426. 321.39 s [nothunks] include random-1.2.1.3-KGZDfCTowDgJLZ8SS9n703
  13427. 321.39 s [nothunks] include stm-2.5.3.1-4fc6
  13428. 321.39 s [nothunks] include tasty-1.5.3-QOpJMSxeF49XPb7Cb4i95
  13429. 321.39 s [nothunks] include tasty-hedgehog-1.4.0.2-EnsyyAJBbn0JrLVecMHBMm
  13430. 321.39 s [nothunks] Linked component graph:
  13431. 321.39 s [nothunks] unit nothunks-0.3.0.0-vowkruDfwdFxgmkFexrFK
  13432. 321.39 s [nothunks] include base-4.19.2.0-0fde
  13433. 321.39 s [nothunks] include bytestring-0.12.1.0-c522
  13434. 321.39 s [nothunks] include containers-0.6.8-ddec
  13435. 321.39 s [nothunks] include ghc-heap-9.8.4-1f41
  13436. 321.39 s [nothunks] include stm-2.5.3.1-4fc6
  13437. 321.39 s [nothunks] include text-2.1.1-fd6a
  13438. 321.39 s [nothunks] include time-1.12.2-a970
  13439. 321.39 s [nothunks] include vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  13440. 321.39 s [nothunks] include wherefrom-compat-0.1.1.1-DYuQoo4PT41AhREgC36Xwb
  13441. 321.39 s [nothunks] NoThunks.Class=nothunks-0.3.0.0-vowkruDfwdFxgmkFexrFK:NoThunks.Class
  13442. 321.39 s [nothunks] unit nothunks-0.3.0.0-3Ewe7k9kJzZANLl6hDVYnx-nothunks-test
  13443. 321.39 s [nothunks] include base-4.19.2.0-0fde
  13444. 321.39 s [nothunks] include containers-0.6.8-ddec
  13445. 321.39 s [nothunks] include ghc-prim-0.11.0-ce3f
  13446. 321.39 s [nothunks] include hedgehog-1.5-Cya8Y6QE8FkF1j7fe2PPQ4
  13447. 321.39 s [nothunks] include nothunks-0.3.0.0-vowkruDfwdFxgmkFexrFK
  13448. 321.39 s [nothunks] include random-1.2.1.3-KGZDfCTowDgJLZ8SS9n703
  13449. 321.39 s [nothunks] include stm-2.5.3.1-4fc6
  13450. 321.39 s [nothunks] include tasty-1.5.3-QOpJMSxeF49XPb7Cb4i95
  13451. 321.39 s [nothunks] include tasty-hedgehog-1.4.0.2-EnsyyAJBbn0JrLVecMHBMm
  13452. 321.39 s [nothunks] Ready component graph:
  13453. 321.39 s [nothunks] definite nothunks-0.3.0.0-vowkruDfwdFxgmkFexrFK
  13454. 321.39 s [nothunks] depends base-4.19.2.0-0fde
  13455. 321.39 s [nothunks] depends bytestring-0.12.1.0-c522
  13456. 321.39 s [nothunks] depends containers-0.6.8-ddec
  13457. 321.39 s [nothunks] depends ghc-heap-9.8.4-1f41
  13458. 321.39 s [nothunks] depends stm-2.5.3.1-4fc6
  13459. 321.39 s [nothunks] depends text-2.1.1-fd6a
  13460. 321.39 s [nothunks] depends time-1.12.2-a970
  13461. 321.39 s [nothunks] depends vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  13462. 321.39 s [nothunks] depends wherefrom-compat-0.1.1.1-DYuQoo4PT41AhREgC36Xwb
  13463. 321.39 s [nothunks] definite nothunks-0.3.0.0-3Ewe7k9kJzZANLl6hDVYnx-nothunks-test
  13464. 321.39 s [nothunks] depends base-4.19.2.0-0fde
  13465. 321.39 s [nothunks] depends containers-0.6.8-ddec
  13466. 321.39 s [nothunks] depends ghc-prim-0.11.0-ce3f
  13467. 321.39 s [nothunks] depends hedgehog-1.5-Cya8Y6QE8FkF1j7fe2PPQ4
  13468. 321.39 s [nothunks] depends nothunks-0.3.0.0-vowkruDfwdFxgmkFexrFK
  13469. 321.39 s [nothunks] depends random-1.2.1.3-KGZDfCTowDgJLZ8SS9n703
  13470. 321.39 s [nothunks] depends stm-2.5.3.1-4fc6
  13471. 321.39 s [nothunks] depends tasty-1.5.3-QOpJMSxeF49XPb7Cb4i95
  13472. 321.39 s [nothunks] depends tasty-hedgehog-1.4.0.2-EnsyyAJBbn0JrLVecMHBMm
  13473. 321.39 s [nothunks] Using Cabal-3.10.3.0 compiled by ghc-9.8
  13474. 321.39 s [nothunks] Using compiler: ghc-9.8.4
  13475. 321.39 s [nothunks] Using install prefix:
  13476. 321.39 s [nothunks] /nix/store/asj2lrsgds1plpghx2msmkd70fn0j9ya-nothunks-0.3.0.0
  13477. 321.39 s [nothunks] Executables installed in:
  13478. 321.39 s [nothunks] /nix/store/asj2lrsgds1plpghx2msmkd70fn0j9ya-nothunks-0.3.0.0/bin
  13479. 321.39 s [nothunks] Libraries installed in:
  13480. 321.39 s [nothunks] /nix/store/asj2lrsgds1plpghx2msmkd70fn0j9ya-nothunks-0.3.0.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/nothunks-0.3.0.0-vowkruDfwdFxgmkFexrFK
  13481. 321.39 s [nothunks] Dynamic Libraries installed in:
  13482. 321.39 s [nothunks] /nix/store/asj2lrsgds1plpghx2msmkd70fn0j9ya-nothunks-0.3.0.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  13483. 321.39 s [nothunks] Private executables installed in:
  13484. 321.39 s [nothunks] /nix/store/asj2lrsgds1plpghx2msmkd70fn0j9ya-nothunks-0.3.0.0/libexec/x86_64-linux-ghc-9.8.4/nothunks-0.3.0.0
  13485. 321.39 s [nothunks] Data files installed in:
  13486. 321.39 s [nothunks] /nix/store/asj2lrsgds1plpghx2msmkd70fn0j9ya-nothunks-0.3.0.0/share/x86_64-linux-ghc-9.8.4/nothunks-0.3.0.0
  13487. 321.39 s [nothunks] Documentation installed in:
  13488. 321.39 s [nothunks] /nix/store/jfrgqzlb4a1xcp3b8r0i7f9kkv91gv71-nothunks-0.3.0.0-doc/share/doc/nothunks-0.3.0.0
  13489. 321.39 s [nothunks] Configuration files installed in:
  13490. 321.39 s [nothunks] /nix/store/asj2lrsgds1plpghx2msmkd70fn0j9ya-nothunks-0.3.0.0/etc
  13491. 321.39 s [nothunks] No alex found
  13492. 321.39 s [nothunks] Using ar found on system at:
  13493. 321.39 s [nothunks] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  13494. 321.39 s [nothunks] No c2hs found
  13495. 321.39 s [nothunks] No cpphs found
  13496. 321.39 s [nothunks] No doctest found
  13497. 321.39 s [nothunks] Using gcc version 14.3.0 given by user at:
  13498. 321.40 s [nothunks] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  13499. 321.40 s [nothunks] Using ghc version 9.8.4 found on system at:
  13500. 321.40 s [nothunks] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc
  13501. 321.40 s [nothunks] Using ghc-pkg version 9.8.4 found on system at:
  13502. 321.40 s [nothunks] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc-pkg-9.8.4
  13503. 321.40 s [nothunks] No ghcjs found
  13504. 321.40 s [nothunks] No ghcjs-pkg found
  13505. 321.40 s [nothunks] No greencard found
  13506. 321.40 s [nothunks] Using haddock version 2.30.0 found on system at:
  13507. 321.40 s [nothunks] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/haddock-ghc-9.8.4
  13508. 321.40 s [nothunks] No happy found
  13509. 321.40 s [nothunks] Using haskell-suite found on system at: haskell-suite-dummy-location
  13510. 321.40 s [nothunks] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  13511. 321.40 s [nothunks] No hmake found
  13512. 321.40 s [nothunks] Using hpc version 0.69 found on system at:
  13513. 321.40 s [nothunks] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hpc-ghc-9.8.4
  13514. 321.40 s [nothunks] Using hsc2hs version 0.68.10 found on system at:
  13515. 321.40 s [nothunks] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  13516. 321.40 s [nothunks] Using hscolour version 1.25 found on system at:
  13517. 321.40 s [nothunks] /nix/store/r9acd8dqp6xxbhlplifjikwk7bc6w7vf-hscolour-1.25/bin/HsColour
  13518. 321.40 s [nothunks] No jhc found
  13519. 321.40 s [nothunks] Using ld found on system at:
  13520. 321.40 s [nothunks] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  13521. 321.40 s [nothunks] No pkg-config found
  13522. 321.40 s [nothunks] Using runghc version 9.8.4 found on system at:
  13523. 321.40 s [nothunks] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/runghc-9.8.4
  13524. 321.40 s [nothunks] Using strip version 2.44 found on system at:
  13525. 321.40 s [nothunks] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  13526. 321.40 s [nothunks] Using tar found on system at:
  13527. 321.40 s [nothunks] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  13528. 321.40 s [nothunks] No uhc found
  13529. 321.53 s [nothunks] Phase: buildPhase
  13530. 321.60 s [nothunks] Preprocessing library for nothunks-0.3.0.0..
  13531. 321.60 s [nothunks] Building library for nothunks-0.3.0.0..
  13532. 321.71 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  13533. 324.31 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  13534. 327.32 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.0.0..
  13535. 327.32 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.0.0..
  13536. 327.41 s [nothunks] [1 of 2] Compiling Test.NoThunks.Class ( test/Test/NoThunks/Class.hs, dist/build/nothunks-test/nothunks-test-tmp/Test/NoThunks/Class.o )
  13537. 329.28 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  13538. 329.57 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  13539. 330.43 s [nothunks] Phase: checkPhase
  13540. 330.47 s [nothunks] Running 1 test suites...
  13541. 330.47 s [nothunks] Test suite nothunks-test: RUNNING...
  13542. 330.47 s [nothunks] Tests
  13543. 330.47 s [nothunks] NoThunks.Class
  13544. 330.47 s [nothunks] Sanity
  13545. 330.47 s [nothunks] IntNotNF: OK
  13546. 330.47 s [nothunks] ✓ <interactive> passed 1 test.
  13547. 330.47 s [nothunks] IntIsNF: OK
  13548. 330.47 s [nothunks] ✓ <interactive> passed 1 test.
  13549. 330.47 s [nothunks] Pair: OK
  13550. 330.47 s [nothunks] ✓ <interactive> passed 1 test.
  13551. 330.47 s [nothunks] Sum: OK
  13552. 330.47 s [nothunks] ✓ <interactive> passed 1 test.
  13553. 330.47 s [nothunks] Fn: OK
  13554. 330.47 s [nothunks] ✓ <interactive> passed 1 test.
  13555. 330.47 s [nothunks] IO: OK
  13556. 330.48 s [nothunks] ✓ <interactive> passed 1 test.
  13557. 330.48 s [nothunks] InspectHeap
  13558. 330.49 s [nothunks] Int: OK (0.01s)
  13559. 330.49 s [nothunks] ✓ <interactive> passed 1000 tests.
  13560. 330.49 s [nothunks] Just ["Int"] 49% █████████▊··········
  13561. 330.49 s [nothunks] Nothing 51% ██████████▏·········
  13562. 330.51 s [nothunks] IntInt: OK
  13563. 330.52 s [nothunks] ✓ <interactive> passed 1000 tests.
  13564. 330.52 s [nothunks] Just ["Int","Tuple2"] 38% ███████▌············
  13565. 330.52 s [nothunks] Just ["Tuple2"] 51% ██████████▎·········
  13566. 330.52 s [nothunks] Nothing 11% ██▏·················
  13567. 330.54 s [nothunks] SumInt: OK (0.02s)
  13568. 330.54 s [nothunks] ✓ <interactive> passed 1000 tests.
  13569. 330.54 s [nothunks] Just ["Either"] 33% ██████▋·············
  13570. 330.54 s [nothunks] Just ["Int","Either"] 34% ██████▊·············
  13571. 330.54 s [nothunks] Nothing 33% ██████▌·············
  13572. 330.54 s [nothunks] ListInt: OK (0.02s)
  13573. 330.54 s [nothunks] ✓ <interactive> passed 1000 tests.
  13574. 330.54 s [nothunks] Just ["Int","List"] 22% ████▎···············
  13575. 330.54 s [nothunks] Just ["List"] 46% █████████···········
  13576. 330.54 s [nothunks] Nothing 33% ██████▌·············
  13577. 330.56 s [nothunks] IntListInt: OK (0.02s)
  13578. 330.56 s [nothunks] ✓ <interactive> passed 1000 tests.
  13579. 330.56 s [nothunks] Just ["Int","List","Tuple2"] 5% █···················
  13580. 330.56 s [nothunks] Just ["Int","Tuple2"] 24% ████▊···············
  13581. 330.56 s [nothunks] Just ["List","Tuple2"] 10% ██··················
  13582. 330.56 s [nothunks] Just ["Tuple2"] 53% ██████████▌·········
  13583. 330.56 s [nothunks] Nothing 8% █▋··················
  13584. 330.58 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  13585. 330.58 s [nothunks] after 7 tests.
  13586. 330.58 s [nothunks] shrink path: 7:
  13587. 330.58 s [nothunks] Just ["Int","Seq"] 14% ██▊·················
  13588. 330.58 s [nothunks] Nothing 71% ██████████████▎·····
  13589. 330.58 s [nothunks]
  13590. 330.58 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  13591. 330.58 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  13592. 330.58 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  13593. 330.58 s [nothunks] 168 ┃ -> Proxy a
  13594. 330.58 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  13595. 330.58 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  13596. 330.58 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  13597. 330.58 s [nothunks] 172 ┃ -> Property
  13598. 330.58 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  13599. 330.58 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  13600. 330.58 s [nothunks] ┃ │ Wrap
  13601. 330.58 s [nothunks] ┃ │ { unwrap =
  13602. 330.58 s [nothunks] ┃ │ SeqEnqueue
  13603. 330.58 s [nothunks] ┃ │ (IntValue 0)
  13604. 330.58 s [nothunks] ┃ │ (SeqEnqueue
  13605. 330.58 s [nothunks] ┃ │ (IntValue 0)
  13606. 330.58 s [nothunks] ┃ │ (SeqEnqueue
  13607. 330.58 s [nothunks] ┃ │ (IntValue 0)
  13608. 330.58 s [nothunks] ┃ │ (SeqEnqueue
  13609. 330.58 s [nothunks] ┃ │ (IntValue 0)
  13610. 330.58 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  13611. 330.58 s [nothunks] ┃ │ }
  13612. 330.58 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  13613. 330.58 s [nothunks] 176 ┃ fromModel m $ \a -> do
  13614. 330.58 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  13615. 330.58 s [nothunks] ┃ │ IsNF
  13616. 330.58 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  13617. 330.58 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  13618. 330.58 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  13619. 330.58 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  13620. 330.58 s [nothunks] ┃ │ - Just
  13621. 330.58 s [nothunks] ┃ │ - ThunkInfo
  13622. 330.58 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  13623. 330.58 s [nothunks] ┃ │ + Nothing
  13624. 330.58 s [nothunks]
  13625. 330.58 s [nothunks] This failure can be reproduced by running:
  13626. 330.58 s [nothunks] > recheckAt (Seed 8155528478409754448 4930727185916268187) "7:" EXPECTED FAILURE
  13627. 330.58 s [nothunks]
  13628. 330.58 s [nothunks] OK (0.02s)
  13629. 330.58 s [nothunks] ✓ <interactive> passed 1 test.
  13630. 330.58 s [nothunks] Model
  13631. 330.60 s [nothunks] Int: OK (0.01s)
  13632. 330.60 s [nothunks] ✓ <interactive> passed 1000 tests.
  13633. 330.60 s [nothunks] Just ["Int"] 47% █████████▍··········
  13634. 330.60 s [nothunks] Nothing 53% ██████████▌·········
  13635. 330.62 s [nothunks] IntInt: OK (0.02s)
  13636. 330.62 s [nothunks] ✓ <interactive> passed 1000 tests.
  13637. 330.62 s [nothunks] Just ["Int","Tuple2"] 41% ████████▎···········
  13638. 330.62 s [nothunks] Just ["Tuple2"] 45% █████████···········
  13639. 330.62 s [nothunks] Nothing 14% ██▋·················
  13640. 330.64 s [nothunks] SumInt: OK (0.01s)
  13641. 330.64 s [nothunks] ✓ <interactive> passed 1000 tests.
  13642. 330.64 s [nothunks] Just ["Either"] 34% ██████▊·············
  13643. 330.64 s [nothunks] Just ["Int","Either"] 34% ██████▊·············
  13644. 330.64 s [nothunks] Nothing 32% ██████▍·············
  13645. 330.66 s [nothunks] ListInt: OK (0.02s)
  13646. 330.66 s [nothunks] ✓ <interactive> passed 1000 tests.
  13647. 330.66 s [nothunks] Just ["Int","List"] 21% ████▎···············
  13648. 330.66 s [nothunks] Just ["List"] 46% █████████···········
  13649. 330.66 s [nothunks] Nothing 33% ██████▌·············
  13650. 330.68 s [nothunks] IntListInt: OK (0.02s)
  13651. 330.68 s [nothunks] ✓ <interactive> passed 1000 tests.
  13652. 330.68 s [nothunks] Just ["Int","List","Tuple2"] 6% █···················
  13653. 330.68 s [nothunks] Just ["Int","Tuple2"] 24% ████▊···············
  13654. 330.68 s [nothunks] Just ["List","Tuple2"] 11% ██▏·················
  13655. 330.68 s [nothunks] Just ["Tuple2"] 51% ██████████▎·········
  13656. 330.68 s [nothunks] Nothing 8% █▋··················
  13657. 330.74 s [nothunks] SeqInt: OK (0.07s)
  13658. 330.74 s [nothunks] ✓ <interactive> passed 1000 tests.
  13659. 330.74 s [nothunks] Just ["Int","Seq"] 50% █████████▉··········
  13660. 330.74 s [nothunks] Nothing 50% ██████████··········
  13661. 330.76 s [nothunks] AllowThunksIn: OK (0.02s)
  13662. 330.76 s [nothunks] ✓ <interactive> passed 1000 tests.
  13663. 330.76 s [nothunks] Just ["Int","field2","Record"] 25% ████▉···············
  13664. 330.76 s [nothunks] Just ["Record"] 50% ██████████··········
  13665. 330.76 s [nothunks] Nothing 25% █████···············
  13666. 330.77 s [nothunks] Fn: OK
  13667. 330.78 s [nothunks] ✓ <interactive> passed 1000 tests.
  13668. 330.78 s [nothunks] Just ["->"] 25% █████···············
  13669. 330.78 s [nothunks] Nothing 75% ███████████████·····
  13670. 330.78 s [nothunks] IO: OK
  13671. 330.78 s [nothunks] ✓ <interactive> passed 1000 tests.
  13672. 330.78 s [nothunks] Just ["IO"] 22% ████▍···············
  13673. 330.78 s [nothunks] Nothing 78% ███████████████▌····
  13674. 330.80 s [nothunks] ThunkFreeFn: OK (0.01s)
  13675. 330.80 s [nothunks] ✓ <interactive> passed 1000 tests.
  13676. 330.80 s [nothunks] Just ["->"] 27% █████▍··············
  13677. 330.80 s [nothunks] Just ["...","->"] 37% ███████▎············
  13678. 330.80 s [nothunks] Nothing 36% ███████▏············
  13679. 330.80 s [nothunks] ThunkFreeIO: OK (0.01s)
  13680. 330.80 s [nothunks] ✓ <interactive> passed 1000 tests.
  13681. 330.80 s [nothunks] Just ["...","IO"] 37% ███████▍············
  13682. 330.80 s [nothunks] Just ["IO"] 25% ████▉···············
  13683. 330.80 s [nothunks] Nothing 38% ███████▌············
  13684. 330.80 s [nothunks] MutableVars
  13685. 330.80 s [nothunks] IORef
  13686. 330.80 s [nothunks] NotNF: OK
  13687. 330.80 s [nothunks] ✓ <interactive> passed 1 test.
  13688. 330.80 s [nothunks] NF: OK
  13689. 330.80 s [nothunks] ✓ <interactive> passed 1 test.
  13690. 330.80 s [nothunks] NotNFPure: OK
  13691. 330.80 s [nothunks] ✓ <interactive> passed 1 test.
  13692. 330.80 s [nothunks] NFPure: OK
  13693. 330.80 s [nothunks] ✓ <interactive> passed 1 test.
  13694. 330.80 s [nothunks] NotNFAtomically: OK
  13695. 330.80 s [nothunks] ✓ <interactive> passed 1 test.
  13696. 330.80 s [nothunks] NFAtomically: OK
  13697. 330.80 s [nothunks] ✓ <interactive> passed 1 test.
  13698. 330.80 s [nothunks] MVar
  13699. 330.80 s [nothunks] NotNF: OK
  13700. 330.80 s [nothunks] ✓ <interactive> passed 1 test.
  13701. 330.80 s [nothunks] NF: OK
  13702. 330.80 s [nothunks] ✓ <interactive> passed 1 test.
  13703. 330.80 s [nothunks] NotNFPure: OK
  13704. 330.80 s [nothunks] ✓ <interactive> passed 1 test.
  13705. 330.80 s [nothunks] NFPure: OK
  13706. 330.80 s [nothunks] ✓ <interactive> passed 1 test.
  13707. 330.80 s [nothunks] NotNFAtomically: OK
  13708. 330.80 s [nothunks] ✓ <interactive> passed 1 test.
  13709. 330.80 s [nothunks] NFAtomically: OK
  13710. 330.80 s [nothunks] ✓ <interactive> passed 1 test.
  13711. 330.80 s [nothunks] TVar
  13712. 330.80 s [nothunks] NotNF: OK
  13713. 330.80 s [nothunks] ✓ <interactive> passed 1 test.
  13714. 330.80 s [nothunks] NF: OK
  13715. 330.80 s [nothunks] ✓ <interactive> passed 1 test.
  13716. 330.80 s [nothunks] NotNFPure: OK
  13717. 330.80 s [nothunks] ✓ <interactive> passed 1 test.
  13718. 330.80 s [nothunks] NFPure: OK
  13719. 330.80 s [nothunks] ✓ <interactive> passed 1 test.
  13720. 330.80 s [nothunks] NotNFAtomically: OK
  13721. 330.80 s [nothunks] ✓ <interactive> passed 1 test.
  13722. 330.80 s [nothunks] NFAtomically: OK
  13723. 330.80 s [nothunks] ✓ <interactive> passed 1 test.
  13724. 330.80 s [nothunks]
  13725. 330.80 s [nothunks] All 41 tests passed (0.33s)
  13726. 330.80 s [nothunks] Test suite nothunks-test: PASS
  13727. 330.80 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.0.0-nothunks-test.log
  13728. 330.80 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  13729. 330.81 s [nothunks] Phase: haddockPhase
  13730. 330.91 s [nothunks] Preprocessing library for nothunks-0.3.0.0..
  13731. 330.91 s [nothunks] Running Haddock on library for nothunks-0.3.0.0..
  13732. 330.91 s [nothunks] Warning: The documentation for the following packages are not installed. No
  13733. 330.91 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  13734. 330.94 s [nothunks] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  13735. 331.04 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, nothing )
  13736. 331.40 s [nothunks] Haddock coverage:
  13737. 331.40 s [nothunks] Warning: 'AllowThunksIn' is ambiguous. It is defined
  13738. 331.40 s [nothunks] * at src/NoThunks/Class.hs:334:48
  13739. 331.40 s [nothunks] * at src/NoThunks/Class.hs:334:1
  13740. 331.40 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13741. 331.40 s [nothunks] by specifying the type/value namespace explicitly.
  13742. 331.40 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:334:1
  13743. 331.40 s [nothunks] Warning: 'InspectHeap' is ambiguous. It is defined
  13744. 331.40 s [nothunks] * at src/NoThunks/Class.hs:353:25
  13745. 331.40 s [nothunks] * at src/NoThunks/Class.hs:353:1
  13746. 331.40 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13747. 331.40 s [nothunks] by specifying the type/value namespace explicitly.
  13748. 331.40 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:353:1
  13749. 331.40 s [nothunks] Warning: 'InspectHeapNamed' is ambiguous. It is defined
  13750. 331.40 s [nothunks] * at src/NoThunks/Class.hs:358:47
  13751. 331.40 s [nothunks] * at src/NoThunks/Class.hs:358:1
  13752. 331.40 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13753. 331.40 s [nothunks] by specifying the type/value namespace explicitly.
  13754. 331.40 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:358:1
  13755. 331.40 s [nothunks] Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
  13756. 331.40 s [nothunks] * at src/NoThunks/Class.hs:308:27
  13757. 331.40 s [nothunks] * at src/NoThunks/Class.hs:308:1
  13758. 331.40 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13759. 331.40 s [nothunks] by specifying the type/value namespace explicitly.
  13760. 331.40 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:308:1
  13761. 331.47 s [nothunks] Warning: 'ThunkInfo' is ambiguous. It is defined
  13762. 331.47 s [nothunks] * at src/NoThunks/Class.hs:230:18
  13763. 331.47 s [nothunks] * at src/NoThunks/Class.hs:230:1
  13764. 331.47 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13765. 331.47 s [nothunks] by specifying the type/value namespace explicitly.
  13766. 331.47 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:230:1
  13767. 331.47 s [nothunks] Warning: 'GHC' is out of scope.
  13768. 331.47 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  13769. 331.47 s [nothunks] Warning: 'a' is out of scope.
  13770. 331.47 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  13771. 331.47 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  13772. 331.47 s [nothunks] Missing documentation for:
  13773. 331.47 s [nothunks] Module header
  13774. 331.80 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  13775. 331.80 s [nothunks] - Data.Vector.Vector
  13776. 331.80 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  13777. 331.80 s [nothunks] - NoThunks.Class.HasFields
  13778. 331.80 s [nothunks] - NoThunks.Class.Elem
  13779. 331.80 s [nothunks] - NoThunks.Class.GShowTypeOf
  13780. 331.80 s [nothunks] - NoThunks.Class.GWRecordField
  13781. 331.80 s [nothunks] - NoThunks.Class.checkContainsThunks
  13782. 334.02 s [nothunks] Documentation created: dist/doc/html/nothunks/,
  13783. 334.02 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  13784. 334.06 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.0.0..
  13785. 334.07 s [nothunks] Phase: installPhase
  13786. 334.12 s [nothunks] Installing library in /nix/store/asj2lrsgds1plpghx2msmkd70fn0j9ya-nothunks-0.3.0.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/nothunks-0.3.0.0-vowkruDfwdFxgmkFexrFK
  13787. 334.29 s [nothunks] Phase: fixupPhase
  13788. 334.30 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/asj2lrsgds1plpghx2msmkd70fn0j9ya-nothunks-0.3.0.0
  13789. 334.30 s [nothunks] shrinking /nix/store/asj2lrsgds1plpghx2msmkd70fn0j9ya-nothunks-0.3.0.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSnothunks-0.3.0.0-vowkruDfwdFxgmkFexrFK-ghc9.8.4.so
  13790. 334.31 s [nothunks] checking for references to /build/ in /nix/store/asj2lrsgds1plpghx2msmkd70fn0j9ya-nothunks-0.3.0.0...
  13791. 334.32 s [nothunks] patching script interpreter paths in /nix/store/asj2lrsgds1plpghx2msmkd70fn0j9ya-nothunks-0.3.0.0
  13792. 334.32 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/asj2lrsgds1plpghx2msmkd70fn0j9ya-nothunks-0.3.0.0/lib
  13793. 334.37 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/jfrgqzlb4a1xcp3b8r0i7f9kkv91gv71-nothunks-0.3.0.0-doc
  13794. 334.37 s [nothunks] checking for references to /build/ in /nix/store/jfrgqzlb4a1xcp3b8r0i7f9kkv91gv71-nothunks-0.3.0.0-doc...
  13795. 334.38 s [nothunks] patching script interpreter paths in /nix/store/jfrgqzlb4a1xcp3b8r0i7f9kkv91gv71-nothunks-0.3.0.0-doc
  13796. 334.46 s [nothunks:post-build] Uploading to cachix cache "sellout": /nix/store/asj2lrsgds1plpghx2msmkd70fn0j9ya-nothunks-0.3.0.0 /nix/store/jfrgqzlb4a1xcp3b8r0i7f9kkv91gv71-nothunks-0.3.0.0-doc
  13797. 334.95 s [nothunks:post-build] Pushing 2 paths (96 are already present) using zstd to cache sellout ⏳
  13798. 334.95 s [nothunks:post-build]
  13799. 335.33 s [nothunks:post-build] Pushing /nix/store/asj2lrsgds1plpghx2msmkd70fn0j9ya-nothunks-0.3.0.0 (2.71 MiB)
  13800. 335.42 s [nothunks:post-build] Pushing /nix/store/jfrgqzlb4a1xcp3b8r0i7f9kkv91gv71-nothunks-0.3.0.0-doc (841.94 KiB)
  13801. 336.42 s [nothunks:post-build]
  13802. 336.42 s [nothunks:post-build] All done.
  13803. 336.43 s [nothunks:post-build] Uploading to the NixCI cache: /nix/store/asj2lrsgds1plpghx2msmkd70fn0j9ya-nothunks-0.3.0.0 /nix/store/jfrgqzlb4a1xcp3b8r0i7f9kkv91gv71-nothunks-0.3.0.0-doc
  13804. 336.48 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13805. 336.69 s [nothunks:post-build] copying 2 paths...
  13806. 336.69 s [nothunks:post-build] copying path '/nix/store/jfrgqzlb4a1xcp3b8r0i7f9kkv91gv71-nothunks-0.3.0.0-doc' to 'https://cache.nix-ci.com'...
  13807. 336.99 s [nothunks:post-build] copying path '/nix/store/asj2lrsgds1plpghx2msmkd70fn0j9ya-nothunks-0.3.0.0' to 'https://cache.nix-ci.com'...
  13808. 337.79 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13809. 338.06 s [nothunks:post-build] copying 1 paths...
  13810. 338.06 s [nothunks:post-build] copying path '/nix/store/9f2k1llsbmcxcvaaf71ki69kjvr7akw9-nothunks-0.3.0.0.drv' to 'https://cache.nix-ci.com'...
  13811. 338.31 s Progress: 7 of 16 built, 193 of 193 downloaded from cache
  13812. 338.35 s Building /nix/store/60g8jqh9dh1kld8d55xhrkvnk9b979iv-unordered-containers-0.2.20.drv
  13813. 338.46 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  13814. 338.46 s [unordered-containers] Build with /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4.
  13815. 338.60 s [unordered-containers] Phase: unpackPhase
  13816. 338.61 s [unordered-containers] unpacking source archive /nix/store/46rvk8vjzsagr58a6pqwimivmr0ahxys-unordered-containers-0.2.20.tar.gz
  13817. 338.61 s [unordered-containers] source root is unordered-containers-0.2.20
  13818. 338.62 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20/unordered-containers.cabal"
  13819. 338.62 s [unordered-containers] Phase: patchPhase
  13820. 338.62 s [unordered-containers] Replace Cabal file with edited version from mirror://hackage/unordered-containers-0.2.20/revision/4.cabal.
  13821. 338.63 s [unordered-containers] Phase: compileBuildDriverPhase
  13822. 338.63 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.1u60l9kL4i/setup-package.conf.d -threaded
  13823. 338.66 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.1u60l9kL4i/Main.o )
  13824. 338.71 s [unordered-containers] [2 of 2] Linking Setup
  13825. 339.72 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  13826. 339.73 s [unordered-containers] Phase: configurePhase
  13827. 339.73 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/jw9m3xmfr5wqlsgl7468rg5dprglz2n5-unordered-containers-0.2.20 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/y4z9a55p1a4bp3hdqb4xyasp3pm9xkps-unordered-containers-0.2.20-doc/share/doc/unordered-containers-0.2.20 --with-gcc=gcc --package-db=/build/tmp.1u60l9kL4i/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  13828. 339.74 s [unordered-containers] Using Parsec parser
  13829. 339.74 s [unordered-containers] Configuring unordered-containers-0.2.20...
  13830. 339.95 s [unordered-containers] Flags chosen: debug=False
  13831. 339.95 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.19.2.0
  13832. 339.95 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.5.1.0
  13833. 339.95 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.4.7.0
  13834. 339.95 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.21.0.0
  13835. 339.95 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.15
  13836. 339.95 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  13837. 339.95 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.14.3
  13838. 339.95 s [unordered-containers] Dependency base: using base-4.19.2.0
  13839. 339.95 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.6.8
  13840. 339.95 s [unordered-containers] Dependency hashable: using hashable-1.4.7.0
  13841. 339.95 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.0.0
  13842. 339.95 s [unordered-containers] Dependency random: using random-1.2.1.3
  13843. 339.95 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  13844. 339.95 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  13845. 339.95 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11
  13846. 339.95 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20
  13847. 340.12 s [unordered-containers] Source component graph:
  13848. 340.12 s [unordered-containers] component lib
  13849. 340.12 s [unordered-containers] component test:unordered-containers-tests dependency lib
  13850. 340.12 s [unordered-containers] Configured component graph:
  13851. 340.12 s [unordered-containers] component unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1
  13852. 340.12 s [unordered-containers] include base-4.19.2.0-0fde
  13853. 340.12 s [unordered-containers] include deepseq-1.5.1.0-7f97
  13854. 340.12 s [unordered-containers] include hashable-1.4.7.0-Cn74cqcjwyW1of38P6bM3u
  13855. 340.12 s [unordered-containers] include template-haskell-2.21.0.0-8a5d
  13856. 340.12 s [unordered-containers] component unordered-containers-0.2.20-99XvYqJcjMI7MBEmYVeutF-unordered-containers-tests
  13857. 340.12 s [unordered-containers] include ChasingBottoms-1.3.1.15-48ZtS6cwWag5tonZtMlr5
  13858. 340.12 s [unordered-containers] include HUnit-1.6.2.0-4GVQACZeyCG6aTmdiRM2Zi
  13859. 340.12 s [unordered-containers] include QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  13860. 340.12 s [unordered-containers] include base-4.19.2.0-0fde
  13861. 340.12 s [unordered-containers] include containers-0.6.8-ddec
  13862. 340.12 s [unordered-containers] include hashable-1.4.7.0-Cn74cqcjwyW1of38P6bM3u
  13863. 340.12 s [unordered-containers] include nothunks-0.3.0.0-vowkruDfwdFxgmkFexrFK
  13864. 340.12 s [unordered-containers] include random-1.2.1.3-KGZDfCTowDgJLZ8SS9n703
  13865. 340.12 s [unordered-containers] include tasty-1.5.3-QOpJMSxeF49XPb7Cb4i95
  13866. 340.12 s [unordered-containers] include tasty-hunit-0.10.2-GvqyVBRVmj03GFrvo7llW5
  13867. 340.12 s [unordered-containers] include tasty-quickcheck-0.11-8ASWrIW2G5gKRpKoKDr6x
  13868. 340.12 s [unordered-containers] include unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1
  13869. 340.12 s [unordered-containers] Linked component graph:
  13870. 340.12 s [unordered-containers] unit unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1
  13871. 340.12 s [unordered-containers] include base-4.19.2.0-0fde
  13872. 340.12 s [unordered-containers] include deepseq-1.5.1.0-7f97
  13873. 340.12 s [unordered-containers] include hashable-1.4.7.0-Cn74cqcjwyW1of38P6bM3u
  13874. 340.12 s [unordered-containers] include template-haskell-2.21.0.0-8a5d
  13875. 340.12 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1:Data.HashSet.Internal
  13876. 340.13 s [unordered-containers] unit unordered-containers-0.2.20-99XvYqJcjMI7MBEmYVeutF-unordered-containers-tests
  13877. 340.13 s [unordered-containers] include ChasingBottoms-1.3.1.15-48ZtS6cwWag5tonZtMlr5
  13878. 340.13 s [unordered-containers] include HUnit-1.6.2.0-4GVQACZeyCG6aTmdiRM2Zi
  13879. 340.13 s [unordered-containers] include QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  13880. 340.13 s [unordered-containers] include base-4.19.2.0-0fde
  13881. 340.13 s [unordered-containers] include containers-0.6.8-ddec
  13882. 340.13 s [unordered-containers] include hashable-1.4.7.0-Cn74cqcjwyW1of38P6bM3u
  13883. 340.13 s [unordered-containers] include nothunks-0.3.0.0-vowkruDfwdFxgmkFexrFK
  13884. 340.13 s [unordered-containers] include random-1.2.1.3-KGZDfCTowDgJLZ8SS9n703
  13885. 340.13 s [unordered-containers] include tasty-1.5.3-QOpJMSxeF49XPb7Cb4i95
  13886. 340.13 s [unordered-containers] include tasty-hunit-0.10.2-GvqyVBRVmj03GFrvo7llW5
  13887. 340.13 s [unordered-containers] include tasty-quickcheck-0.11-8ASWrIW2G5gKRpKoKDr6x
  13888. 340.13 s [unordered-containers] include unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1
  13889. 340.13 s [unordered-containers] Ready component graph:
  13890. 340.13 s [unordered-containers] definite unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1
  13891. 340.13 s [unordered-containers] depends base-4.19.2.0-0fde
  13892. 340.13 s [unordered-containers] depends deepseq-1.5.1.0-7f97
  13893. 340.13 s [unordered-containers] depends hashable-1.4.7.0-Cn74cqcjwyW1of38P6bM3u
  13894. 340.13 s [unordered-containers] depends template-haskell-2.21.0.0-8a5d
  13895. 340.13 s [unordered-containers] definite unordered-containers-0.2.20-99XvYqJcjMI7MBEmYVeutF-unordered-containers-tests
  13896. 340.13 s [unordered-containers] depends ChasingBottoms-1.3.1.15-48ZtS6cwWag5tonZtMlr5
  13897. 340.13 s [unordered-containers] depends HUnit-1.6.2.0-4GVQACZeyCG6aTmdiRM2Zi
  13898. 340.13 s [unordered-containers] depends QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  13899. 340.13 s [unordered-containers] depends base-4.19.2.0-0fde
  13900. 340.13 s [unordered-containers] depends containers-0.6.8-ddec
  13901. 340.13 s [unordered-containers] depends hashable-1.4.7.0-Cn74cqcjwyW1of38P6bM3u
  13902. 340.13 s [unordered-containers] depends nothunks-0.3.0.0-vowkruDfwdFxgmkFexrFK
  13903. 340.13 s [unordered-containers] depends random-1.2.1.3-KGZDfCTowDgJLZ8SS9n703
  13904. 340.13 s [unordered-containers] depends tasty-1.5.3-QOpJMSxeF49XPb7Cb4i95
  13905. 340.13 s [unordered-containers] depends tasty-hunit-0.10.2-GvqyVBRVmj03GFrvo7llW5
  13906. 340.13 s [unordered-containers] depends tasty-quickcheck-0.11-8ASWrIW2G5gKRpKoKDr6x
  13907. 340.13 s [unordered-containers] depends unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1
  13908. 340.13 s [unordered-containers] Using Cabal-3.10.3.0 compiled by ghc-9.8
  13909. 340.13 s [unordered-containers] Using compiler: ghc-9.8.4
  13910. 340.13 s [unordered-containers] Using install prefix:
  13911. 340.13 s [unordered-containers] /nix/store/jw9m3xmfr5wqlsgl7468rg5dprglz2n5-unordered-containers-0.2.20
  13912. 340.13 s [unordered-containers] Executables installed in:
  13913. 340.13 s [unordered-containers] /nix/store/jw9m3xmfr5wqlsgl7468rg5dprglz2n5-unordered-containers-0.2.20/bin
  13914. 340.13 s [unordered-containers] Libraries installed in:
  13915. 340.13 s [unordered-containers] /nix/store/jw9m3xmfr5wqlsgl7468rg5dprglz2n5-unordered-containers-0.2.20/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1
  13916. 340.13 s [unordered-containers] Dynamic Libraries installed in:
  13917. 340.13 s [unordered-containers] /nix/store/jw9m3xmfr5wqlsgl7468rg5dprglz2n5-unordered-containers-0.2.20/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  13918. 340.13 s [unordered-containers] Private executables installed in:
  13919. 340.13 s [unordered-containers] /nix/store/jw9m3xmfr5wqlsgl7468rg5dprglz2n5-unordered-containers-0.2.20/libexec/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20
  13920. 340.13 s [unordered-containers] Data files installed in:
  13921. 340.13 s [unordered-containers] /nix/store/jw9m3xmfr5wqlsgl7468rg5dprglz2n5-unordered-containers-0.2.20/share/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20
  13922. 340.13 s [unordered-containers] Documentation installed in:
  13923. 340.13 s [unordered-containers] /nix/store/y4z9a55p1a4bp3hdqb4xyasp3pm9xkps-unordered-containers-0.2.20-doc/share/doc/unordered-containers-0.2.20
  13924. 340.13 s [unordered-containers] Configuration files installed in:
  13925. 340.13 s [unordered-containers] /nix/store/jw9m3xmfr5wqlsgl7468rg5dprglz2n5-unordered-containers-0.2.20/etc
  13926. 340.13 s [unordered-containers] No alex found
  13927. 340.13 s [unordered-containers] Using ar found on system at:
  13928. 340.13 s [unordered-containers] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  13929. 340.13 s [unordered-containers] No c2hs found
  13930. 340.13 s [unordered-containers] No cpphs found
  13931. 340.13 s [unordered-containers] No doctest found
  13932. 340.13 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  13933. 340.13 s [unordered-containers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  13934. 340.13 s [unordered-containers] Using ghc version 9.8.4 found on system at:
  13935. 340.13 s [unordered-containers] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc
  13936. 340.13 s [unordered-containers] Using ghc-pkg version 9.8.4 found on system at:
  13937. 340.13 s [unordered-containers] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc-pkg-9.8.4
  13938. 340.13 s [unordered-containers] No ghcjs found
  13939. 340.13 s [unordered-containers] No ghcjs-pkg found
  13940. 340.13 s [unordered-containers] No greencard found
  13941. 340.13 s [unordered-containers] Using haddock version 2.30.0 found on system at:
  13942. 340.13 s [unordered-containers] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/haddock-ghc-9.8.4
  13943. 340.13 s [unordered-containers] No happy found
  13944. 340.13 s [unordered-containers] Using haskell-suite found on system at: haskell-suite-dummy-location
  13945. 340.13 s [unordered-containers] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  13946. 340.13 s [unordered-containers] No hmake found
  13947. 340.13 s [unordered-containers] Using hpc version 0.69 found on system at:
  13948. 340.13 s [unordered-containers] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hpc-ghc-9.8.4
  13949. 340.13 s [unordered-containers] Using hsc2hs version 0.68.10 found on system at:
  13950. 340.13 s [unordered-containers] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  13951. 340.13 s [unordered-containers] Using hscolour version 1.25 found on system at:
  13952. 340.13 s [unordered-containers] /nix/store/r9acd8dqp6xxbhlplifjikwk7bc6w7vf-hscolour-1.25/bin/HsColour
  13953. 340.13 s [unordered-containers] No jhc found
  13954. 340.13 s [unordered-containers] Using ld found on system at:
  13955. 340.13 s [unordered-containers] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  13956. 340.13 s [unordered-containers] No pkg-config found
  13957. 340.13 s [unordered-containers] Using runghc version 9.8.4 found on system at:
  13958. 340.13 s [unordered-containers] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/runghc-9.8.4
  13959. 340.13 s [unordered-containers] Using strip version 2.44 found on system at:
  13960. 340.13 s [unordered-containers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  13961. 340.13 s [unordered-containers] Using tar found on system at:
  13962. 340.13 s [unordered-containers] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  13963. 340.13 s [unordered-containers] No uhc found
  13964. 340.23 s [unordered-containers] Phase: buildPhase
  13965. 340.27 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20..
  13966. 340.27 s [unordered-containers] Building library for unordered-containers-0.2.20..
  13967. 340.32 s [unordered-containers]
  13968. 340.32 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  13969. 340.32 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  13970. 340.32 s [unordered-containers] |
  13971. 340.32 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  13972. 340.32 s [unordered-containers] | ^^^^^^^^^^
  13973. 340.47 s [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 )
  13974. 340.60 s [unordered-containers]
  13975. 340.60 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  13976. 340.60 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  13977. 340.60 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  13978. 340.60 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  13979. 340.60 s [unordered-containers] |
  13980. 340.60 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  13981. 340.60 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  13982. 341.06 s [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 )
  13983. 341.06 s [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 )
  13984. 348.87 s [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 )
  13985. 349.23 s [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 )
  13986. 351.37 s [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 )
  13987. 351.37 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  13988. 351.37 s [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 )
  13989. 351.39 s [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 )
  13990. 351.63 s [unordered-containers]
  13991. 351.63 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  13992. 351.63 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  13993. 351.63 s [unordered-containers] |
  13994. 351.63 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  13995. 351.63 s [unordered-containers] | ^^^^^^^^^^
  13996. 351.80 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  13997. 351.92 s [unordered-containers]
  13998. 351.92 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  13999. 351.92 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  14000. 351.92 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  14001. 351.92 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  14002. 351.92 s [unordered-containers] |
  14003. 351.92 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  14004. 351.92 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14005. 352.62 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  14006. 352.62 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  14007. 360.40 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  14008. 361.00 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  14009. 363.25 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  14010. 363.25 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  14011. 363.25 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  14012. 363.36 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  14013. 364.56 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20..
  14014. 364.56 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20..
  14015. 364.72 s [unordered-containers] [1 of 9] Compiling Properties.List ( tests/Properties/List.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/List.o )
  14016. 364.94 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  14017. 364.94 s [unordered-containers]
  14018. 364.94 s [unordered-containers] tests/Regressions.hs:91:16: warning: [GHC-63394] [-Wx-partial]
  14019. 364.94 s [unordered-containers] In the use of ‘head’
  14020. 364.94 s [unordered-containers] (imported from Prelude, but defined in GHC.List):
  14021. 364.94 s [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."
  14022. 364.94 s [unordered-containers] |
  14023. 364.94 s [unordered-containers] 91 | k = head keys
  14024. 364.94 s [unordered-containers] | ^^^^
  14025. 367.23 s [unordered-containers] [3 of 9] Compiling Util.Key ( tests/Util/Key.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Util/Key.o )
  14026. 367.28 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  14027. 367.28 s [unordered-containers] [5 of 9] Compiling Properties.HashSet ( tests/Properties/HashSet.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashSet.o )
  14028. 367.28 s [unordered-containers] [6 of 9] Compiling Properties.HashMapStrict ( tests/Properties/HashMapStrict.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashMapStrict.o )
  14029. 372.36 s [unordered-containers] [7 of 9] Compiling Properties.HashMapLazy ( tests/Properties/HashMapLazy.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties/HashMapLazy.o )
  14030. 372.40 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  14031. 372.40 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  14032. 372.78 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  14033. 373.60 s [unordered-containers] buildPhase completed in 34 seconds
  14034. 373.60 s [unordered-containers] Phase: checkPhase
  14035. 373.63 s [unordered-containers] Running 1 test suites...
  14036. 373.63 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  14037. 373.64 s [unordered-containers] All
  14038. 373.64 s [unordered-containers] Properties
  14039. 373.64 s [unordered-containers] Data.HashMap.Lazy
  14040. 373.64 s [unordered-containers] instances
  14041. 373.64 s [unordered-containers] Eq
  14042. 373.67 s [unordered-containers] ==: OK (0.02s)
  14043. 373.67 s [unordered-containers] +++ OK, passed 100 tests.
  14044. 373.67 s [unordered-containers] /=: OK (0.02s)
  14045. 373.67 s [unordered-containers] +++ OK, passed 100 tests.
  14046. 373.67 s [unordered-containers] Ord
  14047. 373.67 s [unordered-containers] compare reflexive: OK
  14048. 373.67 s [unordered-containers] +++ OK, passed 100 tests.
  14049. 373.67 s [unordered-containers] compare transitive: OK (0.03s)
  14050. 373.67 s [unordered-containers] +++ OK, passed 100 tests.
  14051. 373.67 s [unordered-containers] compare antisymmetric: OK (0.02s)
  14052. 373.67 s [unordered-containers] +++ OK, passed 100 tests.
  14053. 373.67 s [unordered-containers] Ord => Eq: OK (0.02s)
  14054. 373.67 s [unordered-containers] +++ OK, passed 100 tests.
  14055. 373.83 s [unordered-containers] Read/Show: OK (0.17s)
  14056. 373.83 s [unordered-containers] +++ OK, passed 100 tests.
  14057. 373.83 s [unordered-containers] Functor: OK (0.03s)
  14058. 373.83 s [unordered-containers] +++ OK, passed 100 tests.
  14059. 373.83 s [unordered-containers] Foldable: OK (0.02s)
  14060. 373.83 s [unordered-containers] +++ OK, passed 100 tests.
  14061. 373.83 s [unordered-containers] Bifoldable
  14062. 373.83 s [unordered-containers] bifoldMap: OK (0.02s)
  14063. 373.83 s [unordered-containers] +++ OK, passed 100 tests.
  14064. 373.83 s [unordered-containers] bifoldr: OK (0.02s)
  14065. 373.83 s [unordered-containers] +++ OK, passed 100 tests.
  14066. 373.83 s [unordered-containers] bifoldl: OK (0.01s)
  14067. 373.83 s [unordered-containers] +++ OK, passed 100 tests.
  14068. 373.84 s [unordered-containers] Hashable: OK (0.02s)
  14069. 373.86 s [unordered-containers] +++ OK, passed 100 tests.
  14070. 373.86 s [unordered-containers] empty
  14071. 373.86 s [unordered-containers] valid: OK
  14072. 373.86 s [unordered-containers] +++ OK, passed 1 test.
  14073. 373.86 s [unordered-containers] singleton
  14074. 373.86 s [unordered-containers] valid: OK
  14075. 373.86 s [unordered-containers] +++ OK, passed 100 tests.
  14076. 373.86 s [unordered-containers] size: OK (0.02s)
  14077. 373.86 s [unordered-containers] +++ OK, passed 100 tests.
  14078. 373.86 s [unordered-containers] member: OK (0.01s)
  14079. 373.86 s [unordered-containers] +++ OK, passed 100 tests.
  14080. 373.86 s [unordered-containers] lookup: OK
  14081. 373.86 s [unordered-containers] +++ OK, passed 100 tests.
  14082. 373.86 s [unordered-containers] !?: OK (0.01s)
  14083. 373.86 s [unordered-containers] +++ OK, passed 100 tests.
  14084. 373.86 s [unordered-containers] insert
  14085. 373.86 s [unordered-containers] model: OK (0.01s)
  14086. 373.86 s [unordered-containers] +++ OK, passed 100 tests.
  14087. 373.86 s [unordered-containers] valid: OK
  14088. 373.89 s [unordered-containers] +++ OK, passed 100 tests.
  14089. 373.89 s [unordered-containers] insertWith
  14090. 373.89 s [unordered-containers] insertWith: OK
  14091. 373.89 s [unordered-containers] +++ OK, passed 100 tests.
  14092. 373.89 s [unordered-containers] valid: OK
  14093. 373.89 s [unordered-containers] +++ OK, passed 100 tests.
  14094. 373.89 s [unordered-containers] delete
  14095. 373.89 s [unordered-containers] model: OK
  14096. 373.89 s [unordered-containers] +++ OK, passed 100 tests.
  14097. 373.89 s [unordered-containers] valid: OK
  14098. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14099. 373.90 s [unordered-containers] adjust
  14100. 373.90 s [unordered-containers] model: OK
  14101. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14102. 373.90 s [unordered-containers] valid: OK
  14103. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14104. 373.90 s [unordered-containers] update
  14105. 373.90 s [unordered-containers] model: OK
  14106. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14107. 373.90 s [unordered-containers] valid: OK
  14108. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14109. 373.90 s [unordered-containers] alter
  14110. 373.90 s [unordered-containers] model: OK (0.02s)
  14111. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14112. 373.90 s [unordered-containers] valid: OK
  14113. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14114. 373.90 s [unordered-containers] alterF
  14115. 373.90 s [unordered-containers] model
  14116. 373.90 s [unordered-containers] []: OK (0.06s)
  14117. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14118. 373.90 s [unordered-containers] adjust: OK
  14119. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14120. 373.90 s [unordered-containers] insert: OK
  14121. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14122. 373.90 s [unordered-containers] insertWith: OK
  14123. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14124. 373.90 s [unordered-containers] delete: OK
  14125. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14126. 373.90 s [unordered-containers] lookup: OK
  14127. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14128. 373.90 s [unordered-containers] valid: OK (0.03s)
  14129. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14130. 373.90 s [unordered-containers] isSubmapOf
  14131. 373.90 s [unordered-containers] model: OK
  14132. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14133. 373.90 s [unordered-containers] m ⊆ m: OK
  14134. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14135. 373.90 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK
  14136. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14137. 373.90 s [unordered-containers] m1 ⊈ m2 ⇒ m1 ∪ m2 ⊈ m1: OK (0.01s)
  14138. 373.90 s [unordered-containers] +++ OK, passed 100 tests; 18 discarded.
  14139. 373.90 s [unordered-containers] m1\m2 ⊆ m1: OK
  14140. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14141. 373.90 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.01s)
  14142. 373.90 s [unordered-containers] +++ OK, passed 100 tests; 157 discarded.
  14143. 373.90 s [unordered-containers] delete k m ⊆ m: OK (0.01s)
  14144. 373.90 s [unordered-containers] +++ OK, passed 100 tests; 18 discarded.
  14145. 373.90 s [unordered-containers] m ⊈ delete k m : OK
  14146. 373.90 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  14147. 373.90 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK
  14148. 373.90 s [unordered-containers] +++ OK, passed 100 tests; 5 discarded.
  14149. 373.90 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK
  14150. 373.90 s [unordered-containers] +++ OK, passed 100 tests; 4 discarded.
  14151. 373.90 s [unordered-containers] union
  14152. 373.90 s [unordered-containers] model: OK (0.01s)
  14153. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14154. 373.90 s [unordered-containers] valid: OK
  14155. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14156. 373.90 s [unordered-containers] unionWith
  14157. 373.90 s [unordered-containers] model: OK (0.01s)
  14158. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14159. 373.90 s [unordered-containers] valid: OK
  14160. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14161. 373.90 s [unordered-containers] unionWithKey
  14162. 373.90 s [unordered-containers] model: OK (0.01s)
  14163. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14164. 373.90 s [unordered-containers] valid: OK
  14165. 373.90 s [unordered-containers] +++ OK, passed 100 tests.
  14166. 373.90 s [unordered-containers] unions
  14167. 374.44 s [unordered-containers] model: OK (0.78s)
  14168. 374.44 s [unordered-containers] +++ OK, passed 100 tests.
  14169. 374.45 s [unordered-containers] valid: OK (0.36s)
  14170. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14171. 374.45 s [unordered-containers] difference
  14172. 374.45 s [unordered-containers] model: OK
  14173. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14174. 374.45 s [unordered-containers] valid: OK
  14175. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14176. 374.45 s [unordered-containers] differenceWith
  14177. 374.45 s [unordered-containers] model: OK
  14178. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14179. 374.45 s [unordered-containers] valid: OK (0.01s)
  14180. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14181. 374.45 s [unordered-containers] intersection
  14182. 374.45 s [unordered-containers] model: OK
  14183. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14184. 374.45 s [unordered-containers] valid: OK (0.01s)
  14185. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14186. 374.45 s [unordered-containers] intersectionWith
  14187. 374.45 s [unordered-containers] model: OK (0.02s)
  14188. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14189. 374.45 s [unordered-containers] valid: OK
  14190. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14191. 374.45 s [unordered-containers] intersectionWithKey
  14192. 374.45 s [unordered-containers] model: OK (0.01s)
  14193. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14194. 374.45 s [unordered-containers] valid: OK
  14195. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14196. 374.45 s [unordered-containers] compose
  14197. 374.45 s [unordered-containers] valid: OK
  14198. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14199. 374.45 s [unordered-containers] map
  14200. 374.45 s [unordered-containers] model: OK (0.04s)
  14201. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14202. 374.45 s [unordered-containers] valid: OK
  14203. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14204. 374.45 s [unordered-containers] traverseWithKey
  14205. 374.45 s [unordered-containers] model: OK (0.03s)
  14206. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14207. 374.45 s [unordered-containers] valid: OK (0.01s)
  14208. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14209. 374.45 s [unordered-containers] mapKeys
  14210. 374.45 s [unordered-containers] model: OK
  14211. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14212. 374.45 s [unordered-containers] valid: OK (0.22s)
  14213. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14214. 374.45 s [unordered-containers] foldr: OK (0.01s)
  14215. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14216. 374.45 s [unordered-containers] foldl: OK
  14217. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14218. 374.45 s [unordered-containers] foldrWithKey: OK
  14219. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14220. 374.45 s [unordered-containers] foldlWithKey: OK (0.01s)
  14221. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14222. 374.45 s [unordered-containers] foldrWithKey': OK
  14223. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14224. 374.45 s [unordered-containers] foldlWithKey': OK
  14225. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14226. 374.45 s [unordered-containers] foldl': OK
  14227. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14228. 374.45 s [unordered-containers] foldr': OK
  14229. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14230. 374.45 s [unordered-containers] foldMapWithKey: OK (0.02s)
  14231. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14232. 374.45 s [unordered-containers] filter
  14233. 374.45 s [unordered-containers] model: OK (0.03s)
  14234. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14235. 374.45 s [unordered-containers] valid: OK (0.01s)
  14236. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14237. 374.45 s [unordered-containers] filterWithKey
  14238. 374.45 s [unordered-containers] model: OK (0.73s)
  14239. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14240. 374.45 s [unordered-containers] valid: OK (0.36s)
  14241. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14242. 374.45 s [unordered-containers] mapMaybe
  14243. 374.45 s [unordered-containers] model: OK (0.02s)
  14244. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14245. 374.45 s [unordered-containers] valid: OK (0.02s)
  14246. 374.45 s [unordered-containers] +++ OK, passed 100 tests.
  14247. 374.45 s [unordered-containers] mapMaybeWithKey
  14248. 374.48 s [unordered-containers] model: OK (0.78s)
  14249. 374.48 s [unordered-containers] +++ OK, passed 100 tests.
  14250. 374.48 s [unordered-containers] valid: OK (0.33s)
  14251. 374.48 s [unordered-containers] +++ OK, passed 100 tests.
  14252. 374.48 s [unordered-containers] elems: OK (0.02s)
  14253. 374.48 s [unordered-containers] +++ OK, passed 100 tests.
  14254. 374.48 s [unordered-containers] keys: OK
  14255. 374.48 s [unordered-containers] +++ OK, passed 100 tests.
  14256. 374.48 s [unordered-containers] fromList
  14257. 374.49 s [unordered-containers] model: OK (0.02s)
  14258. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14259. 374.49 s [unordered-containers] valid: OK
  14260. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14261. 374.49 s [unordered-containers] fromListWith
  14262. 374.49 s [unordered-containers] model: OK
  14263. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14264. 374.49 s [unordered-containers] valid: OK (0.01s)
  14265. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14266. 374.49 s [unordered-containers] fromListWithKey
  14267. 374.49 s [unordered-containers] model: OK
  14268. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14269. 374.49 s [unordered-containers] valid: OK
  14270. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14271. 374.49 s [unordered-containers] toList: OK (0.01s)
  14272. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14273. 374.49 s [unordered-containers] Data.HashMap.Strict
  14274. 374.49 s [unordered-containers] instances
  14275. 374.49 s [unordered-containers] Eq
  14276. 374.49 s [unordered-containers] ==: OK (0.02s)
  14277. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14278. 374.49 s [unordered-containers] /=: OK (0.03s)
  14279. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14280. 374.49 s [unordered-containers] Ord
  14281. 374.49 s [unordered-containers] compare reflexive: OK (0.01s)
  14282. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14283. 374.49 s [unordered-containers] compare transitive: OK (0.02s)
  14284. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14285. 374.49 s [unordered-containers] compare antisymmetric: OK (0.02s)
  14286. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14287. 374.49 s [unordered-containers] Ord => Eq: OK (0.02s)
  14288. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14289. 374.49 s [unordered-containers] Read/Show: OK (0.24s)
  14290. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14291. 374.49 s [unordered-containers] Functor: OK (0.05s)
  14292. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14293. 374.49 s [unordered-containers] Foldable: OK (0.02s)
  14294. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14295. 374.49 s [unordered-containers] Bifoldable
  14296. 374.49 s [unordered-containers] bifoldMap: OK
  14297. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14298. 374.49 s [unordered-containers] bifoldr: OK (0.01s)
  14299. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14300. 374.49 s [unordered-containers] bifoldl: OK (0.02s)
  14301. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14302. 374.49 s [unordered-containers] Hashable: OK (0.02s)
  14303. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14304. 374.49 s [unordered-containers] empty
  14305. 374.49 s [unordered-containers] valid: OK
  14306. 374.49 s [unordered-containers] +++ OK, passed 1 test.
  14307. 374.49 s [unordered-containers] singleton
  14308. 374.49 s [unordered-containers] valid: OK
  14309. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14310. 374.49 s [unordered-containers] size: OK (0.01s)
  14311. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14312. 374.49 s [unordered-containers] member: OK (0.01s)
  14313. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14314. 374.49 s [unordered-containers] lookup: OK (0.03s)
  14315. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14316. 374.49 s [unordered-containers] !?: OK (0.01s)
  14317. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14318. 374.49 s [unordered-containers] insert
  14319. 374.49 s [unordered-containers] model: OK (0.03s)
  14320. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14321. 374.49 s [unordered-containers] valid: OK
  14322. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14323. 374.49 s [unordered-containers] insertWith
  14324. 374.49 s [unordered-containers] insertWith: OK (0.01s)
  14325. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14326. 374.49 s [unordered-containers] valid: OK (0.02s)
  14327. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14328. 374.49 s [unordered-containers] delete
  14329. 374.49 s [unordered-containers] model: OK (0.01s)
  14330. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14331. 374.49 s [unordered-containers] valid: OK
  14332. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14333. 374.49 s [unordered-containers] adjust
  14334. 374.49 s [unordered-containers] model: OK (0.01s)
  14335. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14336. 374.49 s [unordered-containers] valid: OK (0.03s)
  14337. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14338. 374.49 s [unordered-containers] update
  14339. 374.49 s [unordered-containers] model: OK (0.03s)
  14340. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14341. 374.49 s [unordered-containers] valid: OK (0.03s)
  14342. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14343. 374.49 s [unordered-containers] alter
  14344. 374.49 s [unordered-containers] model: OK (0.03s)
  14345. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14346. 374.49 s [unordered-containers] valid: OK (0.01s)
  14347. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14348. 374.49 s [unordered-containers] alterF
  14349. 374.49 s [unordered-containers] model
  14350. 374.49 s [unordered-containers] []: OK (0.12s)
  14351. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14352. 374.49 s [unordered-containers] adjust: OK (0.03s)
  14353. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14354. 374.49 s [unordered-containers] insert: OK (0.02s)
  14355. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14356. 374.49 s [unordered-containers] insertWith: OK (0.07s)
  14357. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14358. 374.49 s [unordered-containers] delete: OK (0.02s)
  14359. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14360. 374.49 s [unordered-containers] lookup: OK
  14361. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14362. 374.49 s [unordered-containers] valid: OK (0.04s)
  14363. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14364. 374.49 s [unordered-containers] isSubmapOf
  14365. 374.49 s [unordered-containers] model: OK (0.07s)
  14366. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14367. 374.49 s [unordered-containers] m ⊆ m: OK
  14368. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14369. 374.49 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.03s)
  14370. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14371. 374.49 s [unordered-containers] m1 ⊈ m2 ⇒ m1 ∪ m2 ⊈ m1: OK (0.03s)
  14372. 374.49 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  14373. 374.49 s [unordered-containers] m1\m2 ⊆ m1: OK (0.05s)
  14374. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14375. 374.49 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.08s)
  14376. 374.49 s [unordered-containers] +++ OK, passed 100 tests; 160 discarded.
  14377. 374.49 s [unordered-containers] delete k m ⊆ m: OK (0.03s)
  14378. 374.49 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  14379. 374.49 s [unordered-containers] m ⊈ delete k m : OK (0.02s)
  14380. 374.49 s [unordered-containers] +++ OK, passed 100 tests; 20 discarded.
  14381. 374.49 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.03s)
  14382. 374.49 s [unordered-containers] +++ OK, passed 100 tests; 7 discarded.
  14383. 374.49 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.04s)
  14384. 374.49 s [unordered-containers] +++ OK, passed 100 tests; 3 discarded.
  14385. 374.49 s [unordered-containers] union
  14386. 374.49 s [unordered-containers] model: OK (0.05s)
  14387. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14388. 374.49 s [unordered-containers] valid: OK (0.04s)
  14389. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14390. 374.49 s [unordered-containers] unionWith
  14391. 374.49 s [unordered-containers] model: OK (0.09s)
  14392. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14393. 374.49 s [unordered-containers] valid: OK (0.06s)
  14394. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14395. 374.49 s [unordered-containers] unionWithKey
  14396. 374.49 s [unordered-containers] model: OK (0.09s)
  14397. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14398. 374.49 s [unordered-containers] valid: OK (0.07s)
  14399. 374.49 s [unordered-containers] +++ OK, passed 100 tests.
  14400. 374.49 s [unordered-containers] unions
  14401. 374.62 s [unordered-containers] model: OK (0.71s)
  14402. 374.62 s [unordered-containers] +++ OK, passed 100 tests.
  14403. 374.62 s [unordered-containers] valid: OK (0.45s)
  14404. 374.62 s [unordered-containers] +++ OK, passed 100 tests.
  14405. 374.62 s [unordered-containers] difference
  14406. 374.62 s [unordered-containers] model: OK (0.03s)
  14407. 374.62 s [unordered-containers] +++ OK, passed 100 tests.
  14408. 374.62 s [unordered-containers] valid: OK (0.01s)
  14409. 374.62 s [unordered-containers] +++ OK, passed 100 tests.
  14410. 374.62 s [unordered-containers] differenceWith
  14411. 374.62 s [unordered-containers] model: OK (0.06s)
  14412. 374.62 s [unordered-containers] +++ OK, passed 100 tests.
  14413. 374.62 s [unordered-containers] valid: OK (0.05s)
  14414. 374.62 s [unordered-containers] +++ OK, passed 100 tests.
  14415. 374.62 s [unordered-containers] intersection
  14416. 374.62 s [unordered-containers] model: OK (0.04s)
  14417. 374.62 s [unordered-containers] +++ OK, passed 100 tests.
  14418. 374.62 s [unordered-containers] valid: OK (0.02s)
  14419. 374.62 s [unordered-containers] +++ OK, passed 100 tests.
  14420. 374.62 s [unordered-containers] intersectionWith
  14421. 374.62 s [unordered-containers] model: OK (0.03s)
  14422. 374.62 s [unordered-containers] +++ OK, passed 100 tests.
  14423. 374.62 s [unordered-containers] valid: OK (0.03s)
  14424. 374.62 s [unordered-containers] +++ OK, passed 100 tests.
  14425. 374.62 s [unordered-containers] intersectionWithKey
  14426. 374.62 s [unordered-containers] model: OK (0.06s)
  14427. 374.62 s [unordered-containers] +++ OK, passed 100 tests.
  14428. 374.62 s [unordered-containers] valid: OK (0.03s)
  14429. 374.62 s [unordered-containers] +++ OK, passed 100 tests.
  14430. 374.62 s [unordered-containers] compose
  14431. 374.62 s [unordered-containers] valid: OK (0.05s)
  14432. 374.62 s [unordered-containers] +++ OK, passed 100 tests.
  14433. 374.62 s [unordered-containers] map
  14434. 374.62 s [unordered-containers] model: OK (0.06s)
  14435. 374.62 s [unordered-containers] +++ OK, passed 100 tests.
  14436. 374.62 s [unordered-containers] valid: OK (0.02s)
  14437. 374.62 s [unordered-containers] +++ OK, passed 100 tests.
  14438. 374.63 s [unordered-containers] traverseWithKey
  14439. 374.63 s [unordered-containers] model: OK (0.02s)
  14440. 374.63 s [unordered-containers] +++ OK, passed 100 tests.
  14441. 374.63 s [unordered-containers] valid: OK (0.03s)
  14442. 374.63 s [unordered-containers] +++ OK, passed 100 tests.
  14443. 374.63 s [unordered-containers] mapKeys
  14444. 374.63 s [unordered-containers] model: OK
  14445. 374.63 s [unordered-containers] +++ OK, passed 100 tests.
  14446. 374.63 s [unordered-containers] valid: OK (0.30s)
  14447. 374.63 s [unordered-containers] +++ OK, passed 100 tests.
  14448. 374.63 s [unordered-containers] foldr: OK
  14449. 374.63 s [unordered-containers] +++ OK, passed 100 tests.
  14450. 374.63 s [unordered-containers] foldl: OK (0.03s)
  14451. 374.63 s [unordered-containers] +++ OK, passed 100 tests.
  14452. 374.63 s [unordered-containers] foldrWithKey: OK (0.01s)
  14453. 374.63 s [unordered-containers] +++ OK, passed 100 tests.
  14454. 374.63 s [unordered-containers] foldlWithKey: OK (0.01s)
  14455. 374.63 s [unordered-containers] +++ OK, passed 100 tests.
  14456. 374.63 s [unordered-containers] foldrWithKey': OK
  14457. 374.63 s [unordered-containers] +++ OK, passed 100 tests.
  14458. 374.63 s [unordered-containers] foldlWithKey': OK (0.01s)
  14459. 374.63 s [unordered-containers] +++ OK, passed 100 tests.
  14460. 374.63 s [unordered-containers] foldl': OK (0.02s)
  14461. 374.63 s [unordered-containers] +++ OK, passed 100 tests.
  14462. 374.63 s [unordered-containers] foldr': OK (0.02s)
  14463. 374.63 s [unordered-containers] +++ OK, passed 100 tests.
  14464. 374.63 s [unordered-containers] foldMapWithKey: OK (0.01s)
  14465. 374.63 s [unordered-containers] +++ OK, passed 100 tests.
  14466. 374.63 s [unordered-containers] filter
  14467. 374.63 s [unordered-containers] model: OK (0.03s)
  14468. 374.63 s [unordered-containers] +++ OK, passed 100 tests.
  14469. 374.63 s [unordered-containers] valid: OK (0.03s)
  14470. 374.63 s [unordered-containers] +++ OK, passed 100 tests.
  14471. 374.63 s [unordered-containers] filterWithKey
  14472. 374.65 s [unordered-containers] model: OK (0.61s)
  14473. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14474. 374.65 s [unordered-containers] valid: OK (0.38s)
  14475. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14476. 374.65 s [unordered-containers] mapMaybe
  14477. 374.65 s [unordered-containers] model: OK (0.09s)
  14478. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14479. 374.65 s [unordered-containers] valid: OK (0.03s)
  14480. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14481. 374.65 s [unordered-containers] mapMaybeWithKey
  14482. 374.65 s [unordered-containers] model: OK (0.57s)
  14483. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14484. 374.65 s [unordered-containers] valid: OK (0.43s)
  14485. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14486. 374.65 s [unordered-containers] elems: OK (0.02s)
  14487. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14488. 374.65 s [unordered-containers] keys: OK (0.02s)
  14489. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14490. 374.65 s [unordered-containers] fromList
  14491. 374.65 s [unordered-containers] model: OK
  14492. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14493. 374.65 s [unordered-containers] valid: OK
  14494. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14495. 374.65 s [unordered-containers] fromListWith
  14496. 374.65 s [unordered-containers] model: OK (0.04s)
  14497. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14498. 374.65 s [unordered-containers] valid: OK
  14499. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14500. 374.65 s [unordered-containers] fromListWithKey
  14501. 374.65 s [unordered-containers] model: OK (0.02s)
  14502. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14503. 374.65 s [unordered-containers] valid: OK (0.05s)
  14504. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14505. 374.65 s [unordered-containers] toList: OK (0.02s)
  14506. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14507. 374.65 s [unordered-containers] Data.HashSet
  14508. 374.65 s [unordered-containers] instances
  14509. 374.65 s [unordered-containers] Eq
  14510. 374.65 s [unordered-containers] ==: OK (0.02s)
  14511. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14512. 374.65 s [unordered-containers] == permutations: OK (0.02s)
  14513. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14514. 374.65 s [unordered-containers] /=: OK (0.05s)
  14515. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14516. 374.65 s [unordered-containers] Ord
  14517. 374.65 s [unordered-containers] compare reflexive: OK (0.02s)
  14518. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14519. 374.65 s [unordered-containers] compare transitive: OK (0.03s)
  14520. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14521. 374.65 s [unordered-containers] compare antisymmetric: OK (0.03s)
  14522. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14523. 374.65 s [unordered-containers] Ord => Eq: OK (0.02s)
  14524. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14525. 374.65 s [unordered-containers] Read/Show: OK (0.24s)
  14526. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14527. 374.65 s [unordered-containers] Foldable: OK (0.04s)
  14528. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14529. 374.65 s [unordered-containers] Hashable: OK (0.04s)
  14530. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14531. 374.65 s [unordered-containers] size: OK
  14532. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14533. 374.65 s [unordered-containers] member: OK (0.02s)
  14534. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14535. 374.65 s [unordered-containers] insert: OK (0.03s)
  14536. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14537. 374.65 s [unordered-containers] delete: OK (0.03s)
  14538. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14539. 374.65 s [unordered-containers] union: OK (0.04s)
  14540. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14541. 374.65 s [unordered-containers] map: OK (0.43s)
  14542. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14543. 374.65 s [unordered-containers] foldr: OK
  14544. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14545. 374.65 s [unordered-containers] foldl': OK (0.01s)
  14546. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14547. 374.65 s [unordered-containers] filter: OK (0.46s)
  14548. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14549. 374.65 s [unordered-containers] toList: OK (0.02s)
  14550. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14551. 374.65 s [unordered-containers] Data.HashMap.Internal.List
  14552. 374.65 s [unordered-containers] isPermutationBy: OK
  14553. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14554. 374.65 s [unordered-containers] isPermutationBy of different length: OK
  14555. 374.65 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  14556. 374.65 s [unordered-containers] pUnorderedCompare: OK (0.05s)
  14557. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14558. 374.65 s [unordered-containers] modelUnorderedCompare
  14559. 374.65 s [unordered-containers] reflexive: OK (0.02s)
  14560. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14561. 374.65 s [unordered-containers] anti-symmetric: OK (0.01s)
  14562. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14563. 374.65 s [unordered-containers] transitive: OK (0.02s)
  14564. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14565. 374.65 s [unordered-containers] Regression tests
  14566. 374.65 s [unordered-containers] issue32: OK
  14567. 374.65 s [unordered-containers] issue39a: OK
  14568. 374.65 s [unordered-containers] issue39b: OK (0.02s)
  14569. 374.65 s [unordered-containers] +++ OK, passed 100 tests.
  14570. 374.65 s [unordered-containers] issue254 lazy: OK
  14571. 374.66 s [unordered-containers] issue254 strict: OK
  14572. 374.66 s [unordered-containers] issue379
  14573. 374.66 s [unordered-containers] Lazy.unionWith: OK
  14574. 374.66 s [unordered-containers] union: OK
  14575. 374.66 s [unordered-containers] Strict.unionWith: OK
  14576. 374.66 s [unordered-containers] Strict.unionWithKey: OK
  14577. 374.66 s [unordered-containers] issue381
  14578. 374.66 s [unordered-containers] mapMaybe: OK
  14579. 374.66 s [unordered-containers] mapMaybeWithKey: OK
  14580. 374.66 s [unordered-containers] issue382: OK
  14581. 374.66 s [unordered-containers] issue383: OK
  14582. 374.66 s [unordered-containers] issue420: OK
  14583. 374.66 s [unordered-containers] Strictness
  14584. 374.66 s [unordered-containers] HashMap.Strict
  14585. 374.66 s [unordered-containers] singleton is key-strict: OK
  14586. 374.66 s [unordered-containers] +++ OK, passed 100 tests.
  14587. 374.66 s [unordered-containers] singleton is value-strict: OK
  14588. 374.66 s [unordered-containers] +++ OK, passed 100 tests.
  14589. 374.66 s [unordered-containers] member is key-strict: OK
  14590. 374.66 s [unordered-containers] +++ OK, passed 100 tests.
  14591. 374.66 s [unordered-containers] lookup is key-strict: OK
  14592. 374.66 s [unordered-containers] +++ OK, passed 100 tests.
  14593. 374.66 s [unordered-containers] lookupDefault is key-strict: OK
  14594. 374.66 s [unordered-containers] +++ OK, passed 100 tests.
  14595. 374.66 s [unordered-containers] findWithDefault is key-strict: OK
  14596. 374.66 s [unordered-containers] +++ OK, passed 100 tests.
  14597. 374.66 s [unordered-containers] ! is key-strict: OK
  14598. 374.66 s [unordered-containers] +++ OK, passed 100 tests.
  14599. 374.66 s [unordered-containers] delete is key-strict: OK
  14600. 374.66 s [unordered-containers] +++ OK, passed 100 tests.
  14601. 374.66 s [unordered-containers] adjust is key-strict: OK
  14602. 374.66 s [unordered-containers] +++ OK, passed 100 tests.
  14603. 374.66 s [unordered-containers] adjust is value-strict: OK (0.01s)
  14604. 374.66 s [unordered-containers] +++ OK, passed 100 tests.
  14605. 374.66 s [unordered-containers] insert is key-strict: OK
  14606. 374.66 s [unordered-containers] +++ OK, passed 100 tests.
  14607. 374.66 s [unordered-containers] insert is value-strict: OK
  14608. 374.66 s [unordered-containers] +++ OK, passed 100 tests.
  14609. 374.66 s [unordered-containers] insertWith is key-strict: OK (0.01s)
  14610. 374.66 s [unordered-containers] +++ OK, passed 100 tests.
  14611. 374.66 s [unordered-containers] insertWith is value-strict: OK (0.01s)
  14612. 374.66 s [unordered-containers] +++ OK, passed 100 tests.
  14613. 374.66 s [unordered-containers] fromList is key-strict: OK
  14614. 374.66 s [unordered-containers] +++ OK, passed 1 test.
  14615. 374.66 s [unordered-containers] fromList is value-strict: OK
  14616. 374.66 s [unordered-containers] +++ OK, passed 100 tests.
  14617. 374.66 s [unordered-containers] fromListWith is key-strict: OK
  14618. 374.66 s [unordered-containers] +++ OK, passed 100 tests.
  14619. 374.66 s [unordered-containers] fromListWith is value-strict: OK
  14620. 374.66 s [unordered-containers] +++ OK, passed 100 tests.
  14621. 374.66 s [unordered-containers]
  14622. 374.66 s [unordered-containers] All 256 tests passed (1.01s)
  14623. 374.67 s [unordered-containers] Test suite unordered-containers-tests: PASS
  14624. 374.67 s [unordered-containers] Test suite logged to:
  14625. 374.67 s [unordered-containers] dist/test/unordered-containers-0.2.20-unordered-containers-tests.log
  14626. 374.67 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  14627. 374.67 s [unordered-containers] Phase: haddockPhase
  14628. 374.77 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20..
  14629. 374.78 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20..
  14630. 374.81 s [unordered-containers] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  14631. 374.92 s [unordered-containers]
  14632. 374.92 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  14633. 374.92 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  14634. 374.92 s [unordered-containers] |
  14635. 374.92 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  14636. 374.92 s [unordered-containers] | ^^^^^^^^^^
  14637. 375.08 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing )
  14638. 375.32 s [unordered-containers]
  14639. 375.32 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  14640. 375.32 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  14641. 375.32 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  14642. 375.32 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  14643. 375.32 s [unordered-containers] |
  14644. 375.32 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  14645. 375.32 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14646. 375.33 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing )
  14647. 375.35 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing )
  14648. 376.16 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing )
  14649. 376.18 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing )
  14650. 376.28 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing )
  14651. 376.34 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, nothing )
  14652. 376.34 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing )
  14653. 376.35 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing )
  14654. 376.35 s [unordered-containers] Haddock coverage:
  14655. 376.35 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  14656. 376.35 s [unordered-containers] Missing documentation for:
  14657. 376.35 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  14658. 376.35 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  14659. 376.35 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:208)
  14660. 376.35 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:225)
  14661. 376.35 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:229)
  14662. 376.35 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:233)
  14663. 376.35 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:242)
  14664. 376.35 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:154)
  14665. 376.35 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:162)
  14666. 376.35 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:249)
  14667. 376.35 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:255)
  14668. 376.35 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:262)
  14669. 376.35 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:274)
  14670. 376.35 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:268)
  14671. 376.35 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:140)
  14672. 376.35 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
  14673. 376.35 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:286)
  14674. 376.35 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
  14675. 376.35 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:292)
  14676. 376.35 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:314)
  14677. 376.35 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:404)
  14678. 376.35 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:375)
  14679. 376.35 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:394)
  14680. 376.35 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:385)
  14681. 376.35 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:417)
  14682. 376.35 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:436)
  14683. 376.35 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:461)
  14684. 376.35 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:537)
  14685. 376.35 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:553)
  14686. 376.35 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:529)
  14687. 376.35 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:494)
  14688. 376.35 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:506)
  14689. 376.35 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  14690. 376.35 s [unordered-containers] Missing documentation for:
  14691. 376.35 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:40)
  14692. 376.35 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:83)
  14693. 376.35 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:68)
  14694. 376.36 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  14695. 376.36 s [unordered-containers] * at Data/HashMap/Internal.hs:225:7
  14696. 376.36 s [unordered-containers] * at Data/HashMap/Internal.hs:185:1
  14697. 376.36 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14698. 376.36 s [unordered-containers] by specifying the type/value namespace explicitly.
  14699. 376.36 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:185:1
  14700. 376.36 s [unordered-containers] Warning: 'at' is out of scope.
  14701. 376.36 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  14702. 376.37 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  14703. 376.37 s [unordered-containers] Missing documentation for:
  14704. 376.37 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:185)
  14705. 376.37 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1855)
  14706. 376.37 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2368)
  14707. 376.37 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:511)
  14708. 376.37 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:495)
  14709. 376.37 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:678)
  14710. 376.37 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:657)
  14711. 376.37 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:660)
  14712. 376.37 s [unordered-containers] insert' (Data/HashMap/Internal.hs:806)
  14713. 376.37 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1124)
  14714. 376.37 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:848)
  14715. 376.37 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:883)
  14716. 376.37 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  14717. 376.37 s [unordered-containers] Missing documentation for:
  14718. 376.37 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:98)
  14719. 376.37 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  14720. 376.37 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  14721. 376.37 s [unordered-containers] Warning: 'lookup' is out of scope.
  14722. 376.37 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  14723. 376.37 s [unordered-containers] Warning: 'at' is out of scope.
  14724. 376.37 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  14725. 376.38 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  14726. 376.38 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  14727. 376.38 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  14728. 376.38 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  14729. 376.38 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14730. 376.38 s [unordered-containers] by specifying the type/value namespace explicitly.
  14731. 376.38 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  14732. 376.38 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  14733. 376.38 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  14734. 376.38 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  14735. 376.38 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  14736. 376.38 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14737. 376.38 s [unordered-containers] by specifying the type/value namespace explicitly.
  14738. 376.38 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  14739. 376.38 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  14740. 376.38 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  14741. 376.38 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  14742. 376.64 s [unordered-containers] Warning: Data.HashMap.Internal: could not find link destinations for:
  14743. 376.64 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14744. 376.64 s [unordered-containers] Warning: Data.HashMap.Internal.Strict: could not find link destinations for:
  14745. 376.64 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14746. 376.64 s [unordered-containers] Warning: Data.HashSet.Internal: could not find link destinations for:
  14747. 376.64 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  14748. 376.65 s [unordered-containers] Warning: Data.HashSet: could not find link destinations for:
  14749. 376.65 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  14750. 376.65 s [unordered-containers] Warning: Data.HashMap.Strict: could not find link destinations for:
  14751. 376.65 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14752. 376.66 s [unordered-containers] Warning: Data.HashMap.Lazy: could not find link destinations for:
  14753. 376.66 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14754. 380.06 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers/,
  14755. 380.06 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  14756. 380.22 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20..
  14757. 380.22 s [unordered-containers] Phase: installPhase
  14758. 380.22 s [unordered-containers] Installing library in /nix/store/jw9m3xmfr5wqlsgl7468rg5dprglz2n5-unordered-containers-0.2.20/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1
  14759. 380.62 s [unordered-containers] Phase: fixupPhase
  14760. 380.64 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/jw9m3xmfr5wqlsgl7468rg5dprglz2n5-unordered-containers-0.2.20
  14761. 380.65 s [unordered-containers] shrinking /nix/store/jw9m3xmfr5wqlsgl7468rg5dprglz2n5-unordered-containers-0.2.20/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSunordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1-ghc9.8.4.so
  14762. 380.66 s [unordered-containers] checking for references to /build/ in /nix/store/jw9m3xmfr5wqlsgl7468rg5dprglz2n5-unordered-containers-0.2.20...
  14763. 380.67 s [unordered-containers] patching script interpreter paths in /nix/store/jw9m3xmfr5wqlsgl7468rg5dprglz2n5-unordered-containers-0.2.20
  14764. 380.68 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/jw9m3xmfr5wqlsgl7468rg5dprglz2n5-unordered-containers-0.2.20/lib
  14765. 380.82 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/y4z9a55p1a4bp3hdqb4xyasp3pm9xkps-unordered-containers-0.2.20-doc
  14766. 380.84 s [unordered-containers] checking for references to /build/ in /nix/store/y4z9a55p1a4bp3hdqb4xyasp3pm9xkps-unordered-containers-0.2.20-doc...
  14767. 380.85 s [unordered-containers] patching script interpreter paths in /nix/store/y4z9a55p1a4bp3hdqb4xyasp3pm9xkps-unordered-containers-0.2.20-doc
  14768. 381.00 s [unordered-containers:post-build] Uploading to cachix cache "sellout": /nix/store/jw9m3xmfr5wqlsgl7468rg5dprglz2n5-unordered-containers-0.2.20 /nix/store/y4z9a55p1a4bp3hdqb4xyasp3pm9xkps-unordered-containers-0.2.20-doc
  14769. 381.55 s [unordered-containers:post-build] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  14770. 381.55 s [unordered-containers:post-build]
  14771. 381.92 s [unordered-containers:post-build] Pushing /nix/store/jw9m3xmfr5wqlsgl7468rg5dprglz2n5-unordered-containers-0.2.20 (9.26 MiB)
  14772. 382.00 s [unordered-containers:post-build] Pushing /nix/store/y4z9a55p1a4bp3hdqb4xyasp3pm9xkps-unordered-containers-0.2.20-doc (4.50 MiB)
  14773. 383.09 s [unordered-containers:post-build]
  14774. 383.09 s [unordered-containers:post-build] All done.
  14775. 383.12 s [unordered-containers:post-build] Uploading to the NixCI cache: /nix/store/jw9m3xmfr5wqlsgl7468rg5dprglz2n5-unordered-containers-0.2.20 /nix/store/y4z9a55p1a4bp3hdqb4xyasp3pm9xkps-unordered-containers-0.2.20-doc
  14776. 383.20 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14777. 383.52 s [unordered-containers:post-build] copying 2 paths...
  14778. 383.52 s [unordered-containers:post-build] copying path '/nix/store/y4z9a55p1a4bp3hdqb4xyasp3pm9xkps-unordered-containers-0.2.20-doc' to 'https://cache.nix-ci.com'...
  14779. 384.18 s [unordered-containers:post-build] copying path '/nix/store/jw9m3xmfr5wqlsgl7468rg5dprglz2n5-unordered-containers-0.2.20' to 'https://cache.nix-ci.com'...
  14780. 387.01 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14781. 387.27 s [unordered-containers:post-build] copying 1 paths...
  14782. 387.31 s [unordered-containers:post-build] copying path '/nix/store/60g8jqh9dh1kld8d55xhrkvnk9b979iv-unordered-containers-0.2.20.drv' to 'https://cache.nix-ci.com'...
  14783. 387.52 s Progress: 8 of 16 built, 193 of 193 downloaded from cache
  14784. 387.59 s Building /nix/store/lrbayh5a7ds6wza1b7ir3wak0dd8zsn1-quickcheck-instances-0.3.32.drv
  14785. 387.75 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  14786. 387.76 s [quickcheck-instances] Build with /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4.
  14787. 387.99 s [quickcheck-instances] Phase: unpackPhase
  14788. 388.00 s [quickcheck-instances] unpacking source archive /nix/store/kz0fzqcr8g42rvq6dwlwvzxmg8rjfhqn-quickcheck-instances-0.3.32.tar.gz
  14789. 388.01 s [quickcheck-instances] source root is quickcheck-instances-0.3.32
  14790. 388.02 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.32/test/Tests.hs"
  14791. 388.02 s [quickcheck-instances] Phase: patchPhase
  14792. 388.03 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.32/revision/1.cabal.
  14793. 388.03 s [quickcheck-instances] Phase: compileBuildDriverPhase
  14794. 388.03 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.JsCQkR7o7Q/setup-package.conf.d -threaded
  14795. 388.08 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.JsCQkR7o7Q/Main.o )
  14796. 388.16 s [quickcheck-instances] [2 of 2] Linking Setup
  14797. 389.86 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  14798. 389.87 s [quickcheck-instances] Phase: configurePhase
  14799. 389.87 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/w3gr3wi20ak61i95ly8gdjym3mlk7jxr-quickcheck-instances-0.3.32 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/0lq5fcxh8rbqxms1k5h71aixv4in14dd-quickcheck-instances-0.3.32-doc/share/doc/quickcheck-instances-0.3.32 --with-gcc=gcc --package-db=/build/tmp.JsCQkR7o7Q/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  14800. 389.88 s [quickcheck-instances] Using Parsec parser
  14801. 389.88 s [quickcheck-instances] Configuring quickcheck-instances-0.3.32...
  14802. 390.26 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  14803. 390.26 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.15.1: using QuickCheck-2.14.3
  14804. 390.26 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
  14805. 390.26 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.19.2.0
  14806. 390.26 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.1.0
  14807. 390.26 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  14808. 390.26 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.6.8
  14809. 390.26 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  14810. 390.26 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.4.7.0
  14811. 390.26 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  14812. 390.26 s [quickcheck-instances] integer-logarithms-1.0.4
  14813. 390.26 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  14814. 390.26 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  14815. 390.26 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  14816. 390.26 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.1
  14817. 390.26 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  14818. 390.26 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.8
  14819. 390.26 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.1
  14820. 390.26 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  14821. 390.26 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  14822. 390.26 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.7
  14823. 390.26 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.0
  14824. 390.26 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  14825. 390.26 s [quickcheck-instances] unordered-containers-0.2.20
  14826. 390.26 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  14827. 390.26 s [quickcheck-instances] Dependency vector >=0.13.1.0 && <0.14: using vector-0.13.2.0
  14828. 390.26 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.14.3
  14829. 390.26 s [quickcheck-instances] Dependency base: using base-4.19.2.0
  14830. 390.26 s [quickcheck-instances] Dependency containers: using containers-0.6.8
  14831. 390.26 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  14832. 390.26 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.32
  14833. 390.26 s [quickcheck-instances] Dependency tagged: using tagged-0.8.8
  14834. 390.26 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  14835. 390.55 s [quickcheck-instances] Source component graph:
  14836. 390.55 s [quickcheck-instances] component lib
  14837. 390.55 s [quickcheck-instances] component test:self-test dependency lib
  14838. 390.55 s [quickcheck-instances] Configured component graph:
  14839. 390.55 s [quickcheck-instances] component quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0
  14840. 390.55 s [quickcheck-instances] include OneTuple-0.4.2-2W00w8aT0kw9xsuxClE0fS
  14841. 390.55 s [quickcheck-instances] include QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  14842. 390.55 s [quickcheck-instances] include array-0.5.8.0-bbbc
  14843. 390.55 s [quickcheck-instances] include base-4.19.2.0-0fde
  14844. 390.55 s [quickcheck-instances] include bytestring-0.12.1.0-c522
  14845. 390.55 s [quickcheck-instances] include case-insensitive-1.2.1.0-L8lBIJx4g3RKgOzxuT2pH8
  14846. 390.55 s [quickcheck-instances] include containers-0.6.8-ddec
  14847. 390.55 s [quickcheck-instances] include data-fix-0.3.4-3ugtRcj9IpDBZBhdn1bmmt
  14848. 390.55 s [quickcheck-instances] include hashable-1.4.7.0-Cn74cqcjwyW1of38P6bM3u
  14849. 390.55 s [quickcheck-instances] include integer-logarithms-1.0.4-CgIU5qp4vS4EBjs7iQtX8a
  14850. 390.55 s [quickcheck-instances] include old-time-1.1.0.4-CQvJG9Ew6X99pa7ogfDxzB
  14851. 390.56 s [quickcheck-instances] include primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  14852. 390.56 s [quickcheck-instances] include scientific-0.3.8.0-K5tDFJQON2O5O02hw1W6oz
  14853. 390.56 s [quickcheck-instances] include splitmix-0.1.1-J9nx3j5SWnzANc5bCE6otr
  14854. 390.56 s [quickcheck-instances] include strict-0.5.1-GR6xmZZ6WmbKVxycEqE6ht
  14855. 390.56 s [quickcheck-instances] include tagged-0.8.8-2THEaAWbkXP2mKNzFVOU9b
  14856. 390.56 s [quickcheck-instances] include text-2.1.1-fd6a
  14857. 390.56 s [quickcheck-instances] include text-short-0.1.6-7GVeyChRUtDArYfvBeLBPZ
  14858. 390.56 s [quickcheck-instances] include these-1.2.1-VL1lchWElUJvBkZ9nzqJN
  14859. 390.56 s [quickcheck-instances] include time-compat-1.9.7-55iqxFH3MBI5OtmQDz5rFf
  14860. 390.56 s [quickcheck-instances] include transformers-0.6.1.0-f128
  14861. 390.56 s [quickcheck-instances] include unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1
  14862. 390.56 s [quickcheck-instances] include uuid-types-1.0.6-702rL0iyLjWH7BUVzLVuEK
  14863. 390.56 s [quickcheck-instances] include vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  14864. 390.56 s [quickcheck-instances] component quickcheck-instances-0.3.32-Jl8WciKx8XRFMNp4uu4KaV-self-test
  14865. 390.56 s [quickcheck-instances] include QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  14866. 390.56 s [quickcheck-instances] include base-4.19.2.0-0fde
  14867. 390.56 s [quickcheck-instances] include containers-0.6.8-ddec
  14868. 390.56 s [quickcheck-instances] include primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  14869. 390.56 s [quickcheck-instances] include quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0
  14870. 390.56 s [quickcheck-instances] include tagged-0.8.8-2THEaAWbkXP2mKNzFVOU9b
  14871. 390.56 s [quickcheck-instances] include uuid-types-1.0.6-702rL0iyLjWH7BUVzLVuEK
  14872. 390.56 s [quickcheck-instances] Linked component graph:
  14873. 390.56 s [quickcheck-instances] unit quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0
  14874. 390.56 s [quickcheck-instances] include OneTuple-0.4.2-2W00w8aT0kw9xsuxClE0fS
  14875. 390.56 s [quickcheck-instances] include QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  14876. 390.56 s [quickcheck-instances] include array-0.5.8.0-bbbc
  14877. 390.56 s [quickcheck-instances] include base-4.19.2.0-0fde
  14878. 390.56 s [quickcheck-instances] include bytestring-0.12.1.0-c522
  14879. 390.56 s [quickcheck-instances] include case-insensitive-1.2.1.0-L8lBIJx4g3RKgOzxuT2pH8
  14880. 390.56 s [quickcheck-instances] include containers-0.6.8-ddec
  14881. 390.56 s [quickcheck-instances] include data-fix-0.3.4-3ugtRcj9IpDBZBhdn1bmmt
  14882. 390.56 s [quickcheck-instances] include hashable-1.4.7.0-Cn74cqcjwyW1of38P6bM3u
  14883. 390.56 s [quickcheck-instances] include integer-logarithms-1.0.4-CgIU5qp4vS4EBjs7iQtX8a
  14884. 390.56 s [quickcheck-instances] include old-time-1.1.0.4-CQvJG9Ew6X99pa7ogfDxzB
  14885. 390.56 s [quickcheck-instances] include primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  14886. 390.56 s [quickcheck-instances] include scientific-0.3.8.0-K5tDFJQON2O5O02hw1W6oz
  14887. 390.56 s [quickcheck-instances] include splitmix-0.1.1-J9nx3j5SWnzANc5bCE6otr
  14888. 390.56 s [quickcheck-instances] include strict-0.5.1-GR6xmZZ6WmbKVxycEqE6ht
  14889. 390.56 s [quickcheck-instances] include tagged-0.8.8-2THEaAWbkXP2mKNzFVOU9b
  14890. 390.56 s [quickcheck-instances] include text-2.1.1-fd6a
  14891. 390.56 s [quickcheck-instances] include text-short-0.1.6-7GVeyChRUtDArYfvBeLBPZ
  14892. 390.56 s [quickcheck-instances] include these-1.2.1-VL1lchWElUJvBkZ9nzqJN
  14893. 390.56 s [quickcheck-instances] include time-compat-1.9.7-55iqxFH3MBI5OtmQDz5rFf
  14894. 390.56 s [quickcheck-instances] include transformers-0.6.1.0-f128
  14895. 390.56 s [quickcheck-instances] include unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1
  14896. 390.56 s [quickcheck-instances] include uuid-types-1.0.6-702rL0iyLjWH7BUVzLVuEK
  14897. 390.56 s [quickcheck-instances] include vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  14898. 390.56 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0:Test.QuickCheck.Instances.Void
  14899. 390.56 s [quickcheck-instances] unit quickcheck-instances-0.3.32-Jl8WciKx8XRFMNp4uu4KaV-self-test
  14900. 390.56 s [quickcheck-instances] include QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  14901. 390.56 s [quickcheck-instances] include base-4.19.2.0-0fde
  14902. 390.56 s [quickcheck-instances] include containers-0.6.8-ddec
  14903. 390.56 s [quickcheck-instances] include primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  14904. 390.56 s [quickcheck-instances] include quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0
  14905. 390.56 s [quickcheck-instances] include tagged-0.8.8-2THEaAWbkXP2mKNzFVOU9b
  14906. 390.56 s [quickcheck-instances] include uuid-types-1.0.6-702rL0iyLjWH7BUVzLVuEK
  14907. 390.56 s [quickcheck-instances] Ready component graph:
  14908. 390.56 s [quickcheck-instances] definite quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0
  14909. 390.56 s [quickcheck-instances] depends OneTuple-0.4.2-2W00w8aT0kw9xsuxClE0fS
  14910. 390.56 s [quickcheck-instances] depends QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  14911. 390.56 s [quickcheck-instances] depends array-0.5.8.0-bbbc
  14912. 390.56 s [quickcheck-instances] depends base-4.19.2.0-0fde
  14913. 390.56 s [quickcheck-instances] depends bytestring-0.12.1.0-c522
  14914. 390.56 s [quickcheck-instances] depends case-insensitive-1.2.1.0-L8lBIJx4g3RKgOzxuT2pH8
  14915. 390.56 s [quickcheck-instances] depends containers-0.6.8-ddec
  14916. 390.56 s [quickcheck-instances] depends data-fix-0.3.4-3ugtRcj9IpDBZBhdn1bmmt
  14917. 390.56 s [quickcheck-instances] depends hashable-1.4.7.0-Cn74cqcjwyW1of38P6bM3u
  14918. 390.56 s [quickcheck-instances] depends integer-logarithms-1.0.4-CgIU5qp4vS4EBjs7iQtX8a
  14919. 390.56 s [quickcheck-instances] depends old-time-1.1.0.4-CQvJG9Ew6X99pa7ogfDxzB
  14920. 390.56 s [quickcheck-instances] depends primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  14921. 390.56 s [quickcheck-instances] depends scientific-0.3.8.0-K5tDFJQON2O5O02hw1W6oz
  14922. 390.56 s [quickcheck-instances] depends splitmix-0.1.1-J9nx3j5SWnzANc5bCE6otr
  14923. 390.56 s [quickcheck-instances] depends strict-0.5.1-GR6xmZZ6WmbKVxycEqE6ht
  14924. 390.56 s [quickcheck-instances] depends tagged-0.8.8-2THEaAWbkXP2mKNzFVOU9b
  14925. 390.56 s [quickcheck-instances] depends text-2.1.1-fd6a
  14926. 390.56 s [quickcheck-instances] depends text-short-0.1.6-7GVeyChRUtDArYfvBeLBPZ
  14927. 390.56 s [quickcheck-instances] depends these-1.2.1-VL1lchWElUJvBkZ9nzqJN
  14928. 390.56 s [quickcheck-instances] depends time-compat-1.9.7-55iqxFH3MBI5OtmQDz5rFf
  14929. 390.56 s [quickcheck-instances] depends transformers-0.6.1.0-f128
  14930. 390.56 s [quickcheck-instances] depends unordered-containers-0.2.20-B8fEFgZAZ7aTlt0iRPVk1
  14931. 390.56 s [quickcheck-instances] depends uuid-types-1.0.6-702rL0iyLjWH7BUVzLVuEK
  14932. 390.56 s [quickcheck-instances] depends vector-0.13.2.0-IIUr7Zn0DbyEckDMt8chd9
  14933. 390.56 s [quickcheck-instances] definite quickcheck-instances-0.3.32-Jl8WciKx8XRFMNp4uu4KaV-self-test
  14934. 390.56 s [quickcheck-instances] depends QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  14935. 390.56 s [quickcheck-instances] depends base-4.19.2.0-0fde
  14936. 390.56 s [quickcheck-instances] depends containers-0.6.8-ddec
  14937. 390.58 s [quickcheck-instances] depends primitive-0.9.1.0-Klx13KZdqwr1yrKGFGoUxq
  14938. 390.58 s [quickcheck-instances] depends quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0
  14939. 390.58 s [quickcheck-instances] depends tagged-0.8.8-2THEaAWbkXP2mKNzFVOU9b
  14940. 390.58 s [quickcheck-instances] depends uuid-types-1.0.6-702rL0iyLjWH7BUVzLVuEK
  14941. 390.58 s [quickcheck-instances] Using Cabal-3.10.3.0 compiled by ghc-9.8
  14942. 390.58 s [quickcheck-instances] Using compiler: ghc-9.8.4
  14943. 390.58 s [quickcheck-instances] Using install prefix:
  14944. 390.58 s [quickcheck-instances] /nix/store/w3gr3wi20ak61i95ly8gdjym3mlk7jxr-quickcheck-instances-0.3.32
  14945. 390.58 s [quickcheck-instances] Executables installed in:
  14946. 390.58 s [quickcheck-instances] /nix/store/w3gr3wi20ak61i95ly8gdjym3mlk7jxr-quickcheck-instances-0.3.32/bin
  14947. 390.58 s [quickcheck-instances] Libraries installed in:
  14948. 390.58 s [quickcheck-instances] /nix/store/w3gr3wi20ak61i95ly8gdjym3mlk7jxr-quickcheck-instances-0.3.32/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0
  14949. 390.58 s [quickcheck-instances] Dynamic Libraries installed in:
  14950. 390.58 s [quickcheck-instances] /nix/store/w3gr3wi20ak61i95ly8gdjym3mlk7jxr-quickcheck-instances-0.3.32/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  14951. 390.58 s [quickcheck-instances] Private executables installed in:
  14952. 390.58 s [quickcheck-instances] /nix/store/w3gr3wi20ak61i95ly8gdjym3mlk7jxr-quickcheck-instances-0.3.32/libexec/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.32
  14953. 390.58 s [quickcheck-instances] Data files installed in:
  14954. 390.58 s [quickcheck-instances] /nix/store/w3gr3wi20ak61i95ly8gdjym3mlk7jxr-quickcheck-instances-0.3.32/share/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.32
  14955. 390.58 s [quickcheck-instances] Documentation installed in:
  14956. 390.58 s [quickcheck-instances] /nix/store/0lq5fcxh8rbqxms1k5h71aixv4in14dd-quickcheck-instances-0.3.32-doc/share/doc/quickcheck-instances-0.3.32
  14957. 390.58 s [quickcheck-instances] Configuration files installed in:
  14958. 390.58 s [quickcheck-instances] /nix/store/w3gr3wi20ak61i95ly8gdjym3mlk7jxr-quickcheck-instances-0.3.32/etc
  14959. 390.58 s [quickcheck-instances] No alex found
  14960. 390.58 s [quickcheck-instances] Using ar found on system at:
  14961. 390.58 s [quickcheck-instances] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  14962. 390.58 s [quickcheck-instances] No c2hs found
  14963. 390.58 s [quickcheck-instances] No cpphs found
  14964. 390.58 s [quickcheck-instances] No doctest found
  14965. 390.58 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  14966. 390.58 s [quickcheck-instances] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  14967. 390.58 s [quickcheck-instances] Using ghc version 9.8.4 found on system at:
  14968. 390.58 s [quickcheck-instances] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc
  14969. 390.58 s [quickcheck-instances] Using ghc-pkg version 9.8.4 found on system at:
  14970. 390.58 s [quickcheck-instances] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc-pkg-9.8.4
  14971. 390.58 s [quickcheck-instances] No ghcjs found
  14972. 390.58 s [quickcheck-instances] No ghcjs-pkg found
  14973. 390.58 s [quickcheck-instances] No greencard found
  14974. 390.58 s [quickcheck-instances] Using haddock version 2.30.0 found on system at:
  14975. 390.58 s [quickcheck-instances] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/haddock-ghc-9.8.4
  14976. 390.58 s [quickcheck-instances] No happy found
  14977. 390.58 s [quickcheck-instances] Using haskell-suite found on system at: haskell-suite-dummy-location
  14978. 390.58 s [quickcheck-instances] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  14979. 390.58 s [quickcheck-instances] No hmake found
  14980. 390.58 s [quickcheck-instances] Using hpc version 0.69 found on system at:
  14981. 390.58 s [quickcheck-instances] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hpc-ghc-9.8.4
  14982. 390.58 s [quickcheck-instances] Using hsc2hs version 0.68.10 found on system at:
  14983. 390.58 s [quickcheck-instances] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  14984. 390.58 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  14985. 390.58 s [quickcheck-instances] /nix/store/r9acd8dqp6xxbhlplifjikwk7bc6w7vf-hscolour-1.25/bin/HsColour
  14986. 390.58 s [quickcheck-instances] No jhc found
  14987. 390.58 s [quickcheck-instances] Using ld found on system at:
  14988. 390.58 s [quickcheck-instances] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  14989. 390.58 s [quickcheck-instances] No pkg-config found
  14990. 390.58 s [quickcheck-instances] Using runghc version 9.8.4 found on system at:
  14991. 390.58 s [quickcheck-instances] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/runghc-9.8.4
  14992. 390.58 s [quickcheck-instances] Using strip version 2.44 found on system at:
  14993. 390.58 s [quickcheck-instances] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  14994. 390.58 s [quickcheck-instances] Using tar found on system at:
  14995. 390.58 s [quickcheck-instances] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  14996. 390.58 s [quickcheck-instances] No uhc found
  14997. 390.74 s [quickcheck-instances] Phase: buildPhase
  14998. 390.82 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.32..
  14999. 390.84 s [quickcheck-instances] Building library for quickcheck-instances-0.3.32..
  15000. 390.98 s [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 )
  15001. 391.04 s [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 )
  15002. 391.05 s [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 )
  15003. 391.94 s [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 )
  15004. 391.94 s [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 )
  15005. 392.51 s [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 )
  15006. 392.60 s [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 )
  15007. 392.60 s [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 )
  15008. 392.60 s [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 )
  15009. 392.60 s [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 )
  15010. 392.60 s [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 )
  15011. 392.60 s [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 )
  15012. 392.60 s [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 )
  15013. 392.60 s [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 )
  15014. 392.60 s [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 )
  15015. 392.87 s [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 )
  15016. 392.88 s [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 )
  15017. 392.88 s [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 )
  15018. 392.88 s [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 )
  15019. 392.88 s [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 )
  15020. 393.23 s [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 )
  15021. 393.23 s [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 )
  15022. 393.23 s [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 )
  15023. 393.23 s [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 )
  15024. 393.23 s [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 )
  15025. 393.23 s [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 )
  15026. 393.65 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, dist/build/Test/QuickCheck/Instances/Containers.p_o )
  15027. 393.89 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, dist/build/Test/QuickCheck/Instances/CustomPrelude.p_o )
  15028. 393.91 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, dist/build/Test/QuickCheck/Instances/CaseInsensitive.p_o )
  15029. 395.18 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, dist/build/Test/QuickCheck/Instances/ByteString.p_o )
  15030. 395.18 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, dist/build/Test/QuickCheck/Instances/Array.p_o )
  15031. 395.67 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, dist/build/Test/QuickCheck/Instances/DataFix.p_o )
  15032. 395.67 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, dist/build/Test/QuickCheck/Instances/Hashable.p_o )
  15033. 395.67 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, dist/build/Test/QuickCheck/Instances/Natural.p_o )
  15034. 395.67 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, dist/build/Test/QuickCheck/Instances/OldTime.p_o )
  15035. 395.67 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, dist/build/Test/QuickCheck/Instances/Primitive.p_o )
  15036. 395.68 s [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 )
  15037. 395.68 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, dist/build/Test/QuickCheck/Instances/Scientific.p_o )
  15038. 395.68 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, dist/build/Test/QuickCheck/Instances/Semigroup.p_o )
  15039. 395.68 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, dist/build/Test/QuickCheck/Instances/Solo.p_o )
  15040. 395.68 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, dist/build/Test/QuickCheck/Instances/Strict.p_o )
  15041. 395.70 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, dist/build/Test/QuickCheck/Instances/Tagged.p_o )
  15042. 395.70 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, dist/build/Test/QuickCheck/Instances/Text.p_o )
  15043. 395.70 s [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 )
  15044. 395.70 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, dist/build/Test/QuickCheck/Instances/These.p_o )
  15045. 395.88 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, dist/build/Test/QuickCheck/Instances/Time.p_o )
  15046. 396.22 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, dist/build/Test/QuickCheck/Instances/Transformer.p_o )
  15047. 396.22 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, dist/build/Test/QuickCheck/Instances/UUID.p_o )
  15048. 396.22 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, dist/build/Test/QuickCheck/Instances/UnorderedContainers.p_o )
  15049. 396.22 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, dist/build/Test/QuickCheck/Instances/Vector.p_o )
  15050. 396.22 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, dist/build/Test/QuickCheck/Instances/Void.p_o )
  15051. 396.22 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  15052. 398.04 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.32..
  15053. 398.04 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.32..
  15054. 398.13 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  15055. 398.45 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  15056. 399.34 s [quickcheck-instances] Phase: checkPhase
  15057. 399.38 s [quickcheck-instances] Running 1 test suites...
  15058. 399.38 s [quickcheck-instances] Test suite self-test: RUNNING...
  15059. 399.38 s [quickcheck-instances] +++ OK, passed 100 tests.
  15060. 399.39 s [quickcheck-instances] +++ OK, passed 100 tests.
  15061. 399.39 s [quickcheck-instances] +++ OK, passed 100 tests.
  15062. 399.39 s [quickcheck-instances] +++ OK, passed 100 tests.
  15063. 399.39 s [quickcheck-instances] +++ OK, passed 100 tests.
  15064. 399.39 s [quickcheck-instances] Test suite self-test: PASS
  15065. 399.39 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.32-self-test.log
  15066. 399.39 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  15067. 399.40 s [quickcheck-instances] Phase: haddockPhase
  15068. 399.53 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.32..
  15069. 399.54 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.32..
  15070. 399.54 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  15071. 399.54 s [quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
  15072. 399.61 s [quickcheck-instances] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  15073. 399.83 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing )
  15074. 399.84 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing )
  15075. 399.86 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing )
  15076. 399.99 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing )
  15077. 400.02 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing )
  15078. 400.04 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing )
  15079. 400.06 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing )
  15080. 400.07 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing )
  15081. 400.08 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing )
  15082. 400.11 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing )
  15083. 400.16 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing )
  15084. 400.16 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing )
  15085. 400.26 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing )
  15086. 400.28 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing )
  15087. 400.29 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing )
  15088. 400.33 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing )
  15089. 400.39 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing )
  15090. 400.40 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing )
  15091. 400.41 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing )
  15092. 400.43 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing )
  15093. 400.56 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing )
  15094. 400.59 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing )
  15095. 400.60 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing )
  15096. 400.63 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing )
  15097. 400.86 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing )
  15098. 400.87 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing )
  15099. 400.87 s [quickcheck-instances] Haddock coverage:
  15100. 400.87 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  15101. 400.87 s [quickcheck-instances] Missing documentation for:
  15102. 400.87 s [quickcheck-instances] Module header
  15103. 400.89 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  15104. 400.89 s [quickcheck-instances] Missing documentation for:
  15105. 400.89 s [quickcheck-instances] Module header
  15106. 400.89 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  15107. 400.89 s [quickcheck-instances] Missing documentation for:
  15108. 400.89 s [quickcheck-instances] Module header
  15109. 400.89 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  15110. 400.89 s [quickcheck-instances] Missing documentation for:
  15111. 400.89 s [quickcheck-instances] Module header
  15112. 400.89 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  15113. 400.90 s [quickcheck-instances] Missing documentation for:
  15114. 400.90 s [quickcheck-instances] Module header
  15115. 400.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  15116. 400.90 s [quickcheck-instances] Missing documentation for:
  15117. 400.90 s [quickcheck-instances] Module header
  15118. 400.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  15119. 400.90 s [quickcheck-instances] Missing documentation for:
  15120. 400.90 s [quickcheck-instances] Module header
  15121. 400.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  15122. 400.90 s [quickcheck-instances] Missing documentation for:
  15123. 400.90 s [quickcheck-instances] Module header
  15124. 400.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  15125. 400.90 s [quickcheck-instances] Missing documentation for:
  15126. 400.90 s [quickcheck-instances] Module header
  15127. 400.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  15128. 400.90 s [quickcheck-instances] Missing documentation for:
  15129. 400.90 s [quickcheck-instances] Module header
  15130. 400.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  15131. 400.90 s [quickcheck-instances] Missing documentation for:
  15132. 400.90 s [quickcheck-instances] Module header
  15133. 400.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  15134. 400.90 s [quickcheck-instances] Missing documentation for:
  15135. 400.90 s [quickcheck-instances] Module header
  15136. 400.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  15137. 400.90 s [quickcheck-instances] Missing documentation for:
  15138. 400.90 s [quickcheck-instances] Module header
  15139. 400.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  15140. 400.90 s [quickcheck-instances] Missing documentation for:
  15141. 400.90 s [quickcheck-instances] Module header
  15142. 400.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  15143. 400.90 s [quickcheck-instances] Missing documentation for:
  15144. 400.90 s [quickcheck-instances] Module header
  15145. 400.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  15146. 400.90 s [quickcheck-instances] Missing documentation for:
  15147. 400.90 s [quickcheck-instances] Module header
  15148. 400.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  15149. 400.90 s [quickcheck-instances] Missing documentation for:
  15150. 400.90 s [quickcheck-instances] Module header
  15151. 400.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  15152. 400.90 s [quickcheck-instances] Missing documentation for:
  15153. 400.90 s [quickcheck-instances] Module header
  15154. 400.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  15155. 400.90 s [quickcheck-instances] Missing documentation for:
  15156. 400.90 s [quickcheck-instances] Module header
  15157. 400.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  15158. 400.90 s [quickcheck-instances] Missing documentation for:
  15159. 400.90 s [quickcheck-instances] Module header
  15160. 400.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  15161. 400.90 s [quickcheck-instances] Missing documentation for:
  15162. 400.90 s [quickcheck-instances] Module header
  15163. 400.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  15164. 400.90 s [quickcheck-instances] Missing documentation for:
  15165. 400.90 s [quickcheck-instances] Module header
  15166. 400.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  15167. 400.90 s [quickcheck-instances] Missing documentation for:
  15168. 400.90 s [quickcheck-instances] Module header
  15169. 400.90 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  15170. 400.90 s [quickcheck-instances] Missing documentation for:
  15171. 400.90 s [quickcheck-instances] Module header
  15172. 400.90 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  15173. 401.70 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  15174. 401.70 s [quickcheck-instances] - Data.Vector.Vector
  15175. 401.70 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  15176. 401.70 s [quickcheck-instances] - Data.Vector.Storable.Vector
  15177. 401.70 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  15178. 401.70 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  15179. 405.13 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances/,
  15180. 405.21 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  15181. 405.21 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.32..
  15182. 405.21 s [quickcheck-instances] Phase: installPhase
  15183. 405.25 s [quickcheck-instances] Installing library in /nix/store/w3gr3wi20ak61i95ly8gdjym3mlk7jxr-quickcheck-instances-0.3.32/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0
  15184. 405.70 s [quickcheck-instances] Phase: fixupPhase
  15185. 405.72 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/w3gr3wi20ak61i95ly8gdjym3mlk7jxr-quickcheck-instances-0.3.32
  15186. 405.72 s [quickcheck-instances] shrinking /nix/store/w3gr3wi20ak61i95ly8gdjym3mlk7jxr-quickcheck-instances-0.3.32/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSquickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0-ghc9.8.4.so
  15187. 405.74 s [quickcheck-instances] checking for references to /build/ in /nix/store/w3gr3wi20ak61i95ly8gdjym3mlk7jxr-quickcheck-instances-0.3.32...
  15188. 405.76 s [quickcheck-instances] patching script interpreter paths in /nix/store/w3gr3wi20ak61i95ly8gdjym3mlk7jxr-quickcheck-instances-0.3.32
  15189. 405.77 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/w3gr3wi20ak61i95ly8gdjym3mlk7jxr-quickcheck-instances-0.3.32/lib
  15190. 405.92 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/0lq5fcxh8rbqxms1k5h71aixv4in14dd-quickcheck-instances-0.3.32-doc
  15191. 405.93 s [quickcheck-instances] checking for references to /build/ in /nix/store/0lq5fcxh8rbqxms1k5h71aixv4in14dd-quickcheck-instances-0.3.32-doc...
  15192. 405.94 s [quickcheck-instances] patching script interpreter paths in /nix/store/0lq5fcxh8rbqxms1k5h71aixv4in14dd-quickcheck-instances-0.3.32-doc
  15193. 406.12 s [quickcheck-instances:post-build] Uploading to cachix cache "sellout": /nix/store/0lq5fcxh8rbqxms1k5h71aixv4in14dd-quickcheck-instances-0.3.32-doc /nix/store/w3gr3wi20ak61i95ly8gdjym3mlk7jxr-quickcheck-instances-0.3.32
  15194. 406.67 s [quickcheck-instances:post-build] Pushing 2 paths (130 are already present) using zstd to cache sellout ⏳
  15195. 406.67 s [quickcheck-instances:post-build]
  15196. 407.05 s [quickcheck-instances:post-build] Pushing /nix/store/0lq5fcxh8rbqxms1k5h71aixv4in14dd-quickcheck-instances-0.3.32-doc (1.48 MiB)
  15197. 407.22 s [quickcheck-instances:post-build] Pushing /nix/store/w3gr3wi20ak61i95ly8gdjym3mlk7jxr-quickcheck-instances-0.3.32 (5.35 MiB)
  15198. 408.24 s [quickcheck-instances:post-build]
  15199. 408.24 s [quickcheck-instances:post-build] All done.
  15200. 408.27 s [quickcheck-instances:post-build] Uploading to the NixCI cache: /nix/store/0lq5fcxh8rbqxms1k5h71aixv4in14dd-quickcheck-instances-0.3.32-doc /nix/store/w3gr3wi20ak61i95ly8gdjym3mlk7jxr-quickcheck-instances-0.3.32
  15201. 408.35 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15202. 408.56 s [quickcheck-instances:post-build] copying 2 paths...
  15203. 408.56 s [quickcheck-instances:post-build] copying path '/nix/store/0lq5fcxh8rbqxms1k5h71aixv4in14dd-quickcheck-instances-0.3.32-doc' to 'https://cache.nix-ci.com'...
  15204. 408.99 s [quickcheck-instances:post-build] copying path '/nix/store/w3gr3wi20ak61i95ly8gdjym3mlk7jxr-quickcheck-instances-0.3.32' to 'https://cache.nix-ci.com'...
  15205. 410.72 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15206. 411.54 s [quickcheck-instances:post-build] copying 1 paths...
  15207. 411.59 s [quickcheck-instances:post-build] copying path '/nix/store/lrbayh5a7ds6wza1b7ir3wak0dd8zsn1-quickcheck-instances-0.3.32.drv' to 'https://cache.nix-ci.com'...
  15208. 411.80 s Progress: 9 of 16 built, 193 of 193 downloaded from cache
  15209. 411.87 s Building /nix/store/qfhgmdi2i43iplmiykpyv86bf0f0mhm1-extra-1.7.16.drv
  15210. 412.02 s [extra] Phase: setupCompilerEnvironmentPhase
  15211. 412.02 s [extra] Build with /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4.
  15212. 412.24 s [extra] Phase: unpackPhase
  15213. 412.25 s [extra] unpacking source archive /nix/store/zap07ayqyv48lfcxp4yva8sylcvy2knk-extra-1.7.16.tar.gz
  15214. 412.25 s [extra] source root is extra-1.7.16
  15215. 412.26 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.7.16/test/TestUtil.hs"
  15216. 412.27 s [extra] Phase: patchPhase
  15217. 412.27 s [extra] Replace Cabal file with edited version from mirror://hackage/extra-1.7.16/revision/1.cabal.
  15218. 412.28 s [extra] Phase: compileBuildDriverPhase
  15219. 412.28 s [extra] setupCompileFlags: -package-db=/build/tmp.k0wtlJMeO7/setup-package.conf.d -threaded
  15220. 412.33 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.k0wtlJMeO7/Main.o )
  15221. 412.40 s [extra] [2 of 2] Linking Setup
  15222. 414.01 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  15223. 414.03 s [extra] Phase: configurePhase
  15224. 414.04 s [extra] configureFlags: --verbose --prefix=/nix/store/s002wlz0dbqjp1bwqy6p6kz3amyc2ijq-extra-1.7.16 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/yzqzvaaway4m89ar7jhkrsws70cra3m8-extra-1.7.16-doc/share/doc/extra-1.7.16 --with-gcc=gcc --package-db=/build/tmp.k0wtlJMeO7/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib
  15225. 414.04 s [extra] Using Parsec parser
  15226. 414.04 s [extra] Configuring extra-1.7.16...
  15227. 414.51 s [extra] Dependency base >=4.9 && <4.21: using base-4.19.2.0
  15228. 414.51 s [extra] Dependency clock >=0.7: using clock-0.8.4
  15229. 414.51 s [extra] Dependency directory: using directory-1.3.8.5
  15230. 414.51 s [extra] Dependency filepath: using filepath-1.4.301.0
  15231. 414.51 s [extra] Dependency process: using process-1.6.25.0
  15232. 414.51 s [extra] Dependency time: using time-1.12.2
  15233. 414.51 s [extra] Dependency unix: using unix-2.8.6.0
  15234. 414.51 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.14.3
  15235. 414.51 s [extra] Dependency base >=4 && <5: using base-4.19.2.0
  15236. 414.51 s [extra] Dependency directory: using directory-1.3.8.5
  15237. 414.51 s [extra] Dependency extra: using extra-1.7.16
  15238. 414.51 s [extra] Dependency filepath: using filepath-1.4.301.0
  15239. 414.51 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.32
  15240. 414.51 s [extra] Dependency unix: using unix-2.8.6.0
  15241. 414.84 s [extra] Source component graph:
  15242. 414.84 s [extra] component lib
  15243. 414.84 s [extra] component test:extra-test dependency lib
  15244. 414.84 s [extra] Configured component graph:
  15245. 414.84 s [extra] component extra-1.7.16-BqnQjM86H1P931E5AxHLv4
  15246. 414.84 s [extra] include base-4.19.2.0-0fde
  15247. 414.84 s [extra] include clock-0.8.4-DRQnf2Ov2av3O4d6koLCsK
  15248. 414.84 s [extra] include directory-1.3.8.5-b132
  15249. 414.84 s [extra] include filepath-1.4.301.0-c763
  15250. 414.84 s [extra] include process-1.6.25.0-f020
  15251. 414.84 s [extra] include time-1.12.2-a970
  15252. 414.84 s [extra] include unix-2.8.6.0-75db
  15253. 414.84 s [extra] component extra-1.7.16-GRLmykPdQAAKAMYFWB3faC-extra-test
  15254. 414.84 s [extra] include QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  15255. 414.84 s [extra] include base-4.19.2.0-0fde
  15256. 414.84 s [extra] include directory-1.3.8.5-b132
  15257. 414.84 s [extra] include extra-1.7.16-BqnQjM86H1P931E5AxHLv4
  15258. 414.84 s [extra] include filepath-1.4.301.0-c763
  15259. 414.84 s [extra] include quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0
  15260. 414.84 s [extra] include unix-2.8.6.0-75db
  15261. 414.84 s [extra] Linked component graph:
  15262. 414.84 s [extra] unit extra-1.7.16-BqnQjM86H1P931E5AxHLv4
  15263. 414.84 s [extra] include base-4.19.2.0-0fde
  15264. 414.84 s [extra] include clock-0.8.4-DRQnf2Ov2av3O4d6koLCsK
  15265. 414.84 s [extra] include directory-1.3.8.5-b132
  15266. 414.84 s [extra] include filepath-1.4.301.0-c763
  15267. 414.84 s [extra] include process-1.6.25.0-f020
  15268. 414.84 s [extra] include time-1.12.2-a970
  15269. 414.84 s [extra] include unix-2.8.6.0-75db
  15270. 414.84 s [extra] Control.Concurrent.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:Control.Exception.Extra,Control.Monad.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:Control.Monad.Extra,Data.Either.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:Data.Either.Extra,Data.Foldable.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:Data.Foldable.Extra,Data.IORef.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:Data.IORef.Extra,Data.List.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:Data.Typeable.Extra,Data.Version.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:Data.Version.Extra,Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:Extra,Numeric.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:Numeric.Extra,System.Directory.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:System.Directory.Extra,System.Environment.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:System.Environment.Extra,System.IO.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:System.IO.Extra,System.Info.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:System.Info.Extra,System.Process.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:System.Process.Extra,System.Time.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:System.Time.Extra,Text.Read.Extra=extra-1.7.16-BqnQjM86H1P931E5AxHLv4:Text.Read.Extra
  15271. 414.84 s [extra] unit extra-1.7.16-GRLmykPdQAAKAMYFWB3faC-extra-test
  15272. 414.84 s [extra] include QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  15273. 414.84 s [extra] include base-4.19.2.0-0fde
  15274. 414.84 s [extra] include directory-1.3.8.5-b132
  15275. 414.84 s [extra] include extra-1.7.16-BqnQjM86H1P931E5AxHLv4
  15276. 414.84 s [extra] include filepath-1.4.301.0-c763
  15277. 414.84 s [extra] include quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0
  15278. 414.84 s [extra] include unix-2.8.6.0-75db
  15279. 414.84 s [extra] Ready component graph:
  15280. 414.84 s [extra] definite extra-1.7.16-BqnQjM86H1P931E5AxHLv4
  15281. 414.84 s [extra] depends base-4.19.2.0-0fde
  15282. 414.84 s [extra] depends clock-0.8.4-DRQnf2Ov2av3O4d6koLCsK
  15283. 414.84 s [extra] depends directory-1.3.8.5-b132
  15284. 414.84 s [extra] depends filepath-1.4.301.0-c763
  15285. 414.84 s [extra] depends process-1.6.25.0-f020
  15286. 414.84 s [extra] depends time-1.12.2-a970
  15287. 414.84 s [extra] depends unix-2.8.6.0-75db
  15288. 414.84 s [extra] definite extra-1.7.16-GRLmykPdQAAKAMYFWB3faC-extra-test
  15289. 414.84 s [extra] depends QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  15290. 414.84 s [extra] depends base-4.19.2.0-0fde
  15291. 414.84 s [extra] depends directory-1.3.8.5-b132
  15292. 414.84 s [extra] depends extra-1.7.16-BqnQjM86H1P931E5AxHLv4
  15293. 414.84 s [extra] depends filepath-1.4.301.0-c763
  15294. 414.84 s [extra] depends quickcheck-instances-0.3.32-L5SHFeOsxc08Nu4qo3LXZ0
  15295. 414.84 s [extra] depends unix-2.8.6.0-75db
  15296. 414.84 s [extra] Using Cabal-3.10.3.0 compiled by ghc-9.8
  15297. 414.84 s [extra] Using compiler: ghc-9.8.4
  15298. 414.84 s [extra] Using install prefix: /nix/store/s002wlz0dbqjp1bwqy6p6kz3amyc2ijq-extra-1.7.16
  15299. 414.84 s [extra] Executables installed in:
  15300. 414.84 s [extra] /nix/store/s002wlz0dbqjp1bwqy6p6kz3amyc2ijq-extra-1.7.16/bin
  15301. 414.84 s [extra] Libraries installed in:
  15302. 414.84 s [extra] /nix/store/s002wlz0dbqjp1bwqy6p6kz3amyc2ijq-extra-1.7.16/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/extra-1.7.16-BqnQjM86H1P931E5AxHLv4
  15303. 414.84 s [extra] Dynamic Libraries installed in:
  15304. 414.84 s [extra] /nix/store/s002wlz0dbqjp1bwqy6p6kz3amyc2ijq-extra-1.7.16/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  15305. 414.84 s [extra] Private executables installed in:
  15306. 414.84 s [extra] /nix/store/s002wlz0dbqjp1bwqy6p6kz3amyc2ijq-extra-1.7.16/libexec/x86_64-linux-ghc-9.8.4/extra-1.7.16
  15307. 414.84 s [extra] Data files installed in:
  15308. 414.84 s [extra] /nix/store/s002wlz0dbqjp1bwqy6p6kz3amyc2ijq-extra-1.7.16/share/x86_64-linux-ghc-9.8.4/extra-1.7.16
  15309. 414.84 s [extra] Documentation installed in:
  15310. 414.84 s [extra] /nix/store/yzqzvaaway4m89ar7jhkrsws70cra3m8-extra-1.7.16-doc/share/doc/extra-1.7.16
  15311. 414.84 s [extra] Configuration files installed in:
  15312. 414.84 s [extra] /nix/store/s002wlz0dbqjp1bwqy6p6kz3amyc2ijq-extra-1.7.16/etc
  15313. 414.84 s [extra] No alex found
  15314. 414.84 s [extra] Using ar found on system at:
  15315. 414.84 s [extra] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  15316. 414.84 s [extra] No c2hs found
  15317. 414.84 s [extra] No cpphs found
  15318. 414.84 s [extra] No doctest found
  15319. 414.84 s [extra] Using gcc version 14.3.0 given by user at:
  15320. 414.84 s [extra] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  15321. 414.84 s [extra] Using ghc version 9.8.4 found on system at:
  15322. 414.84 s [extra] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc
  15323. 414.84 s [extra] Using ghc-pkg version 9.8.4 found on system at:
  15324. 414.84 s [extra] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc-pkg-9.8.4
  15325. 414.84 s [extra] No ghcjs found
  15326. 414.84 s [extra] No ghcjs-pkg found
  15327. 414.84 s [extra] No greencard found
  15328. 414.84 s [extra] Using haddock version 2.30.0 found on system at:
  15329. 414.84 s [extra] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/haddock-ghc-9.8.4
  15330. 414.84 s [extra] No happy found
  15331. 414.84 s [extra] Using haskell-suite found on system at: haskell-suite-dummy-location
  15332. 414.84 s [extra] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  15333. 414.84 s [extra] No hmake found
  15334. 414.84 s [extra] Using hpc version 0.69 found on system at:
  15335. 414.84 s [extra] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hpc-ghc-9.8.4
  15336. 414.84 s [extra] Using hsc2hs version 0.68.10 found on system at:
  15337. 414.84 s [extra] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  15338. 414.84 s [extra] Using hscolour version 1.25 found on system at:
  15339. 414.84 s [extra] /nix/store/r9acd8dqp6xxbhlplifjikwk7bc6w7vf-hscolour-1.25/bin/HsColour
  15340. 414.84 s [extra] No jhc found
  15341. 414.84 s [extra] Using ld found on system at:
  15342. 414.84 s [extra] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  15343. 414.84 s [extra] No pkg-config found
  15344. 414.84 s [extra] Using runghc version 9.8.4 found on system at:
  15345. 414.84 s [extra] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/runghc-9.8.4
  15346. 414.84 s [extra] Using strip version 2.44 found on system at:
  15347. 414.84 s [extra] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  15348. 414.84 s [extra] Using tar found on system at:
  15349. 414.84 s [extra] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  15350. 414.84 s [extra] No uhc found
  15351. 415.00 s [extra] Phase: buildPhase
  15352. 415.08 s [extra] Preprocessing library for extra-1.7.16..
  15353. 415.09 s [extra] Building library for extra-1.7.16..
  15354. 415.48 s [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 )
  15355. 415.73 s [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 )
  15356. 415.73 s [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 )
  15357. 415.75 s [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 )
  15358. 415.75 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  15359. 415.79 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  15360. 415.79 s [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 )
  15361. 416.91 s [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 )
  15362. 417.02 s [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 )
  15363. 417.04 s [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 )
  15364. 417.04 s [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 )
  15365. 417.04 s [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 )
  15366. 417.20 s [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 )
  15367. 417.28 s [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 )
  15368. 417.59 s [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 )
  15369. 417.59 s [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 )
  15370. 417.59 s [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 )
  15371. 417.82 s [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 )
  15372. 417.82 s [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 )
  15373. 417.89 s [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 )
  15374. 417.89 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  15375. 417.96 s [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 )
  15376. 418.47 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  15377. 418.73 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  15378. 418.73 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  15379. 418.73 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  15380. 418.73 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  15381. 418.73 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  15382. 418.73 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  15383. 419.98 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  15384. 420.17 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  15385. 420.24 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  15386. 420.24 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  15387. 420.24 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  15388. 420.50 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  15389. 420.65 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  15390. 420.78 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  15391. 420.78 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  15392. 420.78 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  15393. 421.04 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  15394. 421.04 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  15395. 421.25 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  15396. 421.25 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  15397. 421.38 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  15398. 422.40 s [extra] Preprocessing test suite 'extra-test' for extra-1.7.16..
  15399. 422.40 s [extra] Building test suite 'extra-test' for extra-1.7.16..
  15400. 422.48 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  15401. 422.89 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  15402. 425.13 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  15403. 425.13 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  15404. 425.56 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  15405. 426.50 s [extra] Phase: checkPhase
  15406. 426.54 s [extra] Running 1 test suites...
  15407. 426.54 s [extra] Test suite extra-test: RUNNING...
  15408. 426.54 s [extra] withTempFile
  15409. 426.55 s [extra] +++ OK, passed 1 test.
  15410. 426.55 s [extra] captureOutput
  15411. 426.55 s [extra] +++ OK, passed 1 test.
  15412. 426.55 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  15413. 426.59 s [extra] +++ OK, passed 100 tests.
  15414. 426.59 s [extra] \(x :: IO Int) -> join (once x) == x
  15415. 426.64 s [extra] +++ OK, passed 100 tests.
  15416. 426.64 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  15417. 426.65 s [extra] +++ OK, passed 100 tests.
  15418. 426.65 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  15419. 426.69 s [extra] +++ OK, passed 100 tests.
  15420. 426.69 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  15421. 426.73 s [extra] +++ OK, passed 100 tests.
  15422. 426.73 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  15423. 426.79 s [extra] +++ OK, passed 100 tests.
  15424. 426.79 s [extra] stringException "test" == pure "test"
  15425. 426.79 s [extra] +++ OK, passed 1 test.
  15426. 426.79 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  15427. 426.79 s [extra] +++ OK, passed 1 test.
  15428. 426.79 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  15429. 426.79 s [extra] +++ OK, passed 1 test.
  15430. 426.79 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  15431. 426.79 s [extra] +++ OK, passed 1 test.
  15432. 426.79 s [extra] ignore (print 1) == print 1
  15433. 426.79 s [extra] +++ OK, passed 1 test.
  15434. 426.79 s [extra] ignore (fail "die") == pure ()
  15435. 426.79 s [extra] +++ OK, passed 1 test.
  15436. 426.80 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  15437. 426.80 s [extra] +++ OK, passed 1 test.
  15438. 426.80 s [extra] seq (errorIO "foo") (print 1) == print 1
  15439. 426.80 s [extra] +++ OK, passed 1 test.
  15440. 426.80 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  15441. 426.80 s [extra] +++ OK, passed 1 test.
  15442. 426.80 s [extra] seq (assertIO False) (print 1) == print 1
  15443. 426.80 s [extra] +++ OK, passed 1 test.
  15444. 426.80 s [extra] retry 1 (print "x") == print "x"
  15445. 426.80 s [extra] +++ OK, passed 1 test.
  15446. 426.80 s [extra] retry 3 (fail "die") == fail "die"
  15447. 426.80 s [extra] +++ OK, passed 1 test.
  15448. 426.80 s [extra] whenJust Nothing print == pure ()
  15449. 426.80 s [extra] +++ OK, passed 1 test.
  15450. 426.80 s [extra] whenJust (Just 1) print == print 1
  15451. 426.80 s [extra] +++ OK, passed 1 test.
  15452. 426.80 s [extra] pureIf @Maybe True 5 == Just 5
  15453. 426.80 s [extra] +++ OK, passed 1 test.
  15454. 426.80 s [extra] pureIf @Maybe False 5 == Nothing
  15455. 426.80 s [extra] +++ OK, passed 1 test.
  15456. 426.80 s [extra] pureIf @[] True 5 == [5]
  15457. 426.80 s [extra] +++ OK, passed 1 test.
  15458. 426.80 s [extra] pureIf @[] False 5 == []
  15459. 426.80 s [extra] +++ OK, passed 1 test.
  15460. 426.80 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  15461. 426.80 s [extra] +++ OK, passed 1 test.
  15462. 426.80 s [extra] whenMaybe False (print 1) == pure Nothing
  15463. 426.80 s [extra] +++ OK, passed 1 test.
  15464. 426.80 s [extra] \(x :: Maybe ()) -> unit x == x
  15465. 426.80 s [extra] +++ OK, passed 100 tests.
  15466. 426.80 s [extra] fold1M (\x y -> Just x) [] == undefined
  15467. 426.80 s [extra] +++ OK, passed 1 test.
  15468. 426.80 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  15469. 426.80 s [extra] +++ OK, passed 1 test.
  15470. 426.80 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  15471. 426.80 s [extra] +++ OK, passed 1 test.
  15472. 426.80 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  15473. 426.80 s [extra] +++ OK, passed 1 test.
  15474. 426.80 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  15475. 426.80 s [extra] +++ OK, passed 1 test.
  15476. 426.80 s [extra] Just True ||^ undefined == Just True
  15477. 426.80 s [extra] +++ OK, passed 1 test.
  15478. 426.80 s [extra] Just False ||^ Just True == Just True
  15479. 426.80 s [extra] +++ OK, passed 1 test.
  15480. 426.80 s [extra] Just False ||^ Just False == Just False
  15481. 426.80 s [extra] +++ OK, passed 1 test.
  15482. 426.80 s [extra] Just False &&^ undefined == Just False
  15483. 426.80 s [extra] +++ OK, passed 1 test.
  15484. 426.80 s [extra] Just True &&^ Just True == Just True
  15485. 426.80 s [extra] +++ OK, passed 1 test.
  15486. 426.80 s [extra] Just True &&^ Just False == Just False
  15487. 426.80 s [extra] +++ OK, passed 1 test.
  15488. 426.80 s [extra] anyM Just [False,True ,undefined] == Just True
  15489. 426.80 s [extra] +++ OK, passed 1 test.
  15490. 426.80 s [extra] anyM Just [False,False,undefined] == undefined
  15491. 426.80 s [extra] +++ OK, passed 1 test.
  15492. 426.80 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  15493. 426.81 s [extra] +++ OK, passed 100 tests.
  15494. 426.81 s [extra] allM Just [True,False,undefined] == Just False
  15495. 426.81 s [extra] +++ OK, passed 1 test.
  15496. 426.81 s [extra] allM Just [True,True ,undefined] == undefined
  15497. 426.81 s [extra] +++ OK, passed 1 test.
  15498. 426.81 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  15499. 426.81 s [extra] +++ OK, passed 100 tests.
  15500. 426.81 s [extra] orM [Just False,Just True ,undefined] == Just True
  15501. 426.81 s [extra] +++ OK, passed 1 test.
  15502. 426.81 s [extra] orM [Just False,Just False,undefined] == undefined
  15503. 426.81 s [extra] +++ OK, passed 1 test.
  15504. 426.81 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  15505. 426.81 s [extra] +++ OK, passed 100 tests.
  15506. 426.81 s [extra] andM [Just True,Just False,undefined] == Just False
  15507. 426.81 s [extra] +++ OK, passed 1 test.
  15508. 426.81 s [extra] andM [Just True,Just True ,undefined] == undefined
  15509. 426.81 s [extra] +++ OK, passed 1 test.
  15510. 426.81 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  15511. 426.81 s [extra] +++ OK, passed 100 tests.
  15512. 426.81 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  15513. 426.81 s [extra] +++ OK, passed 1 test.
  15514. 426.81 s [extra] findM (Just . isUpper) "test" == Just Nothing
  15515. 426.81 s [extra] +++ OK, passed 1 test.
  15516. 426.81 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  15517. 426.81 s [extra] +++ OK, passed 1 test.
  15518. 426.81 s [extra] fromLeft 1 (Left 3) == 3
  15519. 426.81 s [extra] +++ OK, passed 1 test.
  15520. 426.81 s [extra] fromLeft 1 (Right "foo") == 1
  15521. 426.81 s [extra] +++ OK, passed 1 test.
  15522. 426.81 s [extra] fromRight 1 (Right 3) == 3
  15523. 426.81 s [extra] +++ OK, passed 1 test.
  15524. 426.81 s [extra] fromRight 1 (Left "foo") == 1
  15525. 426.81 s [extra] +++ OK, passed 1 test.
  15526. 426.81 s [extra] \x -> fromLeft' (Left x) == x
  15527. 426.81 s [extra] +++ OK, passed 100 tests.
  15528. 426.81 s [extra] \x -> fromLeft' (Right x) == undefined
  15529. 426.81 s [extra] +++ OK, passed 100 tests.
  15530. 426.81 s [extra] \x -> fromRight' (Right x) == x
  15531. 426.81 s [extra] +++ OK, passed 100 tests.
  15532. 426.81 s [extra] \x -> fromRight' (Left x) == undefined
  15533. 426.81 s [extra] +++ OK, passed 100 tests.
  15534. 426.81 s [extra] \x -> fromEither (Left x ) == x
  15535. 426.81 s [extra] +++ OK, passed 100 tests.
  15536. 426.81 s [extra] \x -> fromEither (Right x) == x
  15537. 426.81 s [extra] +++ OK, passed 100 tests.
  15538. 426.81 s [extra] \a b -> maybeToEither a (Just b) == Right b
  15539. 426.82 s [extra] +++ OK, passed 100 tests.
  15540. 426.82 s [extra] \a -> maybeToEither a Nothing == Left a
  15541. 426.82 s [extra] +++ OK, passed 100 tests.
  15542. 426.82 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  15543. 426.82 s [extra] +++ OK, passed 100 tests.
  15544. 426.82 s [extra] \x -> eitherToMaybe (Right x) == Just x
  15545. 426.82 s [extra] +++ OK, passed 100 tests.
  15546. 426.82 s [extra] mapLeft show (Left 1) == Left "1"
  15547. 426.82 s [extra] +++ OK, passed 1 test.
  15548. 426.82 s [extra] mapLeft show (Right True) == Right True
  15549. 426.82 s [extra] +++ OK, passed 1 test.
  15550. 426.82 s [extra] mapRight show (Left 1) == Left 1
  15551. 426.82 s [extra] +++ OK, passed 1 test.
  15552. 426.82 s [extra] mapRight show (Right True) == Right "True"
  15553. 426.82 s [extra] +++ OK, passed 1 test.
  15554. 426.82 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  15555. 426.83 s [extra] +++ OK, passed 100 tests.
  15556. 426.83 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  15557. 426.83 s [extra] +++ OK, passed 100 tests.
  15558. 426.83 s [extra] \xs -> repeatedly line1 xs == lines xs
  15559. 426.83 s [extra] +++ OK, passed 100 tests.
  15560. 426.83 s [extra] disjoint [1,2,3] [4,5] == True
  15561. 426.83 s [extra] +++ OK, passed 1 test.
  15562. 426.83 s [extra] disjoint [1,2,3] [4,1] == False
  15563. 426.83 s [extra] +++ OK, passed 1 test.
  15564. 426.83 s [extra] disjointOrd [1,2,3] [4,5] == True
  15565. 426.83 s [extra] +++ OK, passed 1 test.
  15566. 426.84 s [extra] disjointOrd [1,2,3] [4,1] == False
  15567. 426.84 s [extra] +++ OK, passed 1 test.
  15568. 426.84 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  15569. 426.84 s [extra] +++ OK, passed 1 test.
  15570. 426.84 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  15571. 426.84 s [extra] +++ OK, passed 1 test.
  15572. 426.84 s [extra] anySame [1,1,2] == True
  15573. 426.84 s [extra] +++ OK, passed 1 test.
  15574. 426.84 s [extra] anySame [1,2,3] == False
  15575. 426.84 s [extra] +++ OK, passed 1 test.
  15576. 426.84 s [extra] anySame (1:2:1:undefined) == True
  15577. 426.84 s [extra] +++ OK, passed 1 test.
  15578. 426.84 s [extra] anySame [] == False
  15579. 426.84 s [extra] +++ OK, passed 1 test.
  15580. 426.84 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  15581. 426.84 s [extra] +++ OK, passed 100 tests.
  15582. 426.84 s [extra] allSame [1,1,2] == False
  15583. 426.84 s [extra] +++ OK, passed 1 test.
  15584. 426.84 s [extra] allSame [1,1,1] == True
  15585. 426.84 s [extra] +++ OK, passed 1 test.
  15586. 426.84 s [extra] allSame [1] == True
  15587. 426.84 s [extra] +++ OK, passed 1 test.
  15588. 426.84 s [extra] allSame [] == True
  15589. 426.84 s [extra] +++ OK, passed 1 test.
  15590. 426.84 s [extra] allSame (1:1:2:undefined) == False
  15591. 426.84 s [extra] +++ OK, passed 1 test.
  15592. 426.84 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  15593. 426.84 s [extra] +++ OK, passed 100 tests.
  15594. 426.84 s [extra] headDef 1 [] == 1
  15595. 426.84 s [extra] +++ OK, passed 1 test.
  15596. 426.84 s [extra] headDef 1 [2,3,4] == 2
  15597. 426.84 s [extra] +++ OK, passed 1 test.
  15598. 426.84 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  15599. 426.84 s [extra] +++ OK, passed 100 tests.
  15600. 426.84 s [extra] lastDef 1 [] == 1
  15601. 426.84 s [extra] +++ OK, passed 1 test.
  15602. 426.84 s [extra] lastDef 1 [2,3,4] == 4
  15603. 426.84 s [extra] +++ OK, passed 1 test.
  15604. 426.84 s [extra] \x xs -> lastDef x xs == last (x:xs)
  15605. 426.84 s [extra] +++ OK, passed 100 tests.
  15606. 426.84 s [extra] [2,3,4] !? 1 == Just 3
  15607. 426.84 s [extra] +++ OK, passed 1 test.
  15608. 426.84 s [extra] [2,3,4] !? (-1) == Nothing
  15609. 426.84 s [extra] +++ OK, passed 1 test.
  15610. 426.84 s [extra] [] !? 0 == Nothing
  15611. 426.84 s [extra] +++ OK, passed 1 test.
  15612. 426.84 s [extra] notNull [] == False
  15613. 426.84 s [extra] +++ OK, passed 1 test.
  15614. 426.84 s [extra] notNull [1] == True
  15615. 426.84 s [extra] +++ OK, passed 1 test.
  15616. 426.84 s [extra] \xs -> notNull xs == not (null xs)
  15617. 426.84 s [extra] +++ OK, passed 100 tests.
  15618. 426.84 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  15619. 426.84 s [extra] +++ OK, passed 1 test.
  15620. 426.84 s [extra] list 1 (\v _ -> v - 2) [] == 1
  15621. 426.84 s [extra] +++ OK, passed 1 test.
  15622. 426.84 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  15623. 426.84 s [extra] +++ OK, passed 100 tests.
  15624. 426.84 s [extra] unsnoc "test" == Just ("tes",'t')
  15625. 426.84 s [extra] +++ OK, passed 1 test.
  15626. 426.84 s [extra] unsnoc "" == Nothing
  15627. 426.84 s [extra] +++ OK, passed 1 test.
  15628. 426.84 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  15629. 426.84 s [extra] +++ OK, passed 100 tests.
  15630. 426.84 s [extra] cons 't' "est" == "test"
  15631. 426.84 s [extra] +++ OK, passed 1 test.
  15632. 426.84 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  15633. 426.84 s [extra] +++ OK, passed 100 tests.
  15634. 426.84 s [extra] snoc "tes" 't' == "test"
  15635. 426.84 s [extra] +++ OK, passed 1 test.
  15636. 426.84 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  15637. 426.84 s [extra] +++ OK, passed 100 tests.
  15638. 426.84 s [extra] enumerate == [False, True]
  15639. 426.84 s [extra] +++ OK, passed 1 test.
  15640. 426.85 s [extra] takeEnd 3 "hello" == "llo"
  15641. 426.85 s [extra] +++ OK, passed 1 test.
  15642. 426.85 s [extra] takeEnd 5 "bye" == "bye"
  15643. 426.85 s [extra] +++ OK, passed 1 test.
  15644. 426.85 s [extra] takeEnd (-1) "bye" == ""
  15645. 426.85 s [extra] +++ OK, passed 1 test.
  15646. 426.85 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  15647. 426.85 s [extra] +++ OK, passed 100 tests.
  15648. 426.85 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  15649. 426.85 s [extra] +++ OK, passed 100 tests.
  15650. 426.85 s [extra] dropEnd 3 "hello" == "he"
  15651. 426.85 s [extra] +++ OK, passed 1 test.
  15652. 426.85 s [extra] dropEnd 5 "bye" == ""
  15653. 426.85 s [extra] +++ OK, passed 1 test.
  15654. 426.85 s [extra] dropEnd (-1) "bye" == "bye"
  15655. 426.85 s [extra] +++ OK, passed 1 test.
  15656. 426.85 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  15657. 426.85 s [extra] +++ OK, passed 100 tests.
  15658. 426.85 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  15659. 426.85 s [extra] +++ OK, passed 100 tests.
  15660. 426.85 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  15661. 426.85 s [extra] +++ OK, passed 100 tests.
  15662. 426.85 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  15663. 426.85 s [extra] +++ OK, passed 1 test.
  15664. 426.85 s [extra] splitAtEnd 3 "he" == ("", "he")
  15665. 426.85 s [extra] +++ OK, passed 1 test.
  15666. 426.85 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  15667. 426.85 s [extra] +++ OK, passed 100 tests.
  15668. 426.85 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  15669. 426.85 s [extra] +++ OK, passed 100 tests.
  15670. 426.85 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  15671. 426.85 s [extra] +++ OK, passed 100 tests.
  15672. 426.85 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  15673. 426.85 s [extra] +++ OK, passed 1 test.
  15674. 426.85 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  15675. 426.85 s [extra] +++ OK, passed 100 tests.
  15676. 426.85 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  15677. 426.85 s [extra] +++ OK, passed 1 test.
  15678. 426.85 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  15679. 426.85 s [extra] +++ OK, passed 1 test.
  15680. 426.85 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  15681. 426.85 s [extra] +++ OK, passed 1 test.
  15682. 426.85 s [extra] trim " hello " == "hello"
  15683. 426.85 s [extra] +++ OK, passed 1 test.
  15684. 426.85 s [extra] trimStart " hello " == "hello "
  15685. 426.85 s [extra] +++ OK, passed 1 test.
  15686. 426.86 s [extra] trimEnd " hello " == " hello"
  15687. 426.86 s [extra] +++ OK, passed 1 test.
  15688. 426.86 s [extra] \s -> trim s == trimEnd (trimStart s)
  15689. 426.86 s [extra] +++ OK, passed 100 tests.
  15690. 426.86 s [extra] lower "This is A TEST" == "this is a test"
  15691. 426.86 s [extra] +++ OK, passed 1 test.
  15692. 426.86 s [extra] lower "" == ""
  15693. 426.86 s [extra] +++ OK, passed 1 test.
  15694. 426.86 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  15695. 426.86 s [extra] +++ OK, passed 1 test.
  15696. 426.86 s [extra] upper "" == ""
  15697. 426.86 s [extra] +++ OK, passed 1 test.
  15698. 426.86 s [extra] word1 "" == ("", "")
  15699. 426.86 s [extra] +++ OK, passed 1 test.
  15700. 426.86 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  15701. 426.86 s [extra] +++ OK, passed 1 test.
  15702. 426.86 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  15703. 426.86 s [extra] +++ OK, passed 1 test.
  15704. 426.86 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  15705. 426.86 s [extra] +++ OK, passed 100 tests.
  15706. 426.86 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  15707. 426.86 s [extra] +++ OK, passed 100 tests.
  15708. 426.86 s [extra] line1 "" == ("", "")
  15709. 426.86 s [extra] +++ OK, passed 1 test.
  15710. 426.86 s [extra] line1 "test" == ("test","")
  15711. 426.86 s [extra] +++ OK, passed 1 test.
  15712. 426.86 s [extra] line1 "test\n" == ("test","")
  15713. 426.86 s [extra] +++ OK, passed 1 test.
  15714. 426.86 s [extra] line1 "test\nrest" == ("test","rest")
  15715. 426.86 s [extra] +++ OK, passed 1 test.
  15716. 426.86 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  15717. 426.86 s [extra] +++ OK, passed 1 test.
  15718. 426.86 s [extra] escapeHTML "this is a test" == "this is a test"
  15719. 426.86 s [extra] +++ OK, passed 1 test.
  15720. 426.86 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  15721. 426.86 s [extra] +++ OK, passed 1 test.
  15722. 426.86 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  15723. 426.86 s [extra] +++ OK, passed 1 test.
  15724. 426.86 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  15725. 426.86 s [extra] +++ OK, passed 100 tests.
  15726. 426.86 s [extra] escapeJSON "this is a test" == "this is a test"
  15727. 426.86 s [extra] +++ OK, passed 1 test.
  15728. 426.86 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  15729. 426.86 s [extra] +++ OK, passed 1 test.
  15730. 426.86 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  15731. 426.86 s [extra] +++ OK, passed 1 test.
  15732. 426.86 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  15733. 426.87 s [extra] +++ OK, passed 100 tests.
  15734. 426.87 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  15735. 426.87 s [extra] +++ OK, passed 1 test.
  15736. 426.87 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  15737. 426.87 s [extra] +++ OK, passed 1 test.
  15738. 426.87 s [extra] maximumOn id [] == undefined
  15739. 426.87 s [extra] +++ OK, passed 1 test.
  15740. 426.87 s [extra] maximumOn length ["test","extra","a"] == "extra"
  15741. 426.87 s [extra] +++ OK, passed 1 test.
  15742. 426.87 s [extra] minimumOn id [] == undefined
  15743. 426.87 s [extra] +++ OK, passed 1 test.
  15744. 426.87 s [extra] minimumOn length ["test","extra","a"] == "a"
  15745. 426.87 s [extra] +++ OK, passed 1 test.
  15746. 426.87 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  15747. 426.87 s [extra] +++ OK, passed 1 test.
  15748. 426.87 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  15749. 426.87 s [extra] +++ OK, passed 100 tests.
  15750. 426.87 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  15751. 426.87 s [extra] +++ OK, passed 100 tests.
  15752. 426.87 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  15753. 426.87 s [extra] +++ OK, passed 1 test.
  15754. 426.87 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  15755. 426.87 s [extra] +++ OK, passed 1 test.
  15756. 426.87 s [extra] sum' [1, 2, 3] == 6
  15757. 426.87 s [extra] +++ OK, passed 1 test.
  15758. 426.87 s [extra] sumOn' read ["1", "2", "3"] == 6
  15759. 426.87 s [extra] +++ OK, passed 1 test.
  15760. 426.87 s [extra] product' [1, 2, 4] == 8
  15761. 426.87 s [extra] +++ OK, passed 1 test.
  15762. 426.87 s [extra] productOn' read ["1", "2", "4"] == 8
  15763. 426.87 s [extra] +++ OK, passed 1 test.
  15764. 426.88 s [extra] merge "ace" "bd" == "abcde"
  15765. 426.88 s [extra] +++ OK, passed 1 test.
  15766. 426.88 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  15767. 426.88 s [extra] +++ OK, passed 100 tests.
  15768. 426.88 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  15769. 426.88 s [extra] +++ OK, passed 1 test.
  15770. 426.88 s [extra] replace "el" "e" "Hello" == "Helo"
  15771. 426.88 s [extra] +++ OK, passed 1 test.
  15772. 426.88 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  15773. 426.88 s [extra] +++ OK, passed 1 test.
  15774. 426.88 s [extra] replace "" "x" "" == "x"
  15775. 426.88 s [extra] +++ OK, passed 1 test.
  15776. 426.88 s [extra] \xs ys -> replace xs xs ys == ys
  15777. 426.88 s [extra] +++ OK, passed 100 tests.
  15778. 426.88 s [extra] breakEnd isLower "youRE" == ("you","RE")
  15779. 426.88 s [extra] +++ OK, passed 1 test.
  15780. 426.88 s [extra] breakEnd isLower "youre" == ("youre","")
  15781. 426.88 s [extra] +++ OK, passed 1 test.
  15782. 426.88 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  15783. 426.88 s [extra] +++ OK, passed 1 test.
  15784. 426.88 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  15785. 426.88 s [extra] +++ OK, passed 100 tests.
  15786. 426.88 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  15787. 426.88 s [extra] +++ OK, passed 1 test.
  15788. 426.88 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  15789. 426.88 s [extra] +++ OK, passed 1 test.
  15790. 426.88 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  15791. 426.88 s [extra] +++ OK, passed 100 tests.
  15792. 426.88 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  15793. 426.88 s [extra] +++ OK, passed 100 tests.
  15794. 426.88 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  15795. 426.88 s [extra] +++ OK, passed 1 test.
  15796. 426.88 s [extra] \s -> wordsBy isSpace s == words s
  15797. 426.88 s [extra] +++ OK, passed 100 tests.
  15798. 426.88 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  15799. 426.88 s [extra] +++ OK, passed 1 test.
  15800. 426.88 s [extra] \s -> linesBy (== '\n') s == lines s
  15801. 426.88 s [extra] +++ OK, passed 100 tests.
  15802. 426.88 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  15803. 426.88 s [extra] +++ OK, passed 1 test.
  15804. 426.88 s [extra] firstJust id [Nothing,Just 3] == Just 3
  15805. 426.88 s [extra] +++ OK, passed 1 test.
  15806. 426.88 s [extra] firstJust id [Nothing,Nothing] == Nothing
  15807. 426.88 s [extra] +++ OK, passed 1 test.
  15808. 426.88 s [extra] drop1 "" == ""
  15809. 426.88 s [extra] +++ OK, passed 1 test.
  15810. 426.88 s [extra] drop1 "test" == "est"
  15811. 426.88 s [extra] +++ OK, passed 1 test.
  15812. 426.88 s [extra] \xs -> drop 1 xs == drop1 xs
  15813. 426.88 s [extra] +++ OK, passed 100 tests.
  15814. 426.88 s [extra] dropEnd1 "" == ""
  15815. 426.88 s [extra] +++ OK, passed 1 test.
  15816. 426.88 s [extra] dropEnd1 "test" == "tes"
  15817. 426.88 s [extra] +++ OK, passed 1 test.
  15818. 426.88 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  15819. 426.88 s [extra] +++ OK, passed 100 tests.
  15820. 426.88 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  15821. 426.88 s [extra] +++ OK, passed 1 test.
  15822. 426.88 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  15823. 426.90 s [extra] +++ OK, passed 100 tests.
  15824. 426.90 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  15825. 426.90 s [extra] +++ OK, passed 1 test.
  15826. 426.90 s [extra] breakOn "/" "foobar" == ("foobar", "")
  15827. 426.90 s [extra] +++ OK, passed 1 test.
  15828. 426.90 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  15829. 426.90 s [extra] +++ OK, passed 100 tests.
  15830. 426.90 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  15831. 426.90 s [extra] +++ OK, passed 1 test.
  15832. 426.90 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  15833. 426.90 s [extra] +++ OK, passed 1 test.
  15834. 426.90 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  15835. 426.90 s [extra] +++ OK, passed 1 test.
  15836. 426.90 s [extra] splitOn "x" "x" == ["",""]
  15837. 426.90 s [extra] +++ OK, passed 1 test.
  15838. 426.90 s [extra] splitOn "x" "" == [""]
  15839. 426.90 s [extra] +++ OK, passed 1 test.
  15840. 426.90 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  15841. 426.90 s [extra] +++ OK, passed 100 tests; 14 discarded.
  15842. 426.90 s [extra] \c x -> splitOn [c] x == split (==c) x
  15843. 426.90 s [extra] +++ OK, passed 100 tests.
  15844. 426.90 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  15845. 426.90 s [extra] +++ OK, passed 1 test.
  15846. 426.90 s [extra] split (== 'a') "" == [""]
  15847. 426.90 s [extra] +++ OK, passed 1 test.
  15848. 426.90 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  15849. 426.90 s [extra] +++ OK, passed 1 test.
  15850. 426.90 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  15851. 426.90 s [extra] +++ OK, passed 1 test.
  15852. 426.90 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  15853. 426.90 s [extra] +++ OK, passed 1 test.
  15854. 426.90 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  15855. 426.90 s [extra] +++ OK, passed 1 test.
  15856. 426.90 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  15857. 426.90 s [extra] +++ OK, passed 1 test.
  15858. 426.90 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  15859. 426.90 s [extra] +++ OK, passed 1 test.
  15860. 426.90 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  15861. 426.90 s [extra] +++ OK, passed 1 test.
  15862. 426.90 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  15863. 426.90 s [extra] +++ OK, passed 1 test.
  15864. 426.90 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  15865. 426.90 s [extra] +++ OK, passed 1 test.
  15866. 426.90 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  15867. 426.90 s [extra] +++ OK, passed 1 test.
  15868. 426.90 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  15869. 426.90 s [extra] +++ OK, passed 1 test.
  15870. 426.90 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  15871. 426.90 s [extra] +++ OK, passed 1 test.
  15872. 426.90 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  15873. 426.90 s [extra] +++ OK, passed 1 test.
  15874. 426.90 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  15875. 426.90 s [extra] +++ OK, passed 1 test.
  15876. 426.90 s [extra] stripSuffix "" "baz" == Just "baz"
  15877. 426.90 s [extra] +++ OK, passed 1 test.
  15878. 426.90 s [extra] stripSuffix "foo" "quux" == Nothing
  15879. 426.90 s [extra] +++ OK, passed 1 test.
  15880. 426.90 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  15881. 426.90 s [extra] +++ OK, passed 1 test.
  15882. 426.90 s [extra] stripInfix "/" "foobar" == Nothing
  15883. 426.90 s [extra] +++ OK, passed 1 test.
  15884. 426.90 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  15885. 426.90 s [extra] +++ OK, passed 1 test.
  15886. 426.90 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  15887. 426.90 s [extra] +++ OK, passed 1 test.
  15888. 426.90 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  15889. 426.90 s [extra] +++ OK, passed 1 test.
  15890. 426.90 s [extra] chunksOf 8 "" == []
  15891. 426.90 s [extra] +++ OK, passed 1 test.
  15892. 426.90 s [extra] chunksOf 0 "test" == undefined
  15893. 426.90 s [extra] +++ OK, passed 1 test.
  15894. 426.90 s [extra] nubSort "this is a test" == " aehist"
  15895. 426.90 s [extra] +++ OK, passed 1 test.
  15896. 426.90 s [extra] \xs -> nubSort xs == nub (sort xs)
  15897. 426.91 s [extra] +++ OK, passed 100 tests.
  15898. 426.91 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  15899. 426.91 s [extra] +++ OK, passed 1 test.
  15900. 426.91 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  15901. 426.91 s [extra] +++ OK, passed 1 test.
  15902. 426.91 s [extra] nubOrd "this is a test" == "this ae"
  15903. 426.91 s [extra] +++ OK, passed 1 test.
  15904. 426.91 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  15905. 426.91 s [extra] +++ OK, passed 1 test.
  15906. 426.91 s [extra] \xs -> nubOrd xs == nub xs
  15907. 426.91 s [extra] +++ OK, passed 100 tests.
  15908. 426.91 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  15909. 426.91 s [extra] +++ OK, passed 1 test.
  15910. 426.91 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  15911. 426.91 s [extra] +++ OK, passed 1 test.
  15912. 426.91 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  15913. 426.91 s [extra] +++ OK, passed 1 test.
  15914. 426.91 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  15915. 426.91 s [extra] +++ OK, passed 1 test.
  15916. 426.91 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  15917. 426.91 s [extra] +++ OK, passed 1 test.
  15918. 426.91 s [extra] compareLength [1,2,3] 1 == GT
  15919. 426.91 s [extra] +++ OK, passed 1 test.
  15920. 426.91 s [extra] compareLength [1,2] 2 == EQ
  15921. 426.91 s [extra] +++ OK, passed 1 test.
  15922. 426.91 s [extra] \(xs :: [Int]) n -> compareLength xs n == compare (length xs) n
  15923. 426.91 s [extra] +++ OK, passed 100 tests.
  15924. 426.91 s [extra] compareLength (1:2:3:undefined) 2 == GT
  15925. 426.91 s [extra] +++ OK, passed 1 test.
  15926. 426.91 s [extra] comparingLength [1,2,3] [False] == GT
  15927. 426.91 s [extra] +++ OK, passed 1 test.
  15928. 426.91 s [extra] comparingLength [1,2] "ab" == EQ
  15929. 426.91 s [extra] +++ OK, passed 1 test.
  15930. 426.91 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  15931. 426.91 s [extra] +++ OK, passed 100 tests.
  15932. 426.91 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  15933. 426.91 s [extra] +++ OK, passed 1 test.
  15934. 426.91 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  15935. 426.91 s [extra] +++ OK, passed 1 test.
  15936. 426.91 s [extra] mwhen True "test" == "test"
  15937. 426.91 s [extra] +++ OK, passed 1 test.
  15938. 426.91 s [extra] mwhen False "test" == ""
  15939. 426.91 s [extra] +++ OK, passed 1 test.
  15940. 426.91 s [extra] first succ (1,"test") == (2,"test")
  15941. 426.91 s [extra] +++ OK, passed 1 test.
  15942. 426.91 s [extra] second reverse (1,"test") == (1,"tset")
  15943. 426.91 s [extra] +++ OK, passed 1 test.
  15944. 426.91 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  15945. 426.91 s [extra] +++ OK, passed 1 test.
  15946. 426.91 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  15947. 426.91 s [extra] +++ OK, passed 1 test.
  15948. 426.91 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  15949. 426.91 s [extra] +++ OK, passed 1 test.
  15950. 426.91 s [extra] (succ &&& pred) 1 == (2,0)
  15951. 426.91 s [extra] +++ OK, passed 1 test.
  15952. 426.91 s [extra] dupe 12 == (12, 12)
  15953. 426.91 s [extra] +++ OK, passed 1 test.
  15954. 426.91 s [extra] both succ (1,2) == (2,3)
  15955. 426.91 s [extra] +++ OK, passed 1 test.
  15956. 426.91 s [extra] first3 succ (1,1,1) == (2,1,1)
  15957. 426.91 s [extra] +++ OK, passed 1 test.
  15958. 426.91 s [extra] second3 succ (1,1,1) == (1,2,1)
  15959. 426.91 s [extra] +++ OK, passed 1 test.
  15960. 426.91 s [extra] third3 succ (1,1,1) == (1,1,2)
  15961. 426.91 s [extra] +++ OK, passed 1 test.
  15962. 426.91 s [extra] \x -> readVersion (showVersion x) == x
  15963. 426.91 s [extra] +++ OK, passed 100 tests.
  15964. 426.91 s [extra] readVersion "hello" == undefined
  15965. 426.91 s [extra] +++ OK, passed 1 test.
  15966. 426.91 s [extra] showDP 4 pi == "3.1416"
  15967. 426.91 s [extra] +++ OK, passed 1 test.
  15968. 426.91 s [extra] showDP 0 pi == "3"
  15969. 426.91 s [extra] +++ OK, passed 1 test.
  15970. 426.91 s [extra] showDP 2 3 == "3.00"
  15971. 426.91 s [extra] +++ OK, passed 1 test.
  15972. 426.91 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  15973. 426.91 s [extra] +++ OK, passed 1 test.
  15974. 426.91 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  15975. 426.91 s [extra] +++ OK, passed 1 test.
  15976. 426.91 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  15977. 426.91 s [extra] +++ OK, passed 1 test.
  15978. 426.91 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  15979. 426.91 s [extra] +++ OK, passed 1 test.
  15980. 426.91 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  15981. 426.91 s [extra] +++ OK, passed 1 test.
  15982. 426.91 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  15983. 426.91 s [extra] +++ OK, passed 1 test.
  15984. 426.91 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  15985. 426.91 s [extra] +++ OK, passed 1 test.
  15986. 426.91 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  15987. 426.91 s [extra] +++ OK, passed 1 test.
  15988. 426.91 s [extra] isWindows == (os == "mingw32")
  15989. 426.91 s [extra] +++ OK, passed 1 test.
  15990. 426.91 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  15991. 426.99 s [extra] +++ OK, passed 100 tests.
  15992. 426.99 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  15993. 427.03 s [extra] +++ OK, passed 100 tests.
  15994. 427.03 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  15995. 427.10 s [extra] +++ OK, passed 100 tests.
  15996. 427.10 s [extra] captureOutput (print 1) == pure ("1\n",())
  15997. 427.10 s [extra] +++ OK, passed 1 test.
  15998. 427.10 s [extra] withTempFile doesFileExist == pure True
  15999. 427.10 s [extra] +++ OK, passed 1 test.
  16000. 427.10 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  16001. 427.10 s [extra] +++ OK, passed 1 test.
  16002. 427.10 s [extra] withTempFile readFile' == pure ""
  16003. 427.10 s [extra] +++ OK, passed 1 test.
  16004. 427.10 s [extra] withTempDir doesDirectoryExist == pure True
  16005. 427.10 s [extra] +++ OK, passed 1 test.
  16006. 427.10 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  16007. 427.10 s [extra] +++ OK, passed 1 test.
  16008. 427.10 s [extra] withTempDir listFiles == pure []
  16009. 427.10 s [extra] +++ OK, passed 1 test.
  16010. 427.10 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  16011. 427.10 s [extra] +++ OK, passed 1 test.
  16012. 427.10 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  16013. 427.10 s [extra] +++ OK, passed 1 test.
  16014. 427.10 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  16015. 427.10 s [extra] +++ OK, passed 1 test.
  16016. 427.10 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  16017. 427.10 s [extra] +++ OK, passed 1 test.
  16018. 427.10 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  16019. 427.11 s [extra] +++ OK, passed 1 test.
  16020. 427.11 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  16021. 427.11 s [extra] +++ OK, passed 1 test.
  16022. 427.11 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  16023. 428.11 s [extra] +++ OK, passed 1 test.
  16024. 428.11 s [extra] timeout (-3) (print 1) == pure Nothing
  16025. 428.23 s [extra] +++ OK, passed 1 test.
  16026. 428.23 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  16027. 428.23 s [extra] +++ OK, passed 1 test.
  16028. 428.23 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  16029. 428.23 s [extra] 0.100270988
  16030. 428.23 s [extra] +++ OK, passed 1 test.
  16031. 428.23 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  16032. 428.31 s [extra] +++ OK, passed 1 test.
  16033. 428.31 s [extra] showDuration 3.435 == "3.44s"
  16034. 428.31 s [extra] +++ OK, passed 1 test.
  16035. 428.31 s [extra] showDuration 623.8 == "10m24s"
  16036. 428.31 s [extra] +++ OK, passed 1 test.
  16037. 428.31 s [extra] showDuration 62003.8 == "17h13m"
  16038. 428.31 s [extra] +++ OK, passed 1 test.
  16039. 428.31 s [extra] showDuration 1e8 == "27777h47m"
  16040. 428.31 s [extra] +++ OK, passed 1 test.
  16041. 428.31 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  16042. 428.31 s [extra] +++ OK, passed 1 test.
  16043. 428.31 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  16044. 429.31 s [extra] +++ OK, passed 1 test.
  16045. 429.31 s [extra] Extra export
  16046. 429.31 s [extra] +++ OK, passed 1 test.
  16047. 429.31 s [extra] withTempFile
  16048. 429.32 s [extra] ....done
  16049. 429.32 s [extra] withTempDir
  16050. 429.33 s [extra] ....done
  16051. 429.33 s [extra] retry
  16052. 429.33 s [extra] +++ OK, passed 1 test.
  16053. 429.33 s [extra] barrier
  16054. 429.33 s [extra] Success (323 tests)
  16055. 429.35 s [extra] Test suite extra-test: PASS
  16056. 429.35 s [extra] Test suite logged to: dist/test/extra-1.7.16-extra-test.log
  16057. 429.35 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  16058. 429.36 s [extra] Phase: haddockPhase
  16059. 429.47 s [extra] Preprocessing library for extra-1.7.16..
  16060. 429.48 s [extra] Running Haddock on library for extra-1.7.16..
  16061. 429.51 s [extra] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  16062. 429.81 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing )
  16063. 429.83 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing )
  16064. 429.83 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing )
  16065. 429.84 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing )
  16066. 429.85 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, nothing )
  16067. 429.86 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, nothing )
  16068. 429.86 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, nothing )
  16069. 430.15 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing )
  16070. 430.15 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing )
  16071. 430.17 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing )
  16072. 430.17 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing )
  16073. 430.21 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing )
  16074. 430.26 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing )
  16075. 430.27 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing )
  16076. 430.29 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing )
  16077. 430.31 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing )
  16078. 430.32 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, nothing )
  16079. 430.42 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing )
  16080. 430.42 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing )
  16081. 430.43 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing )
  16082. 430.45 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, nothing )
  16083. 430.50 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, nothing )
  16084. 430.50 s [extra] Haddock coverage:
  16085. 430.51 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  16086. 430.51 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  16087. 430.51 s [extra] Warning: 'Arrow' is out of scope.
  16088. 430.51 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16089. 430.51 s [extra] 100% ( 28 / 28) in 'Data.Tuple.Extra'
  16090. 430.51 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  16091. 430.51 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  16092. 430.51 s [extra] Warning: '(:)' is out of scope.
  16093. 430.51 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16094. 430.51 s [extra] Warning: 'unzip' is ambiguous. It is defined
  16095. 430.51 s [extra] * in ‘Data.Functor’
  16096. 430.51 s [extra] * in ‘GHC.List’
  16097. 430.51 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16098. 430.51 s [extra] by specifying the type/value namespace explicitly.
  16099. 430.51 s [extra] Defaulting to the one defined in ‘GHC.List’
  16100. 430.52 s [extra] Warning: 'firstJustM' is out of scope.
  16101. 430.52 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16102. 430.52 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  16103. 430.52 s [extra] Warning: 'Version' is ambiguous. It is defined
  16104. 430.52 s [extra] * in ‘Data.Version’
  16105. 430.52 s [extra] * in ‘Data.Version’
  16106. 430.52 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16107. 430.52 s [extra] by specifying the type/value namespace explicitly.
  16108. 430.52 s [extra] Defaulting to the one defined in ‘Data.Version’
  16109. 430.52 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  16110. 430.52 s [extra] 100% ( 22 / 22) in 'Data.List.NonEmpty.Extra'
  16111. 430.52 s [extra] Warning: 'fromJust' is out of scope.
  16112. 430.52 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16113. 430.52 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  16114. 430.53 s [extra] Warning: 'ErrorCall' is ambiguous. It is defined
  16115. 430.53 s [extra] * in ‘GHC.Exception’
  16116. 430.53 s [extra] * in ‘GHC.Exception’
  16117. 430.53 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16118. 430.53 s [extra] by specifying the type/value namespace explicitly.
  16119. 430.53 s [extra] Defaulting to the one defined in ‘GHC.Exception’
  16120. 430.53 s [extra] Warning: 'AssertionFailed' is ambiguous. It is defined
  16121. 430.53 s [extra] * in ‘GHC.IO.Exception’
  16122. 430.53 s [extra] * in ‘GHC.IO.Exception’
  16123. 430.53 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16124. 430.53 s [extra] by specifying the type/value namespace explicitly.
  16125. 430.53 s [extra] Defaulting to the one defined in ‘GHC.IO.Exception’
  16126. 430.53 s [extra] Warning: 'SomeException' is ambiguous. It is defined
  16127. 430.53 s [extra] * in ‘GHC.Exception.Type’
  16128. 430.53 s [extra] * in ‘GHC.Exception.Type’
  16129. 430.53 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16130. 430.53 s [extra] by specifying the type/value namespace explicitly.
  16131. 430.53 s [extra] Defaulting to the one defined in ‘GHC.Exception.Type’
  16132. 430.53 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  16133. 430.53 s [extra] Warning: 'partition' is out of scope.
  16134. 430.53 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16135. 430.53 s [extra] Warning: 'mconcatMap' is out of scope.
  16136. 430.53 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16137. 430.53 s [extra] Warning: 'find' is out of scope.
  16138. 430.53 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16139. 430.54 s [extra] 100% ( 38 / 38) in 'Control.Monad.Extra'
  16140. 430.54 s [extra] 92% ( 12 / 13) in 'Data.Foldable.Extra'
  16141. 430.54 s [extra] Missing documentation for:
  16142. 430.54 s [extra] Module header
  16143. 430.54 s [extra] Warning: 'Lock' is ambiguous. It is defined
  16144. 430.54 s [extra] * at src/Control/Concurrent/Extra.hs:106:16
  16145. 430.54 s [extra] * at src/Control/Concurrent/Extra.hs:106:1
  16146. 430.54 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16147. 430.54 s [extra] by specifying the type/value namespace explicitly.
  16148. 430.54 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
  16149. 430.54 s [extra] Warning: 'Var' is ambiguous. It is defined
  16150. 430.54 s [extra] * at src/Control/Concurrent/Extra.hs:146:17
  16151. 430.54 s [extra] * at src/Control/Concurrent/Extra.hs:146:1
  16152. 430.54 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16153. 430.54 s [extra] by specifying the type/value namespace explicitly.
  16154. 430.54 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
  16155. 430.54 s [extra] Warning: 'Barrier' is ambiguous. It is defined
  16156. 430.54 s [extra] * at src/Control/Concurrent/Extra.hs:210:21
  16157. 430.54 s [extra] * at src/Control/Concurrent/Extra.hs:210:1
  16158. 430.54 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16159. 430.54 s [extra] by specifying the type/value namespace explicitly.
  16160. 430.54 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
  16161. 430.54 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  16162. 430.54 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  16163. 430.54 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  16164. 430.54 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  16165. 430.55 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  16166. 430.55 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  16167. 430.55 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  16168. 430.55 s [extra] 100% (268 /268) in 'Extra'
  16169. 430.55 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  16170. 430.84 s [extra] Warning: Data.Tuple.Extra: could not find link destinations for:
  16171. 430.84 s [extra] - GHC.Generics.Rep1_Solo
  16172. 430.85 s [extra] - GHC.Generics.Rep_Solo
  16173. 433.33 s [extra] Documentation created: dist/doc/html/extra/, dist/doc/html/extra/extra.txt
  16174. 433.38 s [extra] Preprocessing test suite 'extra-test' for extra-1.7.16..
  16175. 433.47 s [extra] Phase: installPhase
  16176. 433.47 s [extra] Installing library in /nix/store/s002wlz0dbqjp1bwqy6p6kz3amyc2ijq-extra-1.7.16/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/extra-1.7.16-BqnQjM86H1P931E5AxHLv4
  16177. 433.77 s [extra] Phase: fixupPhase
  16178. 433.78 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/s002wlz0dbqjp1bwqy6p6kz3amyc2ijq-extra-1.7.16
  16179. 433.79 s [extra] shrinking /nix/store/s002wlz0dbqjp1bwqy6p6kz3amyc2ijq-extra-1.7.16/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSextra-1.7.16-BqnQjM86H1P931E5AxHLv4-ghc9.8.4.so
  16180. 433.80 s [extra] checking for references to /build/ in /nix/store/s002wlz0dbqjp1bwqy6p6kz3amyc2ijq-extra-1.7.16...
  16181. 433.82 s [extra] patching script interpreter paths in /nix/store/s002wlz0dbqjp1bwqy6p6kz3amyc2ijq-extra-1.7.16
  16182. 433.83 s [extra] stripping (with command strip and flags -S -p) in /nix/store/s002wlz0dbqjp1bwqy6p6kz3amyc2ijq-extra-1.7.16/lib
  16183. 433.91 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/yzqzvaaway4m89ar7jhkrsws70cra3m8-extra-1.7.16-doc
  16184. 433.93 s [extra] checking for references to /build/ in /nix/store/yzqzvaaway4m89ar7jhkrsws70cra3m8-extra-1.7.16-doc...
  16185. 433.95 s [extra] patching script interpreter paths in /nix/store/yzqzvaaway4m89ar7jhkrsws70cra3m8-extra-1.7.16-doc
  16186. 434.05 s [extra:post-build] Uploading to cachix cache "sellout": /nix/store/s002wlz0dbqjp1bwqy6p6kz3amyc2ijq-extra-1.7.16 /nix/store/yzqzvaaway4m89ar7jhkrsws70cra3m8-extra-1.7.16-doc
  16187. 434.53 s [extra:post-build] Pushing 2 paths (68 are already present) using zstd to cache sellout ⏳
  16188. 434.53 s [extra:post-build]
  16189. 434.91 s [extra:post-build] Pushing /nix/store/s002wlz0dbqjp1bwqy6p6kz3amyc2ijq-extra-1.7.16 (4.07 MiB)
  16190. 434.98 s [extra:post-build] Pushing /nix/store/yzqzvaaway4m89ar7jhkrsws70cra3m8-extra-1.7.16-doc (3.06 MiB)
  16191. 436.23 s [extra:post-build]
  16192. 436.23 s [extra:post-build] All done.
  16193. 436.26 s [extra:post-build] Uploading to the NixCI cache: /nix/store/s002wlz0dbqjp1bwqy6p6kz3amyc2ijq-extra-1.7.16 /nix/store/yzqzvaaway4m89ar7jhkrsws70cra3m8-extra-1.7.16-doc
  16194. 436.31 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16195. 436.51 s [extra:post-build] copying 2 paths...
  16196. 436.51 s [extra:post-build] copying path '/nix/store/yzqzvaaway4m89ar7jhkrsws70cra3m8-extra-1.7.16-doc' to 'https://cache.nix-ci.com'...
  16197. 436.93 s [extra:post-build] copying path '/nix/store/s002wlz0dbqjp1bwqy6p6kz3amyc2ijq-extra-1.7.16' to 'https://cache.nix-ci.com'...
  16198. 438.31 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16199. 438.58 s [extra:post-build] copying 1 paths...
  16200. 438.62 s [extra:post-build] copying path '/nix/store/qfhgmdi2i43iplmiykpyv86bf0f0mhm1-extra-1.7.16.drv' to 'https://cache.nix-ci.com'...
  16201. 438.82 s Progress: 10 of 16 built, 193 of 193 downloaded from cache
  16202. 438.86 s Building /nix/store/wqpx38kbx5iiqx231j2pckqq8f2dk5g2-algebraic-graphs-0.7.drv
  16203. 438.95 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  16204. 438.95 s [algebraic-graphs] Build with /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4.
  16205. 439.09 s [algebraic-graphs] Phase: unpackPhase
  16206. 439.09 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  16207. 439.10 s [algebraic-graphs] source root is algebraic-graphs-0.7
  16208. 439.11 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  16209. 439.11 s [algebraic-graphs] Phase: patchPhase
  16210. 439.12 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  16211. 439.12 s [algebraic-graphs] Phase: compileBuildDriverPhase
  16212. 439.13 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.HMGV25pgMG/setup-package.conf.d -threaded
  16213. 439.17 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.HMGV25pgMG/Main.o )
  16214. 439.23 s [algebraic-graphs] [2 of 2] Linking Setup
  16215. 440.67 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  16216. 440.68 s [algebraic-graphs] Phase: configurePhase
  16217. 440.68 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/iriz387bz508qr8ais34p7a45cq8n51m-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.HMGV25pgMG/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/lib
  16218. 440.69 s [algebraic-graphs] Using Parsec parser
  16219. 440.69 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  16220. 440.96 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  16221. 440.96 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.19.2.0
  16222. 440.96 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
  16223. 440.96 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
  16224. 440.96 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
  16225. 440.96 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.14.3
  16226. 440.96 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  16227. 440.96 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  16228. 440.96 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.19.2.0
  16229. 440.96 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.6.8
  16230. 440.96 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
  16231. 440.96 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.7.16
  16232. 440.96 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.6: using
  16233. 440.96 s [algebraic-graphs] inspection-testing-0.5.0.3
  16234. 440.96 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.0
  16235. 441.20 s [algebraic-graphs] Source component graph:
  16236. 441.20 s [algebraic-graphs] component lib
  16237. 441.20 s [algebraic-graphs] component test:main dependency lib
  16238. 441.20 s [algebraic-graphs] Configured component graph:
  16239. 441.20 s [algebraic-graphs] component algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9
  16240. 441.20 s [algebraic-graphs] include array-0.5.8.0-bbbc
  16241. 441.20 s [algebraic-graphs] include base-4.19.2.0-0fde
  16242. 441.20 s [algebraic-graphs] include containers-0.6.8-ddec
  16243. 441.20 s [algebraic-graphs] include deepseq-1.5.1.0-7f97
  16244. 441.20 s [algebraic-graphs] include transformers-0.6.1.0-f128
  16245. 441.20 s [algebraic-graphs] component algebraic-graphs-0.7-LdF1ygzSSqTIZsmVPabUdq-main
  16246. 441.20 s [algebraic-graphs] include QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  16247. 441.20 s [algebraic-graphs] include algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9
  16248. 441.20 s [algebraic-graphs] include array-0.5.8.0-bbbc
  16249. 441.20 s [algebraic-graphs] include base-4.19.2.0-0fde
  16250. 441.20 s [algebraic-graphs] include containers-0.6.8-ddec
  16251. 441.20 s [algebraic-graphs] include deepseq-1.5.1.0-7f97
  16252. 441.20 s [algebraic-graphs] include extra-1.7.16-BqnQjM86H1P931E5AxHLv4
  16253. 441.20 s [algebraic-graphs] include inspection-testing-0.5.0.3-DkcJC7MwZ1jEYWvue2hl9W
  16254. 441.20 s [algebraic-graphs] include transformers-0.6.1.0-f128
  16255. 441.20 s [algebraic-graphs] Linked component graph:
  16256. 441.20 s [algebraic-graphs] unit algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9
  16257. 441.20 s [algebraic-graphs] include array-0.5.8.0-bbbc
  16258. 441.20 s [algebraic-graphs] include base-4.19.2.0-0fde
  16259. 441.20 s [algebraic-graphs] include containers-0.6.8-ddec
  16260. 441.20 s [algebraic-graphs] include deepseq-1.5.1.0-7f97
  16261. 441.20 s [algebraic-graphs] include transformers-0.6.1.0-f128
  16262. 441.20 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9:Data.Graph.Typed
  16263. 441.21 s [algebraic-graphs] unit algebraic-graphs-0.7-LdF1ygzSSqTIZsmVPabUdq-main
  16264. 441.21 s [algebraic-graphs] include QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  16265. 441.21 s [algebraic-graphs] include algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9
  16266. 441.21 s [algebraic-graphs] include array-0.5.8.0-bbbc
  16267. 441.21 s [algebraic-graphs] include base-4.19.2.0-0fde
  16268. 441.21 s [algebraic-graphs] include containers-0.6.8-ddec
  16269. 441.21 s [algebraic-graphs] include deepseq-1.5.1.0-7f97
  16270. 441.21 s [algebraic-graphs] include extra-1.7.16-BqnQjM86H1P931E5AxHLv4
  16271. 441.21 s [algebraic-graphs] include inspection-testing-0.5.0.3-DkcJC7MwZ1jEYWvue2hl9W
  16272. 441.21 s [algebraic-graphs] include transformers-0.6.1.0-f128
  16273. 441.21 s [algebraic-graphs] Ready component graph:
  16274. 441.21 s [algebraic-graphs] definite algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9
  16275. 441.21 s [algebraic-graphs] depends array-0.5.8.0-bbbc
  16276. 441.21 s [algebraic-graphs] depends base-4.19.2.0-0fde
  16277. 441.21 s [algebraic-graphs] depends containers-0.6.8-ddec
  16278. 441.21 s [algebraic-graphs] depends deepseq-1.5.1.0-7f97
  16279. 441.21 s [algebraic-graphs] depends transformers-0.6.1.0-f128
  16280. 441.21 s [algebraic-graphs] definite algebraic-graphs-0.7-LdF1ygzSSqTIZsmVPabUdq-main
  16281. 441.21 s [algebraic-graphs] depends QuickCheck-2.14.3-CB2zPnuzorVIXAcUfBvwyi
  16282. 441.21 s [algebraic-graphs] depends algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9
  16283. 441.21 s [algebraic-graphs] depends array-0.5.8.0-bbbc
  16284. 441.21 s [algebraic-graphs] depends base-4.19.2.0-0fde
  16285. 441.21 s [algebraic-graphs] depends containers-0.6.8-ddec
  16286. 441.21 s [algebraic-graphs] depends deepseq-1.5.1.0-7f97
  16287. 441.21 s [algebraic-graphs] depends extra-1.7.16-BqnQjM86H1P931E5AxHLv4
  16288. 441.21 s [algebraic-graphs] depends inspection-testing-0.5.0.3-DkcJC7MwZ1jEYWvue2hl9W
  16289. 441.21 s [algebraic-graphs] depends transformers-0.6.1.0-f128
  16290. 441.21 s [algebraic-graphs] Using Cabal-3.10.3.0 compiled by ghc-9.8
  16291. 441.21 s [algebraic-graphs] Using compiler: ghc-9.8.4
  16292. 441.21 s [algebraic-graphs] Using install prefix:
  16293. 441.21 s [algebraic-graphs] /nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7
  16294. 441.21 s [algebraic-graphs] Executables installed in:
  16295. 441.21 s [algebraic-graphs] /nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7/bin
  16296. 441.21 s [algebraic-graphs] Libraries installed in:
  16297. 441.21 s [algebraic-graphs] /nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9
  16298. 441.21 s [algebraic-graphs] Dynamic Libraries installed in:
  16299. 441.21 s [algebraic-graphs] /nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4
  16300. 441.21 s [algebraic-graphs] Private executables installed in:
  16301. 441.21 s [algebraic-graphs] /nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7
  16302. 441.21 s [algebraic-graphs] Data files installed in:
  16303. 441.21 s [algebraic-graphs] /nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7
  16304. 441.21 s [algebraic-graphs] Documentation installed in:
  16305. 441.21 s [algebraic-graphs] /nix/store/iriz387bz508qr8ais34p7a45cq8n51m-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  16306. 441.21 s [algebraic-graphs] Configuration files installed in:
  16307. 441.21 s [algebraic-graphs] /nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7/etc
  16308. 441.21 s [algebraic-graphs] No alex found
  16309. 441.21 s [algebraic-graphs] Using ar found on system at:
  16310. 441.21 s [algebraic-graphs] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  16311. 441.21 s [algebraic-graphs] No c2hs found
  16312. 441.21 s [algebraic-graphs] No cpphs found
  16313. 441.21 s [algebraic-graphs] No doctest found
  16314. 441.21 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  16315. 441.21 s [algebraic-graphs] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  16316. 441.21 s [algebraic-graphs] Using ghc version 9.8.4 found on system at:
  16317. 441.21 s [algebraic-graphs] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc
  16318. 441.21 s [algebraic-graphs] Using ghc-pkg version 9.8.4 found on system at:
  16319. 441.21 s [algebraic-graphs] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc-pkg-9.8.4
  16320. 441.21 s [algebraic-graphs] No ghcjs found
  16321. 441.21 s [algebraic-graphs] No ghcjs-pkg found
  16322. 441.21 s [algebraic-graphs] No greencard found
  16323. 441.21 s [algebraic-graphs] Using haddock version 2.30.0 found on system at:
  16324. 441.21 s [algebraic-graphs] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/haddock-ghc-9.8.4
  16325. 441.21 s [algebraic-graphs] No happy found
  16326. 441.21 s [algebraic-graphs] Using haskell-suite found on system at: haskell-suite-dummy-location
  16327. 441.21 s [algebraic-graphs] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  16328. 441.21 s [algebraic-graphs] No hmake found
  16329. 441.21 s [algebraic-graphs] Using hpc version 0.69 found on system at:
  16330. 441.21 s [algebraic-graphs] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hpc-ghc-9.8.4
  16331. 441.21 s [algebraic-graphs] Using hsc2hs version 0.68.10 found on system at:
  16332. 441.21 s [algebraic-graphs] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  16333. 441.21 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  16334. 441.21 s [algebraic-graphs] /nix/store/r9acd8dqp6xxbhlplifjikwk7bc6w7vf-hscolour-1.25/bin/HsColour
  16335. 441.21 s [algebraic-graphs] No jhc found
  16336. 441.21 s [algebraic-graphs] Using ld found on system at:
  16337. 441.21 s [algebraic-graphs] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  16338. 441.21 s [algebraic-graphs] No pkg-config found
  16339. 441.21 s [algebraic-graphs] Using runghc version 9.8.4 found on system at:
  16340. 441.21 s [algebraic-graphs] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/runghc-9.8.4
  16341. 441.21 s [algebraic-graphs] Using strip version 2.44 found on system at:
  16342. 441.21 s [algebraic-graphs] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  16343. 441.21 s [algebraic-graphs] Using tar found on system at:
  16344. 441.21 s [algebraic-graphs] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  16345. 441.21 s [algebraic-graphs] No uhc found
  16346. 441.35 s [algebraic-graphs] Phase: buildPhase
  16347. 441.41 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  16348. 441.41 s [algebraic-graphs] Building library for algebraic-graphs-0.7..
  16349. 441.55 s [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 )
  16350. 442.58 s [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 )
  16351. 443.20 s [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 )
  16352. 443.65 s [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 )
  16353. 443.74 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  16354. 444.62 s [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 )
  16355. 444.86 s [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 )
  16356. 445.33 s [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 )
  16357. 445.97 s [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 )
  16358. 445.97 s [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 )
  16359. 445.97 s [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 )
  16360. 445.97 s [algebraic-graphs]
  16361. 445.97 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  16362. 445.97 s [algebraic-graphs] In the use of ‘head’
  16363. 445.98 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  16364. 445.98 s [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."
  16365. 445.98 s [algebraic-graphs] |
  16366. 445.98 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  16367. 445.98 s [algebraic-graphs] | ^^^^
  16368. 445.98 s [algebraic-graphs]
  16369. 445.98 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  16370. 445.98 s [algebraic-graphs] In the use of ‘tail’
  16371. 445.98 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  16372. 445.98 s [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."
  16373. 445.98 s [algebraic-graphs] |
  16374. 445.98 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  16375. 445.98 s [algebraic-graphs] | ^^^^
  16376. 445.98 s [algebraic-graphs]
  16377. 445.98 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  16378. 445.98 s [algebraic-graphs] In the use of ‘head’
  16379. 445.98 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  16380. 445.98 s [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."
  16381. 445.98 s [algebraic-graphs] |
  16382. 445.98 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  16383. 445.98 s [algebraic-graphs] | ^^^^
  16384. 445.98 s [algebraic-graphs]
  16385. 445.98 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  16386. 445.98 s [algebraic-graphs] In the use of ‘tail’
  16387. 445.98 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  16388. 445.98 s [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."
  16389. 445.98 s [algebraic-graphs] |
  16390. 445.98 s [algebraic-graphs] 397 | bnd' = tail bnd
  16391. 445.98 s [algebraic-graphs] | ^^^^
  16392. 445.98 s [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 )
  16393. 445.98 s [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 )
  16394. 445.98 s [algebraic-graphs]
  16395. 445.98 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16396. 445.98 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16397. 445.98 s [algebraic-graphs] will become an error in a future GHC release.
  16398. 445.98 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16399. 445.98 s [algebraic-graphs] |
  16400. 445.98 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  16401. 445.98 s [algebraic-graphs] | ^
  16402. 445.98 s [algebraic-graphs]
  16403. 445.98 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16404. 445.98 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16405. 445.98 s [algebraic-graphs] will become an error in a future GHC release.
  16406. 445.98 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16407. 445.98 s [algebraic-graphs] |
  16408. 445.98 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16409. 445.98 s [algebraic-graphs] | ^
  16410. 445.98 s [algebraic-graphs]
  16411. 445.98 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16412. 445.98 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16413. 445.98 s [algebraic-graphs] will become an error in a future GHC release.
  16414. 445.98 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16415. 445.98 s [algebraic-graphs] |
  16416. 445.98 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16417. 445.98 s [algebraic-graphs] | ^
  16418. 445.98 s [algebraic-graphs]
  16419. 445.98 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16420. 445.98 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16421. 445.98 s [algebraic-graphs] will become an error in a future GHC release.
  16422. 445.98 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16423. 445.98 s [algebraic-graphs] |
  16424. 445.98 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16425. 445.98 s [algebraic-graphs] | ^
  16426. 445.98 s [algebraic-graphs]
  16427. 445.98 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16428. 445.98 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16429. 445.98 s [algebraic-graphs] will become an error in a future GHC release.
  16430. 445.98 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16431. 445.98 s [algebraic-graphs] |
  16432. 445.98 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16433. 445.98 s [algebraic-graphs] | ^
  16434. 445.98 s [algebraic-graphs]
  16435. 445.98 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16436. 445.98 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16437. 445.98 s [algebraic-graphs] will become an error in a future GHC release.
  16438. 445.98 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16439. 445.98 s [algebraic-graphs] |
  16440. 445.98 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16441. 445.98 s [algebraic-graphs] | ^
  16442. 445.98 s [algebraic-graphs]
  16443. 445.98 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16444. 445.98 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16445. 445.98 s [algebraic-graphs] will become an error in a future GHC release.
  16446. 445.98 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16447. 445.98 s [algebraic-graphs] |
  16448. 445.98 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16449. 445.98 s [algebraic-graphs] | ^
  16450. 445.98 s [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 )
  16451. 446.18 s [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 )
  16452. 446.47 s [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 )
  16453. 446.50 s [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 )
  16454. 446.50 s [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 )
  16455. 447.04 s [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 )
  16456. 447.21 s [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 )
  16457. 447.38 s [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 )
  16458. 447.38 s [algebraic-graphs]
  16459. 447.38 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16460. 447.38 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16461. 447.38 s [algebraic-graphs] will become an error in a future GHC release.
  16462. 447.38 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16463. 447.38 s [algebraic-graphs] |
  16464. 447.38 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  16465. 447.38 s [algebraic-graphs] | ^
  16466. 447.38 s [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 )
  16467. 447.38 s [algebraic-graphs]
  16468. 447.38 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16469. 447.38 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16470. 447.38 s [algebraic-graphs] will become an error in a future GHC release.
  16471. 447.38 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16472. 447.38 s [algebraic-graphs] |
  16473. 447.38 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  16474. 447.38 s [algebraic-graphs] | ^
  16475. 447.38 s [algebraic-graphs]
  16476. 447.38 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16477. 447.38 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16478. 447.38 s [algebraic-graphs] will become an error in a future GHC release.
  16479. 447.38 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16480. 447.38 s [algebraic-graphs] |
  16481. 447.38 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  16482. 447.38 s [algebraic-graphs] | ^
  16483. 447.38 s [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 )
  16484. 447.38 s [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 )
  16485. 447.38 s [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 )
  16486. 447.41 s [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 )
  16487. 447.41 s [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 )
  16488. 447.41 s [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 )
  16489. 447.45 s [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 )
  16490. 447.72 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  16491. 448.64 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  16492. 449.20 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyIntMap/Algorithm.p_o )
  16493. 449.58 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  16494. 449.58 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  16495. 450.65 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, dist/build/Algebra/Graph/HigherKinded/Class.p_o )
  16496. 450.96 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, dist/build/Algebra/Graph/Bipartite/AdjacencyMap.p_o )
  16497. 451.65 s [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 )
  16498. 452.37 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  16499. 452.37 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, dist/build/Algebra/Graph/NonEmpty/AdjacencyMap.p_o )
  16500. 452.37 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, dist/build/Algebra/Graph/AdjacencyMap/Algorithm.p_o )
  16501. 452.37 s [algebraic-graphs]
  16502. 452.37 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  16503. 452.37 s [algebraic-graphs] In the use of ‘head’
  16504. 452.37 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  16505. 452.37 s [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."
  16506. 452.37 s [algebraic-graphs] |
  16507. 452.37 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  16508. 452.37 s [algebraic-graphs] | ^^^^
  16509. 452.37 s [algebraic-graphs]
  16510. 452.37 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  16511. 452.37 s [algebraic-graphs] In the use of ‘tail’
  16512. 452.37 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  16513. 452.37 s [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."
  16514. 452.37 s [algebraic-graphs] |
  16515. 452.37 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  16516. 452.37 s [algebraic-graphs] | ^^^^
  16517. 452.37 s [algebraic-graphs]
  16518. 452.37 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  16519. 452.37 s [algebraic-graphs] In the use of ‘head’
  16520. 452.37 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  16521. 452.37 s [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."
  16522. 452.37 s [algebraic-graphs] |
  16523. 452.37 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  16524. 452.37 s [algebraic-graphs] | ^^^^
  16525. 452.37 s [algebraic-graphs]
  16526. 452.37 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  16527. 452.37 s [algebraic-graphs] In the use of ‘tail’
  16528. 452.37 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  16529. 452.37 s [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."
  16530. 452.37 s [algebraic-graphs] |
  16531. 452.37 s [algebraic-graphs] 397 | bnd' = tail bnd
  16532. 452.37 s [algebraic-graphs] | ^^^^
  16533. 452.37 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, dist/build/Algebra/Graph/Acyclic/AdjacencyMap.p_o )
  16534. 452.37 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  16535. 452.37 s [algebraic-graphs]
  16536. 452.37 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16537. 452.37 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16538. 452.37 s [algebraic-graphs] will become an error in a future GHC release.
  16539. 452.37 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16540. 452.37 s [algebraic-graphs] |
  16541. 452.37 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  16542. 452.37 s [algebraic-graphs] | ^
  16543. 452.37 s [algebraic-graphs]
  16544. 452.37 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16545. 452.37 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16546. 452.37 s [algebraic-graphs] will become an error in a future GHC release.
  16547. 452.37 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16548. 452.37 s [algebraic-graphs] |
  16549. 452.37 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16550. 452.37 s [algebraic-graphs] | ^
  16551. 452.37 s [algebraic-graphs]
  16552. 452.37 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16553. 452.38 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16554. 452.38 s [algebraic-graphs] will become an error in a future GHC release.
  16555. 452.38 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16556. 452.38 s [algebraic-graphs] |
  16557. 452.38 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16558. 452.38 s [algebraic-graphs] | ^
  16559. 452.38 s [algebraic-graphs]
  16560. 452.38 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16561. 452.38 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16562. 452.38 s [algebraic-graphs] will become an error in a future GHC release.
  16563. 452.38 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16564. 452.38 s [algebraic-graphs] |
  16565. 452.38 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16566. 452.38 s [algebraic-graphs] | ^
  16567. 452.38 s [algebraic-graphs]
  16568. 452.38 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16569. 452.38 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16570. 452.38 s [algebraic-graphs] will become an error in a future GHC release.
  16571. 452.38 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16572. 452.38 s [algebraic-graphs] |
  16573. 452.38 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16574. 452.38 s [algebraic-graphs] | ^
  16575. 452.38 s [algebraic-graphs]
  16576. 452.38 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16577. 452.38 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16578. 452.38 s [algebraic-graphs] will become an error in a future GHC release.
  16579. 452.38 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16580. 452.38 s [algebraic-graphs] |
  16581. 452.38 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16582. 452.38 s [algebraic-graphs] | ^
  16583. 452.38 s [algebraic-graphs]
  16584. 452.38 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16585. 452.38 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16586. 452.38 s [algebraic-graphs] will become an error in a future GHC release.
  16587. 452.38 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16588. 452.38 s [algebraic-graphs] |
  16589. 452.38 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16590. 452.38 s [algebraic-graphs] | ^
  16591. 452.38 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  16592. 452.87 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, dist/build/Algebra/Graph/Relation/Symmetric.p_o )
  16593. 453.25 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  16594. 453.26 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, dist/build/Algebra/Graph/Labelled/AdjacencyMap.p_o )
  16595. 453.26 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  16596. 453.51 s [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 )
  16597. 453.74 s [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 )
  16598. 453.86 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  16599. 453.86 s [algebraic-graphs]
  16600. 453.86 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16601. 453.86 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16602. 453.86 s [algebraic-graphs] will become an error in a future GHC release.
  16603. 453.86 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16604. 453.86 s [algebraic-graphs] |
  16605. 453.86 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  16606. 453.86 s [algebraic-graphs] | ^
  16607. 453.86 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, dist/build/Algebra/Graph/Export/Dot.p_o )
  16608. 453.86 s [algebraic-graphs]
  16609. 453.86 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16610. 453.86 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16611. 453.86 s [algebraic-graphs] will become an error in a future GHC release.
  16612. 453.86 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16613. 453.86 s [algebraic-graphs] |
  16614. 453.86 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  16615. 453.86 s [algebraic-graphs] | ^
  16616. 453.86 s [algebraic-graphs]
  16617. 453.86 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16618. 453.86 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16619. 453.86 s [algebraic-graphs] will become an error in a future GHC release.
  16620. 453.86 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  16621. 453.86 s [algebraic-graphs] |
  16622. 453.86 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  16623. 453.86 s [algebraic-graphs] | ^
  16624. 453.86 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  16625. 453.86 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  16626. 453.98 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, dist/build/Algebra/Graph/Relation/Transitive.p_o )
  16627. 454.14 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, dist/build/Algebra/Graph/Relation/Reflexive.p_o )
  16628. 454.14 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, dist/build/Algebra/Graph/Relation/Preorder.p_o )
  16629. 454.14 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, dist/build/Algebra/Graph/Example/Todo.p_o )
  16630. 454.17 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  16631. 455.08 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  16632. 455.15 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7..
  16633. 455.19 s [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 )
  16634. 456.22 s [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 )
  16635. 459.30 s [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 )
  16636. 459.30 s [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 )
  16637. 459.30 s [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 )
  16638. 463.44 s [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 )
  16639. 463.50 s [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 )
  16640. 463.50 s [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 )
  16641. 468.08 s [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 )
  16642. 468.60 s [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 )
  16643. 468.65 s [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 )
  16644. 469.31 s [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 )
  16645. 469.31 s [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 )
  16646. 469.31 s [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 )
  16647. 470.45 s [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 )
  16648. 470.45 s [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 )
  16649. 470.45 s [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 )
  16650. 470.45 s [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 )
  16651. 470.45 s [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 )
  16652. 470.45 s [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 )
  16653. 470.45 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  16654. 470.45 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  16655. 470.45 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  16656. 470.45 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  16657. 470.45 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
  16658. 470.45 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  16659. 470.45 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
  16660. 470.45 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  16661. 470.45 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
  16662. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  16663. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  16664. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
  16665. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  16666. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
  16667. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  16668. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
  16669. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  16670. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  16671. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  16672. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  16673. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  16674. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  16675. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  16676. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16677. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  16678. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16679. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  16680. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  16681. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  16682. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  16683. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  16684. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  16685. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  16686. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  16687. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
  16688. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  16689. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  16690. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16691. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  16692. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
  16693. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16694. 470.46 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  16695. 470.47 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  16696. 470.47 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  16697. 470.47 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  16698. 470.47 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  16699. 470.47 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
  16700. 470.47 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  16701. 470.47 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  16702. 470.47 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  16703. 470.47 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
  16704. 470.47 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  16705. 470.47 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  16706. 470.47 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  16707. 470.47 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  16708. 470.47 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  16709. 470.47 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  16710. 470.47 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  16711. 470.47 s [algebraic-graphs] inspection testing successful
  16712. 470.47 s [algebraic-graphs] expected successes: 58
  16713. 470.47 s [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 )
  16714. 470.47 s [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 )
  16715. 470.47 s [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 )
  16716. 471.19 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  16717. 472.12 s [algebraic-graphs] buildPhase completed in 30 seconds
  16718. 472.12 s [algebraic-graphs] Phase: checkPhase
  16719. 472.14 s [algebraic-graphs] Running 1 test suites...
  16720. 472.14 s [algebraic-graphs] Test suite main: RUNNING...
  16721. 480.48 s [algebraic-graphs]
  16722. 480.48 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  16723. 480.52 s [algebraic-graphs] OK: show empty == "empty"
  16724. 480.52 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  16725. 480.52 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  16726. 480.52 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  16727. 480.52 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  16728. 480.52 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  16729. 480.52 s [algebraic-graphs]
  16730. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  16731. 480.52 s [algebraic-graphs] OK: fromAcyclic empty == empty
  16732. 480.52 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  16733. 480.52 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  16734. 480.52 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  16735. 480.52 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  16736. 480.52 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  16737. 480.52 s [algebraic-graphs]
  16738. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  16739. 480.52 s [algebraic-graphs] OK: isEmpty empty == True
  16740. 480.52 s [algebraic-graphs] OK: hasVertex x empty == False
  16741. 480.52 s [algebraic-graphs] OK: vertexCount empty == 0
  16742. 480.52 s [algebraic-graphs] OK: edgeCount empty == 0
  16743. 480.52 s [algebraic-graphs]
  16744. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  16745. 480.52 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  16746. 480.52 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  16747. 480.52 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  16748. 480.52 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  16749. 480.52 s [algebraic-graphs]
  16750. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  16751. 480.52 s [algebraic-graphs] OK: vertices [] == empty
  16752. 480.52 s [algebraic-graphs] OK: vertices [x] == vertex x
  16753. 480.52 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  16754. 480.52 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  16755. 480.52 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  16756. 480.52 s [algebraic-graphs]
  16757. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  16758. 480.52 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  16759. 480.52 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  16760. 480.52 s [algebraic-graphs]
  16761. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  16762. 480.52 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  16763. 480.52 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  16764. 480.52 s [algebraic-graphs]
  16765. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  16766. 480.52 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  16767. 480.52 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  16768. 480.52 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  16769. 480.52 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  16770. 480.52 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  16771. 480.52 s [algebraic-graphs]
  16772. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  16773. 480.52 s [algebraic-graphs] OK: isEmpty empty == True
  16774. 480.52 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  16775. 480.52 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  16776. 480.52 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  16777. 480.52 s [algebraic-graphs]
  16778. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  16779. 480.52 s [algebraic-graphs] OK: hasVertex x empty == False
  16780. 480.52 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  16781. 480.52 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  16782. 480.52 s [algebraic-graphs]
  16783. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  16784. 480.52 s [algebraic-graphs] OK: hasEdge x y empty == False
  16785. 480.52 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  16786. 480.52 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  16787. 480.52 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  16788. 480.52 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  16789. 480.52 s [algebraic-graphs]
  16790. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  16791. 480.52 s [algebraic-graphs] OK: vertexCount empty == 0
  16792. 480.52 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  16793. 480.52 s [algebraic-graphs] OK: vertexCount == length . vertexList
  16794. 480.52 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  16795. 480.52 s [algebraic-graphs]
  16796. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  16797. 480.52 s [algebraic-graphs] OK: edgeCount empty == 0
  16798. 480.52 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  16799. 480.52 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  16800. 480.52 s [algebraic-graphs] OK: edgeCount == length . edgeList
  16801. 480.52 s [algebraic-graphs]
  16802. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  16803. 480.52 s [algebraic-graphs] OK: vertexList empty == []
  16804. 480.52 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  16805. 480.52 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  16806. 480.52 s [algebraic-graphs]
  16807. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  16808. 480.52 s [algebraic-graphs] OK: edgeList empty == []
  16809. 480.52 s [algebraic-graphs] OK: edgeList (vertex x) == []
  16810. 480.52 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  16811. 480.52 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  16812. 480.52 s [algebraic-graphs]
  16813. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  16814. 480.52 s [algebraic-graphs] OK: adjacencyList empty == []
  16815. 480.52 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  16816. 480.52 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  16817. 480.52 s [algebraic-graphs]
  16818. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  16819. 480.52 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  16820. 480.52 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  16821. 480.52 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  16822. 480.52 s [algebraic-graphs]
  16823. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  16824. 480.52 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  16825. 480.52 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  16826. 480.52 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  16827. 480.52 s [algebraic-graphs]
  16828. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  16829. 480.52 s [algebraic-graphs] OK: preSet x empty == Set.empty
  16830. 480.52 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  16831. 480.52 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  16832. 480.52 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  16833. 480.52 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  16834. 480.52 s [algebraic-graphs]
  16835. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  16836. 480.52 s [algebraic-graphs] OK: postSet x empty == Set.empty
  16837. 480.52 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  16838. 480.52 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  16839. 480.52 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  16840. 480.52 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  16841. 480.52 s [algebraic-graphs]
  16842. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  16843. 480.52 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  16844. 480.52 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  16845. 480.52 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  16846. 480.52 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  16847. 480.52 s [algebraic-graphs]
  16848. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  16849. 480.52 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  16850. 480.52 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  16851. 480.52 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  16852. 480.52 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  16853. 480.52 s [algebraic-graphs]
  16854. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  16855. 480.52 s [algebraic-graphs] OK: transpose empty == empty
  16856. 480.52 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  16857. 480.52 s [algebraic-graphs] OK: transpose . transpose == id
  16858. 480.52 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  16859. 480.52 s [algebraic-graphs]
  16860. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  16861. 480.52 s [algebraic-graphs] OK: induce (const True ) x == x
  16862. 480.52 s [algebraic-graphs] OK: induce (const False) x == empty
  16863. 480.52 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  16864. 480.52 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  16865. 480.52 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  16866. 480.52 s [algebraic-graphs]
  16867. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  16868. 480.52 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  16869. 480.52 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  16870. 480.52 s [algebraic-graphs]
  16871. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  16872. 480.52 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  16873. 480.52 s [algebraic-graphs]
  16874. 480.52 s [algebraic-graphs] OK: box x y ~~ box y x
  16875. 480.52 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  16876. 480.52 s [algebraic-graphs] OK: box x empty ~~ empty
  16877. 480.52 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  16878. 480.52 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  16879. 480.52 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  16880. 480.52 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  16881. 480.52 s [algebraic-graphs]
  16882. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  16883. 480.52 s [algebraic-graphs] OK: transitiveClosure empty == empty
  16884. 480.52 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  16885. 480.52 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  16886. 480.52 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  16887. 480.52 s [algebraic-graphs]
  16888. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  16889. 480.52 s [algebraic-graphs] OK: topSort empty == []
  16890. 480.52 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  16891. 480.52 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  16892. 480.52 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  16893. 480.52 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  16894. 480.52 s [algebraic-graphs]
  16895. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  16896. 480.52 s [algebraic-graphs] OK: scc empty == empty
  16897. 480.52 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  16898. 480.52 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  16899. 480.52 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  16900. 480.52 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  16901. 480.52 s [algebraic-graphs]
  16902. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  16903. 480.52 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  16904. 480.52 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  16905. 480.52 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  16906. 480.52 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  16907. 480.52 s [algebraic-graphs]
  16908. 480.52 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  16909. 480.52 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  16910. 480.52 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  16911. 480.52 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  16912. 480.52 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  16913. 480.52 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  16914. 480.52 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  16915. 483.94 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  16916. 483.95 s [algebraic-graphs]
  16917. 483.95 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  16918. 483.95 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  16919. 483.95 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  16920. 483.95 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  16921. 483.95 s [algebraic-graphs]
  16922. 483.95 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  16923. 483.95 s [algebraic-graphs] OK: Arbitrary
  16924. 483.95 s [algebraic-graphs] OK: empty
  16925. 483.95 s [algebraic-graphs] OK: vertex
  16926. 483.95 s [algebraic-graphs] OK: vertices
  16927. 483.95 s [algebraic-graphs] OK: union
  16928. 483.95 s [algebraic-graphs] OK: join
  16929. 483.95 s [algebraic-graphs] OK: transpose
  16930. 483.95 s [algebraic-graphs] OK: box
  16931. 483.95 s [algebraic-graphs] OK: transitiveClosure
  16932. 483.95 s [algebraic-graphs] OK: scc
  16933. 483.95 s [algebraic-graphs] OK: toAcyclic
  16934. 483.95 s [algebraic-graphs] OK: toAcyclicOrd
  16935. 483.95 s [algebraic-graphs]
  16936. 483.95 s [algebraic-graphs] ============ AdjacencyIntMap ============
  16937. 483.95 s [algebraic-graphs] OK: Axioms of graphs
  16938. 483.95 s [algebraic-graphs]
  16939. 483.95 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  16940. 483.95 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  16941. 483.95 s [algebraic-graphs]
  16942. 483.95 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  16943. 483.95 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  16944. 483.95 s [algebraic-graphs]
  16945. 483.95 s [algebraic-graphs] OK: consistent empty == True
  16946. 483.95 s [algebraic-graphs] OK: consistent (vertex x) == True
  16947. 483.95 s [algebraic-graphs] OK: consistent (overlay x y) == True
  16948. 483.95 s [algebraic-graphs] OK: consistent (connect x y) == True
  16949. 483.95 s [algebraic-graphs] OK: consistent (edge x y) == True
  16950. 483.95 s [algebraic-graphs] OK: consistent (edges xs) == True
  16951. 483.95 s [algebraic-graphs] OK: consistent (stars xs) == True
  16952. 483.95 s [algebraic-graphs]
  16953. 483.95 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  16954. 483.95 s [algebraic-graphs] OK: show (empty ) == "empty"
  16955. 483.95 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  16956. 483.95 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  16957. 483.95 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  16958. 483.95 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  16959. 483.95 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  16960. 483.95 s [algebraic-graphs]
  16961. 483.95 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  16962. 483.95 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  16963. 483.95 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  16964. 483.95 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  16965. 483.95 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  16966. 483.95 s [algebraic-graphs]
  16967. 483.95 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  16968. 483.95 s [algebraic-graphs] OK: vertex 1 < vertex 2
  16969. 483.95 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  16970. 483.95 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  16971. 483.95 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  16972. 483.95 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  16973. 483.95 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  16974. 483.95 s [algebraic-graphs] OK: x <= x + y
  16975. 483.95 s [algebraic-graphs] OK: x + y <= x * y
  16976. 483.95 s [algebraic-graphs]
  16977. 483.95 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  16978. 483.95 s [algebraic-graphs] OK: isEmpty empty == True
  16979. 483.95 s [algebraic-graphs] OK: hasVertex x empty == False
  16980. 483.95 s [algebraic-graphs] OK: vertexCount empty == 0
  16981. 483.95 s [algebraic-graphs] OK: edgeCount empty == 0
  16982. 483.95 s [algebraic-graphs]
  16983. 483.95 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  16984. 483.95 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  16985. 483.95 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  16986. 483.95 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  16987. 483.95 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  16988. 483.95 s [algebraic-graphs]
  16989. 483.95 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  16990. 483.95 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  16991. 483.95 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  16992. 483.95 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  16993. 483.95 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  16994. 483.95 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  16995. 483.95 s [algebraic-graphs]
  16996. 483.95 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  16997. 483.95 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  16998. 483.95 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  16999. 483.95 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  17000. 483.95 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  17001. 483.95 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  17002. 483.95 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  17003. 483.95 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  17004. 483.95 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  17005. 483.95 s [algebraic-graphs]
  17006. 483.95 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  17007. 483.95 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  17008. 483.95 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  17009. 483.95 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  17010. 483.95 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  17011. 483.95 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  17012. 483.95 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  17013. 483.95 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  17014. 483.95 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  17015. 483.95 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  17016. 483.95 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  17017. 483.95 s [algebraic-graphs]
  17018. 483.95 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  17019. 483.95 s [algebraic-graphs] OK: vertices [] == empty
  17020. 483.95 s [algebraic-graphs] OK: vertices [x] == vertex x
  17021. 483.95 s [algebraic-graphs] OK: vertices == overlays . map vertex
  17022. 483.95 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17023. 483.95 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17024. 483.95 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17025. 483.95 s [algebraic-graphs]
  17026. 483.95 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  17027. 483.95 s [algebraic-graphs] OK: edges [] == empty
  17028. 483.95 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  17029. 483.95 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  17030. 483.95 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  17031. 483.95 s [algebraic-graphs]
  17032. 483.95 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  17033. 483.95 s [algebraic-graphs] OK: overlays [] == empty
  17034. 483.95 s [algebraic-graphs] OK: overlays [x] == x
  17035. 483.95 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  17036. 483.95 s [algebraic-graphs] OK: overlays == foldr overlay empty
  17037. 483.95 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  17038. 483.95 s [algebraic-graphs]
  17039. 483.95 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  17040. 483.95 s [algebraic-graphs] OK: connects [] == empty
  17041. 483.95 s [algebraic-graphs] OK: connects [x] == x
  17042. 483.95 s [algebraic-graphs] OK: connects [x,y] == connect x y
  17043. 483.95 s [algebraic-graphs] OK: connects == foldr connect empty
  17044. 483.95 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  17045. 483.95 s [algebraic-graphs]
  17046. 483.95 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  17047. 483.95 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  17048. 483.95 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  17049. 483.95 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  17050. 483.95 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  17051. 483.95 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  17052. 483.95 s [algebraic-graphs]
  17053. 483.95 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  17054. 483.95 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17055. 483.95 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17056. 483.95 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  17057. 483.95 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  17058. 483.95 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  17059. 483.95 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17060. 483.95 s [algebraic-graphs]
  17061. 483.95 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  17062. 483.95 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  17063. 483.95 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  17064. 483.95 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  17065. 483.95 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  17066. 483.95 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  17067. 483.95 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  17068. 483.95 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  17069. 483.95 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  17070. 483.95 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  17071. 483.95 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  17072. 483.95 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  17073. 483.95 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  17074. 483.95 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  17075. 483.95 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  17076. 483.95 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  17077. 483.95 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  17078. 483.95 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  17079. 483.95 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  17080. 483.95 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  17081. 483.95 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  17082. 483.95 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  17083. 483.95 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  17084. 483.95 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  17085. 483.95 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  17086. 483.95 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  17087. 483.95 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  17088. 483.95 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  17089. 483.95 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  17090. 483.95 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17091. 483.95 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  17092. 483.95 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  17093. 483.95 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  17094. 483.96 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  17095. 483.96 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  17096. 484.79 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17097. 484.79 s [algebraic-graphs]
  17098. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  17099. 484.79 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  17100. 484.79 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  17101. 484.79 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  17102. 484.79 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  17103. 484.79 s [algebraic-graphs]
  17104. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  17105. 484.79 s [algebraic-graphs] OK: isEmpty empty == True
  17106. 484.79 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  17107. 484.79 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17108. 484.79 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17109. 484.79 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  17110. 484.79 s [algebraic-graphs]
  17111. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  17112. 484.79 s [algebraic-graphs] OK: hasVertex x empty == False
  17113. 484.79 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17114. 484.79 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17115. 484.79 s [algebraic-graphs]
  17116. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  17117. 484.79 s [algebraic-graphs] OK: hasEdge x y empty == False
  17118. 484.79 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17119. 484.79 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17120. 484.79 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17121. 484.79 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17122. 484.79 s [algebraic-graphs]
  17123. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  17124. 484.79 s [algebraic-graphs] OK: vertexCount empty == 0
  17125. 484.79 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17126. 484.79 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17127. 484.79 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17128. 484.79 s [algebraic-graphs]
  17129. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  17130. 484.79 s [algebraic-graphs] OK: edgeCount empty == 0
  17131. 484.79 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17132. 484.79 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17133. 484.79 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17134. 484.79 s [algebraic-graphs]
  17135. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  17136. 484.79 s [algebraic-graphs] OK: vertexList empty == []
  17137. 484.79 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17138. 484.79 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17139. 484.79 s [algebraic-graphs]
  17140. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  17141. 484.79 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17142. 484.79 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17143. 484.79 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17144. 484.79 s [algebraic-graphs]
  17145. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  17146. 484.79 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  17147. 484.79 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  17148. 484.79 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  17149. 484.79 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  17150. 484.79 s [algebraic-graphs]
  17151. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  17152. 484.79 s [algebraic-graphs] OK: edgeList empty == []
  17153. 484.79 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17154. 484.79 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  17155. 484.79 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  17156. 484.79 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  17157. 484.79 s [algebraic-graphs]
  17158. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  17159. 484.79 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17160. 484.79 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17161. 484.79 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  17162. 484.79 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  17163. 484.79 s [algebraic-graphs]
  17164. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  17165. 484.79 s [algebraic-graphs] OK: adjacencyList empty == []
  17166. 484.79 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  17167. 484.79 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  17168. 484.79 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  17169. 484.79 s [algebraic-graphs]
  17170. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  17171. 484.79 s [algebraic-graphs] OK: preSet x empty == Set.empty
  17172. 484.79 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  17173. 484.79 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  17174. 484.79 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  17175. 484.79 s [algebraic-graphs]
  17176. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  17177. 484.79 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  17178. 484.79 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  17179. 484.79 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  17180. 484.79 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  17181. 484.79 s [algebraic-graphs]
  17182. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  17183. 484.79 s [algebraic-graphs] OK: postSet x empty == Set.empty
  17184. 484.79 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  17185. 484.79 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  17186. 484.79 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  17187. 484.79 s [algebraic-graphs]
  17188. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  17189. 484.79 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  17190. 484.79 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  17191. 484.79 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  17192. 484.79 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  17193. 484.79 s [algebraic-graphs]
  17194. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  17195. 484.79 s [algebraic-graphs] OK: path [] == empty
  17196. 484.79 s [algebraic-graphs] OK: path [x] == vertex x
  17197. 484.79 s [algebraic-graphs] OK: path [x,y] == edge x y
  17198. 484.79 s [algebraic-graphs]
  17199. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  17200. 484.79 s [algebraic-graphs] OK: circuit [] == empty
  17201. 484.79 s [algebraic-graphs] OK: circuit [x] == edge x x
  17202. 484.79 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  17203. 484.79 s [algebraic-graphs]
  17204. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  17205. 484.79 s [algebraic-graphs] OK: clique [] == empty
  17206. 484.79 s [algebraic-graphs] OK: clique [x] == vertex x
  17207. 484.79 s [algebraic-graphs] OK: clique [x,y] == edge x y
  17208. 484.79 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  17209. 484.79 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  17210. 484.79 s [algebraic-graphs]
  17211. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  17212. 484.79 s [algebraic-graphs] OK: biclique [] [] == empty
  17213. 484.79 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  17214. 484.79 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  17215. 484.79 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  17216. 484.79 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  17217. 484.79 s [algebraic-graphs]
  17218. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  17219. 484.79 s [algebraic-graphs] OK: star x [] == vertex x
  17220. 484.79 s [algebraic-graphs] OK: star x [y] == edge x y
  17221. 484.79 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  17222. 484.79 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  17223. 484.79 s [algebraic-graphs]
  17224. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  17225. 484.79 s [algebraic-graphs] OK: stars [] == empty
  17226. 484.79 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  17227. 484.79 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  17228. 484.79 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  17229. 484.79 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  17230. 484.79 s [algebraic-graphs] OK: stars . adjacencyList == id
  17231. 484.79 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  17232. 484.79 s [algebraic-graphs]
  17233. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  17234. 484.79 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  17235. 484.79 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  17236. 484.79 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  17237. 484.79 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  17238. 484.79 s [algebraic-graphs]
  17239. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  17240. 484.79 s [algebraic-graphs] OK: forest [] == empty
  17241. 484.79 s [algebraic-graphs] OK: forest [x] == tree x
  17242. 484.79 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  17243. 484.79 s [algebraic-graphs] OK: forest == overlays . map tree
  17244. 484.79 s [algebraic-graphs]
  17245. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  17246. 484.79 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  17247. 484.79 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  17248. 484.79 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  17249. 484.79 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  17250. 484.79 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  17251. 484.79 s [algebraic-graphs]
  17252. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  17253. 484.79 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  17254. 484.79 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  17255. 484.79 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  17256. 484.79 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  17257. 484.79 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  17258. 484.79 s [algebraic-graphs]
  17259. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  17260. 484.79 s [algebraic-graphs] OK: replaceVertex x x == id
  17261. 484.79 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  17262. 484.79 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  17263. 484.79 s [algebraic-graphs]
  17264. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  17265. 484.79 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  17266. 484.79 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  17267. 484.79 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  17268. 484.79 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  17269. 484.79 s [algebraic-graphs]
  17270. 484.79 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  17271. 484.79 s [algebraic-graphs] OK: transpose empty == empty
  17272. 484.79 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  17273. 484.79 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  17274. 484.80 s [algebraic-graphs] OK: transpose . transpose == id
  17275. 484.80 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17276. 484.80 s [algebraic-graphs]
  17277. 484.80 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  17278. 484.80 s [algebraic-graphs] OK: gmap f empty == empty
  17279. 484.80 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  17280. 484.80 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  17281. 484.80 s [algebraic-graphs] OK: gmap id == id
  17282. 484.80 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  17283. 484.80 s [algebraic-graphs]
  17284. 484.80 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  17285. 484.80 s [algebraic-graphs] OK: induce (const True ) x == x
  17286. 484.80 s [algebraic-graphs] OK: induce (const False) x == empty
  17287. 484.80 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  17288. 484.80 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  17289. 484.80 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17290. 484.80 s [algebraic-graphs]
  17291. 484.80 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  17292. 484.80 s [algebraic-graphs] OK: compose empty x == empty
  17293. 484.80 s [algebraic-graphs] OK: compose x empty == empty
  17294. 484.80 s [algebraic-graphs] OK: compose (vertex x) y == empty
  17295. 484.80 s [algebraic-graphs] OK: compose x (vertex y) == empty
  17296. 484.80 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  17297. 484.80 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  17298. 485.06 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  17299. 485.06 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  17300. 485.06 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  17301. 485.06 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  17302. 485.06 s [algebraic-graphs]
  17303. 485.06 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  17304. 485.06 s [algebraic-graphs] OK: closure empty == empty
  17305. 485.06 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  17306. 485.06 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  17307. 485.06 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  17308. 485.06 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  17309. 485.06 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  17310. 485.06 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  17311. 485.06 s [algebraic-graphs] OK: closure . closure == closure
  17312. 485.06 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  17313. 485.06 s [algebraic-graphs]
  17314. 485.06 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  17315. 485.07 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  17316. 485.07 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  17317. 485.07 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  17318. 485.07 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  17319. 485.07 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  17320. 485.07 s [algebraic-graphs]
  17321. 485.07 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  17322. 485.07 s [algebraic-graphs] OK: symmetricClosure empty == empty
  17323. 485.07 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  17324. 485.07 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  17325. 485.07 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  17326. 485.07 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  17327. 485.07 s [algebraic-graphs]
  17328. 485.07 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  17329. 485.07 s [algebraic-graphs] OK: transitiveClosure empty == empty
  17330. 485.07 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  17331. 485.07 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  17332. 485.07 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  17333. 485.07 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  17334. 485.07 s [algebraic-graphs]
  17335. 485.07 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  17336. 485.07 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  17337. 485.07 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  17338. 485.07 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  17339. 485.07 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  17340. 485.07 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  17341. 485.07 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  17342. 485.07 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  17343. 485.07 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  17344. 485.07 s [algebraic-graphs] OK: bfsForest x [] == []
  17345. 485.07 s [algebraic-graphs] OK: bfsForest empty vs == []
  17346. 485.07 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  17347. 485.07 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  17348. 485.07 s [algebraic-graphs]
  17349. 485.07 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  17350. 485.07 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  17351. 485.07 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  17352. 485.07 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  17353. 485.07 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  17354. 485.07 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  17355. 485.07 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  17356. 485.07 s [algebraic-graphs] OK: bfs empty vs == []
  17357. 485.07 s [algebraic-graphs] OK: bfs x [] == []
  17358. 485.07 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  17359. 485.07 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  17360. 485.07 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  17361. 485.07 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  17362. 485.07 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  17363. 485.07 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  17364. 485.07 s [algebraic-graphs]
  17365. 485.07 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  17366. 485.07 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  17367. 485.07 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  17368. 485.07 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  17369. 485.07 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  17370. 485.07 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  17371. 485.07 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  17372. 485.07 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  17373. 485.07 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  17374. 485.07 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  17375. 485.07 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  17376. 485.07 s [algebraic-graphs]
  17377. 485.07 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  17378. 485.07 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  17379. 485.07 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  17380. 485.07 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  17381. 485.07 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  17382. 485.07 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  17383. 485.07 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  17384. 485.07 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  17385. 485.07 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  17386. 485.07 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  17387. 485.07 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  17388. 485.07 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  17389. 485.07 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  17390. 485.07 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  17391. 485.07 s [algebraic-graphs]
  17392. 485.07 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  17393. 485.07 s [algebraic-graphs] OK: dfs empty vs == []
  17394. 485.07 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  17395. 485.07 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  17396. 485.07 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  17397. 485.07 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  17398. 485.07 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  17399. 485.07 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  17400. 485.07 s [algebraic-graphs] OK: dfs x [] == []
  17401. 485.07 s [algebraic-graphs]
  17402. 485.07 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  17403. 485.07 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  17404. 485.07 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  17405. 485.07 s [algebraic-graphs]
  17406. 485.07 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  17407. 485.07 s [algebraic-graphs] OK: reachable empty x == []
  17408. 485.07 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  17409. 485.07 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  17410. 485.07 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  17411. 485.07 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  17412. 485.07 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  17413. 485.07 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  17414. 485.07 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  17415. 485.07 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  17416. 485.07 s [algebraic-graphs]
  17417. 485.07 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  17418. 485.07 s [algebraic-graphs]
  17419. 485.07 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  17420. 485.07 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  17421. 485.07 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  17422. 485.07 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  17423. 485.07 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  17424. 485.07 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  17425. 485.07 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  17426. 485.07 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  17427. 485.07 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  17428. 485.07 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  17429. 485.07 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  17430. 485.07 s [algebraic-graphs]
  17431. 485.07 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  17432. 485.07 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  17433. 485.07 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  17434. 485.07 s [algebraic-graphs] OK: isAcyclic . circuit == null
  17435. 485.07 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  17436. 485.07 s [algebraic-graphs]
  17437. 485.07 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  17438. 485.07 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  17439. 485.07 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  17440. 485.07 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  17441. 485.07 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  17442. 485.07 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  17443. 485.07 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  17444. 485.07 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  17445. 485.07 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  17446. 485.07 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  17447. 485.07 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  17448. 485.07 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  17449. 485.07 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  17450. 485.07 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  17451. 490.08 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  17452. 490.08 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  17453. 490.24 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  17454. 490.24 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  17455. 490.24 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  17456. 490.24 s [algebraic-graphs]
  17457. 490.24 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  17458. 490.24 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  17459. 490.24 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  17460. 490.24 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  17461. 490.24 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  17462. 490.24 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  17463. 490.24 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  17464. 490.24 s [algebraic-graphs]
  17465. 490.24 s [algebraic-graphs] ============ AdjacencyMap ============
  17466. 490.24 s [algebraic-graphs] OK: Axioms of graphs
  17467. 490.24 s [algebraic-graphs]
  17468. 490.25 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  17469. 490.25 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  17470. 490.25 s [algebraic-graphs]
  17471. 490.25 s [algebraic-graphs] OK: consistent empty == True
  17472. 490.25 s [algebraic-graphs] OK: consistent (vertex x) == True
  17473. 490.25 s [algebraic-graphs] OK: consistent (overlay x y) == True
  17474. 490.25 s [algebraic-graphs] OK: consistent (connect x y) == True
  17475. 490.25 s [algebraic-graphs] OK: consistent (edge x y) == True
  17476. 490.25 s [algebraic-graphs] OK: consistent (edges xs) == True
  17477. 490.25 s [algebraic-graphs] OK: consistent (stars xs) == True
  17478. 490.25 s [algebraic-graphs]
  17479. 490.25 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  17480. 490.25 s [algebraic-graphs] OK: show (empty ) == "empty"
  17481. 490.25 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  17482. 490.25 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  17483. 490.25 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  17484. 490.25 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  17485. 490.25 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  17486. 490.25 s [algebraic-graphs]
  17487. 490.25 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  17488. 490.25 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  17489. 490.25 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  17490. 490.25 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  17491. 490.25 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  17492. 490.25 s [algebraic-graphs]
  17493. 490.25 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  17494. 490.25 s [algebraic-graphs] OK: vertex 1 < vertex 2
  17495. 490.25 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  17496. 490.25 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  17497. 490.25 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  17498. 490.25 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  17499. 490.25 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  17500. 490.25 s [algebraic-graphs] OK: x <= x + y
  17501. 490.25 s [algebraic-graphs] OK: x + y <= x * y
  17502. 490.25 s [algebraic-graphs]
  17503. 490.25 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  17504. 490.25 s [algebraic-graphs] OK: isEmpty empty == True
  17505. 490.25 s [algebraic-graphs] OK: hasVertex x empty == False
  17506. 490.25 s [algebraic-graphs] OK: vertexCount empty == 0
  17507. 490.25 s [algebraic-graphs] OK: edgeCount empty == 0
  17508. 490.25 s [algebraic-graphs]
  17509. 490.25 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  17510. 490.25 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17511. 490.25 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17512. 490.25 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17513. 490.25 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17514. 490.25 s [algebraic-graphs]
  17515. 490.25 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  17516. 490.25 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  17517. 490.25 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17518. 490.25 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17519. 490.25 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  17520. 490.25 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  17521. 490.25 s [algebraic-graphs]
  17522. 490.25 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  17523. 490.25 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  17524. 490.25 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  17525. 490.25 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  17526. 490.25 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  17527. 490.25 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  17528. 490.25 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  17529. 490.25 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  17530. 490.25 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  17531. 490.25 s [algebraic-graphs]
  17532. 490.25 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  17533. 490.25 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  17534. 490.25 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  17535. 490.25 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  17536. 490.25 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  17537. 490.25 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  17538. 490.25 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  17539. 490.25 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  17540. 490.25 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  17541. 490.25 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  17542. 490.25 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  17543. 490.25 s [algebraic-graphs]
  17544. 490.25 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  17545. 490.25 s [algebraic-graphs] OK: vertices [] == empty
  17546. 490.25 s [algebraic-graphs] OK: vertices [x] == vertex x
  17547. 490.25 s [algebraic-graphs] OK: vertices == overlays . map vertex
  17548. 490.25 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17549. 490.25 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17550. 490.25 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17551. 490.25 s [algebraic-graphs]
  17552. 490.25 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  17553. 490.25 s [algebraic-graphs] OK: edges [] == empty
  17554. 490.25 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  17555. 490.25 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  17556. 490.25 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  17557. 490.25 s [algebraic-graphs]
  17558. 490.25 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  17559. 490.25 s [algebraic-graphs] OK: overlays [] == empty
  17560. 490.25 s [algebraic-graphs] OK: overlays [x] == x
  17561. 490.25 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  17562. 490.25 s [algebraic-graphs] OK: overlays == foldr overlay empty
  17563. 490.25 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  17564. 490.25 s [algebraic-graphs]
  17565. 490.25 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  17566. 490.25 s [algebraic-graphs] OK: connects [] == empty
  17567. 490.25 s [algebraic-graphs] OK: connects [x] == x
  17568. 490.25 s [algebraic-graphs] OK: connects [x,y] == connect x y
  17569. 490.25 s [algebraic-graphs] OK: connects == foldr connect empty
  17570. 490.25 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  17571. 490.25 s [algebraic-graphs]
  17572. 490.25 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  17573. 490.25 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  17574. 490.25 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  17575. 490.25 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  17576. 490.25 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  17577. 490.25 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  17578. 490.25 s [algebraic-graphs]
  17579. 490.25 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  17580. 490.25 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17581. 490.25 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17582. 490.25 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  17583. 490.25 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  17584. 490.25 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  17585. 490.25 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17586. 490.25 s [algebraic-graphs]
  17587. 490.25 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  17588. 490.25 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  17589. 490.25 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  17590. 490.25 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  17591. 490.25 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  17592. 490.25 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  17593. 490.25 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  17594. 490.25 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  17595. 490.25 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  17596. 490.25 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  17597. 490.25 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  17598. 490.25 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  17599. 490.25 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  17600. 490.25 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  17601. 490.25 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  17602. 490.25 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  17603. 490.25 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  17604. 490.25 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  17605. 490.25 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  17606. 490.25 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  17607. 490.25 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  17608. 490.25 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  17609. 490.25 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  17610. 490.25 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  17611. 490.25 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  17612. 490.25 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  17613. 490.25 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  17614. 490.25 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  17615. 490.25 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  17616. 490.25 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17617. 490.25 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  17618. 490.25 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  17619. 490.25 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  17620. 490.25 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  17621. 491.77 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  17622. 491.77 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17623. 491.77 s [algebraic-graphs]
  17624. 491.77 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  17625. 491.77 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  17626. 491.77 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  17627. 491.77 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  17628. 491.77 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  17629. 491.77 s [algebraic-graphs]
  17630. 491.77 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  17631. 491.77 s [algebraic-graphs] OK: isEmpty empty == True
  17632. 491.77 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  17633. 491.77 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17634. 491.77 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17635. 491.77 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  17636. 491.77 s [algebraic-graphs]
  17637. 491.77 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  17638. 491.77 s [algebraic-graphs] OK: hasVertex x empty == False
  17639. 491.77 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17640. 491.77 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17641. 491.77 s [algebraic-graphs]
  17642. 491.77 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  17643. 491.77 s [algebraic-graphs] OK: hasEdge x y empty == False
  17644. 491.77 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17645. 491.77 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17646. 491.77 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17647. 491.77 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17648. 491.77 s [algebraic-graphs]
  17649. 491.77 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  17650. 491.77 s [algebraic-graphs] OK: vertexCount empty == 0
  17651. 491.77 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17652. 491.77 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17653. 491.77 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17654. 491.77 s [algebraic-graphs]
  17655. 491.77 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  17656. 491.77 s [algebraic-graphs] OK: edgeCount empty == 0
  17657. 491.77 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17658. 491.77 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17659. 491.77 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17660. 491.77 s [algebraic-graphs]
  17661. 491.77 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  17662. 491.78 s [algebraic-graphs] OK: vertexList empty == []
  17663. 491.78 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17664. 491.78 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17665. 491.78 s [algebraic-graphs]
  17666. 491.78 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  17667. 491.78 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17668. 491.78 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17669. 491.78 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17670. 491.78 s [algebraic-graphs]
  17671. 491.78 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  17672. 491.78 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  17673. 491.78 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  17674. 491.78 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  17675. 491.78 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  17676. 491.78 s [algebraic-graphs]
  17677. 491.78 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  17678. 491.78 s [algebraic-graphs] OK: edgeList empty == []
  17679. 491.78 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17680. 491.78 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  17681. 491.78 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  17682. 491.78 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  17683. 491.78 s [algebraic-graphs]
  17684. 491.78 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  17685. 491.78 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17686. 491.78 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17687. 491.78 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  17688. 491.78 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  17689. 491.78 s [algebraic-graphs]
  17690. 491.78 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  17691. 491.78 s [algebraic-graphs] OK: adjacencyList empty == []
  17692. 491.78 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  17693. 491.78 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  17694. 491.78 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  17695. 491.78 s [algebraic-graphs]
  17696. 491.78 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  17697. 491.78 s [algebraic-graphs] OK: preSet x empty == Set.empty
  17698. 491.78 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  17699. 491.78 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  17700. 491.78 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  17701. 491.78 s [algebraic-graphs]
  17702. 491.78 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  17703. 491.78 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  17704. 491.78 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  17705. 491.78 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  17706. 491.78 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  17707. 491.78 s [algebraic-graphs]
  17708. 491.78 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  17709. 491.78 s [algebraic-graphs] OK: postSet x empty == Set.empty
  17710. 491.78 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  17711. 491.78 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  17712. 491.78 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  17713. 491.78 s [algebraic-graphs]
  17714. 491.78 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  17715. 491.78 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  17716. 491.78 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  17717. 491.78 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  17718. 491.78 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  17719. 491.78 s [algebraic-graphs]
  17720. 491.78 s [algebraic-graphs] ============ AdjacencyMap.path ============
  17721. 491.78 s [algebraic-graphs] OK: path [] == empty
  17722. 491.78 s [algebraic-graphs] OK: path [x] == vertex x
  17723. 491.78 s [algebraic-graphs] OK: path [x,y] == edge x y
  17724. 491.78 s [algebraic-graphs]
  17725. 491.78 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  17726. 491.78 s [algebraic-graphs] OK: circuit [] == empty
  17727. 491.78 s [algebraic-graphs] OK: circuit [x] == edge x x
  17728. 491.78 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  17729. 491.78 s [algebraic-graphs]
  17730. 491.78 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  17731. 491.78 s [algebraic-graphs] OK: clique [] == empty
  17732. 491.78 s [algebraic-graphs] OK: clique [x] == vertex x
  17733. 491.78 s [algebraic-graphs] OK: clique [x,y] == edge x y
  17734. 491.78 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  17735. 491.78 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  17736. 491.78 s [algebraic-graphs]
  17737. 491.78 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  17738. 491.78 s [algebraic-graphs] OK: biclique [] [] == empty
  17739. 491.78 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  17740. 491.78 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  17741. 491.78 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  17742. 491.78 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  17743. 491.78 s [algebraic-graphs]
  17744. 491.78 s [algebraic-graphs] ============ AdjacencyMap.star ============
  17745. 491.78 s [algebraic-graphs] OK: star x [] == vertex x
  17746. 491.78 s [algebraic-graphs] OK: star x [y] == edge x y
  17747. 491.78 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  17748. 491.78 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  17749. 491.78 s [algebraic-graphs]
  17750. 491.78 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  17751. 491.78 s [algebraic-graphs] OK: stars [] == empty
  17752. 491.78 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  17753. 491.78 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  17754. 491.78 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  17755. 491.78 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  17756. 491.78 s [algebraic-graphs] OK: stars . adjacencyList == id
  17757. 491.78 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  17758. 491.78 s [algebraic-graphs]
  17759. 491.78 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  17760. 491.78 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  17761. 491.78 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  17762. 491.78 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  17763. 491.78 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  17764. 491.78 s [algebraic-graphs]
  17765. 491.78 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  17766. 491.78 s [algebraic-graphs] OK: forest [] == empty
  17767. 491.78 s [algebraic-graphs] OK: forest [x] == tree x
  17768. 491.78 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  17769. 491.78 s [algebraic-graphs] OK: forest == overlays . map tree
  17770. 491.78 s [algebraic-graphs]
  17771. 491.78 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  17772. 491.78 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  17773. 491.78 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  17774. 491.78 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  17775. 491.78 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  17776. 491.78 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  17777. 491.78 s [algebraic-graphs]
  17778. 491.78 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  17779. 491.78 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  17780. 491.78 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  17781. 491.78 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  17782. 491.78 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  17783. 491.78 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  17784. 491.78 s [algebraic-graphs]
  17785. 491.78 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  17786. 491.78 s [algebraic-graphs] OK: replaceVertex x x == id
  17787. 491.78 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  17788. 491.78 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  17789. 491.78 s [algebraic-graphs]
  17790. 491.78 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  17791. 491.78 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  17792. 491.78 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  17793. 491.78 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  17794. 491.78 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  17795. 491.78 s [algebraic-graphs]
  17796. 491.78 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  17797. 491.78 s [algebraic-graphs] OK: transpose empty == empty
  17798. 491.78 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  17799. 491.78 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  17800. 491.78 s [algebraic-graphs] OK: transpose . transpose == id
  17801. 491.78 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17802. 491.78 s [algebraic-graphs]
  17803. 491.78 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  17804. 491.78 s [algebraic-graphs] OK: gmap f empty == empty
  17805. 491.78 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  17806. 491.78 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  17807. 491.78 s [algebraic-graphs] OK: gmap id == id
  17808. 491.78 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  17809. 491.78 s [algebraic-graphs]
  17810. 491.78 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  17811. 491.78 s [algebraic-graphs] OK: induce (const True ) x == x
  17812. 491.78 s [algebraic-graphs] OK: induce (const False) x == empty
  17813. 491.78 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  17814. 491.78 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  17815. 491.78 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17816. 491.78 s [algebraic-graphs]
  17817. 491.78 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  17818. 491.78 s [algebraic-graphs] OK: compose empty x == empty
  17819. 491.78 s [algebraic-graphs] OK: compose x empty == empty
  17820. 491.78 s [algebraic-graphs] OK: compose (vertex x) y == empty
  17821. 491.78 s [algebraic-graphs] OK: compose x (vertex y) == empty
  17822. 491.78 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  17823. 491.78 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  17824. 494.08 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  17825. 494.08 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  17826. 494.08 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  17827. 494.08 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  17828. 494.08 s [algebraic-graphs]
  17829. 494.08 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  17830. 494.08 s [algebraic-graphs] OK: closure empty == empty
  17831. 494.08 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  17832. 494.08 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  17833. 494.08 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  17834. 494.08 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  17835. 494.08 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  17836. 494.08 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  17837. 494.08 s [algebraic-graphs] OK: closure . closure == closure
  17838. 494.08 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  17839. 494.08 s [algebraic-graphs]
  17840. 494.08 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  17841. 494.08 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  17842. 494.08 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  17843. 494.08 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  17844. 494.08 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  17845. 494.08 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  17846. 494.08 s [algebraic-graphs]
  17847. 494.08 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  17848. 494.08 s [algebraic-graphs] OK: symmetricClosure empty == empty
  17849. 494.08 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  17850. 494.08 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  17851. 494.08 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  17852. 494.08 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  17853. 494.08 s [algebraic-graphs]
  17854. 494.08 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  17855. 494.08 s [algebraic-graphs] OK: transitiveClosure empty == empty
  17856. 494.08 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  17857. 494.08 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  17858. 494.08 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  17859. 494.08 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  17860. 494.08 s [algebraic-graphs]
  17861. 494.08 s [algebraic-graphs] ============ AdjacencyMap.box ============
  17862. 494.08 s [algebraic-graphs] OK: box x y ~~ box y x
  17863. 494.08 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  17864. 494.08 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  17865. 494.08 s [algebraic-graphs] OK: box x empty ~~ empty
  17866. 494.08 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  17867. 494.08 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  17868. 494.08 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  17869. 494.08 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  17870. 494.08 s [algebraic-graphs]
  17871. 494.08 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  17872. 494.08 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  17873. 494.08 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  17874. 494.08 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  17875. 494.08 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  17876. 494.08 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  17877. 494.08 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  17878. 494.08 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  17879. 494.08 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  17880. 494.08 s [algebraic-graphs] OK: bfsForest x [] == []
  17881. 494.08 s [algebraic-graphs] OK: bfsForest empty vs == []
  17882. 494.08 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  17883. 494.08 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  17884. 494.08 s [algebraic-graphs]
  17885. 494.08 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  17886. 494.08 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  17887. 494.08 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  17888. 494.08 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  17889. 494.08 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  17890. 494.08 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  17891. 494.08 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  17892. 494.08 s [algebraic-graphs] OK: bfs empty vs == []
  17893. 494.08 s [algebraic-graphs] OK: bfs x [] == []
  17894. 494.08 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  17895. 494.08 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  17896. 494.08 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  17897. 494.08 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  17898. 494.08 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  17899. 494.08 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  17900. 494.08 s [algebraic-graphs]
  17901. 494.08 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  17902. 494.08 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  17903. 494.08 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  17904. 494.08 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  17905. 494.08 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  17906. 494.08 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  17907. 494.08 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  17908. 494.08 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  17909. 494.08 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  17910. 494.08 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  17911. 494.08 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  17912. 494.08 s [algebraic-graphs]
  17913. 494.08 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  17914. 494.09 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  17915. 494.09 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  17916. 494.09 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  17917. 494.09 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  17918. 494.09 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  17919. 494.09 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  17920. 494.09 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  17921. 494.09 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  17922. 494.09 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  17923. 494.09 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  17924. 494.09 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  17925. 494.09 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  17926. 494.09 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  17927. 494.09 s [algebraic-graphs]
  17928. 494.09 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  17929. 494.09 s [algebraic-graphs] OK: dfs empty vs == []
  17930. 494.09 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  17931. 494.09 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  17932. 494.09 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  17933. 494.09 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  17934. 494.09 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  17935. 494.09 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  17936. 494.09 s [algebraic-graphs] OK: dfs x [] == []
  17937. 494.09 s [algebraic-graphs]
  17938. 494.09 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  17939. 494.09 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  17940. 494.09 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  17941. 494.09 s [algebraic-graphs]
  17942. 494.09 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  17943. 494.09 s [algebraic-graphs] OK: reachable empty x == []
  17944. 494.09 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  17945. 494.09 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  17946. 494.09 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  17947. 494.09 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  17948. 494.09 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  17949. 494.09 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  17950. 494.09 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  17951. 494.09 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  17952. 494.09 s [algebraic-graphs]
  17953. 494.09 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  17954. 494.09 s [algebraic-graphs]
  17955. 494.09 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  17956. 494.09 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  17957. 494.09 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  17958. 494.09 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  17959. 494.09 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  17960. 494.09 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  17961. 494.09 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  17962. 494.09 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  17963. 494.09 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  17964. 494.09 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  17965. 494.09 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  17966. 494.09 s [algebraic-graphs]
  17967. 494.09 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  17968. 494.09 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  17969. 494.09 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  17970. 494.09 s [algebraic-graphs] OK: isAcyclic . circuit == null
  17971. 494.09 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  17972. 494.09 s [algebraic-graphs]
  17973. 494.09 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  17974. 494.09 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  17975. 494.09 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  17976. 494.09 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  17977. 494.09 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  17978. 494.09 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  17979. 494.09 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  17980. 494.09 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  17981. 500.56 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  17982. 500.56 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  17983. 500.60 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  17984. 500.60 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  17985. 500.60 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  17986. 500.60 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  17987. 500.60 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  17988. 500.60 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  17989. 500.60 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  17990. 500.60 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  17991. 500.60 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  17992. 500.60 s [algebraic-graphs]
  17993. 500.60 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  17994. 500.60 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  17995. 500.60 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  17996. 500.60 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  17997. 500.60 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  17998. 500.60 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  17999. 500.60 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  18000. 500.60 s [algebraic-graphs]
  18001. 500.60 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  18002. 500.60 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  18003. 500.60 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  18004. 500.60 s [algebraic-graphs] OK: induceJust . gmap Just == id
  18005. 500.60 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  18006. 500.60 s [algebraic-graphs]
  18007. 500.60 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  18008. 500.60 s [algebraic-graphs] OK: scc empty == empty
  18009. 500.60 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  18010. 500.60 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  18011. 500.60 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  18012. 500.60 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  18013. 500.60 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  18014. 500.60 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  18015. 500.60 s [algebraic-graphs] OK: isAcyclic . scc == const True
  18016. 500.60 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  18017. 500.60 s [algebraic-graphs] OK: scc g == KL.scc g
  18018. 500.60 s [algebraic-graphs]
  18019. 500.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  18020. 500.60 s [algebraic-graphs] OK: 0 == rightVertex 0
  18021. 500.60 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  18022. 500.60 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  18023. 500.60 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  18024. 500.60 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  18025. 500.60 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  18026. 500.60 s [algebraic-graphs]
  18027. 500.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  18028. 500.60 s [algebraic-graphs] OK: show empty == "empty"
  18029. 500.60 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  18030. 500.60 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  18031. 500.60 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  18032. 500.60 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  18033. 500.60 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  18034. 500.60 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  18035. 500.60 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  18036. 500.60 s [algebraic-graphs]
  18037. 500.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  18038. 500.60 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  18039. 500.60 s [algebraic-graphs]
  18040. 500.60 s [algebraic-graphs] OK: x + y == y + x
  18041. 500.60 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  18042. 500.60 s [algebraic-graphs] OK: x * empty == x
  18043. 500.60 s [algebraic-graphs] OK: empty * x == x
  18044. 500.60 s [algebraic-graphs] OK: x * y == y * x
  18045. 500.60 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  18046. 500.60 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  18047. 500.60 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  18048. 500.60 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  18049. 500.60 s [algebraic-graphs] OK: x + empty == x
  18050. 500.60 s [algebraic-graphs] OK: empty + x == x
  18051. 500.60 s [algebraic-graphs] OK: x + x == x
  18052. 500.60 s [algebraic-graphs] OK: x * y + x + y == x * y
  18053. 500.60 s [algebraic-graphs] OK: x * x * x == x * x
  18054. 500.60 s [algebraic-graphs]
  18055. 500.60 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  18056. 500.60 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  18057. 500.60 s [algebraic-graphs]
  18058. 500.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  18059. 500.60 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  18060. 500.60 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  18061. 500.60 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  18062. 500.60 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  18063. 500.60 s [algebraic-graphs]
  18064. 500.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  18065. 500.60 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  18066. 500.60 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  18067. 500.60 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  18068. 500.60 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  18069. 500.60 s [algebraic-graphs]
  18070. 500.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  18071. 500.60 s [algebraic-graphs] OK: isEmpty empty == True
  18072. 500.60 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  18073. 500.60 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  18074. 500.60 s [algebraic-graphs] OK: hasVertex x empty == False
  18075. 500.60 s [algebraic-graphs]
  18076. 500.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  18077. 500.60 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  18078. 500.60 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  18079. 500.60 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  18080. 500.60 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  18081. 500.60 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  18082. 500.60 s [algebraic-graphs]
  18083. 500.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  18084. 500.60 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  18085. 500.60 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  18086. 500.60 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  18087. 500.60 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  18088. 500.60 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  18089. 500.60 s [algebraic-graphs]
  18090. 500.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  18091. 500.60 s [algebraic-graphs] OK: vertex . Left == leftVertex
  18092. 500.60 s [algebraic-graphs] OK: vertex . Right == rightVertex
  18093. 500.60 s [algebraic-graphs]
  18094. 500.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  18095. 500.60 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  18096. 500.60 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  18097. 500.60 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  18098. 500.60 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18099. 500.60 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  18100. 500.60 s [algebraic-graphs]
  18101. 500.60 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  18102. 500.60 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  18103. 500.60 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18104. 500.60 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18105. 500.61 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18106. 500.61 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18107. 500.61 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18108. 500.61 s [algebraic-graphs]
  18109. 500.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  18110. 500.61 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  18111. 500.61 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  18112. 500.61 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  18113. 500.61 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  18114. 500.61 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  18115. 500.61 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  18116. 500.61 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  18117. 500.61 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  18118. 500.61 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  18119. 500.61 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  18120. 500.61 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  18121. 500.61 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  18122. 500.61 s [algebraic-graphs]
  18123. 500.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  18124. 500.61 s [algebraic-graphs] OK: vertices [] [] == empty
  18125. 500.61 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  18126. 500.61 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  18127. 500.61 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  18128. 500.61 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  18129. 500.61 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  18130. 500.61 s [algebraic-graphs]
  18131. 500.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  18132. 500.61 s [algebraic-graphs] OK: edges [] == empty
  18133. 500.61 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  18134. 500.61 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  18135. 500.61 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  18136. 500.61 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18137. 500.61 s [algebraic-graphs]
  18138. 500.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  18139. 500.61 s [algebraic-graphs] OK: overlays [] == empty
  18140. 500.61 s [algebraic-graphs] OK: overlays [x] == x
  18141. 500.61 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  18142. 500.61 s [algebraic-graphs] OK: overlays == foldr overlay empty
  18143. 500.61 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  18144. 500.61 s [algebraic-graphs]
  18145. 500.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  18146. 500.61 s [algebraic-graphs] OK: connects [] == empty
  18147. 500.61 s [algebraic-graphs] OK: connects [x] == x
  18148. 500.61 s [algebraic-graphs] OK: connects [x,y] == connect x y
  18149. 500.61 s [algebraic-graphs] OK: connects == foldr connect empty
  18150. 500.61 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  18151. 500.61 s [algebraic-graphs]
  18152. 500.61 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  18153. 501.84 s [algebraic-graphs] OK: swap empty == empty
  18154. 501.84 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  18155. 501.84 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  18156. 501.84 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  18157. 501.84 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  18158. 501.84 s [algebraic-graphs] OK: swap . swap == id
  18159. 501.84 s [algebraic-graphs]
  18160. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  18161. 501.84 s [algebraic-graphs] OK: toBipartite empty == empty
  18162. 501.84 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  18163. 501.84 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  18164. 501.84 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  18165. 501.84 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  18166. 501.84 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  18167. 501.84 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  18168. 501.84 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  18169. 501.84 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  18170. 501.84 s [algebraic-graphs]
  18171. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  18172. 501.84 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  18173. 501.84 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  18174. 501.84 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  18175. 501.84 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  18176. 501.84 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  18177. 501.84 s [algebraic-graphs]
  18178. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  18179. 501.84 s [algebraic-graphs] OK: fromBipartite empty == empty
  18180. 501.84 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  18181. 501.84 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  18182. 501.84 s [algebraic-graphs]
  18183. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  18184. 501.84 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  18185. 501.84 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  18186. 501.84 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  18187. 501.84 s [algebraic-graphs]
  18188. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  18189. 501.84 s [algebraic-graphs] OK: isEmpty empty == True
  18190. 501.84 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  18191. 501.84 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18192. 501.84 s [algebraic-graphs] OK: isEmpty == (==) empty
  18193. 501.84 s [algebraic-graphs]
  18194. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  18195. 501.84 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  18196. 501.84 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  18197. 501.84 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  18198. 501.84 s [algebraic-graphs]
  18199. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  18200. 501.84 s [algebraic-graphs] OK: hasRightVertex x empty == False
  18201. 501.84 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  18202. 501.84 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  18203. 501.84 s [algebraic-graphs]
  18204. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  18205. 501.84 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  18206. 501.84 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  18207. 501.84 s [algebraic-graphs]
  18208. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  18209. 501.84 s [algebraic-graphs] OK: hasEdge x y empty == False
  18210. 501.84 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  18211. 501.84 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18212. 501.84 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  18213. 501.84 s [algebraic-graphs]
  18214. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  18215. 501.84 s [algebraic-graphs] OK: leftVertexCount empty == 0
  18216. 501.84 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  18217. 501.84 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  18218. 501.84 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  18219. 501.84 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  18220. 501.84 s [algebraic-graphs]
  18221. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  18222. 501.84 s [algebraic-graphs] OK: rightVertexCount empty == 0
  18223. 501.84 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  18224. 501.84 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  18225. 501.84 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  18226. 501.84 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  18227. 501.84 s [algebraic-graphs]
  18228. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  18229. 501.84 s [algebraic-graphs] OK: vertexCount empty == 0
  18230. 501.84 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18231. 501.84 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  18232. 501.84 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  18233. 501.84 s [algebraic-graphs]
  18234. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  18235. 501.84 s [algebraic-graphs] OK: edgeCount empty == 0
  18236. 501.84 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18237. 501.84 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18238. 501.84 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18239. 501.84 s [algebraic-graphs]
  18240. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  18241. 501.84 s [algebraic-graphs] OK: leftVertexList empty == []
  18242. 501.84 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  18243. 501.84 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  18244. 501.84 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  18245. 501.84 s [algebraic-graphs]
  18246. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  18247. 501.84 s [algebraic-graphs] OK: rightVertexList empty == []
  18248. 501.84 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  18249. 501.84 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  18250. 501.84 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  18251. 501.84 s [algebraic-graphs]
  18252. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  18253. 501.84 s [algebraic-graphs] OK: vertexList empty == []
  18254. 501.84 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  18255. 501.84 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  18256. 501.84 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  18257. 501.84 s [algebraic-graphs]
  18258. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  18259. 501.84 s [algebraic-graphs] OK: edgeList empty == []
  18260. 501.84 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18261. 501.84 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  18262. 501.84 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  18263. 501.84 s [algebraic-graphs]
  18264. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  18265. 501.84 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  18266. 501.84 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  18267. 501.84 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  18268. 501.84 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  18269. 501.84 s [algebraic-graphs]
  18270. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  18271. 501.84 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  18272. 501.84 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  18273. 501.84 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  18274. 501.84 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  18275. 501.84 s [algebraic-graphs]
  18276. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  18277. 501.84 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  18278. 501.84 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  18279. 501.84 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  18280. 501.84 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  18281. 501.84 s [algebraic-graphs]
  18282. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  18283. 501.84 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  18284. 501.84 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18285. 501.84 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  18286. 501.84 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  18287. 501.84 s [algebraic-graphs]
  18288. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  18289. 501.84 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  18290. 501.84 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  18291. 501.84 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  18292. 501.84 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  18293. 501.84 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  18294. 501.84 s [algebraic-graphs]
  18295. 501.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  18296. 501.85 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  18297. 501.85 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  18298. 501.85 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  18299. 501.85 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  18300. 501.85 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  18301. 501.85 s [algebraic-graphs]
  18302. 501.85 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  18303. 501.85 s [algebraic-graphs] OK: evenList [] == Nil
  18304. 501.85 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  18305. 501.85 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  18306. 501.85 s [algebraic-graphs]
  18307. 501.85 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  18308. 501.85 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  18309. 501.85 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  18310. 501.85 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  18311. 501.85 s [algebraic-graphs]
  18312. 501.85 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  18313. 501.85 s [algebraic-graphs] OK: path Nil == empty
  18314. 501.85 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  18315. 501.85 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  18316. 501.85 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  18317. 501.85 s [algebraic-graphs]
  18318. 501.85 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  18319. 501.85 s [algebraic-graphs] OK: circuit [] == empty
  18320. 501.85 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  18321. 501.85 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  18322. 501.85 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  18323. 501.85 s [algebraic-graphs]
  18324. 501.85 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  18325. 501.85 s [algebraic-graphs] OK: biclique [] [] == empty
  18326. 501.85 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  18327. 501.85 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  18328. 501.85 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  18329. 501.85 s [algebraic-graphs]
  18330. 501.85 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  18331. 501.85 s [algebraic-graphs] OK: star x [] == leftVertex x
  18332. 501.85 s [algebraic-graphs] OK: star x [y] == edge x y
  18333. 501.85 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18334. 501.85 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  18335. 501.85 s [algebraic-graphs]
  18336. 501.85 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  18337. 501.85 s [algebraic-graphs] OK: stars [] == empty
  18338. 501.85 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  18339. 501.85 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  18340. 501.85 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  18341. 515.80 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18342. 515.83 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  18343. 515.83 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  18344. 515.83 s [algebraic-graphs]
  18345. 515.83 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  18346. 515.83 s [algebraic-graphs] OK: mesh xs [] == empty
  18347. 515.83 s [algebraic-graphs] OK: mesh [] ys == empty
  18348. 515.83 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  18349. 515.83 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  18350. 515.83 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  18351. 515.83 s [algebraic-graphs]
  18352. 515.83 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  18353. 515.84 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  18354. 515.84 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  18355. 515.84 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  18356. 515.84 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  18357. 515.84 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  18358. 515.84 s [algebraic-graphs]
  18359. 515.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  18360. 515.84 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  18361. 515.84 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  18362. 515.84 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  18363. 515.84 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  18364. 515.84 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  18365. 515.84 s [algebraic-graphs]
  18366. 515.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  18367. 515.84 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  18368. 515.84 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18369. 515.84 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  18370. 515.84 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  18371. 515.84 s [algebraic-graphs]
  18372. 515.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  18373. 515.84 s [algebraic-graphs] OK: bimap f g empty == empty
  18374. 515.84 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  18375. 515.84 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  18376. 515.84 s [algebraic-graphs] OK: bimap id id == id
  18377. 515.84 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  18378. 515.84 s [algebraic-graphs]
  18379. 515.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  18380. 515.84 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  18381. 515.84 s [algebraic-graphs]
  18382. 515.84 s [algebraic-graphs] OK: box x y ~~ box y x
  18383. 515.84 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18384. 515.84 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18385. 515.84 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  18386. 515.84 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  18387. 515.84 s [algebraic-graphs] OK: box x empty ~~ empty
  18388. 515.84 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  18389. 515.84 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  18390. 515.84 s [algebraic-graphs]
  18391. 515.84 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  18392. 515.84 s [algebraic-graphs]
  18393. 515.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  18394. 515.84 s [algebraic-graphs] OK: consistent empty == True
  18395. 515.84 s [algebraic-graphs] OK: consistent (vertex x) == True
  18396. 515.84 s [algebraic-graphs] OK: consistent (edge x y) == True
  18397. 515.84 s [algebraic-graphs] OK: consistent (edges x) == True
  18398. 515.84 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  18399. 515.84 s [algebraic-graphs] OK: consistent (swap x) == True
  18400. 515.84 s [algebraic-graphs] OK: consistent (circuit xs) == True
  18401. 515.84 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  18402. 515.84 s [algebraic-graphs]
  18403. 515.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  18404. 515.84 s [algebraic-graphs] OK: detectParts empty == Right empty
  18405. 515.84 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  18406. 515.84 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  18407. 515.84 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  18408. 515.84 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  18409. 515.84 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  18410. 515.84 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  18411. 515.84 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  18412. 515.84 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  18413. 515.84 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  18414. 515.84 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  18415. 515.84 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  18416. 515.84 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  18417. 515.84 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  18418. 515.84 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  18419. 515.84 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  18420. 515.84 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  18421. 515.84 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  18422. 515.84 s [algebraic-graphs]
  18423. 515.84 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  18424. 515.84 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  18425. 515.84 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  18426. 515.84 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  18427. 515.84 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  18428. 515.84 s [algebraic-graphs]
  18429. 515.84 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  18430. 515.84 s [algebraic-graphs] OK: show (matching []) == "matching []"
  18431. 515.84 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  18432. 515.84 s [algebraic-graphs]
  18433. 515.84 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  18434. 515.84 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  18435. 515.84 s [algebraic-graphs]
  18436. 515.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  18437. 515.84 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  18438. 515.84 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  18439. 515.84 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  18440. 515.84 s [algebraic-graphs]
  18441. 515.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  18442. 515.84 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  18443. 515.84 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  18444. 515.84 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  18445. 515.84 s [algebraic-graphs]
  18446. 515.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  18447. 515.84 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  18448. 515.84 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  18449. 515.84 s [algebraic-graphs]
  18450. 515.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  18451. 515.84 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  18452. 515.84 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  18453. 515.84 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  18454. 515.84 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  18455. 515.84 s [algebraic-graphs]
  18456. 515.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  18457. 515.84 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  18458. 515.84 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  18459. 515.84 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  18460. 515.84 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  18461. 515.84 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  18462. 515.84 s [algebraic-graphs]
  18463. 515.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  18464. 515.84 s [algebraic-graphs] OK: maxMatching empty == matching []
  18465. 515.84 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  18466. 515.84 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  18467. 515.84 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  18468. 515.84 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  18469. 515.84 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  18470. 515.84 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  18471. 515.84 s [algebraic-graphs]
  18472. 515.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  18473. 515.84 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  18474. 515.84 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  18475. 515.84 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  18476. 515.84 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  18477. 515.84 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  18478. 515.84 s [algebraic-graphs]
  18479. 515.84 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  18480. 515.84 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  18481. 517.93 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  18482. 517.93 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  18483. 517.93 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  18484. 517.93 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  18485. 517.93 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  18486. 517.93 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  18487. 517.93 s [algebraic-graphs]
  18488. 517.93 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  18489. 517.93 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  18490. 517.93 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  18491. 517.94 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  18492. 517.94 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  18493. 517.94 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  18494. 517.94 s [algebraic-graphs]
  18495. 517.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  18496. 517.94 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  18497. 517.94 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  18498. 517.94 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  18499. 517.94 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  18500. 517.94 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  18501. 517.94 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  18502. 517.94 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  18503. 517.94 s [algebraic-graphs]
  18504. 517.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  18505. 517.94 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  18506. 517.94 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  18507. 517.94 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  18508. 517.94 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  18509. 517.94 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  18510. 517.94 s [algebraic-graphs]
  18511. 517.94 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  18512. 517.94 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  18513. 517.94 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  18514. 517.94 s [algebraic-graphs]
  18515. 517.94 s [algebraic-graphs] ============ Export.Eq ============
  18516. 517.94 s [algebraic-graphs] OK: mempty /= literal ""
  18517. 517.94 s [algebraic-graphs]
  18518. 517.94 s [algebraic-graphs] ============ Export.Ord ============
  18519. 517.94 s [algebraic-graphs] OK: mempty < literal ""
  18520. 517.94 s [algebraic-graphs]
  18521. 517.94 s [algebraic-graphs] ============ Export.isEmpty ============
  18522. 517.94 s [algebraic-graphs] OK: isEmpty mempty == True
  18523. 517.94 s [algebraic-graphs] OK: isEmpty (literal "") == False
  18524. 517.94 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  18525. 517.94 s [algebraic-graphs]
  18526. 517.94 s [algebraic-graphs] ============ Export.literal ============
  18527. 517.94 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  18528. 517.94 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  18529. 517.94 s [algebraic-graphs] OK: render . literal == id
  18530. 517.94 s [algebraic-graphs]
  18531. 517.94 s [algebraic-graphs] ============ Export.render ============
  18532. 517.94 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  18533. 517.94 s [algebraic-graphs] OK: render mempty == mempty
  18534. 517.94 s [algebraic-graphs]
  18535. 517.94 s [algebraic-graphs] ============ Export.<+> ============
  18536. 517.94 s [algebraic-graphs] OK: x <+> mempty == x
  18537. 517.94 s [algebraic-graphs] OK: mempty <+> x == x
  18538. 517.94 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  18539. 517.94 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  18540. 517.94 s [algebraic-graphs]
  18541. 517.94 s [algebraic-graphs] ============ Export.brackets ============
  18542. 517.94 s [algebraic-graphs] OK: brackets "i" == "[i]"
  18543. 517.94 s [algebraic-graphs] OK: brackets mempty == "[]"
  18544. 517.94 s [algebraic-graphs]
  18545. 517.94 s [algebraic-graphs] ============ Export.doubleQuotes ============
  18546. 517.94 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  18547. 517.94 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  18548. 517.94 s [algebraic-graphs]
  18549. 517.94 s [algebraic-graphs] ============ Export.indent ============
  18550. 517.94 s [algebraic-graphs] OK: indent 0 == id
  18551. 517.94 s [algebraic-graphs] OK: indent 1 mempty == " "
  18552. 517.94 s [algebraic-graphs]
  18553. 517.94 s [algebraic-graphs] ============ Export.unlines ============
  18554. 517.94 s [algebraic-graphs] OK: unlines [] == mempty
  18555. 517.94 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  18556. 517.94 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  18557. 517.94 s [algebraic-graphs]
  18558. 517.94 s [algebraic-graphs] ============ Export.export ============
  18559. 517.94 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  18560. 517.94 s [algebraic-graphs]
  18561. 517.94 s [algebraic-graphs] ============ Export.Dot.export ============
  18562. 517.94 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  18563. 517.94 s [algebraic-graphs]
  18564. 517.94 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  18565. 517.94 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  18566. 517.94 s [algebraic-graphs]
  18567. 517.94 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  18568. 517.94 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  18569. 517.94 s [algebraic-graphs]
  18570. 517.94 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  18571. 517.94 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  18572. 517.94 s [algebraic-graphs]
  18573. 517.94 s [algebraic-graphs] ============ Graph ============
  18574. 517.94 s [algebraic-graphs] OK: Axioms of graphs
  18575. 517.94 s [algebraic-graphs] OK: Theorems of graphs
  18576. 517.94 s [algebraic-graphs]
  18577. 517.94 s [algebraic-graphs] ============ Graph.Ord ============
  18578. 517.94 s [algebraic-graphs] OK: vertex 1 < vertex 2
  18579. 517.94 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  18580. 517.94 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  18581. 517.94 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  18582. 517.94 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  18583. 517.94 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  18584. 517.94 s [algebraic-graphs] OK: x <= x + y
  18585. 517.94 s [algebraic-graphs] OK: x + y <= x * y
  18586. 517.94 s [algebraic-graphs]
  18587. 517.94 s [algebraic-graphs] ============ Graph.empty ============
  18588. 517.94 s [algebraic-graphs] OK: isEmpty empty == True
  18589. 517.94 s [algebraic-graphs] OK: hasVertex x empty == False
  18590. 517.94 s [algebraic-graphs] OK: vertexCount empty == 0
  18591. 517.94 s [algebraic-graphs] OK: edgeCount empty == 0
  18592. 517.94 s [algebraic-graphs]
  18593. 517.94 s [algebraic-graphs] ============ Graph.vertex ============
  18594. 517.94 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18595. 517.94 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18596. 517.94 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18597. 517.94 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18598. 517.94 s [algebraic-graphs]
  18599. 517.94 s [algebraic-graphs] ============ Graph.edge ============
  18600. 517.94 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  18601. 517.94 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18602. 517.94 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18603. 517.94 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  18604. 517.94 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  18605. 517.94 s [algebraic-graphs]
  18606. 517.94 s [algebraic-graphs] ============ Graph.overlay ============
  18607. 517.94 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  18608. 517.94 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18609. 517.94 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18610. 517.94 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18611. 517.94 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18612. 517.94 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18613. 517.94 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  18614. 517.94 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  18615. 517.94 s [algebraic-graphs]
  18616. 517.94 s [algebraic-graphs] ============ Graph.connect ============
  18617. 517.94 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  18618. 517.94 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  18619. 517.94 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  18620. 517.94 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  18621. 517.94 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  18622. 517.94 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  18623. 517.94 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  18624. 517.94 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  18625. 517.94 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  18626. 517.94 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  18627. 517.94 s [algebraic-graphs]
  18628. 517.94 s [algebraic-graphs] ============ Graph.vertices ============
  18629. 517.94 s [algebraic-graphs] OK: vertices [] == empty
  18630. 517.94 s [algebraic-graphs] OK: vertices [x] == vertex x
  18631. 517.94 s [algebraic-graphs] OK: vertices == overlays . map vertex
  18632. 517.94 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  18633. 517.94 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  18634. 517.94 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18635. 517.94 s [algebraic-graphs]
  18636. 517.94 s [algebraic-graphs] ============ Graph.edges ============
  18637. 517.94 s [algebraic-graphs] OK: edges [] == empty
  18638. 517.94 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  18639. 517.94 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  18640. 517.94 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18641. 517.94 s [algebraic-graphs]
  18642. 517.94 s [algebraic-graphs] ============ Graph.overlays ============
  18643. 517.94 s [algebraic-graphs] OK: overlays [] == empty
  18644. 517.94 s [algebraic-graphs] OK: overlays [x] == x
  18645. 517.94 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  18646. 517.94 s [algebraic-graphs] OK: overlays == foldr overlay empty
  18647. 517.94 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  18648. 517.94 s [algebraic-graphs]
  18649. 517.94 s [algebraic-graphs] ============ Graph.connects ============
  18650. 517.94 s [algebraic-graphs] OK: connects [] == empty
  18651. 517.94 s [algebraic-graphs] OK: connects [x] == x
  18652. 517.94 s [algebraic-graphs] OK: connects [x,y] == connect x y
  18653. 517.94 s [algebraic-graphs] OK: connects == foldr connect empty
  18654. 517.94 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  18655. 517.94 s [algebraic-graphs]
  18656. 517.94 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  18657. 517.94 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  18658. 517.94 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  18659. 517.94 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  18660. 517.94 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  18661. 517.94 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  18662. 517.94 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  18663. 517.94 s [algebraic-graphs]
  18664. 517.94 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  18665. 517.94 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  18666. 517.94 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  18667. 517.94 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  18668. 517.94 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  18669. 517.94 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  18670. 517.94 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  18671. 517.94 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  18672. 517.94 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  18673. 517.94 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  18674. 518.65 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  18675. 518.65 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  18676. 518.65 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  18677. 518.65 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  18678. 518.65 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  18679. 518.65 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  18680. 518.65 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  18681. 518.65 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  18682. 518.65 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  18683. 518.65 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  18684. 518.65 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  18685. 518.65 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  18686. 518.65 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  18687. 518.65 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  18688. 518.65 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  18689. 518.65 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  18690. 518.65 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  18691. 518.65 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  18692. 518.65 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  18693. 518.65 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  18694. 518.65 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  18695. 518.65 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  18696. 518.65 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  18697. 518.65 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  18698. 518.65 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  18699. 518.65 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  18700. 518.65 s [algebraic-graphs]
  18701. 518.65 s [algebraic-graphs] ============ Graph.foldg ============
  18702. 518.65 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  18703. 518.65 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  18704. 518.65 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  18705. 518.65 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  18706. 518.65 s [algebraic-graphs]
  18707. 518.65 s [algebraic-graphs] ============ Graph.isEmpty ============
  18708. 518.65 s [algebraic-graphs] OK: isEmpty empty == True
  18709. 518.65 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  18710. 518.65 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18711. 518.65 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  18712. 518.65 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  18713. 518.65 s [algebraic-graphs]
  18714. 518.65 s [algebraic-graphs] ============ Graph.hasVertex ============
  18715. 518.65 s [algebraic-graphs] OK: hasVertex x empty == False
  18716. 518.65 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18717. 518.65 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  18718. 518.65 s [algebraic-graphs]
  18719. 518.65 s [algebraic-graphs] ============ Graph.hasEdge ============
  18720. 518.65 s [algebraic-graphs] OK: hasEdge x y empty == False
  18721. 518.65 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  18722. 518.66 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18723. 518.66 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  18724. 518.66 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  18725. 518.66 s [algebraic-graphs]
  18726. 518.66 s [algebraic-graphs] ============ Graph.vertexCount ============
  18727. 518.66 s [algebraic-graphs] OK: vertexCount empty == 0
  18728. 518.66 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18729. 518.66 s [algebraic-graphs] OK: vertexCount == length . vertexList
  18730. 518.66 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  18731. 518.66 s [algebraic-graphs]
  18732. 518.66 s [algebraic-graphs] ============ Graph.edgeCount ============
  18733. 518.66 s [algebraic-graphs] OK: edgeCount empty == 0
  18734. 518.66 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18735. 518.66 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18736. 518.66 s [algebraic-graphs] OK: edgeCount == length . edgeList
  18737. 518.66 s [algebraic-graphs]
  18738. 518.66 s [algebraic-graphs] ============ Graph.vertexList ============
  18739. 518.66 s [algebraic-graphs] OK: vertexList empty == []
  18740. 518.66 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  18741. 518.66 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  18742. 518.66 s [algebraic-graphs]
  18743. 518.66 s [algebraic-graphs] ============ Graph.vertexSet ============
  18744. 518.66 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  18745. 518.66 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  18746. 518.66 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18747. 518.66 s [algebraic-graphs]
  18748. 518.66 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  18749. 518.66 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  18750. 518.66 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  18751. 518.66 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  18752. 518.66 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  18753. 518.66 s [algebraic-graphs]
  18754. 518.66 s [algebraic-graphs] ============ Graph.edgeList ============
  18755. 518.66 s [algebraic-graphs] OK: edgeList empty == []
  18756. 518.66 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18757. 518.66 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  18758. 518.66 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  18759. 518.66 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  18760. 518.66 s [algebraic-graphs]
  18761. 518.66 s [algebraic-graphs] ============ Graph.edgeSet ============
  18762. 518.66 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  18763. 518.66 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18764. 518.66 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  18765. 518.66 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  18766. 518.66 s [algebraic-graphs]
  18767. 518.66 s [algebraic-graphs] ============ Graph.adjacencyList ============
  18768. 518.66 s [algebraic-graphs] OK: adjacencyList empty == []
  18769. 518.66 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  18770. 518.66 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  18771. 518.66 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  18772. 518.66 s [algebraic-graphs]
  18773. 518.66 s [algebraic-graphs] ============ Graph.preSet ============
  18774. 518.66 s [algebraic-graphs] OK: preSet x empty == Set.empty
  18775. 518.66 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  18776. 518.66 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  18777. 518.66 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  18778. 518.66 s [algebraic-graphs]
  18779. 518.66 s [algebraic-graphs] ============ Graph.preIntSet ============
  18780. 518.66 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  18781. 518.66 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  18782. 518.66 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  18783. 518.66 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  18784. 518.66 s [algebraic-graphs]
  18785. 518.66 s [algebraic-graphs] ============ Graph.postSet ============
  18786. 518.66 s [algebraic-graphs] OK: postSet x empty == Set.empty
  18787. 518.66 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  18788. 518.66 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  18789. 518.66 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  18790. 518.66 s [algebraic-graphs]
  18791. 518.66 s [algebraic-graphs] ============ Graph.postIntSet ============
  18792. 518.66 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  18793. 518.66 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  18794. 518.66 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  18795. 518.66 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  18796. 518.66 s [algebraic-graphs]
  18797. 518.66 s [algebraic-graphs] ============ Graph.size ============
  18798. 518.66 s [algebraic-graphs] OK: size empty == 1
  18799. 518.66 s [algebraic-graphs] OK: size (vertex x) == 1
  18800. 518.66 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  18801. 518.66 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  18802. 518.66 s [algebraic-graphs] OK: size x >= 1
  18803. 518.66 s [algebraic-graphs] OK: size x >= vertexCount x
  18804. 518.66 s [algebraic-graphs]
  18805. 518.66 s [algebraic-graphs] ============ Graph.path ============
  18806. 518.66 s [algebraic-graphs] OK: path [] == empty
  18807. 518.66 s [algebraic-graphs] OK: path [x] == vertex x
  18808. 518.66 s [algebraic-graphs] OK: path [x,y] == edge x y
  18809. 518.66 s [algebraic-graphs]
  18810. 518.66 s [algebraic-graphs] ============ Graph.circuit ============
  18811. 518.66 s [algebraic-graphs] OK: circuit [] == empty
  18812. 518.66 s [algebraic-graphs] OK: circuit [x] == edge x x
  18813. 518.66 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  18814. 518.66 s [algebraic-graphs]
  18815. 518.66 s [algebraic-graphs] ============ Graph.clique ============
  18816. 518.66 s [algebraic-graphs] OK: clique [] == empty
  18817. 518.66 s [algebraic-graphs] OK: clique [x] == vertex x
  18818. 518.66 s [algebraic-graphs] OK: clique [x,y] == edge x y
  18819. 518.66 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  18820. 518.66 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  18821. 518.66 s [algebraic-graphs]
  18822. 518.66 s [algebraic-graphs] ============ Graph.biclique ============
  18823. 518.66 s [algebraic-graphs] OK: biclique [] [] == empty
  18824. 518.66 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  18825. 518.66 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  18826. 518.66 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  18827. 518.66 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  18828. 518.66 s [algebraic-graphs]
  18829. 518.66 s [algebraic-graphs] ============ Graph.star ============
  18830. 518.66 s [algebraic-graphs] OK: star x [] == vertex x
  18831. 518.66 s [algebraic-graphs] OK: star x [y] == edge x y
  18832. 518.66 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18833. 518.66 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  18834. 518.66 s [algebraic-graphs]
  18835. 518.66 s [algebraic-graphs] ============ Graph.stars ============
  18836. 518.66 s [algebraic-graphs] OK: stars [] == empty
  18837. 518.66 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  18838. 518.66 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  18839. 518.66 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  18840. 518.66 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  18841. 518.66 s [algebraic-graphs] OK: stars . adjacencyList == id
  18842. 518.66 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  18843. 518.66 s [algebraic-graphs]
  18844. 518.66 s [algebraic-graphs] ============ Graph.tree ============
  18845. 518.66 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  18846. 518.66 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  18847. 518.66 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  18848. 518.66 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  18849. 518.66 s [algebraic-graphs]
  18850. 518.66 s [algebraic-graphs] ============ Graph.forest ============
  18851. 518.66 s [algebraic-graphs] OK: forest [] == empty
  18852. 518.66 s [algebraic-graphs] OK: forest [x] == tree x
  18853. 518.66 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  18854. 518.66 s [algebraic-graphs] OK: forest == overlays . map tree
  18855. 518.66 s [algebraic-graphs]
  18856. 518.66 s [algebraic-graphs] ============ Graph.removeVertex ============
  18857. 522.20 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  18858. 522.20 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  18859. 522.20 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  18860. 522.34 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  18861. 522.34 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  18862. 522.34 s [algebraic-graphs]
  18863. 522.34 s [algebraic-graphs] ============ Graph.removeEdge ============
  18864. 522.34 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  18865. 522.34 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18866. 522.34 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  18867. 522.34 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  18868. 522.34 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  18869. 522.34 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  18870. 522.34 s [algebraic-graphs]
  18871. 522.35 s [algebraic-graphs] ============ Graph.replaceVertex ============
  18872. 522.35 s [algebraic-graphs] OK: replaceVertex x x == id
  18873. 522.35 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  18874. 522.35 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  18875. 522.35 s [algebraic-graphs]
  18876. 522.35 s [algebraic-graphs] ============ Graph.mergeVertices ============
  18877. 522.35 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  18878. 522.35 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  18879. 522.35 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  18880. 522.35 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  18881. 522.35 s [algebraic-graphs]
  18882. 522.35 s [algebraic-graphs] ============ Graph.transpose ============
  18883. 522.35 s [algebraic-graphs] OK: transpose empty == empty
  18884. 522.35 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  18885. 522.35 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  18886. 522.35 s [algebraic-graphs] OK: transpose . transpose == id
  18887. 522.35 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  18888. 522.35 s [algebraic-graphs]
  18889. 522.35 s [algebraic-graphs] ============ Graph.gmap ============
  18890. 522.35 s [algebraic-graphs] OK: gmap f empty == empty
  18891. 522.35 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  18892. 522.35 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  18893. 522.35 s [algebraic-graphs] OK: gmap id == id
  18894. 522.35 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  18895. 522.35 s [algebraic-graphs]
  18896. 522.35 s [algebraic-graphs] ============ Graph.induce ============
  18897. 522.35 s [algebraic-graphs] OK: induce (const True ) x == x
  18898. 522.35 s [algebraic-graphs] OK: induce (const False) x == empty
  18899. 522.35 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  18900. 522.35 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  18901. 522.35 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  18902. 522.35 s [algebraic-graphs]
  18903. 522.35 s [algebraic-graphs] ============ Graph.induceJust ============
  18904. 522.35 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  18905. 522.35 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  18906. 522.35 s [algebraic-graphs] OK: induceJust . gmap Just == id
  18907. 522.35 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  18908. 522.35 s [algebraic-graphs]
  18909. 522.35 s [algebraic-graphs] ============ Graph.compose ============
  18910. 522.35 s [algebraic-graphs] OK: compose empty x == empty
  18911. 522.35 s [algebraic-graphs] OK: compose x empty == empty
  18912. 522.35 s [algebraic-graphs] OK: compose (vertex x) y == empty
  18913. 522.35 s [algebraic-graphs] OK: compose x (vertex y) == empty
  18914. 522.35 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  18915. 522.35 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  18916. 522.35 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  18917. 522.35 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  18918. 522.35 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  18919. 522.35 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  18920. 522.35 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  18921. 522.35 s [algebraic-graphs]
  18922. 522.35 s [algebraic-graphs] ============ Graph.(===) ============
  18923. 522.35 s [algebraic-graphs] OK: x === x == True
  18924. 522.35 s [algebraic-graphs] OK: x === x + empty == False
  18925. 522.35 s [algebraic-graphs] OK: x + y === x + y == True
  18926. 522.35 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  18927. 522.35 s [algebraic-graphs] OK: x + y === x * y == False
  18928. 522.35 s [algebraic-graphs]
  18929. 522.35 s [algebraic-graphs] ============ Graph.mesh ============
  18930. 522.35 s [algebraic-graphs] OK: mesh xs [] == empty
  18931. 522.35 s [algebraic-graphs] OK: mesh [] ys == empty
  18932. 522.35 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  18933. 522.35 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  18934. 522.35 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  18935. 522.35 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  18936. 522.35 s [algebraic-graphs]
  18937. 522.35 s [algebraic-graphs] ============ Graph.torus ============
  18938. 522.35 s [algebraic-graphs] OK: torus xs [] == empty
  18939. 522.35 s [algebraic-graphs] OK: torus [] ys == empty
  18940. 522.35 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  18941. 522.35 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  18942. 522.35 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  18943. 522.35 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  18944. 522.35 s [algebraic-graphs]
  18945. 522.35 s [algebraic-graphs] ============ Graph.deBruijn ============
  18946. 522.35 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  18947. 522.35 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  18948. 522.35 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  18949. 522.35 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  18950. 522.35 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  18951. 522.35 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  18952. 522.35 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  18953. 522.35 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  18954. 522.35 s [algebraic-graphs]
  18955. 522.35 s [algebraic-graphs] ============ Graph.splitVertex ============
  18956. 522.35 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  18957. 522.35 s [algebraic-graphs] OK: splitVertex x [x] == id
  18958. 522.35 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  18959. 522.35 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  18960. 522.35 s [algebraic-graphs]
  18961. 522.35 s [algebraic-graphs] ============ Graph.bind ============
  18962. 522.35 s [algebraic-graphs] OK: bind empty f == empty
  18963. 522.35 s [algebraic-graphs] OK: bind (vertex x) f == f x
  18964. 522.35 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  18965. 522.35 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  18966. 522.35 s [algebraic-graphs] OK: bind x (const empty) == empty
  18967. 522.35 s [algebraic-graphs] OK: bind x vertex == x
  18968. 522.35 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  18969. 522.35 s [algebraic-graphs]
  18970. 522.35 s [algebraic-graphs] ============ Graph.simplify ============
  18971. 522.35 s [algebraic-graphs] OK: simplify == id
  18972. 522.35 s [algebraic-graphs] OK: size (simplify x) <= size x
  18973. 522.35 s [algebraic-graphs]
  18974. 522.35 s [algebraic-graphs] ============ Graph.box ============
  18975. 522.35 s [algebraic-graphs] OK: box x y ~~ box y x
  18976. 522.35 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  18977. 522.35 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  18978. 522.35 s [algebraic-graphs] OK: box x empty ~~ empty
  18979. 522.35 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18980. 522.35 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  18981. 522.35 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  18982. 522.35 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  18983. 522.35 s [algebraic-graphs]
  18984. 522.35 s [algebraic-graphs] ============ Graph.sparsify ============
  18985. 522.35 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  18986. 522.35 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  18987. 522.35 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  18988. 522.35 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  18989. 522.35 s [algebraic-graphs]
  18990. 522.35 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  18991. 522.35 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  18992. 522.35 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  18993. 522.35 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  18994. 522.35 s [algebraic-graphs]
  18995. 522.35 s [algebraic-graphs] ============ Graph.context ============
  18996. 522.35 s [algebraic-graphs] OK: context (const False) x == Nothing
  18997. 522.35 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  18998. 522.35 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  18999. 522.35 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  19000. 522.35 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  19001. 522.35 s [algebraic-graphs]
  19002. 522.35 s [algebraic-graphs] ============ Graph.buildg ============
  19003. 522.35 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  19004. 522.35 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  19005. 522.35 s [algebraic-graphs] OK: buildg (\e v o c -> o (foldg e v o c x) (foldg e v o c y)) == overlay x y
  19006. 522.35 s [algebraic-graphs] OK: buildg (\e v o c -> c (foldg e v o c x) (foldg e v o c y)) == connect x y
  19007. 522.35 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  19008. 522.35 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  19009. 522.35 s [algebraic-graphs]
  19010. 522.35 s [algebraic-graphs] ============ Internal.List ============
  19011. 522.35 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  19012. 522.35 s [algebraic-graphs]
  19013. 522.35 s [algebraic-graphs] ============ Graph.Label ============
  19014. 522.35 s [algebraic-graphs]
  19015. 522.35 s [algebraic-graphs] ============ Any: instances ============
  19016. 522.35 s [algebraic-graphs] OK: Semiring
  19017. 522.35 s [algebraic-graphs] OK: StarSemiring
  19018. 522.35 s [algebraic-graphs] OK: Dioid
  19019. 522.35 s [algebraic-graphs]
  19020. 522.35 s [algebraic-graphs] ============ Distance Int: instances ============
  19021. 522.35 s [algebraic-graphs] OK: Semiring
  19022. 522.35 s [algebraic-graphs] OK: StarSemiring
  19023. 522.35 s [algebraic-graphs] OK: Dioid
  19024. 522.35 s [algebraic-graphs]
  19025. 522.35 s [algebraic-graphs] ============ Capacity Int: instances ============
  19026. 522.35 s [algebraic-graphs] OK: Semiring
  19027. 522.35 s [algebraic-graphs] OK: StarSemiring
  19028. 522.35 s [algebraic-graphs] OK: Dioid
  19029. 522.35 s [algebraic-graphs]
  19030. 522.35 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  19031. 522.35 s [algebraic-graphs] OK: LeftNearRing
  19032. 522.35 s [algebraic-graphs]
  19033. 522.35 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  19034. 522.35 s [algebraic-graphs] OK: Semiring
  19035. 522.35 s [algebraic-graphs] OK: Dioid
  19036. 522.35 s [algebraic-graphs]
  19037. 522.35 s [algebraic-graphs] ============ Count Int: instances ============
  19038. 522.35 s [algebraic-graphs] OK: Semiring
  19039. 522.35 s [algebraic-graphs] OK: StarSemiring
  19040. 522.35 s [algebraic-graphs]
  19041. 522.35 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  19042. 522.35 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  19043. 522.35 s [algebraic-graphs] OK: empty
  19044. 522.35 s [algebraic-graphs] OK: vertex
  19045. 522.35 s [algebraic-graphs] OK: edge
  19046. 522.35 s [algebraic-graphs] OK: overlay
  19047. 522.35 s [algebraic-graphs] OK: connect
  19048. 522.35 s [algebraic-graphs] OK: vertices
  19049. 522.35 s [algebraic-graphs] OK: edges
  19050. 522.35 s [algebraic-graphs] OK: overlays
  19051. 522.35 s [algebraic-graphs] OK: fromAdjacencyMaps
  19052. 522.35 s [algebraic-graphs] OK: removeVertex
  19053. 522.35 s [algebraic-graphs] OK: removeEdge
  19054. 522.35 s [algebraic-graphs] OK: replaceVertex
  19055. 522.35 s [algebraic-graphs] OK: replaceEdge
  19056. 522.35 s [algebraic-graphs] OK: transpose
  19057. 522.35 s [algebraic-graphs] OK: gmap
  19058. 522.35 s [algebraic-graphs] OK: emap
  19059. 522.35 s [algebraic-graphs] OK: induce
  19060. 522.35 s [algebraic-graphs] OK: closure
  19061. 522.35 s [algebraic-graphs] OK: reflexiveClosure
  19062. 522.35 s [algebraic-graphs] OK: symmetricClosure
  19063. 522.35 s [algebraic-graphs] OK: transitiveClosure
  19064. 522.35 s [algebraic-graphs]
  19065. 522.35 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  19066. 522.35 s [algebraic-graphs] OK: isEmpty empty == True
  19067. 522.35 s [algebraic-graphs] OK: hasVertex x empty == False
  19068. 522.35 s [algebraic-graphs] OK: vertexCount empty == 0
  19069. 522.35 s [algebraic-graphs] OK: edgeCount empty == 0
  19070. 522.35 s [algebraic-graphs]
  19071. 522.35 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  19072. 522.35 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19073. 522.35 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19074. 522.35 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19075. 522.35 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19076. 522.35 s [algebraic-graphs]
  19077. 524.86 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  19078. 524.86 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  19079. 524.86 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  19080. 524.86 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  19081. 524.86 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19082. 524.86 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  19083. 524.86 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  19084. 524.86 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  19085. 524.86 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  19086. 524.86 s [algebraic-graphs]
  19087. 524.86 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  19088. 524.86 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19089. 524.86 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19090. 524.86 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19091. 524.86 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19092. 524.86 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19093. 524.86 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19094. 524.86 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19095. 524.86 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19096. 524.86 s [algebraic-graphs]
  19097. 524.86 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  19098. 524.86 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  19099. 524.86 s [algebraic-graphs]
  19100. 524.86 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  19101. 524.86 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  19102. 524.86 s [algebraic-graphs]
  19103. 524.86 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  19104. 524.86 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  19105. 524.86 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  19106. 524.86 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  19107. 524.86 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  19108. 524.86 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19109. 524.86 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  19110. 524.86 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  19111. 524.86 s [algebraic-graphs]
  19112. 524.86 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  19113. 524.86 s [algebraic-graphs] OK: vertices [] == empty
  19114. 524.86 s [algebraic-graphs] OK: vertices [x] == vertex x
  19115. 524.86 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19116. 524.86 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19117. 524.86 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19118. 524.86 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19119. 524.86 s [algebraic-graphs]
  19120. 524.86 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  19121. 524.86 s [algebraic-graphs] OK: edges [] == empty
  19122. 524.86 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  19123. 524.86 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  19124. 524.86 s [algebraic-graphs]
  19125. 524.86 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  19126. 524.86 s [algebraic-graphs] OK: overlays [] == empty
  19127. 524.86 s [algebraic-graphs] OK: overlays [x] == x
  19128. 524.86 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19129. 524.86 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19130. 524.86 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19131. 524.86 s [algebraic-graphs]
  19132. 524.86 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  19133. 524.86 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  19134. 524.86 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  19135. 524.86 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  19136. 524.86 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  19137. 524.86 s [algebraic-graphs]
  19138. 524.86 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  19139. 524.86 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19140. 524.86 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19141. 524.86 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19142. 524.86 s [algebraic-graphs]
  19143. 524.86 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  19144. 524.86 s [algebraic-graphs] OK: isEmpty empty == True
  19145. 524.86 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19146. 524.86 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19147. 524.86 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19148. 524.86 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  19149. 524.86 s [algebraic-graphs]
  19150. 524.86 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  19151. 524.86 s [algebraic-graphs] OK: hasVertex x empty == False
  19152. 524.86 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19153. 524.86 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19154. 524.86 s [algebraic-graphs]
  19155. 524.86 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  19156. 524.86 s [algebraic-graphs] OK: hasEdge x y empty == False
  19157. 524.86 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19158. 524.86 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  19159. 524.86 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19160. 524.86 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  19161. 524.86 s [algebraic-graphs]
  19162. 524.86 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  19163. 524.86 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  19164. 524.86 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  19165. 524.86 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19166. 524.86 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  19167. 524.86 s [algebraic-graphs]
  19168. 524.86 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  19169. 524.86 s [algebraic-graphs] OK: vertexCount empty == 0
  19170. 524.86 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19171. 524.86 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19172. 524.87 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19173. 524.87 s [algebraic-graphs]
  19174. 524.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  19175. 524.87 s [algebraic-graphs] OK: edgeCount empty == 0
  19176. 524.87 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19177. 524.87 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  19178. 524.87 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19179. 524.87 s [algebraic-graphs]
  19180. 524.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  19181. 524.87 s [algebraic-graphs] OK: vertexList empty == []
  19182. 524.87 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19183. 524.87 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19184. 524.87 s [algebraic-graphs]
  19185. 524.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  19186. 524.87 s [algebraic-graphs] OK: edgeList empty == []
  19187. 524.87 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19188. 524.87 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  19189. 524.87 s [algebraic-graphs]
  19190. 524.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  19191. 524.87 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19192. 524.87 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19193. 524.87 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19194. 524.87 s [algebraic-graphs]
  19195. 524.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  19196. 524.87 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19197. 524.87 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19198. 524.87 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  19199. 524.87 s [algebraic-graphs]
  19200. 524.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  19201. 524.87 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19202. 524.87 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19203. 524.87 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  19204. 524.87 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  19205. 524.87 s [algebraic-graphs]
  19206. 524.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  19207. 524.87 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19208. 524.87 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19209. 524.87 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  19210. 524.87 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  19211. 524.87 s [algebraic-graphs]
  19212. 524.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  19213. 524.87 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  19214. 524.87 s [algebraic-graphs]
  19215. 524.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  19216. 524.87 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19217. 524.87 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19218. 524.87 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  19219. 524.87 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  19220. 524.87 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19221. 524.87 s [algebraic-graphs]
  19222. 524.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  19223. 524.87 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  19224. 524.87 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19225. 524.87 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19226. 524.87 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19227. 524.87 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19228. 524.87 s [algebraic-graphs]
  19229. 524.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  19230. 524.87 s [algebraic-graphs] OK: replaceVertex x x == id
  19231. 524.87 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19232. 524.87 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  19233. 524.87 s [algebraic-graphs]
  19234. 524.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  19235. 524.87 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  19236. 524.87 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  19237. 524.87 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  19238. 524.87 s [algebraic-graphs]
  19239. 524.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  19240. 524.87 s [algebraic-graphs] OK: transpose empty == empty
  19241. 524.87 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19242. 524.87 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  19243. 524.87 s [algebraic-graphs] OK: transpose . transpose == id
  19244. 524.87 s [algebraic-graphs]
  19245. 524.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  19246. 524.87 s [algebraic-graphs] OK: gmap f empty == empty
  19247. 524.87 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  19248. 524.87 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  19249. 524.87 s [algebraic-graphs] OK: gmap id == id
  19250. 524.87 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  19251. 524.87 s [algebraic-graphs]
  19252. 524.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  19253. 524.87 s [algebraic-graphs] OK: emap h empty == empty
  19254. 524.87 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  19255. 524.87 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  19256. 524.87 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  19257. 524.87 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  19258. 524.87 s [algebraic-graphs] OK: emap id == id
  19259. 524.87 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  19260. 524.87 s [algebraic-graphs]
  19261. 524.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  19262. 524.87 s [algebraic-graphs] OK: induce (const True ) x == x
  19263. 524.87 s [algebraic-graphs] OK: induce (const False) x == empty
  19264. 524.87 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19265. 524.87 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19266. 524.87 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19267. 524.87 s [algebraic-graphs]
  19268. 524.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  19269. 526.12 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19270. 526.12 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19271. 526.12 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19272. 526.12 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19273. 526.12 s [algebraic-graphs]
  19274. 526.12 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  19275. 526.12 s [algebraic-graphs] OK: closure empty == empty
  19276. 526.12 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  19277. 526.12 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  19278. 526.12 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19279. 526.12 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  19280. 526.12 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  19281. 526.12 s [algebraic-graphs] OK: closure . closure == closure
  19282. 526.12 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  19283. 526.12 s [algebraic-graphs]
  19284. 526.12 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  19285. 526.12 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  19286. 526.12 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  19287. 526.12 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  19288. 526.12 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19289. 526.12 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  19290. 526.12 s [algebraic-graphs]
  19291. 526.12 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  19292. 526.12 s [algebraic-graphs] OK: symmetricClosure empty == empty
  19293. 526.12 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  19294. 526.12 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  19295. 526.12 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  19296. 526.12 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  19297. 526.12 s [algebraic-graphs]
  19298. 526.12 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  19299. 526.12 s [algebraic-graphs] OK: transitiveClosure empty == empty
  19300. 526.12 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19301. 526.12 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  19302. 526.12 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19303. 526.12 s [algebraic-graphs]
  19304. 526.12 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  19305. 526.12 s [algebraic-graphs] OK: isEmpty empty == True
  19306. 526.12 s [algebraic-graphs] OK: hasVertex x empty == False
  19307. 526.12 s [algebraic-graphs] OK: vertexCount empty == 0
  19308. 526.12 s [algebraic-graphs] OK: edgeCount empty == 0
  19309. 526.12 s [algebraic-graphs]
  19310. 526.12 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  19311. 526.12 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19312. 526.12 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19313. 526.12 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19314. 526.12 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19315. 526.12 s [algebraic-graphs]
  19316. 526.12 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  19317. 526.12 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  19318. 526.12 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  19319. 526.12 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  19320. 526.12 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19321. 526.12 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  19322. 526.12 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  19323. 526.12 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  19324. 526.12 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  19325. 526.12 s [algebraic-graphs]
  19326. 526.12 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  19327. 526.12 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19328. 526.12 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19329. 526.12 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19330. 526.12 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19331. 526.12 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19332. 526.12 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19333. 526.12 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19334. 526.12 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19335. 526.12 s [algebraic-graphs]
  19336. 526.12 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  19337. 526.12 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  19338. 526.12 s [algebraic-graphs]
  19339. 526.12 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  19340. 526.12 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  19341. 526.12 s [algebraic-graphs]
  19342. 526.12 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  19343. 526.12 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  19344. 526.12 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  19345. 526.12 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  19346. 526.12 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  19347. 526.12 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19348. 526.12 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  19349. 526.12 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  19350. 526.12 s [algebraic-graphs]
  19351. 526.12 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  19352. 526.12 s [algebraic-graphs] OK: vertices [] == empty
  19353. 526.12 s [algebraic-graphs] OK: vertices [x] == vertex x
  19354. 526.12 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19355. 526.12 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19356. 526.12 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19357. 526.12 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19358. 526.12 s [algebraic-graphs]
  19359. 526.12 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  19360. 526.12 s [algebraic-graphs] OK: edges [] == empty
  19361. 526.12 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  19362. 526.12 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  19363. 526.12 s [algebraic-graphs]
  19364. 526.12 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  19365. 526.12 s [algebraic-graphs] OK: overlays [] == empty
  19366. 526.12 s [algebraic-graphs] OK: overlays [x] == x
  19367. 526.12 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19368. 526.12 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19369. 526.12 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19370. 526.12 s [algebraic-graphs]
  19371. 526.12 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  19372. 526.12 s [algebraic-graphs] OK: foldg empty vertex connect == id
  19373. 526.12 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  19374. 526.12 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  19375. 526.12 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  19376. 526.12 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  19377. 526.12 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  19378. 526.12 s [algebraic-graphs]
  19379. 526.12 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  19380. 526.12 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  19381. 526.12 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  19382. 526.12 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  19383. 526.12 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  19384. 526.12 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  19385. 526.12 s [algebraic-graphs]
  19386. 526.12 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  19387. 526.12 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19388. 526.12 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19389. 526.12 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19390. 526.12 s [algebraic-graphs]
  19391. 526.12 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  19392. 526.12 s [algebraic-graphs] OK: isEmpty empty == True
  19393. 526.12 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19394. 526.12 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19395. 526.12 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19396. 526.12 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  19397. 526.12 s [algebraic-graphs]
  19398. 526.12 s [algebraic-graphs] ============ Labelled.Graph.size ============
  19399. 526.12 s [algebraic-graphs] OK: size empty == 1
  19400. 526.12 s [algebraic-graphs] OK: size (vertex x) == 1
  19401. 526.12 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  19402. 526.12 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  19403. 526.12 s [algebraic-graphs] OK: size x >= 1
  19404. 526.12 s [algebraic-graphs] OK: size x >= vertexCount x
  19405. 526.12 s [algebraic-graphs]
  19406. 526.12 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  19407. 526.12 s [algebraic-graphs] OK: hasVertex x empty == False
  19408. 526.12 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19409. 526.12 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19410. 526.12 s [algebraic-graphs]
  19411. 526.12 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  19412. 526.12 s [algebraic-graphs] OK: hasEdge x y empty == False
  19413. 526.12 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19414. 526.12 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  19415. 526.12 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19416. 526.12 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  19417. 526.12 s [algebraic-graphs]
  19418. 526.12 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  19419. 526.12 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  19420. 526.12 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  19421. 526.12 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19422. 526.12 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  19423. 526.12 s [algebraic-graphs]
  19424. 526.12 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  19425. 526.12 s [algebraic-graphs] OK: vertexCount empty == 0
  19426. 526.12 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19427. 526.12 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19428. 526.12 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19429. 526.12 s [algebraic-graphs]
  19430. 526.12 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  19431. 526.12 s [algebraic-graphs] OK: edgeCount empty == 0
  19432. 526.12 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19433. 526.12 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  19434. 526.12 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19435. 526.12 s [algebraic-graphs]
  19436. 526.12 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  19437. 526.12 s [algebraic-graphs] OK: vertexList empty == []
  19438. 526.12 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19439. 526.12 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19440. 526.12 s [algebraic-graphs]
  19441. 526.12 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  19442. 526.12 s [algebraic-graphs] OK: edgeList empty == []
  19443. 526.13 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19444. 526.13 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  19445. 526.13 s [algebraic-graphs]
  19446. 526.13 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  19447. 526.13 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19448. 526.13 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19449. 526.13 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19450. 526.13 s [algebraic-graphs]
  19451. 526.13 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  19452. 526.13 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19453. 526.13 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19454. 526.13 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  19455. 526.13 s [algebraic-graphs]
  19456. 526.13 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  19457. 526.13 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19458. 526.13 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19459. 528.96 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  19460. 529.10 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  19461. 529.10 s [algebraic-graphs]
  19462. 529.10 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  19463. 529.10 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19464. 529.10 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19465. 529.10 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  19466. 529.10 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  19467. 529.10 s [algebraic-graphs]
  19468. 529.10 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  19469. 529.10 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19470. 529.10 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19471. 529.10 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  19472. 529.10 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  19473. 529.10 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19474. 529.10 s [algebraic-graphs]
  19475. 529.10 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  19476. 529.10 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  19477. 529.10 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19478. 529.10 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19479. 529.10 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19480. 529.10 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19481. 529.10 s [algebraic-graphs]
  19482. 529.10 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  19483. 529.10 s [algebraic-graphs] OK: replaceVertex x x == id
  19484. 529.10 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19485. 529.10 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  19486. 529.10 s [algebraic-graphs]
  19487. 529.10 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  19488. 529.10 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  19489. 529.10 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  19490. 529.10 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  19491. 529.10 s [algebraic-graphs]
  19492. 529.10 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  19493. 529.10 s [algebraic-graphs] OK: transpose empty == empty
  19494. 529.10 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19495. 529.10 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  19496. 529.10 s [algebraic-graphs] OK: transpose . transpose == id
  19497. 529.10 s [algebraic-graphs]
  19498. 529.10 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  19499. 529.10 s [algebraic-graphs] OK: fmap f empty == empty
  19500. 529.10 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  19501. 529.10 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  19502. 529.10 s [algebraic-graphs] OK: fmap id == id
  19503. 529.10 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  19504. 529.10 s [algebraic-graphs]
  19505. 529.10 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  19506. 529.10 s [algebraic-graphs] OK: emap h empty == empty
  19507. 529.10 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  19508. 529.10 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  19509. 529.10 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  19510. 529.10 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  19511. 529.10 s [algebraic-graphs] OK: emap id == id
  19512. 529.10 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  19513. 529.10 s [algebraic-graphs]
  19514. 529.10 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  19515. 529.10 s [algebraic-graphs] OK: induce (const True ) x == x
  19516. 529.10 s [algebraic-graphs] OK: induce (const False) x == empty
  19517. 529.10 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19518. 529.10 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19519. 529.10 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19520. 529.10 s [algebraic-graphs]
  19521. 529.10 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  19522. 529.10 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19523. 529.10 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19524. 529.10 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19525. 529.10 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19526. 529.10 s [algebraic-graphs]
  19527. 529.10 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  19528. 529.10 s [algebraic-graphs] OK: closure empty == empty
  19529. 529.10 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  19530. 529.10 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  19531. 529.10 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19532. 529.10 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  19533. 529.10 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  19534. 529.10 s [algebraic-graphs] OK: closure . closure == closure
  19535. 529.10 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  19536. 529.10 s [algebraic-graphs]
  19537. 529.10 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  19538. 529.10 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  19539. 529.10 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  19540. 529.10 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  19541. 529.10 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19542. 529.10 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  19543. 529.10 s [algebraic-graphs]
  19544. 529.10 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  19545. 529.10 s [algebraic-graphs] OK: symmetricClosure empty == empty
  19546. 529.10 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  19547. 529.10 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  19548. 529.10 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  19549. 529.10 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  19550. 529.10 s [algebraic-graphs]
  19551. 529.10 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  19552. 529.10 s [algebraic-graphs] OK: transitiveClosure empty == empty
  19553. 529.10 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19554. 529.10 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  19555. 529.10 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19556. 529.10 s [algebraic-graphs]
  19557. 529.10 s [algebraic-graphs] ============ Labelled.Graph.context ============
  19558. 529.10 s [algebraic-graphs] OK: context (const False) x == Nothing
  19559. 529.10 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  19560. 529.10 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  19561. 529.10 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  19562. 529.10 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  19563. 529.10 s [algebraic-graphs]
  19564. 529.10 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  19565. 529.10 s [algebraic-graphs] OK: Axioms of non-empty graphs
  19566. 529.10 s [algebraic-graphs] OK: Theorems of non-empty graphs
  19567. 529.10 s [algebraic-graphs]
  19568. 529.10 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  19569. 529.10 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19570. 529.10 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19571. 529.10 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19572. 529.10 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19573. 529.10 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19574. 529.10 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  19575. 529.10 s [algebraic-graphs] OK: x <= x + y
  19576. 529.10 s [algebraic-graphs] OK: x + y <= x * y
  19577. 529.10 s [algebraic-graphs]
  19578. 529.10 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  19579. 529.10 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  19580. 529.10 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  19581. 529.10 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  19582. 529.10 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  19583. 529.10 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  19584. 529.10 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  19585. 529.10 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  19586. 529.10 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  19587. 529.10 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  19588. 529.10 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  19589. 529.10 s [algebraic-graphs]
  19590. 529.10 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  19591. 529.10 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  19592. 529.11 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  19593. 529.11 s [algebraic-graphs]
  19594. 529.11 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  19595. 529.11 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  19596. 529.11 s [algebraic-graphs]
  19597. 529.11 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  19598. 529.11 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19599. 529.11 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19600. 529.11 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19601. 529.11 s [algebraic-graphs]
  19602. 529.11 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  19603. 529.11 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  19604. 529.11 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19605. 529.11 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19606. 529.11 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  19607. 529.11 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  19608. 529.11 s [algebraic-graphs]
  19609. 529.11 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  19610. 529.11 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19611. 529.11 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19612. 529.11 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19613. 529.11 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19614. 529.11 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19615. 529.11 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19616. 529.11 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19617. 529.11 s [algebraic-graphs]
  19618. 529.11 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  19619. 529.11 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  19620. 529.11 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  19621. 529.11 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  19622. 529.11 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  19623. 529.11 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  19624. 529.11 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  19625. 529.11 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19626. 529.11 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  19627. 529.11 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  19628. 529.11 s [algebraic-graphs]
  19629. 529.11 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  19630. 529.11 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  19631. 529.11 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  19632. 529.11 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  19633. 529.11 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  19634. 529.11 s [algebraic-graphs]
  19635. 529.11 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  19636. 529.11 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  19637. 529.11 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  19638. 529.11 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  19639. 529.11 s [algebraic-graphs]
  19640. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  19641. 532.33 s [algebraic-graphs] OK: overlays1 [x] == x
  19642. 532.33 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  19643. 532.33 s [algebraic-graphs]
  19644. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  19645. 532.33 s [algebraic-graphs] OK: connects1 [x] == x
  19646. 532.33 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  19647. 532.33 s [algebraic-graphs]
  19648. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  19649. 532.33 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  19650. 532.33 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  19651. 532.33 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  19652. 532.33 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19653. 532.33 s [algebraic-graphs]
  19654. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  19655. 532.33 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19656. 532.33 s [algebraic-graphs]
  19657. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  19658. 532.33 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19659. 532.33 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19660. 532.33 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19661. 532.33 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19662. 532.33 s [algebraic-graphs]
  19663. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  19664. 532.33 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19665. 532.33 s [algebraic-graphs] OK: vertexCount x >= 1
  19666. 532.33 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  19667. 532.33 s [algebraic-graphs]
  19668. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  19669. 532.33 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19670. 532.33 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19671. 532.33 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19672. 532.33 s [algebraic-graphs]
  19673. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  19674. 532.33 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  19675. 532.33 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  19676. 532.33 s [algebraic-graphs]
  19677. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  19678. 532.33 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19679. 532.33 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  19680. 532.33 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  19681. 532.33 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  19682. 532.33 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19683. 532.33 s [algebraic-graphs]
  19684. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  19685. 532.33 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19686. 532.33 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  19687. 532.33 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  19688. 532.33 s [algebraic-graphs]
  19689. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  19690. 532.33 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19691. 532.33 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  19692. 532.33 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  19693. 532.33 s [algebraic-graphs]
  19694. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  19695. 532.33 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19696. 532.33 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  19697. 532.33 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  19698. 532.33 s [algebraic-graphs]
  19699. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  19700. 532.33 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19701. 532.33 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  19702. 532.33 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  19703. 532.33 s [algebraic-graphs]
  19704. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  19705. 532.33 s [algebraic-graphs] OK: path1 [x] == vertex x
  19706. 532.33 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  19707. 532.33 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  19708. 532.33 s [algebraic-graphs]
  19709. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  19710. 532.33 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  19711. 532.33 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  19712. 532.33 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  19713. 532.33 s [algebraic-graphs]
  19714. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  19715. 532.33 s [algebraic-graphs] OK: clique1 [x] == vertex x
  19716. 532.33 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  19717. 532.33 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  19718. 532.33 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  19719. 532.33 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  19720. 532.33 s [algebraic-graphs]
  19721. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  19722. 532.33 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  19723. 532.33 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  19724. 532.33 s [algebraic-graphs]
  19725. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  19726. 532.33 s [algebraic-graphs] OK: star x [] == vertex x
  19727. 532.33 s [algebraic-graphs] OK: star x [y] == edge x y
  19728. 532.33 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  19729. 532.33 s [algebraic-graphs]
  19730. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  19731. 532.33 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  19732. 532.33 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  19733. 532.33 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  19734. 532.33 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  19735. 532.33 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  19736. 532.33 s [algebraic-graphs]
  19737. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  19738. 532.33 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  19739. 532.33 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  19740. 532.33 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  19741. 532.33 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  19742. 532.33 s [algebraic-graphs]
  19743. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  19744. 532.33 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  19745. 532.33 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  19746. 532.33 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  19747. 532.33 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  19748. 532.33 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  19749. 532.33 s [algebraic-graphs]
  19750. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  19751. 532.33 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  19752. 532.33 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19753. 532.33 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19754. 532.33 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19755. 532.33 s [algebraic-graphs]
  19756. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  19757. 532.33 s [algebraic-graphs] OK: replaceVertex x x == id
  19758. 532.33 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19759. 532.33 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  19760. 532.33 s [algebraic-graphs]
  19761. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  19762. 532.33 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  19763. 532.33 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  19764. 532.33 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  19765. 532.33 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  19766. 532.33 s [algebraic-graphs]
  19767. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  19768. 532.33 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19769. 532.33 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  19770. 532.33 s [algebraic-graphs] OK: transpose . transpose == id
  19771. 532.33 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19772. 532.33 s [algebraic-graphs]
  19773. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  19774. 532.33 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  19775. 532.33 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  19776. 532.33 s [algebraic-graphs] OK: gmap id == id
  19777. 532.33 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  19778. 532.33 s [algebraic-graphs]
  19779. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  19780. 532.33 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  19781. 532.33 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  19782. 532.33 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  19783. 532.33 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  19784. 532.33 s [algebraic-graphs]
  19785. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  19786. 532.33 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  19787. 532.33 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  19788. 532.33 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  19789. 532.33 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  19790. 532.33 s [algebraic-graphs]
  19791. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  19792. 532.33 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  19793. 532.33 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  19794. 532.33 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  19795. 532.33 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  19796. 532.33 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  19797. 532.33 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  19798. 532.33 s [algebraic-graphs] OK: closure . closure == closure
  19799. 532.33 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  19800. 532.33 s [algebraic-graphs]
  19801. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  19802. 532.33 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  19803. 532.33 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  19804. 532.33 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  19805. 532.33 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  19806. 532.33 s [algebraic-graphs]
  19807. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  19808. 532.33 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  19809. 532.33 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  19810. 532.33 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  19811. 532.33 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  19812. 532.33 s [algebraic-graphs]
  19813. 532.33 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  19814. 532.33 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19815. 532.33 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  19816. 532.33 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  19817. 532.33 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19818. 532.33 s [algebraic-graphs]
  19819. 532.33 s [algebraic-graphs] ============ NonEmpty.Graph.============
  19820. 532.33 s [algebraic-graphs] OK: Axioms of non-empty graphs
  19821. 532.33 s [algebraic-graphs] OK: Theorems of non-empty graphs
  19822. 532.33 s [algebraic-graphs]
  19823. 532.33 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  19824. 532.33 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19825. 532.33 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19826. 532.33 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19827. 532.33 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19828. 532.33 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19829. 532.33 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  19830. 532.33 s [algebraic-graphs] OK: x <= x + y
  19831. 532.33 s [algebraic-graphs] OK: x + y <= x * y
  19832. 532.33 s [algebraic-graphs]
  19833. 532.33 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  19834. 532.33 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  19835. 532.33 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  19836. 532.33 s [algebraic-graphs] OK: fmap id == id
  19837. 532.33 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  19838. 532.33 s [algebraic-graphs]
  19839. 532.33 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  19840. 532.33 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  19841. 533.80 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  19842. 533.80 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  19843. 533.80 s [algebraic-graphs] OK: (x >>= vertex) == x
  19844. 533.80 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  19845. 533.80 s [algebraic-graphs]
  19846. 533.80 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  19847. 533.80 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  19848. 533.80 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  19849. 533.80 s [algebraic-graphs]
  19850. 533.80 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  19851. 533.80 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19852. 533.80 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19853. 533.80 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19854. 533.80 s [algebraic-graphs] OK: size (vertex x) == 1
  19855. 533.80 s [algebraic-graphs]
  19856. 533.80 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  19857. 533.80 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  19858. 533.80 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19859. 533.80 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19860. 533.80 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  19861. 533.80 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  19862. 533.80 s [algebraic-graphs]
  19863. 533.80 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  19864. 533.80 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19865. 533.80 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19866. 533.80 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19867. 533.80 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19868. 533.80 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19869. 533.80 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  19870. 533.80 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19871. 533.80 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19872. 533.80 s [algebraic-graphs]
  19873. 533.80 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  19874. 533.80 s [algebraic-graphs] OK: overlay1 empty x == x
  19875. 533.80 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  19876. 533.80 s [algebraic-graphs]
  19877. 533.80 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  19878. 533.80 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  19879. 533.80 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  19880. 533.80 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  19881. 533.80 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  19882. 533.80 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  19883. 533.81 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  19884. 533.81 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19885. 533.81 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  19886. 533.81 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  19887. 533.81 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  19888. 533.81 s [algebraic-graphs]
  19889. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  19890. 533.81 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  19891. 533.81 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  19892. 533.81 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  19893. 533.81 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  19894. 533.81 s [algebraic-graphs]
  19895. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  19896. 533.81 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  19897. 533.81 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  19898. 533.81 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  19899. 533.81 s [algebraic-graphs]
  19900. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  19901. 533.81 s [algebraic-graphs] OK: overlays1 [x] == x
  19902. 533.81 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  19903. 533.81 s [algebraic-graphs]
  19904. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  19905. 533.81 s [algebraic-graphs] OK: connects1 [x] == x
  19906. 533.81 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  19907. 533.81 s [algebraic-graphs]
  19908. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  19909. 533.81 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  19910. 533.81 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  19911. 533.81 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  19912. 533.81 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  19913. 533.81 s [algebraic-graphs]
  19914. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  19915. 533.81 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  19916. 533.81 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  19917. 533.81 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  19918. 533.81 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19919. 533.81 s [algebraic-graphs]
  19920. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  19921. 533.81 s [algebraic-graphs] OK: x === x == True
  19922. 533.81 s [algebraic-graphs] OK: x + y === x + y == True
  19923. 533.81 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  19924. 533.81 s [algebraic-graphs] OK: x + y === x * y == False
  19925. 533.81 s [algebraic-graphs]
  19926. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  19927. 533.81 s [algebraic-graphs] OK: size (vertex x) == 1
  19928. 533.81 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  19929. 533.81 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  19930. 533.81 s [algebraic-graphs] OK: size x >= 1
  19931. 533.81 s [algebraic-graphs] OK: size x >= vertexCount x
  19932. 533.81 s [algebraic-graphs]
  19933. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  19934. 533.81 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19935. 533.81 s [algebraic-graphs]
  19936. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  19937. 533.81 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19938. 533.81 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19939. 533.81 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19940. 533.81 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19941. 533.81 s [algebraic-graphs]
  19942. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  19943. 533.81 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19944. 533.81 s [algebraic-graphs] OK: vertexCount x >= 1
  19945. 533.81 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  19946. 533.81 s [algebraic-graphs]
  19947. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  19948. 533.81 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19949. 533.81 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19950. 533.81 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19951. 533.81 s [algebraic-graphs]
  19952. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  19953. 533.81 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  19954. 533.81 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  19955. 533.81 s [algebraic-graphs]
  19956. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  19957. 533.81 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19958. 533.81 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  19959. 533.81 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  19960. 533.81 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  19961. 533.81 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19962. 533.81 s [algebraic-graphs]
  19963. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  19964. 533.81 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19965. 533.81 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  19966. 533.81 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  19967. 533.81 s [algebraic-graphs]
  19968. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  19969. 533.81 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19970. 533.81 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  19971. 533.81 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  19972. 533.81 s [algebraic-graphs]
  19973. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  19974. 533.81 s [algebraic-graphs] OK: path1 [x] == vertex x
  19975. 533.81 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  19976. 533.81 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  19977. 533.81 s [algebraic-graphs]
  19978. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  19979. 533.81 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  19980. 533.81 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  19981. 533.81 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  19982. 533.81 s [algebraic-graphs]
  19983. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  19984. 533.81 s [algebraic-graphs] OK: clique1 [x] == vertex x
  19985. 533.81 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  19986. 533.81 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  19987. 533.81 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  19988. 533.81 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  19989. 533.81 s [algebraic-graphs]
  19990. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  19991. 533.81 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  19992. 533.81 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  19993. 533.81 s [algebraic-graphs]
  19994. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  19995. 533.81 s [algebraic-graphs] OK: star x [] == vertex x
  19996. 533.81 s [algebraic-graphs] OK: star x [y] == edge x y
  19997. 533.81 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  19998. 533.81 s [algebraic-graphs]
  19999. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  20000. 533.81 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  20001. 533.81 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  20002. 533.81 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  20003. 533.81 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  20004. 533.81 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  20005. 533.81 s [algebraic-graphs]
  20006. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  20007. 533.81 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20008. 533.81 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  20009. 533.81 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20010. 533.81 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  20011. 533.81 s [algebraic-graphs]
  20012. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  20013. 533.81 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  20014. 533.81 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  20015. 533.81 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  20016. 533.81 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  20017. 533.81 s [algebraic-graphs]
  20018. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  20019. 533.81 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  20020. 533.81 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  20021. 533.81 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  20022. 533.81 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  20023. 533.81 s [algebraic-graphs]
  20024. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  20025. 533.81 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  20026. 533.81 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  20027. 533.81 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  20028. 533.81 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  20029. 533.81 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  20030. 533.81 s [algebraic-graphs]
  20031. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  20032. 533.81 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  20033. 533.81 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20034. 533.81 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20035. 533.81 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20036. 533.81 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  20037. 533.81 s [algebraic-graphs]
  20038. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  20039. 533.81 s [algebraic-graphs] OK: replaceVertex x x == id
  20040. 533.81 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20041. 533.81 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20042. 533.81 s [algebraic-graphs]
  20043. 533.81 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  20044. 533.81 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20045. 540.49 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20046. 540.49 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20047. 540.53 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20048. 540.53 s [algebraic-graphs]
  20049. 540.53 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  20050. 540.53 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  20051. 540.53 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  20052. 540.53 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  20053. 540.53 s [algebraic-graphs]
  20054. 540.53 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  20055. 540.53 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20056. 540.53 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20057. 540.53 s [algebraic-graphs] OK: transpose . transpose == id
  20058. 540.53 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20059. 540.53 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20060. 540.53 s [algebraic-graphs]
  20061. 540.53 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  20062. 540.53 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  20063. 540.53 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  20064. 540.53 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  20065. 540.53 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  20066. 540.53 s [algebraic-graphs]
  20067. 540.53 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  20068. 540.53 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  20069. 540.53 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  20070. 540.53 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  20071. 540.53 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  20072. 540.53 s [algebraic-graphs]
  20073. 540.53 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  20074. 540.53 s [algebraic-graphs] OK: simplify == id
  20075. 540.53 s [algebraic-graphs] OK: size (simplify x) <= size x
  20076. 540.53 s [algebraic-graphs] OK: simplify 1 === 1
  20077. 540.53 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  20078. 540.53 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  20079. 540.53 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  20080. 540.53 s [algebraic-graphs]
  20081. 540.53 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  20082. 540.53 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  20083. 540.53 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  20084. 540.53 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  20085. 540.53 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  20086. 540.53 s [algebraic-graphs]
  20087. 540.53 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  20088. 540.53 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  20089. 540.53 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  20090. 540.53 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  20091. 540.53 s [algebraic-graphs]
  20092. 540.53 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  20093. 540.53 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  20094. 540.53 s [algebraic-graphs] OK: box x y ~~ box y x
  20095. 540.53 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  20096. 540.53 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  20097. 540.53 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  20098. 540.53 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20099. 540.53 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  20100. 540.53 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  20101. 540.53 s [algebraic-graphs]
  20102. 540.53 s [algebraic-graphs] ============ Relation ============
  20103. 540.53 s [algebraic-graphs] OK: Axioms of graphs
  20104. 540.53 s [algebraic-graphs]
  20105. 540.53 s [algebraic-graphs] ============ Relation.consistent ============
  20106. 540.53 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20107. 540.53 s [algebraic-graphs]
  20108. 540.53 s [algebraic-graphs] OK: consistent empty == True
  20109. 540.53 s [algebraic-graphs] OK: consistent (vertex x) == True
  20110. 540.53 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20111. 540.53 s [algebraic-graphs] OK: consistent (connect x y) == True
  20112. 540.53 s [algebraic-graphs] OK: consistent (edge x y) == True
  20113. 540.53 s [algebraic-graphs] OK: consistent (edges xs) == True
  20114. 540.53 s [algebraic-graphs] OK: consistent (stars xs) == True
  20115. 540.53 s [algebraic-graphs]
  20116. 540.53 s [algebraic-graphs] ============ Relation.Show ============
  20117. 540.53 s [algebraic-graphs] OK: show (empty ) == "empty"
  20118. 540.53 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20119. 540.53 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20120. 540.53 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20121. 540.53 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20122. 540.53 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20123. 540.53 s [algebraic-graphs]
  20124. 540.53 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20125. 540.53 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20126. 540.53 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20127. 540.53 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20128. 540.53 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20129. 540.53 s [algebraic-graphs]
  20130. 540.53 s [algebraic-graphs] ============ Relation.Ord ============
  20131. 540.53 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20132. 540.53 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20133. 540.53 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20134. 540.53 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20135. 540.53 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20136. 540.53 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20137. 540.53 s [algebraic-graphs] OK: x <= x + y
  20138. 540.53 s [algebraic-graphs] OK: x + y <= x * y
  20139. 540.53 s [algebraic-graphs]
  20140. 540.53 s [algebraic-graphs] ============ Relation.empty ============
  20141. 540.53 s [algebraic-graphs] OK: isEmpty empty == True
  20142. 540.53 s [algebraic-graphs] OK: hasVertex x empty == False
  20143. 540.53 s [algebraic-graphs] OK: vertexCount empty == 0
  20144. 540.53 s [algebraic-graphs] OK: edgeCount empty == 0
  20145. 540.53 s [algebraic-graphs]
  20146. 540.53 s [algebraic-graphs] ============ Relation.vertex ============
  20147. 540.53 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20148. 540.53 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20149. 540.53 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20150. 540.53 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20151. 540.53 s [algebraic-graphs]
  20152. 540.53 s [algebraic-graphs] ============ Relation.edge ============
  20153. 540.53 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20154. 540.53 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20155. 540.53 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20156. 540.53 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20157. 540.53 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20158. 540.53 s [algebraic-graphs]
  20159. 540.53 s [algebraic-graphs] ============ Relation.overlay ============
  20160. 540.53 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20161. 540.53 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20162. 540.53 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20163. 540.53 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20164. 540.53 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20165. 540.53 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20166. 540.53 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20167. 540.53 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20168. 540.53 s [algebraic-graphs]
  20169. 540.53 s [algebraic-graphs] ============ Relation.connect ============
  20170. 540.53 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20171. 540.53 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20172. 540.53 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20173. 540.53 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20174. 540.53 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20175. 540.53 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20176. 540.53 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20177. 540.53 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20178. 540.53 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20179. 540.53 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20180. 540.53 s [algebraic-graphs]
  20181. 540.53 s [algebraic-graphs] ============ Relation.vertices ============
  20182. 540.53 s [algebraic-graphs] OK: vertices [] == empty
  20183. 540.53 s [algebraic-graphs] OK: vertices [x] == vertex x
  20184. 540.53 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20185. 540.53 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20186. 540.53 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20187. 540.53 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20188. 540.53 s [algebraic-graphs]
  20189. 540.53 s [algebraic-graphs] ============ Relation.edges ============
  20190. 540.53 s [algebraic-graphs] OK: edges [] == empty
  20191. 540.53 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20192. 540.53 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20193. 540.53 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20194. 540.53 s [algebraic-graphs]
  20195. 540.53 s [algebraic-graphs] ============ Relation.overlays ============
  20196. 540.53 s [algebraic-graphs] OK: overlays [] == empty
  20197. 540.53 s [algebraic-graphs] OK: overlays [x] == x
  20198. 540.53 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20199. 540.53 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20200. 540.53 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20201. 540.53 s [algebraic-graphs]
  20202. 540.53 s [algebraic-graphs] ============ Relation.connects ============
  20203. 540.53 s [algebraic-graphs] OK: connects [] == empty
  20204. 540.53 s [algebraic-graphs] OK: connects [x] == x
  20205. 540.53 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20206. 540.53 s [algebraic-graphs] OK: connects == foldr connect empty
  20207. 540.53 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20208. 540.53 s [algebraic-graphs]
  20209. 540.53 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  20210. 540.53 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20211. 540.53 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20212. 540.53 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20213. 540.53 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20214. 540.53 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20215. 540.53 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20216. 540.53 s [algebraic-graphs]
  20217. 540.53 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  20218. 540.53 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20219. 540.53 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20220. 540.53 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20221. 540.53 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20222. 540.53 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20223. 540.53 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20224. 540.53 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20225. 540.53 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20226. 540.53 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20227. 540.53 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20228. 540.53 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20229. 540.53 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20230. 540.53 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20231. 540.53 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20232. 540.53 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20233. 540.53 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20234. 540.53 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20235. 544.11 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20236. 544.11 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20237. 544.11 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20238. 544.12 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20239. 544.12 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20240. 544.12 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20241. 544.12 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20242. 544.12 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20243. 544.12 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20244. 544.12 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20245. 544.12 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20246. 544.12 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20247. 544.12 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20248. 544.12 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20249. 544.12 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20250. 544.12 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20251. 544.12 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20252. 544.12 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20253. 544.12 s [algebraic-graphs]
  20254. 544.12 s [algebraic-graphs] ============ Relation.foldg ============
  20255. 544.12 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20256. 544.12 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20257. 544.12 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20258. 544.12 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20259. 544.12 s [algebraic-graphs]
  20260. 544.12 s [algebraic-graphs] ============ Relation.isEmpty ============
  20261. 544.12 s [algebraic-graphs] OK: isEmpty empty == True
  20262. 544.12 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20263. 544.12 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20264. 544.12 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20265. 544.12 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20266. 544.12 s [algebraic-graphs]
  20267. 544.12 s [algebraic-graphs] ============ Relation.hasVertex ============
  20268. 544.12 s [algebraic-graphs] OK: hasVertex x empty == False
  20269. 544.12 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20270. 544.12 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20271. 544.12 s [algebraic-graphs]
  20272. 544.12 s [algebraic-graphs] ============ Relation.hasEdge ============
  20273. 544.12 s [algebraic-graphs] OK: hasEdge x y empty == False
  20274. 544.12 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20275. 544.12 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20276. 544.12 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20277. 544.12 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20278. 544.12 s [algebraic-graphs]
  20279. 544.12 s [algebraic-graphs] ============ Relation.vertexCount ============
  20280. 544.12 s [algebraic-graphs] OK: vertexCount empty == 0
  20281. 544.12 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20282. 544.12 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20283. 544.12 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20284. 544.12 s [algebraic-graphs]
  20285. 544.12 s [algebraic-graphs] ============ Relation.edgeCount ============
  20286. 544.12 s [algebraic-graphs] OK: edgeCount empty == 0
  20287. 544.12 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20288. 544.12 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20289. 544.12 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20290. 544.12 s [algebraic-graphs]
  20291. 544.12 s [algebraic-graphs] ============ Relation.vertexList ============
  20292. 544.12 s [algebraic-graphs] OK: vertexList empty == []
  20293. 544.12 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20294. 544.12 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20295. 544.12 s [algebraic-graphs]
  20296. 544.12 s [algebraic-graphs] ============ Relation.vertexSet ============
  20297. 544.12 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20298. 544.12 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20299. 544.12 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20300. 544.12 s [algebraic-graphs]
  20301. 544.12 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  20302. 544.12 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20303. 544.12 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20304. 544.12 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20305. 544.12 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20306. 544.12 s [algebraic-graphs]
  20307. 544.12 s [algebraic-graphs] ============ Relation.edgeList ============
  20308. 544.12 s [algebraic-graphs] OK: edgeList empty == []
  20309. 544.12 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20310. 544.12 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20311. 544.12 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20312. 544.12 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20313. 544.12 s [algebraic-graphs]
  20314. 544.12 s [algebraic-graphs] ============ Relation.edgeSet ============
  20315. 544.12 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20316. 544.12 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20317. 544.12 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20318. 544.12 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20319. 544.12 s [algebraic-graphs]
  20320. 544.12 s [algebraic-graphs] ============ Relation.adjacencyList ============
  20321. 544.12 s [algebraic-graphs] OK: adjacencyList empty == []
  20322. 544.12 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20323. 544.12 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20324. 544.12 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20325. 544.12 s [algebraic-graphs]
  20326. 544.12 s [algebraic-graphs] ============ Relation.preSet ============
  20327. 544.12 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20328. 544.12 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20329. 544.12 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20330. 544.12 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20331. 544.12 s [algebraic-graphs]
  20332. 544.12 s [algebraic-graphs] ============ Relation.preIntSet ============
  20333. 544.12 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20334. 544.12 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20335. 544.12 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20336. 544.12 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20337. 544.12 s [algebraic-graphs]
  20338. 544.12 s [algebraic-graphs] ============ Relation.postSet ============
  20339. 544.12 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20340. 544.12 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20341. 544.12 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20342. 544.12 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20343. 544.12 s [algebraic-graphs]
  20344. 544.12 s [algebraic-graphs] ============ Relation.postIntSet ============
  20345. 544.12 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20346. 544.12 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20347. 544.12 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20348. 544.12 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20349. 544.12 s [algebraic-graphs]
  20350. 544.12 s [algebraic-graphs] ============ Relation.path ============
  20351. 544.12 s [algebraic-graphs] OK: path [] == empty
  20352. 544.12 s [algebraic-graphs] OK: path [x] == vertex x
  20353. 544.12 s [algebraic-graphs] OK: path [x,y] == edge x y
  20354. 544.12 s [algebraic-graphs]
  20355. 544.12 s [algebraic-graphs] ============ Relation.circuit ============
  20356. 544.12 s [algebraic-graphs] OK: circuit [] == empty
  20357. 544.12 s [algebraic-graphs] OK: circuit [x] == edge x x
  20358. 544.12 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20359. 544.12 s [algebraic-graphs]
  20360. 544.12 s [algebraic-graphs] ============ Relation.clique ============
  20361. 544.12 s [algebraic-graphs] OK: clique [] == empty
  20362. 544.12 s [algebraic-graphs] OK: clique [x] == vertex x
  20363. 544.12 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20364. 544.12 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20365. 544.12 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20366. 544.12 s [algebraic-graphs]
  20367. 544.12 s [algebraic-graphs] ============ Relation.biclique ============
  20368. 544.12 s [algebraic-graphs] OK: biclique [] [] == empty
  20369. 544.12 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20370. 544.12 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20371. 544.12 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20372. 544.12 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20373. 544.12 s [algebraic-graphs]
  20374. 544.12 s [algebraic-graphs] ============ Relation.star ============
  20375. 544.12 s [algebraic-graphs] OK: star x [] == vertex x
  20376. 544.12 s [algebraic-graphs] OK: star x [y] == edge x y
  20377. 544.12 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20378. 544.12 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20379. 544.12 s [algebraic-graphs]
  20380. 544.12 s [algebraic-graphs] ============ Relation.stars ============
  20381. 544.12 s [algebraic-graphs] OK: stars [] == empty
  20382. 544.12 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20383. 544.12 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20384. 544.12 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20385. 544.12 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20386. 544.12 s [algebraic-graphs] OK: stars . adjacencyList == id
  20387. 544.12 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20388. 544.12 s [algebraic-graphs]
  20389. 544.12 s [algebraic-graphs] ============ Relation.tree ============
  20390. 544.12 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20391. 544.12 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20392. 544.12 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20393. 544.12 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20394. 544.12 s [algebraic-graphs]
  20395. 544.12 s [algebraic-graphs] ============ Relation.forest ============
  20396. 544.12 s [algebraic-graphs] OK: forest [] == empty
  20397. 544.12 s [algebraic-graphs] OK: forest [x] == tree x
  20398. 544.12 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20399. 544.12 s [algebraic-graphs] OK: forest == overlays . map tree
  20400. 544.12 s [algebraic-graphs]
  20401. 544.12 s [algebraic-graphs] ============ Relation.removeVertex ============
  20402. 544.12 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20403. 544.12 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20404. 544.12 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20405. 544.12 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20406. 544.12 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20407. 544.12 s [algebraic-graphs]
  20408. 544.12 s [algebraic-graphs] ============ Relation.removeEdge ============
  20409. 544.12 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20410. 544.12 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20411. 544.12 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20412. 544.12 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20413. 544.12 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20414. 544.12 s [algebraic-graphs]
  20415. 544.12 s [algebraic-graphs] ============ Relation.replaceVertex ============
  20416. 544.12 s [algebraic-graphs] OK: replaceVertex x x == id
  20417. 544.12 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20418. 544.12 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20419. 544.12 s [algebraic-graphs]
  20420. 544.12 s [algebraic-graphs] ============ Relation.mergeVertices ============
  20421. 544.12 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20422. 575.21 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20423. 575.21 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20424. 575.25 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20425. 575.25 s [algebraic-graphs]
  20426. 575.25 s [algebraic-graphs] ============ Relation.transpose ============
  20427. 575.25 s [algebraic-graphs] OK: transpose empty == empty
  20428. 575.25 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20429. 575.25 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20430. 575.25 s [algebraic-graphs] OK: transpose . transpose == id
  20431. 575.25 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20432. 575.25 s [algebraic-graphs]
  20433. 575.25 s [algebraic-graphs] ============ Relation.gmap ============
  20434. 575.25 s [algebraic-graphs] OK: gmap f empty == empty
  20435. 575.25 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20436. 575.25 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20437. 575.25 s [algebraic-graphs] OK: gmap id == id
  20438. 575.25 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20439. 575.25 s [algebraic-graphs]
  20440. 575.25 s [algebraic-graphs] ============ Relation.induce ============
  20441. 575.25 s [algebraic-graphs] OK: induce (const True ) x == x
  20442. 575.25 s [algebraic-graphs] OK: induce (const False) x == empty
  20443. 575.25 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20444. 575.25 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20445. 575.25 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20446. 575.25 s [algebraic-graphs]
  20447. 575.25 s [algebraic-graphs] ============ Relation.compose ============
  20448. 575.25 s [algebraic-graphs] OK: compose empty x == empty
  20449. 575.25 s [algebraic-graphs] OK: compose x empty == empty
  20450. 575.25 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20451. 575.25 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20452. 575.25 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20453. 575.25 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20454. 575.25 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20455. 575.25 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20456. 575.25 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20457. 575.25 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20458. 575.25 s [algebraic-graphs]
  20459. 575.25 s [algebraic-graphs] ============ Relation.closure ============
  20460. 575.25 s [algebraic-graphs] OK: closure empty == empty
  20461. 575.25 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20462. 575.25 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20463. 575.25 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20464. 575.25 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20465. 575.25 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20466. 575.25 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20467. 575.25 s [algebraic-graphs] OK: closure . closure == closure
  20468. 575.25 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20469. 575.25 s [algebraic-graphs]
  20470. 575.25 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  20471. 575.25 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20472. 575.25 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20473. 575.26 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20474. 575.26 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20475. 575.26 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20476. 575.26 s [algebraic-graphs]
  20477. 575.26 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  20478. 575.26 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20479. 575.26 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20480. 575.26 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20481. 575.26 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20482. 575.26 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20483. 575.26 s [algebraic-graphs]
  20484. 575.26 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  20485. 575.26 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20486. 575.26 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20487. 575.26 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20488. 575.26 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20489. 575.26 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20490. 575.26 s [algebraic-graphs]
  20491. 575.26 s [algebraic-graphs] ============ Relation.induceJust ============
  20492. 575.26 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20493. 575.26 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20494. 575.26 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20495. 575.26 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20496. 575.26 s [algebraic-graphs]
  20497. 575.26 s [algebraic-graphs] ============ ReflexiveRelation ============
  20498. 575.26 s [algebraic-graphs] OK: Axioms of reflexive graphs
  20499. 575.26 s [algebraic-graphs]
  20500. 575.26 s [algebraic-graphs] ============ TransitiveRelation ============
  20501. 575.26 s [algebraic-graphs] OK: Axioms of transitive graphs
  20502. 575.26 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  20503. 575.26 s [algebraic-graphs]
  20504. 575.26 s [algebraic-graphs] ============ PreorderRelation ============
  20505. 575.26 s [algebraic-graphs] OK: Axioms of preorder graphs
  20506. 575.26 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  20507. 575.26 s [algebraic-graphs]
  20508. 575.26 s [algebraic-graphs] ============ Symmetric.Relation ============
  20509. 575.26 s [algebraic-graphs] OK: Axioms of undirected graphs
  20510. 575.26 s [algebraic-graphs]
  20511. 575.26 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  20512. 575.26 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20513. 575.26 s [algebraic-graphs]
  20514. 575.26 s [algebraic-graphs] OK: consistent empty == True
  20515. 575.26 s [algebraic-graphs] OK: consistent (vertex x) == True
  20516. 575.26 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20517. 575.26 s [algebraic-graphs] OK: consistent (connect x y) == True
  20518. 575.26 s [algebraic-graphs] OK: consistent (edge x y) == True
  20519. 575.26 s [algebraic-graphs] OK: consistent (edges xs) == True
  20520. 575.26 s [algebraic-graphs] OK: consistent (stars xs) == True
  20521. 575.26 s [algebraic-graphs]
  20522. 575.26 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  20523. 575.26 s [algebraic-graphs] OK: show (empty ) == "empty"
  20524. 575.26 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20525. 575.26 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20526. 575.26 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20527. 575.26 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20528. 575.26 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20529. 575.26 s [algebraic-graphs]
  20530. 575.26 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20531. 575.26 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20532. 575.26 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20533. 575.26 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20534. 575.26 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20535. 575.26 s [algebraic-graphs]
  20536. 575.26 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  20537. 575.26 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  20538. 575.26 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  20539. 575.26 s [algebraic-graphs]
  20540. 575.26 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  20541. 575.26 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  20542. 575.26 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  20543. 575.26 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  20544. 575.26 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  20545. 575.26 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  20546. 575.26 s [algebraic-graphs]
  20547. 575.26 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  20548. 575.26 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  20549. 575.26 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  20550. 575.26 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  20551. 575.26 s [algebraic-graphs]
  20552. 575.26 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  20553. 575.26 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20554. 575.26 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20555. 575.26 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20556. 575.26 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20557. 575.26 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20558. 575.26 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  20559. 575.26 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  20560. 575.26 s [algebraic-graphs] OK: x <= x + y
  20561. 575.26 s [algebraic-graphs] OK: x + y <= x * y
  20562. 575.26 s [algebraic-graphs]
  20563. 575.26 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  20564. 575.26 s [algebraic-graphs] OK: isEmpty empty == True
  20565. 575.26 s [algebraic-graphs] OK: hasVertex x empty == False
  20566. 575.26 s [algebraic-graphs] OK: vertexCount empty == 0
  20567. 575.26 s [algebraic-graphs] OK: edgeCount empty == 0
  20568. 575.26 s [algebraic-graphs]
  20569. 575.26 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  20570. 575.26 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20571. 575.26 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20572. 575.26 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20573. 575.26 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20574. 575.26 s [algebraic-graphs]
  20575. 575.26 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  20576. 575.26 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20577. 575.26 s [algebraic-graphs] OK: edge x y == edge y x
  20578. 575.26 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  20579. 575.26 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20580. 575.26 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20581. 575.26 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20582. 575.26 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20583. 575.26 s [algebraic-graphs]
  20584. 575.26 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  20585. 575.26 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20586. 575.26 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20587. 575.26 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20588. 575.26 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20589. 575.26 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20590. 575.26 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20591. 575.26 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20592. 575.26 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20593. 575.26 s [algebraic-graphs]
  20594. 575.26 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  20595. 575.26 s [algebraic-graphs] OK: connect x y == connect y x
  20596. 575.26 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20597. 575.26 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20598. 575.26 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20599. 575.26 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20600. 575.26 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20601. 575.26 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20602. 575.26 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  20603. 575.26 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20604. 575.26 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20605. 575.26 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20606. 575.26 s [algebraic-graphs]
  20607. 575.26 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  20608. 575.26 s [algebraic-graphs] OK: vertices [] == empty
  20609. 575.26 s [algebraic-graphs] OK: vertices [x] == vertex x
  20610. 575.26 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20611. 575.26 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20612. 575.26 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20613. 575.26 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20614. 575.26 s [algebraic-graphs]
  20615. 575.26 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  20616. 575.26 s [algebraic-graphs] OK: edges [] == empty
  20617. 575.26 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20618. 575.26 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  20619. 575.26 s [algebraic-graphs]
  20620. 575.26 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  20621. 575.26 s [algebraic-graphs] OK: overlays [] == empty
  20622. 588.08 s [algebraic-graphs] OK: overlays [x] == x
  20623. 588.12 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20624. 588.12 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20625. 588.12 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20626. 588.12 s [algebraic-graphs]
  20627. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  20628. 588.12 s [algebraic-graphs] OK: connects [] == empty
  20629. 588.12 s [algebraic-graphs] OK: connects [x] == x
  20630. 588.12 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20631. 588.12 s [algebraic-graphs] OK: connects == foldr connect empty
  20632. 588.12 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20633. 588.12 s [algebraic-graphs] OK: connects == connects . reverse
  20634. 588.12 s [algebraic-graphs]
  20635. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  20636. 588.12 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20637. 588.12 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20638. 588.12 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20639. 588.12 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20640. 588.12 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20641. 588.12 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20642. 588.12 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  20643. 588.12 s [algebraic-graphs]
  20644. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  20645. 588.12 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20646. 588.12 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20647. 588.12 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20648. 588.12 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20649. 588.12 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20650. 588.12 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20651. 588.12 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20652. 588.12 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20653. 588.12 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20654. 588.12 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20655. 588.12 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20656. 588.12 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20657. 588.12 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20658. 588.12 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20659. 588.12 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20660. 588.12 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20661. 588.12 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20662. 588.12 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20663. 588.12 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20664. 588.12 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20665. 588.12 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20666. 588.12 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20667. 588.12 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20668. 588.12 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20669. 588.12 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20670. 588.12 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20671. 588.12 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20672. 588.12 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20673. 588.12 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20674. 588.12 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20675. 588.12 s [algebraic-graphs]
  20676. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  20677. 588.12 s [algebraic-graphs] OK: isEmpty empty == True
  20678. 588.12 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20679. 588.12 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20680. 588.12 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20681. 588.12 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20682. 588.12 s [algebraic-graphs]
  20683. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  20684. 588.12 s [algebraic-graphs] OK: hasVertex x empty == False
  20685. 588.12 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20686. 588.12 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20687. 588.12 s [algebraic-graphs]
  20688. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  20689. 588.12 s [algebraic-graphs] OK: hasEdge x y empty == False
  20690. 588.12 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20691. 588.12 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20692. 588.12 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  20693. 588.12 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20694. 588.12 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  20695. 588.12 s [algebraic-graphs]
  20696. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  20697. 588.12 s [algebraic-graphs] OK: vertexCount empty == 0
  20698. 588.12 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20699. 588.12 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20700. 588.12 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20701. 588.12 s [algebraic-graphs]
  20702. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  20703. 588.12 s [algebraic-graphs] OK: edgeCount empty == 0
  20704. 588.12 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20705. 588.12 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20706. 588.12 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20707. 588.12 s [algebraic-graphs]
  20708. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  20709. 588.12 s [algebraic-graphs] OK: vertexList empty == []
  20710. 588.12 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20711. 588.12 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20712. 588.12 s [algebraic-graphs]
  20713. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  20714. 588.12 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20715. 588.12 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20716. 588.12 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20717. 588.12 s [algebraic-graphs]
  20718. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  20719. 588.12 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20720. 588.12 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20721. 588.12 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20722. 588.12 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20723. 588.12 s [algebraic-graphs]
  20724. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  20725. 588.12 s [algebraic-graphs] OK: edgeList empty == []
  20726. 588.12 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20727. 588.12 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  20728. 588.12 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  20729. 588.12 s [algebraic-graphs]
  20730. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  20731. 588.12 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20732. 588.12 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20733. 588.12 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  20734. 588.12 s [algebraic-graphs]
  20735. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  20736. 588.12 s [algebraic-graphs] OK: adjacencyList empty == []
  20737. 588.12 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20738. 588.12 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  20739. 588.12 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  20740. 588.12 s [algebraic-graphs]
  20741. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  20742. 588.12 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  20743. 588.12 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  20744. 588.12 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  20745. 588.12 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  20746. 588.12 s [algebraic-graphs]
  20747. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  20748. 588.12 s [algebraic-graphs] OK: path [] == empty
  20749. 588.12 s [algebraic-graphs] OK: path [x] == vertex x
  20750. 588.12 s [algebraic-graphs] OK: path [x,y] == edge x y
  20751. 588.12 s [algebraic-graphs] OK: path == path . reverse
  20752. 588.12 s [algebraic-graphs]
  20753. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  20754. 588.12 s [algebraic-graphs] OK: circuit [] == empty
  20755. 588.12 s [algebraic-graphs] OK: circuit [x] == edge x x
  20756. 588.12 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20757. 588.12 s [algebraic-graphs] OK: circuit == circuit . reverse
  20758. 588.12 s [algebraic-graphs]
  20759. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  20760. 588.12 s [algebraic-graphs] OK: clique [] == empty
  20761. 588.12 s [algebraic-graphs] OK: clique [x] == vertex x
  20762. 588.12 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20763. 588.12 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20764. 588.12 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20765. 588.12 s [algebraic-graphs] OK: clique == clique . reverse
  20766. 588.12 s [algebraic-graphs]
  20767. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  20768. 588.12 s [algebraic-graphs] OK: biclique [] [] == empty
  20769. 588.12 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20770. 588.12 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20771. 588.12 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20772. 588.12 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20773. 588.12 s [algebraic-graphs]
  20774. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  20775. 588.12 s [algebraic-graphs] OK: star x [] == vertex x
  20776. 588.12 s [algebraic-graphs] OK: star x [y] == edge x y
  20777. 588.12 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20778. 588.12 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20779. 588.12 s [algebraic-graphs]
  20780. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  20781. 588.12 s [algebraic-graphs] OK: stars [] == empty
  20782. 588.12 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20783. 588.12 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20784. 588.12 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20785. 588.12 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20786. 588.12 s [algebraic-graphs] OK: stars . adjacencyList == id
  20787. 588.12 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20788. 588.12 s [algebraic-graphs]
  20789. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  20790. 588.12 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20791. 588.12 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20792. 588.12 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20793. 588.12 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20794. 588.12 s [algebraic-graphs]
  20795. 588.12 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  20796. 588.12 s [algebraic-graphs] OK: forest [] == empty
  20797. 594.74 s [algebraic-graphs] OK: forest [x] == tree x
  20798. 594.74 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20799. 594.78 s [algebraic-graphs] OK: forest == overlays . map tree
  20800. 594.78 s [algebraic-graphs]
  20801. 594.78 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  20802. 594.78 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20803. 594.78 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20804. 594.78 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20805. 594.78 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20806. 594.78 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20807. 594.78 s [algebraic-graphs]
  20808. 594.78 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  20809. 594.78 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20810. 594.78 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20811. 594.78 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20812. 594.78 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20813. 594.78 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20814. 594.78 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  20815. 594.78 s [algebraic-graphs]
  20816. 594.78 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  20817. 594.78 s [algebraic-graphs] OK: replaceVertex x x == id
  20818. 594.78 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20819. 594.78 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20820. 594.78 s [algebraic-graphs]
  20821. 594.78 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  20822. 594.78 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20823. 594.78 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20824. 594.78 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20825. 594.78 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20826. 594.78 s [algebraic-graphs]
  20827. 594.78 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  20828. 594.78 s [algebraic-graphs] OK: gmap f empty == empty
  20829. 594.78 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20830. 594.78 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20831. 594.78 s [algebraic-graphs] OK: gmap id == id
  20832. 594.78 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20833. 594.78 s [algebraic-graphs]
  20834. 594.78 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  20835. 594.78 s [algebraic-graphs] OK: induce (const True ) x == x
  20836. 594.78 s [algebraic-graphs] OK: induce (const False) x == empty
  20837. 594.78 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20838. 594.78 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20839. 594.78 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20840. 594.78 s [algebraic-graphs]
  20841. 594.78 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  20842. 594.78 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20843. 594.78 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20844. 594.78 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20845. 594.78 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20846. 594.78 s [algebraic-graphs]
  20847. 594.78 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  20848. 594.78 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  20849. 594.78 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  20850. 594.78 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  20851. 594.78 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  20852. 594.78 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  20853. 594.78 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  20854. 594.78 s [algebraic-graphs]
  20855. 594.78 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  20856. 594.78 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  20857. 594.78 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  20858. 594.78 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  20859. 594.78 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  20860. 594.78 s [algebraic-graphs]
  20861. 594.78 s [algebraic-graphs] ============ Typed ============
  20862. 594.78 s [algebraic-graphs]
  20863. 594.78 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  20864. 594.78 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  20865. 594.78 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  20866. 594.78 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  20867. 594.78 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  20868. 594.78 s [algebraic-graphs]
  20869. 594.78 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  20870. 594.78 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  20871. 594.78 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  20872. 594.78 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  20873. 594.78 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  20874. 594.78 s [algebraic-graphs]
  20875. 594.78 s [algebraic-graphs] ============ Typed.dfsForest ============
  20876. 594.78 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  20877. 594.78 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  20878. 594.78 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  20879. 594.78 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  20880. 594.78 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  20881. 594.78 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  20882. 594.78 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  20883. 594.78 s [algebraic-graphs]
  20884. 594.78 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  20885. 594.78 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  20886. 594.78 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  20887. 594.78 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  20888. 594.78 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  20889. 594.78 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  20890. 594.78 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  20891. 594.78 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  20892. 594.78 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  20893. 594.78 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  20894. 594.78 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  20895. 594.78 s [algebraic-graphs]
  20896. 594.78 s [algebraic-graphs] ============ Typed.dfs ============
  20897. 594.78 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  20898. 594.78 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  20899. 594.78 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  20900. 594.78 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  20901. 594.78 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  20902. 594.78 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  20903. 594.78 s [algebraic-graphs] OK: dfs % x $ [] == []
  20904. 594.78 s [algebraic-graphs]
  20905. 594.78 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  20906. 594.78 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  20907. 594.78 s [algebraic-graphs]
  20908. 594.78 s [algebraic-graphs] ============ Typed.topSort ============
  20909. 594.78 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  20910. 594.78 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  20911. 594.78 s [algebraic-graphs]
  20912. 594.78 s [algebraic-graphs] ============ Graph.Undirected ============
  20913. 594.78 s [algebraic-graphs] OK: Axioms of undirected graphs
  20914. 594.78 s [algebraic-graphs]
  20915. 594.78 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  20916. 594.78 s [algebraic-graphs] OK: show (empty ) == "empty"
  20917. 594.78 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20918. 594.78 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20919. 594.78 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20920. 594.78 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20921. 594.78 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20922. 594.78 s [algebraic-graphs]
  20923. 594.78 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20924. 594.78 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20925. 594.78 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20926. 594.78 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20927. 594.78 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20928. 594.78 s [algebraic-graphs]
  20929. 594.78 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  20930. 594.78 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  20931. 594.78 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  20932. 594.78 s [algebraic-graphs]
  20933. 594.78 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  20934. 594.78 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  20935. 594.78 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  20936. 594.78 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  20937. 594.78 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  20938. 594.78 s [algebraic-graphs]
  20939. 594.78 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  20940. 594.78 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  20941. 594.78 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  20942. 594.78 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  20943. 594.78 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  20944. 594.78 s [algebraic-graphs]
  20945. 594.78 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  20946. 594.78 s [algebraic-graphs] OK: complement empty == empty
  20947. 594.78 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  20948. 594.78 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  20949. 594.78 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  20950. 594.78 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  20951. 594.78 s [algebraic-graphs] OK: complement . complement == id
  20952. 594.78 s [algebraic-graphs]
  20953. 594.78 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  20954. 594.78 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20955. 594.78 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20956. 594.78 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20957. 594.78 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20958. 594.78 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20959. 594.78 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  20960. 594.78 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  20961. 594.78 s [algebraic-graphs] OK: x <= x + y
  20962. 594.78 s [algebraic-graphs] OK: x + y <= x * y
  20963. 594.78 s [algebraic-graphs]
  20964. 594.78 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  20965. 594.78 s [algebraic-graphs] OK: isEmpty empty == True
  20966. 594.78 s [algebraic-graphs] OK: hasVertex x empty == False
  20967. 594.78 s [algebraic-graphs] OK: vertexCount empty == 0
  20968. 594.78 s [algebraic-graphs] OK: edgeCount empty == 0
  20969. 594.78 s [algebraic-graphs]
  20970. 594.78 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  20971. 594.78 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20972. 594.78 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20973. 594.78 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20974. 594.78 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20975. 594.78 s [algebraic-graphs]
  20976. 594.78 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  20977. 594.78 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20978. 594.78 s [algebraic-graphs] OK: edge x y == edge y x
  20979. 605.47 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  20980. 605.47 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20981. 605.47 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20982. 605.58 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20983. 605.58 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20984. 605.58 s [algebraic-graphs]
  20985. 605.58 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  20986. 605.58 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20987. 605.58 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20988. 605.58 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20989. 605.58 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20990. 605.58 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20991. 605.58 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20992. 605.58 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20993. 605.58 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20994. 605.58 s [algebraic-graphs]
  20995. 605.58 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  20996. 605.58 s [algebraic-graphs] OK: connect x y == connect y x
  20997. 605.58 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20998. 605.58 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20999. 605.58 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21000. 605.58 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21001. 605.58 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21002. 605.58 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21003. 605.58 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  21004. 605.58 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21005. 605.58 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21006. 605.58 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21007. 605.58 s [algebraic-graphs]
  21008. 605.58 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  21009. 605.58 s [algebraic-graphs] OK: vertices [] == empty
  21010. 605.58 s [algebraic-graphs] OK: vertices [x] == vertex x
  21011. 605.58 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21012. 605.58 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21013. 605.58 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21014. 605.58 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21015. 605.58 s [algebraic-graphs]
  21016. 605.58 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  21017. 605.58 s [algebraic-graphs] OK: edges [] == empty
  21018. 605.58 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21019. 605.58 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  21020. 605.58 s [algebraic-graphs]
  21021. 605.58 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  21022. 605.58 s [algebraic-graphs] OK: overlays [] == empty
  21023. 605.58 s [algebraic-graphs] OK: overlays [x] == x
  21024. 605.58 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21025. 605.58 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21026. 605.58 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21027. 605.58 s [algebraic-graphs]
  21028. 605.58 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  21029. 605.58 s [algebraic-graphs] OK: connects [] == empty
  21030. 605.58 s [algebraic-graphs] OK: connects [x] == x
  21031. 605.58 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21032. 605.58 s [algebraic-graphs] OK: connects == foldr connect empty
  21033. 605.58 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21034. 605.58 s [algebraic-graphs] OK: connects == connects . reverse
  21035. 605.58 s [algebraic-graphs]
  21036. 605.58 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  21037. 605.58 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21038. 605.58 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21039. 605.58 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21040. 605.58 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21041. 605.58 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21042. 605.58 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21043. 605.58 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  21044. 605.58 s [algebraic-graphs]
  21045. 605.58 s [algebraic-graphs] ============ Graph.Undirected.path ============
  21046. 605.58 s [algebraic-graphs] OK: path [] == empty
  21047. 605.58 s [algebraic-graphs] OK: path [x] == vertex x
  21048. 605.58 s [algebraic-graphs] OK: path [x,y] == edge x y
  21049. 605.58 s [algebraic-graphs] OK: path == path . reverse
  21050. 605.58 s [algebraic-graphs]
  21051. 605.58 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  21052. 605.58 s [algebraic-graphs] OK: circuit [] == empty
  21053. 605.58 s [algebraic-graphs] OK: circuit [x] == edge x x
  21054. 605.58 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21055. 605.58 s [algebraic-graphs] OK: circuit == circuit . reverse
  21056. 605.58 s [algebraic-graphs]
  21057. 605.58 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  21058. 605.58 s [algebraic-graphs] OK: clique [] == empty
  21059. 605.58 s [algebraic-graphs] OK: clique [x] == vertex x
  21060. 605.58 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21061. 605.58 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21062. 605.58 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21063. 605.58 s [algebraic-graphs] OK: clique == clique . reverse
  21064. 605.58 s [algebraic-graphs]
  21065. 605.58 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  21066. 605.58 s [algebraic-graphs] OK: biclique [] [] == empty
  21067. 605.58 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21068. 605.58 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21069. 605.58 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21070. 605.58 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21071. 605.58 s [algebraic-graphs]
  21072. 605.58 s [algebraic-graphs] ============ Graph.Undirected.star ============
  21073. 605.58 s [algebraic-graphs] OK: star x [] == vertex x
  21074. 605.58 s [algebraic-graphs] OK: star x [y] == edge x y
  21075. 605.58 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21076. 605.58 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21077. 605.58 s [algebraic-graphs]
  21078. 605.58 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  21079. 605.58 s [algebraic-graphs] OK: stars [] == empty
  21080. 605.58 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21081. 605.58 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21082. 605.58 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21083. 605.58 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21084. 605.58 s [algebraic-graphs] OK: stars . adjacencyList == id
  21085. 605.58 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21086. 605.58 s [algebraic-graphs]
  21087. 605.58 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  21088. 605.58 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21089. 605.58 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21090. 605.58 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21091. 605.58 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21092. 605.58 s [algebraic-graphs]
  21093. 605.58 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  21094. 605.58 s [algebraic-graphs] OK: forest [] == empty
  21095. 605.58 s [algebraic-graphs] OK: forest [x] == tree x
  21096. 605.58 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21097. 605.58 s [algebraic-graphs] OK: forest == overlays . map tree
  21098. 605.58 s [algebraic-graphs]
  21099. 605.58 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  21100. 605.58 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21101. 605.58 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21102. 605.58 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21103. 605.58 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21104. 605.58 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21105. 605.58 s [algebraic-graphs]
  21106. 605.58 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  21107. 605.58 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21108. 605.58 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21109. 605.58 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21110. 605.58 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21111. 605.58 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21112. 605.58 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  21113. 605.58 s [algebraic-graphs]
  21114. 605.58 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  21115. 605.58 s [algebraic-graphs] OK: replaceVertex x x == id
  21116. 605.58 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21117. 605.58 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21118. 605.58 s [algebraic-graphs]
  21119. 605.58 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  21120. 605.58 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21121. 605.58 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21122. 605.58 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21123. 605.58 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21124. 605.58 s [algebraic-graphs]
  21125. 605.58 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  21126. 605.58 s [algebraic-graphs] OK: gmap f empty == empty
  21127. 605.58 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21128. 605.58 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21129. 605.58 s [algebraic-graphs] OK: gmap id == id
  21130. 605.58 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21131. 605.58 s [algebraic-graphs]
  21132. 605.58 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  21133. 605.58 s [algebraic-graphs] OK: induce (const True ) x == x
  21134. 605.58 s [algebraic-graphs] OK: induce (const False) x == empty
  21135. 605.58 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21136. 605.58 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21137. 605.58 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21138. 605.58 s [algebraic-graphs]
  21139. 605.58 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  21140. 605.58 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21141. 605.58 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21142. 605.58 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21143. 605.58 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21144. 605.58 s [algebraic-graphs] Test suite main: PASS
  21145. 605.58 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  21146. 605.58 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  21147. 605.58 s [algebraic-graphs] checkPhase completed in 2 minutes 14 seconds
  21148. 605.58 s [algebraic-graphs] Phase: haddockPhase
  21149. 605.59 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7..
  21150. 605.60 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7..
  21151. 605.63 s [algebraic-graphs] Warning: --source-* options are ignored when --hyperlinked-source is enabled.
  21152. 605.76 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing )
  21153. 606.04 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing )
  21154. 606.10 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing )
  21155. 606.13 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing )
  21156. 606.16 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing )
  21157. 606.32 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing )
  21158. 606.35 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing )
  21159. 606.51 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing )
  21160. 606.59 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing )
  21161. 606.82 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing )
  21162. 606.87 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing )
  21163. 606.94 s [algebraic-graphs]
  21164. 606.94 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  21165. 606.94 s [algebraic-graphs] In the use of ‘head’
  21166. 606.94 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  21167. 606.94 s [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."
  21168. 606.94 s [algebraic-graphs] |
  21169. 606.94 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  21170. 606.94 s [algebraic-graphs] | ^^^^
  21171. 606.94 s [algebraic-graphs]
  21172. 606.94 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  21173. 606.94 s [algebraic-graphs] In the use of ‘tail’
  21174. 606.94 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  21175. 606.94 s [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."
  21176. 606.94 s [algebraic-graphs] |
  21177. 606.94 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  21178. 606.94 s [algebraic-graphs] | ^^^^
  21179. 606.94 s [algebraic-graphs]
  21180. 606.94 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  21181. 606.94 s [algebraic-graphs] In the use of ‘head’
  21182. 606.94 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  21183. 606.95 s [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."
  21184. 606.95 s [algebraic-graphs] |
  21185. 606.95 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  21186. 606.95 s [algebraic-graphs] | ^^^^
  21187. 606.95 s [algebraic-graphs]
  21188. 606.95 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  21189. 606.95 s [algebraic-graphs] In the use of ‘tail’
  21190. 606.95 s [algebraic-graphs] (imported from Prelude, but defined in GHC.List):
  21191. 606.95 s [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."
  21192. 606.95 s [algebraic-graphs] |
  21193. 606.95 s [algebraic-graphs] 397 | bnd' = tail bnd
  21194. 606.95 s [algebraic-graphs] | ^^^^
  21195. 606.95 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing )
  21196. 606.99 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing )
  21197. 607.07 s [algebraic-graphs]
  21198. 607.07 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21199. 607.07 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21200. 607.07 s [algebraic-graphs] will become an error in a future GHC release.
  21201. 607.07 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21202. 607.07 s [algebraic-graphs] |
  21203. 607.07 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  21204. 607.07 s [algebraic-graphs] | ^
  21205. 607.07 s [algebraic-graphs]
  21206. 607.07 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21207. 607.07 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21208. 607.07 s [algebraic-graphs] will become an error in a future GHC release.
  21209. 607.07 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21210. 607.07 s [algebraic-graphs] |
  21211. 607.08 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  21212. 607.08 s [algebraic-graphs] | ^
  21213. 607.08 s [algebraic-graphs]
  21214. 607.08 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21215. 607.08 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21216. 607.08 s [algebraic-graphs] will become an error in a future GHC release.
  21217. 607.08 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21218. 607.08 s [algebraic-graphs] |
  21219. 607.08 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  21220. 607.08 s [algebraic-graphs] | ^
  21221. 607.08 s [algebraic-graphs]
  21222. 607.08 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21223. 607.08 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21224. 607.08 s [algebraic-graphs] will become an error in a future GHC release.
  21225. 607.08 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21226. 607.08 s [algebraic-graphs] |
  21227. 607.08 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  21228. 607.08 s [algebraic-graphs] | ^
  21229. 607.08 s [algebraic-graphs]
  21230. 607.08 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21231. 607.08 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21232. 607.08 s [algebraic-graphs] will become an error in a future GHC release.
  21233. 607.08 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21234. 607.08 s [algebraic-graphs] |
  21235. 607.08 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  21236. 607.08 s [algebraic-graphs] | ^
  21237. 607.08 s [algebraic-graphs]
  21238. 607.08 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21239. 607.08 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21240. 607.08 s [algebraic-graphs] will become an error in a future GHC release.
  21241. 607.08 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21242. 607.08 s [algebraic-graphs] |
  21243. 607.08 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  21244. 607.08 s [algebraic-graphs] | ^
  21245. 607.08 s [algebraic-graphs]
  21246. 607.08 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21247. 607.08 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21248. 607.08 s [algebraic-graphs] will become an error in a future GHC release.
  21249. 607.08 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21250. 607.08 s [algebraic-graphs] |
  21251. 607.08 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  21252. 607.08 s [algebraic-graphs] | ^
  21253. 607.09 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing )
  21254. 607.23 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing )
  21255. 607.28 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing )
  21256. 607.38 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing )
  21257. 607.58 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing )
  21258. 607.72 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing )
  21259. 607.74 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing )
  21260. 607.77 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing )
  21261. 607.80 s [algebraic-graphs]
  21262. 607.80 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21263. 607.80 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21264. 607.80 s [algebraic-graphs] will become an error in a future GHC release.
  21265. 607.80 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21266. 607.80 s [algebraic-graphs] |
  21267. 607.80 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  21268. 607.80 s [algebraic-graphs] | ^
  21269. 607.80 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing )
  21270. 607.91 s [algebraic-graphs]
  21271. 607.91 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21272. 607.91 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21273. 607.91 s [algebraic-graphs] will become an error in a future GHC release.
  21274. 607.91 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21275. 607.91 s [algebraic-graphs] |
  21276. 607.91 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  21277. 607.91 s [algebraic-graphs] | ^
  21278. 607.91 s [algebraic-graphs]
  21279. 607.91 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21280. 607.91 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21281. 607.91 s [algebraic-graphs] will become an error in a future GHC release.
  21282. 607.91 s [algebraic-graphs] Suggested fix: Perhaps you intended to use TypeOperators
  21283. 607.91 s [algebraic-graphs] |
  21284. 607.91 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  21285. 607.91 s [algebraic-graphs] | ^
  21286. 607.91 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing )
  21287. 608.01 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing )
  21288. 608.10 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing )
  21289. 608.13 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing )
  21290. 608.15 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing )
  21291. 608.17 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing )
  21292. 608.20 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing )
  21293. 608.23 s [algebraic-graphs] Haddock coverage:
  21294. 608.24 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21295. 608.24 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21296. 608.24 s [algebraic-graphs] * in ‘Data.Map.Internal’
  21297. 608.24 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21298. 608.24 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21299. 608.24 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21300. 608.24 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21301. 608.25 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  21302. 608.26 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21303. 608.26 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  21304. 608.26 s [algebraic-graphs] * in ‘Data.IntMap.Internal’
  21305. 608.26 s [algebraic-graphs] * in ‘Data.IntSet.Internal’
  21306. 608.26 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21307. 608.26 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21308. 608.26 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  21309. 608.27 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  21310. 608.28 s [algebraic-graphs] Warning: 'nub' is out of scope.
  21311. 608.28 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21312. 608.28 s [algebraic-graphs] Warning: 'sort' is out of scope.
  21313. 608.29 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21314. 608.29 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  21315. 608.29 s [algebraic-graphs] Missing documentation for:
  21316. 608.29 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  21317. 608.29 s [algebraic-graphs] Warning: 'List' is ambiguous. It is defined
  21318. 608.29 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
  21319. 608.29 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
  21320. 608.29 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21321. 608.29 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21322. 608.29 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
  21323. 608.29 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  21324. 608.29 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21325. 608.29 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  21326. 608.29 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  21327. 608.29 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
  21328. 608.29 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
  21329. 608.29 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21330. 608.29 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21331. 608.29 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
  21332. 608.30 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21333. 608.30 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  21334. 608.30 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21335. 608.30 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21336. 608.30 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21337. 608.30 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
  21338. 608.32 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  21339. 608.32 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  21340. 608.32 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21341. 608.32 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  21342. 608.32 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21343. 608.32 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  21344. 608.32 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21345. 608.32 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  21346. 608.32 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21347. 608.32 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  21348. 608.32 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21349. 608.33 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  21350. 608.33 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21351. 608.33 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  21352. 608.33 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21353. 608.33 s [algebraic-graphs] Warning: 'box' is out of scope.
  21354. 608.33 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21355. 608.33 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  21356. 608.33 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21357. 608.33 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  21358. 608.34 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21359. 608.34 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21360. 608.34 s [algebraic-graphs] * in ‘Data.Map.Internal’
  21361. 608.34 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21362. 608.34 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21363. 608.34 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21364. 608.34 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21365. 608.34 s [algebraic-graphs] Warning: 'nub' is out of scope.
  21366. 608.34 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21367. 608.35 s [algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
  21368. 608.35 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  21369. 608.35 s [algebraic-graphs] * in ‘Data.Tuple’
  21370. 608.35 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21371. 608.35 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21372. 608.35 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  21373. 608.36 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  21374. 608.36 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  21375. 608.36 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21376. 608.36 s [algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
  21377. 608.36 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
  21378. 608.36 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  21379. 608.36 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21380. 608.36 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21381. 608.36 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  21382. 608.36 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21383. 608.36 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21384. 608.36 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21385. 608.36 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21386. 608.36 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21387. 608.36 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21388. 608.46 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  21389. 608.46 s [algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
  21390. 608.46 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
  21391. 608.46 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
  21392. 608.46 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21393. 608.46 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21394. 608.46 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
  21395. 608.46 s [algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
  21396. 608.46 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
  21397. 608.46 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
  21398. 608.46 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21399. 608.46 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21400. 608.46 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
  21401. 608.46 s [algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
  21402. 608.46 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
  21403. 608.46 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
  21404. 608.46 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21405. 608.46 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21406. 608.46 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
  21407. 608.46 s [algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
  21408. 608.46 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
  21409. 608.46 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
  21410. 608.46 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21411. 608.46 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21412. 608.46 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
  21413. 608.46 s [algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
  21414. 608.46 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
  21415. 608.46 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
  21416. 608.46 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21417. 608.46 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21418. 608.46 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
  21419. 608.46 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  21420. 608.47 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  21421. 608.47 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  21422. 608.47 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  21423. 608.47 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21424. 608.47 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21425. 608.47 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  21426. 608.47 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  21427. 608.47 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21428. 608.47 s [algebraic-graphs] Warning: 'empty' is out of scope.
  21429. 608.47 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21430. 608.47 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  21431. 608.47 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21432. 608.47 s [algebraic-graphs] Warning: 'edges' is out of scope.
  21433. 608.47 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21434. 608.47 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  21435. 608.47 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21436. 608.48 s [algebraic-graphs] Warning: 'stars' is out of scope.
  21437. 608.48 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21438. 608.48 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  21439. 608.49 s [algebraic-graphs] Warning: 'nub' is out of scope.
  21440. 608.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21441. 608.49 s [algebraic-graphs] Warning: 'sort' is out of scope.
  21442. 608.49 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21443. 608.49 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  21444. 608.49 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21445. 608.49 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  21446. 608.49 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21447. 608.49 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21448. 608.49 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  21449. 608.49 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  21450. 608.49 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  21451. 608.49 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  21452. 608.49 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21453. 608.49 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21454. 608.49 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  21455. 608.49 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  21456. 608.49 s [algebraic-graphs] Missing documentation for:
  21457. 608.49 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  21458. 608.49 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21459. 608.50 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  21460. 608.50 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21461. 608.50 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21462. 608.50 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21463. 608.50 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21464. 608.50 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  21465. 608.50 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
  21466. 608.50 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21467. 608.50 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21468. 608.50 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21469. 608.50 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21470. 608.50 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  21471. 608.50 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
  21472. 608.50 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  21473. 608.50 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21474. 608.50 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21475. 608.50 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
  21476. 608.50 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  21477. 608.50 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
  21478. 608.50 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  21479. 608.50 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21480. 608.50 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21481. 608.50 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
  21482. 608.50 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  21483. 608.50 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
  21484. 608.51 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  21485. 608.51 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21486. 608.51 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21487. 608.51 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  21488. 608.51 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  21489. 608.51 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  21490. 608.51 s [algebraic-graphs] * at src/Algebra/Graph.hs:482:1
  21491. 608.51 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  21492. 608.51 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21493. 608.51 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21494. 608.51 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  21495. 608.51 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  21496. 608.51 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  21497. 608.51 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
  21498. 608.51 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  21499. 608.51 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21500. 608.51 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21501. 608.51 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
  21502. 608.52 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21503. 608.52 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  21504. 608.52 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21505. 608.52 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21506. 608.52 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21507. 608.52 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  21508. 608.53 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  21509. 608.53 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21510. 608.53 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  21511. 608.54 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  21512. 608.54 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  21513. 608.54 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  21514. 608.54 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21515. 608.54 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21516. 608.54 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  21517. 608.54 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  21518. 608.54 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  21519. 608.54 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  21520. 608.54 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21521. 608.54 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21522. 608.54 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  21523. 608.54 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21524. 608.54 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  21525. 608.54 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21526. 608.54 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21527. 608.55 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21528. 608.55 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  21529. 608.55 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  21530. 608.56 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  21531. 608.56 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21532. 608.57 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  21533. 608.58 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21534. 608.58 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  21535. 608.58 s [algebraic-graphs] * in ‘Data.Map.Internal’
  21536. 608.58 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21537. 608.58 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21538. 608.58 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  21539. 608.58 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  21540. 608.58 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  21541. 608.58 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  21542. 608.58 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21543. 608.58 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21544. 608.58 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  21545. 608.59 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  21546. 608.59 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  21547. 608.59 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
  21548. 608.59 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
  21549. 608.59 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21550. 608.59 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21551. 608.59 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
  21552. 608.59 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21553. 608.59 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  21554. 608.59 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21555. 608.59 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21556. 608.59 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21557. 608.59 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
  21558. 608.60 s [algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
  21559. 608.60 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
  21560. 608.60 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
  21561. 608.60 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21562. 608.60 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21563. 608.60 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
  21564. 608.60 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  21565. 608.60 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  21566. 608.61 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  21567. 608.61 s [algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
  21568. 608.61 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
  21569. 608.61 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
  21570. 608.61 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21571. 608.61 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21572. 608.61 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
  21573. 608.61 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  21574. 608.61 s [algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
  21575. 608.61 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
  21576. 608.61 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
  21577. 608.61 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21578. 608.61 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21579. 608.61 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
  21580. 608.61 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  21581. 608.61 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21582. 608.61 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  21583. 608.62 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21584. 608.62 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  21585. 608.62 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21586. 608.62 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21587. 608.62 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21588. 608.62 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  21589. 608.63 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  21590. 608.64 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  21591. 608.64 s [algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
  21592. 608.64 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
  21593. 608.64 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
  21594. 608.64 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21595. 608.64 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21596. 608.64 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
  21597. 608.64 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  21598. 608.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21599. 608.64 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  21600. 608.64 s [algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
  21601. 608.64 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
  21602. 608.64 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  21603. 608.64 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21604. 608.64 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21605. 608.64 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  21606. 608.64 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  21607. 608.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21608. 608.64 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  21609. 608.64 s [algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
  21610. 608.64 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
  21611. 608.64 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
  21612. 608.64 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21613. 608.64 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21614. 608.64 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
  21615. 608.64 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  21616. 608.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21617. 608.64 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  21618. 608.64 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  21619. 608.64 s [algebraic-graphs] Missing documentation for:
  21620. 608.64 s [algebraic-graphs] Module header
  21621. 608.64 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  21622. 608.64 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
  21623. 608.64 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
  21624. 608.64 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
  21625. 608.64 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
  21626. 608.64 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
  21627. 608.64 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
  21628. 608.64 s [algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
  21629. 608.64 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
  21630. 608.64 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
  21631. 608.64 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21632. 608.64 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21633. 608.64 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
  21634. 608.64 s [algebraic-graphs] Warning: 'array' is out of scope.
  21635. 608.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21636. 608.65 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  21637. 608.65 s [algebraic-graphs] Missing documentation for:
  21638. 608.65 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
  21639. 609.17 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
  21640. 609.17 s [algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
  21641. 609.17 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  21642. 609.17 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  21643. 609.18 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
  21644. 609.18 s [algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
  21645. 609.18 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  21646. 609.18 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  21647. 609.18 s [algebraic-graphs] Warning: Algebra.Graph.Internal: could not find link destinations for:
  21648. 609.18 s [algebraic-graphs] - Algebra.Graph.Internal.D:R:ItemList
  21649. 609.19 s [algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
  21650. 609.19 s [algebraic-graphs] - Algebra.Graph.Rep_Graph
  21651. 609.19 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  21652. 609.19 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  21653. 609.20 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
  21654. 609.20 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
  21655. 609.20 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
  21656. 609.20 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
  21657. 609.20 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
  21658. 609.20 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
  21659. 609.20 s [algebraic-graphs] Warning: Algebra.Graph.Label: could not find link destinations for:
  21660. 609.20 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemMinimum
  21661. 609.20 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemLabel
  21662. 609.21 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
  21663. 609.21 s [algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
  21664. 609.21 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  21665. 609.22 s [algebraic-graphs] Warning: Algebra.Graph.ToGraph: could not find link destinations for:
  21666. 609.22 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  21667. 609.22 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  21668. 609.22 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  21669. 609.22 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  21670. 609.22 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  21671. 609.22 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  21672. 609.22 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  21673. 609.22 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  21674. 609.22 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  21675. 609.22 s [algebraic-graphs] Warning: Algebra.Graph.Relation: could not find link destinations for:
  21676. 609.22 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  21677. 609.22 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  21678. 609.23 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
  21679. 609.23 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  21680. 609.23 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  21681. 609.23 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
  21682. 609.23 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  21683. 609.24 s [algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
  21684. 609.24 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  21685. 609.24 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
  21686. 609.24 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  21687. 609.24 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  21688. 609.24 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  21689. 609.24 s [algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
  21690. 609.24 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  21691. 609.25 s [algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
  21692. 609.25 s [algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
  21693. 609.25 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  21694. 609.25 s [algebraic-graphs] Warning: Algebra.Graph.Class: could not find link destinations for:
  21695. 609.25 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple3
  21696. 609.25 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple2
  21697. 609.25 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexFUN
  21698. 609.25 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexMaybe
  21699. 609.25 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexUnit
  21700. 609.25 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  21701. 609.25 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  21702. 609.25 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  21703. 609.25 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  21704. 609.25 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  21705. 609.25 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  21706. 609.25 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  21707. 609.25 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  21708. 609.25 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  21709. 609.25 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  21710. 609.25 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  21711. 609.25 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  21712. 609.25 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
  21713. 609.25 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  21714. 609.25 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
  21715. 609.25 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  21716. 609.25 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
  21717. 609.25 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  21718. 609.26 s [algebraic-graphs] Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
  21719. 609.26 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  21720. 612.95 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs/,
  21721. 613.10 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  21722. 613.10 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7..
  21723. 613.10 s [algebraic-graphs] Phase: installPhase
  21724. 613.10 s [algebraic-graphs] Installing library in /nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9
  21725. 613.78 s [algebraic-graphs] Phase: fixupPhase
  21726. 613.80 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7
  21727. 613.81 s [algebraic-graphs] shrinking /nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4/libHSalgebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9-ghc9.8.4.so
  21728. 613.82 s [algebraic-graphs] checking for references to /build/ in /nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7...
  21729. 613.85 s [algebraic-graphs] patching script interpreter paths in /nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7
  21730. 613.85 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7/lib
  21731. 614.18 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/iriz387bz508qr8ais34p7a45cq8n51m-algebraic-graphs-0.7-doc
  21732. 614.20 s [algebraic-graphs] checking for references to /build/ in /nix/store/iriz387bz508qr8ais34p7a45cq8n51m-algebraic-graphs-0.7-doc...
  21733. 614.22 s [algebraic-graphs] patching script interpreter paths in /nix/store/iriz387bz508qr8ais34p7a45cq8n51m-algebraic-graphs-0.7-doc
  21734. 614.40 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7 /nix/store/iriz387bz508qr8ais34p7a45cq8n51m-algebraic-graphs-0.7-doc
  21735. 614.98 s [algebraic-graphs:post-build] Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
  21736. 614.98 s [algebraic-graphs:post-build]
  21737. 615.43 s [algebraic-graphs:post-build] Pushing /nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7 (24.13 MiB)
  21738. 615.53 s [algebraic-graphs:post-build] Pushing /nix/store/iriz387bz508qr8ais34p7a45cq8n51m-algebraic-graphs-0.7-doc (10.45 MiB)
  21739. 616.89 s [algebraic-graphs:post-build]
  21740. 616.89 s [algebraic-graphs:post-build] All done.
  21741. 616.92 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7 /nix/store/iriz387bz508qr8ais34p7a45cq8n51m-algebraic-graphs-0.7-doc
  21742. 616.98 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21743. 617.27 s [algebraic-graphs:post-build] copying 2 paths...
  21744. 617.27 s [algebraic-graphs:post-build] copying path '/nix/store/iriz387bz508qr8ais34p7a45cq8n51m-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  21745. 618.87 s [algebraic-graphs:post-build] copying path '/nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  21746. 626.48 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21747. 626.74 s [algebraic-graphs:post-build] copying 1 paths...
  21748. 626.78 s [algebraic-graphs:post-build] copying path '/nix/store/wqpx38kbx5iiqx231j2pckqq8f2dk5g2-algebraic-graphs-0.7.drv' to 'https://cache.nix-ci.com'...
  21749. 626.99 s Progress: 11 of 16 built, 193 of 193 downloaded from cache
  21750. 627.06 s Building /nix/store/8paapna17628zqd15l0yqsm0s5iz2791-algebraic-graph-duoids-0.0.1.0.drv
  21751. 627.24 s [algebraic-graph-duoids] Phase: setupCompilerEnvironmentPhase
  21752. 627.24 s [algebraic-graph-duoids] Build with /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4.
  21753. 627.45 s [algebraic-graph-duoids] Phase: unpackPhase
  21754. 627.46 s [algebraic-graph-duoids] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./algebraic-graphs
  21755. 627.47 s [algebraic-graph-duoids] source root is algebraic-graphs
  21756. 627.48 s [algebraic-graph-duoids] Phase: patchPhase
  21757. 627.49 s [algebraic-graph-duoids] Phase: compileBuildDriverPhase
  21758. 627.49 s [algebraic-graph-duoids] setupCompileFlags: -package-db=/build/tmp.PSmtKHCLpN/setup-package.conf.d -threaded
  21759. 627.55 s [algebraic-graph-duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.PSmtKHCLpN/Main.o )
  21760. 627.61 s [algebraic-graph-duoids] [2 of 2] Linking Setup
  21761. 628.98 s [algebraic-graph-duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  21762. 628.99 s [algebraic-graph-duoids] Phase: configurePhase
  21763. 629.00 s [algebraic-graph-duoids] configureFlags: --verbose --prefix=/nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/j09cn1lwhd7hw8845paqdnnwj30qb6s9-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.PSmtKHCLpN/package.conf.d --ghc-option=-j16 --ghc-option=+RTS --ghc-option=-A64M --ghc-option=-RTS --enable-library-profiling --profiling-detail=exported-functions --disable-profiling --enable-shared --disable-coverage --enable-static --disable-executable-dynamic --enable-tests --disable-benchmarks --enable-library-vanilla --disable-library-for-ghci --enable-split-sections --enable-library-stripping --enable-executable-stripping --ghc-option=-haddock --ghc-options=-Werror --extra-lib-dirs=/nix/store/vj3rmg6937p9icir6bazbdcb4xdnrg9j-ncurses-6.5/lib --extra-lib-dirs=/nix/store/0aaj6jbxclpwvrphggqz4vf5hg8360fr-libffi-3.4.8/lib --extra-lib-dirs=/nix/store/mlnlvdaij0c6qgzz3mmcb5f796871778-elfutils-0.192/lib --extra-lib-dirs=/nix/store/m9fycbkaairz8kampnsl7sx1aanvl0db-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/lib
  21764. 629.01 s [algebraic-graph-duoids] Using Parsec parser
  21765. 629.01 s [algebraic-graph-duoids] Configuring algebraic-graph-duoids-0.0.1.0...
  21766. 629.37 s [algebraic-graph-duoids] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  21767. 629.63 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  21768. 629.63 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  21769. 629.63 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.19.2.0
  21770. 629.63 s [algebraic-graph-duoids] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  21771. 629.63 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  21772. 629.63 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  21773. 629.63 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  21774. 629.63 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.19.2.0
  21775. 629.63 s [algebraic-graph-duoids] Dependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
  21776. 629.63 s [algebraic-graph-duoids] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  21777. 629.63 s [algebraic-graph-duoids] hedgehog-1.5
  21778. 629.63 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  21779. 629.63 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  21780. 629.63 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.19.2.0
  21781. 629.63 s [algebraic-graph-duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  21782. 629.63 s [algebraic-graph-duoids] <0.25: using doctest-0.22.6
  21783. 629.63 s [algebraic-graph-duoids] Source component graph:
  21784. 629.63 s [algebraic-graph-duoids] component lib
  21785. 629.63 s [algebraic-graph-duoids] component test:doctests dependency lib
  21786. 629.63 s [algebraic-graph-duoids] component test:laws dependency lib
  21787. 629.63 s [algebraic-graph-duoids] Configured component graph:
  21788. 629.63 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-2whhYeuPuJO4pVaQ2c1kpw
  21789. 629.63 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9
  21790. 629.63 s [algebraic-graph-duoids] include base-4.19.2.0-0fde
  21791. 629.63 s [algebraic-graph-duoids] include duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW
  21792. 629.63 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-QHcCAX7NnZEAvTf1KqRCe-doctests
  21793. 629.63 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-2whhYeuPuJO4pVaQ2c1kpw
  21794. 629.63 s [algebraic-graph-duoids] include base-4.19.2.0-0fde
  21795. 629.63 s [algebraic-graph-duoids] include doctest-0.22.6-1SxYZzGcAV168a12vQnyDt
  21796. 629.63 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-L7OryOp2PiG560fgOFWSEt-laws
  21797. 629.63 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-2whhYeuPuJO4pVaQ2c1kpw
  21798. 629.63 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9
  21799. 629.63 s [algebraic-graph-duoids] include base-4.19.2.0-0fde
  21800. 629.63 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-Bw08evgX6HDE1CE4MFJXj4
  21801. 629.63 s [algebraic-graph-duoids] include hedgehog-1.5-Cya8Y6QE8FkF1j7fe2PPQ4
  21802. 629.63 s [algebraic-graph-duoids] Linked component graph:
  21803. 629.63 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-2whhYeuPuJO4pVaQ2c1kpw
  21804. 629.63 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9
  21805. 629.63 s [algebraic-graph-duoids] include base-4.19.2.0-0fde
  21806. 629.63 s [algebraic-graph-duoids] include duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW
  21807. 629.63 s [algebraic-graph-duoids] Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-2whhYeuPuJO4pVaQ2c1kpw:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-2whhYeuPuJO4pVaQ2c1kpw:Algebra.Graph.Duoid.Orphans
  21808. 629.63 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-QHcCAX7NnZEAvTf1KqRCe-doctests
  21809. 629.63 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-2whhYeuPuJO4pVaQ2c1kpw
  21810. 629.63 s [algebraic-graph-duoids] include base-4.19.2.0-0fde
  21811. 629.63 s [algebraic-graph-duoids] include doctest-0.22.6-1SxYZzGcAV168a12vQnyDt
  21812. 629.63 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-L7OryOp2PiG560fgOFWSEt-laws
  21813. 629.63 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-2whhYeuPuJO4pVaQ2c1kpw
  21814. 629.63 s [algebraic-graph-duoids] include algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9
  21815. 629.63 s [algebraic-graph-duoids] include base-4.19.2.0-0fde
  21816. 629.63 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-Bw08evgX6HDE1CE4MFJXj4
  21817. 629.63 s [algebraic-graph-duoids] include hedgehog-1.5-Cya8Y6QE8FkF1j7fe2PPQ4
  21818. 629.63 s [algebraic-graph-duoids] Ready component graph:
  21819. 629.63 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-2whhYeuPuJO4pVaQ2c1kpw
  21820. 629.63 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9
  21821. 629.63 s [algebraic-graph-duoids] depends base-4.19.2.0-0fde
  21822. 629.63 s [algebraic-graph-duoids] depends duoids-0.0.1.0-31Ok7dOwmhW8LBzagsluHW
  21823. 629.63 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-L7OryOp2PiG560fgOFWSEt-laws
  21824. 629.63 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-2whhYeuPuJO4pVaQ2c1kpw
  21825. 629.63 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-Lx7KCTShuMs7O8WJ5FrJm9
  21826. 629.63 s [algebraic-graph-duoids] depends base-4.19.2.0-0fde
  21827. 629.63 s [algebraic-graph-duoids] depends duoids-hedgehog-0.0.1.0-Bw08evgX6HDE1CE4MFJXj4
  21828. 629.63 s [algebraic-graph-duoids] depends hedgehog-1.5-Cya8Y6QE8FkF1j7fe2PPQ4
  21829. 629.63 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-QHcCAX7NnZEAvTf1KqRCe-doctests
  21830. 629.63 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-2whhYeuPuJO4pVaQ2c1kpw
  21831. 629.63 s [algebraic-graph-duoids] depends base-4.19.2.0-0fde
  21832. 629.63 s [algebraic-graph-duoids] depends doctest-0.22.6-1SxYZzGcAV168a12vQnyDt
  21833. 629.63 s [algebraic-graph-duoids] Using Cabal-3.12.1.0 compiled by ghc-9.8
  21834. 629.63 s [algebraic-graph-duoids] Using compiler: ghc-9.8.4
  21835. 629.63 s [algebraic-graph-duoids] Using install prefix:
  21836. 629.64 s [algebraic-graph-duoids] /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0
  21837. 629.64 s [algebraic-graph-duoids] Executables installed in:
  21838. 629.64 s [algebraic-graph-duoids] /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/bin
  21839. 629.64 s [algebraic-graph-duoids] Libraries installed in:
  21840. 629.64 s [algebraic-graph-duoids] /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-65e9/algebraic-graph-duoids-0.0.1.0-2whhYeuPuJO4pVaQ2c1kpw
  21841. 629.64 s [algebraic-graph-duoids] Dynamic Libraries installed in:
  21842. 629.64 s [algebraic-graph-duoids] /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-65e9
  21843. 629.64 s [algebraic-graph-duoids] Private executables installed in:
  21844. 629.64 s [algebraic-graph-duoids] /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.8.4-65e9/algebraic-graph-duoids-0.0.1.0
  21845. 629.64 s [algebraic-graph-duoids] Data files installed in:
  21846. 629.64 s [algebraic-graph-duoids] /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.8.4-65e9/algebraic-graph-duoids-0.0.1.0
  21847. 629.64 s [algebraic-graph-duoids] Documentation installed in:
  21848. 629.64 s [algebraic-graph-duoids] /nix/store/j09cn1lwhd7hw8845paqdnnwj30qb6s9-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
  21849. 629.64 s [algebraic-graph-duoids] Configuration files installed in:
  21850. 629.64 s [algebraic-graph-duoids] /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/etc
  21851. 629.64 s [algebraic-graph-duoids] No alex found
  21852. 629.64 s [algebraic-graph-duoids] Using ar found on system at:
  21853. 629.64 s [algebraic-graph-duoids] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  21854. 629.64 s [algebraic-graph-duoids] No c2hs found
  21855. 629.64 s [algebraic-graph-duoids] No cpphs found
  21856. 629.64 s [algebraic-graph-duoids] Using doctest version 0.22.6 found on system at:
  21857. 629.64 s [algebraic-graph-duoids] /nix/store/h8km0wljqv9v9b70lmcsxafwlrlbzw3q-doctest-0.22.6/bin/doctest
  21858. 629.64 s [algebraic-graph-duoids] Using gcc version 14.3.0 given by user at:
  21859. 629.64 s [algebraic-graph-duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  21860. 629.64 s [algebraic-graph-duoids] Using ghc version 9.8.4 found on system at:
  21861. 629.64 s [algebraic-graph-duoids] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc
  21862. 629.64 s [algebraic-graph-duoids] Using ghc-pkg version 9.8.4 found on system at:
  21863. 629.64 s [algebraic-graph-duoids] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/ghc-pkg-9.8.4
  21864. 629.64 s [algebraic-graph-duoids] No ghcjs found
  21865. 629.64 s [algebraic-graph-duoids] No ghcjs-pkg found
  21866. 629.64 s [algebraic-graph-duoids] No greencard found
  21867. 629.64 s [algebraic-graph-duoids] Using haddock version 2.30.0 found on system at:
  21868. 629.64 s [algebraic-graph-duoids] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/haddock-ghc-9.8.4
  21869. 629.64 s [algebraic-graph-duoids] No happy found
  21870. 629.64 s [algebraic-graph-duoids] Using haskell-suite found on system at: haskell-suite-dummy-location
  21871. 629.64 s [algebraic-graph-duoids] Using haskell-suite-pkg found on system at: haskell-suite-pkg-dummy-location
  21872. 629.64 s [algebraic-graph-duoids] No hmake found
  21873. 629.64 s [algebraic-graph-duoids] Using hpc version 0.69 found on system at:
  21874. 629.64 s [algebraic-graph-duoids] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hpc-ghc-9.8.4
  21875. 629.64 s [algebraic-graph-duoids] Using hsc2hs version 0.68.10 found on system at:
  21876. 629.64 s [algebraic-graph-duoids] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/hsc2hs-ghc-9.8.4
  21877. 629.64 s [algebraic-graph-duoids] Using hscolour version 1.25 found on system at:
  21878. 629.64 s [algebraic-graph-duoids] /nix/store/r9acd8dqp6xxbhlplifjikwk7bc6w7vf-hscolour-1.25/bin/HsColour
  21879. 629.64 s [algebraic-graph-duoids] No jhc found
  21880. 629.64 s [algebraic-graph-duoids] Using ld found on system at:
  21881. 629.64 s [algebraic-graph-duoids] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ld.gold
  21882. 629.64 s [algebraic-graph-duoids] No pkg-config found
  21883. 629.64 s [algebraic-graph-duoids] Using runghc version 9.8.4 found on system at:
  21884. 629.64 s [algebraic-graph-duoids] /nix/store/msyy53g0sxv03q6s3balv6qg14yn3wv4-ghc-9.8.4/bin/runghc-9.8.4
  21885. 629.64 s [algebraic-graph-duoids] Using strip version 2.44 found on system at:
  21886. 629.64 s [algebraic-graph-duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  21887. 629.64 s [algebraic-graph-duoids] Using tar found on system at:
  21888. 629.64 s [algebraic-graph-duoids] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  21889. 629.64 s [algebraic-graph-duoids] No uhc found
  21890. 629.79 s [algebraic-graph-duoids] Phase: buildPhase
  21891. 629.85 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  21892. 629.85 s [algebraic-graph-duoids] Building library for algebraic-graph-duoids-0.0.1.0...
  21893. 629.92 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.o, dist/build/Algebra/Graph/Duoid.dyn_o )
  21894. 629.97 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, dist/build/Algebra/Graph/Duoid/Orphans.o, dist/build/Algebra/Graph/Duoid/Orphans.dyn_o )
  21895. 630.85 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
  21896. 630.98 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, dist/build/Algebra/Graph/Duoid/Orphans.p_o )
  21897. 632.79 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  21898. 632.79 s [algebraic-graph-duoids] Building test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  21899. 632.87 s [algebraic-graph-duoids] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  21900. 633.15 s [algebraic-graph-duoids] [2 of 2] Linking dist/build/laws/laws
  21901. 633.99 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  21902. 633.99 s [algebraic-graph-duoids] Building test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  21903. 634.05 s [algebraic-graph-duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  21904. 634.24 s [algebraic-graph-duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  21905. 634.51 s [algebraic-graph-duoids] [3 of 3] Linking dist/build/doctests/doctests
  21906. 638.52 s [algebraic-graph-duoids] Phase: checkPhase
  21907. 638.78 s [algebraic-graph-duoids] Running 2 test suites...
  21908. 638.78 s [algebraic-graph-duoids] Test suite laws: RUNNING...
  21909. 638.82 s [algebraic-graph-duoids] ━━━ Duoid.Normal (Graph Word8) ━━━
  21910. 638.82 s [algebraic-graph-duoids] ✓ unswapUnit passed 100 tests.
  21911. 638.82 s [algebraic-graph-duoids] ✓ interchange passed 100 tests.
  21912. 638.82 s [algebraic-graph-duoids] ✓ splitUnit passed 100 tests.
  21913. 638.82 s [algebraic-graph-duoids] ✓ joinUnit passed 100 tests.
  21914. 638.82 s [algebraic-graph-duoids] ✓ swapUnit passed 100 tests.
  21915. 638.82 s [algebraic-graph-duoids] ✓ 5 succeeded.
  21916. 638.82 s [algebraic-graph-duoids] Test suite laws: PASS
  21917. 638.82 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
  21918. 638.82 s [algebraic-graph-duoids] Test suite doctests: RUNNING...
  21919. 639.21 s [algebraic-graph-duoids] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  21920. 639.25 s [algebraic-graph-duoids] Test suite doctests: PASS
  21921. 639.26 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
  21922. 639.26 s [algebraic-graph-duoids] 2 of 2 test suites (2 of 2 test cases) passed.
  21923. 639.26 s [algebraic-graph-duoids] Phase: haddockPhase
  21924. 639.40 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  21925. 639.40 s [algebraic-graph-duoids] Running Haddock on library for algebraic-graph-duoids-0.0.1.0...
  21926. 639.55 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, nothing )
  21927. 639.58 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, nothing )
  21928. 639.70 s [algebraic-graph-duoids] Haddock coverage:
  21929. 639.70 s [algebraic-graph-duoids] 20% ( 1 / 5) in 'Algebra.Graph.Duoid'
  21930. 639.70 s [algebraic-graph-duoids] Missing documentation for:
  21931. 639.70 s [algebraic-graph-duoids] parEmptyGraph (src/Algebra/Graph/Duoid.hs:24)
  21932. 639.70 s [algebraic-graph-duoids] seqEmptyGraph (src/Algebra/Graph/Duoid.hs:27)
  21933. 639.70 s [algebraic-graph-duoids] parGraph (src/Algebra/Graph/Duoid.hs:30)
  21934. 639.70 s [algebraic-graph-duoids] seqGraph (src/Algebra/Graph/Duoid.hs:33)
  21935. 639.70 s [algebraic-graph-duoids] 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans'
  21936. 642.32 s [algebraic-graph-duoids] Documentation created: dist/doc/html/algebraic-graph-duoids/,
  21937. 642.32 s [algebraic-graph-duoids] dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
  21938. 642.40 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  21939. 642.40 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  21940. 642.40 s [algebraic-graph-duoids] Phase: installPhase
  21941. 642.49 s [algebraic-graph-duoids] Installing library in /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-65e9/algebraic-graph-duoids-0.0.1.0-2whhYeuPuJO4pVaQ2c1kpw
  21942. 642.79 s [algebraic-graph-duoids] Phase: fixupPhase
  21943. 642.81 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0
  21944. 642.81 s [algebraic-graph-duoids] shrinking /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.8.4/lib/x86_64-linux-ghc-9.8.4-65e9/libHSalgebraic-graph-duoids-0.0.1.0-2whhYeuPuJO4pVaQ2c1kpw-ghc9.8.4.so
  21945. 642.82 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0...
  21946. 642.83 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0
  21947. 642.83 s [algebraic-graph-duoids] stripping (with command strip and flags -S -p) in /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/lib
  21948. 642.89 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/j09cn1lwhd7hw8845paqdnnwj30qb6s9-algebraic-graph-duoids-0.0.1.0-doc
  21949. 642.89 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/j09cn1lwhd7hw8845paqdnnwj30qb6s9-algebraic-graph-duoids-0.0.1.0-doc...
  21950. 642.90 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/j09cn1lwhd7hw8845paqdnnwj30qb6s9-algebraic-graph-duoids-0.0.1.0-doc
  21951. 643.03 s [algebraic-graph-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0 /nix/store/j09cn1lwhd7hw8845paqdnnwj30qb6s9-algebraic-graph-duoids-0.0.1.0-doc
  21952. 643.57 s [algebraic-graph-duoids:post-build] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  21953. 643.57 s [algebraic-graph-duoids:post-build]
  21954. 643.95 s [algebraic-graph-duoids:post-build] Pushing /nix/store/j09cn1lwhd7hw8845paqdnnwj30qb6s9-algebraic-graph-duoids-0.0.1.0-doc (523.23 KiB)
  21955. 644.03 s [algebraic-graph-duoids:post-build] Pushing /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0 (1.17 MiB)
  21956. 645.33 s [algebraic-graph-duoids:post-build]
  21957. 645.33 s [algebraic-graph-duoids:post-build] All done.
  21958. 645.47 s [algebraic-graph-duoids:post-build] Uploading to the NixCI cache: /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0 /nix/store/j09cn1lwhd7hw8845paqdnnwj30qb6s9-algebraic-graph-duoids-0.0.1.0-doc
  21959. 645.97 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21960. 646.04 s [algebraic-graph-duoids:post-build] copying 2 paths...
  21961. 646.04 s [algebraic-graph-duoids:post-build] copying path '/nix/store/j09cn1lwhd7hw8845paqdnnwj30qb6s9-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  21962. 646.68 s [algebraic-graph-duoids:post-build] copying path '/nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  21963. 647.56 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21964. 647.90 s [algebraic-graph-duoids:post-build] copying 1 paths...
  21965. 647.90 s [algebraic-graph-duoids:post-build] copying path '/nix/store/8paapna17628zqd15l0yqsm0s5iz2791-algebraic-graph-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  21966. 648.32 s Progress: 12 of 16 built, 193 of 193 downloaded from cache
  21967. 648.38 s Building /nix/store/kp84q0nss788rhm4vdsi14rp8b1z5srg-ghc-9.8.4-with-packages.drv
  21968. 648.43 s [ghc-9.8.4-with-packages] /nix/store/mds268rc67f03n2msm7vmcqk2zdhrjyy-duoidal-transformers-0.0.1.0/nix-support:
  21969. 648.43 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21970. 648.44 s [ghc-9.8.4-with-packages] /nix/store/xcidrcs0wxz6r6pw7xcxs83akrkddri9-duoids-hedgehog-0.0.1.0/nix-support:
  21971. 648.44 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21972. 648.44 s [ghc-9.8.4-with-packages] /nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7/nix-support:
  21973. 648.45 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21974. 648.45 s [ghc-9.8.4-with-packages] /nix/store/96kx9jsyik3l1jjvk1xzgi93rjls6zg4-algebraic-graphs-0.7/nix-support:
  21975. 648.45 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21976. 648.45 s [ghc-9.8.4-with-packages] /nix/store/05qyk65c1shbrqjc7vqzxag74bnxvaq1-hedgehog-1.5/nix-support:
  21977. 648.45 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21978. 648.46 s [ghc-9.8.4-with-packages] /nix/store/05qyk65c1shbrqjc7vqzxag74bnxvaq1-hedgehog-1.5/nix-support:
  21979. 648.46 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21980. 648.46 s [ghc-9.8.4-with-packages] /nix/store/gc8avbpvjcibdnjrkl9ps945i6zvdwbv-ansi-terminal-1.1.2/nix-support:
  21981. 648.46 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21982. 648.46 s [ghc-9.8.4-with-packages] /nix/store/gc8avbpvjcibdnjrkl9ps945i6zvdwbv-ansi-terminal-1.1.2/nix-support:
  21983. 648.46 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21984. 648.46 s [ghc-9.8.4-with-packages] /nix/store/0x3g5r8w4inijvjc7pcyqlw650vb3rnb-async-2.2.5/nix-support:
  21985. 648.46 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21986. 648.47 s [ghc-9.8.4-with-packages] /nix/store/0x3g5r8w4inijvjc7pcyqlw650vb3rnb-async-2.2.5/nix-support:
  21987. 648.47 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21988. 648.47 s [ghc-9.8.4-with-packages] /nix/store/q3421n66zfljcflm11p2wp5nvqfia69g-barbies-2.1.1.0/nix-support:
  21989. 648.47 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21990. 648.47 s [ghc-9.8.4-with-packages] /nix/store/q3421n66zfljcflm11p2wp5nvqfia69g-barbies-2.1.1.0/nix-support:
  21991. 648.47 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21992. 648.47 s [ghc-9.8.4-with-packages] /nix/store/v8xymh45cr4k3k4b56hz1r3qinzk29wz-concurrent-output-1.10.21/nix-support:
  21993. 648.47 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21994. 648.48 s [ghc-9.8.4-with-packages] /nix/store/v8xymh45cr4k3k4b56hz1r3qinzk29wz-concurrent-output-1.10.21/nix-support:
  21995. 648.48 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21996. 648.49 s [ghc-9.8.4-with-packages] /nix/store/cfxpng8d80cmmlalbh8f21pxp85c2dz3-lifted-async-0.10.2.7/nix-support:
  21997. 648.49 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21998. 648.49 s [ghc-9.8.4-with-packages] /nix/store/cfxpng8d80cmmlalbh8f21pxp85c2dz3-lifted-async-0.10.2.7/nix-support:
  21999. 648.49 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22000. 648.50 s [ghc-9.8.4-with-packages] /nix/store/k87b2b9xcgmrhhizqpiy26yd6z14qpkl-mmorph-1.2.0/nix-support:
  22001. 648.50 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22002. 648.50 s [ghc-9.8.4-with-packages] /nix/store/k87b2b9xcgmrhhizqpiy26yd6z14qpkl-mmorph-1.2.0/nix-support:
  22003. 648.50 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22004. 648.50 s [ghc-9.8.4-with-packages] /nix/store/igy0gd14fy06120y39imjqrnrk1cyhpf-monad-control-1.0.3.1/nix-support:
  22005. 648.50 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22006. 648.50 s [ghc-9.8.4-with-packages] /nix/store/igy0gd14fy06120y39imjqrnrk1cyhpf-monad-control-1.0.3.1/nix-support:
  22007. 648.50 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22008. 648.50 s [ghc-9.8.4-with-packages] /nix/store/lq8c7i21ncvzyhjwmhaay22iyclad2aa-pretty-show-1.10/nix-support:
  22009. 648.50 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22010. 648.51 s [ghc-9.8.4-with-packages] /nix/store/lq8c7i21ncvzyhjwmhaay22iyclad2aa-pretty-show-1.10/nix-support:
  22011. 648.51 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22012. 648.51 s [ghc-9.8.4-with-packages] /nix/store/nslx6fk53ajsc8d81c4zzxd3rviidjx6-primitive-0.9.1.0/nix-support:
  22013. 648.51 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22014. 648.51 s [ghc-9.8.4-with-packages] /nix/store/nslx6fk53ajsc8d81c4zzxd3rviidjx6-primitive-0.9.1.0/nix-support:
  22015. 648.52 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22016. 648.52 s [ghc-9.8.4-with-packages] /nix/store/22kib1a6y1rl1zgh160w596fx8xsn7g2-random-1.2.1.3/nix-support:
  22017. 648.52 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22018. 648.52 s [ghc-9.8.4-with-packages] /nix/store/22kib1a6y1rl1zgh160w596fx8xsn7g2-random-1.2.1.3/nix-support:
  22019. 648.52 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22020. 648.52 s [ghc-9.8.4-with-packages] /nix/store/y9sv8w7adkfnja74yrp5lmybs1g62mvn-resourcet-1.3.0/nix-support:
  22021. 648.52 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22022. 648.53 s [ghc-9.8.4-with-packages] /nix/store/y9sv8w7adkfnja74yrp5lmybs1g62mvn-resourcet-1.3.0/nix-support:
  22023. 648.53 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22024. 648.53 s [ghc-9.8.4-with-packages] /nix/store/m72yp6p8f0333f8529bjp9ygiiij8c5i-safe-exceptions-0.1.7.4/nix-support:
  22025. 648.53 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22026. 648.53 s [ghc-9.8.4-with-packages] /nix/store/m72yp6p8f0333f8529bjp9ygiiij8c5i-safe-exceptions-0.1.7.4/nix-support:
  22027. 648.53 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22028. 648.54 s [ghc-9.8.4-with-packages] /nix/store/7hi6qv8c2bjlsyqhfrg3aym3fqxrwgi5-transformers-base-0.4.6/nix-support:
  22029. 648.54 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22030. 648.54 s [ghc-9.8.4-with-packages] /nix/store/7hi6qv8c2bjlsyqhfrg3aym3fqxrwgi5-transformers-base-0.4.6/nix-support:
  22031. 648.54 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22032. 648.55 s [ghc-9.8.4-with-packages] /nix/store/rp2mkmmmy4kpdz71arc2g66xiwdgza84-wl-pprint-annotated-0.1.0.1/nix-support:
  22033. 648.55 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22034. 648.55 s [ghc-9.8.4-with-packages] /nix/store/rp2mkmmmy4kpdz71arc2g66xiwdgza84-wl-pprint-annotated-0.1.0.1/nix-support:
  22035. 648.55 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22036. 648.55 s [ghc-9.8.4-with-packages] /nix/store/dk8hms790k0w3h8hmnmgarqzishh86nn-ansi-terminal-types-1.1/nix-support:
  22037. 648.55 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22038. 648.55 s [ghc-9.8.4-with-packages] /nix/store/dk8hms790k0w3h8hmnmgarqzishh86nn-ansi-terminal-types-1.1/nix-support:
  22039. 648.55 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22040. 648.56 s [ghc-9.8.4-with-packages] /nix/store/kfbfsnxral0w42frwi0n155kfb0az59p-hashable-1.4.7.0/nix-support:
  22041. 648.56 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22042. 648.56 s [ghc-9.8.4-with-packages] /nix/store/kfbfsnxral0w42frwi0n155kfb0az59p-hashable-1.4.7.0/nix-support:
  22043. 648.56 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22044. 648.57 s [ghc-9.8.4-with-packages] /nix/store/y83s590yi5zffqrvy29pbajz7bzhhfbw-distributive-0.6.2.1/nix-support:
  22045. 648.57 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22046. 648.57 s [ghc-9.8.4-with-packages] /nix/store/y83s590yi5zffqrvy29pbajz7bzhhfbw-distributive-0.6.2.1/nix-support:
  22047. 648.57 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22048. 648.58 s [ghc-9.8.4-with-packages] /nix/store/s8njrf8ixdd5vg4fh4wddyvrdb999yrh-constraints-0.14.2/nix-support:
  22049. 648.58 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22050. 648.58 s [ghc-9.8.4-with-packages] /nix/store/s8njrf8ixdd5vg4fh4wddyvrdb999yrh-constraints-0.14.2/nix-support:
  22051. 648.58 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22052. 648.58 s [ghc-9.8.4-with-packages] /nix/store/41pwy59kq8hr2pmfgb0r3mmb5rrfzns2-lifted-base-0.2.3.12/nix-support:
  22053. 648.58 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22054. 648.58 s [ghc-9.8.4-with-packages] /nix/store/41pwy59kq8hr2pmfgb0r3mmb5rrfzns2-lifted-base-0.2.3.12/nix-support:
  22055. 648.58 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22056. 648.59 s [ghc-9.8.4-with-packages] /nix/store/dr9xgradrnf4h1h9x60p1xb72cn3p8fv-transformers-compat-0.7.2/nix-support:
  22057. 648.59 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22058. 648.59 s [ghc-9.8.4-with-packages] /nix/store/dr9xgradrnf4h1h9x60p1xb72cn3p8fv-transformers-compat-0.7.2/nix-support:
  22059. 648.59 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22060. 648.60 s [ghc-9.8.4-with-packages] /nix/store/96sdcl720nmjgw2bylcz15nl4mdckizg-splitmix-0.1.1/nix-support:
  22061. 648.60 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22062. 648.61 s [ghc-9.8.4-with-packages] /nix/store/96sdcl720nmjgw2bylcz15nl4mdckizg-splitmix-0.1.1/nix-support:
  22063. 648.61 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22064. 648.61 s [ghc-9.8.4-with-packages] /nix/store/pbm6qyph490kvgm1fyigwgka0wl5xdyj-unliftio-core-0.2.1.0/nix-support:
  22065. 648.61 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22066. 648.61 s [ghc-9.8.4-with-packages] /nix/store/pbm6qyph490kvgm1fyigwgka0wl5xdyj-unliftio-core-0.2.1.0/nix-support:
  22067. 648.61 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22068. 648.61 s [ghc-9.8.4-with-packages] /nix/store/fj85ywn4bs4jhzjwifs0wgmw81nj1d9y-base-orphans-0.9.3/nix-support:
  22069. 648.61 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22070. 648.62 s [ghc-9.8.4-with-packages] /nix/store/fj85ywn4bs4jhzjwifs0wgmw81nj1d9y-base-orphans-0.9.3/nix-support:
  22071. 648.62 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22072. 648.62 s [ghc-9.8.4-with-packages] /nix/store/qzb22s8112hp4b56sch60b175llbwr48-os-string-2.0.7/nix-support:
  22073. 648.62 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22074. 648.62 s [ghc-9.8.4-with-packages] /nix/store/qzb22s8112hp4b56sch60b175llbwr48-os-string-2.0.7/nix-support:
  22075. 648.62 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22076. 648.62 s [ghc-9.8.4-with-packages] /nix/store/1qmb9qqv99v9sidaq29l2hk4p53456r5-tagged-0.8.8/nix-support:
  22077. 648.62 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22078. 648.62 s [ghc-9.8.4-with-packages] /nix/store/1qmb9qqv99v9sidaq29l2hk4p53456r5-tagged-0.8.8/nix-support:
  22079. 648.62 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22080. 648.62 s [ghc-9.8.4-with-packages] /nix/store/sq2w21axyl4kf0qryq48s49qy8sr970c-boring-0.2.2/nix-support:
  22081. 648.63 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22082. 648.63 s [ghc-9.8.4-with-packages] /nix/store/sq2w21axyl4kf0qryq48s49qy8sr970c-boring-0.2.2/nix-support:
  22083. 648.63 s [ghc-9.8.4-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/80w67xqa0pcysh551xr5sxfvizirrmwv-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22084. 649.39 s [ghc-9.8.4-with-packages] Warning: include-dirs: /nix/store/c9imhdcg96c0a8r13kq791v13lyy83gp-ghc-9.8.4-with-packages/lib/ghc-9.8.4/lib/../lib/x86_64-linux-ghc-9.8.4/directory-1.3.8.5-b132/include doesn't exist or isn't a directory
  22085. 650.55 s [ghc-9.8.4-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/c9imhdcg96c0a8r13kq791v13lyy83gp-ghc-9.8.4-with-packages
  22086. 651.24 s [ghc-9.8.4-with-packages:post-build] Pushing 1 paths (140 are already present) using zstd to cache sellout ⏳
  22087. 651.24 s [ghc-9.8.4-with-packages:post-build]
  22088. 651.60 s [ghc-9.8.4-with-packages:post-build] Pushing /nix/store/c9imhdcg96c0a8r13kq791v13lyy83gp-ghc-9.8.4-with-packages (4.37 MiB)
  22089. 653.45 s [ghc-9.8.4-with-packages:post-build]
  22090. 653.45 s [ghc-9.8.4-with-packages:post-build] All done.
  22091. 653.57 s [ghc-9.8.4-with-packages:post-build] Uploading to the NixCI cache: /nix/store/c9imhdcg96c0a8r13kq791v13lyy83gp-ghc-9.8.4-with-packages
  22092. 653.85 s [ghc-9.8.4-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22093. 654.09 s [ghc-9.8.4-with-packages:post-build] copying 1 paths...
  22094. 654.09 s [ghc-9.8.4-with-packages:post-build] copying path '/nix/store/c9imhdcg96c0a8r13kq791v13lyy83gp-ghc-9.8.4-with-packages' to 'https://cache.nix-ci.com'...
  22095. 655.69 s [ghc-9.8.4-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22096. 656.00 s [ghc-9.8.4-with-packages:post-build] copying 1 paths...
  22097. 656.00 s [ghc-9.8.4-with-packages:post-build] copying path '/nix/store/kp84q0nss788rhm4vdsi14rp8b1z5srg-ghc-9.8.4-with-packages.drv' to 'https://cache.nix-ci.com'...
  22098. 656.53 s Progress: 13 of 15 built, 193 of 193 downloaded from cache
  22099. 656.60 s Building /nix/store/s6cwjhag1xjiwbfzp160i9w3cafl5jal-all-packages.drv
  22100. 656.68 s [all-packages] created 3 symlinks in user environment
  22101. 656.72 s [all-packages:post-build] Uploading to cachix cache "sellout": /nix/store/mp70qmlfl7w4jw7744nyg67bqlgslggc-all-packages
  22102. 657.29 s [all-packages:post-build] Pushing 1 paths (141 are already present) using zstd to cache sellout ⏳
  22103. 657.29 s [all-packages:post-build]
  22104. 657.66 s [all-packages:post-build] Pushing /nix/store/mp70qmlfl7w4jw7744nyg67bqlgslggc-all-packages (872.00 B)
  22105. 658.61 s [all-packages:post-build]
  22106. 658.61 s [all-packages:post-build] All done.
  22107. 658.65 s [all-packages:post-build] Uploading to the NixCI cache: /nix/store/mp70qmlfl7w4jw7744nyg67bqlgslggc-all-packages
  22108. 658.71 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22109. 658.95 s [all-packages:post-build] copying 1 paths...
  22110. 658.95 s [all-packages:post-build] copying path '/nix/store/mp70qmlfl7w4jw7744nyg67bqlgslggc-all-packages' to 'https://cache.nix-ci.com'...
  22111. 659.28 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22112. 659.60 s [all-packages:post-build] copying 1 paths...
  22113. 659.60 s [all-packages:post-build] copying path '/nix/store/s6cwjhag1xjiwbfzp160i9w3cafl5jal-all-packages.drv' to 'https://cache.nix-ci.com'...
  22114. 659.83 s Progress: 14 of 15 built, 193 of 193 downloaded from cache
  22115. 659.83 s Progress: 15 of 15 built, 193 of 193 downloaded from cache
  22116. 659.83 s /nix/store/mp70qmlfl7w4jw7744nyg67bqlgslggc-all-packages
  22117. 659.89 s Build succeeded.
Tail Raw Logs