1. 0.14 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.ghc9121_all --print-build-logs
  2. 0.19 s warning: ignoring untrusted flake configuration setting 'allow-import-from-derivation'.
  3. 0.19 s Pass '--accept-flake-config' to trust it
  4. 0.19 s warning: ignoring untrusted flake configuration setting 'extra-experimental-features'.
  5. 0.19 s Pass '--accept-flake-config' to trust it
  6. 0.19 s warning: ignoring untrusted flake configuration setting 'extra-substituters'.
  7. 0.19 s Pass '--accept-flake-config' to trust it
  8. 0.19 s warning: ignoring untrusted flake configuration setting 'extra-trusted-public-keys'.
  9. 0.19 s Pass '--accept-flake-config' to trust it
  10. 0.19 s warning: ignoring untrusted flake configuration setting 'sandbox'.
  11. 0.19 s Pass '--accept-flake-config' to trust it
  12. 0.19 s warning: ignoring untrusted flake configuration setting 'use-registries'.
  13. 0.19 s Pass '--accept-flake-config' to trust it
  14. 0.19 s error (ignored): SQLite database '/var/cache/nix-ci-worker/eval-cache-v6/332ac380fc21d537dd399ae00234081c7a9833ea642f2fa8bbeeaa4b8bf81126.sqlite' is busy
  15. 0.19 s
  16. 0.19 s Downloading cached source from https://cache.nix-ci.com
  17. 6.94 s Progress: 1 of 1 downloaded from cache
  18. 11.70 s
  19. 11.89 s Downloading cached glibc-locales-2.40 from https://cache.nix-ci.com
  20. 11.93 s Downloading cached distribution-nixpkgs-1.7.1.1-data from https://cache.nix-ci.com
  21. 11.93 s Downloading cached gnu-config-2024-01 from https://cache.nix-ci.com
  22. 11.93 s Downloading cached xgcc-14.3.0-libgcc from https://cache.nix-ci.com
  23. 11.93 s Downloading cached gcc-14.3.0-libgcc from https://cache.nix-ci.com
  24. 11.93 s Downloading cached libunistring from https://cache.nix-ci.com
  25. 11.93 s Downloading cached publicsuffix-list-0-unstable-2025-03 from https://cache.nix-ci.com
  26. 11.97 s Progress: 0 of 5 built, 1 of 49 downloaded from cache (6 downloading)
  27. 11.98 s Progress: 0 of 5 built, 2 of 49 downloaded from cache (5 downloading)
  28. 11.98 s Downloading cached update-autotools-gnu-config-scripts-hook from https://cache.nix-ci.com
  29. 12.08 s Progress: 0 of 5 built, 3 of 49 downloaded from cache (5 downloading)
  30. 12.08 s Progress: 0 of 5 built, 4 of 49 downloaded from cache (4 downloading)
  31. 12.08 s Progress: 0 of 5 built, 5 of 49 downloaded from cache (3 downloading)
  32. 12.12 s Progress: 0 of 5 built, 6 of 49 downloaded from cache (2 downloading)
  33. 12.12 s Progress: 0 of 5 built, 7 of 49 downloaded from cache (1 downloading)
  34. 12.12 s Downloading cached libidn2 from https://cache.nix-ci.com
  35. 12.12 s Progress: 0 of 5 built, 8 of 49 downloaded from cache (1 downloading)
  36. 12.12 s Downloading cached glibc-2.40 from https://cache.nix-ci.com
  37. 13.29 s Progress: 0 of 5 built, 9 of 49 downloaded from cache (1 downloading)
  38. 13.29 s Downloading cached attr from https://cache.nix-ci.com
  39. 13.29 s Downloading cached bash from https://cache.nix-ci.com
  40. 13.29 s Downloading cached bzip2 from https://cache.nix-ci.com
  41. 13.29 s Downloading cached brotli-1.1.0-lib from https://cache.nix-ci.com
  42. 13.29 s Downloading cached gawk from https://cache.nix-ci.com
  43. 13.29 s Downloading cached gcc-14.3.0-lib from https://cache.nix-ci.com
  44. 13.29 s Downloading cached gnumake from https://cache.nix-ci.com
  45. 13.29 s Downloading cached gnused from https://cache.nix-ci.com
  46. 13.29 s Downloading cached keyutils-1.6.3-lib from https://cache.nix-ci.com
  47. 13.29 s Downloading cached libffi from https://cache.nix-ci.com
  48. 13.29 s Downloading cached ed from https://cache.nix-ci.com
  49. 13.29 s Downloading cached json-c from https://cache.nix-ci.com
  50. 13.29 s Downloading cached nghttp2-1.65.0-lib from https://cache.nix-ci.com
  51. 13.29 s Downloading cached openssl from https://cache.nix-ci.com
  52. 13.29 s Progress: 0 of 5 built, 10 of 49 downloaded from cache (15 downloading)
  53. 13.29 s Progress: 0 of 5 built, 11 of 49 downloaded from cache (14 downloading)
  54. 13.29 s Progress: 0 of 5 built, 12 of 49 downloaded from cache (13 downloading)
  55. 13.29 s Progress: 0 of 5 built, 13 of 49 downloaded from cache (12 downloading)
  56. 13.29 s Progress: 0 of 5 built, 14 of 49 downloaded from cache (11 downloading)
  57. 13.29 s Progress: 0 of 5 built, 15 of 49 downloaded from cache (10 downloading)
  58. 13.29 s Progress: 0 of 5 built, 16 of 49 downloaded from cache (9 downloading)
  59. 13.29 s Progress: 0 of 5 built, 17 of 49 downloaded from cache (8 downloading)
  60. 13.29 s Progress: 0 of 5 built, 18 of 49 downloaded from cache (7 downloading)
  61. 13.29 s Progress: 0 of 5 built, 19 of 49 downloaded from cache (6 downloading)
  62. 13.29 s Progress: 0 of 5 built, 20 of 49 downloaded from cache (5 downloading)
  63. 13.29 s Progress: 0 of 5 built, 21 of 49 downloaded from cache (4 downloading)
  64. 13.29 s Downloading cached libpsl from https://cache.nix-ci.com
  65. 13.29 s Downloading cached pcre2 from https://cache.nix-ci.com
  66. 13.29 s Downloading cached xz from https://cache.nix-ci.com
  67. 13.29 s Downloading cached zlib from https://cache.nix-ci.com
  68. 13.30 s Downloading cached acl from https://cache.nix-ci.com
  69. 13.30 s Downloading cached bzip2-1.0.8-bin from https://cache.nix-ci.com
  70. 13.30 s Downloading cached gmp-with-cxx from https://cache.nix-ci.com
  71. 13.30 s Downloading cached gmp-with-cxx from https://cache.nix-ci.com
  72. 13.30 s Downloading cached gzip from https://cache.nix-ci.com
  73. 13.30 s Downloading cached patch from https://cache.nix-ci.com
  74. 13.30 s Downloading cached patchelf from https://cache.nix-ci.com
  75. 13.30 s Downloading cached zstd from https://cache.nix-ci.com
  76. 13.30 s Progress: 0 of 4 built, 22 of 49 downloaded from cache (14 downloading)
  77. 13.30 s Progress: 0 of 4 built, 23 of 49 downloaded from cache (13 downloading)
  78. 13.30 s Progress: 0 of 4 built, 24 of 49 downloaded from cache (12 downloading)
  79. 13.30 s Progress: 0 of 4 built, 25 of 49 downloaded from cache (11 downloading)
  80. 13.30 s Progress: 0 of 4 built, 26 of 49 downloaded from cache (10 downloading)
  81. 13.30 s Progress: 0 of 4 built, 27 of 49 downloaded from cache (9 downloading)
  82. 13.30 s Progress: 0 of 4 built, 28 of 49 downloaded from cache (8 downloading)
  83. 13.30 s Progress: 0 of 4 built, 29 of 49 downloaded from cache (7 downloading)
  84. 13.30 s Progress: 0 of 4 built, 30 of 49 downloaded from cache (6 downloading)
  85. 13.30 s Progress: 0 of 4 built, 31 of 49 downloaded from cache (5 downloading)
  86. 13.30 s Progress: 0 of 4 built, 32 of 49 downloaded from cache (4 downloading)
  87. 13.30 s Progress: 0 of 4 built, 33 of 49 downloaded from cache (3 downloading)
  88. 13.30 s Progress: 0 of 4 built, 34 of 49 downloaded from cache (2 downloading)
  89. 13.30 s Progress: 0 of 4 built, 35 of 49 downloaded from cache (1 downloading)
  90. 13.30 s Downloading cached coreutils from https://cache.nix-ci.com
  91. 13.30 s Downloading cached file from https://cache.nix-ci.com
  92. 13.30 s Downloading cached gnugrep from https://cache.nix-ci.com
  93. 13.30 s Downloading cached gnutar from https://cache.nix-ci.com
  94. 13.30 s Downloading cached krb5-1.21.3-lib from https://cache.nix-ci.com
  95. 13.30 s Downloading cached libssh2 from https://cache.nix-ci.com
  96. 13.30 s Downloading cached xz-5.8.1-bin from https://cache.nix-ci.com
  97. 13.30 s Progress: 0 of 4 built, 36 of 49 downloaded from cache (7 downloading)
  98. 13.30 s Progress: 0 of 4 built, 37 of 49 downloaded from cache (6 downloading)
  99. 13.30 s Progress: 0 of 4 built, 38 of 49 downloaded from cache (5 downloading)
  100. 13.30 s Progress: 0 of 4 built, 39 of 49 downloaded from cache (4 downloading)
  101. 13.30 s Progress: 0 of 4 built, 40 of 49 downloaded from cache (3 downloading)
  102. 13.30 s Progress: 0 of 4 built, 41 of 49 downloaded from cache (2 downloading)
  103. 13.30 s Downloading cached curl from https://cache.nix-ci.com
  104. 13.30 s Downloading cached findutils from https://cache.nix-ci.com
  105. 13.30 s Downloading cached diffutils from https://cache.nix-ci.com
  106. 13.30 s Progress: 0 of 4 built, 42 of 49 downloaded from cache (4 downloading)
  107. 13.30 s Progress: 0 of 4 built, 43 of 49 downloaded from cache (3 downloading)
  108. 13.30 s Downloading cached elfutils from https://cache.nix-ci.com
  109. 13.30 s Progress: 0 of 4 built, 44 of 49 downloaded from cache (3 downloading)
  110. 13.30 s Progress: 0 of 4 built, 45 of 49 downloaded from cache (2 downloading)
  111. 13.30 s Progress: 0 of 4 built, 46 of 49 downloaded from cache (2 downloading)
  112. 13.30 s Downloading cached stdenv-linux from https://cache.nix-ci.com
  113. 13.30 s Progress: 0 of 4 built, 47 of 49 downloaded from cache (2 downloading)
  114. 13.30 s Downloading cached cabal2nix from https://cache.nix-ci.com
  115. 13.65 s Progress: 0 of 3 built, 48 of 49 downloaded from cache (1 downloading)
  116. 13.81 s Progress: 0 of 2 built, 49 of 49 downloaded from cache
  117. 13.84 s Building /nix/store/p7if10bksi00jwyasyrh7jzvvwichfs0-cabal2nix-algebraic-graph-duoids.drv
  118. 13.91 s [cabal2nix-algebraic-graph-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/rcc28f28zivgvzfyyfmi5qm538ypczhl-cabal2nix-algebraic-graph-duoids
  119. 14.33 s [cabal2nix-algebraic-graph-duoids:post-build] Nothing to push - all store paths are already on Cachix.
  120. 14.35 s [cabal2nix-algebraic-graph-duoids:post-build] Uploading to the NixCI cache: /nix/store/rcc28f28zivgvzfyyfmi5qm538ypczhl-cabal2nix-algebraic-graph-duoids
  121. 14.39 s [cabal2nix-algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  122. 14.59 s [cabal2nix-algebraic-graph-duoids:post-build] copying 1 paths...
  123. 14.59 s [cabal2nix-algebraic-graph-duoids:post-build] copying path '/nix/store/rcc28f28zivgvzfyyfmi5qm538ypczhl-cabal2nix-algebraic-graph-duoids' to 'https://cache.nix-ci.com'...
  124. 14.71 s [cabal2nix-algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  125. 26.08 s [cabal2nix-algebraic-graph-duoids:post-build] copying 0 paths...
  126. 26.09 s Progress: 1 of 2 built, 49 of 49 downloaded from cache
  127. 26.09 s Progress: 2 of 2 built, 49 of 49 downloaded from cache
  128. 26.13 s Progress: 49 of 49 downloaded from cache
  129. 26.13 s
  130. 26.13 s Building /nix/store/dfidszfslhr88gb9m6hb1iwv55wdskv2-cabal2nix-duoidal-transformers.drv
  131. 26.18 s [cabal2nix-duoidal-transformers:post-build] Uploading to cachix cache "sellout": /nix/store/05ccfiaxymxikx47da3xvb8r4yd3z38s-cabal2nix-duoidal-transformers
  132. 26.70 s [cabal2nix-duoidal-transformers:post-build] Nothing to push - all store paths are already on Cachix.
  133. 26.72 s [cabal2nix-duoidal-transformers:post-build] Uploading to the NixCI cache: /nix/store/05ccfiaxymxikx47da3xvb8r4yd3z38s-cabal2nix-duoidal-transformers
  134. 26.76 s [cabal2nix-duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  135. 26.96 s [cabal2nix-duoidal-transformers:post-build] copying 1 paths...
  136. 26.96 s [cabal2nix-duoidal-transformers:post-build] copying path '/nix/store/05ccfiaxymxikx47da3xvb8r4yd3z38s-cabal2nix-duoidal-transformers' to 'https://cache.nix-ci.com'...
  137. 27.07 s [cabal2nix-duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  138. 27.22 s [cabal2nix-duoidal-transformers:post-build] copying 0 paths...
  139. 27.23 s Progress: 1 of 2 built
  140. 27.23 s Progress: 2 of 2 built
  141. 27.24 s
  142. 27.26 s Building /nix/store/40mrmx2226h3rfyblimd2l75igr2h487-cabal2nix-duoids.drv
  143. 27.33 s [cabal2nix-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/24h2c1i505gbldvvb0chidjyi58cavr4-cabal2nix-duoids
  144. 27.75 s [cabal2nix-duoids:post-build] Nothing to push - all store paths are already on Cachix.
  145. 27.77 s [cabal2nix-duoids:post-build] Uploading to the NixCI cache: /nix/store/24h2c1i505gbldvvb0chidjyi58cavr4-cabal2nix-duoids
  146. 27.81 s [cabal2nix-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  147. 28.02 s [cabal2nix-duoids:post-build] copying 1 paths...
  148. 28.02 s [cabal2nix-duoids:post-build] copying path '/nix/store/24h2c1i505gbldvvb0chidjyi58cavr4-cabal2nix-duoids' to 'https://cache.nix-ci.com'...
  149. 28.13 s [cabal2nix-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  150. 28.27 s [cabal2nix-duoids:post-build] copying 0 paths...
  151. 28.28 s Progress: 1 of 2 built
  152. 28.28 s Progress: 2 of 2 built
  153. 28.29 s
  154. 28.31 s Building /nix/store/wmlc8xjax0lyj7r10r9kqxbgcgclhrq0-cabal2nix-duoids-hedgehog.drv
  155. 28.38 s [cabal2nix-duoids-hedgehog:post-build] Uploading to cachix cache "sellout": /nix/store/q99sq6igakiyvp9z9na3m10cngk21r8f-cabal2nix-duoids-hedgehog
  156. 28.81 s [cabal2nix-duoids-hedgehog:post-build] Nothing to push - all store paths are already on Cachix.
  157. 28.82 s [cabal2nix-duoids-hedgehog:post-build] Uploading to the NixCI cache: /nix/store/q99sq6igakiyvp9z9na3m10cngk21r8f-cabal2nix-duoids-hedgehog
  158. 28.86 s [cabal2nix-duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  159. 29.07 s [cabal2nix-duoids-hedgehog:post-build] copying 1 paths...
  160. 29.07 s [cabal2nix-duoids-hedgehog:post-build] copying path '/nix/store/q99sq6igakiyvp9z9na3m10cngk21r8f-cabal2nix-duoids-hedgehog' to 'https://cache.nix-ci.com'...
  161. 29.23 s [cabal2nix-duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  162. 29.39 s [cabal2nix-duoids-hedgehog:post-build] copying 0 paths...
  163. 29.41 s Progress: 1 of 2 built
  164. 29.41 s Progress: 2 of 2 built
  165. 30.56 s
  166. 35.57 s Downloading cached base-orphans-0.9.3-doc from https://sellout.cachix.org
  167. 35.62 s Downloading cached colour-2.3.6-data from https://sellout.cachix.org
  168. 35.62 s Downloading cached pretty-show-1.10-data from https://sellout.cachix.org
  169. 35.62 s Downloading cached ghc-9.12.1-doc from https://cache.nix-ci.com
  170. 35.62 s Downloading cached binutils-wrapper from https://cache.nix-ci.com
  171. 35.62 s Downloading cached gcc from https://cache.nix-ci.com
  172. 35.62 s Downloading cached hscolour from https://sellout.cachix.org
  173. 35.62 s Downloading cached extra from https://cache.nix-ci.com
  174. 35.62 s Downloading cached jailbreak-cabal from https://sellout.cachix.org
  175. 35.67 s Progress: 0 of 78 built, 1 of 145 downloaded from cache (8 downloading)
  176. 35.94 s Progress: 0 of 78 built, 2 of 145 downloaded from cache (7 downloading)
  177. 35.99 s Progress: 0 of 77 built, 3 of 145 downloaded from cache (6 downloading)
  178. 36.00 s Progress: 0 of 77 built, 4 of 145 downloaded from cache (5 downloading)
  179. 36.04 s Progress: 0 of 77 built, 5 of 145 downloaded from cache (4 downloading)
  180. 36.05 s Progress: 0 of 77 built, 6 of 145 downloaded from cache (3 downloading)
  181. 36.07 s Progress: 0 of 76 built, 7 of 145 downloaded from cache (2 downloading)
  182. 43.39 s Progress: 0 of 75 built, 8 of 145 downloaded from cache (1 downloading)
  183. 43.44 s Downloading cached gcc-wrapper from https://cache.nix-ci.com
  184. 43.44 s Progress: 0 of 75 built, 9 of 145 downloaded from cache (1 downloading)
  185. 43.44 s Downloading cached stdenv-linux from https://cache.nix-ci.com
  186. 43.44 s Progress: 0 of 75 built, 10 of 145 downloaded from cache (1 downloading)
  187. 49.61 s Progress: 0 of 74 built, 11 of 145 downloaded from cache
  188. 49.61 s Downloading cached Cabal-syntax-3.12.1.0-doc from https://sellout.cachix.org
  189. 49.64 s Downloading cached OneTuple-0.4.2-doc from https://sellout.cachix.org
  190. 49.64 s Downloading cached assoc-1.1.1-doc from https://sellout.cachix.org
  191. 49.64 s Downloading cached cabal-doctest-1.0.11-doc from https://sellout.cachix.org
  192. 49.64 s Downloading cached call-stack-0.4.0-doc from https://sellout.cachix.org
  193. 49.64 s Downloading cached clock-0.8.4-doc from https://sellout.cachix.org
  194. 49.64 s Downloading cached code-page-0.2.1-doc from https://sellout.cachix.org
  195. 49.64 s Downloading cached colour-2.3.6-doc from https://sellout.cachix.org
  196. 49.64 s Downloading cached erf-2.0.0.0-doc from https://sellout.cachix.org
  197. 49.64 s Downloading cached ghc from https://cache.nix-ci.com
  198. 49.64 s Downloading cached ghc-paths-0.1.0.12-doc from https://sellout.cachix.org
  199. 49.64 s Downloading cached hashable-1.4.7.0-doc from https://sellout.cachix.org
  200. 49.64 s Downloading cached haskell-lexer-1.1.2-doc from https://sellout.cachix.org
  201. 49.64 s Downloading cached inspection-testing-0.5.0.3-doc from https://sellout.cachix.org
  202. 49.64 s Downloading cached integer-logarithms-1.0.4-doc from https://sellout.cachix.org
  203. 49.64 s Downloading cached mmorph-1.2.0-doc from https://sellout.cachix.org
  204. 49.96 s Progress: 0 of 73 built, 12 of 145 downloaded from cache (15 downloading)
  205. 49.96 s Downloading cached old-locale-1.0.0.7-doc from https://sellout.cachix.org
  206. 49.98 s Progress: 0 of 73 built, 13 of 145 downloaded from cache (15 downloading)
  207. 49.98 s Downloading cached prettyprinter-1.7.1-doc from https://sellout.cachix.org
  208. 50.18 s Progress: 0 of 73 built, 14 of 145 downloaded from cache (15 downloading)
  209. 50.18 s Downloading cached primitive-0.9.1.0-doc from https://sellout.cachix.org
  210. 50.18 s Progress: 0 of 73 built, 15 of 145 downloaded from cache (15 downloading)
  211. 50.18 s Downloading cached safe-exceptions-0.1.7.4-doc from https://sellout.cachix.org
  212. 50.19 s Progress: 0 of 73 built, 16 of 145 downloaded from cache (15 downloading)
  213. 50.19 s Downloading cached splitmix-0.1.1-doc from https://sellout.cachix.org
  214. 50.19 s Progress: 0 of 73 built, 17 of 145 downloaded from cache (15 downloading)
  215. 50.19 s Downloading cached syb-0.7.2.4-doc from https://sellout.cachix.org
  216. 50.19 s Progress: 0 of 73 built, 18 of 145 downloaded from cache (15 downloading)
  217. 50.19 s Downloading cached async-2.2.5-doc from https://sellout.cachix.org
  218. 50.19 s Progress: 0 of 73 built, 19 of 145 downloaded from cache (15 downloading)
  219. 50.20 s Downloading cached case-insensitive-1.2.1.0-doc from https://sellout.cachix.org
  220. 50.20 s Progress: 0 of 73 built, 20 of 145 downloaded from cache (15 downloading)
  221. 50.20 s Downloading cached HUnit-1.6.2.0-doc from https://sellout.cachix.org
  222. 50.20 s Progress: 0 of 73 built, 21 of 145 downloaded from cache (15 downloading)
  223. 50.20 s Downloading cached data-fix-0.3.4-doc from https://sellout.cachix.org
  224. 50.20 s Progress: 0 of 73 built, 22 of 145 downloaded from cache (15 downloading)
  225. 50.20 s Downloading cached tagged-0.8.9-doc from https://sellout.cachix.org
  226. 50.20 s Progress: 0 of 73 built, 23 of 145 downloaded from cache (15 downloading)
  227. 50.20 s Downloading cached terminal-size-0.3.4-doc from https://sellout.cachix.org
  228. 50.21 s Progress: 0 of 73 built, 24 of 145 downloaded from cache (15 downloading)
  229. 50.21 s Downloading cached ansi-terminal-types-1.1-doc from https://sellout.cachix.org
  230. 50.21 s Progress: 0 of 73 built, 25 of 145 downloaded from cache (15 downloading)
  231. 50.21 s Downloading cached pretty-show-1.10-doc from https://sellout.cachix.org
  232. 50.29 s Progress: 0 of 73 built, 26 of 145 downloaded from cache (15 downloading)
  233. 50.29 s Downloading cached text-short-0.1.6-doc from https://sellout.cachix.org
  234. 50.43 s Progress: 0 of 73 built, 27 of 145 downloaded from cache (15 downloading)
  235. 50.43 s Downloading cached Cabal-3.12.1.0-doc from https://sellout.cachix.org
  236. 50.49 s Progress: 0 of 73 built, 28 of 145 downloaded from cache (15 downloading)
  237. 50.49 s Downloading cached these-1.2.1-doc from https://sellout.cachix.org
  238. 50.55 s Progress: 0 of 73 built, 29 of 145 downloaded from cache (15 downloading)
  239. 50.55 s Downloading cached old-time-1.1.0.4-doc from https://sellout.cachix.org
  240. 50.59 s Progress: 0 of 73 built, 30 of 145 downloaded from cache (15 downloading)
  241. 50.59 s Downloading cached time-compat-1.9.8-doc from https://sellout.cachix.org
  242. 50.59 s Progress: 0 of 73 built, 31 of 145 downloaded from cache (15 downloading)
  243. 50.59 s Downloading cached random-1.2.1.3-doc from https://sellout.cachix.org
  244. 50.59 s Progress: 0 of 73 built, 32 of 145 downloaded from cache (15 downloading)
  245. 50.59 s Downloading cached transformers-base-0.4.6-doc from https://sellout.cachix.org
  246. 50.61 s Progress: 0 of 73 built, 33 of 145 downloaded from cache (15 downloading)
  247. 50.61 s Downloading cached transformers-compat-0.7.2-doc from https://sellout.cachix.org
  248. 50.64 s Progress: 0 of 73 built, 34 of 145 downloaded from cache (15 downloading)
  249. 50.64 s Downloading cached unliftio-core-0.2.1.0-doc from https://sellout.cachix.org
  250. 50.66 s Progress: 0 of 73 built, 35 of 145 downloaded from cache (15 downloading)
  251. 50.66 s Downloading cached vector-stream-0.1.0.1-doc from https://sellout.cachix.org
  252. 50.67 s Progress: 0 of 73 built, 36 of 145 downloaded from cache (15 downloading)
  253. 50.67 s Downloading cached wherefrom-compat-0.1.1.1-doc from https://sellout.cachix.org
  254. 50.72 s Progress: 0 of 73 built, 37 of 145 downloaded from cache (15 downloading)
  255. 50.72 s Downloading cached scientific-0.3.8.0-doc from https://sellout.cachix.org
  256. 50.76 s Progress: 0 of 73 built, 38 of 145 downloaded from cache (15 downloading)
  257. 50.76 s Downloading cached wl-pprint-annotated-0.1.0.1-doc from https://sellout.cachix.org
  258. 50.78 s Progress: 0 of 73 built, 39 of 145 downloaded from cache (15 downloading)
  259. 50.78 s Downloading cached boring-0.2.2-doc from https://sellout.cachix.org
  260. 50.93 s Progress: 0 of 73 built, 40 of 145 downloaded from cache (15 downloading)
  261. 50.93 s Downloading cached distributive-0.6.2.1-doc from https://sellout.cachix.org
  262. 50.93 s Progress: 0 of 73 built, 41 of 145 downloaded from cache (15 downloading)
  263. 50.93 s Downloading cached ansi-terminal-1.1.2-doc from https://sellout.cachix.org
  264. 50.96 s Progress: 0 of 73 built, 42 of 145 downloaded from cache (15 downloading)
  265. 50.96 s Downloading cached strict-0.5.1-doc from https://sellout.cachix.org
  266. 51.00 s Progress: 0 of 73 built, 43 of 145 downloaded from cache (15 downloading)
  267. 51.00 s Downloading cached resourcet-1.3.0-doc from https://sellout.cachix.org
  268. 51.01 s Progress: 0 of 73 built, 44 of 145 downloaded from cache (15 downloading)
  269. 51.04 s Progress: 0 of 73 built, 45 of 145 downloaded from cache (14 downloading)
  270. 51.05 s Progress: 0 of 73 built, 46 of 145 downloaded from cache (13 downloading)
  271. 51.10 s Progress: 0 of 73 built, 47 of 145 downloaded from cache (12 downloading)
  272. 51.10 s Progress: 0 of 73 built, 48 of 145 downloaded from cache (11 downloading)
  273. 51.10 s Downloading cached QuickCheck-2.14.3-doc from https://sellout.cachix.org
  274. 51.10 s Downloading cached temporary-1.3-doc from https://sellout.cachix.org
  275. 51.10 s Downloading cached uuid-types-1.0.6-doc from https://sellout.cachix.org
  276. 51.14 s Progress: 0 of 73 built, 49 of 145 downloaded from cache (13 downloading)
  277. 51.16 s Progress: 0 of 73 built, 50 of 145 downloaded from cache (12 downloading)
  278. 51.16 s Downloading cached monad-control-1.0.3.1-doc from https://sellout.cachix.org
  279. 51.17 s Progress: 0 of 73 built, 51 of 145 downloaded from cache (12 downloading)
  280. 51.19 s Progress: 0 of 73 built, 52 of 145 downloaded from cache (11 downloading)
  281. 51.23 s Progress: 0 of 73 built, 53 of 145 downloaded from cache (10 downloading)
  282. 51.23 s Downloading cached barbies-2.1.1.0-doc from https://sellout.cachix.org
  283. 51.25 s Progress: 0 of 73 built, 54 of 145 downloaded from cache (10 downloading)
  284. 51.25 s Downloading cached constraints-0.14.2-doc from https://sellout.cachix.org
  285. 51.25 s Progress: 0 of 73 built, 55 of 145 downloaded from cache (10 downloading)
  286. 51.28 s Progress: 0 of 73 built, 56 of 145 downloaded from cache (9 downloading)
  287. 51.28 s Downloading cached concurrent-output-1.10.21-doc from https://sellout.cachix.org
  288. 51.28 s Downloading cached prettyprinter-ansi-terminal-1.1.3-doc from https://sellout.cachix.org
  289. 51.36 s Progress: 0 of 73 built, 57 of 145 downloaded from cache (10 downloading)
  290. 51.41 s Progress: 0 of 73 built, 58 of 145 downloaded from cache (9 downloading)
  291. 51.42 s Progress: 0 of 73 built, 59 of 145 downloaded from cache (8 downloading)
  292. 51.44 s Progress: 0 of 73 built, 60 of 145 downloaded from cache (7 downloading)
  293. 51.44 s Downloading cached doctest-0.24.0-doc from https://sellout.cachix.org
  294. 51.59 s Progress: 0 of 73 built, 61 of 145 downloaded from cache (7 downloading)
  295. 51.60 s Downloading cached lifted-base-0.2.3.12-doc from https://sellout.cachix.org
  296. 51.61 s Progress: 0 of 73 built, 62 of 145 downloaded from cache (7 downloading)
  297. 51.61 s Downloading cached optparse-applicative-0.18.1.0-doc from https://sellout.cachix.org
  298. 51.65 s Progress: 0 of 73 built, 63 of 145 downloaded from cache (7 downloading)
  299. 51.71 s Progress: 0 of 73 built, 64 of 145 downloaded from cache (6 downloading)
  300. 51.72 s Progress: 0 of 73 built, 65 of 145 downloaded from cache (5 downloading)
  301. 51.92 s Progress: 0 of 73 built, 66 of 145 downloaded from cache (4 downloading)
  302. 51.95 s Progress: 0 of 73 built, 67 of 145 downloaded from cache (3 downloading)
  303. 51.95 s Downloading cached lifted-async-0.10.2.7-doc from https://sellout.cachix.org
  304. 52.11 s Progress: 0 of 73 built, 68 of 145 downloaded from cache (3 downloading)
  305. 52.11 s Downloading cached tasty-1.5.3-doc from https://sellout.cachix.org
  306. 52.19 s Progress: 0 of 73 built, 69 of 145 downloaded from cache (3 downloading)
  307. 52.19 s Downloading cached ChasingBottoms-1.3.1.15-doc from https://sellout.cachix.org
  308. 52.32 s Progress: 0 of 73 built, 70 of 145 downloaded from cache (3 downloading)
  309. 52.32 s Downloading cached hedgehog-1.5-doc from https://sellout.cachix.org
  310. 52.58 s Progress: 0 of 73 built, 71 of 145 downloaded from cache (3 downloading)
  311. 52.58 s Downloading cached tasty-hunit-0.10.2-doc from https://sellout.cachix.org
  312. 52.58 s Downloading cached tasty-inspection-testing-0.2.1-doc from https://sellout.cachix.org
  313. 52.58 s Downloading cached tasty-quickcheck-0.11-doc from https://sellout.cachix.org
  314. 52.59 s Progress: 0 of 73 built, 72 of 145 downloaded from cache (5 downloading)
  315. 52.93 s Progress: 0 of 73 built, 73 of 145 downloaded from cache (4 downloading)
  316. 52.99 s Progress: 0 of 73 built, 74 of 145 downloaded from cache (3 downloading)
  317. 53.04 s Progress: 0 of 73 built, 75 of 145 downloaded from cache (2 downloading)
  318. 53.09 s Progress: 0 of 73 built, 76 of 145 downloaded from cache (1 downloading)
  319. 53.09 s Downloading cached tasty-hedgehog-1.4.0.2-doc from https://sellout.cachix.org
  320. 53.51 s Progress: 0 of 73 built, 77 of 145 downloaded from cache (1 downloading)
  321. 84.84 s Progress: 0 of 73 built, 78 of 145 downloaded from cache
  322. 84.85 s Downloading cached OneTuple from https://sellout.cachix.org
  323. 85.02 s Downloading cached Cabal-syntax from https://sellout.cachix.org
  324. 85.02 s Downloading cached assoc from https://sellout.cachix.org
  325. 85.02 s Downloading cached colour from https://sellout.cachix.org
  326. 85.02 s Downloading cached erf from https://sellout.cachix.org
  327. 85.02 s Downloading cached ghc-paths from https://sellout.cachix.org
  328. 85.02 s Downloading cached hashable from https://sellout.cachix.org
  329. 85.02 s Downloading cached haskell-lexer from https://sellout.cachix.org
  330. 85.02 s Downloading cached inspection-testing from https://sellout.cachix.org
  331. 85.02 s Downloading cached integer-logarithms from https://sellout.cachix.org
  332. 85.02 s Downloading cached old-locale from https://sellout.cachix.org
  333. 85.02 s Downloading cached call-stack from https://sellout.cachix.org
  334. 85.02 s Downloading cached prettyprinter from https://sellout.cachix.org
  335. 85.02 s Downloading cached base-orphans from https://sellout.cachix.org
  336. 85.02 s Downloading cached clock from https://sellout.cachix.org
  337. 85.02 s Downloading cached code-page from https://sellout.cachix.org
  338. 85.24 s Progress: 0 of 72 built, 79 of 145 downloaded from cache (15 downloading)
  339. 85.24 s Downloading cached primitive from https://sellout.cachix.org
  340. 85.25 s Progress: 0 of 71 built, 80 of 145 downloaded from cache (15 downloading)
  341. 85.25 s Downloading cached safe-exceptions from https://sellout.cachix.org
  342. 85.27 s Progress: 0 of 71 built, 81 of 145 downloaded from cache (15 downloading)
  343. 85.27 s Downloading cached old-time from https://sellout.cachix.org
  344. 85.29 s Progress: 0 of 70 built, 82 of 145 downloaded from cache (15 downloading)
  345. 85.30 s Downloading cached splitmix from https://sellout.cachix.org
  346. 85.30 s Progress: 0 of 69 built, 83 of 145 downloaded from cache (15 downloading)
  347. 85.30 s Downloading cached syb from https://sellout.cachix.org
  348. 85.32 s Progress: 0 of 69 built, 84 of 145 downloaded from cache (15 downloading)
  349. 85.32 s Downloading cached tagged from https://sellout.cachix.org
  350. 85.34 s Progress: 0 of 69 built, 85 of 145 downloaded from cache (15 downloading)
  351. 85.34 s Downloading cached terminal-size from https://sellout.cachix.org
  352. 85.55 s Progress: 0 of 68 built, 86 of 145 downloaded from cache (15 downloading)
  353. 85.55 s Progress: 0 of 67 built, 87 of 145 downloaded from cache (15 downloading)
  354. 85.56 s Downloading cached pretty-show from https://sellout.cachix.org
  355. 85.56 s Progress: 0 of 66 built, 88 of 145 downloaded from cache (15 downloading)
  356. 85.56 s Downloading cached case-insensitive from https://sellout.cachix.org
  357. 85.56 s Downloading cached async from https://sellout.cachix.org
  358. 85.56 s Progress: 0 of 66 built, 89 of 145 downloaded from cache (15 downloading)
  359. 85.56 s Downloading cached data-fix from https://sellout.cachix.org
  360. 85.66 s Progress: 0 of 65 built, 90 of 145 downloaded from cache (15 downloading)
  361. 85.66 s Downloading cached text-short from https://sellout.cachix.org
  362. 85.75 s Progress: 0 of 65 built, 91 of 145 downloaded from cache (15 downloading)
  363. 85.75 s Progress: 0 of 64 built, 92 of 145 downloaded from cache (15 downloading)
  364. 85.75 s Downloading cached HUnit from https://sellout.cachix.org
  365. 85.75 s Downloading cached these from https://sellout.cachix.org
  366. 85.75 s Progress: 0 of 63 built, 93 of 145 downloaded from cache (15 downloading)
  367. 85.75 s Downloading cached ansi-terminal-types from https://sellout.cachix.org
  368. 85.85 s Progress: 0 of 62 built, 94 of 145 downloaded from cache (15 downloading)
  369. 85.87 s Downloading cached time-compat from https://sellout.cachix.org
  370. 85.87 s Progress: 0 of 62 built, 95 of 145 downloaded from cache (15 downloading)
  371. 85.87 s Downloading cached transformers-compat from https://sellout.cachix.org
  372. 85.98 s Progress: 0 of 61 built, 96 of 145 downloaded from cache (15 downloading)
  373. 85.98 s Progress: 0 of 61 built, 97 of 145 downloaded from cache (15 downloading)
  374. 86.00 s Downloading cached unliftio-core from https://sellout.cachix.org
  375. 86.01 s Downloading cached vector-stream from https://sellout.cachix.org
  376. 86.05 s Progress: 0 of 60 built, 98 of 145 downloaded from cache (15 downloading)
  377. 86.05 s Downloading cached boring from https://sellout.cachix.org
  378. 86.07 s Progress: 0 of 59 built, 99 of 145 downloaded from cache (15 downloading)
  379. 86.07 s Progress: 0 of 58 built, 100 of 145 downloaded from cache (15 downloading)
  380. 86.07 s Downloading cached distributive from https://sellout.cachix.org
  381. 86.09 s Downloading cached random from https://sellout.cachix.org
  382. 86.12 s Progress: 0 of 57 built, 101 of 145 downloaded from cache (15 downloading)
  383. 86.12 s Progress: 0 of 56 built, 102 of 145 downloaded from cache (15 downloading)
  384. 86.12 s Downloading cached wherefrom-compat from https://sellout.cachix.org
  385. 86.13 s Downloading cached scientific from https://sellout.cachix.org
  386. 86.15 s Progress: 0 of 55 built, 103 of 145 downloaded from cache (15 downloading)
  387. 86.15 s Downloading cached wl-pprint-annotated from https://sellout.cachix.org
  388. 86.34 s Progress: 0 of 54 built, 104 of 145 downloaded from cache (15 downloading)
  389. 86.36 s Progress: 0 of 53 built, 105 of 145 downloaded from cache (14 downloading)
  390. 86.36 s Downloading cached strict from https://sellout.cachix.org
  391. 86.36 s Progress: 0 of 52 built, 106 of 145 downloaded from cache (14 downloading)
  392. 86.47 s Progress: 0 of 51 built, 107 of 145 downloaded from cache (13 downloading)
  393. 86.48 s Downloading cached resourcet from https://sellout.cachix.org
  394. 86.51 s Progress: 0 of 50 built, 108 of 145 downloaded from cache (13 downloading)
  395. 86.52 s Downloading cached constraints from https://sellout.cachix.org
  396. 86.53 s Progress: 0 of 49 built, 109 of 145 downloaded from cache (13 downloading)
  397. 86.56 s Progress: 0 of 48 built, 110 of 145 downloaded from cache (12 downloading)
  398. 86.56 s Progress: 0 of 47 built, 111 of 145 downloaded from cache (11 downloading)
  399. 86.59 s Progress: 0 of 46 built, 112 of 145 downloaded from cache (10 downloading)
  400. 86.61 s Downloading cached ansi-terminal from https://sellout.cachix.org
  401. 86.69 s Progress: 0 of 45 built, 113 of 145 downloaded from cache (10 downloading)
  402. 86.73 s Progress: 0 of 44 built, 114 of 145 downloaded from cache (9 downloading)
  403. 86.75 s Progress: 0 of 43 built, 115 of 145 downloaded from cache (8 downloading)
  404. 86.75 s Downloading cached transformers-base from https://sellout.cachix.org
  405. 86.75 s Downloading cached mmorph from https://sellout.cachix.org
  406. 86.83 s Progress: 0 of 42 built, 116 of 145 downloaded from cache (9 downloading)
  407. 86.83 s Downloading cached barbies from https://sellout.cachix.org
  408. 86.94 s Progress: 0 of 41 built, 117 of 145 downloaded from cache (9 downloading)
  409. 86.94 s Progress: 0 of 40 built, 118 of 145 downloaded from cache (8 downloading)
  410. 86.95 s Downloading cached QuickCheck from https://sellout.cachix.org
  411. 86.95 s Downloading cached temporary from https://sellout.cachix.org
  412. 86.96 s Progress: 0 of 39 built, 119 of 145 downloaded from cache (10 downloading)
  413. 86.96 s Downloading cached uuid-types from https://sellout.cachix.org
  414. 87.18 s Progress: 0 of 38 built, 120 of 145 downloaded from cache (9 downloading)
  415. 87.18 s Progress: 0 of 37 built, 121 of 145 downloaded from cache (8 downloading)
  416. 87.18 s Progress: 0 of 36 built, 122 of 145 downloaded from cache (8 downloading)
  417. 87.18 s Downloading cached monad-control from https://sellout.cachix.org
  418. 87.19 s Progress: 0 of 35 built, 123 of 145 downloaded from cache (7 downloading)
  419. 87.19 s Downloading cached Cabal from https://sellout.cachix.org
  420. 87.25 s Progress: 0 of 35 built, 124 of 145 downloaded from cache (7 downloading)
  421. 87.26 s Downloading cached concurrent-output from https://sellout.cachix.org
  422. 87.26 s Downloading cached prettyprinter-ansi-terminal from https://sellout.cachix.org
  423. 87.29 s Progress: 0 of 34 built, 125 of 145 downloaded from cache (8 downloading)
  424. 87.37 s Progress: 0 of 33 built, 126 of 145 downloaded from cache (7 downloading)
  425. 87.38 s Downloading cached doctest from https://sellout.cachix.org
  426. 87.39 s Progress: 0 of 33 built, 127 of 145 downloaded from cache (7 downloading)
  427. 87.47 s Progress: 0 of 32 built, 128 of 145 downloaded from cache (6 downloading)
  428. 87.47 s Downloading cached ChasingBottoms from https://sellout.cachix.org
  429. 87.60 s Progress: 0 of 31 built, 129 of 145 downloaded from cache (6 downloading)
  430. 87.61 s Downloading cached lifted-base from https://sellout.cachix.org
  431. 87.64 s Progress: 0 of 30 built, 130 of 145 downloaded from cache (6 downloading)
  432. 87.65 s Progress: 0 of 29 built, 131 of 145 downloaded from cache (5 downloading)
  433. 87.75 s Progress: 0 of 28 built, 132 of 145 downloaded from cache (4 downloading)
  434. 87.75 s Downloading cached optparse-applicative from https://sellout.cachix.org
  435. 88.16 s Progress: 0 of 28 built, 133 of 145 downloaded from cache (4 downloading)
  436. 88.20 s Progress: 0 of 27 built, 134 of 145 downloaded from cache (3 downloading)
  437. 88.20 s Downloading cached lifted-async from https://sellout.cachix.org
  438. 88.36 s Progress: 0 of 26 built, 135 of 145 downloaded from cache (3 downloading)
  439. 88.36 s Downloading cached tasty from https://sellout.cachix.org
  440. 88.55 s Progress: 0 of 26 built, 136 of 145 downloaded from cache (3 downloading)
  441. 88.56 s Downloading cached cabal-doctest from https://sellout.cachix.org
  442. 88.69 s Progress: 0 of 25 built, 137 of 145 downloaded from cache (3 downloading)
  443. 88.69 s Downloading cached hedgehog from https://sellout.cachix.org
  444. 88.76 s Progress: 0 of 24 built, 138 of 145 downloaded from cache (3 downloading)
  445. 89.01 s Progress: 0 of 23 built, 139 of 145 downloaded from cache (2 downloading)
  446. 89.69 s Building /nix/store/6cgqvyx434ks6v16nzxwwis6g2bbj8fs-duoids-0.0.1.0.drv
  447. 89.69 s Progress: 0 of 22 built (1 building), 140 of 145 downloaded from cache (1 downloading)
  448. 89.69 s Progress: 0 of 22 built (1 building), 141 of 145 downloaded from cache
  449. 89.70 s Downloading cached tasty-quickcheck from https://sellout.cachix.org
  450. 89.70 s Downloading cached tasty-inspection-testing from https://sellout.cachix.org
  451. 89.70 s Downloading cached tasty-hedgehog from https://sellout.cachix.org
  452. 89.70 s Downloading cached tasty-hunit from https://sellout.cachix.org
  453. 89.90 s [duoids] Phase: setupCompilerEnvironmentPhase
  454. 89.92 s [duoids] Build with /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1.
  455. 90.09 s Progress: 0 of 20 built (1 building), 142 of 145 downloaded from cache (3 downloading)
  456. 90.10 s Progress: 0 of 19 built (1 building), 143 of 145 downloaded from cache (2 downloading)
  457. 90.15 s Progress: 0 of 18 built (1 building), 144 of 145 downloaded from cache (1 downloading)
  458. 90.26 s Building /nix/store/1sakmmkyvdprx7zb24ip9yzyh8ss9hq9-vector-0.13.2.0.drv
  459. 90.35 s [duoids] Phase: unpackPhase
  460. 90.37 s [duoids] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./core
  461. 90.40 s [duoids] source root is core
  462. 90.44 s [duoids] Phase: patchPhase
  463. 90.46 s [duoids] Phase: compileBuildDriverPhase
  464. 90.47 s [duoids] setupCompileFlags: -package-db=/build/tmp.cVp0Vd8jwq/setup-package.conf.d -threaded
  465. 90.48 s [vector] Phase: setupCompilerEnvironmentPhase
  466. 90.49 s [vector] Build with /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1.
  467. 90.57 s [duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.cVp0Vd8jwq/Main.o )
  468. 90.62 s Progress: 0 of 17 built (2 building), 145 of 145 downloaded from cache
  469. 90.73 s [duoids] [2 of 2] Linking Setup
  470. 91.09 s [vector] Phase: unpackPhase
  471. 91.12 s [vector] unpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
  472. 91.15 s [vector] source root is vector-0.13.2.0
  473. 91.17 s [vector] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
  474. 91.19 s [vector] Phase: patchPhase
  475. 91.20 s [vector] Replace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/1.cabal.
  476. 91.20 s [vector] Run jailbreak-cabal to lift version restrictions on build inputs.
  477. 91.24 s [vector] Phase: compileBuildDriverPhase
  478. 91.25 s [vector] setupCompileFlags: -package-db=/build/tmp.OESb6SmfHL/setup-package.conf.d -threaded
  479. 91.54 s [vector] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.OESb6SmfHL/Main.o )
  480. 92.21 s [vector] [2 of 2] Linking Setup
  481. 93.68 s [duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  482. 93.93 s [duoids] Phase: configurePhase
  483. 93.95 s [duoids] configureFlags: --verbose --prefix=/nix/store/9yr9naycgwnywfqwx2rjwa8pnkj0vi2i-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/c1fzl1px25bv2vpkn0lx0pc2yx2g4gyz-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.cVp0Vd8jwq/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/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/lib
  484. 93.98 s [duoids] Using Parsec parser
  485. 93.98 s [duoids] Configuring duoids-0.0.1.0...
  486. 94.18 s [duoids] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  487. 94.18 s [duoids] 'ghc' version < 9.12):
  488. 94.18 s [duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc is version
  489. 94.18 s [duoids] 9.12.1
  490. 95.29 s [duoids] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  491. 96.02 s [duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  492. 96.08 s [duoids] >=4.21.0 && <4.22: using base-4.21.0.0
  493. 96.08 s [duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  494. 96.08 s [duoids] >=4.21.0 && <4.22: using base-4.21.0.0
  495. 96.08 s [duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  496. 96.08 s [duoids] <0.25: using doctest-0.24.0
  497. 96.08 s [duoids] Dependency duoids: using duoids-0.0.1.0
  498. 96.08 s [duoids] Source component graph:
  499. 96.08 s [duoids] component lib
  500. 96.08 s [duoids] component test:doctests dependency lib
  501. 96.08 s [duoids] Configured component graph:
  502. 96.08 s [duoids] component duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  503. 96.08 s [duoids] include base-4.21.0.0-f068
  504. 96.08 s [duoids] component duoids-0.0.1.0-KgOKglS7rcgFyvXaDTqBQu-doctests
  505. 96.08 s [duoids] include base-4.21.0.0-f068
  506. 96.08 s [duoids] include doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
  507. 96.08 s [duoids] include duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  508. 96.08 s [duoids] Linked component graph:
  509. 96.08 s [duoids] unit duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  510. 96.08 s [duoids] include base-4.21.0.0-f068
  511. 96.08 s [duoids] Control.Duoidal=duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt:Control.Duoidal,Control.Duoidal.Do=duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt:Control.Duoidal.Do,Control.Duoidal.Either=duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt:Control.Duoidal.Either,Control.Duoidal.Fail=duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt:Control.Duoidal.Fail,Control.Duoidal.Fix=duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt:Control.Duoidal.Fix,Control.Duoidal.Laws=duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt:Control.Duoidal.Laws,Data.Duoid=duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt:Data.Duoid,Data.Duoid.Laws=duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt:Data.Duoid.Laws
  512. 96.08 s [duoids] unit duoids-0.0.1.0-KgOKglS7rcgFyvXaDTqBQu-doctests
  513. 96.08 s [duoids] include base-4.21.0.0-f068
  514. 96.08 s [duoids] include doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
  515. 96.08 s [duoids] include duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  516. 96.08 s [duoids] Ready component graph:
  517. 96.08 s [duoids] definite duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  518. 96.08 s [duoids] depends base-4.21.0.0-f068
  519. 96.08 s [duoids] definite duoids-0.0.1.0-KgOKglS7rcgFyvXaDTqBQu-doctests
  520. 96.08 s [duoids] depends base-4.21.0.0-f068
  521. 96.08 s [duoids] depends doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
  522. 96.08 s [duoids] depends duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  523. 96.08 s [duoids] Using Cabal-3.14.1.0 compiled by ghc-9.12
  524. 96.08 s [duoids] Using compiler: ghc-9.12.1
  525. 96.08 s [duoids] Using install prefix:
  526. 96.08 s [duoids] /nix/store/9yr9naycgwnywfqwx2rjwa8pnkj0vi2i-duoids-0.0.1.0
  527. 96.08 s [duoids] Executables installed in:
  528. 96.08 s [duoids] /nix/store/9yr9naycgwnywfqwx2rjwa8pnkj0vi2i-duoids-0.0.1.0/bin
  529. 96.08 s [duoids] Libraries installed in:
  530. 96.08 s [duoids] /nix/store/9yr9naycgwnywfqwx2rjwa8pnkj0vi2i-duoids-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  531. 96.08 s [duoids] Dynamic Libraries installed in:
  532. 96.08 s [duoids] /nix/store/9yr9naycgwnywfqwx2rjwa8pnkj0vi2i-duoids-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
  533. 96.08 s [duoids] Private executables installed in:
  534. 96.08 s [duoids] /nix/store/9yr9naycgwnywfqwx2rjwa8pnkj0vi2i-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.12.1-f739/duoids-0.0.1.0
  535. 96.08 s [duoids] Data files installed in:
  536. 96.08 s [duoids] /nix/store/9yr9naycgwnywfqwx2rjwa8pnkj0vi2i-duoids-0.0.1.0/share/x86_64-linux-ghc-9.12.1-f739/duoids-0.0.1.0
  537. 96.08 s [duoids] Documentation installed in:
  538. 96.08 s [duoids] /nix/store/c1fzl1px25bv2vpkn0lx0pc2yx2g4gyz-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0
  539. 96.08 s [duoids] Configuration files installed in:
  540. 96.08 s [duoids] /nix/store/9yr9naycgwnywfqwx2rjwa8pnkj0vi2i-duoids-0.0.1.0/etc
  541. 96.08 s [duoids] No alex found
  542. 96.08 s [duoids] Using ar found on system at:
  543. 96.08 s [duoids] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  544. 96.08 s [duoids] No c2hs found
  545. 96.08 s [duoids] No cpphs found
  546. 96.08 s [duoids] Using doctest version 0.24.0 found on system at:
  547. 96.08 s [duoids] /nix/store/x1z9pyd8hb27z4bhy7lsj2npgsq740xd-doctest-0.24.0/bin/doctest
  548. 96.08 s [duoids] Using gcc version 14.3.0 given by user at:
  549. 96.08 s [duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  550. 96.08 s [duoids] Using ghc version 9.12.1 found on system at:
  551. 96.08 s [duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc
  552. 96.08 s [duoids] Using ghc-pkg version 9.12.1 found on system at:
  553. 96.08 s [duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc-pkg-9.12.1
  554. 96.08 s [duoids] No ghcjs found
  555. 96.08 s [duoids] No ghcjs-pkg found
  556. 96.08 s [duoids] No greencard found
  557. 96.08 s [duoids] Using haddock version 2.30.0 found on system at:
  558. 96.08 s [duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/haddock-ghc-9.12.1
  559. 96.08 s [duoids] No happy found
  560. 96.08 s [duoids] No haskell-suite found
  561. 96.08 s [duoids] No haskell-suite-pkg found
  562. 96.08 s [duoids] No hmake found
  563. 96.08 s [duoids] Using hpc version 0.69 found on system at:
  564. 96.08 s [duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hpc-ghc-9.12.1
  565. 96.08 s [duoids] Using hsc2hs version 0.68.10 found on system at:
  566. 96.08 s [vector] Phase: updateAutotoolsGnuConfigScriptsPhase
  567. 96.08 s [duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
  568. 96.08 s [duoids] Using hscolour version 1.25 found on system at:
  569. 96.08 s [duoids] /nix/store/q6qz2x3a08capyv98w52zizgxcnmv4hb-hscolour-1.25/bin/HsColour
  570. 96.08 s [duoids] No jhc found
  571. 96.08 s [duoids] Using ld found on system at:
  572. 96.08 s [duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  573. 96.08 s [duoids] No pkg-config found
  574. 96.08 s [duoids] Using runghc version 9.12.1 found on system at:
  575. 96.08 s [duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/runghc-9.12.1
  576. 96.08 s [duoids] Using strip version 2.44 found on system at:
  577. 96.08 s [duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  578. 96.08 s [duoids] Using tar found on system at:
  579. 96.08 s [duoids] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  580. 96.08 s [duoids] No uhc found
  581. 96.08 s [vector] Phase: configurePhase
  582. 96.08 s [vector] configureFlags: --verbose --prefix=/nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.OESb6SmfHL/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/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/lib
  583. 96.10 s [vector] Using Parsec parser
  584. 96.10 s [vector] Configuring vector-0.13.2.0...
  585. 96.26 s [vector] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  586. 96.26 s [vector] 'ghc' version < 9.12):
  587. 96.26 s [vector] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc is version
  588. 96.26 s [vector] 9.12.1
  589. 96.34 s [duoids] Phase: buildPhase
  590. 96.65 s [duoids] Preprocessing library for duoids-0.0.1.0...
  591. 96.65 s [duoids] Building library for duoids-0.0.1.0...
  592. 96.88 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 )
  593. 97.37 s [vector] Flags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
  594. 97.37 s [vector] wall=False
  595. 97.78 s [duoids] [2 of 9] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.o, dist/build/Data/Duoid.dyn_o )
  596. 98.38 s [vector] Dependency base: using base-4.21.0.0
  597. 98.38 s [vector] Dependency deepseq: using deepseq-1.5.1.0
  598. 98.38 s [vector] Dependency primitive: using primitive-0.9.1.0
  599. 98.38 s [vector] Dependency vector-stream: using vector-stream-0.1.0.1
  600. 98.38 s [vector] Dependency base: using base-4.21.0.0
  601. 98.38 s [vector] Dependency random: using random-1.2.1.3
  602. 98.38 s [vector] Dependency tasty: using tasty-1.5.3
  603. 98.38 s [vector] Dependency vector: using vector-0.13.2.0
  604. 98.38 s [vector] Dependency QuickCheck: using QuickCheck-2.14.3
  605. 98.38 s [vector] Dependency base: using base-4.21.0.0
  606. 98.38 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  607. 98.38 s [vector] Dependency primitive: using primitive-0.9.1.0
  608. 98.38 s [vector] Dependency random: using random-1.2.1.3
  609. 98.38 s [vector] Dependency tasty: using tasty-1.5.3
  610. 98.38 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  611. 98.38 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11
  612. 98.38 s [vector] Dependency template-haskell: using template-haskell-2.23.0.0
  613. 98.38 s [vector] Dependency transformers: using transformers-0.6.1.2
  614. 98.38 s [vector] Dependency vector: using vector-0.13.2.0
  615. 98.38 s [vector] Dependency QuickCheck: using QuickCheck-2.14.3
  616. 98.38 s [vector] Dependency base: using base-4.21.0.0
  617. 98.38 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  618. 98.38 s [vector] Dependency primitive: using primitive-0.9.1.0
  619. 98.38 s [vector] Dependency random: using random-1.2.1.3
  620. 98.38 s [vector] Dependency tasty: using tasty-1.5.3
  621. 98.38 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  622. 98.38 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11
  623. 98.38 s [vector] Dependency template-haskell: using template-haskell-2.23.0.0
  624. 98.38 s [vector] Dependency transformers: using transformers-0.6.1.2
  625. 98.38 s [vector] Dependency vector: using vector-0.13.2.0
  626. 98.38 s [vector] Dependency base: using base-4.21.0.0
  627. 98.38 s [vector] Dependency doctest: using doctest-0.24.0
  628. 98.38 s [vector] Dependency primitive: using primitive-0.9.1.0
  629. 98.38 s [vector] Dependency vector: using vector-0.13.2.0
  630. 98.38 s [vector] Dependency base: using base-4.21.0.0
  631. 98.38 s [vector] Dependency primitive: using primitive-0.9.1.0
  632. 98.38 s [vector] Dependency tasty: using tasty-1.5.3
  633. 98.38 s [vector] Dependency tasty-inspection-testing: using tasty-inspection-testing-0.2.1
  634. 98.38 s [vector] Dependency vector: using vector-0.13.2.0
  635. 98.38 s [vector] Source component graph:
  636. 98.38 s [vector] component lib
  637. 98.38 s [vector] component lib:benchmarks-O2 dependency lib
  638. 98.38 s [vector] component test:vector-doctest dependency lib
  639. 98.38 s [vector] component test:vector-inspection dependency lib
  640. 98.38 s [vector] component test:vector-tests-O0 dependency lib
  641. 98.38 s [vector] component test:vector-tests-O2 dependency lib
  642. 98.38 s [vector] Configured component graph:
  643. 98.38 s [vector] component vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  644. 98.38 s [vector] include base-4.21.0.0-f068
  645. 98.38 s [vector] include deepseq-1.5.1.0-b096
  646. 98.38 s [vector] include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  647. 98.38 s [vector] include vector-stream-0.1.0.1-G0zZZSuAhT9ECGcE55QRHQ
  648. 98.38 s [vector] component vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2
  649. 98.38 s [vector] include base-4.21.0.0-f068
  650. 98.38 s [vector] include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
  651. 98.38 s [vector] include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
  652. 98.38 s [vector] include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  653. 98.38 s [vector] component vector-0.13.2.0-2VXnVSJJbVuAMvmzjCulzX-vector-doctest
  654. 98.38 s [vector] include base-4.21.0.0-f068
  655. 98.38 s [vector] include doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
  656. 98.38 s [vector] include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  657. 98.38 s [vector] include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  658. 98.38 s [vector] component vector-0.13.2.0-HKLeEHgySYx3YgE83tDvaW-vector-inspection
  659. 98.38 s [vector] include base-4.21.0.0-f068
  660. 98.38 s [vector] include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  661. 98.38 s [vector] include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
  662. 98.38 s [vector] include tasty-inspection-testing-0.2.1-KAFwYZWrVYDJZ1LcRXRNLo
  663. 98.38 s [vector] include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  664. 98.38 s [vector] component vector-0.13.2.0-BM007pTARkY2AmoQNselFw-vector-tests-O0
  665. 98.38 s [vector] include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  666. 98.38 s [vector] include base-4.21.0.0-f068
  667. 98.38 s [vector] include base-orphans-0.9.3-1hIJyewP2H2DmsUJtWZtzI
  668. 98.38 s [vector] include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  669. 98.38 s [vector] include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
  670. 98.38 s [vector] include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
  671. 98.38 s [vector] include tasty-hunit-0.10.2-GxiECQtHLG9JqzzTC7gSqY
  672. 98.38 s [vector] include tasty-quickcheck-0.11-597oKWlAkLA6PjifDQdXTX
  673. 98.38 s [vector] include template-haskell-2.23.0.0-125a
  674. 98.38 s [vector] include transformers-0.6.1.2-199f
  675. 98.38 s [vector] include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  676. 98.38 s [vector] component vector-0.13.2.0-LdCCbDjYvxjD85WNwVzEVu-vector-tests-O2
  677. 98.38 s [vector] include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  678. 98.38 s [vector] include base-4.21.0.0-f068
  679. 98.38 s [vector] include base-orphans-0.9.3-1hIJyewP2H2DmsUJtWZtzI
  680. 98.38 s [vector] include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  681. 98.38 s [vector] include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
  682. 98.38 s [vector] include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
  683. 98.38 s [vector] include tasty-hunit-0.10.2-GxiECQtHLG9JqzzTC7gSqY
  684. 98.38 s [vector] include tasty-quickcheck-0.11-597oKWlAkLA6PjifDQdXTX
  685. 98.38 s [vector] include template-haskell-2.23.0.0-125a
  686. 98.38 s [vector] include transformers-0.6.1.2-199f
  687. 98.38 s [vector] include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  688. 98.39 s [vector] Linked component graph:
  689. 98.39 s [vector] unit vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  690. 98.39 s [vector] include base-4.21.0.0-f068
  691. 98.39 s [vector] include deepseq-1.5.1.0-b096
  692. 98.39 s [vector] include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  693. 98.39 s [vector] include vector-stream-0.1.0.1-G0zZZSuAhT9ECGcE55QRHQ
  694. 98.39 s [vector] Data.Vector=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q:Data.Vector.Unboxed.Mutable
  695. 98.39 s [vector] unit vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2
  696. 98.39 s [vector] include base-4.21.0.0-f068
  697. 98.39 s [vector] include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
  698. 98.39 s [vector] include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
  699. 98.39 s [vector] include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  700. 98.50 s [vector] Bench.Vector.Algo.AwShCC=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2:Bench.Vector.TestData.ParenTree
  701. 98.50 s [vector] unit vector-0.13.2.0-2VXnVSJJbVuAMvmzjCulzX-vector-doctest
  702. 98.50 s [vector] include base-4.21.0.0-f068
  703. 98.50 s [vector] include doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
  704. 98.50 s [vector] include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  705. 98.50 s [vector] include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  706. 98.50 s [vector] unit vector-0.13.2.0-HKLeEHgySYx3YgE83tDvaW-vector-inspection
  707. 98.50 s [vector] include base-4.21.0.0-f068
  708. 98.50 s [vector] include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  709. 98.50 s [vector] include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
  710. 98.50 s [vector] include tasty-inspection-testing-0.2.1-KAFwYZWrVYDJZ1LcRXRNLo
  711. 98.50 s [vector] include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  712. 98.50 s [vector] unit vector-0.13.2.0-BM007pTARkY2AmoQNselFw-vector-tests-O0
  713. 98.50 s [vector] include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  714. 98.50 s [vector] include base-4.21.0.0-f068
  715. 98.50 s [vector] include base-orphans-0.9.3-1hIJyewP2H2DmsUJtWZtzI
  716. 98.50 s [vector] include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  717. 98.50 s [vector] include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
  718. 98.50 s [vector] include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
  719. 98.50 s [vector] include tasty-hunit-0.10.2-GxiECQtHLG9JqzzTC7gSqY
  720. 98.50 s [vector] include tasty-quickcheck-0.11-597oKWlAkLA6PjifDQdXTX
  721. 98.50 s [vector] include template-haskell-2.23.0.0-125a
  722. 98.50 s [vector] include transformers-0.6.1.2-199f
  723. 98.50 s [vector] include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  724. 98.50 s [vector] unit vector-0.13.2.0-LdCCbDjYvxjD85WNwVzEVu-vector-tests-O2
  725. 98.50 s [vector] include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  726. 98.50 s [vector] include base-4.21.0.0-f068
  727. 98.50 s [vector] include base-orphans-0.9.3-1hIJyewP2H2DmsUJtWZtzI
  728. 98.50 s [vector] include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  729. 98.50 s [vector] include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
  730. 98.50 s [vector] include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
  731. 98.50 s [vector] include tasty-hunit-0.10.2-GxiECQtHLG9JqzzTC7gSqY
  732. 98.50 s [vector] include tasty-quickcheck-0.11-597oKWlAkLA6PjifDQdXTX
  733. 98.50 s [vector] include template-haskell-2.23.0.0-125a
  734. 98.50 s [vector] include transformers-0.6.1.2-199f
  735. 98.50 s [vector] include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  736. 98.50 s [vector] Ready component graph:
  737. 98.50 s [vector] definite vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  738. 98.50 s [vector] depends base-4.21.0.0-f068
  739. 98.50 s [vector] depends deepseq-1.5.1.0-b096
  740. 98.50 s [vector] depends primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  741. 98.50 s [vector] depends vector-stream-0.1.0.1-G0zZZSuAhT9ECGcE55QRHQ
  742. 98.50 s [vector] definite vector-0.13.2.0-LdCCbDjYvxjD85WNwVzEVu-vector-tests-O2
  743. 98.50 s [vector] depends QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  744. 98.50 s [vector] depends base-4.21.0.0-f068
  745. 98.50 s [vector] depends base-orphans-0.9.3-1hIJyewP2H2DmsUJtWZtzI
  746. 98.50 s [vector] depends primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  747. 98.50 s [vector] depends random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
  748. 98.50 s [vector] depends tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
  749. 98.50 s [vector] depends tasty-hunit-0.10.2-GxiECQtHLG9JqzzTC7gSqY
  750. 98.51 s [vector] depends tasty-quickcheck-0.11-597oKWlAkLA6PjifDQdXTX
  751. 98.51 s [vector] depends template-haskell-2.23.0.0-125a
  752. 98.51 s [vector] depends transformers-0.6.1.2-199f
  753. 98.51 s [vector] depends vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  754. 98.51 s [vector] definite vector-0.13.2.0-HKLeEHgySYx3YgE83tDvaW-vector-inspection
  755. 98.51 s [vector] depends base-4.21.0.0-f068
  756. 98.51 s [vector] depends primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  757. 98.51 s [vector] depends tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
  758. 98.51 s [vector] depends tasty-inspection-testing-0.2.1-KAFwYZWrVYDJZ1LcRXRNLo
  759. 98.51 s [vector] depends vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  760. 98.51 s [vector] definite vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2
  761. 98.51 s [vector] depends base-4.21.0.0-f068
  762. 98.51 s [vector] depends random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
  763. 98.51 s [vector] depends tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
  764. 98.51 s [vector] depends vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  765. 98.51 s [vector] definite vector-0.13.2.0-BM007pTARkY2AmoQNselFw-vector-tests-O0
  766. 98.51 s [vector] depends QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  767. 98.51 s [vector] depends base-4.21.0.0-f068
  768. 98.51 s [vector] depends base-orphans-0.9.3-1hIJyewP2H2DmsUJtWZtzI
  769. 98.51 s [vector] depends primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  770. 98.51 s [vector] depends random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
  771. 98.51 s [vector] depends tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
  772. 98.51 s [vector] depends tasty-hunit-0.10.2-GxiECQtHLG9JqzzTC7gSqY
  773. 98.51 s [vector] depends tasty-quickcheck-0.11-597oKWlAkLA6PjifDQdXTX
  774. 98.51 s [vector] depends template-haskell-2.23.0.0-125a
  775. 98.51 s [vector] depends transformers-0.6.1.2-199f
  776. 98.51 s [vector] depends vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  777. 98.51 s [vector] definite vector-0.13.2.0-2VXnVSJJbVuAMvmzjCulzX-vector-doctest
  778. 98.51 s [vector] depends base-4.21.0.0-f068
  779. 98.51 s [vector] depends doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
  780. 98.51 s [vector] depends primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  781. 98.51 s [vector] depends vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  782. 98.51 s [vector] Using Cabal-3.14.1.0 compiled by ghc-9.12
  783. 98.51 s [vector] Using compiler: ghc-9.12.1
  784. 98.51 s [vector] Using install prefix:
  785. 98.51 s [vector] /nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0
  786. 98.51 s [vector] Executables installed in:
  787. 98.51 s [vector] /nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0/bin
  788. 98.51 s [vector] Libraries installed in:
  789. 98.51 s [vector] /nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  790. 98.51 s [vector] Dynamic Libraries installed in:
  791. 98.51 s [vector] /nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
  792. 98.51 s [vector] Private executables installed in:
  793. 98.51 s [vector] /nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.12.1-f739/vector-0.13.2.0
  794. 98.51 s [vector] Data files installed in:
  795. 98.51 s [vector] /nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0/share/x86_64-linux-ghc-9.12.1-f739/vector-0.13.2.0
  796. 98.51 s [vector] Documentation installed in:
  797. 98.51 s [vector] /nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.12.1-f739/vector-0.13.2.0
  798. 98.51 s [vector] Configuration files installed in:
  799. 98.51 s [vector] /nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0/etc
  800. 98.51 s [vector] No alex found
  801. 98.51 s [vector] Using ar found on system at:
  802. 98.51 s [vector] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  803. 98.51 s [vector] No c2hs found
  804. 98.51 s [vector] No cpphs found
  805. 98.51 s [vector] Using doctest version 0.24.0 found on system at:
  806. 98.51 s [vector] /nix/store/x1z9pyd8hb27z4bhy7lsj2npgsq740xd-doctest-0.24.0/bin/doctest
  807. 98.51 s [vector] Using gcc version 14.3.0 given by user at:
  808. 98.51 s [vector] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  809. 98.51 s [vector] Using ghc version 9.12.1 found on system at:
  810. 98.51 s [vector] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc
  811. 98.51 s [vector] Using ghc-pkg version 9.12.1 found on system at:
  812. 98.51 s [vector] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc-pkg-9.12.1
  813. 98.51 s [vector] No ghcjs found
  814. 98.51 s [vector] No ghcjs-pkg found
  815. 98.51 s [vector] No greencard found
  816. 98.51 s [vector] Using haddock version 2.30.0 found on system at:
  817. 98.51 s [vector] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/haddock-ghc-9.12.1
  818. 98.51 s [vector] No happy found
  819. 98.51 s [vector] No haskell-suite found
  820. 98.51 s [vector] No haskell-suite-pkg found
  821. 98.51 s [vector] No hmake found
  822. 98.51 s [vector] Using hpc version 0.69 found on system at:
  823. 98.51 s [vector] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hpc-ghc-9.12.1
  824. 98.51 s [vector] Using hsc2hs version 0.68.10 found on system at:
  825. 98.51 s [vector] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
  826. 98.51 s [vector] Using hscolour version 1.25 found on system at:
  827. 98.51 s [vector] /nix/store/q6qz2x3a08capyv98w52zizgxcnmv4hb-hscolour-1.25/bin/HsColour
  828. 98.51 s [vector] No jhc found
  829. 98.51 s [vector] Using ld found on system at:
  830. 98.51 s [vector] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  831. 98.51 s [vector] No pkg-config found
  832. 98.51 s [vector] Using runghc version 9.12.1 found on system at:
  833. 98.51 s [vector] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/runghc-9.12.1
  834. 98.51 s [vector] Using strip version 2.44 found on system at:
  835. 98.51 s [vector] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  836. 98.51 s [vector] Using tar found on system at:
  837. 98.51 s [vector] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  838. 98.51 s [vector] No uhc found
  839. 98.93 s [vector] Phase: buildPhase
  840. 99.17 s [vector] Preprocessing library for vector-0.13.2.0...
  841. 99.18 s [vector] Building library for vector-0.13.2.0...
  842. 100.35 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 )
  843. 100.51 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 )
  844. 100.52 s [duoids] [3 of 9] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.o, dist/build/Control/Duoidal.dyn_o )
  845. 100.67 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 )
  846. 100.97 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 )
  847. 100.99 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 )
  848. 101.07 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 )
  849. 101.18 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 )
  850. 103.73 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 )
  851. 103.88 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 )
  852. 103.88 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 )
  853. 103.88 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 )
  854. 103.93 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 )
  855. 103.93 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 )
  856. 104.45 s [duoids] [1 of 9] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.p_o )
  857. 105.63 s [duoids] [2 of 9] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.p_o )
  858. 108.11 s [duoids] [3 of 9] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.p_o )
  859. 111.56 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 )
  860. 111.90 s [duoids] [4 of 9] Compiling Control.Duoidal.Fix ( src/Control/Duoidal/Fix.hs, dist/build/Control/Duoidal/Fix.p_o )
  861. 112.70 s [duoids] [5 of 9] Compiling Control.Duoidal.Fail ( src/Control/Duoidal/Fail.hs, dist/build/Control/Duoidal/Fail.p_o )
  862. 112.77 s [duoids] [6 of 9] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.p_o )
  863. 112.79 s [duoids] [7 of 9] Compiling Control.Duoidal.Do ( src/Control/Duoidal/Do.hs, dist/build/Control/Duoidal/Do.p_o )
  864. 112.99 s [duoids] [8 of 9] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.p_o )
  865. 112.99 s [duoids] [9 of 9] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.p_o )
  866. 115.19 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  867. 115.19 s [duoids] Building test suite 'doctests' for duoids-0.0.1.0...
  868. 115.36 s [duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  869. 115.81 s [duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  870. 116.58 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 )
  871. 116.78 s [duoids] [3 of 3] Linking dist/build/doctests/doctests
  872. 122.12 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 )
  873. 123.58 s [duoids] Phase: checkPhase
  874. 124.02 s [duoids] Running 1 test suites...
  875. 124.02 s [duoids] Test suite doctests: RUNNING...
  876. 124.55 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 )
  877. 124.74 s [duoids] on the commandline: warning: [GHC-98887]
  878. 124.74 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  879. 124.74 s [duoids]
  880. 124.74 s [duoids] on the commandline: warning: [GHC-98887]
  881. 124.74 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  882. 124.74 s [duoids]
  883. 124.74 s [duoids] on the commandline: warning: [GHC-98887]
  884. 124.74 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  885. 124.74 s [duoids]
  886. 124.74 s [duoids] on the commandline: warning: [GHC-98887]
  887. 124.74 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  888. 124.74 s [duoids]
  889. 124.74 s [duoids] on the commandline: warning: [GHC-98887]
  890. 124.74 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  891. 124.74 s [duoids]
  892. 124.74 s [duoids] on the commandline: warning: [GHC-98887]
  893. 124.74 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  894. 124.74 s [duoids]
  895. 124.75 s [duoids] on the commandline: warning: [GHC-98887]
  896. 124.75 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  897. 124.75 s [duoids]
  898. 124.75 s [duoids] on the commandline: warning: [GHC-98887]
  899. 124.75 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  900. 124.75 s [duoids]
  901. 124.75 s [duoids] on the commandline: warning: [GHC-98887]
  902. 124.75 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  903. 124.75 s [duoids]
  904. 124.75 s [duoids] on the commandline: warning: [GHC-98887]
  905. 124.75 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  906. 124.75 s [duoids]
  907. 124.75 s [duoids] on the commandline: warning: [GHC-98887]
  908. 124.75 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  909. 124.75 s [duoids]
  910. 124.75 s [duoids] on the commandline: warning: [GHC-98887]
  911. 124.75 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  912. 124.75 s [duoids]
  913. 124.75 s [duoids] on the commandline: warning: [GHC-98887]
  914. 124.75 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  915. 124.75 s [duoids]
  916. 124.75 s [duoids] on the commandline: warning: [GHC-98887]
  917. 124.75 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  918. 124.75 s [duoids]
  919. 124.76 s [duoids] on the commandline: warning: [GHC-98887]
  920. 124.76 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  921. 124.76 s [duoids]
  922. 126.35 s [duoids] Examples: 5 Tried: 5 Errors: 0 Failures: 0
  923. 126.42 s [duoids] Test suite doctests: PASS
  924. 126.42 s [duoids] Test suite logged to: dist/test/duoids-0.0.1.0-doctests.log
  925. 126.42 s [duoids] 1 of 1 test suites (1 of 1 test cases) passed.
  926. 126.43 s [duoids] Phase: haddockPhase
  927. 127.28 s [duoids] Preprocessing library for duoids-0.0.1.0...
  928. 127.34 s [duoids] Running Haddock on library for duoids-0.0.1.0...
  929. 127.53 s [duoids] [1 of 9] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, nothing ) [HIE file is missing]
  930. 127.78 s [duoids] [2 of 9] Compiling Data.Duoid ( src/Data/Duoid.hs, nothing ) [HIE file is missing]
  931. 128.26 s [duoids] [3 of 9] Compiling Control.Duoidal ( src/Control/Duoidal.hs, nothing ) [HIE file is missing]
  932. 129.10 s [duoids] [4 of 9] Compiling Control.Duoidal.Fix ( src/Control/Duoidal/Fix.hs, nothing ) [HIE file is missing]
  933. 129.12 s [duoids] [5 of 9] Compiling Control.Duoidal.Fail ( src/Control/Duoidal/Fail.hs, nothing ) [HIE file is missing]
  934. 129.14 s [duoids] [6 of 9] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, nothing ) [HIE file is missing]
  935. 129.15 s [duoids] [7 of 9] Compiling Control.Duoidal.Do ( src/Control/Duoidal/Do.hs, nothing ) [HIE file is missing]
  936. 129.15 s [duoids] [8 of 9] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, nothing ) [HIE file is missing]
  937. 129.18 s [duoids] [9 of 9] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, nothing ) [HIE file is missing]
  938. 129.22 s [duoids] Haddock coverage:
  939. 129.22 s [duoids] Warning: 'cancel' is out of scope.
  940. 129.22 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  941. 129.31 s [duoids] Warning: 'Par' is ambiguous. It is defined
  942. 129.31 s [duoids] * at src/Data/Duoid.hs:53:17
  943. 129.31 s [duoids] * at src/Data/Duoid.hs:53:1
  944. 129.31 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  945. 129.31 s [duoids] by specifying the type/value namespace explicitly.
  946. 129.31 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:53:1
  947. 129.31 s [duoids] Warning: 'Seq' is ambiguous. It is defined
  948. 129.31 s [duoids] * at src/Data/Duoid.hs:59:17
  949. 129.31 s [duoids] * at src/Data/Duoid.hs:59:1
  950. 129.31 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  951. 129.31 s [duoids] by specifying the type/value namespace explicitly.
  952. 129.31 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:59:1
  953. 129.31 s [duoids] 100% ( 10 / 10) in 'Data.Duoid'
  954. 129.32 s [duoids] Warning: 'ExceptT' is out of scope.
  955. 129.32 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  956. 129.32 s [duoids] Warning: 'Parallel' is ambiguous. It is defined
  957. 129.32 s [duoids] * at src/Control/Duoidal.hs:228:24
  958. 129.32 s [duoids] * at src/Control/Duoidal.hs:228:1
  959. 129.32 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  960. 129.32 s [duoids] by specifying the type/value namespace explicitly.
  961. 129.32 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:228:1
  962. 129.32 s [duoids] Warning: 'Sequential' is ambiguous. It is defined
  963. 129.32 s [duoids] * at src/Control/Duoidal.hs:243:26
  964. 129.32 s [duoids] * at src/Control/Duoidal.hs:243:1
  965. 129.32 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  966. 129.32 s [duoids] by specifying the type/value namespace explicitly.
  967. 129.32 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:243:1
  968. 129.32 s [duoids] Warning: 'NoDefaultPrelude' is out of scope.
  969. 129.32 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  970. 129.32 s [duoids] Warning: 'Validation' is out of scope.
  971. 129.32 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  972. 129.32 s [duoids] Warning: 'fail' is out of scope.
  973. 129.32 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  974. 129.32 s [duoids] Warning: 'MonadFail' is out of scope.
  975. 129.32 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  976. 129.33 s [duoids] Warning: 'Commutative' is ambiguous. It is defined
  977. 129.33 s [duoids] * at src/Control/Duoidal.hs:529:27
  978. 129.33 s [duoids] * at src/Control/Duoidal.hs:529:1
  979. 129.33 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  980. 129.33 s [duoids] by specifying the type/value namespace explicitly.
  981. 129.33 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:529:1
  982. 129.33 s [duoids] Warning: 'Writer' is out of scope.
  983. 129.33 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  984. 129.33 s [duoids] Warning: 'Set' is out of scope.
  985. 129.33 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  986. 129.33 s [duoids] Warning: 'Char' is out of scope.
  987. 129.33 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  988. 129.33 s [duoids] Warning: 'Const' is ambiguous. It is defined
  989. 129.33 s [duoids] * in ‘GHC.Internal.Data.Functor.Const’
  990. 129.33 s [duoids] * in ‘GHC.Internal.Data.Functor.Const’
  991. 129.33 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  992. 129.33 s [duoids] by specifying the type/value namespace explicitly.
  993. 129.33 s [duoids] Defaulting to the one defined in ‘GHC.Internal.Data.Functor.Const’
  994. 129.33 s [duoids] Warning: 'Normal' is ambiguous. It is defined
  995. 129.33 s [duoids] * at src/Control/Duoidal.hs:279:1
  996. 129.33 s [duoids] * at src/Data/Duoid.hs:74:1
  997. 129.33 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  998. 129.33 s [duoids] by specifying the type/value namespace explicitly.
  999. 129.33 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:74:1
  1000. 129.33 s [duoids] 46% ( 28 / 60) in 'Control.Duoidal'
  1001. 129.33 s [duoids] Missing documentation for:
  1002. 129.33 s [duoids] DuoidalIO (src/Control/Duoidal.hs:470)
  1003. 129.33 s [duoids] Parallel (src/Control/Duoidal.hs:228)
  1004. 129.33 s [duoids] traverse_ (src/Control/Duoidal.hs:395)
  1005. 129.33 s [duoids] for (src/Control/Duoidal.hs:401)
  1006. 129.33 s [duoids] for_ (src/Control/Duoidal.hs:407)
  1007. 129.33 s [duoids] forever (src/Control/Duoidal.hs:427)
  1008. 129.33 s [duoids] Sequential (src/Control/Duoidal.hs:243)
  1009. 129.33 s [duoids] >> (src/Control/Duoidal.hs:339)
  1010. 129.33 s [duoids] >>= (src/Control/Duoidal.hs:450)
  1011. 129.33 s [duoids] >=> (src/Control/Duoidal.hs:460)
  1012. 129.33 s [duoids] =<< (src/Control/Duoidal.hs:455)
  1013. 129.33 s [duoids] <=< (src/Control/Duoidal.hs:465)
  1014. 129.33 s [duoids] join (src/Control/Duoidal.hs:447)
  1015. 129.33 s [duoids] ap (src/Control/Duoidal.hs:314)
  1016. 129.33 s [duoids] return (src/Control/Duoidal.hs:290)
  1017. 129.33 s [duoids] liftM2 (src/Control/Duoidal.hs:297)
  1018. 129.33 s [duoids] liftM3 (src/Control/Duoidal.hs:304)
  1019. 129.33 s [duoids] mapM (src/Control/Duoidal.hs:392)
  1020. 129.33 s [duoids] mapM_ (src/Control/Duoidal.hs:398)
  1021. 129.33 s [duoids] forM (src/Control/Duoidal.hs:404)
  1022. 129.33 s [duoids] forM_ (src/Control/Duoidal.hs:410)
  1023. 129.33 s [duoids] sequence (src/Control/Duoidal.hs:417)
  1024. 129.33 s [duoids] sequence_ (src/Control/Duoidal.hs:424)
  1025. 129.33 s [duoids] forever' (src/Control/Duoidal.hs:430)
  1026. 129.33 s [duoids] unless' (src/Control/Duoidal.hs:437)
  1027. 129.33 s [duoids] when' (src/Control/Duoidal.hs:444)
  1028. 129.33 s [duoids] normalPure (src/Control/Duoidal.hs:474)
  1029. 129.33 s [duoids] sequentialAp (src/Control/Duoidal.hs:490)
  1030. 129.33 s [duoids] sequentialBind (src/Control/Duoidal.hs:494)
  1031. 129.33 s [duoids] sequentialLiftA2 (src/Control/Duoidal.hs:485)
  1032. 129.33 s [duoids] sequentialPure (src/Control/Duoidal.hs:477)
  1033. 129.33 s [duoids] commutativeAp (src/Control/Duoidal.hs:544)
  1034. 129.33 s [duoids] 100% ( 3 / 3) in 'Control.Duoidal.Fix'
  1035. 129.33 s [duoids] 100% ( 3 / 3) in 'Control.Duoidal.Fail'
  1036. 129.33 s [duoids] 100% ( 2 / 2) in 'Control.Duoidal.Either'
  1037. 129.33 s [duoids] 55% ( 5 / 9) in 'Control.Duoidal.Do'
  1038. 129.33 s [duoids] Missing documentation for:
  1039. 129.33 s [duoids] join (src/Control/Duoidal.hs:447)
  1040. 129.33 s [duoids] return (src/Control/Duoidal.hs:290)
  1041. 129.33 s [duoids] >> (src/Control/Duoidal.hs:339)
  1042. 129.33 s [duoids] >>= (src/Control/Duoidal.hs:450)
  1043. 129.33 s [duoids] 16% ( 2 / 12) in 'Data.Duoid.Laws'
  1044. 129.33 s [duoids] Missing documentation for:
  1045. 129.33 s [duoids] Law (src/Data/Duoid/Laws.hs:27)
  1046. 129.33 s [duoids] Laws (src/Data/Duoid/Laws.hs:49)
  1047. 129.33 s [duoids] getLaws (src/Data/Duoid/Laws.hs:57)
  1048. 129.33 s [duoids] NormalLaws (src/Data/Duoid/Laws.hs:70)
  1049. 129.33 s [duoids] getNormalLaws (src/Data/Duoid/Laws.hs:76)
  1050. 129.33 s [duoids] checkLaw (src/Data/Duoid/Laws.hs:30)
  1051. 129.33 s [duoids] interchangeLaw (src/Data/Duoid/Laws.hs:33)
  1052. 129.33 s [duoids] joinUnitLaw (src/Data/Duoid/Laws.hs:43)
  1053. 129.33 s [duoids] splitUnitLaw (src/Data/Duoid/Laws.hs:40)
  1054. 129.33 s [duoids] swapUnitLaw (src/Data/Duoid/Laws.hs:46)
  1055. 129.33 s [duoids] 50% ( 3 / 6) in 'Control.Duoidal.Laws'
  1056. 129.33 s [duoids] Missing documentation for:
  1057. 129.33 s [duoids] joinUnit (src/Control/Duoidal/Laws.hs:67)
  1058. 129.33 s [duoids] splitUnit (src/Control/Duoidal/Laws.hs:63)
  1059. 129.33 s [duoids] swapUnit (src/Control/Duoidal/Laws.hs:74)
  1060. 135.22 s [duoids] Documentation created: dist/doc/html/duoids, dist/doc/html/duoids/duoids.txt
  1061. 135.82 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  1062. 135.90 s [duoids] Phase: installPhase
  1063. 135.97 s [duoids] Installing library in /nix/store/9yr9naycgwnywfqwx2rjwa8pnkj0vi2i-duoids-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  1064. 136.53 s [duoids] Phase: fixupPhase
  1065. 136.58 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/9yr9naycgwnywfqwx2rjwa8pnkj0vi2i-duoids-0.0.1.0
  1066. 136.58 s [duoids] shrinking /nix/store/9yr9naycgwnywfqwx2rjwa8pnkj0vi2i-duoids-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSduoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt-ghc9.12.1.so
  1067. 136.59 s [duoids] checking for references to /build/ in /nix/store/9yr9naycgwnywfqwx2rjwa8pnkj0vi2i-duoids-0.0.1.0...
  1068. 136.63 s [duoids] patching script interpreter paths in /nix/store/9yr9naycgwnywfqwx2rjwa8pnkj0vi2i-duoids-0.0.1.0
  1069. 136.65 s [duoids] stripping (with command strip and flags -S -p) in /nix/store/9yr9naycgwnywfqwx2rjwa8pnkj0vi2i-duoids-0.0.1.0/lib
  1070. 136.92 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/c1fzl1px25bv2vpkn0lx0pc2yx2g4gyz-duoids-0.0.1.0-doc
  1071. 136.93 s [duoids] checking for references to /build/ in /nix/store/c1fzl1px25bv2vpkn0lx0pc2yx2g4gyz-duoids-0.0.1.0-doc...
  1072. 136.94 s [duoids] patching script interpreter paths in /nix/store/c1fzl1px25bv2vpkn0lx0pc2yx2g4gyz-duoids-0.0.1.0-doc
  1073. 137.19 s [duoids:post-build] Uploading to cachix cache "sellout": /nix/store/9yr9naycgwnywfqwx2rjwa8pnkj0vi2i-duoids-0.0.1.0 /nix/store/c1fzl1px25bv2vpkn0lx0pc2yx2g4gyz-duoids-0.0.1.0-doc
  1074. 138.16 s [duoids:post-build] Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
  1075. 138.16 s [duoids:post-build]
  1076. 138.56 s [duoids:post-build] Pushing /nix/store/9yr9naycgwnywfqwx2rjwa8pnkj0vi2i-duoids-0.0.1.0 (7.81 MiB)
  1077. 138.68 s [duoids:post-build] Pushing /nix/store/c1fzl1px25bv2vpkn0lx0pc2yx2g4gyz-duoids-0.0.1.0-doc (2.08 MiB)
  1078. 139.89 s [duoids:post-build]
  1079. 139.89 s [duoids:post-build] All done.
  1080. 140.08 s [duoids:post-build] Uploading to the NixCI cache: /nix/store/9yr9naycgwnywfqwx2rjwa8pnkj0vi2i-duoids-0.0.1.0 /nix/store/c1fzl1px25bv2vpkn0lx0pc2yx2g4gyz-duoids-0.0.1.0-doc
  1081. 140.45 s [duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1082. 140.54 s [duoids:post-build] copying 2 paths...
  1083. 140.59 s [duoids:post-build] copying path '/nix/store/c1fzl1px25bv2vpkn0lx0pc2yx2g4gyz-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  1084. 141.42 s [duoids:post-build] copying path '/nix/store/9yr9naycgwnywfqwx2rjwa8pnkj0vi2i-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  1085. 144.60 s [duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1086. 145.60 s [duoids:post-build] copying 166 paths...
  1087. 145.64 s [duoids:post-build] copying path '/nix/store/d1fx73zyw9554gl9rpjfhbz3jl110rxk-ghc-9.10.2.drv' to 'https://cache.nix-ci.com'...
  1088. 145.82 s [duoids:post-build] copying path '/nix/store/li5d0mlpb83za95gdhal43fjmsj9p4rs-jailbreak-cabal-1.4.1.drv' to 'https://cache.nix-ci.com'...
  1089. 145.82 s [duoids:post-build] copying path '/nix/store/lmxfm5gp6h20vz2pwixxhjfwpq8v604i-hscolour-1.25.drv' to 'https://cache.nix-ci.com'...
  1090. 145.83 s [duoids:post-build] copying path '/nix/store/hpqdv9ivl0icdpw0mh7j19i873g3ryqs-ghc-settings-edit-0.1.0.drv' to 'https://cache.nix-ci.com'...
  1091. 146.06 s [duoids:post-build] copying path '/nix/store/05cdn1p1k2isql19sslbdml3day30x81-haskell-lexer-1.1.2.drv' to 'https://cache.nix-ci.com'...
  1092. 146.07 s [duoids:post-build] copying path '/nix/store/anvay024dp4dy4w210f464qy86sbz5mv-tagged-0.8.8.drv' to 'https://cache.nix-ci.com'...
  1093. 146.12 s [duoids:post-build] copying path '/nix/store/a989xz24hks9girbip2ficqgdsrygkra-regex-base-0.94.0.3.drv' to 'https://cache.nix-ci.com'...
  1094. 146.12 s [duoids:post-build] copying path '/nix/store/a325j0r5z0b8my6jiwzihq29lra0753f-hscolour-1.25.drv' to 'https://cache.nix-ci.com'...
  1095. 146.12 s [duoids:post-build] copying path '/nix/store/2yrk5c2vg8vcsir6siw8sg42y32wgcr5-erf-2.0.0.0.drv' to 'https://cache.nix-ci.com'...
  1096. 146.12 s [duoids:post-build] copying path '/nix/store/3p37fcj2lxfdkdh60vqdhqwhr3h4kf5j-primitive-0.9.1.0.drv' to 'https://cache.nix-ci.com'...
  1097. 146.12 s [duoids:post-build] copying path '/nix/store/4iwqr8ybrd8s5ic6fzs969pli9aa8s59-heaps-0.4.1.drv' to 'https://cache.nix-ci.com'...
  1098. 146.12 s [duoids:post-build] copying path '/nix/store/1p28iqiwy41b6jw8aw8709r4w4fvwy6f-ghc-platform-9.12.1.drv' to 'https://cache.nix-ci.com'...
  1099. 146.12 s [duoids:post-build] copying path '/nix/store/4nz92yqr5ysaw3gdgii62404p919jlxz-colour-2.3.6.drv' to 'https://cache.nix-ci.com'...
  1100. 146.12 s [duoids:post-build] copying path '/nix/store/acrny6d13xak6112v4xamfvaky73p7j1-vector-stream-0.1.0.1.drv' to 'https://cache.nix-ci.com'...
  1101. 146.12 s [duoids:post-build] copying path '/nix/store/9xdl6m1igivwrvxcakvf0736pbbscsxr-transformers-compat-0.7.2.drv' to 'https://cache.nix-ci.com'...
  1102. 146.12 s [duoids:post-build] copying path '/nix/store/55g74l1zrbzwbrra6js5ah7biqcalbj0-hostname-1.0.drv' to 'https://cache.nix-ci.com'...
  1103. 146.12 s [duoids:post-build] copying path '/nix/store/9z434fh2bgbs9naqbdgiaqjahhspbqg2-js-dgtable-0.5.2.drv' to 'https://cache.nix-ci.com'...
  1104. 146.12 s [duoids:post-build] copying path '/nix/store/adl9ka60fsb73x8v4fmj2nhgc7lsn7bz-call-stack-0.4.0.drv' to 'https://cache.nix-ci.com'...
  1105. 146.13 s [duoids:post-build] copying path '/nix/store/dm1gp4zl9pya1wy79jsdyg5s7wcggp41-js-flot-0.8.3.drv' to 'https://cache.nix-ci.com'...
  1106. 146.13 s [duoids:post-build] copying path '/nix/store/bcajvp2j2aqqprjg48aradnbnz0bca7y-inspection-testing-0.5.0.3.drv' to 'https://cache.nix-ci.com'...
  1107. 146.33 s [duoids:post-build] copying path '/nix/store/fk31vpc3mxid0xlgdgwhni5ml841dwgx-base-compat-0.13.1.drv' to 'https://cache.nix-ci.com'...
  1108. 146.34 s [duoids:post-build] copying path '/nix/store/l7jn4m42qsbgrlbcjv4l115c7j9bwmqr-assoc-1.1.1.drv' to 'https://cache.nix-ci.com'...
  1109. 146.37 s [duoids:post-build] copying path '/nix/store/lm8prdc3x43c5wc74x046qplq358hwbb-void-0.7.3.drv' to 'https://cache.nix-ci.com'...
  1110. 146.37 s [duoids:post-build] copying path '/nix/store/p4vjbgz6p46ybkx1pc87yypdzrl7a67v-prettyprinter-1.7.1.drv' to 'https://cache.nix-ci.com'...
  1111. 146.38 s [duoids:post-build] copying path '/nix/store/pwv5vn8qgfcm15h2l7k80i34a35bcm90-happy-lib-2.0.2.drv' to 'https://cache.nix-ci.com'...
  1112. 146.38 s [duoids:post-build] copying path '/nix/store/pyxrkqfq3zl7j4clw324b2kjprfjp7fc-terminal-size-0.3.4.drv' to 'https://cache.nix-ci.com'...
  1113. 146.41 s [duoids:post-build] copying path '/nix/store/qmavm4mm4xrldnhbd9ml5nr8h4bg9zyv-unliftio-core-0.2.1.0.drv' to 'https://cache.nix-ci.com'...
  1114. 146.41 s [duoids:post-build] copying path '/nix/store/r39n8shma50s1xbx8bwv4j4a3wzq7lkd-code-page-0.2.1.drv' to 'https://cache.nix-ci.com'...
  1115. 146.41 s [duoids:post-build] copying path '/nix/store/sgmx53r6rkp4g6phrc4brbasi0pww4r4-splitmix-0.1.1.drv' to 'https://cache.nix-ci.com'...
  1116. 146.43 s [duoids:post-build] copying path '/nix/store/sh2982pyfyx54wz73wzl9ykfd2s0kq8b-js-jquery-3.3.1.drv' to 'https://cache.nix-ci.com'...
  1117. 146.44 s [duoids:post-build] copying path '/nix/store/sni67m7j5rd44j6vdkyxcgbmbvjiycm3-xml-1.3.14.drv' to 'https://cache.nix-ci.com'...
  1118. 146.45 s [duoids:post-build] copying path '/nix/store/sypzqag32qaismq87ygp4py6f4wl5wzv-nanospec-0.2.2.drv' to 'https://cache.nix-ci.com'...
  1119. 146.46 s [duoids:post-build] copying path '/nix/store/x54rr82dc343llj57lnv1xvrn93b1g7s-extensible-exceptions-0.1.1.4.drv' to 'https://cache.nix-ci.com'...
  1120. 146.47 s [duoids:post-build] copying path '/nix/store/y20w41mq1rh6dzwgnwaz7fhhlw5gv0bf-th-abstraction-0.7.1.0.drv' to 'https://cache.nix-ci.com'...
  1121. 146.49 s [duoids:post-build] copying path '/nix/store/yqmr7q36vzvx808c8n9bb4hnjfj7fm9v-ghc-paths-0.1.0.12.drv' to 'https://cache.nix-ci.com'...
  1122. 146.49 s [duoids:post-build] copying path '/nix/store/z2rafd93ran1i7a0kdvfsymm45c92agc-clock-0.8.4.drv' to 'https://cache.nix-ci.com'...
  1123. 146.55 s [duoids:post-build] copying path '/nix/store/zspiw67wg6pqv2w06rgidli8d54f5mqh-old-locale-1.0.0.7.drv' to 'https://cache.nix-ci.com'...
  1124. 146.57 s [duoids:post-build] copying path '/nix/store/2gmsm72lhzz7p8m49mn5ic1q12caw19v-HUnit-1.6.2.0.drv' to 'https://cache.nix-ci.com'...
  1125. 146.60 s [duoids:post-build] copying path '/nix/store/xavm8y9dbpf8vxb4fdpszzpdf55kcisr-logging-facade-0.3.1.drv' to 'https://cache.nix-ci.com'...
  1126. 146.60 s [duoids:post-build] copying path '/nix/store/dhh1gzm1al36ydknbbl9rlj2kf1kga5p-regex-posix-0.96.0.2.drv' to 'https://cache.nix-ci.com'...
  1127. 146.61 s [duoids:post-build] copying path '/nix/store/jyqd5m3vghixzdlk74zafz9zi0vmc83h-boring-0.2.2.drv' to 'https://cache.nix-ci.com'...
  1128. 146.62 s [duoids:post-build] copying path '/nix/store/w9b4q19zhg9px45941rv82v6clxgng1d-ansi-terminal-types-1.1.drv' to 'https://cache.nix-ci.com'...
  1129. 146.66 s [duoids:post-build] copying path '/nix/store/2gh2mrzxhprxsv3jy258zn0hxq874xy6-ghc-toolchain-9.12.1.drv' to 'https://cache.nix-ci.com'...
  1130. 146.66 s [duoids:post-build] copying path '/nix/store/h4q5g80cgcbgmkqza0c0lb67dcfrd5w6-mmorph-1.2.0.drv' to 'https://cache.nix-ci.com'...
  1131. 146.67 s [duoids:post-build] copying path '/nix/store/aw06d9lzqfli4d5nv72890lrcpdbyzd8-happy-2.0.2.drv' to 'https://cache.nix-ci.com'...
  1132. 146.67 s [duoids:post-build] copying path '/nix/store/42m7ycfx9viq5sca305npp9dhynq2320-random-1.2.1.3.drv' to 'https://cache.nix-ci.com'...
  1133. 146.77 s [duoids:post-build] copying path '/nix/store/lzvgndrrnhw7sw06pvjs2211fyd7hm8h-old-time-1.1.0.4.drv' to 'https://cache.nix-ci.com'...
  1134. 146.79 s [duoids:post-build] copying path '/nix/store/jqycnx4nflkdkjip0w88wnhdxk99v6rd-pcre-light-0.4.1.3.drv' to 'https://cache.nix-ci.com'...
  1135. 146.79 s [duoids:post-build] copying path '/nix/store/n4af28nq86r845skaq2yb6nq4vzfdy9h-hspec-expectations-0.8.4.drv' to 'https://cache.nix-ci.com'...
  1136. 146.79 s [duoids:post-build] copying path '/nix/store/l9gbqflb28gff8d33x2py3rkmhpfd2bw-utf8-string-1.0.2.drv' to 'https://cache.nix-ci.com'...
  1137. 146.86 s [duoids:post-build] copying path '/nix/store/b3ddpqy4gffkagkww1sc6i4mslp3a7m3-ansi-terminal-1.1.2.drv' to 'https://cache.nix-ci.com'...
  1138. 146.91 s [duoids:post-build] copying path '/nix/store/fqv12pj5spixrg01bpp9xgy18dsvilk5-temporary-1.3.drv' to 'https://cache.nix-ci.com'...
  1139. 146.92 s [duoids:post-build] copying path '/nix/store/s6j03yr5fcwx4ajj002s4vvq562fji16-tf-random-0.5.drv' to 'https://cache.nix-ci.com'...
  1140. 146.92 s [duoids:post-build] copying path '/nix/store/xixpcbzc4r93nsaxhxm64yxd2j6kn8f6-QuickCheck-2.14.3.drv' to 'https://cache.nix-ci.com'...
  1141. 146.92 s [duoids:post-build] copying path '/nix/store/qa75jn335hbhydk70rwp19fr55sr7mla-alex-3.5.3.0.drv' to 'https://cache.nix-ci.com'...
  1142. 146.92 s [duoids:post-build] copying path '/nix/store/1308jg2a68i7qnlcacr5fyv5ysgkv57n-pretty-show-1.10.drv' to 'https://cache.nix-ci.com'...
  1143. 147.08 s [duoids:post-build] copying path '/nix/store/2fvbfpmn2v7xy9x6qvpfgvy5d2flcc0b-prettyprinter-ansi-terminal-1.1.3.drv' to 'https://cache.nix-ci.com'...
  1144. 147.13 s [duoids:post-build] copying path '/nix/store/b4z9lk9zlw9njr6m3f9fb7q9k25p80qd-silently-1.2.5.4.drv' to 'https://cache.nix-ci.com'...
  1145. 147.13 s [duoids:post-build] copying path '/nix/store/sgrj0rallqvdl2ry33f5cr63isms5wzk-mockery-0.3.5.drv' to 'https://cache.nix-ci.com'...
  1146. 147.16 s [duoids:post-build] copying path '/nix/store/p8myby6kaf1j44ap8w2w9m3fccik5k0g-quickcheck-io-0.2.0.drv' to 'https://cache.nix-ci.com'...
  1147. 147.17 s [duoids:post-build] copying path '/nix/store/vrlbs3mp58mb6gr3hbmxkqdp3ni8lk2i-Cabal-syntax-3.14.2.0.drv' to 'https://cache.nix-ci.com'...
  1148. 147.29 s [duoids:post-build] copying path '/nix/store/5dmh7pr3s8dzp9nclbanf553yjkn0s3l-prettyprinter-compat-ansi-wl-pprint-1.0.2.drv' to 'https://cache.nix-ci.com'...
  1149. 147.29 s [duoids:post-build] copying path '/nix/store/jiwh94i0814gkmsli6bzxbd2540bp956-optparse-applicative-0.18.1.0.drv' to 'https://cache.nix-ci.com'...
  1150. 147.39 s [duoids:post-build] copying path '/nix/store/c385a6bn782lfg5mvd1lrci8361paqqs-hspec-meta-2.11.12.drv' to 'https://cache.nix-ci.com'...
  1151. 147.39 s [duoids:post-build] copying path '/nix/store/5zvknyrah9d1qk1x20rsz4dll2si4j4r-hspec-core-2.11.12.drv' to 'https://cache.nix-ci.com'...
  1152. 147.39 s [duoids:post-build] copying path '/nix/store/lfd7y6wa0jxibvhmypamqwb2p0rffv19-Cabal-3.14.2.0.drv' to 'https://cache.nix-ci.com'...
  1153. 147.51 s [duoids:post-build] copying path '/nix/store/xgxbyyrmw1fxy3cidpcqgvfkvyy9lm31-ansi-wl-pprint-1.0.2.drv' to 'https://cache.nix-ci.com'...
  1154. 147.51 s [duoids:post-build] copying path '/nix/store/jmf617b0p0wvzvyr111xadpx1z47rkmm-tasty-1.5.3.drv' to 'https://cache.nix-ci.com'...
  1155. 147.62 s [duoids:post-build] copying path '/nix/store/lxkkfvkksrq30vwgivxvvsmy495g95mc-hspec-discover-2.11.12.drv' to 'https://cache.nix-ci.com'...
  1156. 147.73 s [duoids:post-build] copying path '/nix/store/cavav1d53vglx01nh0xwj2rhppwfsqgy-tasty-hunit-0.10.2.drv' to 'https://cache.nix-ci.com'...
  1157. 147.74 s [duoids:post-build] copying path '/nix/store/ibwv5gddlrvwn1zsfw5y45b30vj6z4iy-tasty-inspection-testing-0.2.1.drv' to 'https://cache.nix-ci.com'...
  1158. 147.75 s [duoids:post-build] copying path '/nix/store/g5v6nvwqv6m3292qgrhxxz5wagc2qjbm-test-framework-0.8.2.2.drv' to 'https://cache.nix-ci.com'...
  1159. 147.86 s [duoids:post-build] copying path '/nix/store/njrqxlvjnqn83piv74hr25pzzw6n10rh-hspec-2.11.12.drv' to 'https://cache.nix-ci.com'...
  1160. 147.97 s [duoids:post-build] copying path '/nix/store/cd5qjk0055xaqm22cls11wf6f5d2df5n-syb-0.7.2.4.drv' to 'https://cache.nix-ci.com'...
  1161. 147.97 s [duoids:post-build] copying path '/nix/store/vzmhyqv8png14nfknbdn96nz9kqyd99z-wherefrom-compat-0.1.1.1.drv' to 'https://cache.nix-ci.com'...
  1162. 147.97 s [duoids:post-build] copying path '/nix/store/d202fwil2l9b5vg79a340srh7rsdkxxk-wl-pprint-annotated-0.1.0.1.drv' to 'https://cache.nix-ci.com'...
  1163. 147.97 s [duoids:post-build] copying path '/nix/store/8rpppc0bpfz7kwfbnl5kwjnkrdfrh1mx-tasty-quickcheck-0.11.drv' to 'https://cache.nix-ci.com'...
  1164. 147.97 s [duoids:post-build] copying path '/nix/store/rcl161wj4x8w5v9v3jnc9lv3h06ayd67-test-framework-hunit-0.3.0.2.drv' to 'https://cache.nix-ci.com'...
  1165. 147.97 s [duoids:post-build] copying path '/nix/store/6m98d1z23im86fg8lg8qj108z4gwg4dq-test-framework-quickcheck2-0.3.0.6.drv' to 'https://cache.nix-ci.com'...
  1166. 148.07 s [duoids:post-build] copying path '/nix/store/dy76rk31kyiyhqirm31br33lyfmfkmwr-stringbuilder-0.5.1.drv' to 'https://cache.nix-ci.com'...
  1167. 148.07 s [duoids:post-build] copying path '/nix/store/ifdsr8mmvq489izh82b4yifalzfx2ygs-resourcet-1.3.0.drv' to 'https://cache.nix-ci.com'...
  1168. 148.08 s [duoids:post-build] copying path '/nix/store/kaj6l9y9klicnw2ins71qxmcb80wmp39-generic-deriving-1.14.6.drv' to 'https://cache.nix-ci.com'...
  1169. 148.08 s [duoids:post-build] copying path '/nix/store/73pibdi7v9vhqx6365ijxg7pdmzk7i88-safe-exceptions-0.1.7.4.drv' to 'https://cache.nix-ci.com'...
  1170. 148.09 s [duoids:post-build] copying path '/nix/store/7abjwmzlgwlmypzzakpl3c2cqprk4swg-base-orphans-0.9.3.drv' to 'https://cache.nix-ci.com'...
  1171. 148.21 s [duoids:post-build] copying path '/nix/store/8phvfgqfcllp1vjyy68vqb3k5v85i9vs-hashable-1.4.7.0.drv' to 'https://cache.nix-ci.com'...
  1172. 148.22 s [duoids:post-build] copying path '/nix/store/m7d5zdwikaki5f06r5ascs4j80rlw3vd-ChasingBottoms-1.3.1.15.drv' to 'https://cache.nix-ci.com'...
  1173. 148.22 s [duoids:post-build] copying path '/nix/store/zq11y53pny08v10pbh1fmvkfdscvci1y-base16-bytestring-1.0.2.0.drv' to 'https://cache.nix-ci.com'...
  1174. 148.22 s [duoids:post-build] copying path '/nix/store/g741gzpk9ny2f1a8450qa6cj11xz7dzj-SHA-1.6.4.4.drv' to 'https://cache.nix-ci.com'...
  1175. 149.32 s [duoids:post-build] copying path '/nix/store/hdfq6ivvcyb61w2187vbixmwbgd56a9m-doctest-0.22.6.drv' to 'https://cache.nix-ci.com'...
  1176. 149.32 s [duoids:post-build] copying path '/nix/store/nfvlyl28viv87r0h6mqzcmccw09in920-distributive-0.6.2.1.drv' to 'https://cache.nix-ci.com'...
  1177. 149.33 s [duoids:post-build] copying path '/nix/store/sia5qspijpdnj1n68z142lpv4yf3r746-transformers-base-0.4.6.drv' to 'https://cache.nix-ci.com'...
  1178. 149.36 s [duoids:post-build] copying path '/nix/store/zmv59m8f73wn3mbcr0gs5rdr79vx4304-uuid-types-1.0.6.drv' to 'https://cache.nix-ci.com'...
  1179. 149.36 s [duoids:post-build] copying path '/nix/store/3kcixf3myy5x4vxlim2a0yxfyh60kryx-constraints-0.14.2.drv' to 'https://cache.nix-ci.com'...
  1180. 149.36 s [duoids:post-build] copying path '/nix/store/24i1v4ca1hmb4l3zq1120zz7l762w7gx-these-1.2.1.drv' to 'https://cache.nix-ci.com'...
  1181. 149.36 s [duoids:post-build] copying path '/nix/store/25jks2nwmg902gjzk5a15lwqm5pgh2gm-data-fix-0.3.4.drv' to 'https://cache.nix-ci.com'...
  1182. 149.37 s [duoids:post-build] copying path '/nix/store/19xikgqjjb82h2bwrn6lh2ihc15kqy39-OneTuple-0.4.2.drv' to 'https://cache.nix-ci.com'...
  1183. 149.37 s [duoids:post-build] copying path '/nix/store/5z4crp4hahq8gnakh2srsk1yg8c8dq1p-async-2.2.5.drv' to 'https://cache.nix-ci.com'...
  1184. 149.37 s [duoids:post-build] copying path '/nix/store/ynvpakjbnr549f01x0i82j2my9alwlih-cryptohash-sha256-0.11.102.1.drv' to 'https://cache.nix-ci.com'...
  1185. 149.37 s [duoids:post-build] copying path '/nix/store/pihlxydyc5bnn4cgzgxmh0bg2apqld20-text-short-0.1.6.drv' to 'https://cache.nix-ci.com'...
  1186. 149.38 s [duoids:post-build] copying path '/nix/store/yj8ddjr527s2bv3xknwlv9l1f759hgfz-time-compat-1.9.7.drv' to 'https://cache.nix-ci.com'...
  1187. 149.38 s [duoids:post-build] copying path '/nix/store/qrk92w8gq3vkhpsq4w9j5vls3cznx01m-case-insensitive-1.2.1.0.drv' to 'https://cache.nix-ci.com'...
  1188. 149.56 s [duoids:post-build] copying path '/nix/store/gn9072blgd7fl39g1kv8ipzj6n0nsykd-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...
  1189. 149.56 s [duoids:post-build] copying path '/nix/store/pm719b88wvsyfkhhpwy701v42di081v1-barbies-2.1.1.0.drv' to 'https://cache.nix-ci.com'...
  1190. 149.56 s [duoids:post-build] copying path '/nix/store/mbxb3khvhr8brv32jfjc6kcim1cbwzvm-monad-control-1.0.3.1.drv' to 'https://cache.nix-ci.com'...
  1191. 149.62 s [duoids:post-build] copying path '/nix/store/hlsk064y5dcq7zz54jh1274pf2x0wf78-strict-0.5.1.drv' to 'https://cache.nix-ci.com'...
  1192. 149.63 s [duoids:post-build] copying path '/nix/store/j57vvyv4yq3a6c14fm9q36xbq3k6qij8-logict-0.8.2.0.drv' to 'https://cache.nix-ci.com'...
  1193. 149.63 s [duoids:post-build] copying path '/nix/store/y5wl5652hjcm1fg0jbk2r39vl1f8prrk-concurrent-output-1.10.21.drv' to 'https://cache.nix-ci.com'...
  1194. 149.80 s [duoids:post-build] copying path '/nix/store/rsfxachc7yj534p30933ny2jn2dq9vwl-lifted-base-0.2.3.12.drv' to 'https://cache.nix-ci.com'...
  1195. 149.89 s [duoids:post-build] copying path '/nix/store/kzkzxfa2sb5m1wv5p5i859hppczz32jw-smallcheck-1.2.1.1.drv' to 'https://cache.nix-ci.com'...
  1196. 150.01 s [duoids:post-build] copying path '/nix/store/345g6202w1wls3l8qlby9v3caxfp6x6p-lifted-async-0.10.2.7.drv' to 'https://cache.nix-ci.com'...
  1197. 150.10 s [duoids:post-build] copying path '/nix/store/sqw6hjq2bdyhdp2x9x4gg3fxhhns3r60-tasty-smallcheck-0.8.2.drv' to 'https://cache.nix-ci.com'...
  1198. 150.23 s [duoids:post-build] copying path '/nix/store/jscwr5xmawv985j75232082z9z1xba1v-hedgehog-1.5.drv' to 'https://cache.nix-ci.com'...
  1199. 150.32 s [duoids:post-build] copying path '/nix/store/9kixpijfxf8qm50abrz6s64brrxrspc9-integer-logarithms-1.0.4.drv' to 'https://cache.nix-ci.com'...
  1200. 150.45 s [duoids:post-build] copying path '/nix/store/90019ccbxaznxnnp1klg5zsqh54l3h0s-tasty-hedgehog-1.4.0.2.drv' to 'https://cache.nix-ci.com'...
  1201. 150.54 s [duoids:post-build] copying path '/nix/store/4nrm9c2q3c6xz6gqb84k9zwgg743g494-scientific-0.3.8.0.drv' to 'https://cache.nix-ci.com'...
  1202. 150.83 s [duoids:post-build] copying path '/nix/store/rciq520jwdggffyawb4r914zjad0biiq-nothunks-0.3.0.0.drv' to 'https://cache.nix-ci.com'...
  1203. 151.06 s [duoids:post-build] copying path '/nix/store/bhxslgsgmps485zacdnndj7pjhjc4ibn-unordered-containers-0.2.20.drv' to 'https://cache.nix-ci.com'...
  1204. 151.29 s [duoids:post-build] copying path '/nix/store/s0sszjw1xbvqmgi72sg31kzxvislxx84-quickcheck-instances-0.3.32.drv' to 'https://cache.nix-ci.com'...
  1205. 151.51 s [duoids:post-build] copying path '/nix/store/xzfs0h0j8zkggfspplhlyx758lp4qh8n-extra-1.7.16.drv' to 'https://cache.nix-ci.com'...
  1206. 151.73 s [duoids:post-build] copying path '/nix/store/izss0krpvmwkmbg4c0sjf72s2wq289wg-filepattern-0.1.3.drv' to 'https://cache.nix-ci.com'...
  1207. 151.95 s [duoids:post-build] copying path '/nix/store/7xw4msq3kzf5ds8zmkjmwvlh6ily8i6i-shake-0.19.8.drv' to 'https://cache.nix-ci.com'...
  1208. 152.16 s [duoids:post-build] copying path '/nix/store/zynv2fa9wsfq81r3szsrkfg54hm844p0-hadrian-9.12.1.drv' to 'https://cache.nix-ci.com'...
  1209. 152.39 s [duoids:post-build] copying path '/nix/store/sc64ppp7rc2hrk70dcj2anjr4kibyj0w-ghc-9.12.1.drv' to 'https://cache.nix-ci.com'...
  1210. 152.60 s [duoids:post-build] copying path '/nix/store/771miwv4lchcb4piiwqff075r0jsm2xf-hscolour-1.25.drv' to 'https://cache.nix-ci.com'...
  1211. 152.81 s [duoids:post-build] copying path '/nix/store/0247ysgzprlbjcvazja6224wrx7px5b9-happy-lib-2.0.2.drv' to 'https://cache.nix-ci.com'...
  1212. 152.82 s [duoids:post-build] copying path '/nix/store/1v8fdc6rqsj5zllbvv5z51j6m5iyf25j-colour-2.3.6.drv' to 'https://cache.nix-ci.com'...
  1213. 152.82 s [duoids:post-build] copying path '/nix/store/54a1yhs0v4zifixkm3sblc6m3cqssqcm-tagged-0.8.9.drv' to 'https://cache.nix-ci.com'...
  1214. 152.84 s [duoids:post-build] copying path '/nix/store/awvcms600vzr9f5vhrk9bbvsxssn9ag7-haskell-lexer-1.1.2.drv' to 'https://cache.nix-ci.com'...
  1215. 152.86 s [duoids:post-build] copying path '/nix/store/zamldbb958v0xb6kxp4ij3frg2vmilpn-code-page-0.2.1.drv' to 'https://cache.nix-ci.com'...
  1216. 152.86 s [duoids:post-build] copying path '/nix/store/59wj8jpfvzpvxa21q9rmb7fhyla4v87s-call-stack-0.4.0.drv' to 'https://cache.nix-ci.com'...
  1217. 152.86 s [duoids:post-build] copying path '/nix/store/7rp4g9qxqgbjgvgyl6ap2lyz2ql5dq55-primitive-0.9.1.0.drv' to 'https://cache.nix-ci.com'...
  1218. 152.87 s [duoids:post-build] copying path '/nix/store/ab1161wa9bkyw0n69zlmik4962fij2as-nanospec-0.2.2.drv' to 'https://cache.nix-ci.com'...
  1219. 152.87 s [duoids:post-build] copying path '/nix/store/kqyicshir3ak1axik3w4gya66pwfp0k9-base-compat-0.13.1.drv' to 'https://cache.nix-ci.com'...
  1220. 152.88 s [duoids:post-build] copying path '/nix/store/mlcsrdx05kw5zli37qgq8bkd2bkjm4bk-prettyprinter-1.7.1.drv' to 'https://cache.nix-ci.com'...
  1221. 152.88 s [duoids:post-build] copying path '/nix/store/w7m9bym899pjixxmm495irkgqbcx21m0-splitmix-0.1.1.drv' to 'https://cache.nix-ci.com'...
  1222. 152.88 s [duoids:post-build] copying path '/nix/store/yydrxaq4bm058r130qv81vmrczd9d82h-transformers-compat-0.7.2.drv' to 'https://cache.nix-ci.com'...
  1223. 153.09 s [duoids:post-build] copying path '/nix/store/1r14avbx90v86bsn1wf8b36yigil8a9q-ansi-terminal-types-1.1.drv' to 'https://cache.nix-ci.com'...
  1224. 153.09 s [duoids:post-build] copying path '/nix/store/fkkc5bvbsr75nqmb6dy6ykzwk6d4wddi-happy-2.0.2.drv' to 'https://cache.nix-ci.com'...
  1225. 153.14 s [duoids:post-build] copying path '/nix/store/i3ghr1rvlmsj1p0jg8d471lwzij67a0a-logging-facade-0.3.1.drv' to 'https://cache.nix-ci.com'...
  1226. 153.15 s [duoids:post-build] copying path '/nix/store/n70qs4x7cmsj9rpps1ywbbpyqmh1ljb5-HUnit-1.6.2.0.drv' to 'https://cache.nix-ci.com'...
  1227. 153.15 s [duoids:post-build] copying path '/nix/store/7149w7an7cgxfrfanmd7fzx35f5mhlxb-random-1.2.1.3.drv' to 'https://cache.nix-ci.com'...
  1228. 153.31 s [duoids:post-build] copying path '/nix/store/b1l5qwxcdb60cx4xr50hhfkwrb8ww2f2-alex-3.5.3.0.drv' to 'https://cache.nix-ci.com'...
  1229. 153.32 s [duoids:post-build] copying path '/nix/store/5x0xqd1jmfwxkdlgsim22gx9bj4p1r0r-ansi-terminal-1.1.2.drv' to 'https://cache.nix-ci.com'...
  1230. 153.37 s [duoids:post-build] copying path '/nix/store/y16arcs4fm63j53sh96d8rqi4hd8szqb-hspec-expectations-0.8.4.drv' to 'https://cache.nix-ci.com'...
  1231. 153.39 s [duoids:post-build] copying path '/nix/store/15pl9xi7hy720kfhg1kprmghcisqn2yp-temporary-1.3.drv' to 'https://cache.nix-ci.com'...
  1232. 153.39 s [duoids:post-build] copying path '/nix/store/nq3c6dzqqk9g3hxjvpjaw70pb8va0n28-tf-random-0.5.drv' to 'https://cache.nix-ci.com'...
  1233. 153.39 s [duoids:post-build] copying path '/nix/store/gkwl17aj3qmlkzifrwmbxpdm5xr9plms-QuickCheck-2.14.3.drv' to 'https://cache.nix-ci.com'...
  1234. 153.52 s [duoids:post-build] copying path '/nix/store/ws8n6srmw0i81s3avw6xpqs717garp04-Cabal-syntax-3.12.1.0.drv' to 'https://cache.nix-ci.com'...
  1235. 153.61 s [duoids:post-build] copying path '/nix/store/rnp3xi1jvnn7jsrnk0ffmifzq5a1g91n-mockery-0.3.5.drv' to 'https://cache.nix-ci.com'...
  1236. 153.61 s [duoids:post-build] copying path '/nix/store/zzxkmdx02i4fpcv8xjf5lc8yfsg86kv8-silently-1.2.5.4.drv' to 'https://cache.nix-ci.com'...
  1237. 153.62 s [duoids:post-build] copying path '/nix/store/iv1cz0ly5v2a7q6k3zyq7ivdndydf0nk-quickcheck-io-0.2.0.drv' to 'https://cache.nix-ci.com'...
  1238. 153.70 s [duoids:post-build] copying path '/nix/store/vvzd4cqdgh4i0vlxg3h4awgvy1kj5aln-prettyprinter-ansi-terminal-1.1.3.drv' to 'https://cache.nix-ci.com'...
  1239. 153.74 s [duoids:post-build] copying path '/nix/store/648k03lxws60j75n9dnqfyjx2i8b0nb4-Cabal-3.12.1.0.drv' to 'https://cache.nix-ci.com'...
  1240. 153.84 s [duoids:post-build] copying path '/nix/store/59gd3nb6rk7jwrrnyqvpvdx6fmhpn54q-hspec-meta-2.11.12.drv' to 'https://cache.nix-ci.com'...
  1241. 153.84 s [duoids:post-build] copying path '/nix/store/qhiw5y3lfqkhp5ddj46zqiq3fvjf02z5-hspec-core-2.11.12.drv' to 'https://cache.nix-ci.com'...
  1242. 153.95 s [duoids:post-build] copying path '/nix/store/3f7mkxdrl2nx01jwkhfsl1xgym5s6pvz-optparse-applicative-0.18.1.0.drv' to 'https://cache.nix-ci.com'...
  1243. 153.98 s [duoids:post-build] copying path '/nix/store/ya15zp7xw2yi8vgj8sncb6cqm2wd0vc0-cabal-doctest-1.0.11.drv' to 'https://cache.nix-ci.com'...
  1244. 153.98 s [duoids:post-build] copying path '/nix/store/c5qlb0r546p4pw94kcg2iydwkprazzn6-ghc-paths-0.1.0.12.drv' to 'https://cache.nix-ci.com'...
  1245. 154.06 s [duoids:post-build] copying path '/nix/store/qik876gw9vbw5iqdfw69vaklh9dk02lh-hspec-discover-2.11.12.drv' to 'https://cache.nix-ci.com'...
  1246. 154.16 s [duoids:post-build] copying path '/nix/store/gjispdnbkha58gw2xwkl55l755m6gvz0-tasty-1.5.3.drv' to 'https://cache.nix-ci.com'...
  1247. 154.28 s [duoids:post-build] copying path '/nix/store/6hfmhnfxjpgi8kbm8s092qyghbx1c8f1-hspec-2.11.12.drv' to 'https://cache.nix-ci.com'...
  1248. 154.37 s [duoids:post-build] copying path '/nix/store/0mh9gk2hgzkfkl5f0kcp44p1pz18s3l5-tasty-hunit-0.10.2.drv' to 'https://cache.nix-ci.com'...
  1249. 154.49 s [duoids:post-build] copying path '/nix/store/05wxkcv2prrb5l3d09aq2ll41qpcawg0-stringbuilder-0.5.1.drv' to 'https://cache.nix-ci.com'...
  1250. 154.59 s [duoids:post-build] copying path '/nix/store/y3dqvlbcxzi9hp0mz1c49yfvq6xlhv7b-syb-0.7.2.4.drv' to 'https://cache.nix-ci.com'...
  1251. 154.80 s [duoids:post-build] copying path '/nix/store/lps0rgr2acli7dbixg13zh6cgdlsf5cx-doctest-0.24.0.drv' to 'https://cache.nix-ci.com'...
  1252. 155.19 s [duoids:post-build] copying path '/nix/store/6cgqvyx434ks6v16nzxwwis6g2bbj8fs-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  1253. 155.72 s Progress: 1 of 17 built (1 building), 145 of 145 downloaded from cache
  1254. 155.85 s Building /nix/store/rqdzxh3farxpw07vqqssw03s4a4vd195-duoidal-transformers-0.0.1.0.drv
  1255. 155.91 s Building /nix/store/jb0bqiagmp7dawxc6m5w76s5g6krj39y-duoids-hedgehog-0.0.1.0.drv
  1256. 155.91 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 )
  1257. 155.91 s [vector] src/Data/Vector/Mutable.hs:99:20: warning: [GHC-90584] [-Wderiving-typeable]
  1258. 155.91 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1259. 155.91 s [vector] • In the data declaration for ‘MVector’
  1260. 155.91 s [vector] |
  1261. 155.91 s [vector] 99 | deriving ( Typeable )
  1262. 155.91 s [vector] | ^^^^^^^^
  1263. 155.91 s [vector]
  1264. 155.91 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
  1265. 155.91 s [vector] src/Data/Vector.hs:222:20: warning: [GHC-90584] [-Wderiving-typeable]
  1266. 155.91 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1267. 155.91 s [vector] • In the data declaration for ‘Vector’
  1268. 155.91 s [vector] |
  1269. 155.91 s [vector] 222 | deriving ( Typeable )
  1270. 155.91 s [vector] | ^^^^^^^^
  1271. 155.91 s [vector]
  1272. 155.91 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 )
  1273. 155.91 s [vector] src/Data/Vector/Primitive/Mutable.hs:115:20: warning: [GHC-90584] [-Wderiving-typeable]
  1274. 155.91 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1275. 155.91 s [vector] • In the data declaration for ‘MVector’
  1276. 155.91 s [vector] |
  1277. 155.91 s [vector] 115 | deriving ( Typeable )
  1278. 155.91 s [vector] | ^^^^^^^^
  1279. 155.91 s [vector]
  1280. 155.91 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 )
  1281. 155.91 s [vector] src/Data/Vector/Primitive.hs:209:14: warning: [GHC-90584] [-Wderiving-typeable]
  1282. 155.91 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1283. 155.91 s [vector] • In the data declaration for ‘Vector’
  1284. 155.91 s [vector] |
  1285. 155.91 s [vector] 209 | deriving ( Typeable )
  1286. 155.91 s [vector] | ^^^^^^^^
  1287. 155.91 s [vector]
  1288. 155.91 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 )
  1289. 155.91 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 )
  1290. 155.91 s [vector] src/Data/Vector/Storable/Mutable.hs:134:20: warning: [GHC-90584] [-Wderiving-typeable]
  1291. 155.91 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1292. 155.91 s [vector] • In the data declaration for ‘MVector’
  1293. 155.91 s [vector] |
  1294. 155.91 s [vector] 134 | deriving ( Typeable )
  1295. 155.91 s [vector] | ^^^^^^^^
  1296. 155.91 s [vector]
  1297. 155.91 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 )
  1298. 155.91 s [vector] src/Data/Vector/Storable.hs:219:20: warning: [GHC-90584] [-Wderiving-typeable]
  1299. 155.91 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1300. 155.91 s [vector] • In the data declaration for ‘Vector’
  1301. 155.91 s [vector] |
  1302. 155.91 s [vector] 219 | deriving ( Typeable )
  1303. 155.91 s [vector] | ^^^^^^^^
  1304. 155.91 s [vector]
  1305. 155.91 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 )
  1306. 155.91 s [vector] src/Data/Vector/Strict/Mutable.hs:97:20: warning: [GHC-90584] [-Wderiving-typeable]
  1307. 155.91 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1308. 155.91 s [vector] • In the newtype declaration for ‘MVector’
  1309. 155.91 s [vector] |
  1310. 155.91 s [vector] 97 | deriving ( Typeable )
  1311. 155.91 s [vector] | ^^^^^^^^
  1312. 155.92 s [vector]
  1313. 155.92 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 )
  1314. 155.92 s [vector] src/Data/Vector/Strict.hs:221:13: warning: [GHC-90584] [-Wderiving-typeable]
  1315. 155.92 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1316. 155.92 s [vector] • In the newtype declaration for ‘Vector’
  1317. 155.92 s [vector] |
  1318. 155.92 s [vector] 221 | deriving (Typeable, Foldable.Foldable, Semigroup, Monoid)
  1319. 155.92 s [vector] | ^^^^^^^^
  1320. 155.92 s [vector]
  1321. 156.01 s [duoidal-transformers] Phase: setupCompilerEnvironmentPhase
  1322. 156.02 s [duoidal-transformers] Build with /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1.
  1323. 156.08 s [duoids-hedgehog] Phase: setupCompilerEnvironmentPhase
  1324. 156.16 s [duoids-hedgehog] Build with /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1.
  1325. 156.32 s [duoidal-transformers] Phase: unpackPhase
  1326. 156.34 s [duoidal-transformers] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./transformers
  1327. 156.34 s [duoidal-transformers] source root is transformers
  1328. 156.36 s [duoidal-transformers] Phase: patchPhase
  1329. 156.37 s [duoidal-transformers] Phase: compileBuildDriverPhase
  1330. 156.38 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 )
  1331. 156.38 s [duoidal-transformers] setupCompileFlags: -package-db=/build/tmp.CP6YNhE8j8/setup-package.conf.d -threaded
  1332. 156.53 s [duoidal-transformers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.CP6YNhE8j8/Main.o )
  1333. 156.63 s [duoids-hedgehog] Phase: unpackPhase
  1334. 156.64 s [duoidal-transformers] [2 of 2] Linking Setup
  1335. 156.65 s [duoids-hedgehog] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./hedgehog
  1336. 156.66 s [duoids-hedgehog] source root is hedgehog
  1337. 156.70 s [duoids-hedgehog] Phase: patchPhase
  1338. 156.72 s [duoids-hedgehog] Phase: compileBuildDriverPhase
  1339. 156.73 s [duoids-hedgehog] setupCompileFlags: -package-db=/build/tmp.afXT0AFxZJ/setup-package.conf.d -threaded
  1340. 156.85 s [vector] src/Data/Vector/Unboxed/Base.hs:97:1: warning: [GHC-90584] [-Wderiving-typeable]
  1341. 156.85 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1342. 156.85 s [vector] • In the stand-alone deriving instance for ‘Typeable Vector’
  1343. 156.85 s [vector] |
  1344. 156.85 s [vector] 97 | deriving instance Typeable Vector
  1345. 156.85 s [vector] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  1346. 156.85 s [vector]
  1347. 156.85 s [vector] src/Data/Vector/Unboxed/Base.hs:98:1: warning: [GHC-90584] [-Wderiving-typeable]
  1348. 156.85 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1349. 156.85 s [vector] • In the stand-alone deriving instance for ‘Typeable MVector’
  1350. 156.85 s [vector] |
  1351. 156.85 s [vector] 98 | deriving instance Typeable MVector
  1352. 156.85 s [vector] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  1353. 156.85 s [vector]
  1354. 156.85 s [duoids-hedgehog] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.afXT0AFxZJ/Main.o )
  1355. 156.94 s [duoids-hedgehog] [2 of 2] Linking Setup
  1356. 158.75 s [duoidal-transformers] Phase: updateAutotoolsGnuConfigScriptsPhase
  1357. 158.78 s [duoidal-transformers] Phase: configurePhase
  1358. 158.81 s [duoidal-transformers] configureFlags: --verbose --prefix=/nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/v8ysb0cpdhaqi4g98p0cadyq3cq0prg8-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.CP6YNhE8j8/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/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/lib
  1359. 158.88 s [duoidal-transformers] Using Parsec parser
  1360. 158.88 s [duoidal-transformers] Configuring duoidal-transformers-0.0.1.0...
  1361. 158.95 s [duoidal-transformers] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  1362. 158.95 s [duoidal-transformers] 'ghc' version < 9.12):
  1363. 158.95 s [duoidal-transformers] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc is version
  1364. 158.95 s [duoidal-transformers] 9.12.1
  1365. 158.95 s [duoids-hedgehog] Phase: updateAutotoolsGnuConfigScriptsPhase
  1366. 158.99 s [duoids-hedgehog] Phase: configurePhase
  1367. 159.01 s [duoids-hedgehog] configureFlags: --verbose --prefix=/nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/ai590ra6dzqkw1nnjams738r6v0bjcr2-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.afXT0AFxZJ/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/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/lib
  1368. 159.03 s [duoids-hedgehog] Using Parsec parser
  1369. 159.03 s [duoids-hedgehog] Configuring duoids-hedgehog-0.0.1.0...
  1370. 159.14 s [duoids-hedgehog] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  1371. 159.14 s [duoids-hedgehog] 'ghc' version < 9.12):
  1372. 159.14 s [duoids-hedgehog] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc is version
  1373. 159.14 s [duoids-hedgehog] 9.12.1
  1374. 159.53 s [duoidal-transformers] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  1375. 160.27 s [duoidal-transformers] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  1376. 160.27 s [duoidal-transformers] >=4.21.0 && <4.22: using base-4.21.0.0
  1377. 160.27 s [duoidal-transformers] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  1378. 160.27 s [duoidal-transformers] Dependency transformers >=0.6.1 && <0.7: using transformers-0.6.1.2
  1379. 160.27 s [duoidal-transformers] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  1380. 160.27 s [duoidal-transformers] >=4.21.0 && <4.22: using base-4.21.0.0
  1381. 160.27 s [duoidal-transformers] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  1382. 160.27 s [duoidal-transformers] <0.25: using doctest-0.24.0
  1383. 160.27 s [duoidal-transformers] Dependency duoidal-transformers: using duoidal-transformers-0.0.1.0
  1384. 160.27 s [duoidal-transformers] Source component graph:
  1385. 160.27 s [duoidal-transformers] component lib
  1386. 160.27 s [duoidal-transformers] component test:doctests dependency lib
  1387. 160.27 s [duoidal-transformers] Configured component graph:
  1388. 160.27 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-HpzXJQsPaRF2MOLVSE6Gjl
  1389. 160.27 s [duoidal-transformers] include base-4.21.0.0-f068
  1390. 160.27 s [duoidal-transformers] include duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  1391. 160.27 s [duoidal-transformers] include transformers-0.6.1.2-199f
  1392. 160.27 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-4urPVxG2RDKD4Qr2p22CeI-doctests
  1393. 160.27 s [duoidal-transformers] include base-4.21.0.0-f068
  1394. 160.27 s [duoidal-transformers] include doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
  1395. 160.27 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-HpzXJQsPaRF2MOLVSE6Gjl
  1396. 160.27 s [duoidal-transformers] Linked component graph:
  1397. 160.27 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-HpzXJQsPaRF2MOLVSE6Gjl
  1398. 160.27 s [duoidal-transformers] include base-4.21.0.0-f068
  1399. 160.27 s [duoidal-transformers] include duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  1400. 160.27 s [duoidal-transformers] include transformers-0.6.1.2-199f
  1401. 160.27 s [duoidal-transformers] Control.Duoidal.Trans.Class=duoidal-transformers-0.0.1.0-HpzXJQsPaRF2MOLVSE6Gjl:Control.Duoidal.Trans.Class,Control.Duoidal.Trans.Orphans=duoidal-transformers-0.0.1.0-HpzXJQsPaRF2MOLVSE6Gjl:Control.Duoidal.Trans.Orphans
  1402. 160.27 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-4urPVxG2RDKD4Qr2p22CeI-doctests
  1403. 160.27 s [duoidal-transformers] include base-4.21.0.0-f068
  1404. 160.27 s [duoidal-transformers] include doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
  1405. 160.27 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-HpzXJQsPaRF2MOLVSE6Gjl
  1406. 160.27 s [duoidal-transformers] Ready component graph:
  1407. 160.27 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-HpzXJQsPaRF2MOLVSE6Gjl
  1408. 160.27 s [duoidal-transformers] depends base-4.21.0.0-f068
  1409. 160.27 s [duoidal-transformers] depends duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  1410. 160.27 s [duoidal-transformers] depends transformers-0.6.1.2-199f
  1411. 160.27 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-4urPVxG2RDKD4Qr2p22CeI-doctests
  1412. 160.27 s [duoidal-transformers] depends base-4.21.0.0-f068
  1413. 160.27 s [duoidal-transformers] depends doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
  1414. 160.27 s [duoidal-transformers] depends duoidal-transformers-0.0.1.0-HpzXJQsPaRF2MOLVSE6Gjl
  1415. 160.27 s [duoidal-transformers] Using Cabal-3.14.1.0 compiled by ghc-9.12
  1416. 160.27 s [duoidal-transformers] Using compiler: ghc-9.12.1
  1417. 160.27 s [duoidal-transformers] Using install prefix:
  1418. 160.27 s [duoidal-transformers] /nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0
  1419. 160.27 s [duoidal-transformers] Executables installed in:
  1420. 160.27 s [duoidal-transformers] /nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0/bin
  1421. 160.27 s [duoidal-transformers] Libraries installed in:
  1422. 160.27 s [duoidal-transformers] /nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/duoidal-transformers-0.0.1.0-HpzXJQsPaRF2MOLVSE6Gjl
  1423. 160.27 s [duoidal-transformers] Dynamic Libraries installed in:
  1424. 160.27 s [duoidal-transformers] /nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
  1425. 160.27 s [duoidal-transformers] Private executables installed in:
  1426. 160.27 s [duoidal-transformers] /nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0/libexec/x86_64-linux-ghc-9.12.1-f739/duoidal-transformers-0.0.1.0
  1427. 160.27 s [duoidal-transformers] Data files installed in:
  1428. 160.27 s [duoidal-transformers] /nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0/share/x86_64-linux-ghc-9.12.1-f739/duoidal-transformers-0.0.1.0
  1429. 160.27 s [duoidal-transformers] Documentation installed in:
  1430. 160.27 s [duoidal-transformers] /nix/store/v8ysb0cpdhaqi4g98p0cadyq3cq0prg8-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0
  1431. 160.27 s [duoidal-transformers] Configuration files installed in:
  1432. 160.27 s [duoidal-transformers] /nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0/etc
  1433. 160.27 s [duoidal-transformers] No alex found
  1434. 160.27 s [duoidal-transformers] Using ar found on system at:
  1435. 160.27 s [duoidal-transformers] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  1436. 160.27 s [duoidal-transformers] No c2hs found
  1437. 160.27 s [duoidal-transformers] No cpphs found
  1438. 160.27 s [duoidal-transformers] Using doctest version 0.24.0 found on system at:
  1439. 160.27 s [duoidal-transformers] /nix/store/x1z9pyd8hb27z4bhy7lsj2npgsq740xd-doctest-0.24.0/bin/doctest
  1440. 160.27 s [duoidal-transformers] Using gcc version 14.3.0 given by user at:
  1441. 160.27 s [duoidal-transformers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  1442. 160.27 s [duoidal-transformers] Using ghc version 9.12.1 found on system at:
  1443. 160.27 s [duoidal-transformers] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc
  1444. 160.27 s [duoidal-transformers] Using ghc-pkg version 9.12.1 found on system at:
  1445. 160.27 s [duoidal-transformers] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc-pkg-9.12.1
  1446. 160.27 s [duoidal-transformers] No ghcjs found
  1447. 160.27 s [duoidal-transformers] No ghcjs-pkg found
  1448. 160.27 s [duoidal-transformers] No greencard found
  1449. 160.27 s [duoidal-transformers] Using haddock version 2.30.0 found on system at:
  1450. 160.27 s [duoidal-transformers] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/haddock-ghc-9.12.1
  1451. 160.27 s [duoidal-transformers] No happy found
  1452. 160.27 s [duoidal-transformers] No haskell-suite found
  1453. 160.27 s [duoidal-transformers] No haskell-suite-pkg found
  1454. 160.27 s [duoidal-transformers] No hmake found
  1455. 160.27 s [duoidal-transformers] Using hpc version 0.69 found on system at:
  1456. 160.27 s [duoidal-transformers] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hpc-ghc-9.12.1
  1457. 160.27 s [duoidal-transformers] Using hsc2hs version 0.68.10 found on system at:
  1458. 160.27 s [duoidal-transformers] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
  1459. 160.27 s [duoidal-transformers] Using hscolour version 1.25 found on system at:
  1460. 160.27 s [duoidal-transformers] /nix/store/q6qz2x3a08capyv98w52zizgxcnmv4hb-hscolour-1.25/bin/HsColour
  1461. 160.27 s [duoidal-transformers] No jhc found
  1462. 160.27 s [duoidal-transformers] Using ld found on system at:
  1463. 160.27 s [duoidal-transformers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  1464. 160.27 s [duoidal-transformers] No pkg-config found
  1465. 160.27 s [duoidal-transformers] Using runghc version 9.12.1 found on system at:
  1466. 160.27 s [duoidal-transformers] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/runghc-9.12.1
  1467. 160.27 s [duoidal-transformers] Using strip version 2.44 found on system at:
  1468. 160.27 s [duoidal-transformers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  1469. 160.27 s [duoidal-transformers] Using tar found on system at:
  1470. 160.27 s [duoidal-transformers] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  1471. 160.27 s [duoidal-transformers] No uhc found
  1472. 160.34 s [duoids-hedgehog] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  1473. 160.68 s [duoidal-transformers] Phase: buildPhase
  1474. 161.04 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  1475. 161.04 s [duoidal-transformers] Building library for duoidal-transformers-0.0.1.0...
  1476. 161.38 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 )
  1477. 161.62 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  1478. 161.62 s [duoids-hedgehog] >=4.21.0 && <4.22: using base-4.21.0.0
  1479. 161.62 s [duoids-hedgehog] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  1480. 161.62 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  1481. 161.62 s [duoids-hedgehog] hedgehog-1.5
  1482. 161.62 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  1483. 161.62 s [duoids-hedgehog] >=4.21.0 && <4.22: using base-4.21.0.0
  1484. 161.62 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  1485. 161.62 s [duoids-hedgehog] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  1486. 161.62 s [duoids-hedgehog] hedgehog-1.5
  1487. 161.62 s [duoids-hedgehog] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  1488. 161.62 s [duoids-hedgehog] >=4.21.0 && <4.22: using base-4.21.0.0
  1489. 161.62 s [duoids-hedgehog] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  1490. 161.62 s [duoids-hedgehog] <0.25: using doctest-0.24.0
  1491. 161.62 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  1492. 161.62 s [duoids-hedgehog] Source component graph:
  1493. 161.62 s [duoids-hedgehog] component lib
  1494. 161.62 s [duoids-hedgehog] component test:doctests dependency lib
  1495. 161.62 s [duoids-hedgehog] component test:laws dependency lib
  1496. 161.62 s [duoids-hedgehog] Configured component graph:
  1497. 161.62 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf
  1498. 161.62 s [duoids-hedgehog] include base-4.21.0.0-f068
  1499. 161.62 s [duoids-hedgehog] include duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  1500. 161.62 s [duoids-hedgehog] include hedgehog-1.5-LcsFpG0Er7ZGRzxTgWdRj1
  1501. 161.62 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-3897HzYOsWy9rjI4Nd53Em-doctests
  1502. 161.62 s [duoids-hedgehog] include base-4.21.0.0-f068
  1503. 161.62 s [duoids-hedgehog] include doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
  1504. 161.62 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf
  1505. 161.62 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-DgsiJQjE5dvLmpLz0GHPCP-laws
  1506. 161.62 s [duoids-hedgehog] include base-4.21.0.0-f068
  1507. 161.62 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf
  1508. 161.62 s [duoids-hedgehog] include hedgehog-1.5-LcsFpG0Er7ZGRzxTgWdRj1
  1509. 161.62 s [duoids-hedgehog] Linked component graph:
  1510. 161.62 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf
  1511. 161.62 s [duoids-hedgehog] include base-4.21.0.0-f068
  1512. 161.62 s [duoids-hedgehog] include duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  1513. 161.62 s [duoids-hedgehog] include hedgehog-1.5-LcsFpG0Er7ZGRzxTgWdRj1
  1514. 161.63 s [duoids-hedgehog] Test.Duoid=duoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf:Test.Duoid,Test.Duoidal=duoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf:Test.Duoidal
  1515. 161.63 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-3897HzYOsWy9rjI4Nd53Em-doctests
  1516. 161.63 s [duoids-hedgehog] include base-4.21.0.0-f068
  1517. 161.63 s [duoids-hedgehog] include doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
  1518. 161.63 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf
  1519. 161.63 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-DgsiJQjE5dvLmpLz0GHPCP-laws
  1520. 161.63 s [duoids-hedgehog] include base-4.21.0.0-f068
  1521. 161.63 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf
  1522. 161.63 s [duoids-hedgehog] include hedgehog-1.5-LcsFpG0Er7ZGRzxTgWdRj1
  1523. 161.63 s [duoids-hedgehog] Ready component graph:
  1524. 161.63 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf
  1525. 161.63 s [duoids-hedgehog] depends base-4.21.0.0-f068
  1526. 161.63 s [duoids-hedgehog] depends duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  1527. 161.63 s [duoids-hedgehog] depends hedgehog-1.5-LcsFpG0Er7ZGRzxTgWdRj1
  1528. 161.63 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-DgsiJQjE5dvLmpLz0GHPCP-laws
  1529. 161.63 s [duoids-hedgehog] depends base-4.21.0.0-f068
  1530. 161.63 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf
  1531. 161.63 s [duoids-hedgehog] depends hedgehog-1.5-LcsFpG0Er7ZGRzxTgWdRj1
  1532. 161.63 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-3897HzYOsWy9rjI4Nd53Em-doctests
  1533. 161.63 s [duoids-hedgehog] depends base-4.21.0.0-f068
  1534. 161.63 s [duoids-hedgehog] depends doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
  1535. 161.63 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf
  1536. 161.63 s [duoids-hedgehog] Using Cabal-3.14.1.0 compiled by ghc-9.12
  1537. 161.63 s [duoids-hedgehog] Using compiler: ghc-9.12.1
  1538. 161.63 s [duoids-hedgehog] Using install prefix:
  1539. 161.63 s [duoids-hedgehog] /nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0
  1540. 161.63 s [duoids-hedgehog] Executables installed in:
  1541. 161.63 s [duoids-hedgehog] /nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0/bin
  1542. 161.63 s [duoids-hedgehog] Libraries installed in:
  1543. 161.63 s [duoids-hedgehog] /nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/duoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf
  1544. 161.63 s [duoids-hedgehog] Dynamic Libraries installed in:
  1545. 161.63 s [duoids-hedgehog] /nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
  1546. 161.63 s [duoids-hedgehog] Private executables installed in:
  1547. 161.63 s [duoids-hedgehog] /nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0/libexec/x86_64-linux-ghc-9.12.1-f739/duoids-hedgehog-0.0.1.0
  1548. 161.63 s [duoids-hedgehog] Data files installed in:
  1549. 161.63 s [duoids-hedgehog] /nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0/share/x86_64-linux-ghc-9.12.1-f739/duoids-hedgehog-0.0.1.0
  1550. 161.63 s [duoids-hedgehog] Documentation installed in:
  1551. 161.63 s [duoids-hedgehog] /nix/store/ai590ra6dzqkw1nnjams738r6v0bjcr2-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0
  1552. 161.63 s [duoids-hedgehog] Configuration files installed in:
  1553. 161.63 s [duoids-hedgehog] /nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0/etc
  1554. 161.63 s [duoids-hedgehog] No alex found
  1555. 161.63 s [duoids-hedgehog] Using ar found on system at:
  1556. 161.63 s [duoids-hedgehog] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  1557. 161.63 s [duoids-hedgehog] No c2hs found
  1558. 161.63 s [duoids-hedgehog] No cpphs found
  1559. 161.63 s [duoids-hedgehog] Using doctest version 0.24.0 found on system at:
  1560. 161.63 s [duoids-hedgehog] /nix/store/x1z9pyd8hb27z4bhy7lsj2npgsq740xd-doctest-0.24.0/bin/doctest
  1561. 161.63 s [duoids-hedgehog] Using gcc version 14.3.0 given by user at:
  1562. 161.63 s [duoids-hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  1563. 161.63 s [duoids-hedgehog] Using ghc version 9.12.1 found on system at:
  1564. 161.63 s [duoids-hedgehog] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc
  1565. 161.63 s [duoids-hedgehog] Using ghc-pkg version 9.12.1 found on system at:
  1566. 161.63 s [duoids-hedgehog] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc-pkg-9.12.1
  1567. 161.63 s [duoids-hedgehog] No ghcjs found
  1568. 161.63 s [duoids-hedgehog] No ghcjs-pkg found
  1569. 161.63 s [duoids-hedgehog] No greencard found
  1570. 161.63 s [duoids-hedgehog] Using haddock version 2.30.0 found on system at:
  1571. 161.63 s [duoids-hedgehog] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/haddock-ghc-9.12.1
  1572. 161.63 s [duoids-hedgehog] No happy found
  1573. 161.63 s [duoids-hedgehog] No haskell-suite found
  1574. 161.63 s [duoids-hedgehog] No haskell-suite-pkg found
  1575. 161.63 s [duoids-hedgehog] No hmake found
  1576. 161.63 s [duoids-hedgehog] Using hpc version 0.69 found on system at:
  1577. 161.63 s [duoids-hedgehog] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hpc-ghc-9.12.1
  1578. 161.63 s [duoids-hedgehog] Using hsc2hs version 0.68.10 found on system at:
  1579. 161.63 s [duoids-hedgehog] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
  1580. 161.63 s [duoids-hedgehog] Using hscolour version 1.25 found on system at:
  1581. 161.63 s [duoids-hedgehog] /nix/store/q6qz2x3a08capyv98w52zizgxcnmv4hb-hscolour-1.25/bin/HsColour
  1582. 161.63 s [duoids-hedgehog] No jhc found
  1583. 161.63 s [duoids-hedgehog] Using ld found on system at:
  1584. 161.63 s [duoids-hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  1585. 161.63 s [duoids-hedgehog] No pkg-config found
  1586. 161.63 s [duoids-hedgehog] Using runghc version 9.12.1 found on system at:
  1587. 161.63 s [duoids-hedgehog] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/runghc-9.12.1
  1588. 161.63 s [duoids-hedgehog] Using strip version 2.44 found on system at:
  1589. 161.63 s [duoids-hedgehog] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  1590. 161.63 s [duoids-hedgehog] Using tar found on system at:
  1591. 161.63 s [duoids-hedgehog] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  1592. 161.63 s [duoids-hedgehog] No uhc found
  1593. 161.72 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 )
  1594. 162.23 s [duoids-hedgehog] Phase: buildPhase
  1595. 162.57 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  1596. 162.57 s [duoids-hedgehog] Building library for duoids-hedgehog-0.0.1.0...
  1597. 162.85 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 )
  1598. 162.91 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.o, dist/build/Test/Duoid.dyn_o )
  1599. 163.37 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 )
  1600. 164.08 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.o, dist/build/Test/Duoidal.dyn_o )
  1601. 165.04 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.p_o )
  1602. 165.33 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 )
  1603. 165.87 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.p_o )
  1604. 165.92 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  1605. 165.92 s [duoidal-transformers] Building test suite 'doctests' for duoidal-transformers-0.0.1.0...
  1606. 166.07 s [duoidal-transformers] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  1607. 166.45 s [duoidal-transformers] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  1608. 167.33 s [duoidal-transformers] [3 of 3] Linking dist/build/doctests/doctests
  1609. 168.60 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  1610. 168.60 s [duoids-hedgehog] Building test suite 'laws' for duoids-hedgehog-0.0.1.0...
  1611. 168.73 s [duoids-hedgehog] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  1612. 170.17 s [duoids-hedgehog] [2 of 2] Linking dist/build/laws/laws
  1613. 172.44 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  1614. 172.44 s [duoids-hedgehog] Building test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  1615. 172.54 s [duoids-hedgehog] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  1616. 173.08 s [duoids-hedgehog] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  1617. 173.68 s [duoids-hedgehog] [3 of 3] Linking dist/build/doctests/doctests
  1618. 173.72 s [duoidal-transformers] Phase: checkPhase
  1619. 174.36 s [duoidal-transformers] Running 1 test suites...
  1620. 174.36 s [duoidal-transformers] Test suite doctests: RUNNING...
  1621. 175.10 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  1622. 175.10 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1623. 175.10 s [duoidal-transformers]
  1624. 175.10 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  1625. 175.10 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1626. 175.10 s [duoidal-transformers]
  1627. 175.10 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  1628. 175.10 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1629. 175.10 s [duoidal-transformers]
  1630. 175.70 s [duoidal-transformers] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  1631. 175.78 s [duoidal-transformers] Test suite doctests: PASS
  1632. 175.78 s [duoidal-transformers] Test suite logged to: dist/test/duoidal-transformers-0.0.1.0-doctests.log
  1633. 175.78 s [duoidal-transformers] 1 of 1 test suites (1 of 1 test cases) passed.
  1634. 175.79 s [duoidal-transformers] Phase: haddockPhase
  1635. 176.76 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  1636. 176.76 s [duoidal-transformers] Running Haddock on library for duoidal-transformers-0.0.1.0...
  1637. 177.12 s [duoidal-transformers] [1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, nothing ) [HIE file is missing]
  1638. 177.15 s [duoidal-transformers] [2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, nothing ) [HIE file is missing]
  1639. 177.37 s [duoidal-transformers] Haddock coverage:
  1640. 177.55 s [duoidal-transformers] 33% ( 1 / 3) in 'Control.Duoidal.Trans.Class'
  1641. 177.55 s [duoidal-transformers] Missing documentation for:
  1642. 177.59 s [duoidal-transformers] DuoidalTrans (src/Control/Duoidal/Trans/Class.hs:18)
  1643. 177.59 s [duoidal-transformers] NormalTrans (src/Control/Duoidal/Trans/Class.hs:22)
  1644. 177.59 s [duoidal-transformers] 100% ( 1 / 1) in 'Control.Duoidal.Trans.Orphans'
  1645. 178.39 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 )
  1646. 179.85 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 )
  1647. 180.33 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
  1648. 180.42 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 )
  1649. 180.46 s [duoids-hedgehog] Phase: checkPhase
  1650. 181.23 s [duoids-hedgehog] Running 2 test suites...
  1651. 181.23 s [duoids-hedgehog] Test suite laws: RUNNING...
  1652. 181.24 s [duoids-hedgehog] ━━━ Duoid Int ━━━
  1653. 181.24 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1654. 181.24 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1655. 181.24 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1656. 181.24 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1657. 181.24 s [duoids-hedgehog] ✓ 4 succeeded.
  1658. 181.24 s [duoids-hedgehog] ━━━ Duoid Int16 ━━━
  1659. 181.24 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1660. 181.24 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1661. 181.24 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1662. 181.24 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1663. 181.24 s [duoids-hedgehog] ✓ 4 succeeded.
  1664. 181.24 s [duoids-hedgehog] ━━━ Duoid Int32 ━━━
  1665. 181.24 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1666. 181.24 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1667. 181.24 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1668. 181.24 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1669. 181.24 s [duoids-hedgehog] ✓ 4 succeeded.
  1670. 181.24 s [duoids-hedgehog] ━━━ Duoid Int64 ━━━
  1671. 181.25 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1672. 181.25 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1673. 181.25 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1674. 181.25 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1675. 181.25 s [duoids-hedgehog] ✓ 4 succeeded.
  1676. 181.25 s [duoids-hedgehog] ━━━ Duoid Int8 ━━━
  1677. 181.25 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1678. 181.25 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1679. 181.25 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1680. 181.25 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1681. 181.25 s [duoids-hedgehog] ✓ 4 succeeded.
  1682. 181.25 s [duoids-hedgehog] ━━━ Duoid.Normal Natural ━━━
  1683. 181.25 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1684. 181.25 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1685. 181.25 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1686. 181.25 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1687. 181.25 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1688. 181.25 s [duoids-hedgehog] ✓ 5 succeeded.
  1689. 181.25 s [duoids-hedgehog] ━━━ Duoid.Normal (Ratio Natural) ━━━
  1690. 181.25 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1691. 181.25 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1692. 181.25 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1693. 181.25 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1694. 181.25 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1695. 181.25 s [duoids-hedgehog] ✓ 5 succeeded.
  1696. 181.25 s [duoids-hedgehog] ━━━ Duoid (Ratio Integer) ━━━
  1697. 181.25 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1698. 181.26 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1699. 181.26 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1700. 181.26 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1701. 181.26 s [duoids-hedgehog] ✓ 4 succeeded.
  1702. 181.26 s [duoids-hedgehog] ━━━ Duoid.Normal Word ━━━
  1703. 181.26 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1704. 181.26 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1705. 181.26 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1706. 181.26 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1707. 181.26 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1708. 181.26 s [duoids-hedgehog] ✓ 5 succeeded.
  1709. 181.26 s [duoids-hedgehog] ━━━ Duoid.Normal Word16 ━━━
  1710. 181.26 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1711. 181.26 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1712. 181.26 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1713. 181.26 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1714. 181.26 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1715. 181.26 s [duoids-hedgehog] ✓ 5 succeeded.
  1716. 181.26 s [duoids-hedgehog] ━━━ Duoid.Normal Word32 ━━━
  1717. 181.26 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1718. 181.26 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1719. 181.26 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1720. 181.26 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1721. 181.26 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1722. 181.26 s [duoids-hedgehog] ✓ 5 succeeded.
  1723. 181.26 s [duoids-hedgehog] ━━━ Duoid.Normal Word64 ━━━
  1724. 181.26 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1725. 181.26 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1726. 181.26 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1727. 181.26 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1728. 181.26 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1729. 181.26 s [duoids-hedgehog] ✓ 5 succeeded.
  1730. 181.26 s [duoids-hedgehog] ━━━ Duoid.Normal Word8 ━━━
  1731. 181.27 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1732. 181.27 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1733. 181.27 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1734. 181.27 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1735. 181.27 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1736. 181.27 s [duoids-hedgehog] ✓ 5 succeeded.
  1737. 181.27 s [duoids-hedgehog] Test suite laws: PASS
  1738. 181.27 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-laws.log
  1739. 181.27 s [duoids-hedgehog] Test suite doctests: RUNNING...
  1740. 182.00 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 )
  1741. 182.00 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
  1742. 182.00 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
  1743. 182.08 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 )
  1744. 182.23 s [duoids-hedgehog] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  1745. 182.31 s [duoids-hedgehog] Test suite doctests: PASS
  1746. 182.31 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-doctests.log
  1747. 182.31 s [duoids-hedgehog] 2 of 2 test suites (2 of 2 test cases) passed.
  1748. 182.32 s [duoids-hedgehog] Phase: haddockPhase
  1749. 183.43 s [duoidal-transformers] Documentation created: dist/doc/html/duoidal-transformers,
  1750. 183.49 s [duoidal-transformers] dist/doc/html/duoidal-transformers/duoidal-transformers.txt
  1751. 183.55 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  1752. 183.55 s [duoids-hedgehog] Running Haddock on library for duoids-hedgehog-0.0.1.0...
  1753. 183.89 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, nothing ) [HIE file is missing]
  1754. 184.06 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  1755. 184.13 s [duoidal-transformers] Phase: installPhase
  1756. 184.15 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, nothing ) [HIE file is missing]
  1757. 184.20 s [duoidal-transformers] Installing library in /nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/duoidal-transformers-0.0.1.0-HpzXJQsPaRF2MOLVSE6Gjl
  1758. 184.24 s [duoids-hedgehog] Haddock coverage:
  1759. 184.52 s [duoidal-transformers] Phase: fixupPhase
  1760. 184.58 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0
  1761. 184.58 s [duoidal-transformers] shrinking /nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSduoidal-transformers-0.0.1.0-HpzXJQsPaRF2MOLVSE6Gjl-ghc9.12.1.so
  1762. 184.59 s [duoidal-transformers] checking for references to /build/ in /nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0...
  1763. 184.60 s [duoids-hedgehog] 33% ( 1 / 3) in 'Test.Duoid'
  1764. 184.60 s [duoids-hedgehog] Missing documentation for:
  1765. 184.60 s [duoids-hedgehog] validate (src/Test/Duoid.hs:72)
  1766. 184.60 s [duoids-hedgehog] validateNormal (src/Test/Duoid.hs:82)
  1767. 184.60 s [duoids-hedgehog] 50% ( 1 / 2) in 'Test.Duoidal'
  1768. 184.60 s [duoids-hedgehog] Missing documentation for:
  1769. 184.61 s [duoids-hedgehog] validate (src/Test/Duoidal.hs:98)
  1770. 184.61 s [duoidal-transformers] patching script interpreter paths in /nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0
  1771. 184.62 s [duoidal-transformers] stripping (with command strip and flags -S -p) in /nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0/lib
  1772. 184.70 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/v8ysb0cpdhaqi4g98p0cadyq3cq0prg8-duoidal-transformers-0.0.1.0-doc
  1773. 184.71 s [duoidal-transformers] checking for references to /build/ in /nix/store/v8ysb0cpdhaqi4g98p0cadyq3cq0prg8-duoidal-transformers-0.0.1.0-doc...
  1774. 184.72 s [duoidal-transformers] patching script interpreter paths in /nix/store/v8ysb0cpdhaqi4g98p0cadyq3cq0prg8-duoidal-transformers-0.0.1.0-doc
  1775. 184.95 s [duoidal-transformers:post-build] Uploading to cachix cache "sellout": /nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0 /nix/store/v8ysb0cpdhaqi4g98p0cadyq3cq0prg8-duoidal-transformers-0.0.1.0-doc
  1776. 186.16 s [duoidal-transformers:post-build] Pushing 2 paths (68 are already present) using zstd to cache sellout ⏳
  1777. 186.16 s [duoidal-transformers:post-build]
  1778. 186.53 s [duoidal-transformers:post-build] Pushing /nix/store/v8ysb0cpdhaqi4g98p0cadyq3cq0prg8-duoidal-transformers-0.0.1.0-doc (342.86 KiB)
  1779. 186.63 s [duoidal-transformers:post-build] Pushing /nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0 (643.92 KiB)
  1780. 187.72 s [duoidal-transformers:post-build]
  1781. 187.73 s [duoidal-transformers:post-build] All done.
  1782. 187.86 s [duoidal-transformers:post-build] Uploading to the NixCI cache: /nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0 /nix/store/v8ysb0cpdhaqi4g98p0cadyq3cq0prg8-duoidal-transformers-0.0.1.0-doc
  1783. 188.35 s [duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1784. 188.41 s [duoidal-transformers:post-build] copying 2 paths...
  1785. 188.41 s [duoidal-transformers:post-build] copying path '/nix/store/v8ysb0cpdhaqi4g98p0cadyq3cq0prg8-duoidal-transformers-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  1786. 188.86 s [duoidal-transformers:post-build] copying path '/nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0' to 'https://cache.nix-ci.com'...
  1787. 190.06 s [duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1788. 190.44 s [duoidal-transformers:post-build] copying 1 paths...
  1789. 190.44 s [duoidal-transformers:post-build] copying path '/nix/store/rqdzxh3farxpw07vqqssw03s4a4vd195-duoidal-transformers-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  1790. 190.92 s Progress: 2 of 16 built (2 building), 145 of 145 downloaded from cache
  1791. 190.92 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
  1792. 193.39 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
  1793. 193.63 s [duoids-hedgehog] Documentation created: dist/doc/html/duoids-hedgehog,
  1794. 193.63 s [duoids-hedgehog] dist/doc/html/duoids-hedgehog/duoids-hedgehog.txt
  1795. 194.57 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  1796. 195.34 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  1797. 195.43 s [duoids-hedgehog] Phase: installPhase
  1798. 195.55 s [duoids-hedgehog] Installing library in /nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/duoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf
  1799. 196.03 s [duoids-hedgehog] Phase: fixupPhase
  1800. 196.11 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0
  1801. 196.11 s [duoids-hedgehog] shrinking /nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSduoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf-ghc9.12.1.so
  1802. 196.12 s [duoids-hedgehog] checking for references to /build/ in /nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0...
  1803. 196.15 s [duoids-hedgehog] patching script interpreter paths in /nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0
  1804. 196.16 s [duoids-hedgehog] stripping (with command strip and flags -S -p) in /nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0/lib
  1805. 196.28 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/ai590ra6dzqkw1nnjams738r6v0bjcr2-duoids-hedgehog-0.0.1.0-doc
  1806. 196.29 s [duoids-hedgehog] checking for references to /build/ in /nix/store/ai590ra6dzqkw1nnjams738r6v0bjcr2-duoids-hedgehog-0.0.1.0-doc...
  1807. 196.30 s [duoids-hedgehog] patching script interpreter paths in /nix/store/ai590ra6dzqkw1nnjams738r6v0bjcr2-duoids-hedgehog-0.0.1.0-doc
  1808. 196.55 s [duoids-hedgehog:post-build] Uploading to cachix cache "sellout": /nix/store/ai590ra6dzqkw1nnjams738r6v0bjcr2-duoids-hedgehog-0.0.1.0-doc /nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0
  1809. 197.55 s [duoids-hedgehog:post-build] Pushing 2 paths (130 are already present) using zstd to cache sellout ⏳
  1810. 197.55 s [duoids-hedgehog:post-build]
  1811. 197.98 s [duoids-hedgehog:post-build] Pushing /nix/store/ai590ra6dzqkw1nnjams738r6v0bjcr2-duoids-hedgehog-0.0.1.0-doc (296.52 KiB)
  1812. 198.10 s [duoids-hedgehog:post-build] Pushing /nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0 (572.22 KiB)
  1813. 199.09 s [duoids-hedgehog:post-build]
  1814. 199.09 s [duoids-hedgehog:post-build] All done.
  1815. 199.22 s [duoids-hedgehog:post-build] Uploading to the NixCI cache: /nix/store/ai590ra6dzqkw1nnjams738r6v0bjcr2-duoids-hedgehog-0.0.1.0-doc /nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0
  1816. 199.43 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1817. 199.46 s [duoids-hedgehog:post-build] copying 64 paths...
  1818. 199.46 s [duoids-hedgehog:post-build] copying path '/nix/store/6l8mzlhl6zgp4wgv3i8gyv74w1rv1mja-haskell-lexer-1.1.2-doc' to 'https://cache.nix-ci.com'...
  1819. 199.46 s [duoids-hedgehog:post-build] copying path '/nix/store/7ah5c37059kqxgsxiym42arll61pdigf-unliftio-core-0.2.1.0-doc' to 'https://cache.nix-ci.com'...
  1820. 199.46 s [duoids-hedgehog:post-build] copying path '/nix/store/7vr2d6i0dvzydy5n1i08sb5746k2xa8g-hashable-1.4.7.0-doc' to 'https://cache.nix-ci.com'...
  1821. 199.46 s [duoids-hedgehog:post-build] copying path '/nix/store/anqv12zr9hbna09pdlhwr3ga5b0c5lkj-wl-pprint-annotated-0.1.0.1-doc' to 'https://cache.nix-ci.com'...
  1822. 199.46 s [duoids-hedgehog:post-build] copying path '/nix/store/bcpy1lw2c204adw3x40zfq7hdm5l4f2z-primitive-0.9.1.0-doc' to 'https://cache.nix-ci.com'...
  1823. 199.48 s [duoids-hedgehog:post-build] copying path '/nix/store/g1p3zsx0xccarkdbdg629774hzs9n6h6-terminal-size-0.3.4-doc' to 'https://cache.nix-ci.com'...
  1824. 199.48 s [duoids-hedgehog:post-build] copying path '/nix/store/gh52kjw9b9dsjjvzpzrrshdakb9md7mv-base-orphans-0.9.3-doc' to 'https://cache.nix-ci.com'...
  1825. 199.48 s [duoids-hedgehog:post-build] copying path '/nix/store/k6zcs4pzav7cnc7j83jghxmsqc5kv31n-transformers-base-0.4.6-doc' to 'https://cache.nix-ci.com'...
  1826. 199.48 s [duoids-hedgehog:post-build] copying path '/nix/store/mjqas1d34vv4lfa8hf91gsb9p5pp6345-safe-exceptions-0.1.7.4-doc' to 'https://cache.nix-ci.com'...
  1827. 199.48 s [duoids-hedgehog:post-build] copying path '/nix/store/ng219zjdmm473jf67vibzrpviibxw7lj-pretty-show-1.10-data' to 'https://cache.nix-ci.com'...
  1828. 199.48 s [duoids-hedgehog:post-build] copying path '/nix/store/pf578vggwc3b3w8mnfdx5rwcwld94bi5-mmorph-1.2.0-doc' to 'https://cache.nix-ci.com'...
  1829. 199.48 s [duoids-hedgehog:post-build] copying path '/nix/store/p3mxq8r1v7azilllrfqpr3skc5afbsfd-erf-2.0.0.0-doc' to 'https://cache.nix-ci.com'...
  1830. 199.48 s [duoids-hedgehog:post-build] copying path '/nix/store/pkxp6wnqj8mgghly3ba9vf2ca8s60vd0-transformers-compat-0.7.2-doc' to 'https://cache.nix-ci.com'...
  1831. 199.48 s [duoids-hedgehog:post-build] copying path '/nix/store/rivnmplwnpcyaa2vz1fy7nh05aw5f6gw-colour-2.3.6-data' to 'https://cache.nix-ci.com'...
  1832. 199.48 s [duoids-hedgehog:post-build] copying path '/nix/store/smf0aqqy20lv5bc6kwpagfdc6b9kd721-colour-2.3.6-doc' to 'https://cache.nix-ci.com'...
  1833. 199.48 s [duoids-hedgehog:post-build] copying path '/nix/store/xi7hq9mbb4avk4jzn2axnhybb0w3dczq-tagged-0.8.9-doc' to 'https://cache.nix-ci.com'...
  1834. 200.06 s [duoids-hedgehog:post-build] copying path '/nix/store/zxvhwsnwc9m27jwbd88l933qgj1fs2sc-splitmix-0.1.1-doc' to 'https://cache.nix-ci.com'...
  1835. 200.17 s [duoids-hedgehog:post-build] copying path '/nix/store/rls4z5f008c70lplfacjkgni293m3fgq-boring-0.2.2-doc' to 'https://cache.nix-ci.com'...
  1836. 200.21 s [duoids-hedgehog:post-build] copying path '/nix/store/xaw9bx3il5rk6l5cg6m9rhpq0z4syjs8-tagged-0.8.9' to 'https://cache.nix-ci.com'...
  1837. 200.22 s [duoids-hedgehog:post-build] copying path '/nix/store/6fm6badzwhkjw490cv3n54c1zxpy125j-base-orphans-0.9.3' to 'https://cache.nix-ci.com'...
  1838. 200.25 s [duoids-hedgehog:post-build] copying path '/nix/store/yrmwz15m8a4rx57pzxx0z59wl50d0lzx-distributive-0.6.2.1-doc' to 'https://cache.nix-ci.com'...
  1839. 200.26 s [duoids-hedgehog:post-build] copying path '/nix/store/9vk33g3cma3g74298czk1gmaimikw3x2-unliftio-core-0.2.1.0' to 'https://cache.nix-ci.com'...
  1840. 200.33 s [duoids-hedgehog:post-build] copying path '/nix/store/063gzs7k66x2i2np822dm0y10pk3h277-monad-control-1.0.3.1-doc' to 'https://cache.nix-ci.com'...
  1841. 200.35 s [duoids-hedgehog:post-build] copying path '/nix/store/5lgzvf6xhz3m5km2cna3hi3r2vpaqaz6-terminal-size-0.3.4' to 'https://cache.nix-ci.com'...
  1842. 200.39 s [duoids-hedgehog:post-build] copying path '/nix/store/vqvlw9p3sh64qbc5wmqciiqpsdcacw2z-safe-exceptions-0.1.7.4' to 'https://cache.nix-ci.com'...
  1843. 200.42 s [duoids-hedgehog:post-build] copying path '/nix/store/cwqwam6n53231bm299x6lmna5rjf1qjz-hashable-1.4.7.0' to 'https://cache.nix-ci.com'...
  1844. 200.59 s [duoids-hedgehog:post-build] copying path '/nix/store/kfm5xjx167paaagzindpgzyq9wb4f6gn-async-2.2.5-doc' to 'https://cache.nix-ci.com'...
  1845. 200.61 s [duoids-hedgehog:post-build] copying path '/nix/store/bnca7ki3sf219if16d403g91za6xbmb3-wl-pprint-annotated-0.1.0.1' to 'https://cache.nix-ci.com'...
  1846. 200.68 s [duoids-hedgehog:post-build] copying path '/nix/store/9wnbpi99m63l9sfn16qi3pqia7ambpn8-erf-2.0.0.0' to 'https://cache.nix-ci.com'...
  1847. 200.76 s [duoids-hedgehog:post-build] copying path '/nix/store/p3a6384q73r8xjwjw5hr28vr45di3fjc-constraints-0.14.2-doc' to 'https://cache.nix-ci.com'...
  1848. 200.77 s [duoids-hedgehog:post-build] copying path '/nix/store/j5xkkh0ypxhcnralnd0p06av8ib5vyf8-random-1.2.1.3-doc' to 'https://cache.nix-ci.com'...
  1849. 200.79 s [duoids-hedgehog:post-build] copying path '/nix/store/pdgkv5b35wwazg0rkiblywql74brrybn-splitmix-0.1.1' to 'https://cache.nix-ci.com'...
  1850. 200.89 s [duoids-hedgehog:post-build] copying path '/nix/store/by5bd8nz5syk580pqjyax2s72af941df-lifted-base-0.2.3.12-doc' to 'https://cache.nix-ci.com'...
  1851. 200.96 s [duoids-hedgehog:post-build] copying path '/nix/store/1bzzh814ank4w463vp6nis9hjcsmsv23-transformers-compat-0.7.2' to 'https://cache.nix-ci.com'...
  1852. 201.08 s [duoids-hedgehog:post-build] copying path '/nix/store/nnmgryrvb04hnki988pdw8ppprsinv7l-barbies-2.1.1.0-doc' to 'https://cache.nix-ci.com'...
  1853. 201.13 s [duoids-hedgehog:post-build] copying path '/nix/store/gy5jgvqr0fsl1s82kpr2q7jgp7jnczf5-colour-2.3.6' to 'https://cache.nix-ci.com'...
  1854. 201.13 s [duoids-hedgehog:post-build] copying path '/nix/store/s7f3q6rlr2lg5x9468y32iy0kavdl7pi-ansi-terminal-types-1.1-doc' to 'https://cache.nix-ci.com'...
  1855. 201.35 s [duoids-hedgehog:post-build] copying path '/nix/store/0h7l00ix0g1idvsxi9mvf27z05krln3r-boring-0.2.2' to 'https://cache.nix-ci.com'...
  1856. 201.36 s [duoids-hedgehog:post-build] copying path '/nix/store/z3isz5mf07j2ipn8i8lpb1lzxagvarf9-distributive-0.6.2.1' to 'https://cache.nix-ci.com'...
  1857. 201.49 s [duoids-hedgehog:post-build] copying path '/nix/store/03sh7669ly7mp0khschnkxz994awr2hl-haskell-lexer-1.1.2' to 'https://cache.nix-ci.com'...
  1858. 201.49 s [duoids-hedgehog:post-build] copying path '/nix/store/b0r0wrbs0l0mcr3ily3k9b7rmawqxbgf-pretty-show-1.10-doc' to 'https://cache.nix-ci.com'...
  1859. 201.51 s [duoids-hedgehog:post-build] copying path '/nix/store/89aw368ph4h2hwn3iprj7f0nb0ii57h9-ansi-terminal-1.1.2-doc' to 'https://cache.nix-ci.com'...
  1860. 201.64 s [duoids-hedgehog:post-build] copying path '/nix/store/2c6rybf8m8jrly84dzbyhv9xxzc81pzs-random-1.2.1.3' to 'https://cache.nix-ci.com'...
  1861. 201.75 s [duoids-hedgehog:post-build] copying path '/nix/store/nz98l6467qac3f3l1jdcf3gmwjc659d3-primitive-0.9.1.0' to 'https://cache.nix-ci.com'...
  1862. 201.75 s [duoids-hedgehog:post-build] copying path '/nix/store/wy0fmncpg8ypdjdfgbr5d0g40nvkjbl5-resourcet-1.3.0-doc' to 'https://cache.nix-ci.com'...
  1863. 201.81 s [duoids-hedgehog:post-build] copying path '/nix/store/n7hy7k1hk02gi61yminfif10m6ngi1vf-lifted-async-0.10.2.7-doc' to 'https://cache.nix-ci.com'...
  1864. 201.95 s [duoids-hedgehog:post-build] copying path '/nix/store/9zr6gz085w4w9lan59cnprmglxv9r5p7-concurrent-output-1.10.21-doc' to 'https://cache.nix-ci.com'...
  1865. 202.42 s [duoids-hedgehog:post-build] copying path '/nix/store/i7lyljfdjjbs28kf5lglymhqpzra03v4-async-2.2.5' to 'https://cache.nix-ci.com'...
  1866. 202.43 s [duoids-hedgehog:post-build] copying path '/nix/store/yl6jjm3jvhmgh228fwm119amj2pvywgl-constraints-0.14.2' to 'https://cache.nix-ci.com'...
  1867. 202.86 s [duoids-hedgehog:post-build] copying path '/nix/store/ybmpwvkpckiqyia3j9451j8bsm8an2s8-barbies-2.1.1.0' to 'https://cache.nix-ci.com'...
  1868. 202.87 s [duoids-hedgehog:post-build] copying path '/nix/store/n5bvgmddj1a1vcq81s32i7ccbhx07qb9-mmorph-1.2.0' to 'https://cache.nix-ci.com'...
  1869. 202.87 s [duoids-hedgehog:post-build] copying path '/nix/store/llbvsa4qwzkpdf064fkxckdymixlssa0-transformers-base-0.4.6' to 'https://cache.nix-ci.com'...
  1870. 202.93 s [duoids-hedgehog:post-build] copying path '/nix/store/lsv09qr3kfxykpmmv0ayxzgbw17japzd-hedgehog-1.5-doc' to 'https://cache.nix-ci.com'...
  1871. 203.62 s [duoids-hedgehog:post-build] copying path '/nix/store/ad47csx7c715qbn695fklkmlm60qs2ii-monad-control-1.0.3.1' to 'https://cache.nix-ci.com'...
  1872. 203.88 s [duoids-hedgehog:post-build] copying path '/nix/store/4ddn0biwyk9v185vyl40030qszsja32p-ansi-terminal-types-1.1' to 'https://cache.nix-ci.com'...
  1873. 204.10 s [duoids-hedgehog:post-build] copying path '/nix/store/x7azizjy4c52ijqkjcg21bzf9kd2cmrd-lifted-base-0.2.3.12' to 'https://cache.nix-ci.com'...
  1874. 204.80 s [duoids-hedgehog:post-build] copying path '/nix/store/qsv9n4s59sa83q6va9k9jv5k8dmw0p92-ansi-terminal-1.1.2' to 'https://cache.nix-ci.com'...
  1875. 205.07 s [duoids-hedgehog:post-build] copying path '/nix/store/cf2n41y0xbrif1db9a6k14jplixlj6d0-lifted-async-0.10.2.7' to 'https://cache.nix-ci.com'...
  1876. 205.45 s [duoids-hedgehog:post-build] copying path '/nix/store/r9g9yx0pf4sb0bhg2bgxywlxi2gp7l88-concurrent-output-1.10.21' to 'https://cache.nix-ci.com'...
  1877. 205.61 s [duoids-hedgehog:post-build] copying path '/nix/store/ai590ra6dzqkw1nnjams738r6v0bjcr2-duoids-hedgehog-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  1878. 205.69 s [duoids-hedgehog:post-build] copying path '/nix/store/346qzqng2wkldyma6igal0i8w3clp0mw-resourcet-1.3.0' to 'https://cache.nix-ci.com'...
  1879. 207.63 s [duoids-hedgehog:post-build] copying path '/nix/store/v3hgabkm1a7jvnn4ys4kvqwklwflnqis-pretty-show-1.10' to 'https://cache.nix-ci.com'...
  1880. 210.05 s [duoids-hedgehog:post-build] copying path '/nix/store/3rg1ihmrm8ka1zzq6vfqw94rg8gg8is3-hedgehog-1.5' to 'https://cache.nix-ci.com'...
  1881. 219.43 s [duoids-hedgehog:post-build] copying path '/nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0' to 'https://cache.nix-ci.com'...
  1882. 219.93 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1883. 220.34 s [duoids-hedgehog:post-build] copying 38 paths...
  1884. 220.34 s [duoids-hedgehog:post-build] copying path '/nix/store/4n3baz6s98f3wam2na58w4h88698kibs-jailbreak-cabal-1.4.1.drv' to 'https://cache.nix-ci.com'...
  1885. 220.34 s [duoids-hedgehog:post-build] copying path '/nix/store/brsqfsg4lf1yf4aa0xq8w58yb2596krd-old-locale-1.0.0.7.drv' to 'https://cache.nix-ci.com'...
  1886. 220.34 s [duoids-hedgehog:post-build] copying path '/nix/store/2dx4cn1qg379f9md8c16l9a6gk4q0ib7-xml-1.3.14.drv' to 'https://cache.nix-ci.com'...
  1887. 220.34 s [duoids-hedgehog:post-build] copying path '/nix/store/66h9v79civmx7mdynqkngdb59djslsh7-regex-base-0.94.0.3.drv' to 'https://cache.nix-ci.com'...
  1888. 220.34 s [duoids-hedgehog:post-build] copying path '/nix/store/2vgf6ssgdsl4h8dlca2b8xr6jq1wg1dr-boring-0.2.2.drv' to 'https://cache.nix-ci.com'...
  1889. 220.34 s [duoids-hedgehog:post-build] copying path '/nix/store/pjiksx3v8zv3f6p8ixy88g8hv23821pp-wl-pprint-annotated-0.1.0.1.drv' to 'https://cache.nix-ci.com'...
  1890. 220.34 s [duoids-hedgehog:post-build] copying path '/nix/store/nx4s85rcw2p3mjlks7dcz2r2j6hfi9z5-void-0.7.3.drv' to 'https://cache.nix-ci.com'...
  1891. 220.34 s [duoids-hedgehog:post-build] copying path '/nix/store/dpz134sff9xg082ba5a2cknkqjd7vfld-pretty-show-1.10.drv' to 'https://cache.nix-ci.com'...
  1892. 220.35 s [duoids-hedgehog:post-build] copying path '/nix/store/gf649k9gx4lbdh4i6zd2r85x6wf9akii-mmorph-1.2.0.drv' to 'https://cache.nix-ci.com'...
  1893. 220.35 s [duoids-hedgehog:post-build] copying path '/nix/store/hvy798vqinq7j52nvc5hm039lkkpr745-th-abstraction-0.7.1.0.drv' to 'https://cache.nix-ci.com'...
  1894. 220.37 s [duoids-hedgehog:post-build] copying path '/nix/store/izcscm4pag94kj7aq7n6mmksbzp932cp-terminal-size-0.3.4.drv' to 'https://cache.nix-ci.com'...
  1895. 220.37 s [duoids-hedgehog:post-build] copying path '/nix/store/jmsy1mha2afinbrwqmss5chxylmbhhkp-extensible-exceptions-0.1.1.4.drv' to 'https://cache.nix-ci.com'...
  1896. 220.38 s [duoids-hedgehog:post-build] copying path '/nix/store/lp8piyaqzg0zjsjjwbg1g01vfslsyi0f-erf-2.0.0.0.drv' to 'https://cache.nix-ci.com'...
  1897. 220.38 s [duoids-hedgehog:post-build] copying path '/nix/store/pmwjqfvd22mm7pamc7jx1h8j5kzvckji-unliftio-core-0.2.1.0.drv' to 'https://cache.nix-ci.com'...
  1898. 220.41 s [duoids-hedgehog:post-build] copying path '/nix/store/9afvwnxz8500ar4d27jj36bysqvpb9sp-hostname-1.0.drv' to 'https://cache.nix-ci.com'...
  1899. 220.44 s [duoids-hedgehog:post-build] copying path '/nix/store/apflqimysj24p2q1psx2i70vs0jzya2c-base-orphans-0.9.3.drv' to 'https://cache.nix-ci.com'...
  1900. 220.65 s [duoids-hedgehog:post-build] copying path '/nix/store/q0fhvfyxgszaa7kgkcza098kzm2ngn6q-pcre-light-0.4.1.3.drv' to 'https://cache.nix-ci.com'...
  1901. 220.68 s [duoids-hedgehog:post-build] copying path '/nix/store/xn38jndi37assb558a28xba1r7csm10g-prettyprinter-compat-ansi-wl-pprint-1.0.2.drv' to 'https://cache.nix-ci.com'...
  1902. 220.69 s [duoids-hedgehog:post-build] copying path '/nix/store/b0x76p8qha1k0ak4xj4h53cwzhqnsday-resourcet-1.3.0.drv' to 'https://cache.nix-ci.com'...
  1903. 220.71 s [duoids-hedgehog:post-build] copying path '/nix/store/y9p589ww357bpcp3l987y3bmnybvlmjx-regex-posix-0.96.0.2.drv' to 'https://cache.nix-ci.com'...
  1904. 220.73 s [duoids-hedgehog:post-build] copying path '/nix/store/wdvi53blyz53d3sdlmgz4qmcsy99z7rb-generic-deriving-1.14.6.drv' to 'https://cache.nix-ci.com'...
  1905. 220.73 s [duoids-hedgehog:post-build] copying path '/nix/store/8vdfxkzvqrhaxhzqvlqkbrdkybkbva8j-safe-exceptions-0.1.7.4.drv' to 'https://cache.nix-ci.com'...
  1906. 220.77 s [duoids-hedgehog:post-build] copying path '/nix/store/xwj2rlm627x9y5cv13q3fj4wxi6zm1c5-transformers-base-0.4.6.drv' to 'https://cache.nix-ci.com'...
  1907. 220.88 s [duoids-hedgehog:post-build] copying path '/nix/store/3yv5ynjihv1kd7qzxk92vawn5d8i7shf-tasty-quickcheck-0.11.drv' to 'https://cache.nix-ci.com'...
  1908. 220.92 s [duoids-hedgehog:post-build] copying path '/nix/store/p81wh39rpw9v227hf940856fc9jra1zq-ansi-wl-pprint-1.0.2.drv' to 'https://cache.nix-ci.com'...
  1909. 220.97 s [duoids-hedgehog:post-build] copying path '/nix/store/3xlwqlnzmlbjyavk124gzn6d29ni45w0-distributive-0.6.2.1.drv' to 'https://cache.nix-ci.com'...
  1910. 220.99 s [duoids-hedgehog:post-build] copying path '/nix/store/m2h38w2a6sc8lacx8lr4b99shkbr9r75-monad-control-1.0.3.1.drv' to 'https://cache.nix-ci.com'...
  1911. 221.09 s [duoids-hedgehog:post-build] copying path '/nix/store/ws4llxyccbf4r1iby82frnhpf85d1wwv-hashable-1.4.7.0.drv' to 'https://cache.nix-ci.com'...
  1912. 221.13 s [duoids-hedgehog:post-build] copying path '/nix/store/c81z2j17bcrmpkd44hbkn08dh9xcrvi8-test-framework-0.8.2.2.drv' to 'https://cache.nix-ci.com'...
  1913. 221.20 s [duoids-hedgehog:post-build] copying path '/nix/store/samzprnw24385rdqin3dsv2rzl5fv07f-barbies-2.1.1.0.drv' to 'https://cache.nix-ci.com'...
  1914. 221.32 s [duoids-hedgehog:post-build] copying path '/nix/store/v2a9s6v18dm92m9hh4hn8rvzv3zb1bxb-constraints-0.14.2.drv' to 'https://cache.nix-ci.com'...
  1915. 221.35 s [duoids-hedgehog:post-build] copying path '/nix/store/8wdjwh5wmm33lk9rfy1gz3pxn0mhp6fx-test-framework-hunit-0.3.0.2.drv' to 'https://cache.nix-ci.com'...
  1916. 221.56 s [duoids-hedgehog:post-build] copying path '/nix/store/z2k44c6q968kc5kfj4flj0nvhn736akk-async-2.2.5.drv' to 'https://cache.nix-ci.com'...
  1917. 221.57 s [duoids-hedgehog:post-build] copying path '/nix/store/c9zq0rncxpsmvg5j4i44j90lnjqqny7q-lifted-base-0.2.3.12.drv' to 'https://cache.nix-ci.com'...
  1918. 221.80 s [duoids-hedgehog:post-build] copying path '/nix/store/rlngnkkhxw2k5gnwq9vql3p8m24zdy7a-lifted-async-0.10.2.7.drv' to 'https://cache.nix-ci.com'...
  1919. 221.80 s [duoids-hedgehog:post-build] copying path '/nix/store/14qfnr1d72wqh47csfhsipdbv2jqciw6-concurrent-output-1.10.21.drv' to 'https://cache.nix-ci.com'...
  1920. 222.02 s [duoids-hedgehog:post-build] copying path '/nix/store/yn31ga1w5zqb6z02ypxxlj0p2m17glsk-hedgehog-1.5.drv' to 'https://cache.nix-ci.com'...
  1921. 222.23 s [duoids-hedgehog:post-build] copying path '/nix/store/jb0bqiagmp7dawxc6m5w76s5g6krj39y-duoids-hedgehog-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  1922. 222.52 s Progress: 3 of 15 built (1 building), 145 of 145 downloaded from cache
  1923. 222.52 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
  1924. 222.52 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
  1925. 222.52 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
  1926. 222.52 s [vector] src/Data/Vector/Mutable.hs:99:20: warning: [GHC-90584] [-Wderiving-typeable]
  1927. 222.52 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1928. 222.52 s [vector] • In the data declaration for ‘MVector’
  1929. 222.52 s [vector] |
  1930. 222.52 s [vector] 99 | deriving ( Typeable )
  1931. 222.52 s [vector] | ^^^^^^^^
  1932. 222.52 s [vector]
  1933. 222.52 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
  1934. 222.52 s [vector] src/Data/Vector.hs:222:20: warning: [GHC-90584] [-Wderiving-typeable]
  1935. 222.52 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1936. 222.52 s [vector] • In the data declaration for ‘Vector’
  1937. 222.52 s [vector] |
  1938. 222.52 s [vector] 222 | deriving ( Typeable )
  1939. 222.52 s [vector] | ^^^^^^^^
  1940. 222.52 s [vector]
  1941. 222.52 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
  1942. 222.52 s [vector] src/Data/Vector/Primitive/Mutable.hs:115:20: warning: [GHC-90584] [-Wderiving-typeable]
  1943. 222.52 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1944. 222.52 s [vector] • In the data declaration for ‘MVector’
  1945. 222.52 s [vector] |
  1946. 222.52 s [vector] 115 | deriving ( Typeable )
  1947. 222.52 s [vector] | ^^^^^^^^
  1948. 222.52 s [vector]
  1949. 222.52 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
  1950. 222.52 s [vector] src/Data/Vector/Primitive.hs:209:14: warning: [GHC-90584] [-Wderiving-typeable]
  1951. 222.52 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1952. 222.52 s [vector] • In the data declaration for ‘Vector’
  1953. 222.52 s [vector] |
  1954. 222.52 s [vector] 209 | deriving ( Typeable )
  1955. 222.52 s [vector] | ^^^^^^^^
  1956. 222.52 s [vector]
  1957. 222.52 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
  1958. 222.52 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
  1959. 222.52 s [vector] src/Data/Vector/Storable/Mutable.hs:134:20: warning: [GHC-90584] [-Wderiving-typeable]
  1960. 222.52 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1961. 222.52 s [vector] • In the data declaration for ‘MVector’
  1962. 222.52 s [vector] |
  1963. 222.52 s [vector] 134 | deriving ( Typeable )
  1964. 222.52 s [vector] | ^^^^^^^^
  1965. 222.52 s [vector]
  1966. 222.52 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
  1967. 222.52 s [vector] src/Data/Vector/Storable.hs:219:20: warning: [GHC-90584] [-Wderiving-typeable]
  1968. 222.52 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1969. 222.52 s [vector] • In the data declaration for ‘Vector’
  1970. 222.52 s [vector] |
  1971. 222.52 s [vector] 219 | deriving ( Typeable )
  1972. 222.52 s [vector] | ^^^^^^^^
  1973. 222.52 s [vector]
  1974. 222.52 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
  1975. 222.52 s [vector] src/Data/Vector/Strict/Mutable.hs:97:20: warning: [GHC-90584] [-Wderiving-typeable]
  1976. 222.52 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1977. 222.52 s [vector] • In the newtype declaration for ‘MVector’
  1978. 222.52 s [vector] |
  1979. 222.52 s [vector] 97 | deriving ( Typeable )
  1980. 222.52 s [vector] | ^^^^^^^^
  1981. 222.52 s [vector]
  1982. 222.52 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
  1983. 222.52 s [vector] src/Data/Vector/Strict.hs:221:13: warning: [GHC-90584] [-Wderiving-typeable]
  1984. 222.52 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1985. 222.52 s [vector] • In the newtype declaration for ‘Vector’
  1986. 222.52 s [vector] |
  1987. 222.52 s [vector] 221 | deriving (Typeable, Foldable.Foldable, Semigroup, Monoid)
  1988. 222.52 s [vector] | ^^^^^^^^
  1989. 222.52 s [vector]
  1990. 223.28 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
  1991. 223.61 s [vector] src/Data/Vector/Unboxed/Base.hs:97:1: warning: [GHC-90584] [-Wderiving-typeable]
  1992. 223.61 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1993. 223.61 s [vector] • In the stand-alone deriving instance for ‘Typeable Vector’
  1994. 223.61 s [vector] |
  1995. 223.61 s [vector] 97 | deriving instance Typeable Vector
  1996. 223.61 s [vector] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  1997. 223.61 s [vector]
  1998. 223.61 s [vector] src/Data/Vector/Unboxed/Base.hs:98:1: warning: [GHC-90584] [-Wderiving-typeable]
  1999. 223.61 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  2000. 223.61 s [vector] • In the stand-alone deriving instance for ‘Typeable MVector’
  2001. 223.61 s [vector] |
  2002. 223.61 s [vector] 98 | deriving instance Typeable MVector
  2003. 223.61 s [vector] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  2004. 223.61 s [vector]
  2005. 229.11 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
  2006. 236.36 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
  2007. 237.60 s [vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0...
  2008. 237.60 s [vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0...
  2009. 237.70 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 )
  2010. 237.87 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 )
  2011. 245.02 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 )
  2012. 245.08 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  2013. 245.09 s [vector] In the use of ‘tail’
  2014. 245.09 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2015. 245.09 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2016. 245.09 s [vector] |
  2017. 245.09 s [vector] 244 | postscanl f z = tail . scanl f z
  2018. 245.09 s [vector] | ^^^^
  2019. 245.09 s [vector]
  2020. 245.09 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  2021. 245.09 s [vector] In the use of ‘tail’
  2022. 245.09 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2023. 245.09 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2024. 245.09 s [vector] |
  2025. 245.09 s [vector] 245 | prescanr f z = tail . scanr f z
  2026. 245.09 s [vector] | ^^^^
  2027. 245.09 s [vector]
  2028. 245.09 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 )
  2029. 245.09 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  2030. 245.09 s [vector] In the use of ‘head’
  2031. 245.09 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2032. 245.09 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2033. 245.09 s [vector] |
  2034. 245.09 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  2035. 245.09 s [vector] | ^^^^
  2036. 245.09 s [vector]
  2037. 245.09 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  2038. 245.09 s [vector] In the use of ‘head’
  2039. 245.09 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2040. 245.09 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2041. 245.09 s [vector] |
  2042. 245.09 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  2043. 245.09 s [vector] | ^^^^
  2044. 245.09 s [vector]
  2045. 245.09 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  2046. 245.09 s [vector] In the use of ‘tail’
  2047. 245.09 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2048. 245.09 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2049. 245.09 s [vector] |
  2050. 245.09 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  2051. 245.09 s [vector] | ^^^^
  2052. 245.09 s [vector]
  2053. 245.09 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  2054. 245.09 s [vector] In the use of ‘head’
  2055. 245.09 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2056. 245.09 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2057. 245.09 s [vector] |
  2058. 245.09 s [vector] 439 | = V.uniq `eq` (map head . group)
  2059. 245.09 s [vector] | ^^^^
  2060. 245.09 s [vector]
  2061. 254.28 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 )
  2062. 274.88 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 )
  2063. 274.91 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 )
  2064. 274.91 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 )
  2065. 274.91 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 )
  2066. 274.91 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 )
  2067. 274.91 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 )
  2068. 274.91 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  2069. 274.91 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  2070. 274.91 s [vector] |
  2071. 274.91 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  2072. 274.91 s [vector] | ^^^^^^
  2073. 274.91 s [vector]
  2074. 274.91 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  2075. 274.91 s [vector] In the use of ‘head’
  2076. 274.91 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2077. 274.91 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2078. 274.91 s [vector] |
  2079. 274.91 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  2080. 274.92 s [vector] | ^^^^
  2081. 274.92 s [vector]
  2082. 274.92 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  2083. 274.92 s [vector] In the use of ‘tail’
  2084. 274.92 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2085. 274.92 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2086. 274.92 s [vector] |
  2087. 274.92 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  2088. 274.92 s [vector] | ^^^^
  2089. 274.92 s [vector]
  2090. 274.92 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 )
  2091. 275.56 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  2092. 276.56 s [vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0...
  2093. 276.56 s [vector] Building test suite 'vector-inspection' for vector-0.13.2.0...
  2094. 276.72 s [vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
  2095. 277.44 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 )
  2096. 277.44 s [vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
  2097. 278.42 s [vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
  2098. 279.12 s [vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
  2099. 279.98 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0...
  2100. 279.98 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0...
  2101. 280.05 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 )
  2102. 281.30 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 )
  2103. 281.30 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 )
  2104. 281.48 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 )
  2105. 281.48 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 )
  2106. 281.48 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 )
  2107. 281.48 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 )
  2108. 281.48 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 )
  2109. 281.48 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 )
  2110. 281.48 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 )
  2111. 281.48 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 )
  2112. 281.48 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 )
  2113. 281.48 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 )
  2114. 281.48 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 )
  2115. 281.77 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 )
  2116. 283.56 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 )
  2117. 283.56 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 )
  2118. 283.66 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 )
  2119. 283.66 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 )
  2120. 283.66 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 )
  2121. 283.66 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 )
  2122. 283.66 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 )
  2123. 283.66 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 )
  2124. 283.66 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 )
  2125. 283.66 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 )
  2126. 283.66 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  2127. 283.66 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 )
  2128. 283.66 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 )
  2129. 284.96 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0...
  2130. 284.97 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0...
  2131. 285.06 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 )
  2132. 285.18 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 )
  2133. 286.35 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 )
  2134. 286.35 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  2135. 286.35 s [vector] In the use of ‘tail’
  2136. 286.35 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2137. 286.35 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2138. 286.35 s [vector] |
  2139. 286.35 s [vector] 244 | postscanl f z = tail . scanl f z
  2140. 286.35 s [vector] | ^^^^
  2141. 286.35 s [vector]
  2142. 286.35 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  2143. 286.35 s [vector] In the use of ‘tail’
  2144. 286.35 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2145. 286.35 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2146. 286.35 s [vector] |
  2147. 286.35 s [vector] 245 | prescanr f z = tail . scanr f z
  2148. 286.35 s [vector] | ^^^^
  2149. 286.35 s [vector]
  2150. 286.35 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 )
  2151. 286.35 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  2152. 286.35 s [vector] In the use of ‘head’
  2153. 286.35 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2154. 286.35 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2155. 286.35 s [vector] |
  2156. 286.35 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  2157. 286.35 s [vector] | ^^^^
  2158. 286.35 s [vector]
  2159. 286.35 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  2160. 286.35 s [vector] In the use of ‘head’
  2161. 286.35 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2162. 286.35 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2163. 286.35 s [vector] |
  2164. 286.35 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  2165. 286.35 s [vector] | ^^^^
  2166. 286.35 s [vector]
  2167. 286.35 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  2168. 286.35 s [vector] In the use of ‘tail’
  2169. 286.35 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2170. 286.35 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2171. 286.35 s [vector] |
  2172. 286.35 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  2173. 286.35 s [vector] | ^^^^
  2174. 286.35 s [vector]
  2175. 286.35 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  2176. 286.35 s [vector] In the use of ‘head’
  2177. 286.35 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  2178. 286.35 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2179. 286.35 s [vector] |
  2180. 286.35 s [vector] 439 | = V.uniq `eq` (map head . group)
  2181. 286.35 s [vector] | ^^^^
  2182. 286.35 s [vector]
  2183. 287.21 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 )
  2184. 287.33 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 )
  2185. 287.33 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 )
  2186. 287.33 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 )
  2187. 287.33 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 )
  2188. 287.33 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 )
  2189. 287.33 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 )
  2190. 287.33 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  2191. 287.33 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  2192. 287.33 s [vector] |
  2193. 287.33 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  2194. 287.33 s [vector] | ^^^^^^
  2195. 287.33 s [vector]
  2196. 287.33 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  2197. 287.33 s [vector] In the use of ‘head’
  2198. 287.33 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2199. 287.33 s [vector] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2200. 287.33 s [vector] |
  2201. 287.33 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  2202. 287.33 s [vector] | ^^^^
  2203. 287.33 s [vector]
  2204. 287.33 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  2205. 287.33 s [vector] In the use of ‘tail’
  2206. 287.33 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  2207. 287.33 s [vector] "This is a partial function, it throws an error on empty lists. Replace it with 'drop' 1, or use pattern matching or 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  2208. 287.33 s [vector] |
  2209. 287.33 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  2210. 287.33 s [vector] | ^^^^
  2211. 287.33 s [vector]
  2212. 287.33 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 )
  2213. 287.82 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  2214. 288.73 s [vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0...
  2215. 288.73 s [vector] Building test suite 'vector-doctest' for vector-0.13.2.0...
  2216. 288.79 s [vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
  2217. 289.13 s [vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
  2218. 292.73 s [vector] buildPhase completed in 3 minutes 14 seconds
  2219. 292.73 s [vector] Phase: checkPhase
  2220. 292.98 s [vector] Running 2 test suites...
  2221. 292.98 s [vector] Test suite vector-tests-O0: RUNNING...
  2222. 293.19 s [vector] toplevel
  2223. 293.19 s [vector] Data.Vector.Fusion.Bundle
  2224. 293.19 s [vector] fromList.toList == id: OK
  2225. 293.19 s [vector] +++ OK, passed 100 tests.
  2226. 293.19 s [vector] toList.fromList == id: OK
  2227. 293.19 s [vector] +++ OK, passed 100 tests.
  2228. 293.19 s [vector] eq: OK
  2229. 293.19 s [vector] +++ OK, passed 100 tests.
  2230. 293.19 s [vector] length: OK
  2231. 293.19 s [vector] +++ OK, passed 100 tests.
  2232. 293.19 s [vector] null: OK
  2233. 293.19 s [vector] +++ OK, passed 100 tests.
  2234. 293.19 s [vector] empty: OK
  2235. 293.19 s [vector] +++ OK, passed 1 test.
  2236. 293.19 s [vector] singleton: OK
  2237. 293.19 s [vector] +++ OK, passed 100 tests.
  2238. 293.19 s [vector] replicate: OK
  2239. 293.19 s [vector] +++ OK, passed 100 tests.
  2240. 293.19 s [vector] cons: OK
  2241. 293.19 s [vector] +++ OK, passed 100 tests.
  2242. 293.19 s [vector] snoc: OK
  2243. 293.19 s [vector] +++ OK, passed 100 tests.
  2244. 293.19 s [vector] append: OK
  2245. 293.19 s [vector] +++ OK, passed 100 tests.
  2246. 293.20 s [vector] head: OK
  2247. 293.20 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2248. 293.20 s [vector] last: OK
  2249. 293.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2250. 293.20 s [vector] index: OK
  2251. 293.21 s [vector] +++ OK, passed 100 tests; 23 discarded.
  2252. 293.22 s [vector] extract: OK
  2253. 293.22 s [vector] +++ OK, passed 100 tests.
  2254. 293.22 s [vector] init: OK
  2255. 293.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2256. 293.22 s [vector] tail: OK
  2257. 293.22 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2258. 293.22 s [vector] take: OK
  2259. 293.22 s [vector] +++ OK, passed 100 tests.
  2260. 293.22 s [vector] drop: OK
  2261. 293.22 s [vector] +++ OK, passed 100 tests.
  2262. 293.22 s [vector] map: OK
  2263. 293.22 s [vector] +++ OK, passed 100 tests.
  2264. 293.22 s [vector] zipWith: OK
  2265. 293.22 s [vector] +++ OK, passed 100 tests.
  2266. 293.22 s [vector] zipWith3: OK
  2267. 293.22 s [vector] +++ OK, passed 100 tests.
  2268. 293.22 s [vector] filter: OK
  2269. 293.22 s [vector] +++ OK, passed 100 tests.
  2270. 293.22 s [vector] takeWhile: OK
  2271. 293.22 s [vector] +++ OK, passed 100 tests.
  2272. 293.22 s [vector] dropWhile: OK
  2273. 293.23 s [vector] +++ OK, passed 100 tests.
  2274. 293.23 s [vector] elem: OK
  2275. 293.23 s [vector] +++ OK, passed 100 tests.
  2276. 293.23 s [vector] notElem: OK
  2277. 293.23 s [vector] +++ OK, passed 100 tests.
  2278. 293.23 s [vector] find: OK
  2279. 293.23 s [vector] +++ OK, passed 100 tests.
  2280. 293.23 s [vector] findIndex: OK
  2281. 293.23 s [vector] +++ OK, passed 100 tests.
  2282. 293.23 s [vector] foldl: OK
  2283. 293.23 s [vector] +++ OK, passed 100 tests.
  2284. 293.23 s [vector] foldl1: OK
  2285. 293.23 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2286. 293.23 s [vector] foldl': OK
  2287. 293.23 s [vector] +++ OK, passed 100 tests.
  2288. 293.23 s [vector] foldl1': OK
  2289. 293.23 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2290. 293.23 s [vector] foldr: OK
  2291. 293.23 s [vector] +++ OK, passed 100 tests.
  2292. 293.24 s [vector] foldr1: OK
  2293. 293.24 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2294. 293.24 s [vector] prescanl: OK
  2295. 293.24 s [vector] +++ OK, passed 100 tests.
  2296. 293.24 s [vector] prescanl': OK
  2297. 293.24 s [vector] +++ OK, passed 100 tests.
  2298. 293.24 s [vector] postscanl: OK
  2299. 293.24 s [vector] +++ OK, passed 100 tests.
  2300. 293.24 s [vector] postscanl': OK
  2301. 293.24 s [vector] +++ OK, passed 100 tests.
  2302. 293.24 s [vector] scanl: OK
  2303. 293.24 s [vector] +++ OK, passed 100 tests.
  2304. 293.24 s [vector] scanl': OK
  2305. 293.24 s [vector] +++ OK, passed 100 tests.
  2306. 293.24 s [vector] scanl1: OK
  2307. 293.24 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2308. 293.24 s [vector] scanl1': OK
  2309. 293.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2310. 293.24 s [vector] concatMap: OK
  2311. 293.24 s [vector] +++ OK, passed 100 tests.
  2312. 293.24 s [vector] unfoldr: OK
  2313. 293.24 s [vector] +++ OK, passed 100 tests.
  2314. 293.24 s [vector] and: OK
  2315. 293.24 s [vector] +++ OK, passed 100 tests.
  2316. 293.24 s [vector] or: OK
  2317. 293.24 s [vector] +++ OK, passed 100 tests.
  2318. 293.24 s [vector] Tests.Vector.Boxed
  2319. 293.24 s [vector] Bool
  2320. 293.24 s [vector] fromList.toList == id: OK
  2321. 293.24 s [vector] +++ OK, passed 100 tests.
  2322. 293.24 s [vector] toList.fromList == id: OK
  2323. 293.24 s [vector] +++ OK, passed 100 tests.
  2324. 293.24 s [vector] unstream.stream == id: OK
  2325. 293.24 s [vector] +++ OK, passed 100 tests.
  2326. 293.24 s [vector] stream.unstream == id: OK
  2327. 293.24 s [vector] +++ OK, passed 100 tests.
  2328. 293.24 s [vector] eq: OK
  2329. 293.24 s [vector] +++ OK, passed 100 tests.
  2330. 293.24 s [vector] length: OK
  2331. 293.24 s [vector] +++ OK, passed 100 tests.
  2332. 293.24 s [vector] null: OK
  2333. 293.24 s [vector] +++ OK, passed 100 tests.
  2334. 293.24 s [vector] index: OK
  2335. 293.24 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2336. 293.24 s [vector] safeIndex: OK
  2337. 293.24 s [vector] +++ OK, passed 100 tests.
  2338. 293.24 s [vector] head: OK
  2339. 293.24 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2340. 293.24 s [vector] last: OK
  2341. 293.24 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2342. 293.24 s [vector] unsafeIndex: OK
  2343. 293.24 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2344. 293.24 s [vector] unsafeHead: OK
  2345. 293.24 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2346. 293.24 s [vector] unsafeLast: OK
  2347. 293.24 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2348. 293.24 s [vector] slice: OK
  2349. 293.24 s [vector] +++ OK, passed 100 tests.
  2350. 293.24 s [vector] init: OK
  2351. 293.24 s [vector] +++ OK, passed 100 tests; 10 discarded.
  2352. 293.24 s [vector] tail: OK
  2353. 293.24 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2354. 293.24 s [vector] take: OK
  2355. 293.24 s [vector] +++ OK, passed 100 tests.
  2356. 293.24 s [vector] drop: OK
  2357. 293.24 s [vector] +++ OK, passed 100 tests.
  2358. 293.24 s [vector] splitAt: OK
  2359. 293.24 s [vector] +++ OK, passed 100 tests.
  2360. 293.24 s [vector] empty: OK
  2361. 293.24 s [vector] +++ OK, passed 1 test.
  2362. 293.24 s [vector] singleton: OK
  2363. 293.24 s [vector] +++ OK, passed 100 tests.
  2364. 293.24 s [vector] replicate: OK
  2365. 293.24 s [vector] +++ OK, passed 100 tests.
  2366. 293.24 s [vector] generate: OK
  2367. 293.24 s [vector] +++ OK, passed 100 tests.
  2368. 293.24 s [vector] iterateN: OK
  2369. 293.24 s [vector] +++ OK, passed 100 tests.
  2370. 293.26 s [vector] iterateNM: OK (0.05s)
  2371. 293.26 s [vector] +++ OK, passed 100 tests.
  2372. 293.26 s [vector] generateM: OK (0.02s)
  2373. 293.26 s [vector] +++ OK, passed 100 tests.
  2374. 293.26 s [vector] replicateM: OK (0.01s)
  2375. 293.26 s [vector] +++ OK, passed 100 tests.
  2376. 293.26 s [vector] create: OK
  2377. 293.26 s [vector] +++ OK, passed 100 tests.
  2378. 293.26 s [vector] createT: OK
  2379. 293.27 s [vector] +++ OK, passed 100 tests.
  2380. 293.27 s [vector] unfoldr: OK
  2381. 293.28 s [vector] +++ OK, passed 100 tests.
  2382. 293.28 s [vector] unfoldrN: OK
  2383. 293.28 s [vector] +++ OK, passed 100 tests.
  2384. 293.28 s [vector] unfoldrExactN: OK
  2385. 293.28 s [vector] +++ OK, passed 100 tests.
  2386. 293.28 s [vector] unfoldrM: OK
  2387. 293.28 s [vector] +++ OK, passed 100 tests.
  2388. 293.28 s [vector] unfoldrNM: OK
  2389. 293.28 s [vector] +++ OK, passed 100 tests.
  2390. 293.28 s [vector] unfoldrExactNM: OK (0.05s)
  2391. 293.28 s [vector] +++ OK, passed 100 tests.
  2392. 293.28 s [vector] constructN: OK
  2393. 293.28 s [vector] +++ OK, passed 100 tests.
  2394. 293.28 s [vector] constructrN: OK
  2395. 293.28 s [vector] +++ OK, passed 100 tests.
  2396. 293.28 s [vector] cons: OK
  2397. 293.28 s [vector] +++ OK, passed 100 tests.
  2398. 293.28 s [vector] snoc: OK
  2399. 293.28 s [vector] +++ OK, passed 100 tests.
  2400. 293.28 s [vector] append: OK
  2401. 293.28 s [vector] +++ OK, passed 100 tests.
  2402. 293.28 s [vector] concat: OK
  2403. 293.28 s [vector] +++ OK, passed 100 tests.
  2404. 293.29 s [vector] force: OK
  2405. 293.29 s [vector] +++ OK, passed 100 tests.
  2406. 293.29 s [vector] upd: OK
  2407. 293.29 s [vector] +++ OK, passed 100 tests.
  2408. 293.29 s [vector] accum: OK
  2409. 293.29 s [vector] +++ OK, passed 100 tests.
  2410. 293.29 s [vector] reverse: OK
  2411. 293.29 s [vector] +++ OK, passed 100 tests.
  2412. 293.29 s [vector] backpermute: OK
  2413. 293.29 s [vector] +++ OK, passed 100 tests.
  2414. 293.29 s [vector] map: OK
  2415. 293.29 s [vector] +++ OK, passed 100 tests.
  2416. 293.29 s [vector] imap: OK
  2417. 293.30 s [vector] +++ OK, passed 100 tests.
  2418. 293.30 s [vector] concatMap: OK
  2419. 293.30 s [vector] +++ OK, passed 100 tests.
  2420. 293.31 s [vector] mapM: OK
  2421. 293.31 s [vector] +++ OK, passed 100 tests.
  2422. 293.31 s [vector] mapM_: OK (0.01s)
  2423. 293.31 s [vector] +++ OK, passed 100 tests.
  2424. 293.31 s [vector] forM: OK
  2425. 293.31 s [vector] +++ OK, passed 100 tests.
  2426. 293.32 s [vector] forM_: OK (0.01s)
  2427. 293.32 s [vector] +++ OK, passed 100 tests.
  2428. 293.32 s [vector] imapM: OK
  2429. 293.32 s [vector] +++ OK, passed 100 tests.
  2430. 293.32 s [vector] imapM_: OK (0.02s)
  2431. 293.32 s [vector] +++ OK, passed 100 tests.
  2432. 293.32 s [vector] zipWith: OK
  2433. 293.32 s [vector] +++ OK, passed 100 tests.
  2434. 293.32 s [vector] zipWith3: OK
  2435. 293.32 s [vector] +++ OK, passed 100 tests.
  2436. 293.32 s [vector] izipWith: OK
  2437. 293.32 s [vector] +++ OK, passed 100 tests.
  2438. 293.32 s [vector] izipWith3: OK
  2439. 293.32 s [vector] +++ OK, passed 100 tests.
  2440. 293.32 s [vector] izipWithM: OK
  2441. 293.32 s [vector] +++ OK, passed 100 tests.
  2442. 293.32 s [vector] izipWithM_: OK (0.01s)
  2443. 293.32 s [vector] +++ OK, passed 100 tests.
  2444. 293.32 s [vector] zipWithM: OK
  2445. 293.32 s [vector] +++ OK, passed 100 tests.
  2446. 293.33 s [vector] zipWithM_: OK
  2447. 293.33 s [vector] +++ OK, passed 100 tests.
  2448. 293.33 s [vector] filter: OK
  2449. 293.34 s [vector] +++ OK, passed 100 tests.
  2450. 293.34 s [vector] ifilter: OK
  2451. 293.34 s [vector] +++ OK, passed 100 tests.
  2452. 293.36 s [vector] filterM: OK (0.03s)
  2453. 293.36 s [vector] +++ OK, passed 100 tests.
  2454. 293.36 s [vector] uniq: OK
  2455. 293.36 s [vector] +++ OK, passed 100 tests.
  2456. 293.36 s [vector] mapMaybe: OK
  2457. 293.36 s [vector] +++ OK, passed 100 tests.
  2458. 293.36 s [vector] imapMaybe: OK
  2459. 293.36 s [vector] +++ OK, passed 100 tests.
  2460. 293.36 s [vector] takeWhile: OK
  2461. 293.36 s [vector] +++ OK, passed 100 tests.
  2462. 293.36 s [vector] dropWhile: OK
  2463. 293.36 s [vector] +++ OK, passed 100 tests.
  2464. 293.36 s [vector] partition: OK
  2465. 293.36 s [vector] +++ OK, passed 100 tests.
  2466. 293.36 s [vector] partitionWith: OK
  2467. 293.36 s [vector] +++ OK, passed 100 tests.
  2468. 293.36 s [vector] span: OK
  2469. 293.36 s [vector] +++ OK, passed 100 tests.
  2470. 293.36 s [vector] break: OK
  2471. 293.37 s [vector] +++ OK, passed 100 tests.
  2472. 293.37 s [vector] spanR: OK
  2473. 293.37 s [vector] +++ OK, passed 100 tests.
  2474. 293.37 s [vector] breakR: OK
  2475. 293.37 s [vector] +++ OK, passed 100 tests.
  2476. 293.37 s [vector] groupBy: OK
  2477. 293.37 s [vector] +++ OK, passed 100 tests.
  2478. 293.37 s [vector] elem: OK
  2479. 293.37 s [vector] +++ OK, passed 100 tests.
  2480. 293.37 s [vector] notElem: OK
  2481. 293.37 s [vector] +++ OK, passed 100 tests.
  2482. 293.37 s [vector] find: OK
  2483. 293.37 s [vector] +++ OK, passed 100 tests.
  2484. 293.37 s [vector] findIndex: OK
  2485. 293.37 s [vector] +++ OK, passed 100 tests.
  2486. 293.37 s [vector] findIndexR: OK
  2487. 293.37 s [vector] +++ OK, passed 100 tests.
  2488. 293.37 s [vector] findIndices: OK
  2489. 293.37 s [vector] +++ OK, passed 100 tests.
  2490. 293.37 s [vector] elemIndex: OK
  2491. 293.37 s [vector] +++ OK, passed 100 tests.
  2492. 293.37 s [vector] elemIndices: OK
  2493. 293.37 s [vector] +++ OK, passed 100 tests.
  2494. 293.37 s [vector] foldl: OK
  2495. 293.37 s [vector] +++ OK, passed 100 tests.
  2496. 293.38 s [vector] foldl1: OK
  2497. 293.38 s [vector] +++ OK, passed 100 tests; 23 discarded.
  2498. 293.38 s [vector] foldl': OK
  2499. 293.38 s [vector] +++ OK, passed 100 tests.
  2500. 293.38 s [vector] foldl1': OK
  2501. 293.38 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2502. 293.38 s [vector] foldr: OK
  2503. 293.38 s [vector] +++ OK, passed 100 tests.
  2504. 293.38 s [vector] foldr1: OK
  2505. 293.38 s [vector] +++ OK, passed 100 tests; 10 discarded.
  2506. 293.38 s [vector] foldr': OK
  2507. 293.38 s [vector] +++ OK, passed 100 tests.
  2508. 293.38 s [vector] foldr1': OK
  2509. 293.39 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2510. 293.39 s [vector] ifoldl: OK
  2511. 293.39 s [vector] +++ OK, passed 100 tests.
  2512. 293.39 s [vector] ifoldl': OK
  2513. 293.39 s [vector] +++ OK, passed 100 tests.
  2514. 293.39 s [vector] ifoldr: OK
  2515. 293.39 s [vector] +++ OK, passed 100 tests.
  2516. 293.39 s [vector] ifoldr': OK
  2517. 293.39 s [vector] +++ OK, passed 100 tests.
  2518. 293.39 s [vector] ifoldM: OK
  2519. 293.39 s [vector] +++ OK, passed 100 tests.
  2520. 293.40 s [vector] ifoldM': OK
  2521. 293.40 s [vector] +++ OK, passed 100 tests.
  2522. 293.42 s [vector] ifoldM_: OK (0.01s)
  2523. 293.42 s [vector] +++ OK, passed 100 tests.
  2524. 293.42 s [vector] ifoldM'_: OK (0.01s)
  2525. 293.42 s [vector] +++ OK, passed 100 tests.
  2526. 293.42 s [vector] all: OK
  2527. 293.42 s [vector] +++ OK, passed 100 tests.
  2528. 293.43 s [vector] any: OK
  2529. 293.43 s [vector] +++ OK, passed 100 tests.
  2530. 293.43 s [vector] prescanl: OK
  2531. 293.43 s [vector] +++ OK, passed 100 tests.
  2532. 293.43 s [vector] prescanl': OK
  2533. 293.43 s [vector] +++ OK, passed 100 tests.
  2534. 293.43 s [vector] postscanl: OK
  2535. 293.43 s [vector] +++ OK, passed 100 tests.
  2536. 293.43 s [vector] postscanl': OK
  2537. 293.43 s [vector] +++ OK, passed 100 tests.
  2538. 293.43 s [vector] scanl: OK
  2539. 293.43 s [vector] +++ OK, passed 100 tests.
  2540. 293.43 s [vector] scanl': OK
  2541. 293.44 s [vector] +++ OK, passed 100 tests.
  2542. 293.44 s [vector] scanl1: OK
  2543. 293.44 s [vector] +++ OK, passed 100 tests.
  2544. 293.44 s [vector] scanl1': OK
  2545. 293.44 s [vector] +++ OK, passed 100 tests.
  2546. 293.44 s [vector] iscanl: OK
  2547. 293.44 s [vector] +++ OK, passed 100 tests.
  2548. 293.44 s [vector] iscanl': OK
  2549. 293.44 s [vector] +++ OK, passed 100 tests.
  2550. 293.44 s [vector] prescanr: OK
  2551. 293.44 s [vector] +++ OK, passed 100 tests.
  2552. 293.44 s [vector] prescanr': OK
  2553. 293.45 s [vector] +++ OK, passed 100 tests.
  2554. 293.45 s [vector] postscanr: OK
  2555. 293.45 s [vector] +++ OK, passed 100 tests.
  2556. 293.45 s [vector] postscanr': OK
  2557. 293.45 s [vector] +++ OK, passed 100 tests.
  2558. 293.45 s [vector] scanr: OK
  2559. 293.45 s [vector] +++ OK, passed 100 tests.
  2560. 293.45 s [vector] scanr': OK
  2561. 293.45 s [vector] +++ OK, passed 100 tests.
  2562. 293.45 s [vector] scanr1: OK
  2563. 293.45 s [vector] +++ OK, passed 100 tests.
  2564. 293.45 s [vector] scanr1': OK
  2565. 293.46 s [vector] +++ OK, passed 100 tests.
  2566. 293.46 s [vector] iscanr: OK
  2567. 293.46 s [vector] +++ OK, passed 100 tests.
  2568. 293.46 s [vector] iscanr': OK
  2569. 293.46 s [vector] +++ OK, passed 100 tests.
  2570. 293.46 s [vector] mut_read: OK
  2571. 293.46 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2572. 293.47 s [vector] mut_write: OK
  2573. 293.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2574. 293.48 s [vector] mut_modify: OK
  2575. 293.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2576. 293.48 s [vector] mut_generate: OK
  2577. 293.48 s [vector] +++ OK, passed 100 tests.
  2578. 293.48 s [vector] mut_generateM: OK
  2579. 293.48 s [vector] +++ OK, passed 100 tests.
  2580. 293.49 s [vector] mut_mapM_: OK (0.01s)
  2581. 293.50 s [vector] +++ OK, passed 100 tests.
  2582. 293.50 s [vector] mut_imapM_: OK (0.01s)
  2583. 293.50 s [vector] +++ OK, passed 100 tests.
  2584. 293.52 s [vector] mut_forM_: OK (0.01s)
  2585. 293.52 s [vector] +++ OK, passed 100 tests.
  2586. 293.52 s [vector] mut_iforM_: OK (0.01s)
  2587. 293.52 s [vector] +++ OK, passed 100 tests.
  2588. 293.52 s [vector] mut_foldr: OK
  2589. 293.52 s [vector] +++ OK, passed 100 tests.
  2590. 293.52 s [vector] mut_foldr': OK
  2591. 293.52 s [vector] +++ OK, passed 100 tests.
  2592. 293.52 s [vector] mut_foldl: OK
  2593. 293.52 s [vector] +++ OK, passed 100 tests.
  2594. 293.52 s [vector] mut_foldl': OK
  2595. 293.53 s [vector] +++ OK, passed 100 tests.
  2596. 293.53 s [vector] mut_ifoldr: OK
  2597. 293.53 s [vector] +++ OK, passed 100 tests.
  2598. 293.53 s [vector] mut_ifoldr': OK
  2599. 293.53 s [vector] +++ OK, passed 100 tests.
  2600. 293.53 s [vector] mut_ifoldl: OK
  2601. 293.53 s [vector] +++ OK, passed 100 tests.
  2602. 293.53 s [vector] mut_ifoldl': OK
  2603. 293.53 s [vector] +++ OK, passed 100 tests.
  2604. 293.53 s [vector] mut_foldM: OK
  2605. 293.53 s [vector] +++ OK, passed 100 tests.
  2606. 293.54 s [vector] mut_foldM': OK
  2607. 293.54 s [vector] +++ OK, passed 100 tests.
  2608. 293.54 s [vector] mut_foldrM: OK
  2609. 293.54 s [vector] +++ OK, passed 100 tests.
  2610. 293.54 s [vector] mut_foldrM': OK
  2611. 293.54 s [vector] +++ OK, passed 100 tests.
  2612. 293.55 s [vector] mut_ifoldM: OK
  2613. 293.55 s [vector] +++ OK, passed 100 tests.
  2614. 293.55 s [vector] mut_ifoldM': OK
  2615. 293.55 s [vector] +++ OK, passed 100 tests.
  2616. 293.55 s [vector] mut_ifoldrM: OK
  2617. 293.55 s [vector] +++ OK, passed 100 tests.
  2618. 293.55 s [vector] mut_ifoldrM': OK
  2619. 293.55 s [vector] +++ OK, passed 100 tests.
  2620. 293.55 s [vector] compare: OK
  2621. 293.55 s [vector] +++ OK, passed 100 tests.
  2622. 293.56 s [vector] maximum: OK
  2623. 293.56 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2624. 293.56 s [vector] minimum: OK
  2625. 293.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2626. 293.56 s [vector] minIndex: OK
  2627. 293.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2628. 293.56 s [vector] maxIndex: OK
  2629. 293.56 s [vector] +++ OK, passed 100 tests; 21 discarded.
  2630. 293.56 s [vector] maximumBy: OK
  2631. 293.56 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2632. 293.56 s [vector] minimumBy: OK
  2633. 293.56 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2634. 293.56 s [vector] maximumOn: OK
  2635. 293.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2636. 293.56 s [vector] minimumOn: OK
  2637. 293.56 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2638. 293.56 s [vector] maxIndexBy: OK
  2639. 293.56 s [vector] +++ OK, passed 100 tests; 26 discarded.
  2640. 293.56 s [vector] minIndexBy: OK
  2641. 293.56 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2642. 293.56 s [vector] ListFirstMaxIndexWins: OK
  2643. 293.56 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2644. 293.56 s [vector] FalseListFirstMaxIndexWins: OK
  2645. 293.56 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  2646. 293.56 s [vector] []
  2647. 293.56 s [vector] zip: OK
  2648. 293.56 s [vector] +++ OK, passed 100 tests.
  2649. 293.56 s [vector] zip3: OK
  2650. 293.56 s [vector] +++ OK, passed 100 tests.
  2651. 293.56 s [vector] unzip: OK
  2652. 293.56 s [vector] +++ OK, passed 100 tests.
  2653. 293.57 s [vector] unzip3: OK
  2654. 293.57 s [vector] +++ OK, passed 100 tests.
  2655. 293.57 s [vector] indexed: OK
  2656. 293.57 s [vector] +++ OK, passed 100 tests.
  2657. 293.58 s [vector] update: OK
  2658. 293.58 s [vector] +++ OK, passed 100 tests.
  2659. 293.58 s [vector] concat: OK
  2660. 293.58 s [vector] +++ OK, passed 100 tests.
  2661. 293.58 s [vector] mempty: OK
  2662. 293.58 s [vector] +++ OK, passed 1 test.
  2663. 293.58 s [vector] mappend: OK
  2664. 293.59 s [vector] +++ OK, passed 100 tests.
  2665. 293.59 s [vector] mconcat: OK
  2666. 293.59 s [vector] +++ OK, passed 100 tests.
  2667. 293.59 s [vector] fmap: OK
  2668. 293.59 s [vector] +++ OK, passed 100 tests.
  2669. 293.60 s [vector] return: OK
  2670. 293.60 s [vector] +++ OK, passed 100 tests.
  2671. 293.60 s [vector] bind: OK (0.01s)
  2672. 293.60 s [vector] +++ OK, passed 100 tests.
  2673. 293.60 s [vector] mzip: OK
  2674. 293.60 s [vector] +++ OK, passed 100 tests.
  2675. 293.60 s [vector] munzip: OK
  2676. 293.60 s [vector] +++ OK, passed 100 tests.
  2677. 293.62 s [vector] applicative_pure: OK
  2678. 293.62 s [vector] +++ OK, passed 100 tests.
  2679. 293.62 s [vector] applicative_appl: OK (0.02s)
  2680. 293.62 s [vector] +++ OK, passed 100 tests.
  2681. 293.62 s [vector] alternative_empty: OK
  2682. 293.62 s [vector] +++ OK, passed 1 test.
  2683. 293.62 s [vector] alternative_or: OK
  2684. 293.62 s [vector] +++ OK, passed 100 tests.
  2685. 293.65 s [vector] sequence: OK (0.02s)
  2686. 293.65 s [vector] +++ OK, passed 100 tests.
  2687. 293.66 s [vector] sequence_: OK (0.01s)
  2688. 293.66 s [vector] +++ OK, passed 100 tests.
  2689. 293.66 s [vector] glength: OK
  2690. 293.66 s [vector] +++ OK, passed 100 tests.
  2691. 293.66 s [vector] and: OK
  2692. 293.66 s [vector] +++ OK, passed 100 tests.
  2693. 293.66 s [vector] or: OK
  2694. 293.66 s [vector] +++ OK, passed 100 tests.
  2695. 293.66 s [vector] Int
  2696. 293.66 s [vector] fromList.toList == id: OK
  2697. 293.66 s [vector] +++ OK, passed 100 tests.
  2698. 293.66 s [vector] toList.fromList == id: OK
  2699. 293.66 s [vector] +++ OK, passed 100 tests.
  2700. 293.66 s [vector] unstream.stream == id: OK
  2701. 293.66 s [vector] +++ OK, passed 100 tests.
  2702. 293.66 s [vector] stream.unstream == id: OK
  2703. 293.66 s [vector] +++ OK, passed 100 tests.
  2704. 293.66 s [vector] eq: OK
  2705. 293.66 s [vector] +++ OK, passed 100 tests.
  2706. 293.66 s [vector] length: OK
  2707. 293.66 s [vector] +++ OK, passed 100 tests.
  2708. 293.66 s [vector] null: OK
  2709. 293.66 s [vector] +++ OK, passed 100 tests.
  2710. 293.66 s [vector] index: OK
  2711. 293.66 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2712. 293.66 s [vector] safeIndex: OK
  2713. 293.66 s [vector] +++ OK, passed 100 tests.
  2714. 293.66 s [vector] head: OK
  2715. 293.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2716. 293.66 s [vector] last: OK
  2717. 293.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2718. 293.66 s [vector] unsafeIndex: OK
  2719. 293.66 s [vector] +++ OK, passed 100 tests; 22 discarded.
  2720. 293.66 s [vector] unsafeHead: OK
  2721. 293.66 s [vector] +++ OK, passed 100 tests; 23 discarded.
  2722. 293.66 s [vector] unsafeLast: OK
  2723. 293.66 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2724. 293.66 s [vector] slice: OK
  2725. 293.66 s [vector] +++ OK, passed 100 tests.
  2726. 293.66 s [vector] init: OK
  2727. 293.66 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2728. 293.66 s [vector] tail: OK
  2729. 293.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2730. 293.66 s [vector] take: OK
  2731. 293.66 s [vector] +++ OK, passed 100 tests.
  2732. 293.67 s [vector] drop: OK
  2733. 293.67 s [vector] +++ OK, passed 100 tests.
  2734. 293.67 s [vector] splitAt: OK
  2735. 293.67 s [vector] +++ OK, passed 100 tests.
  2736. 293.67 s [vector] empty: OK
  2737. 293.67 s [vector] +++ OK, passed 1 test.
  2738. 293.67 s [vector] singleton: OK
  2739. 293.67 s [vector] +++ OK, passed 100 tests.
  2740. 293.67 s [vector] replicate: OK
  2741. 293.67 s [vector] +++ OK, passed 100 tests.
  2742. 293.67 s [vector] generate: OK
  2743. 293.67 s [vector] +++ OK, passed 100 tests.
  2744. 293.68 s [vector] iterateN: OK
  2745. 293.68 s [vector] +++ OK, passed 100 tests.
  2746. 293.70 s [vector] iterateNM: OK (0.03s)
  2747. 293.70 s [vector] +++ OK, passed 100 tests.
  2748. 293.71 s [vector] generateM: OK (0.01s)
  2749. 293.71 s [vector] +++ OK, passed 100 tests.
  2750. 293.71 s [vector] replicateM: OK
  2751. 293.71 s [vector] +++ OK, passed 100 tests.
  2752. 293.71 s [vector] create: OK
  2753. 293.71 s [vector] +++ OK, passed 100 tests.
  2754. 293.71 s [vector] createT: OK
  2755. 293.71 s [vector] +++ OK, passed 100 tests.
  2756. 293.71 s [vector] unfoldr: OK
  2757. 293.71 s [vector] +++ OK, passed 100 tests.
  2758. 293.71 s [vector] unfoldrN: OK
  2759. 293.71 s [vector] +++ OK, passed 100 tests.
  2760. 293.72 s [vector] unfoldrExactN: OK
  2761. 293.72 s [vector] +++ OK, passed 100 tests.
  2762. 293.73 s [vector] unfoldrM: OK
  2763. 293.73 s [vector] +++ OK, passed 100 tests.
  2764. 293.74 s [vector] unfoldrNM: OK
  2765. 293.74 s [vector] +++ OK, passed 100 tests.
  2766. 293.76 s [vector] unfoldrExactNM: OK (0.03s)
  2767. 293.76 s [vector] +++ OK, passed 100 tests.
  2768. 293.76 s [vector] constructN: OK
  2769. 293.76 s [vector] +++ OK, passed 100 tests.
  2770. 293.77 s [vector] constructrN: OK
  2771. 293.77 s [vector] +++ OK, passed 100 tests.
  2772. 293.77 s [vector] cons: OK
  2773. 293.77 s [vector] +++ OK, passed 100 tests.
  2774. 293.77 s [vector] snoc: OK
  2775. 293.77 s [vector] +++ OK, passed 100 tests.
  2776. 293.77 s [vector] append: OK
  2777. 293.77 s [vector] +++ OK, passed 100 tests.
  2778. 293.78 s [vector] concat: OK
  2779. 293.78 s [vector] +++ OK, passed 100 tests.
  2780. 293.78 s [vector] force: OK
  2781. 293.78 s [vector] +++ OK, passed 100 tests.
  2782. 293.78 s [vector] upd: OK
  2783. 293.78 s [vector] +++ OK, passed 100 tests.
  2784. 293.78 s [vector] accum: OK
  2785. 293.78 s [vector] +++ OK, passed 100 tests.
  2786. 293.79 s [vector] reverse: OK
  2787. 293.79 s [vector] +++ OK, passed 100 tests.
  2788. 293.79 s [vector] backpermute: OK
  2789. 293.79 s [vector] +++ OK, passed 100 tests.
  2790. 293.79 s [vector] map: OK
  2791. 293.79 s [vector] +++ OK, passed 100 tests.
  2792. 293.79 s [vector] imap: OK
  2793. 293.79 s [vector] +++ OK, passed 100 tests.
  2794. 293.79 s [vector] concatMap: OK
  2795. 293.79 s [vector] +++ OK, passed 100 tests.
  2796. 293.79 s [vector] mapM: OK
  2797. 293.80 s [vector] +++ OK, passed 100 tests.
  2798. 293.82 s [vector] mapM_: OK (0.02s)
  2799. 293.82 s [vector] +++ OK, passed 100 tests.
  2800. 293.82 s [vector] forM: OK
  2801. 293.82 s [vector] +++ OK, passed 100 tests.
  2802. 293.84 s [vector] forM_: OK (0.02s)
  2803. 293.84 s [vector] +++ OK, passed 100 tests.
  2804. 293.84 s [vector] imapM: OK
  2805. 293.84 s [vector] +++ OK, passed 100 tests.
  2806. 293.85 s [vector] imapM_: OK (0.02s)
  2807. 293.85 s [vector] +++ OK, passed 100 tests.
  2808. 293.85 s [vector] zipWith: OK
  2809. 293.86 s [vector] +++ OK, passed 100 tests.
  2810. 293.86 s [vector] zipWith3: OK
  2811. 293.86 s [vector] +++ OK, passed 100 tests.
  2812. 293.86 s [vector] izipWith: OK
  2813. 293.86 s [vector] +++ OK, passed 100 tests.
  2814. 293.87 s [vector] izipWith3: OK
  2815. 293.87 s [vector] +++ OK, passed 100 tests.
  2816. 293.88 s [vector] izipWithM: OK
  2817. 293.88 s [vector] +++ OK, passed 100 tests.
  2818. 293.88 s [vector] izipWithM_: OK (0.01s)
  2819. 293.88 s [vector] +++ OK, passed 100 tests.
  2820. 293.88 s [vector] zipWithM: OK
  2821. 293.89 s [vector] +++ OK, passed 100 tests.
  2822. 293.90 s [vector] zipWithM_: OK (0.01s)
  2823. 293.90 s [vector] +++ OK, passed 100 tests.
  2824. 293.90 s [vector] filter: OK
  2825. 293.90 s [vector] +++ OK, passed 100 tests.
  2826. 293.90 s [vector] ifilter: OK
  2827. 293.90 s [vector] +++ OK, passed 100 tests.
  2828. 293.92 s [vector] filterM: OK (0.02s)
  2829. 293.92 s [vector] +++ OK, passed 100 tests.
  2830. 293.93 s [vector] uniq: OK
  2831. 293.93 s [vector] +++ OK, passed 100 tests.
  2832. 293.93 s [vector] mapMaybe: OK
  2833. 293.93 s [vector] +++ OK, passed 100 tests.
  2834. 293.93 s [vector] imapMaybe: OK
  2835. 293.93 s [vector] +++ OK, passed 100 tests.
  2836. 293.93 s [vector] takeWhile: OK
  2837. 293.93 s [vector] +++ OK, passed 100 tests.
  2838. 293.93 s [vector] dropWhile: OK
  2839. 293.93 s [vector] +++ OK, passed 100 tests.
  2840. 293.93 s [vector] partition: OK
  2841. 293.93 s [vector] +++ OK, passed 100 tests.
  2842. 293.93 s [vector] partitionWith: OK
  2843. 293.93 s [vector] +++ OK, passed 100 tests.
  2844. 293.93 s [vector] span: OK
  2845. 293.93 s [vector] +++ OK, passed 100 tests.
  2846. 293.93 s [vector] break: OK
  2847. 293.93 s [vector] +++ OK, passed 100 tests.
  2848. 293.93 s [vector] spanR: OK
  2849. 293.93 s [vector] +++ OK, passed 100 tests.
  2850. 293.94 s [vector] breakR: OK
  2851. 293.94 s [vector] +++ OK, passed 100 tests.
  2852. 293.94 s [vector] groupBy: OK
  2853. 293.94 s [vector] +++ OK, passed 100 tests.
  2854. 293.94 s [vector] elem: OK
  2855. 293.94 s [vector] +++ OK, passed 100 tests.
  2856. 293.94 s [vector] notElem: OK
  2857. 293.94 s [vector] +++ OK, passed 100 tests.
  2858. 293.94 s [vector] find: OK
  2859. 293.94 s [vector] +++ OK, passed 100 tests.
  2860. 293.94 s [vector] findIndex: OK
  2861. 293.94 s [vector] +++ OK, passed 100 tests.
  2862. 293.94 s [vector] findIndexR: OK
  2863. 293.94 s [vector] +++ OK, passed 100 tests.
  2864. 293.94 s [vector] findIndices: OK
  2865. 293.94 s [vector] +++ OK, passed 100 tests.
  2866. 293.94 s [vector] elemIndex: OK
  2867. 293.94 s [vector] +++ OK, passed 100 tests.
  2868. 293.94 s [vector] elemIndices: OK
  2869. 293.94 s [vector] +++ OK, passed 100 tests.
  2870. 293.95 s [vector] foldl: OK
  2871. 293.95 s [vector] +++ OK, passed 100 tests.
  2872. 293.95 s [vector] foldl1: OK
  2873. 293.95 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2874. 293.96 s [vector] foldl': OK
  2875. 293.96 s [vector] +++ OK, passed 100 tests.
  2876. 293.96 s [vector] foldl1': OK
  2877. 293.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2878. 293.96 s [vector] foldr: OK
  2879. 293.96 s [vector] +++ OK, passed 100 tests.
  2880. 293.96 s [vector] foldr1: OK
  2881. 293.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2882. 293.96 s [vector] foldr': OK
  2883. 293.96 s [vector] +++ OK, passed 100 tests.
  2884. 293.97 s [vector] foldr1': OK
  2885. 293.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2886. 293.97 s [vector] ifoldl: OK
  2887. 293.97 s [vector] +++ OK, passed 100 tests.
  2888. 293.97 s [vector] ifoldl': OK
  2889. 293.97 s [vector] +++ OK, passed 100 tests.
  2890. 293.97 s [vector] ifoldr: OK
  2891. 293.98 s [vector] +++ OK, passed 100 tests.
  2892. 293.98 s [vector] ifoldr': OK
  2893. 293.98 s [vector] +++ OK, passed 100 tests.
  2894. 293.98 s [vector] ifoldM: OK
  2895. 293.98 s [vector] +++ OK, passed 100 tests.
  2896. 293.98 s [vector] ifoldM': OK
  2897. 294.00 s [vector] +++ OK, passed 100 tests.
  2898. 294.02 s [vector] ifoldM_: OK (0.02s)
  2899. 294.02 s [vector] +++ OK, passed 100 tests.
  2900. 294.02 s [vector] ifoldM'_: OK (0.02s)
  2901. 294.02 s [vector] +++ OK, passed 100 tests.
  2902. 294.02 s [vector] all: OK
  2903. 294.02 s [vector] +++ OK, passed 100 tests.
  2904. 294.02 s [vector] any: OK
  2905. 294.02 s [vector] +++ OK, passed 100 tests.
  2906. 294.02 s [vector] prescanl: OK
  2907. 294.03 s [vector] +++ OK, passed 100 tests.
  2908. 294.03 s [vector] prescanl': OK
  2909. 294.03 s [vector] +++ OK, passed 100 tests.
  2910. 294.03 s [vector] postscanl: OK
  2911. 294.03 s [vector] +++ OK, passed 100 tests.
  2912. 294.04 s [vector] postscanl': OK
  2913. 294.04 s [vector] +++ OK, passed 100 tests.
  2914. 294.04 s [vector] scanl: OK
  2915. 294.04 s [vector] +++ OK, passed 100 tests.
  2916. 294.05 s [vector] scanl': OK
  2917. 294.05 s [vector] +++ OK, passed 100 tests.
  2918. 294.05 s [vector] scanl1: OK
  2919. 294.05 s [vector] +++ OK, passed 100 tests.
  2920. 294.05 s [vector] scanl1': OK
  2921. 294.05 s [vector] +++ OK, passed 100 tests.
  2922. 294.05 s [vector] iscanl: OK
  2923. 294.05 s [vector] +++ OK, passed 100 tests.
  2924. 294.05 s [vector] iscanl': OK
  2925. 294.06 s [vector] +++ OK, passed 100 tests.
  2926. 294.06 s [vector] prescanr: OK
  2927. 294.06 s [vector] +++ OK, passed 100 tests.
  2928. 294.06 s [vector] prescanr': OK
  2929. 294.06 s [vector] +++ OK, passed 100 tests.
  2930. 294.06 s [vector] postscanr: OK
  2931. 294.06 s [vector] +++ OK, passed 100 tests.
  2932. 294.06 s [vector] postscanr': OK
  2933. 294.06 s [vector] +++ OK, passed 100 tests.
  2934. 294.06 s [vector] scanr: OK
  2935. 294.06 s [vector] +++ OK, passed 100 tests.
  2936. 294.06 s [vector] scanr': OK
  2937. 294.06 s [vector] +++ OK, passed 100 tests.
  2938. 294.06 s [vector] scanr1: OK
  2939. 294.07 s [vector] +++ OK, passed 100 tests.
  2940. 294.07 s [vector] scanr1': OK
  2941. 294.07 s [vector] +++ OK, passed 100 tests.
  2942. 294.07 s [vector] iscanr: OK
  2943. 294.07 s [vector] +++ OK, passed 100 tests.
  2944. 294.07 s [vector] iscanr': OK
  2945. 294.07 s [vector] +++ OK, passed 100 tests.
  2946. 294.08 s [vector] mut_read: OK
  2947. 294.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2948. 294.08 s [vector] mut_write: OK
  2949. 294.08 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2950. 294.08 s [vector] mut_modify: OK
  2951. 294.08 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2952. 294.08 s [vector] mut_generate: OK
  2953. 294.08 s [vector] +++ OK, passed 100 tests.
  2954. 294.10 s [vector] mut_generateM: OK
  2955. 294.10 s [vector] +++ OK, passed 100 tests.
  2956. 294.12 s [vector] mut_mapM_: OK (0.02s)
  2957. 294.12 s [vector] +++ OK, passed 100 tests.
  2958. 294.12 s [vector] mut_imapM_: OK (0.01s)
  2959. 294.12 s [vector] +++ OK, passed 100 tests.
  2960. 294.14 s [vector] mut_forM_: OK (0.02s)
  2961. 294.14 s [vector] +++ OK, passed 100 tests.
  2962. 294.15 s [vector] mut_iforM_: OK (0.02s)
  2963. 294.15 s [vector] +++ OK, passed 100 tests.
  2964. 294.15 s [vector] mut_foldr: OK
  2965. 294.15 s [vector] +++ OK, passed 100 tests.
  2966. 294.15 s [vector] mut_foldr': OK
  2967. 294.16 s [vector] +++ OK, passed 100 tests.
  2968. 294.16 s [vector] mut_foldl: OK
  2969. 294.16 s [vector] +++ OK, passed 100 tests.
  2970. 294.16 s [vector] mut_foldl': OK
  2971. 294.16 s [vector] +++ OK, passed 100 tests.
  2972. 294.16 s [vector] mut_ifoldr: OK
  2973. 294.16 s [vector] +++ OK, passed 100 tests.
  2974. 294.16 s [vector] mut_ifoldr': OK
  2975. 294.17 s [vector] +++ OK, passed 100 tests.
  2976. 294.17 s [vector] mut_ifoldl: OK
  2977. 294.18 s [vector] +++ OK, passed 100 tests.
  2978. 294.18 s [vector] mut_ifoldl': OK
  2979. 294.18 s [vector] +++ OK, passed 100 tests.
  2980. 294.19 s [vector] mut_foldM: OK
  2981. 294.19 s [vector] +++ OK, passed 100 tests.
  2982. 294.20 s [vector] mut_foldM': OK
  2983. 294.20 s [vector] +++ OK, passed 100 tests.
  2984. 294.20 s [vector] mut_foldrM: OK
  2985. 294.20 s [vector] +++ OK, passed 100 tests.
  2986. 294.20 s [vector] mut_foldrM': OK
  2987. 294.20 s [vector] +++ OK, passed 100 tests.
  2988. 294.20 s [vector] mut_ifoldM: OK
  2989. 294.20 s [vector] +++ OK, passed 100 tests.
  2990. 294.20 s [vector] mut_ifoldM': OK
  2991. 294.20 s [vector] +++ OK, passed 100 tests.
  2992. 294.20 s [vector] mut_ifoldrM: OK
  2993. 294.20 s [vector] +++ OK, passed 100 tests.
  2994. 294.20 s [vector] mut_ifoldrM': OK
  2995. 294.20 s [vector] +++ OK, passed 100 tests.
  2996. 294.20 s [vector] compare: OK
  2997. 294.20 s [vector] +++ OK, passed 100 tests.
  2998. 294.20 s [vector] maximum: OK
  2999. 294.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3000. 294.20 s [vector] minimum: OK
  3001. 294.20 s [vector] +++ OK, passed 100 tests; 22 discarded.
  3002. 294.20 s [vector] minIndex: OK
  3003. 294.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3004. 294.20 s [vector] maxIndex: OK
  3005. 294.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3006. 294.20 s [vector] maximumBy: OK
  3007. 294.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3008. 294.20 s [vector] minimumBy: OK
  3009. 294.20 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3010. 294.20 s [vector] maximumOn: OK
  3011. 294.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3012. 294.20 s [vector] minimumOn: OK
  3013. 294.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3014. 294.20 s [vector] maxIndexBy: OK
  3015. 294.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3016. 294.20 s [vector] minIndexBy: OK
  3017. 294.20 s [vector] +++ OK, passed 100 tests; 11 discarded.
  3018. 294.20 s [vector] ListFirstMaxIndexWins: OK
  3019. 294.20 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3020. 294.20 s [vector] FalseListFirstMaxIndexWins: OK
  3021. 294.20 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  3022. 294.20 s [vector] []
  3023. 294.21 s [vector] zip: OK
  3024. 294.21 s [vector] +++ OK, passed 100 tests.
  3025. 294.21 s [vector] zip3: OK
  3026. 294.21 s [vector] +++ OK, passed 100 tests.
  3027. 294.21 s [vector] unzip: OK
  3028. 294.21 s [vector] +++ OK, passed 100 tests.
  3029. 294.21 s [vector] unzip3: OK
  3030. 294.21 s [vector] +++ OK, passed 100 tests.
  3031. 294.21 s [vector] indexed: OK
  3032. 294.21 s [vector] +++ OK, passed 100 tests.
  3033. 294.22 s [vector] update: OK
  3034. 294.22 s [vector] +++ OK, passed 100 tests.
  3035. 294.22 s [vector] concat: OK (0.01s)
  3036. 294.22 s [vector] +++ OK, passed 100 tests.
  3037. 294.22 s [vector] mempty: OK
  3038. 294.22 s [vector] +++ OK, passed 1 test.
  3039. 294.23 s [vector] mappend: OK
  3040. 294.23 s [vector] +++ OK, passed 100 tests.
  3041. 294.23 s [vector] mconcat: OK
  3042. 294.23 s [vector] +++ OK, passed 100 tests.
  3043. 294.23 s [vector] fmap: OK
  3044. 294.24 s [vector] +++ OK, passed 100 tests.
  3045. 294.24 s [vector] return: OK
  3046. 294.24 s [vector] +++ OK, passed 100 tests.
  3047. 294.25 s [vector] bind: OK (0.02s)
  3048. 294.25 s [vector] +++ OK, passed 100 tests.
  3049. 294.25 s [vector] mzip: OK
  3050. 294.25 s [vector] +++ OK, passed 100 tests.
  3051. 294.25 s [vector] munzip: OK
  3052. 294.25 s [vector] +++ OK, passed 100 tests.
  3053. 294.26 s [vector] applicative_pure: OK
  3054. 294.26 s [vector] +++ OK, passed 100 tests.
  3055. 294.29 s [vector] applicative_appl: OK (0.04s)
  3056. 294.29 s [vector] +++ OK, passed 100 tests.
  3057. 294.29 s [vector] alternative_empty: OK
  3058. 294.30 s [vector] +++ OK, passed 1 test.
  3059. 294.30 s [vector] alternative_or: OK
  3060. 294.30 s [vector] +++ OK, passed 100 tests.
  3061. 294.34 s [vector] sequence: OK (0.03s)
  3062. 294.34 s [vector] +++ OK, passed 100 tests.
  3063. 294.34 s [vector] sequence_: OK
  3064. 294.34 s [vector] +++ OK, passed 100 tests.
  3065. 294.34 s [vector] glength: OK
  3066. 294.34 s [vector] +++ OK, passed 100 tests.
  3067. 294.34 s [vector] sum: OK
  3068. 294.34 s [vector] +++ OK, passed 100 tests.
  3069. 294.34 s [vector] product: OK
  3070. 294.34 s [vector] +++ OK, passed 100 tests.
  3071. 294.34 s [vector] enumFromN: OK
  3072. 294.34 s [vector] +++ OK, passed 100 tests.
  3073. 294.34 s [vector] enumFromThenN: OK
  3074. 294.34 s [vector] +++ OK, passed 100 tests.
  3075. 294.34 s [vector] enumFromTo: OK
  3076. 294.34 s [vector] +++ OK, passed 100 tests.
  3077. 294.35 s [vector] enumFromThenTo: OK
  3078. 294.35 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3079. 294.35 s [vector] unstream
  3080. 294.35 s [vector] unstream == vunstream (exact): OK
  3081. 294.35 s [vector] +++ OK, passed 100 tests.
  3082. 294.35 s [vector] unstream == vunstream (unknown): OK
  3083. 294.35 s [vector] +++ OK, passed 100 tests.
  3084. 294.35 s [vector] unstreamR ~= vunstream (exact): OK
  3085. 294.35 s [vector] +++ OK, passed 100 tests.
  3086. 294.35 s [vector] unstreamR ~= vunstream (unknown): OK
  3087. 294.35 s [vector] +++ OK, passed 100 tests.
  3088. 294.35 s [vector] Tests.Vector.Primitive
  3089. 294.35 s [vector] Int
  3090. 294.35 s [vector] fromList.toList == id: OK
  3091. 294.35 s [vector] +++ OK, passed 100 tests.
  3092. 294.35 s [vector] toList.fromList == id: OK
  3093. 294.35 s [vector] +++ OK, passed 100 tests.
  3094. 294.35 s [vector] unstream.stream == id: OK
  3095. 294.35 s [vector] +++ OK, passed 100 tests.
  3096. 294.35 s [vector] stream.unstream == id: OK
  3097. 294.35 s [vector] +++ OK, passed 100 tests.
  3098. 294.35 s [vector] eq: OK
  3099. 294.35 s [vector] +++ OK, passed 100 tests.
  3100. 294.35 s [vector] length: OK
  3101. 294.35 s [vector] +++ OK, passed 100 tests.
  3102. 294.35 s [vector] null: OK
  3103. 294.35 s [vector] +++ OK, passed 100 tests.
  3104. 294.35 s [vector] index: OK
  3105. 294.35 s [vector] +++ OK, passed 100 tests; 24 discarded.
  3106. 294.35 s [vector] safeIndex: OK
  3107. 294.35 s [vector] +++ OK, passed 100 tests.
  3108. 294.35 s [vector] head: OK
  3109. 294.35 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3110. 294.35 s [vector] last: OK
  3111. 294.35 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3112. 294.35 s [vector] unsafeIndex: OK
  3113. 294.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3114. 294.35 s [vector] unsafeHead: OK
  3115. 294.35 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3116. 294.35 s [vector] unsafeLast: OK
  3117. 294.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3118. 294.36 s [vector] slice: OK
  3119. 294.36 s [vector] +++ OK, passed 100 tests.
  3120. 294.36 s [vector] init: OK
  3121. 294.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3122. 294.36 s [vector] tail: OK
  3123. 294.36 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3124. 294.36 s [vector] take: OK
  3125. 294.36 s [vector] +++ OK, passed 100 tests.
  3126. 294.36 s [vector] drop: OK
  3127. 294.36 s [vector] +++ OK, passed 100 tests.
  3128. 294.36 s [vector] splitAt: OK
  3129. 294.36 s [vector] +++ OK, passed 100 tests.
  3130. 294.36 s [vector] empty: OK
  3131. 294.36 s [vector] +++ OK, passed 1 test.
  3132. 294.36 s [vector] singleton: OK
  3133. 294.36 s [vector] +++ OK, passed 100 tests.
  3134. 294.36 s [vector] replicate: OK
  3135. 294.36 s [vector] +++ OK, passed 100 tests.
  3136. 294.36 s [vector] generate: OK
  3137. 294.36 s [vector] +++ OK, passed 100 tests.
  3138. 294.36 s [vector] iterateN: OK
  3139. 294.38 s [vector] +++ OK, passed 100 tests.
  3140. 294.42 s [vector] iterateNM: OK (0.04s)
  3141. 294.42 s [vector] +++ OK, passed 100 tests.
  3142. 294.42 s [vector] generateM: OK (0.02s)
  3143. 294.42 s [vector] +++ OK, passed 100 tests.
  3144. 294.42 s [vector] replicateM: OK
  3145. 294.42 s [vector] +++ OK, passed 100 tests.
  3146. 294.42 s [vector] create: OK
  3147. 294.43 s [vector] +++ OK, passed 100 tests.
  3148. 294.43 s [vector] createT: OK
  3149. 294.43 s [vector] +++ OK, passed 100 tests.
  3150. 294.43 s [vector] unfoldr: OK
  3151. 294.43 s [vector] +++ OK, passed 100 tests.
  3152. 294.43 s [vector] unfoldrN: OK
  3153. 294.43 s [vector] +++ OK, passed 100 tests.
  3154. 294.43 s [vector] unfoldrExactN: OK
  3155. 294.43 s [vector] +++ OK, passed 100 tests.
  3156. 294.43 s [vector] unfoldrM: OK
  3157. 294.43 s [vector] +++ OK, passed 100 tests.
  3158. 294.44 s [vector] unfoldrNM: OK
  3159. 294.44 s [vector] +++ OK, passed 100 tests.
  3160. 294.48 s [vector] unfoldrExactNM: OK (0.03s)
  3161. 294.48 s [vector] +++ OK, passed 100 tests.
  3162. 294.48 s [vector] constructN: OK
  3163. 294.48 s [vector] +++ OK, passed 100 tests.
  3164. 294.49 s [vector] constructrN: OK
  3165. 294.49 s [vector] +++ OK, passed 100 tests.
  3166. 294.49 s [vector] cons: OK
  3167. 294.49 s [vector] +++ OK, passed 100 tests.
  3168. 294.49 s [vector] snoc: OK
  3169. 294.49 s [vector] +++ OK, passed 100 tests.
  3170. 294.50 s [vector] append: OK
  3171. 294.50 s [vector] +++ OK, passed 100 tests.
  3172. 294.51 s [vector] concat: OK (0.02s)
  3173. 294.51 s [vector] +++ OK, passed 100 tests.
  3174. 294.51 s [vector] force: OK
  3175. 294.51 s [vector] +++ OK, passed 100 tests.
  3176. 294.52 s [vector] upd: OK
  3177. 294.52 s [vector] +++ OK, passed 100 tests.
  3178. 294.52 s [vector] accum: OK
  3179. 294.52 s [vector] +++ OK, passed 100 tests.
  3180. 294.52 s [vector] reverse: OK
  3181. 294.52 s [vector] +++ OK, passed 100 tests.
  3182. 294.53 s [vector] backpermute: OK
  3183. 294.53 s [vector] +++ OK, passed 100 tests.
  3184. 294.53 s [vector] map: OK
  3185. 294.53 s [vector] +++ OK, passed 100 tests.
  3186. 294.53 s [vector] imap: OK
  3187. 294.53 s [vector] +++ OK, passed 100 tests.
  3188. 294.54 s [vector] concatMap: OK
  3189. 294.54 s [vector] +++ OK, passed 100 tests.
  3190. 294.54 s [vector] mapM: OK
  3191. 294.54 s [vector] +++ OK, passed 100 tests.
  3192. 294.56 s [vector] mapM_: OK (0.02s)
  3193. 294.56 s [vector] +++ OK, passed 100 tests.
  3194. 294.56 s [vector] forM: OK
  3195. 294.56 s [vector] +++ OK, passed 100 tests.
  3196. 294.58 s [vector] forM_: OK (0.02s)
  3197. 294.58 s [vector] +++ OK, passed 100 tests.
  3198. 294.58 s [vector] imapM: OK
  3199. 294.58 s [vector] +++ OK, passed 100 tests.
  3200. 294.60 s [vector] imapM_: OK (0.02s)
  3201. 294.60 s [vector] +++ OK, passed 100 tests.
  3202. 294.60 s [vector] zipWith: OK
  3203. 294.60 s [vector] +++ OK, passed 100 tests.
  3204. 294.61 s [vector] zipWith3: OK
  3205. 294.61 s [vector] +++ OK, passed 100 tests.
  3206. 294.61 s [vector] izipWith: OK
  3207. 294.61 s [vector] +++ OK, passed 100 tests.
  3208. 294.61 s [vector] izipWith3: OK
  3209. 294.61 s [vector] +++ OK, passed 100 tests.
  3210. 294.62 s [vector] izipWithM: OK
  3211. 294.62 s [vector] +++ OK, passed 100 tests.
  3212. 294.63 s [vector] izipWithM_: OK (0.01s)
  3213. 294.64 s [vector] +++ OK, passed 100 tests.
  3214. 294.64 s [vector] zipWithM: OK
  3215. 294.64 s [vector] +++ OK, passed 100 tests.
  3216. 294.64 s [vector] zipWithM_: OK (0.01s)
  3217. 294.64 s [vector] +++ OK, passed 100 tests.
  3218. 294.64 s [vector] filter: OK
  3219. 294.64 s [vector] +++ OK, passed 100 tests.
  3220. 294.65 s [vector] ifilter: OK
  3221. 294.66 s [vector] +++ OK, passed 100 tests.
  3222. 294.67 s [vector] filterM: OK (0.02s)
  3223. 294.67 s [vector] +++ OK, passed 100 tests.
  3224. 294.67 s [vector] uniq: OK
  3225. 294.67 s [vector] +++ OK, passed 100 tests.
  3226. 294.67 s [vector] mapMaybe: OK
  3227. 294.67 s [vector] +++ OK, passed 100 tests.
  3228. 294.67 s [vector] imapMaybe: OK
  3229. 294.67 s [vector] +++ OK, passed 100 tests.
  3230. 294.67 s [vector] takeWhile: OK
  3231. 294.68 s [vector] +++ OK, passed 100 tests.
  3232. 294.68 s [vector] dropWhile: OK
  3233. 294.68 s [vector] +++ OK, passed 100 tests.
  3234. 294.68 s [vector] partition: OK
  3235. 294.68 s [vector] +++ OK, passed 100 tests.
  3236. 294.68 s [vector] partitionWith: OK
  3237. 294.68 s [vector] +++ OK, passed 100 tests.
  3238. 294.68 s [vector] span: OK
  3239. 294.68 s [vector] +++ OK, passed 100 tests.
  3240. 294.68 s [vector] break: OK
  3241. 294.68 s [vector] +++ OK, passed 100 tests.
  3242. 294.68 s [vector] spanR: OK
  3243. 294.69 s [vector] +++ OK, passed 100 tests.
  3244. 294.69 s [vector] breakR: OK
  3245. 294.69 s [vector] +++ OK, passed 100 tests.
  3246. 294.69 s [vector] groupBy: OK
  3247. 294.69 s [vector] +++ OK, passed 100 tests.
  3248. 294.69 s [vector] elem: OK
  3249. 294.69 s [vector] +++ OK, passed 100 tests.
  3250. 294.69 s [vector] notElem: OK
  3251. 294.69 s [vector] +++ OK, passed 100 tests.
  3252. 294.69 s [vector] find: OK
  3253. 294.69 s [vector] +++ OK, passed 100 tests.
  3254. 294.69 s [vector] findIndex: OK
  3255. 294.69 s [vector] +++ OK, passed 100 tests.
  3256. 294.69 s [vector] findIndexR: OK
  3257. 294.69 s [vector] +++ OK, passed 100 tests.
  3258. 294.69 s [vector] findIndices: OK
  3259. 294.69 s [vector] +++ OK, passed 100 tests.
  3260. 294.69 s [vector] elemIndex: OK
  3261. 294.69 s [vector] +++ OK, passed 100 tests.
  3262. 294.69 s [vector] elemIndices: OK
  3263. 294.69 s [vector] +++ OK, passed 100 tests.
  3264. 294.70 s [vector] foldl: OK
  3265. 294.70 s [vector] +++ OK, passed 100 tests.
  3266. 294.70 s [vector] foldl1: OK
  3267. 294.70 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3268. 294.70 s [vector] foldl': OK
  3269. 294.70 s [vector] +++ OK, passed 100 tests.
  3270. 294.71 s [vector] foldl1': OK
  3271. 294.71 s [vector] +++ OK, passed 100 tests; 22 discarded.
  3272. 294.71 s [vector] foldr: OK
  3273. 294.71 s [vector] +++ OK, passed 100 tests.
  3274. 294.71 s [vector] foldr1: OK
  3275. 294.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3276. 294.72 s [vector] foldr': OK
  3277. 294.72 s [vector] +++ OK, passed 100 tests.
  3278. 294.72 s [vector] foldr1': OK
  3279. 294.72 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3280. 294.73 s [vector] ifoldl: OK
  3281. 294.73 s [vector] +++ OK, passed 100 tests.
  3282. 294.73 s [vector] ifoldl': OK
  3283. 294.73 s [vector] +++ OK, passed 100 tests.
  3284. 294.73 s [vector] ifoldr: OK
  3285. 294.73 s [vector] +++ OK, passed 100 tests.
  3286. 294.73 s [vector] ifoldr': OK
  3287. 294.73 s [vector] +++ OK, passed 100 tests.
  3288. 294.73 s [vector] ifoldM: OK
  3289. 294.73 s [vector] +++ OK, passed 100 tests.
  3290. 294.73 s [vector] ifoldM': OK
  3291. 294.73 s [vector] +++ OK, passed 100 tests.
  3292. 294.76 s [vector] ifoldM_: OK (0.02s)
  3293. 294.76 s [vector] +++ OK, passed 100 tests.
  3294. 294.77 s [vector] ifoldM'_: OK (0.02s)
  3295. 294.77 s [vector] +++ OK, passed 100 tests.
  3296. 294.77 s [vector] all: OK
  3297. 294.77 s [vector] +++ OK, passed 100 tests.
  3298. 294.77 s [vector] any: OK
  3299. 294.77 s [vector] +++ OK, passed 100 tests.
  3300. 294.77 s [vector] prescanl: OK
  3301. 294.77 s [vector] +++ OK, passed 100 tests.
  3302. 294.78 s [vector] prescanl': OK
  3303. 294.78 s [vector] +++ OK, passed 100 tests.
  3304. 294.78 s [vector] postscanl: OK
  3305. 294.78 s [vector] +++ OK, passed 100 tests.
  3306. 294.78 s [vector] postscanl': OK
  3307. 294.78 s [vector] +++ OK, passed 100 tests.
  3308. 294.79 s [vector] scanl: OK
  3309. 294.79 s [vector] +++ OK, passed 100 tests.
  3310. 294.79 s [vector] scanl': OK
  3311. 294.79 s [vector] +++ OK, passed 100 tests.
  3312. 294.79 s [vector] scanl1: OK
  3313. 294.80 s [vector] +++ OK, passed 100 tests.
  3314. 294.80 s [vector] scanl1': OK
  3315. 294.80 s [vector] +++ OK, passed 100 tests.
  3316. 294.80 s [vector] iscanl: OK
  3317. 294.80 s [vector] +++ OK, passed 100 tests.
  3318. 294.80 s [vector] iscanl': OK
  3319. 294.80 s [vector] +++ OK, passed 100 tests.
  3320. 294.80 s [vector] prescanr: OK
  3321. 294.80 s [vector] +++ OK, passed 100 tests.
  3322. 294.81 s [vector] prescanr': OK
  3323. 294.81 s [vector] +++ OK, passed 100 tests.
  3324. 294.81 s [vector] postscanr: OK
  3325. 294.81 s [vector] +++ OK, passed 100 tests.
  3326. 294.82 s [vector] postscanr': OK
  3327. 294.82 s [vector] +++ OK, passed 100 tests.
  3328. 294.82 s [vector] scanr: OK
  3329. 294.82 s [vector] +++ OK, passed 100 tests.
  3330. 294.82 s [vector] scanr': OK
  3331. 294.82 s [vector] +++ OK, passed 100 tests.
  3332. 294.82 s [vector] scanr1: OK
  3333. 294.82 s [vector] +++ OK, passed 100 tests.
  3334. 294.83 s [vector] scanr1': OK
  3335. 294.83 s [vector] +++ OK, passed 100 tests.
  3336. 294.83 s [vector] iscanr: OK
  3337. 294.83 s [vector] +++ OK, passed 100 tests.
  3338. 294.83 s [vector] iscanr': OK
  3339. 294.83 s [vector] +++ OK, passed 100 tests.
  3340. 294.83 s [vector] mut_read: OK
  3341. 294.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3342. 294.83 s [vector] mut_write: OK
  3343. 294.83 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3344. 294.83 s [vector] mut_modify: OK
  3345. 294.83 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3346. 294.84 s [vector] mut_generate: OK
  3347. 294.84 s [vector] +++ OK, passed 100 tests.
  3348. 294.86 s [vector] mut_generateM: OK (0.01s)
  3349. 294.86 s [vector] +++ OK, passed 100 tests.
  3350. 294.88 s [vector] mut_mapM_: OK (0.01s)
  3351. 294.88 s [vector] +++ OK, passed 100 tests.
  3352. 294.88 s [vector] mut_imapM_: OK (0.01s)
  3353. 294.88 s [vector] +++ OK, passed 100 tests.
  3354. 294.90 s [vector] mut_forM_: OK (0.02s)
  3355. 294.90 s [vector] +++ OK, passed 100 tests.
  3356. 294.91 s [vector] mut_iforM_: OK (0.02s)
  3357. 294.92 s [vector] +++ OK, passed 100 tests.
  3358. 294.92 s [vector] mut_foldr: OK
  3359. 294.92 s [vector] +++ OK, passed 100 tests.
  3360. 294.92 s [vector] mut_foldr': OK
  3361. 294.92 s [vector] +++ OK, passed 100 tests.
  3362. 294.92 s [vector] mut_foldl: OK
  3363. 294.92 s [vector] +++ OK, passed 100 tests.
  3364. 294.92 s [vector] mut_foldl': OK
  3365. 294.92 s [vector] +++ OK, passed 100 tests.
  3366. 294.93 s [vector] mut_ifoldr: OK
  3367. 294.93 s [vector] +++ OK, passed 100 tests.
  3368. 294.93 s [vector] mut_ifoldr': OK
  3369. 294.94 s [vector] +++ OK, passed 100 tests.
  3370. 294.94 s [vector] mut_ifoldl: OK
  3371. 294.94 s [vector] +++ OK, passed 100 tests.
  3372. 294.94 s [vector] mut_ifoldl': OK
  3373. 294.94 s [vector] +++ OK, passed 100 tests.
  3374. 294.94 s [vector] mut_foldM: OK
  3375. 294.94 s [vector] +++ OK, passed 100 tests.
  3376. 294.94 s [vector] mut_foldM': OK
  3377. 294.95 s [vector] +++ OK, passed 100 tests.
  3378. 294.95 s [vector] mut_foldrM: OK
  3379. 294.95 s [vector] +++ OK, passed 100 tests.
  3380. 294.95 s [vector] mut_foldrM': OK
  3381. 294.95 s [vector] +++ OK, passed 100 tests.
  3382. 294.96 s [vector] mut_ifoldM: OK
  3383. 294.96 s [vector] +++ OK, passed 100 tests.
  3384. 294.96 s [vector] mut_ifoldM': OK
  3385. 294.96 s [vector] +++ OK, passed 100 tests.
  3386. 294.96 s [vector] mut_ifoldrM: OK
  3387. 294.96 s [vector] +++ OK, passed 100 tests.
  3388. 294.96 s [vector] mut_ifoldrM': OK
  3389. 294.96 s [vector] +++ OK, passed 100 tests.
  3390. 294.96 s [vector] compare: OK
  3391. 294.96 s [vector] +++ OK, passed 100 tests.
  3392. 294.96 s [vector] maximum: OK
  3393. 294.96 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3394. 294.96 s [vector] minimum: OK
  3395. 294.96 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3396. 294.96 s [vector] minIndex: OK
  3397. 294.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3398. 294.97 s [vector] maxIndex: OK
  3399. 294.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3400. 294.97 s [vector] maximumBy: OK
  3401. 294.97 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3402. 294.97 s [vector] minimumBy: OK
  3403. 294.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3404. 294.97 s [vector] maximumOn: OK
  3405. 294.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3406. 294.97 s [vector] minimumOn: OK
  3407. 294.97 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3408. 294.97 s [vector] maxIndexBy: OK
  3409. 294.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3410. 294.97 s [vector] minIndexBy: OK
  3411. 294.97 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3412. 294.97 s [vector] ListFirstMaxIndexWins: OK
  3413. 294.97 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3414. 294.97 s [vector] FalseListFirstMaxIndexWins: OK
  3415. 294.97 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  3416. 294.97 s [vector] []
  3417. 294.98 s [vector] mempty: OK
  3418. 294.98 s [vector] +++ OK, passed 1 test.
  3419. 294.98 s [vector] mappend: OK
  3420. 294.98 s [vector] +++ OK, passed 100 tests.
  3421. 294.99 s [vector] mconcat: OK (0.02s)
  3422. 294.99 s [vector] +++ OK, passed 100 tests.
  3423. 294.99 s [vector] glength: OK
  3424. 294.99 s [vector] +++ OK, passed 100 tests.
  3425. 294.99 s [vector] sum: OK
  3426. 294.99 s [vector] +++ OK, passed 100 tests.
  3427. 294.99 s [vector] product: OK
  3428. 294.99 s [vector] +++ OK, passed 100 tests.
  3429. 294.99 s [vector] enumFromN: OK
  3430. 294.99 s [vector] +++ OK, passed 100 tests.
  3431. 294.99 s [vector] enumFromThenN: OK
  3432. 294.99 s [vector] +++ OK, passed 100 tests.
  3433. 294.99 s [vector] enumFromTo: OK
  3434. 294.99 s [vector] +++ OK, passed 100 tests.
  3435. 294.99 s [vector] enumFromThenTo: OK
  3436. 294.99 s [vector] +++ OK, passed 100 tests; 11 discarded.
  3437. 295.00 s [vector] Double
  3438. 295.00 s [vector] fromList.toList == id: OK
  3439. 295.00 s [vector] +++ OK, passed 100 tests.
  3440. 295.00 s [vector] toList.fromList == id: OK
  3441. 295.00 s [vector] +++ OK, passed 100 tests.
  3442. 295.00 s [vector] unstream.stream == id: OK
  3443. 295.00 s [vector] +++ OK, passed 100 tests.
  3444. 295.00 s [vector] stream.unstream == id: OK
  3445. 295.00 s [vector] +++ OK, passed 100 tests.
  3446. 295.00 s [vector] eq: OK
  3447. 295.00 s [vector] +++ OK, passed 100 tests.
  3448. 295.00 s [vector] length: OK
  3449. 295.00 s [vector] +++ OK, passed 100 tests.
  3450. 295.00 s [vector] null: OK
  3451. 295.00 s [vector] +++ OK, passed 100 tests.
  3452. 295.00 s [vector] index: OK
  3453. 295.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3454. 295.00 s [vector] safeIndex: OK
  3455. 295.00 s [vector] +++ OK, passed 100 tests.
  3456. 295.00 s [vector] head: OK
  3457. 295.00 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3458. 295.00 s [vector] last: OK
  3459. 295.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3460. 295.00 s [vector] unsafeIndex: OK
  3461. 295.00 s [vector] +++ OK, passed 100 tests; 22 discarded.
  3462. 295.01 s [vector] unsafeHead: OK
  3463. 295.01 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3464. 295.01 s [vector] unsafeLast: OK
  3465. 295.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3466. 295.01 s [vector] slice: OK
  3467. 295.01 s [vector] +++ OK, passed 100 tests.
  3468. 295.01 s [vector] init: OK
  3469. 295.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3470. 295.01 s [vector] tail: OK
  3471. 295.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3472. 295.01 s [vector] take: OK
  3473. 295.01 s [vector] +++ OK, passed 100 tests.
  3474. 295.01 s [vector] drop: OK
  3475. 295.01 s [vector] +++ OK, passed 100 tests.
  3476. 295.01 s [vector] splitAt: OK
  3477. 295.01 s [vector] +++ OK, passed 100 tests.
  3478. 295.01 s [vector] empty: OK
  3479. 295.01 s [vector] +++ OK, passed 1 test.
  3480. 295.01 s [vector] singleton: OK
  3481. 295.01 s [vector] +++ OK, passed 100 tests.
  3482. 295.01 s [vector] replicate: OK
  3483. 295.01 s [vector] +++ OK, passed 100 tests.
  3484. 295.01 s [vector] generate: OK
  3485. 295.02 s [vector] +++ OK, passed 100 tests.
  3486. 295.04 s [vector] iterateN: OK
  3487. 295.04 s [vector] +++ OK, passed 100 tests.
  3488. 295.06 s [vector] iterateNM: OK (0.02s)
  3489. 295.06 s [vector] +++ OK, passed 100 tests.
  3490. 295.08 s [vector] generateM: OK (0.03s)
  3491. 295.08 s [vector] +++ OK, passed 100 tests.
  3492. 295.09 s [vector] replicateM: OK (0.01s)
  3493. 295.09 s [vector] +++ OK, passed 100 tests.
  3494. 295.09 s [vector] create: OK
  3495. 295.09 s [vector] +++ OK, passed 100 tests.
  3496. 295.09 s [vector] createT: OK
  3497. 295.09 s [vector] +++ OK, passed 100 tests.
  3498. 295.09 s [vector] unfoldr: OK
  3499. 295.09 s [vector] +++ OK, passed 100 tests.
  3500. 295.09 s [vector] unfoldrN: OK
  3501. 295.09 s [vector] +++ OK, passed 100 tests.
  3502. 295.09 s [vector] unfoldrExactN: OK
  3503. 295.09 s [vector] +++ OK, passed 100 tests.
  3504. 295.10 s [vector] unfoldrM: OK
  3505. 295.10 s [vector] +++ OK, passed 100 tests.
  3506. 295.10 s [vector] unfoldrNM: OK
  3507. 295.10 s [vector] +++ OK, passed 100 tests.
  3508. 295.16 s [vector] unfoldrExactNM: OK (0.05s)
  3509. 295.16 s [vector] +++ OK, passed 100 tests.
  3510. 295.16 s [vector] constructN: OK (0.01s)
  3511. 295.16 s [vector] +++ OK, passed 100 tests.
  3512. 295.17 s [vector] constructrN: OK
  3513. 295.17 s [vector] +++ OK, passed 100 tests.
  3514. 295.17 s [vector] cons: OK
  3515. 295.17 s [vector] +++ OK, passed 100 tests.
  3516. 295.18 s [vector] snoc: OK
  3517. 295.18 s [vector] +++ OK, passed 100 tests.
  3518. 295.18 s [vector] append: OK
  3519. 295.18 s [vector] +++ OK, passed 100 tests.
  3520. 295.20 s [vector] concat: OK (0.02s)
  3521. 295.20 s [vector] +++ OK, passed 100 tests.
  3522. 295.20 s [vector] force: OK
  3523. 295.20 s [vector] +++ OK, passed 100 tests.
  3524. 295.22 s [vector] upd: OK
  3525. 295.22 s [vector] +++ OK, passed 100 tests.
  3526. 295.22 s [vector] accum: OK (0.02s)
  3527. 295.22 s [vector] +++ OK, passed 100 tests.
  3528. 295.22 s [vector] reverse: OK
  3529. 295.23 s [vector] +++ OK, passed 100 tests.
  3530. 295.24 s [vector] backpermute: OK
  3531. 295.24 s [vector] +++ OK, passed 100 tests.
  3532. 295.25 s [vector] map: OK
  3533. 295.25 s [vector] +++ OK, passed 100 tests.
  3534. 295.25 s [vector] imap: OK
  3535. 295.25 s [vector] +++ OK, passed 100 tests.
  3536. 295.25 s [vector] concatMap: OK
  3537. 295.25 s [vector] +++ OK, passed 100 tests.
  3538. 295.26 s [vector] mapM: OK
  3539. 295.26 s [vector] +++ OK, passed 100 tests.
  3540. 295.29 s [vector] mapM_: OK (0.03s)
  3541. 295.30 s [vector] +++ OK, passed 100 tests.
  3542. 295.30 s [vector] forM: OK
  3543. 295.30 s [vector] +++ OK, passed 100 tests.
  3544. 295.33 s [vector] forM_: OK (0.03s)
  3545. 295.33 s [vector] +++ OK, passed 100 tests.
  3546. 295.34 s [vector] imapM: OK
  3547. 295.34 s [vector] +++ OK, passed 100 tests.
  3548. 295.38 s [vector] imapM_: OK (0.04s)
  3549. 295.38 s [vector] +++ OK, passed 100 tests.
  3550. 295.38 s [vector] zipWith: OK
  3551. 295.38 s [vector] +++ OK, passed 100 tests.
  3552. 295.40 s [vector] zipWith3: OK (0.01s)
  3553. 295.40 s [vector] +++ OK, passed 100 tests.
  3554. 295.40 s [vector] izipWith: OK
  3555. 295.40 s [vector] +++ OK, passed 100 tests.
  3556. 295.41 s [vector] izipWith3: OK
  3557. 295.41 s [vector] +++ OK, passed 100 tests.
  3558. 295.44 s [vector] izipWithM: OK
  3559. 295.44 s [vector] +++ OK, passed 100 tests.
  3560. 295.46 s [vector] izipWithM_: OK (0.03s)
  3561. 295.46 s [vector] +++ OK, passed 100 tests.
  3562. 295.46 s [vector] zipWithM: OK
  3563. 295.46 s [vector] +++ OK, passed 100 tests.
  3564. 295.50 s [vector] zipWithM_: OK (0.03s)
  3565. 295.50 s [vector] +++ OK, passed 100 tests.
  3566. 295.50 s [vector] filter: OK
  3567. 295.51 s [vector] +++ OK, passed 100 tests.
  3568. 295.52 s [vector] ifilter: OK (0.01s)
  3569. 295.52 s [vector] +++ OK, passed 100 tests.
  3570. 295.55 s [vector] filterM: OK (0.04s)
  3571. 295.55 s [vector] +++ OK, passed 100 tests.
  3572. 295.55 s [vector] uniq: OK
  3573. 295.56 s [vector] +++ OK, passed 100 tests.
  3574. 295.57 s [vector] mapMaybe: OK
  3575. 295.57 s [vector] +++ OK, passed 100 tests.
  3576. 295.57 s [vector] imapMaybe: OK
  3577. 295.57 s [vector] +++ OK, passed 100 tests.
  3578. 295.57 s [vector] takeWhile: OK
  3579. 295.57 s [vector] +++ OK, passed 100 tests.
  3580. 295.58 s [vector] dropWhile: OK
  3581. 295.58 s [vector] +++ OK, passed 100 tests.
  3582. 295.59 s [vector] partition: OK
  3583. 295.59 s [vector] +++ OK, passed 100 tests.
  3584. 295.59 s [vector] partitionWith: OK
  3585. 295.59 s [vector] +++ OK, passed 100 tests.
  3586. 295.59 s [vector] span: OK
  3587. 295.59 s [vector] +++ OK, passed 100 tests.
  3588. 295.59 s [vector] break: OK
  3589. 295.59 s [vector] +++ OK, passed 100 tests.
  3590. 295.59 s [vector] spanR: OK
  3591. 295.59 s [vector] +++ OK, passed 100 tests.
  3592. 295.59 s [vector] breakR: OK
  3593. 295.59 s [vector] +++ OK, passed 100 tests.
  3594. 295.60 s [vector] groupBy: OK
  3595. 295.60 s [vector] +++ OK, passed 100 tests.
  3596. 295.60 s [vector] elem: OK
  3597. 295.60 s [vector] +++ OK, passed 100 tests.
  3598. 295.60 s [vector] notElem: OK
  3599. 295.60 s [vector] +++ OK, passed 100 tests.
  3600. 295.60 s [vector] find: OK
  3601. 295.60 s [vector] +++ OK, passed 100 tests.
  3602. 295.60 s [vector] findIndex: OK
  3603. 295.61 s [vector] +++ OK, passed 100 tests.
  3604. 295.61 s [vector] findIndexR: OK
  3605. 295.61 s [vector] +++ OK, passed 100 tests.
  3606. 295.61 s [vector] findIndices: OK
  3607. 295.61 s [vector] +++ OK, passed 100 tests.
  3608. 295.61 s [vector] elemIndex: OK
  3609. 295.61 s [vector] +++ OK, passed 100 tests.
  3610. 295.62 s [vector] elemIndices: OK
  3611. 295.62 s [vector] +++ OK, passed 100 tests.
  3612. 295.64 s [vector] foldl: OK (0.01s)
  3613. 295.64 s [vector] +++ OK, passed 100 tests.
  3614. 295.64 s [vector] foldl1: OK (0.01s)
  3615. 295.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3616. 295.66 s [vector] foldl': OK (0.01s)
  3617. 295.66 s [vector] +++ OK, passed 100 tests.
  3618. 295.68 s [vector] foldl1': OK (0.01s)
  3619. 295.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3620. 295.68 s [vector] foldr: OK (0.01s)
  3621. 295.68 s [vector] +++ OK, passed 100 tests.
  3622. 295.69 s [vector] foldr1: OK (0.01s)
  3623. 295.69 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3624. 295.70 s [vector] foldr': OK (0.01s)
  3625. 295.70 s [vector] +++ OK, passed 100 tests.
  3626. 295.72 s [vector] foldr1': OK (0.01s)
  3627. 295.72 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3628. 295.73 s [vector] ifoldl: OK (0.01s)
  3629. 295.74 s [vector] +++ OK, passed 100 tests.
  3630. 295.74 s [vector] ifoldl': OK (0.01s)
  3631. 295.74 s [vector] +++ OK, passed 100 tests.
  3632. 295.76 s [vector] ifoldr: OK (0.01s)
  3633. 295.76 s [vector] +++ OK, passed 100 tests.
  3634. 295.76 s [vector] ifoldr': OK (0.01s)
  3635. 295.76 s [vector] +++ OK, passed 100 tests.
  3636. 295.78 s [vector] ifoldM: OK (0.01s)
  3637. 295.78 s [vector] +++ OK, passed 100 tests.
  3638. 295.80 s [vector] ifoldM': OK (0.01s)
  3639. 295.80 s [vector] +++ OK, passed 100 tests.
  3640. 295.82 s [vector] ifoldM_: OK (0.04s)
  3641. 295.82 s [vector] +++ OK, passed 100 tests.
  3642. 295.86 s [vector] ifoldM'_: OK (0.04s)
  3643. 295.86 s [vector] +++ OK, passed 100 tests.
  3644. 295.86 s [vector] all: OK
  3645. 295.86 s [vector] +++ OK, passed 100 tests.
  3646. 295.86 s [vector] any: OK
  3647. 295.86 s [vector] +++ OK, passed 100 tests.
  3648. 295.88 s [vector] prescanl: OK (0.01s)
  3649. 295.88 s [vector] +++ OK, passed 100 tests.
  3650. 295.89 s [vector] prescanl': OK (0.01s)
  3651. 295.89 s [vector] +++ OK, passed 100 tests.
  3652. 295.89 s [vector] postscanl: OK (0.01s)
  3653. 295.89 s [vector] +++ OK, passed 100 tests.
  3654. 295.92 s [vector] postscanl': OK (0.01s)
  3655. 295.92 s [vector] +++ OK, passed 100 tests.
  3656. 295.92 s [vector] scanl: OK (0.01s)
  3657. 295.92 s [vector] +++ OK, passed 100 tests.
  3658. 295.94 s [vector] scanl': OK (0.01s)
  3659. 295.94 s [vector] +++ OK, passed 100 tests.
  3660. 295.95 s [vector] scanl1: OK (0.01s)
  3661. 295.95 s [vector] +++ OK, passed 100 tests.
  3662. 295.96 s [vector] scanl1': OK (0.01s)
  3663. 295.96 s [vector] +++ OK, passed 100 tests.
  3664. 295.97 s [vector] iscanl: OK (0.01s)
  3665. 295.97 s [vector] +++ OK, passed 100 tests.
  3666. 295.97 s [vector] iscanl': OK (0.01s)
  3667. 295.97 s [vector] +++ OK, passed 100 tests.
  3668. 295.99 s [vector] prescanr: OK (0.01s)
  3669. 295.99 s [vector] +++ OK, passed 100 tests.
  3670. 295.99 s [vector] prescanr': OK (0.01s)
  3671. 295.99 s [vector] +++ OK, passed 100 tests.
  3672. 296.01 s [vector] postscanr: OK (0.01s)
  3673. 296.02 s [vector] +++ OK, passed 100 tests.
  3674. 296.02 s [vector] postscanr': OK
  3675. 296.02 s [vector] +++ OK, passed 100 tests.
  3676. 296.04 s [vector] scanr: OK (0.01s)
  3677. 296.04 s [vector] +++ OK, passed 100 tests.
  3678. 296.04 s [vector] scanr': OK (0.01s)
  3679. 296.04 s [vector] +++ OK, passed 100 tests.
  3680. 296.06 s [vector] scanr1: OK (0.01s)
  3681. 296.06 s [vector] +++ OK, passed 100 tests.
  3682. 296.06 s [vector] scanr1': OK (0.01s)
  3683. 296.06 s [vector] +++ OK, passed 100 tests.
  3684. 296.08 s [vector] iscanr: OK (0.01s)
  3685. 296.08 s [vector] +++ OK, passed 100 tests.
  3686. 296.08 s [vector] iscanr': OK (0.01s)
  3687. 296.08 s [vector] +++ OK, passed 100 tests.
  3688. 296.08 s [vector] mut_read: OK
  3689. 296.08 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3690. 296.09 s [vector] mut_write: OK
  3691. 296.09 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3692. 296.09 s [vector] mut_modify: OK
  3693. 296.09 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3694. 296.10 s [vector] mut_generate: OK
  3695. 296.10 s [vector] +++ OK, passed 100 tests.
  3696. 296.12 s [vector] mut_generateM: OK (0.02s)
  3697. 296.12 s [vector] +++ OK, passed 100 tests.
  3698. 296.16 s [vector] mut_mapM_: OK (0.03s)
  3699. 296.16 s [vector] +++ OK, passed 100 tests.
  3700. 296.18 s [vector] mut_imapM_: OK (0.03s)
  3701. 296.18 s [vector] +++ OK, passed 100 tests.
  3702. 296.22 s [vector] mut_forM_: OK (0.03s)
  3703. 296.22 s [vector] +++ OK, passed 100 tests.
  3704. 296.26 s [vector] mut_iforM_: OK (0.04s)
  3705. 296.26 s [vector] +++ OK, passed 100 tests.
  3706. 296.26 s [vector] mut_foldr: OK (0.01s)
  3707. 296.26 s [vector] +++ OK, passed 100 tests.
  3708. 296.28 s [vector] mut_foldr': OK (0.02s)
  3709. 296.28 s [vector] +++ OK, passed 100 tests.
  3710. 296.34 s [vector] mut_foldl: OK (0.03s)
  3711. 296.34 s [vector] +++ OK, passed 100 tests.
  3712. 296.34 s [vector] mut_foldl': OK (0.02s)
  3713. 296.34 s [vector] +++ OK, passed 100 tests.
  3714. 296.35 s [vector] mut_ifoldr: OK (0.03s)
  3715. 296.35 s [vector] +++ OK, passed 100 tests.
  3716. 296.38 s [vector] mut_ifoldr': OK (0.02s)
  3717. 296.38 s [vector] +++ OK, passed 100 tests.
  3718. 296.40 s [vector] mut_ifoldl: OK (0.02s)
  3719. 296.40 s [vector] +++ OK, passed 100 tests.
  3720. 296.42 s [vector] mut_ifoldl': OK (0.02s)
  3721. 296.42 s [vector] +++ OK, passed 100 tests.
  3722. 296.44 s [vector] mut_foldM: OK (0.02s)
  3723. 296.44 s [vector] +++ OK, passed 100 tests.
  3724. 296.46 s [vector] mut_foldM': OK (0.01s)
  3725. 296.46 s [vector] +++ OK, passed 100 tests.
  3726. 296.46 s [vector] mut_foldrM: OK (0.02s)
  3727. 296.46 s [vector] +++ OK, passed 100 tests.
  3728. 296.48 s [vector] mut_foldrM': OK (0.02s)
  3729. 296.48 s [vector] +++ OK, passed 100 tests.
  3730. 296.50 s [vector] mut_ifoldM: OK (0.01s)
  3731. 296.50 s [vector] +++ OK, passed 100 tests.
  3732. 296.52 s [vector] mut_ifoldM': OK (0.02s)
  3733. 296.52 s [vector] +++ OK, passed 100 tests.
  3734. 296.54 s [vector] mut_ifoldrM: OK (0.02s)
  3735. 296.54 s [vector] +++ OK, passed 100 tests.
  3736. 296.54 s [vector] mut_ifoldrM': OK (0.02s)
  3737. 296.54 s [vector] +++ OK, passed 100 tests.
  3738. 296.54 s [vector] compare: OK
  3739. 296.54 s [vector] +++ OK, passed 100 tests.
  3740. 296.54 s [vector] maximum: OK
  3741. 296.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3742. 296.54 s [vector] minimum: OK
  3743. 296.54 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3744. 296.54 s [vector] minIndex: OK
  3745. 296.54 s [vector] +++ OK, passed 100 tests; 22 discarded.
  3746. 296.54 s [vector] maxIndex: OK
  3747. 296.54 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3748. 296.54 s [vector] maximumBy: OK
  3749. 296.54 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3750. 296.54 s [vector] minimumBy: OK
  3751. 296.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3752. 296.54 s [vector] maximumOn: OK
  3753. 296.54 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3754. 296.54 s [vector] minimumOn: OK
  3755. 296.54 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3756. 296.55 s [vector] maxIndexBy: OK
  3757. 296.55 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3758. 296.55 s [vector] minIndexBy: OK
  3759. 296.55 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3760. 296.55 s [vector] ListFirstMaxIndexWins: OK
  3761. 296.55 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3762. 296.55 s [vector] FalseListFirstMaxIndexWins: OK
  3763. 296.55 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  3764. 296.55 s [vector] []
  3765. 296.55 s [vector] mempty: OK
  3766. 296.55 s [vector] +++ OK, passed 1 test.
  3767. 296.56 s [vector] mappend: OK
  3768. 296.56 s [vector] +++ OK, passed 100 tests.
  3769. 296.58 s [vector] mconcat: OK (0.03s)
  3770. 296.58 s [vector] +++ OK, passed 100 tests.
  3771. 296.58 s [vector] glength: OK
  3772. 296.58 s [vector] +++ OK, passed 100 tests.
  3773. 296.58 s [vector] sum: OK
  3774. 296.59 s [vector] +++ OK, passed 100 tests.
  3775. 296.59 s [vector] product: OK
  3776. 296.59 s [vector] +++ OK, passed 100 tests.
  3777. 296.59 s [vector] enumFromN: OK
  3778. 296.59 s [vector] +++ OK, passed 100 tests.
  3779. 296.59 s [vector] enumFromThenN: OK
  3780. 296.59 s [vector] +++ OK, passed 100 tests.
  3781. 296.59 s [vector] enumFromTo: OK
  3782. 296.59 s [vector] +++ OK, passed 100 tests.
  3783. 296.59 s [vector] enumFromThenTo: OK
  3784. 296.59 s [vector] +++ OK, passed 100 tests; 4 discarded.
  3785. 296.59 s [vector] unstream
  3786. 296.59 s [vector] unstream == vunstream (exact): OK
  3787. 296.59 s [vector] +++ OK, passed 100 tests.
  3788. 296.59 s [vector] unstream == vunstream (unknown): OK
  3789. 296.59 s [vector] +++ OK, passed 100 tests.
  3790. 296.60 s [vector] unstreamR ~= vunstream (exact): OK
  3791. 296.60 s [vector] +++ OK, passed 100 tests.
  3792. 296.60 s [vector] unstreamR ~= vunstream (unknown): OK
  3793. 296.60 s [vector] +++ OK, passed 100 tests.
  3794. 296.60 s [vector] Tests.Vector.Storable
  3795. 296.60 s [vector] Data.Vector.Storable.Vector (Int)
  3796. 296.60 s [vector] fromList.toList == id: OK
  3797. 296.60 s [vector] +++ OK, passed 100 tests.
  3798. 296.60 s [vector] toList.fromList == id: OK
  3799. 296.60 s [vector] +++ OK, passed 100 tests.
  3800. 296.60 s [vector] unstream.stream == id: OK
  3801. 296.60 s [vector] +++ OK, passed 100 tests.
  3802. 296.60 s [vector] stream.unstream == id: OK
  3803. 296.60 s [vector] +++ OK, passed 100 tests.
  3804. 296.60 s [vector] eq: OK
  3805. 296.60 s [vector] +++ OK, passed 100 tests.
  3806. 296.60 s [vector] length: OK
  3807. 296.60 s [vector] +++ OK, passed 100 tests.
  3808. 296.60 s [vector] null: OK
  3809. 296.60 s [vector] +++ OK, passed 100 tests.
  3810. 296.60 s [vector] index: OK
  3811. 296.62 s [vector] +++ OK, passed 100 tests; 22 discarded.
  3812. 296.62 s [vector] safeIndex: OK
  3813. 296.62 s [vector] +++ OK, passed 100 tests.
  3814. 296.62 s [vector] head: OK
  3815. 296.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3816. 296.62 s [vector] last: OK
  3817. 296.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3818. 296.62 s [vector] unsafeIndex: OK
  3819. 296.62 s [vector] +++ OK, passed 100 tests; 21 discarded.
  3820. 296.62 s [vector] unsafeHead: OK
  3821. 296.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3822. 296.62 s [vector] unsafeLast: OK
  3823. 296.62 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3824. 296.62 s [vector] slice: OK
  3825. 296.62 s [vector] +++ OK, passed 100 tests.
  3826. 296.62 s [vector] init: OK
  3827. 296.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3828. 296.62 s [vector] tail: OK
  3829. 296.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3830. 296.62 s [vector] take: OK
  3831. 296.62 s [vector] +++ OK, passed 100 tests.
  3832. 296.62 s [vector] drop: OK
  3833. 296.62 s [vector] +++ OK, passed 100 tests.
  3834. 296.62 s [vector] splitAt: OK
  3835. 296.62 s [vector] +++ OK, passed 100 tests.
  3836. 296.62 s [vector] empty: OK
  3837. 296.62 s [vector] +++ OK, passed 1 test.
  3838. 296.62 s [vector] singleton: OK
  3839. 296.62 s [vector] +++ OK, passed 100 tests.
  3840. 296.62 s [vector] replicate: OK
  3841. 296.62 s [vector] +++ OK, passed 100 tests.
  3842. 296.63 s [vector] generate: OK
  3843. 296.63 s [vector] +++ OK, passed 100 tests.
  3844. 296.63 s [vector] iterateN: OK
  3845. 296.63 s [vector] +++ OK, passed 100 tests.
  3846. 296.66 s [vector] iterateNM: OK (0.03s)
  3847. 296.66 s [vector] +++ OK, passed 100 tests.
  3848. 296.66 s [vector] generateM: OK (0.02s)
  3849. 296.66 s [vector] +++ OK, passed 100 tests.
  3850. 296.68 s [vector] replicateM: OK (0.02s)
  3851. 296.68 s [vector] +++ OK, passed 100 tests.
  3852. 296.68 s [vector] create: OK
  3853. 296.68 s [vector] +++ OK, passed 100 tests.
  3854. 296.68 s [vector] createT: OK
  3855. 296.68 s [vector] +++ OK, passed 100 tests.
  3856. 296.68 s [vector] unfoldr: OK
  3857. 296.68 s [vector] +++ OK, passed 100 tests.
  3858. 296.68 s [vector] unfoldrN: OK
  3859. 296.68 s [vector] +++ OK, passed 100 tests.
  3860. 296.68 s [vector] unfoldrExactN: OK
  3861. 296.68 s [vector] +++ OK, passed 100 tests.
  3862. 296.69 s [vector] unfoldrM: OK
  3863. 296.69 s [vector] +++ OK, passed 100 tests.
  3864. 296.70 s [vector] unfoldrNM: OK
  3865. 296.70 s [vector] +++ OK, passed 100 tests.
  3866. 296.73 s [vector] unfoldrExactNM: OK (0.04s)
  3867. 296.73 s [vector] +++ OK, passed 100 tests.
  3868. 296.73 s [vector] constructN: OK
  3869. 296.74 s [vector] +++ OK, passed 100 tests.
  3870. 296.74 s [vector] constructrN: OK
  3871. 296.74 s [vector] +++ OK, passed 100 tests.
  3872. 296.74 s [vector] cons: OK
  3873. 296.74 s [vector] +++ OK, passed 100 tests.
  3874. 296.74 s [vector] snoc: OK
  3875. 296.74 s [vector] +++ OK, passed 100 tests.
  3876. 296.74 s [vector] append: OK
  3877. 296.74 s [vector] +++ OK, passed 100 tests.
  3878. 296.76 s [vector] concat: OK (0.02s)
  3879. 296.76 s [vector] +++ OK, passed 100 tests.
  3880. 296.76 s [vector] force: OK
  3881. 296.76 s [vector] +++ OK, passed 100 tests.
  3882. 296.76 s [vector] upd: OK
  3883. 296.76 s [vector] +++ OK, passed 100 tests.
  3884. 296.76 s [vector] accum: OK
  3885. 296.76 s [vector] +++ OK, passed 100 tests.
  3886. 296.76 s [vector] reverse: OK
  3887. 296.76 s [vector] +++ OK, passed 100 tests.
  3888. 296.76 s [vector] backpermute: OK
  3889. 296.77 s [vector] +++ OK, passed 100 tests.
  3890. 296.77 s [vector] map: OK
  3891. 296.77 s [vector] +++ OK, passed 100 tests.
  3892. 296.77 s [vector] imap: OK
  3893. 296.77 s [vector] +++ OK, passed 100 tests.
  3894. 296.78 s [vector] concatMap: OK
  3895. 296.78 s [vector] +++ OK, passed 100 tests.
  3896. 296.78 s [vector] mapM: OK
  3897. 296.78 s [vector] +++ OK, passed 100 tests.
  3898. 296.80 s [vector] mapM_: OK (0.02s)
  3899. 296.80 s [vector] +++ OK, passed 100 tests.
  3900. 296.80 s [vector] forM: OK
  3901. 296.80 s [vector] +++ OK, passed 100 tests.
  3902. 296.82 s [vector] forM_: OK (0.02s)
  3903. 296.82 s [vector] +++ OK, passed 100 tests.
  3904. 296.82 s [vector] imapM: OK
  3905. 296.84 s [vector] +++ OK, passed 100 tests.
  3906. 296.84 s [vector] imapM_: OK (0.02s)
  3907. 296.84 s [vector] +++ OK, passed 100 tests.
  3908. 296.85 s [vector] zipWith: OK
  3909. 296.85 s [vector] +++ OK, passed 100 tests.
  3910. 296.85 s [vector] zipWith3: OK
  3911. 296.85 s [vector] +++ OK, passed 100 tests.
  3912. 296.85 s [vector] izipWith: OK
  3913. 296.85 s [vector] +++ OK, passed 100 tests.
  3914. 296.86 s [vector] izipWith3: OK
  3915. 296.86 s [vector] +++ OK, passed 100 tests.
  3916. 296.86 s [vector] izipWithM: OK
  3917. 296.86 s [vector] +++ OK, passed 100 tests.
  3918. 296.87 s [vector] izipWithM_: OK (0.01s)
  3919. 296.87 s [vector] +++ OK, passed 100 tests.
  3920. 296.88 s [vector] zipWithM: OK
  3921. 296.88 s [vector] +++ OK, passed 100 tests.
  3922. 296.89 s [vector] zipWithM_: OK (0.01s)
  3923. 296.89 s [vector] +++ OK, passed 100 tests.
  3924. 296.89 s [vector] filter: OK
  3925. 296.89 s [vector] +++ OK, passed 100 tests.
  3926. 296.89 s [vector] ifilter: OK
  3927. 296.90 s [vector] +++ OK, passed 100 tests.
  3928. 296.92 s [vector] filterM: OK (0.02s)
  3929. 296.92 s [vector] +++ OK, passed 100 tests.
  3930. 296.92 s [vector] uniq: OK
  3931. 296.92 s [vector] +++ OK, passed 100 tests.
  3932. 296.92 s [vector] mapMaybe: OK
  3933. 296.92 s [vector] +++ OK, passed 100 tests.
  3934. 296.92 s [vector] imapMaybe: OK
  3935. 296.92 s [vector] +++ OK, passed 100 tests.
  3936. 296.93 s [vector] takeWhile: OK
  3937. 296.93 s [vector] +++ OK, passed 100 tests.
  3938. 296.93 s [vector] dropWhile: OK
  3939. 296.93 s [vector] +++ OK, passed 100 tests.
  3940. 296.93 s [vector] partition: OK
  3941. 296.93 s [vector] +++ OK, passed 100 tests.
  3942. 296.94 s [vector] partitionWith: OK
  3943. 296.94 s [vector] +++ OK, passed 100 tests.
  3944. 296.94 s [vector] span: OK
  3945. 296.94 s [vector] +++ OK, passed 100 tests.
  3946. 296.94 s [vector] break: OK
  3947. 296.94 s [vector] +++ OK, passed 100 tests.
  3948. 296.95 s [vector] spanR: OK
  3949. 296.95 s [vector] +++ OK, passed 100 tests.
  3950. 296.95 s [vector] breakR: OK
  3951. 296.95 s [vector] +++ OK, passed 100 tests.
  3952. 296.95 s [vector] groupBy: OK
  3953. 296.95 s [vector] +++ OK, passed 100 tests.
  3954. 296.95 s [vector] elem: OK
  3955. 296.95 s [vector] +++ OK, passed 100 tests.
  3956. 296.95 s [vector] notElem: OK
  3957. 296.95 s [vector] +++ OK, passed 100 tests.
  3958. 296.95 s [vector] find: OK
  3959. 296.95 s [vector] +++ OK, passed 100 tests.
  3960. 296.95 s [vector] findIndex: OK
  3961. 296.95 s [vector] +++ OK, passed 100 tests.
  3962. 296.95 s [vector] findIndexR: OK
  3963. 296.95 s [vector] +++ OK, passed 100 tests.
  3964. 296.95 s [vector] findIndices: OK
  3965. 296.95 s [vector] +++ OK, passed 100 tests.
  3966. 296.95 s [vector] elemIndex: OK
  3967. 296.95 s [vector] +++ OK, passed 100 tests.
  3968. 296.95 s [vector] elemIndices: OK
  3969. 296.96 s [vector] +++ OK, passed 100 tests.
  3970. 296.96 s [vector] foldl: OK
  3971. 296.96 s [vector] +++ OK, passed 100 tests.
  3972. 296.96 s [vector] foldl1: OK
  3973. 296.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3974. 296.96 s [vector] foldl': OK
  3975. 296.96 s [vector] +++ OK, passed 100 tests.
  3976. 296.96 s [vector] foldl1': OK
  3977. 296.97 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3978. 296.97 s [vector] foldr: OK
  3979. 296.97 s [vector] +++ OK, passed 100 tests.
  3980. 296.97 s [vector] foldr1: OK
  3981. 296.97 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3982. 296.97 s [vector] foldr': OK
  3983. 296.97 s [vector] +++ OK, passed 100 tests.
  3984. 296.98 s [vector] foldr1': OK
  3985. 296.98 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3986. 296.99 s [vector] ifoldl: OK
  3987. 296.99 s [vector] +++ OK, passed 100 tests.
  3988. 296.99 s [vector] ifoldl': OK
  3989. 296.99 s [vector] +++ OK, passed 100 tests.
  3990. 296.99 s [vector] ifoldr: OK
  3991. 296.99 s [vector] +++ OK, passed 100 tests.
  3992. 296.99 s [vector] ifoldr': OK
  3993. 296.99 s [vector] +++ OK, passed 100 tests.
  3994. 297.00 s [vector] ifoldM: OK
  3995. 297.00 s [vector] +++ OK, passed 100 tests.
  3996. 297.00 s [vector] ifoldM': OK
  3997. 297.02 s [vector] +++ OK, passed 100 tests.
  3998. 297.02 s [vector] ifoldM_: OK (0.02s)
  3999. 297.02 s [vector] +++ OK, passed 100 tests.
  4000. 297.04 s [vector] ifoldM'_: OK
  4001. 297.04 s [vector] +++ OK, passed 100 tests.
  4002. 297.04 s [vector] all: OK
  4003. 297.04 s [vector] +++ OK, passed 100 tests.
  4004. 297.04 s [vector] any: OK
  4005. 297.04 s [vector] +++ OK, passed 100 tests.
  4006. 297.05 s [vector] prescanl: OK
  4007. 297.05 s [vector] +++ OK, passed 100 tests.
  4008. 297.05 s [vector] prescanl': OK
  4009. 297.05 s [vector] +++ OK, passed 100 tests.
  4010. 297.05 s [vector] postscanl: OK
  4011. 297.05 s [vector] +++ OK, passed 100 tests.
  4012. 297.05 s [vector] postscanl': OK
  4013. 297.06 s [vector] +++ OK, passed 100 tests.
  4014. 297.06 s [vector] scanl: OK
  4015. 297.06 s [vector] +++ OK, passed 100 tests.
  4016. 297.06 s [vector] scanl': OK
  4017. 297.06 s [vector] +++ OK, passed 100 tests.
  4018. 297.07 s [vector] scanl1: OK
  4019. 297.07 s [vector] +++ OK, passed 100 tests.
  4020. 297.07 s [vector] scanl1': OK
  4021. 297.07 s [vector] +++ OK, passed 100 tests.
  4022. 297.07 s [vector] iscanl: OK
  4023. 297.07 s [vector] +++ OK, passed 100 tests.
  4024. 297.07 s [vector] iscanl': OK
  4025. 297.08 s [vector] +++ OK, passed 100 tests.
  4026. 297.08 s [vector] prescanr: OK
  4027. 297.08 s [vector] +++ OK, passed 100 tests.
  4028. 297.08 s [vector] prescanr': OK
  4029. 297.08 s [vector] +++ OK, passed 100 tests.
  4030. 297.08 s [vector] postscanr: OK
  4031. 297.09 s [vector] +++ OK, passed 100 tests.
  4032. 297.09 s [vector] postscanr': OK
  4033. 297.09 s [vector] +++ OK, passed 100 tests.
  4034. 297.09 s [vector] scanr: OK
  4035. 297.09 s [vector] +++ OK, passed 100 tests.
  4036. 297.09 s [vector] scanr': OK
  4037. 297.10 s [vector] +++ OK, passed 100 tests.
  4038. 297.10 s [vector] scanr1: OK
  4039. 297.10 s [vector] +++ OK, passed 100 tests.
  4040. 297.10 s [vector] scanr1': OK
  4041. 297.10 s [vector] +++ OK, passed 100 tests.
  4042. 297.11 s [vector] iscanr: OK
  4043. 297.11 s [vector] +++ OK, passed 100 tests.
  4044. 297.11 s [vector] iscanr': OK
  4045. 297.11 s [vector] +++ OK, passed 100 tests.
  4046. 297.11 s [vector] mut_read: OK
  4047. 297.11 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4048. 297.11 s [vector] mut_write: OK
  4049. 297.11 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4050. 297.11 s [vector] mut_modify: OK
  4051. 297.11 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4052. 297.12 s [vector] mut_generate: OK
  4053. 297.12 s [vector] +++ OK, passed 100 tests.
  4054. 297.14 s [vector] mut_generateM: OK (0.01s)
  4055. 297.14 s [vector] +++ OK, passed 100 tests.
  4056. 297.16 s [vector] mut_mapM_: OK (0.02s)
  4057. 297.16 s [vector] +++ OK, passed 100 tests.
  4058. 297.18 s [vector] mut_imapM_: OK (0.02s)
  4059. 297.18 s [vector] +++ OK, passed 100 tests.
  4060. 297.20 s [vector] mut_forM_: OK (0.02s)
  4061. 297.20 s [vector] +++ OK, passed 100 tests.
  4062. 297.20 s [vector] mut_iforM_: OK (0.02s)
  4063. 297.20 s [vector] +++ OK, passed 100 tests.
  4064. 297.21 s [vector] mut_foldr: OK
  4065. 297.21 s [vector] +++ OK, passed 100 tests.
  4066. 297.21 s [vector] mut_foldr': OK
  4067. 297.21 s [vector] +++ OK, passed 100 tests.
  4068. 297.22 s [vector] mut_foldl: OK
  4069. 297.22 s [vector] +++ OK, passed 100 tests.
  4070. 297.22 s [vector] mut_foldl': OK
  4071. 297.22 s [vector] +++ OK, passed 100 tests.
  4072. 297.22 s [vector] mut_ifoldr: OK
  4073. 297.22 s [vector] +++ OK, passed 100 tests.
  4074. 297.22 s [vector] mut_ifoldr': OK
  4075. 297.23 s [vector] +++ OK, passed 100 tests.
  4076. 297.23 s [vector] mut_ifoldl: OK
  4077. 297.23 s [vector] +++ OK, passed 100 tests.
  4078. 297.23 s [vector] mut_ifoldl': OK
  4079. 297.23 s [vector] +++ OK, passed 100 tests.
  4080. 297.24 s [vector] mut_foldM: OK
  4081. 297.24 s [vector] +++ OK, passed 100 tests.
  4082. 297.24 s [vector] mut_foldM': OK
  4083. 297.24 s [vector] +++ OK, passed 100 tests.
  4084. 297.24 s [vector] mut_foldrM: OK
  4085. 297.24 s [vector] +++ OK, passed 100 tests.
  4086. 297.24 s [vector] mut_foldrM': OK
  4087. 297.24 s [vector] +++ OK, passed 100 tests.
  4088. 297.25 s [vector] mut_ifoldM: OK
  4089. 297.25 s [vector] +++ OK, passed 100 tests.
  4090. 297.25 s [vector] mut_ifoldM': OK
  4091. 297.26 s [vector] +++ OK, passed 100 tests.
  4092. 297.26 s [vector] mut_ifoldrM: OK
  4093. 297.26 s [vector] +++ OK, passed 100 tests.
  4094. 297.26 s [vector] mut_ifoldrM': OK
  4095. 297.26 s [vector] +++ OK, passed 100 tests.
  4096. 297.26 s [vector] compare: OK
  4097. 297.26 s [vector] +++ OK, passed 100 tests.
  4098. 297.26 s [vector] maximum: OK
  4099. 297.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4100. 297.27 s [vector] minimum: OK
  4101. 297.27 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4102. 297.27 s [vector] minIndex: OK
  4103. 297.27 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4104. 297.27 s [vector] maxIndex: OK
  4105. 297.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4106. 297.27 s [vector] maximumBy: OK
  4107. 297.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4108. 297.27 s [vector] minimumBy: OK
  4109. 297.27 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4110. 297.27 s [vector] maximumOn: OK
  4111. 297.27 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4112. 297.27 s [vector] minimumOn: OK
  4113. 297.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4114. 297.27 s [vector] maxIndexBy: OK
  4115. 297.27 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4116. 297.27 s [vector] minIndexBy: OK
  4117. 297.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4118. 297.27 s [vector] ListFirstMaxIndexWins: OK
  4119. 297.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4120. 297.27 s [vector] FalseListFirstMaxIndexWins: OK
  4121. 297.27 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  4122. 297.27 s [vector] []
  4123. 297.27 s [vector] mempty: OK
  4124. 297.27 s [vector] +++ OK, passed 1 test.
  4125. 297.28 s [vector] mappend: OK
  4126. 297.28 s [vector] +++ OK, passed 100 tests.
  4127. 297.29 s [vector] mconcat: OK (0.02s)
  4128. 297.29 s [vector] +++ OK, passed 100 tests.
  4129. 297.29 s [vector] glength: OK
  4130. 297.29 s [vector] +++ OK, passed 100 tests.
  4131. 297.30 s [vector] sum: OK
  4132. 297.30 s [vector] +++ OK, passed 100 tests.
  4133. 297.30 s [vector] product: OK
  4134. 297.30 s [vector] +++ OK, passed 100 tests.
  4135. 297.30 s [vector] enumFromN: OK
  4136. 297.30 s [vector] +++ OK, passed 100 tests.
  4137. 297.30 s [vector] enumFromThenN: OK
  4138. 297.30 s [vector] +++ OK, passed 100 tests.
  4139. 297.30 s [vector] enumFromTo: OK
  4140. 297.30 s [vector] +++ OK, passed 100 tests.
  4141. 297.30 s [vector] enumFromThenTo: OK
  4142. 297.30 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4143. 297.30 s [vector] Data.Vector.Storable.Vector (Double)
  4144. 297.30 s [vector] fromList.toList == id: OK
  4145. 297.30 s [vector] +++ OK, passed 100 tests.
  4146. 297.30 s [vector] toList.fromList == id: OK
  4147. 297.30 s [vector] +++ OK, passed 100 tests.
  4148. 297.30 s [vector] unstream.stream == id: OK
  4149. 297.30 s [vector] +++ OK, passed 100 tests.
  4150. 297.30 s [vector] stream.unstream == id: OK
  4151. 297.30 s [vector] +++ OK, passed 100 tests.
  4152. 297.30 s [vector] eq: OK
  4153. 297.30 s [vector] +++ OK, passed 100 tests.
  4154. 297.30 s [vector] length: OK
  4155. 297.30 s [vector] +++ OK, passed 100 tests.
  4156. 297.31 s [vector] null: OK
  4157. 297.31 s [vector] +++ OK, passed 100 tests.
  4158. 297.31 s [vector] index: OK
  4159. 297.31 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4160. 297.31 s [vector] safeIndex: OK
  4161. 297.31 s [vector] +++ OK, passed 100 tests.
  4162. 297.31 s [vector] head: OK
  4163. 297.31 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4164. 297.31 s [vector] last: OK
  4165. 297.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4166. 297.31 s [vector] unsafeIndex: OK
  4167. 297.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4168. 297.31 s [vector] unsafeHead: OK
  4169. 297.31 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4170. 297.31 s [vector] unsafeLast: OK
  4171. 297.31 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4172. 297.31 s [vector] slice: OK
  4173. 297.31 s [vector] +++ OK, passed 100 tests.
  4174. 297.31 s [vector] init: OK
  4175. 297.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4176. 297.31 s [vector] tail: OK
  4177. 297.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4178. 297.31 s [vector] take: OK
  4179. 297.32 s [vector] +++ OK, passed 100 tests.
  4180. 297.32 s [vector] drop: OK
  4181. 297.32 s [vector] +++ OK, passed 100 tests.
  4182. 297.32 s [vector] splitAt: OK
  4183. 297.32 s [vector] +++ OK, passed 100 tests.
  4184. 297.32 s [vector] empty: OK
  4185. 297.32 s [vector] +++ OK, passed 1 test.
  4186. 297.32 s [vector] singleton: OK
  4187. 297.32 s [vector] +++ OK, passed 100 tests.
  4188. 297.32 s [vector] replicate: OK
  4189. 297.32 s [vector] +++ OK, passed 100 tests.
  4190. 297.32 s [vector] generate: OK
  4191. 297.32 s [vector] +++ OK, passed 100 tests.
  4192. 297.34 s [vector] iterateN: OK
  4193. 297.34 s [vector] +++ OK, passed 100 tests.
  4194. 297.38 s [vector] iterateNM: OK (0.04s)
  4195. 297.38 s [vector] +++ OK, passed 100 tests.
  4196. 297.41 s [vector] generateM: OK (0.03s)
  4197. 297.41 s [vector] +++ OK, passed 100 tests.
  4198. 297.42 s [vector] replicateM: OK (0.02s)
  4199. 297.42 s [vector] +++ OK, passed 100 tests.
  4200. 297.42 s [vector] create: OK
  4201. 297.42 s [vector] +++ OK, passed 100 tests.
  4202. 297.42 s [vector] createT: OK
  4203. 297.42 s [vector] +++ OK, passed 100 tests.
  4204. 297.42 s [vector] unfoldr: OK
  4205. 297.42 s [vector] +++ OK, passed 100 tests.
  4206. 297.42 s [vector] unfoldrN: OK
  4207. 297.42 s [vector] +++ OK, passed 100 tests.
  4208. 297.42 s [vector] unfoldrExactN: OK
  4209. 297.42 s [vector] +++ OK, passed 100 tests.
  4210. 297.42 s [vector] unfoldrM: OK
  4211. 297.42 s [vector] +++ OK, passed 100 tests.
  4212. 297.42 s [vector] unfoldrNM: OK
  4213. 297.44 s [vector] +++ OK, passed 100 tests.
  4214. 297.50 s [vector] unfoldrExactNM: OK (0.06s)
  4215. 297.50 s [vector] +++ OK, passed 100 tests.
  4216. 297.50 s [vector] constructN: OK (0.02s)
  4217. 297.50 s [vector] +++ OK, passed 100 tests.
  4218. 297.51 s [vector] constructrN: OK (0.01s)
  4219. 297.52 s [vector] +++ OK, passed 100 tests.
  4220. 297.52 s [vector] cons: OK
  4221. 297.52 s [vector] +++ OK, passed 100 tests.
  4222. 297.52 s [vector] snoc: OK
  4223. 297.52 s [vector] +++ OK, passed 100 tests.
  4224. 297.52 s [vector] append: OK
  4225. 297.52 s [vector] +++ OK, passed 100 tests.
  4226. 297.54 s [vector] concat: OK (0.02s)
  4227. 297.54 s [vector] +++ OK, passed 100 tests.
  4228. 297.54 s [vector] force: OK
  4229. 297.54 s [vector] +++ OK, passed 100 tests.
  4230. 297.54 s [vector] upd: OK
  4231. 297.56 s [vector] +++ OK, passed 100 tests.
  4232. 297.56 s [vector] accum: OK (0.02s)
  4233. 297.56 s [vector] +++ OK, passed 100 tests.
  4234. 297.56 s [vector] reverse: OK
  4235. 297.56 s [vector] +++ OK, passed 100 tests.
  4236. 297.56 s [vector] backpermute: OK
  4237. 297.57 s [vector] +++ OK, passed 100 tests.
  4238. 297.57 s [vector] map: OK
  4239. 297.57 s [vector] +++ OK, passed 100 tests.
  4240. 297.58 s [vector] imap: OK
  4241. 297.59 s [vector] +++ OK, passed 100 tests.
  4242. 297.59 s [vector] concatMap: OK
  4243. 297.59 s [vector] +++ OK, passed 100 tests.
  4244. 297.60 s [vector] mapM: OK
  4245. 297.60 s [vector] +++ OK, passed 100 tests.
  4246. 297.64 s [vector] mapM_: OK (0.04s)
  4247. 297.64 s [vector] +++ OK, passed 100 tests.
  4248. 297.66 s [vector] forM: OK
  4249. 297.66 s [vector] +++ OK, passed 100 tests.
  4250. 297.69 s [vector] forM_: OK (0.04s)
  4251. 297.69 s [vector] +++ OK, passed 100 tests.
  4252. 297.70 s [vector] imapM: OK (0.01s)
  4253. 297.70 s [vector] +++ OK, passed 100 tests.
  4254. 297.76 s [vector] imapM_: OK (0.05s)
  4255. 297.76 s [vector] +++ OK, passed 100 tests.
  4256. 298.15 s [vector] zipWith: OK (0.03s)
  4257. 298.15 s [vector] +++ OK, passed 100 tests.
  4258. 298.15 s [vector] zipWith3: OK (0.02s)
  4259. 298.15 s [vector] +++ OK, passed 100 tests.
  4260. 298.15 s [vector] izipWith: OK (0.02s)
  4261. 298.15 s [vector] +++ OK, passed 100 tests.
  4262. 298.15 s [vector] izipWith3: OK (0.01s)
  4263. 298.15 s [vector] +++ OK, passed 100 tests.
  4264. 298.15 s [vector] izipWithM: OK (0.02s)
  4265. 298.15 s [vector] +++ OK, passed 100 tests.
  4266. 298.15 s [vector] izipWithM_: OK (0.04s)
  4267. 298.15 s [vector] +++ OK, passed 100 tests.
  4268. 298.15 s [vector] zipWithM: OK (0.01s)
  4269. 298.15 s [vector] +++ OK, passed 100 tests.
  4270. 298.15 s [vector] zipWithM_: OK (0.03s)
  4271. 298.15 s [vector] +++ OK, passed 100 tests.
  4272. 298.15 s [vector] filter: OK
  4273. 298.15 s [vector] +++ OK, passed 100 tests.
  4274. 298.15 s [vector] ifilter: OK
  4275. 298.15 s [vector] +++ OK, passed 100 tests.
  4276. 298.15 s [vector] filterM: OK (0.05s)
  4277. 298.15 s [vector] +++ OK, passed 100 tests.
  4278. 298.15 s [vector] uniq: OK
  4279. 298.15 s [vector] +++ OK, passed 100 tests.
  4280. 298.15 s [vector] mapMaybe: OK
  4281. 298.15 s [vector] +++ OK, passed 100 tests.
  4282. 298.15 s [vector] imapMaybe: OK
  4283. 298.15 s [vector] +++ OK, passed 100 tests.
  4284. 298.15 s [vector] takeWhile: OK
  4285. 298.15 s [vector] +++ OK, passed 100 tests.
  4286. 298.15 s [vector] dropWhile: OK
  4287. 298.15 s [vector] +++ OK, passed 100 tests.
  4288. 298.15 s [vector] partition: OK
  4289. 298.15 s [vector] +++ OK, passed 100 tests.
  4290. 298.15 s [vector] partitionWith: OK
  4291. 298.15 s [vector] +++ OK, passed 100 tests.
  4292. 298.15 s [vector] span: OK
  4293. 298.15 s [vector] +++ OK, passed 100 tests.
  4294. 298.15 s [vector] break: OK
  4295. 298.15 s [vector] +++ OK, passed 100 tests.
  4296. 298.15 s [vector] spanR: OK
  4297. 298.15 s [vector] +++ OK, passed 100 tests.
  4298. 298.15 s [vector] breakR: OK
  4299. 298.15 s [vector] +++ OK, passed 100 tests.
  4300. 298.15 s [vector] groupBy: OK (0.01s)
  4301. 298.15 s [vector] +++ OK, passed 100 tests.
  4302. 298.15 s [vector] elem: OK
  4303. 298.15 s [vector] +++ OK, passed 100 tests.
  4304. 298.15 s [vector] notElem: OK
  4305. 298.15 s [vector] +++ OK, passed 100 tests.
  4306. 298.15 s [vector] find: OK
  4307. 298.15 s [vector] +++ OK, passed 100 tests.
  4308. 298.15 s [vector] findIndex: OK
  4309. 298.15 s [vector] +++ OK, passed 100 tests.
  4310. 298.15 s [vector] findIndexR: OK
  4311. 298.15 s [vector] +++ OK, passed 100 tests.
  4312. 298.15 s [vector] findIndices: OK
  4313. 298.15 s [vector] +++ OK, passed 100 tests.
  4314. 298.15 s [vector] elemIndex: OK
  4315. 298.15 s [vector] +++ OK, passed 100 tests.
  4316. 298.15 s [vector] elemIndices: OK
  4317. 298.15 s [vector] +++ OK, passed 100 tests.
  4318. 298.15 s [vector] foldl: OK (0.02s)
  4319. 298.15 s [vector] +++ OK, passed 100 tests.
  4320. 298.15 s [vector] foldl1: OK (0.01s)
  4321. 298.15 s [vector] +++ OK, passed 100 tests; 22 discarded.
  4322. 298.15 s [vector] foldl': OK (0.01s)
  4323. 298.15 s [vector] +++ OK, passed 100 tests.
  4324. 298.15 s [vector] foldl1': OK (0.02s)
  4325. 298.15 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4326. 298.15 s [vector] foldr: OK (0.02s)
  4327. 298.15 s [vector] +++ OK, passed 100 tests.
  4328. 298.16 s [vector] foldr1: OK (0.01s)
  4329. 298.16 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4330. 298.19 s [vector] foldr': OK (0.02s)
  4331. 298.19 s [vector] +++ OK, passed 100 tests.
  4332. 298.20 s [vector] foldr1': OK (0.02s)
  4333. 298.20 s [vector] +++ OK, passed 100 tests; 22 discarded.
  4334. 298.23 s [vector] ifoldl: OK (0.02s)
  4335. 298.23 s [vector] +++ OK, passed 100 tests.
  4336. 298.24 s [vector] ifoldl': OK (0.02s)
  4337. 298.24 s [vector] +++ OK, passed 100 tests.
  4338. 298.24 s [vector] ifoldr: OK (0.02s)
  4339. 298.24 s [vector] +++ OK, passed 100 tests.
  4340. 298.26 s [vector] ifoldr': OK (0.02s)
  4341. 298.26 s [vector] +++ OK, passed 100 tests.
  4342. 298.28 s [vector] ifoldM: OK (0.02s)
  4343. 298.28 s [vector] +++ OK, passed 100 tests.
  4344. 298.31 s [vector] ifoldM': OK (0.02s)
  4345. 298.31 s [vector] +++ OK, passed 100 tests.
  4346. 298.34 s [vector] ifoldM_: OK (0.04s)
  4347. 298.34 s [vector] +++ OK, passed 100 tests.
  4348. 298.38 s [vector] ifoldM'_: OK (0.05s)
  4349. 298.39 s [vector] +++ OK, passed 100 tests.
  4350. 298.39 s [vector] all: OK
  4351. 298.39 s [vector] +++ OK, passed 100 tests.
  4352. 298.39 s [vector] any: OK
  4353. 298.39 s [vector] +++ OK, passed 100 tests.
  4354. 298.41 s [vector] prescanl: OK
  4355. 298.41 s [vector] +++ OK, passed 100 tests.
  4356. 298.42 s [vector] prescanl': OK (0.01s)
  4357. 298.42 s [vector] +++ OK, passed 100 tests.
  4358. 298.44 s [vector] postscanl: OK (0.02s)
  4359. 298.44 s [vector] +++ OK, passed 100 tests.
  4360. 298.46 s [vector] postscanl': OK (0.02s)
  4361. 298.46 s [vector] +++ OK, passed 100 tests.
  4362. 298.48 s [vector] scanl: OK (0.02s)
  4363. 298.48 s [vector] +++ OK, passed 100 tests.
  4364. 298.48 s [vector] scanl': OK (0.01s)
  4365. 298.48 s [vector] +++ OK, passed 100 tests.
  4366. 298.50 s [vector] scanl1: OK (0.02s)
  4367. 298.50 s [vector] +++ OK, passed 100 tests.
  4368. 298.52 s [vector] scanl1': OK (0.02s)
  4369. 298.52 s [vector] +++ OK, passed 100 tests.
  4370. 298.54 s [vector] iscanl: OK (0.02s)
  4371. 298.54 s [vector] +++ OK, passed 100 tests.
  4372. 298.55 s [vector] iscanl': OK (0.02s)
  4373. 298.55 s [vector] +++ OK, passed 100 tests.
  4374. 298.56 s [vector] prescanr: OK (0.01s)
  4375. 298.56 s [vector] +++ OK, passed 100 tests.
  4376. 298.57 s [vector] prescanr': OK (0.01s)
  4377. 298.57 s [vector] +++ OK, passed 100 tests.
  4378. 298.60 s [vector] postscanr: OK
  4379. 298.60 s [vector] +++ OK, passed 100 tests.
  4380. 298.61 s [vector] postscanr': OK (0.01s)
  4381. 298.62 s [vector] +++ OK, passed 100 tests.
  4382. 298.62 s [vector] scanr: OK (0.01s)
  4383. 298.62 s [vector] +++ OK, passed 100 tests.
  4384. 298.64 s [vector] scanr': OK (0.01s)
  4385. 298.64 s [vector] +++ OK, passed 100 tests.
  4386. 298.66 s [vector] scanr1: OK (0.01s)
  4387. 298.66 s [vector] +++ OK, passed 100 tests.
  4388. 298.66 s [vector] scanr1': OK (0.01s)
  4389. 298.66 s [vector] +++ OK, passed 100 tests.
  4390. 298.68 s [vector] iscanr: OK (0.01s)
  4391. 298.68 s [vector] +++ OK, passed 100 tests.
  4392. 298.69 s [vector] iscanr': OK (0.02s)
  4393. 298.69 s [vector] +++ OK, passed 100 tests.
  4394. 298.69 s [vector] mut_read: OK
  4395. 298.69 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4396. 298.69 s [vector] mut_write: OK
  4397. 298.69 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4398. 298.70 s [vector] mut_modify: OK
  4399. 298.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4400. 298.70 s [vector] mut_generate: OK
  4401. 298.70 s [vector] +++ OK, passed 100 tests.
  4402. 298.74 s [vector] mut_generateM: OK (0.03s)
  4403. 298.74 s [vector] +++ OK, passed 100 tests.
  4404. 298.78 s [vector] mut_mapM_: OK (0.04s)
  4405. 298.78 s [vector] +++ OK, passed 100 tests.
  4406. 298.81 s [vector] mut_imapM_: OK (0.04s)
  4407. 298.81 s [vector] +++ OK, passed 100 tests.
  4408. 298.85 s [vector] mut_forM_: OK (0.03s)
  4409. 298.85 s [vector] +++ OK, passed 100 tests.
  4410. 298.90 s [vector] mut_iforM_: OK (0.03s)
  4411. 298.90 s [vector] +++ OK, passed 100 tests.
  4412. 298.90 s [vector] mut_foldr: OK (0.01s)
  4413. 298.90 s [vector] +++ OK, passed 100 tests.
  4414. 298.92 s [vector] mut_foldr': OK (0.01s)
  4415. 298.92 s [vector] +++ OK, passed 100 tests.
  4416. 298.92 s [vector] mut_foldl: OK (0.01s)
  4417. 298.92 s [vector] +++ OK, passed 100 tests.
  4418. 298.94 s [vector] mut_foldl': OK
  4419. 298.94 s [vector] +++ OK, passed 100 tests.
  4420. 298.96 s [vector] mut_ifoldr: OK (0.01s)
  4421. 298.96 s [vector] +++ OK, passed 100 tests.
  4422. 298.98 s [vector] mut_ifoldr': OK (0.01s)
  4423. 298.98 s [vector] +++ OK, passed 100 tests.
  4424. 298.98 s [vector] mut_ifoldl: OK (0.01s)
  4425. 298.98 s [vector] +++ OK, passed 100 tests.
  4426. 299.00 s [vector] mut_ifoldl': OK (0.01s)
  4427. 299.00 s [vector] +++ OK, passed 100 tests.
  4428. 299.02 s [vector] mut_foldM: OK (0.01s)
  4429. 299.02 s [vector] +++ OK, passed 100 tests.
  4430. 299.08 s [vector] mut_foldM': OK (0.01s)
  4431. 299.08 s [vector] +++ OK, passed 100 tests.
  4432. 299.08 s [vector] mut_foldrM: OK (0.01s)
  4433. 299.08 s [vector] +++ OK, passed 100 tests.
  4434. 299.08 s [vector] mut_foldrM': OK (0.01s)
  4435. 299.08 s [vector] +++ OK, passed 100 tests.
  4436. 299.08 s [vector] mut_ifoldM: OK (0.02s)
  4437. 299.08 s [vector] +++ OK, passed 100 tests.
  4438. 299.10 s [vector] mut_ifoldM': OK (0.02s)
  4439. 299.10 s [vector] +++ OK, passed 100 tests.
  4440. 299.12 s [vector] mut_ifoldrM: OK (0.02s)
  4441. 299.12 s [vector] +++ OK, passed 100 tests.
  4442. 299.12 s [vector] mut_ifoldrM': OK (0.02s)
  4443. 299.12 s [vector] +++ OK, passed 100 tests.
  4444. 299.12 s [vector] compare: OK
  4445. 299.12 s [vector] +++ OK, passed 100 tests.
  4446. 299.12 s [vector] maximum: OK
  4447. 299.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4448. 299.12 s [vector] minimum: OK
  4449. 299.12 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4450. 299.12 s [vector] minIndex: OK
  4451. 299.12 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4452. 299.12 s [vector] maxIndex: OK
  4453. 299.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4454. 299.13 s [vector] maximumBy: OK
  4455. 299.13 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4456. 299.13 s [vector] minimumBy: OK
  4457. 299.13 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4458. 299.13 s [vector] maximumOn: OK
  4459. 299.13 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4460. 299.13 s [vector] minimumOn: OK
  4461. 299.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4462. 299.13 s [vector] maxIndexBy: OK
  4463. 299.13 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4464. 299.13 s [vector] minIndexBy: OK
  4465. 299.13 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4466. 299.13 s [vector] ListFirstMaxIndexWins: OK
  4467. 299.13 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4468. 299.13 s [vector] FalseListFirstMaxIndexWins: OK
  4469. 299.13 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  4470. 299.13 s [vector] []
  4471. 299.13 s [vector] mempty: OK
  4472. 299.13 s [vector] +++ OK, passed 1 test.
  4473. 299.14 s [vector] mappend: OK
  4474. 299.14 s [vector] +++ OK, passed 100 tests.
  4475. 299.16 s [vector] mconcat: OK (0.02s)
  4476. 299.16 s [vector] +++ OK, passed 100 tests.
  4477. 299.16 s [vector] glength: OK
  4478. 299.16 s [vector] +++ OK, passed 100 tests.
  4479. 299.16 s [vector] sum: OK
  4480. 299.16 s [vector] +++ OK, passed 100 tests.
  4481. 299.16 s [vector] product: OK
  4482. 299.17 s [vector] +++ OK, passed 100 tests.
  4483. 299.17 s [vector] enumFromN: OK
  4484. 299.17 s [vector] +++ OK, passed 100 tests.
  4485. 299.17 s [vector] enumFromThenN: OK
  4486. 299.17 s [vector] +++ OK, passed 100 tests.
  4487. 299.17 s [vector] enumFromTo: OK
  4488. 299.17 s [vector] +++ OK, passed 100 tests.
  4489. 299.17 s [vector] enumFromThenTo: OK
  4490. 299.17 s [vector] +++ OK, passed 100 tests; 7 discarded.
  4491. 299.17 s [vector] unstream
  4492. 299.17 s [vector] unstream == vunstream (exact): OK
  4493. 299.17 s [vector] +++ OK, passed 100 tests.
  4494. 299.17 s [vector] unstream == vunstream (unknown): OK
  4495. 299.17 s [vector] +++ OK, passed 100 tests.
  4496. 299.18 s [vector] unstreamR ~= vunstream (exact): OK
  4497. 299.18 s [vector] +++ OK, passed 100 tests.
  4498. 299.18 s [vector] unstreamR ~= vunstream (unknown): OK
  4499. 299.18 s [vector] +++ OK, passed 100 tests.
  4500. 299.18 s [vector] Tests.Vector.Strict
  4501. 299.18 s [vector] Bool
  4502. 299.18 s [vector] fromList.toList == id: OK
  4503. 299.18 s [vector] +++ OK, passed 100 tests.
  4504. 299.18 s [vector] toList.fromList == id: OK
  4505. 299.18 s [vector] +++ OK, passed 100 tests.
  4506. 299.18 s [vector] unstream.stream == id: OK
  4507. 299.18 s [vector] +++ OK, passed 100 tests.
  4508. 299.18 s [vector] stream.unstream == id: OK
  4509. 299.18 s [vector] +++ OK, passed 100 tests.
  4510. 299.18 s [vector] eq: OK
  4511. 299.18 s [vector] +++ OK, passed 100 tests.
  4512. 299.18 s [vector] length: OK
  4513. 299.18 s [vector] +++ OK, passed 100 tests.
  4514. 299.18 s [vector] null: OK
  4515. 299.18 s [vector] +++ OK, passed 100 tests.
  4516. 299.18 s [vector] index: OK
  4517. 299.18 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4518. 299.18 s [vector] safeIndex: OK
  4519. 299.18 s [vector] +++ OK, passed 100 tests.
  4520. 299.18 s [vector] head: OK
  4521. 299.18 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4522. 299.18 s [vector] last: OK
  4523. 299.18 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4524. 299.18 s [vector] unsafeIndex: OK
  4525. 299.18 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4526. 299.18 s [vector] unsafeHead: OK
  4527. 299.18 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4528. 299.18 s [vector] unsafeLast: OK
  4529. 299.18 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4530. 299.18 s [vector] slice: OK
  4531. 299.18 s [vector] +++ OK, passed 100 tests.
  4532. 299.18 s [vector] init: OK
  4533. 299.18 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4534. 299.18 s [vector] tail: OK
  4535. 299.18 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4536. 299.18 s [vector] take: OK
  4537. 299.19 s [vector] +++ OK, passed 100 tests.
  4538. 299.19 s [vector] drop: OK
  4539. 299.19 s [vector] +++ OK, passed 100 tests.
  4540. 299.19 s [vector] splitAt: OK
  4541. 299.19 s [vector] +++ OK, passed 100 tests.
  4542. 299.19 s [vector] empty: OK
  4543. 299.19 s [vector] +++ OK, passed 1 test.
  4544. 299.19 s [vector] singleton: OK
  4545. 299.19 s [vector] +++ OK, passed 100 tests.
  4546. 299.19 s [vector] replicate: OK
  4547. 299.19 s [vector] +++ OK, passed 100 tests.
  4548. 299.19 s [vector] generate: OK
  4549. 299.19 s [vector] +++ OK, passed 100 tests.
  4550. 299.19 s [vector] iterateN: OK
  4551. 299.20 s [vector] +++ OK, passed 100 tests.
  4552. 299.24 s [vector] iterateNM: OK (0.04s)
  4553. 299.24 s [vector] +++ OK, passed 100 tests.
  4554. 299.24 s [vector] generateM: OK
  4555. 299.26 s [vector] +++ OK, passed 100 tests.
  4556. 299.26 s [vector] replicateM: OK (0.02s)
  4557. 299.26 s [vector] +++ OK, passed 100 tests.
  4558. 299.26 s [vector] create: OK
  4559. 299.26 s [vector] +++ OK, passed 100 tests.
  4560. 299.26 s [vector] createT: OK
  4561. 299.26 s [vector] +++ OK, passed 100 tests.
  4562. 299.26 s [vector] unfoldr: OK
  4563. 299.26 s [vector] +++ OK, passed 100 tests.
  4564. 299.26 s [vector] unfoldrN: OK
  4565. 299.26 s [vector] +++ OK, passed 100 tests.
  4566. 299.27 s [vector] unfoldrExactN: OK
  4567. 299.27 s [vector] +++ OK, passed 100 tests.
  4568. 299.27 s [vector] unfoldrM: OK
  4569. 299.27 s [vector] +++ OK, passed 100 tests.
  4570. 299.27 s [vector] unfoldrNM: OK
  4571. 299.27 s [vector] +++ OK, passed 100 tests.
  4572. 299.32 s [vector] unfoldrExactNM: OK (0.04s)
  4573. 299.32 s [vector] +++ OK, passed 100 tests.
  4574. 299.32 s [vector] constructN: OK
  4575. 299.32 s [vector] +++ OK, passed 100 tests.
  4576. 299.32 s [vector] constructrN: OK
  4577. 299.32 s [vector] +++ OK, passed 100 tests.
  4578. 299.32 s [vector] cons: OK
  4579. 299.32 s [vector] +++ OK, passed 100 tests.
  4580. 299.32 s [vector] snoc: OK
  4581. 299.33 s [vector] +++ OK, passed 100 tests.
  4582. 299.33 s [vector] append: OK
  4583. 299.33 s [vector] +++ OK, passed 100 tests.
  4584. 299.33 s [vector] concat: OK
  4585. 299.33 s [vector] +++ OK, passed 100 tests.
  4586. 299.33 s [vector] force: OK
  4587. 299.34 s [vector] +++ OK, passed 100 tests.
  4588. 299.34 s [vector] upd: OK
  4589. 299.34 s [vector] +++ OK, passed 100 tests.
  4590. 299.34 s [vector] accum: OK
  4591. 299.34 s [vector] +++ OK, passed 100 tests.
  4592. 299.34 s [vector] reverse: OK
  4593. 299.34 s [vector] +++ OK, passed 100 tests.
  4594. 299.34 s [vector] backpermute: OK
  4595. 299.34 s [vector] +++ OK, passed 100 tests.
  4596. 299.35 s [vector] map: OK
  4597. 299.35 s [vector] +++ OK, passed 100 tests.
  4598. 299.35 s [vector] imap: OK
  4599. 299.35 s [vector] +++ OK, passed 100 tests.
  4600. 299.35 s [vector] concatMap: OK
  4601. 299.35 s [vector] +++ OK, passed 100 tests.
  4602. 299.35 s [vector] mapM: OK
  4603. 299.36 s [vector] +++ OK, passed 100 tests.
  4604. 299.37 s [vector] mapM_: OK (0.02s)
  4605. 299.37 s [vector] +++ OK, passed 100 tests.
  4606. 299.37 s [vector] forM: OK
  4607. 299.37 s [vector] +++ OK, passed 100 tests.
  4608. 299.39 s [vector] forM_: OK (0.02s)
  4609. 299.39 s [vector] +++ OK, passed 100 tests.
  4610. 299.40 s [vector] imapM: OK
  4611. 299.40 s [vector] +++ OK, passed 100 tests.
  4612. 299.41 s [vector] imapM_: OK (0.02s)
  4613. 299.41 s [vector] +++ OK, passed 100 tests.
  4614. 299.41 s [vector] zipWith: OK
  4615. 299.41 s [vector] +++ OK, passed 100 tests.
  4616. 299.41 s [vector] zipWith3: OK
  4617. 299.42 s [vector] +++ OK, passed 100 tests.
  4618. 299.42 s [vector] izipWith: OK
  4619. 299.42 s [vector] +++ OK, passed 100 tests.
  4620. 299.42 s [vector] izipWith3: OK
  4621. 299.42 s [vector] +++ OK, passed 100 tests.
  4622. 299.42 s [vector] izipWithM: OK
  4623. 299.43 s [vector] +++ OK, passed 100 tests.
  4624. 299.43 s [vector] izipWithM_: OK (0.01s)
  4625. 299.43 s [vector] +++ OK, passed 100 tests.
  4626. 299.43 s [vector] zipWithM: OK
  4627. 299.44 s [vector] +++ OK, passed 100 tests.
  4628. 299.45 s [vector] zipWithM_: OK (0.01s)
  4629. 299.45 s [vector] +++ OK, passed 100 tests.
  4630. 299.45 s [vector] filter: OK
  4631. 299.45 s [vector] +++ OK, passed 100 tests.
  4632. 299.45 s [vector] ifilter: OK
  4633. 299.46 s [vector] +++ OK, passed 100 tests.
  4634. 299.48 s [vector] filterM: OK (0.03s)
  4635. 299.48 s [vector] +++ OK, passed 100 tests.
  4636. 299.48 s [vector] uniq: OK
  4637. 299.49 s [vector] +++ OK, passed 100 tests.
  4638. 299.49 s [vector] mapMaybe: OK
  4639. 299.49 s [vector] +++ OK, passed 100 tests.
  4640. 299.49 s [vector] imapMaybe: OK
  4641. 299.49 s [vector] +++ OK, passed 100 tests.
  4642. 299.49 s [vector] takeWhile: OK
  4643. 299.49 s [vector] +++ OK, passed 100 tests.
  4644. 299.49 s [vector] dropWhile: OK
  4645. 299.49 s [vector] +++ OK, passed 100 tests.
  4646. 299.49 s [vector] partition: OK
  4647. 299.49 s [vector] +++ OK, passed 100 tests.
  4648. 299.49 s [vector] partitionWith: OK
  4649. 299.49 s [vector] +++ OK, passed 100 tests.
  4650. 299.49 s [vector] span: OK
  4651. 299.49 s [vector] +++ OK, passed 100 tests.
  4652. 299.49 s [vector] break: OK
  4653. 299.49 s [vector] +++ OK, passed 100 tests.
  4654. 299.49 s [vector] spanR: OK
  4655. 299.49 s [vector] +++ OK, passed 100 tests.
  4656. 299.50 s [vector] breakR: OK
  4657. 299.50 s [vector] +++ OK, passed 100 tests.
  4658. 299.50 s [vector] groupBy: OK
  4659. 299.50 s [vector] +++ OK, passed 100 tests.
  4660. 299.50 s [vector] elem: OK
  4661. 299.50 s [vector] +++ OK, passed 100 tests.
  4662. 299.50 s [vector] notElem: OK
  4663. 299.50 s [vector] +++ OK, passed 100 tests.
  4664. 299.50 s [vector] find: OK
  4665. 299.50 s [vector] +++ OK, passed 100 tests.
  4666. 299.50 s [vector] findIndex: OK
  4667. 299.50 s [vector] +++ OK, passed 100 tests.
  4668. 299.50 s [vector] findIndexR: OK
  4669. 299.50 s [vector] +++ OK, passed 100 tests.
  4670. 299.50 s [vector] findIndices: OK
  4671. 299.50 s [vector] +++ OK, passed 100 tests.
  4672. 299.50 s [vector] elemIndex: OK
  4673. 299.50 s [vector] +++ OK, passed 100 tests.
  4674. 299.50 s [vector] elemIndices: OK
  4675. 299.50 s [vector] +++ OK, passed 100 tests.
  4676. 299.50 s [vector] foldl: OK
  4677. 299.50 s [vector] +++ OK, passed 100 tests.
  4678. 299.50 s [vector] foldl1: OK
  4679. 299.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4680. 299.50 s [vector] foldl': OK
  4681. 299.51 s [vector] +++ OK, passed 100 tests.
  4682. 299.51 s [vector] foldl1': OK
  4683. 299.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4684. 299.51 s [vector] foldr: OK
  4685. 299.51 s [vector] +++ OK, passed 100 tests.
  4686. 299.51 s [vector] foldr1: OK
  4687. 299.51 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4688. 299.51 s [vector] foldr': OK
  4689. 299.51 s [vector] +++ OK, passed 100 tests.
  4690. 299.51 s [vector] foldr1': OK
  4691. 299.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4692. 299.52 s [vector] ifoldl: OK
  4693. 299.52 s [vector] +++ OK, passed 100 tests.
  4694. 299.52 s [vector] ifoldl': OK
  4695. 299.52 s [vector] +++ OK, passed 100 tests.
  4696. 299.53 s [vector] ifoldr: OK
  4697. 299.53 s [vector] +++ OK, passed 100 tests.
  4698. 299.53 s [vector] ifoldr': OK
  4699. 299.53 s [vector] +++ OK, passed 100 tests.
  4700. 299.53 s [vector] ifoldM: OK
  4701. 299.53 s [vector] +++ OK, passed 100 tests.
  4702. 299.53 s [vector] ifoldM': OK
  4703. 299.54 s [vector] +++ OK, passed 100 tests.
  4704. 299.56 s [vector] ifoldM_: OK (0.02s)
  4705. 299.56 s [vector] +++ OK, passed 100 tests.
  4706. 299.57 s [vector] ifoldM'_: OK (0.02s)
  4707. 299.57 s [vector] +++ OK, passed 100 tests.
  4708. 299.57 s [vector] all: OK
  4709. 299.57 s [vector] +++ OK, passed 100 tests.
  4710. 299.57 s [vector] any: OK
  4711. 299.57 s [vector] +++ OK, passed 100 tests.
  4712. 299.57 s [vector] prescanl: OK
  4713. 299.57 s [vector] +++ OK, passed 100 tests.
  4714. 299.57 s [vector] prescanl': OK
  4715. 299.57 s [vector] +++ OK, passed 100 tests.
  4716. 299.57 s [vector] postscanl: OK
  4717. 299.57 s [vector] +++ OK, passed 100 tests.
  4718. 299.57 s [vector] postscanl': OK
  4719. 299.57 s [vector] +++ OK, passed 100 tests.
  4720. 299.57 s [vector] scanl: OK
  4721. 299.57 s [vector] +++ OK, passed 100 tests.
  4722. 299.57 s [vector] scanl': OK
  4723. 299.58 s [vector] +++ OK, passed 100 tests.
  4724. 299.58 s [vector] scanl1: OK
  4725. 299.58 s [vector] +++ OK, passed 100 tests.
  4726. 299.58 s [vector] scanl1': OK
  4727. 299.58 s [vector] +++ OK, passed 100 tests.
  4728. 299.58 s [vector] iscanl: OK
  4729. 299.58 s [vector] +++ OK, passed 100 tests.
  4730. 299.58 s [vector] iscanl': OK
  4731. 299.59 s [vector] +++ OK, passed 100 tests.
  4732. 299.59 s [vector] prescanr: OK
  4733. 299.59 s [vector] +++ OK, passed 100 tests.
  4734. 299.59 s [vector] prescanr': OK
  4735. 299.59 s [vector] +++ OK, passed 100 tests.
  4736. 299.59 s [vector] postscanr: OK
  4737. 299.59 s [vector] +++ OK, passed 100 tests.
  4738. 299.59 s [vector] postscanr': OK
  4739. 299.59 s [vector] +++ OK, passed 100 tests.
  4740. 299.60 s [vector] scanr: OK
  4741. 299.60 s [vector] +++ OK, passed 100 tests.
  4742. 299.60 s [vector] scanr': OK
  4743. 299.60 s [vector] +++ OK, passed 100 tests.
  4744. 299.60 s [vector] scanr1: OK
  4745. 299.60 s [vector] +++ OK, passed 100 tests.
  4746. 299.60 s [vector] scanr1': OK
  4747. 299.60 s [vector] +++ OK, passed 100 tests.
  4748. 299.60 s [vector] iscanr: OK
  4749. 299.60 s [vector] +++ OK, passed 100 tests.
  4750. 299.61 s [vector] iscanr': OK
  4751. 299.61 s [vector] +++ OK, passed 100 tests.
  4752. 299.61 s [vector] mut_read: OK
  4753. 299.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4754. 299.61 s [vector] mut_write: OK
  4755. 299.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4756. 299.61 s [vector] mut_modify: OK
  4757. 299.61 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4758. 299.61 s [vector] mut_generate: OK
  4759. 299.62 s [vector] +++ OK, passed 100 tests.
  4760. 299.62 s [vector] mut_generateM: OK
  4761. 299.62 s [vector] +++ OK, passed 100 tests.
  4762. 299.64 s [vector] mut_mapM_: OK (0.02s)
  4763. 299.64 s [vector] +++ OK, passed 100 tests.
  4764. 299.65 s [vector] mut_imapM_: OK (0.02s)
  4765. 299.65 s [vector] +++ OK, passed 100 tests.
  4766. 299.68 s [vector] mut_forM_: OK
  4767. 299.68 s [vector] +++ OK, passed 100 tests.
  4768. 299.68 s [vector] mut_iforM_: OK (0.01s)
  4769. 299.68 s [vector] +++ OK, passed 100 tests.
  4770. 299.68 s [vector] mut_foldr: OK
  4771. 299.68 s [vector] +++ OK, passed 100 tests.
  4772. 299.68 s [vector] mut_foldr': OK
  4773. 299.68 s [vector] +++ OK, passed 100 tests.
  4774. 299.68 s [vector] mut_foldl: OK
  4775. 299.68 s [vector] +++ OK, passed 100 tests.
  4776. 299.69 s [vector] mut_foldl': OK
  4777. 299.69 s [vector] +++ OK, passed 100 tests.
  4778. 299.69 s [vector] mut_ifoldr: OK
  4779. 299.69 s [vector] +++ OK, passed 100 tests.
  4780. 299.69 s [vector] mut_ifoldr': OK
  4781. 299.69 s [vector] +++ OK, passed 100 tests.
  4782. 299.70 s [vector] mut_ifoldl: OK
  4783. 299.70 s [vector] +++ OK, passed 100 tests.
  4784. 299.70 s [vector] mut_ifoldl': OK
  4785. 299.70 s [vector] +++ OK, passed 100 tests.
  4786. 299.70 s [vector] mut_foldM: OK
  4787. 299.70 s [vector] +++ OK, passed 100 tests.
  4788. 299.70 s [vector] mut_foldM': OK
  4789. 299.70 s [vector] +++ OK, passed 100 tests.
  4790. 299.71 s [vector] mut_foldrM: OK
  4791. 299.71 s [vector] +++ OK, passed 100 tests.
  4792. 299.71 s [vector] mut_foldrM': OK
  4793. 299.71 s [vector] +++ OK, passed 100 tests.
  4794. 299.71 s [vector] mut_ifoldM: OK
  4795. 299.71 s [vector] +++ OK, passed 100 tests.
  4796. 299.71 s [vector] mut_ifoldM': OK
  4797. 299.71 s [vector] +++ OK, passed 100 tests.
  4798. 299.72 s [vector] mut_ifoldrM: OK
  4799. 299.72 s [vector] +++ OK, passed 100 tests.
  4800. 299.72 s [vector] mut_ifoldrM': OK
  4801. 299.72 s [vector] +++ OK, passed 100 tests.
  4802. 299.72 s [vector] compare: OK
  4803. 299.72 s [vector] +++ OK, passed 100 tests.
  4804. 299.72 s [vector] maximum: OK
  4805. 299.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4806. 299.72 s [vector] minimum: OK
  4807. 299.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4808. 299.72 s [vector] minIndex: OK
  4809. 299.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4810. 299.72 s [vector] maxIndex: OK
  4811. 299.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4812. 299.72 s [vector] maximumBy: OK
  4813. 299.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4814. 299.72 s [vector] minimumBy: OK
  4815. 299.72 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4816. 299.73 s [vector] maximumOn: OK
  4817. 299.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4818. 299.73 s [vector] minimumOn: OK
  4819. 299.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4820. 299.73 s [vector] maxIndexBy: OK
  4821. 299.73 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4822. 299.73 s [vector] minIndexBy: OK
  4823. 299.73 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4824. 299.73 s [vector] ListFirstMaxIndexWins: OK
  4825. 299.73 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4826. 299.73 s [vector] FalseListFirstMaxIndexWins: OK
  4827. 299.73 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  4828. 299.73 s [vector] []
  4829. 299.73 s [vector] zip: OK
  4830. 299.73 s [vector] +++ OK, passed 100 tests.
  4831. 299.73 s [vector] zip3: OK
  4832. 299.73 s [vector] +++ OK, passed 100 tests.
  4833. 299.73 s [vector] unzip: OK
  4834. 299.73 s [vector] +++ OK, passed 100 tests.
  4835. 299.73 s [vector] unzip3: OK
  4836. 299.73 s [vector] +++ OK, passed 100 tests.
  4837. 299.74 s [vector] indexed: OK
  4838. 299.74 s [vector] +++ OK, passed 100 tests.
  4839. 299.74 s [vector] update: OK
  4840. 299.74 s [vector] +++ OK, passed 100 tests.
  4841. 299.75 s [vector] concat: OK (0.01s)
  4842. 299.75 s [vector] +++ OK, passed 100 tests.
  4843. 299.75 s [vector] mempty: OK
  4844. 299.75 s [vector] +++ OK, passed 1 test.
  4845. 299.75 s [vector] mappend: OK
  4846. 299.75 s [vector] +++ OK, passed 100 tests.
  4847. 299.76 s [vector] mconcat: OK
  4848. 299.76 s [vector] +++ OK, passed 100 tests.
  4849. 299.76 s [vector] fmap: OK
  4850. 299.76 s [vector] +++ OK, passed 100 tests.
  4851. 299.76 s [vector] return: OK
  4852. 299.76 s [vector] +++ OK, passed 100 tests.
  4853. 299.77 s [vector] bind: OK (0.02s)
  4854. 299.77 s [vector] +++ OK, passed 100 tests.
  4855. 299.77 s [vector] mzip: OK
  4856. 299.77 s [vector] +++ OK, passed 100 tests.
  4857. 299.77 s [vector] munzip: OK
  4858. 299.77 s [vector] +++ OK, passed 100 tests.
  4859. 299.78 s [vector] applicative_pure: OK
  4860. 299.78 s [vector] +++ OK, passed 100 tests.
  4861. 299.79 s [vector] applicative_appl: OK (0.02s)
  4862. 299.79 s [vector] +++ OK, passed 100 tests.
  4863. 299.80 s [vector] alternative_empty: OK
  4864. 299.80 s [vector] +++ OK, passed 1 test.
  4865. 299.80 s [vector] alternative_or: OK
  4866. 299.80 s [vector] +++ OK, passed 100 tests.
  4867. 299.83 s [vector] sequence: OK (0.02s)
  4868. 299.83 s [vector] +++ OK, passed 100 tests.
  4869. 299.83 s [vector] sequence_: OK
  4870. 299.83 s [vector] +++ OK, passed 100 tests.
  4871. 299.83 s [vector] glength: OK
  4872. 299.83 s [vector] +++ OK, passed 100 tests.
  4873. 299.83 s [vector] and: OK
  4874. 299.83 s [vector] +++ OK, passed 100 tests.
  4875. 299.83 s [vector] or: OK
  4876. 299.83 s [vector] +++ OK, passed 100 tests.
  4877. 299.83 s [vector] Int
  4878. 299.83 s [vector] fromList.toList == id: OK
  4879. 299.84 s [vector] +++ OK, passed 100 tests.
  4880. 299.84 s [vector] toList.fromList == id: OK
  4881. 299.84 s [vector] +++ OK, passed 100 tests.
  4882. 299.84 s [vector] unstream.stream == id: OK
  4883. 299.84 s [vector] +++ OK, passed 100 tests.
  4884. 299.84 s [vector] stream.unstream == id: OK
  4885. 299.84 s [vector] +++ OK, passed 100 tests.
  4886. 299.84 s [vector] eq: OK
  4887. 299.84 s [vector] +++ OK, passed 100 tests.
  4888. 299.84 s [vector] length: OK
  4889. 299.84 s [vector] +++ OK, passed 100 tests.
  4890. 299.84 s [vector] null: OK
  4891. 299.84 s [vector] +++ OK, passed 100 tests.
  4892. 299.84 s [vector] index: OK
  4893. 299.84 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4894. 299.84 s [vector] safeIndex: OK
  4895. 299.84 s [vector] +++ OK, passed 100 tests.
  4896. 299.84 s [vector] head: OK
  4897. 299.84 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4898. 299.84 s [vector] last: OK
  4899. 299.84 s [vector] +++ OK, passed 100 tests; 23 discarded.
  4900. 299.84 s [vector] unsafeIndex: OK
  4901. 299.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4902. 299.84 s [vector] unsafeHead: OK
  4903. 299.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4904. 299.84 s [vector] unsafeLast: OK
  4905. 299.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4906. 299.84 s [vector] slice: OK
  4907. 299.84 s [vector] +++ OK, passed 100 tests.
  4908. 299.84 s [vector] init: OK
  4909. 299.84 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4910. 299.84 s [vector] tail: OK
  4911. 299.84 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4912. 299.85 s [vector] take: OK
  4913. 299.85 s [vector] +++ OK, passed 100 tests.
  4914. 299.85 s [vector] drop: OK
  4915. 299.85 s [vector] +++ OK, passed 100 tests.
  4916. 299.85 s [vector] splitAt: OK
  4917. 299.85 s [vector] +++ OK, passed 100 tests.
  4918. 299.85 s [vector] empty: OK
  4919. 299.85 s [vector] +++ OK, passed 1 test.
  4920. 299.85 s [vector] singleton: OK
  4921. 299.85 s [vector] +++ OK, passed 100 tests.
  4922. 299.85 s [vector] replicate: OK
  4923. 299.85 s [vector] +++ OK, passed 100 tests.
  4924. 299.85 s [vector] generate: OK
  4925. 299.85 s [vector] +++ OK, passed 100 tests.
  4926. 299.85 s [vector] iterateN: OK
  4927. 299.86 s [vector] +++ OK, passed 100 tests.
  4928. 299.90 s [vector] iterateNM: OK (0.03s)
  4929. 299.90 s [vector] +++ OK, passed 100 tests.
  4930. 299.90 s [vector] generateM: OK (0.01s)
  4931. 299.90 s [vector] +++ OK, passed 100 tests.
  4932. 299.92 s [vector] replicateM: OK (0.02s)
  4933. 299.92 s [vector] +++ OK, passed 100 tests.
  4934. 299.92 s [vector] create: OK
  4935. 299.93 s [vector] +++ OK, passed 100 tests.
  4936. 299.93 s [vector] createT: OK
  4937. 299.93 s [vector] +++ OK, passed 100 tests.
  4938. 299.93 s [vector] unfoldr: OK
  4939. 299.93 s [vector] +++ OK, passed 100 tests.
  4940. 299.93 s [vector] unfoldrN: OK
  4941. 299.93 s [vector] +++ OK, passed 100 tests.
  4942. 299.93 s [vector] unfoldrExactN: OK
  4943. 299.93 s [vector] +++ OK, passed 100 tests.
  4944. 299.93 s [vector] unfoldrM: OK
  4945. 299.93 s [vector] +++ OK, passed 100 tests.
  4946. 299.93 s [vector] unfoldrNM: OK
  4947. 299.95 s [vector] +++ OK, passed 100 tests.
  4948. 300.01 s [vector] unfoldrExactNM: OK (0.07s)
  4949. 300.01 s [vector] +++ OK, passed 100 tests.
  4950. 300.01 s [vector] constructN: OK
  4951. 300.01 s [vector] +++ OK, passed 100 tests.
  4952. 300.01 s [vector] constructrN: OK
  4953. 300.01 s [vector] +++ OK, passed 100 tests.
  4954. 300.01 s [vector] cons: OK
  4955. 300.01 s [vector] +++ OK, passed 100 tests.
  4956. 300.01 s [vector] snoc: OK
  4957. 300.01 s [vector] +++ OK, passed 100 tests.
  4958. 300.01 s [vector] append: OK
  4959. 300.01 s [vector] +++ OK, passed 100 tests.
  4960. 300.03 s [vector] concat: OK
  4961. 300.03 s [vector] +++ OK, passed 100 tests.
  4962. 300.03 s [vector] force: OK
  4963. 300.03 s [vector] +++ OK, passed 100 tests.
  4964. 300.03 s [vector] upd: OK
  4965. 300.03 s [vector] +++ OK, passed 100 tests.
  4966. 300.04 s [vector] accum: OK
  4967. 300.04 s [vector] +++ OK, passed 100 tests.
  4968. 300.04 s [vector] reverse: OK
  4969. 300.04 s [vector] +++ OK, passed 100 tests.
  4970. 300.04 s [vector] backpermute: OK
  4971. 300.04 s [vector] +++ OK, passed 100 tests.
  4972. 300.04 s [vector] map: OK
  4973. 300.04 s [vector] +++ OK, passed 100 tests.
  4974. 300.04 s [vector] imap: OK
  4975. 300.05 s [vector] +++ OK, passed 100 tests.
  4976. 300.05 s [vector] concatMap: OK
  4977. 300.05 s [vector] +++ OK, passed 100 tests.
  4978. 300.06 s [vector] mapM: OK
  4979. 300.06 s [vector] +++ OK, passed 100 tests.
  4980. 300.07 s [vector] mapM_: OK (0.02s)
  4981. 300.08 s [vector] +++ OK, passed 100 tests.
  4982. 300.08 s [vector] forM: OK
  4983. 300.08 s [vector] +++ OK, passed 100 tests.
  4984. 300.10 s [vector] forM_: OK (0.02s)
  4985. 300.10 s [vector] +++ OK, passed 100 tests.
  4986. 300.10 s [vector] imapM: OK
  4987. 300.12 s [vector] +++ OK, passed 100 tests.
  4988. 300.12 s [vector] imapM_: OK (0.02s)
  4989. 300.13 s [vector] +++ OK, passed 100 tests.
  4990. 300.13 s [vector] zipWith: OK
  4991. 300.13 s [vector] +++ OK, passed 100 tests.
  4992. 300.13 s [vector] zipWith3: OK
  4993. 300.13 s [vector] +++ OK, passed 100 tests.
  4994. 300.13 s [vector] izipWith: OK
  4995. 300.13 s [vector] +++ OK, passed 100 tests.
  4996. 300.13 s [vector] izipWith3: OK
  4997. 300.14 s [vector] +++ OK, passed 100 tests.
  4998. 300.14 s [vector] izipWithM: OK
  4999. 300.14 s [vector] +++ OK, passed 100 tests.
  5000. 300.16 s [vector] izipWithM_: OK (0.02s)
  5001. 300.16 s [vector] +++ OK, passed 100 tests.
  5002. 300.16 s [vector] zipWithM: OK
  5003. 300.16 s [vector] +++ OK, passed 100 tests.
  5004. 300.17 s [vector] zipWithM_: OK (0.01s)
  5005. 300.17 s [vector] +++ OK, passed 100 tests.
  5006. 300.17 s [vector] filter: OK
  5007. 300.17 s [vector] +++ OK, passed 100 tests.
  5008. 300.18 s [vector] ifilter: OK
  5009. 300.18 s [vector] +++ OK, passed 100 tests.
  5010. 300.21 s [vector] filterM: OK (0.03s)
  5011. 300.21 s [vector] +++ OK, passed 100 tests.
  5012. 300.21 s [vector] uniq: OK
  5013. 300.22 s [vector] +++ OK, passed 100 tests.
  5014. 300.22 s [vector] mapMaybe: OK
  5015. 300.22 s [vector] +++ OK, passed 100 tests.
  5016. 300.22 s [vector] imapMaybe: OK
  5017. 300.22 s [vector] +++ OK, passed 100 tests.
  5018. 300.22 s [vector] takeWhile: OK
  5019. 300.22 s [vector] +++ OK, passed 100 tests.
  5020. 300.22 s [vector] dropWhile: OK
  5021. 300.22 s [vector] +++ OK, passed 100 tests.
  5022. 300.22 s [vector] partition: OK
  5023. 300.22 s [vector] +++ OK, passed 100 tests.
  5024. 300.22 s [vector] partitionWith: OK
  5025. 300.22 s [vector] +++ OK, passed 100 tests.
  5026. 300.22 s [vector] span: OK
  5027. 300.22 s [vector] +++ OK, passed 100 tests.
  5028. 300.22 s [vector] break: OK
  5029. 300.22 s [vector] +++ OK, passed 100 tests.
  5030. 300.22 s [vector] spanR: OK
  5031. 300.22 s [vector] +++ OK, passed 100 tests.
  5032. 300.22 s [vector] breakR: OK
  5033. 300.22 s [vector] +++ OK, passed 100 tests.
  5034. 300.22 s [vector] groupBy: OK
  5035. 300.22 s [vector] +++ OK, passed 100 tests.
  5036. 300.22 s [vector] elem: OK
  5037. 300.22 s [vector] +++ OK, passed 100 tests.
  5038. 300.22 s [vector] notElem: OK
  5039. 300.23 s [vector] +++ OK, passed 100 tests.
  5040. 300.23 s [vector] find: OK
  5041. 300.23 s [vector] +++ OK, passed 100 tests.
  5042. 300.23 s [vector] findIndex: OK
  5043. 300.23 s [vector] +++ OK, passed 100 tests.
  5044. 300.23 s [vector] findIndexR: OK
  5045. 300.23 s [vector] +++ OK, passed 100 tests.
  5046. 300.23 s [vector] findIndices: OK
  5047. 300.23 s [vector] +++ OK, passed 100 tests.
  5048. 300.23 s [vector] elemIndex: OK
  5049. 300.23 s [vector] +++ OK, passed 100 tests.
  5050. 300.23 s [vector] elemIndices: OK
  5051. 300.23 s [vector] +++ OK, passed 100 tests.
  5052. 300.24 s [vector] foldl: OK
  5053. 300.24 s [vector] +++ OK, passed 100 tests.
  5054. 300.24 s [vector] foldl1: OK
  5055. 300.24 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5056. 300.24 s [vector] foldl': OK
  5057. 300.24 s [vector] +++ OK, passed 100 tests.
  5058. 300.24 s [vector] foldl1': OK
  5059. 300.24 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5060. 300.24 s [vector] foldr: OK
  5061. 300.24 s [vector] +++ OK, passed 100 tests.
  5062. 300.25 s [vector] foldr1: OK
  5063. 300.25 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5064. 300.25 s [vector] foldr': OK
  5065. 300.25 s [vector] +++ OK, passed 100 tests.
  5066. 300.25 s [vector] foldr1': OK
  5067. 300.25 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5068. 300.26 s [vector] ifoldl: OK (0.01s)
  5069. 300.26 s [vector] +++ OK, passed 100 tests.
  5070. 300.27 s [vector] ifoldl': OK
  5071. 300.27 s [vector] +++ OK, passed 100 tests.
  5072. 300.27 s [vector] ifoldr: OK
  5073. 300.28 s [vector] +++ OK, passed 100 tests.
  5074. 300.28 s [vector] ifoldr': OK
  5075. 300.28 s [vector] +++ OK, passed 100 tests.
  5076. 300.28 s [vector] ifoldM: OK
  5077. 300.28 s [vector] +++ OK, passed 100 tests.
  5078. 300.30 s [vector] ifoldM': OK
  5079. 300.30 s [vector] +++ OK, passed 100 tests.
  5080. 300.32 s [vector] ifoldM_: OK (0.02s)
  5081. 300.32 s [vector] +++ OK, passed 100 tests.
  5082. 300.32 s [vector] ifoldM'_: OK (0.02s)
  5083. 300.32 s [vector] +++ OK, passed 100 tests.
  5084. 300.32 s [vector] all: OK
  5085. 300.32 s [vector] +++ OK, passed 100 tests.
  5086. 300.32 s [vector] any: OK
  5087. 300.32 s [vector] +++ OK, passed 100 tests.
  5088. 300.33 s [vector] prescanl: OK
  5089. 300.33 s [vector] +++ OK, passed 100 tests.
  5090. 300.33 s [vector] prescanl': OK
  5091. 300.33 s [vector] +++ OK, passed 100 tests.
  5092. 300.33 s [vector] postscanl: OK
  5093. 300.33 s [vector] +++ OK, passed 100 tests.
  5094. 300.33 s [vector] postscanl': OK
  5095. 300.33 s [vector] +++ OK, passed 100 tests.
  5096. 300.34 s [vector] scanl: OK
  5097. 300.34 s [vector] +++ OK, passed 100 tests.
  5098. 300.34 s [vector] scanl': OK
  5099. 300.34 s [vector] +++ OK, passed 100 tests.
  5100. 300.34 s [vector] scanl1: OK
  5101. 300.34 s [vector] +++ OK, passed 100 tests.
  5102. 300.35 s [vector] scanl1': OK
  5103. 300.35 s [vector] +++ OK, passed 100 tests.
  5104. 300.35 s [vector] iscanl: OK
  5105. 300.35 s [vector] +++ OK, passed 100 tests.
  5106. 300.35 s [vector] iscanl': OK
  5107. 300.36 s [vector] +++ OK, passed 100 tests.
  5108. 300.36 s [vector] prescanr: OK
  5109. 300.36 s [vector] +++ OK, passed 100 tests.
  5110. 300.36 s [vector] prescanr': OK
  5111. 300.36 s [vector] +++ OK, passed 100 tests.
  5112. 300.36 s [vector] postscanr: OK
  5113. 300.36 s [vector] +++ OK, passed 100 tests.
  5114. 300.37 s [vector] postscanr': OK
  5115. 300.37 s [vector] +++ OK, passed 100 tests.
  5116. 300.37 s [vector] scanr: OK
  5117. 300.37 s [vector] +++ OK, passed 100 tests.
  5118. 300.37 s [vector] scanr': OK
  5119. 300.37 s [vector] +++ OK, passed 100 tests.
  5120. 300.37 s [vector] scanr1: OK
  5121. 300.37 s [vector] +++ OK, passed 100 tests.
  5122. 300.37 s [vector] scanr1': OK
  5123. 300.38 s [vector] +++ OK, passed 100 tests.
  5124. 300.38 s [vector] iscanr: OK
  5125. 300.38 s [vector] +++ OK, passed 100 tests.
  5126. 300.38 s [vector] iscanr': OK
  5127. 300.38 s [vector] +++ OK, passed 100 tests.
  5128. 300.38 s [vector] mut_read: OK
  5129. 300.38 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5130. 300.38 s [vector] mut_write: OK
  5131. 300.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5132. 300.39 s [vector] mut_modify: OK
  5133. 300.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5134. 300.39 s [vector] mut_generate: OK
  5135. 300.39 s [vector] +++ OK, passed 100 tests.
  5136. 300.42 s [vector] mut_generateM: OK (0.01s)
  5137. 300.42 s [vector] +++ OK, passed 100 tests.
  5138. 300.44 s [vector] mut_mapM_: OK (0.02s)
  5139. 300.44 s [vector] +++ OK, passed 100 tests.
  5140. 300.44 s [vector] mut_imapM_: OK (0.02s)
  5141. 300.44 s [vector] +++ OK, passed 100 tests.
  5142. 300.46 s [vector] mut_forM_: OK
  5143. 300.46 s [vector] +++ OK, passed 100 tests.
  5144. 300.48 s [vector] mut_iforM_: OK (0.02s)
  5145. 300.48 s [vector] +++ OK, passed 100 tests.
  5146. 300.48 s [vector] mut_foldr: OK
  5147. 300.48 s [vector] +++ OK, passed 100 tests.
  5148. 300.49 s [vector] mut_foldr': OK
  5149. 300.49 s [vector] +++ OK, passed 100 tests.
  5150. 300.49 s [vector] mut_foldl: OK
  5151. 300.49 s [vector] +++ OK, passed 100 tests.
  5152. 300.49 s [vector] mut_foldl': OK
  5153. 300.49 s [vector] +++ OK, passed 100 tests.
  5154. 300.49 s [vector] mut_ifoldr: OK
  5155. 300.49 s [vector] +++ OK, passed 100 tests.
  5156. 300.50 s [vector] mut_ifoldr': OK
  5157. 300.50 s [vector] +++ OK, passed 100 tests.
  5158. 300.51 s [vector] mut_ifoldl: OK
  5159. 300.51 s [vector] +++ OK, passed 100 tests.
  5160. 300.51 s [vector] mut_ifoldl': OK
  5161. 300.51 s [vector] +++ OK, passed 100 tests.
  5162. 300.51 s [vector] mut_foldM: OK
  5163. 300.51 s [vector] +++ OK, passed 100 tests.
  5164. 300.51 s [vector] mut_foldM': OK
  5165. 300.52 s [vector] +++ OK, passed 100 tests.
  5166. 300.52 s [vector] mut_foldrM: OK
  5167. 300.52 s [vector] +++ OK, passed 100 tests.
  5168. 300.52 s [vector] mut_foldrM': OK
  5169. 300.53 s [vector] +++ OK, passed 100 tests.
  5170. 300.53 s [vector] mut_ifoldM: OK
  5171. 300.53 s [vector] +++ OK, passed 100 tests.
  5172. 300.53 s [vector] mut_ifoldM': OK
  5173. 300.54 s [vector] +++ OK, passed 100 tests.
  5174. 300.54 s [vector] mut_ifoldrM: OK
  5175. 300.54 s [vector] +++ OK, passed 100 tests.
  5176. 300.54 s [vector] mut_ifoldrM': OK
  5177. 300.54 s [vector] +++ OK, passed 100 tests.
  5178. 300.54 s [vector] compare: OK
  5179. 300.54 s [vector] +++ OK, passed 100 tests.
  5180. 300.54 s [vector] maximum: OK
  5181. 300.54 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5182. 300.54 s [vector] minimum: OK
  5183. 300.54 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5184. 300.54 s [vector] minIndex: OK
  5185. 300.54 s [vector] +++ OK, passed 100 tests; 23 discarded.
  5186. 300.54 s [vector] maxIndex: OK
  5187. 300.55 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5188. 300.55 s [vector] maximumBy: OK
  5189. 300.55 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5190. 300.55 s [vector] minimumBy: OK
  5191. 300.55 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5192. 300.55 s [vector] maximumOn: OK
  5193. 300.55 s [vector] +++ OK, passed 100 tests; 24 discarded.
  5194. 300.55 s [vector] minimumOn: OK
  5195. 300.55 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5196. 300.55 s [vector] maxIndexBy: OK
  5197. 300.55 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5198. 300.55 s [vector] minIndexBy: OK
  5199. 300.55 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5200. 300.55 s [vector] ListFirstMaxIndexWins: OK
  5201. 300.55 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5202. 300.55 s [vector] FalseListFirstMaxIndexWins: OK
  5203. 300.55 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  5204. 300.55 s [vector] []
  5205. 300.55 s [vector] zip: OK
  5206. 300.55 s [vector] +++ OK, passed 100 tests.
  5207. 300.55 s [vector] zip3: OK
  5208. 300.55 s [vector] +++ OK, passed 100 tests.
  5209. 300.56 s [vector] unzip: OK
  5210. 300.56 s [vector] +++ OK, passed 100 tests.
  5211. 300.56 s [vector] unzip3: OK
  5212. 300.56 s [vector] +++ OK, passed 100 tests.
  5213. 300.56 s [vector] indexed: OK
  5214. 300.56 s [vector] +++ OK, passed 100 tests.
  5215. 300.56 s [vector] update: OK
  5216. 300.56 s [vector] +++ OK, passed 100 tests.
  5217. 300.57 s [vector] concat: OK (0.02s)
  5218. 300.57 s [vector] +++ OK, passed 100 tests.
  5219. 300.58 s [vector] mempty: OK
  5220. 300.58 s [vector] +++ OK, passed 1 test.
  5221. 300.58 s [vector] mappend: OK
  5222. 300.58 s [vector] +++ OK, passed 100 tests.
  5223. 300.59 s [vector] mconcat: OK (0.01s)
  5224. 300.59 s [vector] +++ OK, passed 100 tests.
  5225. 300.59 s [vector] fmap: OK
  5226. 300.59 s [vector] +++ OK, passed 100 tests.
  5227. 300.59 s [vector] return: OK
  5228. 300.61 s [vector] +++ OK, passed 100 tests.
  5229. 300.62 s [vector] bind: OK (0.02s)
  5230. 300.62 s [vector] +++ OK, passed 100 tests.
  5231. 300.62 s [vector] mzip: OK
  5232. 300.62 s [vector] +++ OK, passed 100 tests.
  5233. 300.62 s [vector] munzip: OK
  5234. 300.62 s [vector] +++ OK, passed 100 tests.
  5235. 300.62 s [vector] applicative_pure: OK
  5236. 300.62 s [vector] +++ OK, passed 100 tests.
  5237. 300.66 s [vector] applicative_appl: OK (0.04s)
  5238. 300.66 s [vector] +++ OK, passed 100 tests.
  5239. 300.66 s [vector] alternative_empty: OK
  5240. 300.66 s [vector] +++ OK, passed 1 test.
  5241. 300.66 s [vector] alternative_or: OK
  5242. 300.66 s [vector] +++ OK, passed 100 tests.
  5243. 300.71 s [vector] sequence: OK (0.02s)
  5244. 300.71 s [vector] +++ OK, passed 100 tests.
  5245. 300.71 s [vector] sequence_: OK (0.01s)
  5246. 300.71 s [vector] +++ OK, passed 100 tests.
  5247. 300.71 s [vector] glength: OK
  5248. 300.71 s [vector] +++ OK, passed 100 tests.
  5249. 300.71 s [vector] sum: OK
  5250. 300.71 s [vector] +++ OK, passed 100 tests.
  5251. 300.71 s [vector] product: OK
  5252. 300.71 s [vector] +++ OK, passed 100 tests.
  5253. 300.71 s [vector] enumFromN: OK
  5254. 300.71 s [vector] +++ OK, passed 100 tests.
  5255. 300.71 s [vector] enumFromThenN: OK
  5256. 300.71 s [vector] +++ OK, passed 100 tests.
  5257. 300.71 s [vector] enumFromTo: OK
  5258. 300.71 s [vector] +++ OK, passed 100 tests.
  5259. 300.71 s [vector] enumFromThenTo: OK
  5260. 300.72 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5261. 300.72 s [vector] unstream
  5262. 300.72 s [vector] unstream == vunstream (exact): OK
  5263. 300.72 s [vector] +++ OK, passed 100 tests.
  5264. 300.72 s [vector] unstream == vunstream (unknown): OK
  5265. 300.72 s [vector] +++ OK, passed 100 tests.
  5266. 300.73 s [vector] unstreamR ~= vunstream (exact): OK
  5267. 300.73 s [vector] +++ OK, passed 100 tests.
  5268. 300.73 s [vector] unstreamR ~= vunstream (unknown): OK
  5269. 300.73 s [vector] +++ OK, passed 100 tests.
  5270. 300.73 s [vector] Tests.Vector.Unboxed
  5271. 300.73 s [vector] ()
  5272. 300.73 s [vector] fromList.toList == id: OK
  5273. 300.73 s [vector] +++ OK, passed 100 tests.
  5274. 300.73 s [vector] toList.fromList == id: OK
  5275. 300.73 s [vector] +++ OK, passed 100 tests.
  5276. 300.73 s [vector] unstream.stream == id: OK
  5277. 300.73 s [vector] +++ OK, passed 100 tests.
  5278. 300.73 s [vector] stream.unstream == id: OK
  5279. 300.73 s [vector] +++ OK, passed 100 tests.
  5280. 300.73 s [vector] eq: OK
  5281. 300.73 s [vector] +++ OK, passed 100 tests.
  5282. 300.73 s [vector] length: OK
  5283. 300.73 s [vector] +++ OK, passed 100 tests.
  5284. 300.73 s [vector] null: OK
  5285. 300.73 s [vector] +++ OK, passed 100 tests.
  5286. 300.73 s [vector] index: OK
  5287. 300.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5288. 300.73 s [vector] safeIndex: OK
  5289. 300.73 s [vector] +++ OK, passed 100 tests.
  5290. 300.73 s [vector] head: OK
  5291. 300.73 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5292. 300.73 s [vector] last: OK
  5293. 300.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5294. 300.73 s [vector] unsafeIndex: OK
  5295. 300.73 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5296. 300.73 s [vector] unsafeHead: OK
  5297. 300.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5298. 300.73 s [vector] unsafeLast: OK
  5299. 300.73 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5300. 300.73 s [vector] slice: OK
  5301. 300.73 s [vector] +++ OK, passed 100 tests.
  5302. 300.73 s [vector] init: OK
  5303. 300.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5304. 300.73 s [vector] tail: OK
  5305. 300.73 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5306. 300.73 s [vector] take: OK
  5307. 300.73 s [vector] +++ OK, passed 100 tests.
  5308. 300.73 s [vector] drop: OK
  5309. 300.73 s [vector] +++ OK, passed 100 tests.
  5310. 300.73 s [vector] splitAt: OK
  5311. 300.73 s [vector] +++ OK, passed 100 tests.
  5312. 300.73 s [vector] empty: OK
  5313. 300.73 s [vector] +++ OK, passed 1 test.
  5314. 300.73 s [vector] singleton: OK
  5315. 300.73 s [vector] +++ OK, passed 100 tests.
  5316. 300.73 s [vector] replicate: OK
  5317. 300.73 s [vector] +++ OK, passed 100 tests.
  5318. 300.73 s [vector] generate: OK
  5319. 300.73 s [vector] +++ OK, passed 100 tests.
  5320. 300.73 s [vector] iterateN: OK
  5321. 300.75 s [vector] +++ OK, passed 100 tests.
  5322. 300.77 s [vector] iterateNM: OK (0.02s)
  5323. 300.77 s [vector] +++ OK, passed 100 tests.
  5324. 300.78 s [vector] generateM: OK (0.01s)
  5325. 300.78 s [vector] +++ OK, passed 100 tests.
  5326. 300.78 s [vector] replicateM: OK
  5327. 300.78 s [vector] +++ OK, passed 100 tests.
  5328. 300.78 s [vector] create: OK
  5329. 300.78 s [vector] +++ OK, passed 100 tests.
  5330. 300.78 s [vector] createT: OK
  5331. 300.78 s [vector] +++ OK, passed 100 tests.
  5332. 300.78 s [vector] unfoldr: OK
  5333. 300.78 s [vector] +++ OK, passed 100 tests.
  5334. 300.79 s [vector] unfoldrN: OK
  5335. 300.79 s [vector] +++ OK, passed 100 tests.
  5336. 300.79 s [vector] unfoldrExactN: OK
  5337. 300.79 s [vector] +++ OK, passed 100 tests.
  5338. 300.79 s [vector] unfoldrM: OK
  5339. 300.81 s [vector] +++ OK, passed 100 tests.
  5340. 300.81 s [vector] unfoldrNM: OK (0.01s)
  5341. 300.81 s [vector] +++ OK, passed 100 tests.
  5342. 300.83 s [vector] unfoldrExactNM: OK (0.03s)
  5343. 300.83 s [vector] +++ OK, passed 100 tests.
  5344. 300.83 s [vector] constructN: OK
  5345. 300.84 s [vector] +++ OK, passed 100 tests.
  5346. 300.84 s [vector] constructrN: OK
  5347. 300.84 s [vector] +++ OK, passed 100 tests.
  5348. 300.84 s [vector] cons: OK
  5349. 300.84 s [vector] +++ OK, passed 100 tests.
  5350. 300.84 s [vector] snoc: OK
  5351. 300.84 s [vector] +++ OK, passed 100 tests.
  5352. 300.85 s [vector] append: OK
  5353. 300.85 s [vector] +++ OK, passed 100 tests.
  5354. 300.85 s [vector] concat: OK
  5355. 300.85 s [vector] +++ OK, passed 100 tests.
  5356. 300.85 s [vector] force: OK
  5357. 300.85 s [vector] +++ OK, passed 100 tests.
  5358. 300.85 s [vector] upd: OK
  5359. 300.85 s [vector] +++ OK, passed 100 tests.
  5360. 300.85 s [vector] accum: OK
  5361. 300.85 s [vector] +++ OK, passed 100 tests.
  5362. 300.85 s [vector] reverse: OK
  5363. 300.85 s [vector] +++ OK, passed 100 tests.
  5364. 300.85 s [vector] backpermute: OK
  5365. 300.85 s [vector] +++ OK, passed 100 tests.
  5366. 300.85 s [vector] map: OK
  5367. 300.86 s [vector] +++ OK, passed 100 tests.
  5368. 300.86 s [vector] imap: OK
  5369. 300.86 s [vector] +++ OK, passed 100 tests.
  5370. 300.86 s [vector] concatMap: OK
  5371. 300.86 s [vector] +++ OK, passed 100 tests.
  5372. 300.87 s [vector] mapM: OK
  5373. 300.87 s [vector] +++ OK, passed 100 tests.
  5374. 300.87 s [vector] mapM_: OK (0.01s)
  5375. 300.87 s [vector] +++ OK, passed 100 tests.
  5376. 300.88 s [vector] forM: OK
  5377. 300.88 s [vector] +++ OK, passed 100 tests.
  5378. 300.88 s [vector] forM_: OK (0.01s)
  5379. 300.88 s [vector] +++ OK, passed 100 tests.
  5380. 300.88 s [vector] imapM: OK
  5381. 300.89 s [vector] +++ OK, passed 100 tests.
  5382. 300.90 s [vector] imapM_: OK (0.01s)
  5383. 300.90 s [vector] +++ OK, passed 100 tests.
  5384. 300.90 s [vector] zipWith: OK
  5385. 300.90 s [vector] +++ OK, passed 100 tests.
  5386. 300.90 s [vector] zipWith3: OK
  5387. 300.90 s [vector] +++ OK, passed 100 tests.
  5388. 300.91 s [vector] izipWith: OK
  5389. 300.91 s [vector] +++ OK, passed 100 tests.
  5390. 300.91 s [vector] izipWith3: OK
  5391. 300.91 s [vector] +++ OK, passed 100 tests.
  5392. 300.91 s [vector] izipWithM: OK
  5393. 300.91 s [vector] +++ OK, passed 100 tests.
  5394. 300.91 s [vector] izipWithM_: OK
  5395. 300.92 s [vector] +++ OK, passed 100 tests.
  5396. 300.92 s [vector] zipWithM: OK
  5397. 300.92 s [vector] +++ OK, passed 100 tests.
  5398. 300.93 s [vector] zipWithM_: OK
  5399. 300.93 s [vector] +++ OK, passed 100 tests.
  5400. 300.93 s [vector] filter: OK
  5401. 300.93 s [vector] +++ OK, passed 100 tests.
  5402. 300.93 s [vector] ifilter: OK
  5403. 300.94 s [vector] +++ OK, passed 100 tests.
  5404. 300.94 s [vector] filterM: OK (0.02s)
  5405. 300.94 s [vector] +++ OK, passed 100 tests.
  5406. 300.94 s [vector] uniq: OK
  5407. 300.95 s [vector] +++ OK, passed 100 tests.
  5408. 300.95 s [vector] mapMaybe: OK
  5409. 300.95 s [vector] +++ OK, passed 100 tests.
  5410. 300.95 s [vector] imapMaybe: OK
  5411. 300.95 s [vector] +++ OK, passed 100 tests.
  5412. 300.95 s [vector] takeWhile: OK
  5413. 300.95 s [vector] +++ OK, passed 100 tests.
  5414. 300.95 s [vector] dropWhile: OK
  5415. 300.95 s [vector] +++ OK, passed 100 tests.
  5416. 300.95 s [vector] partition: OK
  5417. 300.95 s [vector] +++ OK, passed 100 tests.
  5418. 300.95 s [vector] partitionWith: OK
  5419. 300.95 s [vector] +++ OK, passed 100 tests.
  5420. 300.95 s [vector] span: OK
  5421. 300.95 s [vector] +++ OK, passed 100 tests.
  5422. 300.96 s [vector] break: OK
  5423. 300.96 s [vector] +++ OK, passed 100 tests.
  5424. 300.96 s [vector] spanR: OK
  5425. 300.96 s [vector] +++ OK, passed 100 tests.
  5426. 300.96 s [vector] breakR: OK
  5427. 300.96 s [vector] +++ OK, passed 100 tests.
  5428. 300.96 s [vector] groupBy: OK
  5429. 300.96 s [vector] +++ OK, passed 100 tests.
  5430. 300.96 s [vector] elem: OK
  5431. 300.96 s [vector] +++ OK, passed 100 tests.
  5432. 300.96 s [vector] notElem: OK
  5433. 300.96 s [vector] +++ OK, passed 100 tests.
  5434. 300.96 s [vector] find: OK
  5435. 300.96 s [vector] +++ OK, passed 100 tests.
  5436. 300.96 s [vector] findIndex: OK
  5437. 300.96 s [vector] +++ OK, passed 100 tests.
  5438. 300.96 s [vector] findIndexR: OK
  5439. 300.96 s [vector] +++ OK, passed 100 tests.
  5440. 300.96 s [vector] findIndices: OK
  5441. 300.96 s [vector] +++ OK, passed 100 tests.
  5442. 300.96 s [vector] elemIndex: OK
  5443. 300.96 s [vector] +++ OK, passed 100 tests.
  5444. 300.96 s [vector] elemIndices: OK
  5445. 300.96 s [vector] +++ OK, passed 100 tests.
  5446. 300.96 s [vector] foldl: OK
  5447. 300.96 s [vector] +++ OK, passed 100 tests.
  5448. 300.96 s [vector] foldl1: OK
  5449. 300.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5450. 300.96 s [vector] foldl': OK
  5451. 300.96 s [vector] +++ OK, passed 100 tests.
  5452. 300.96 s [vector] foldl1': OK
  5453. 300.96 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5454. 300.96 s [vector] foldr: OK
  5455. 300.97 s [vector] +++ OK, passed 100 tests.
  5456. 300.97 s [vector] foldr1: OK
  5457. 300.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5458. 300.97 s [vector] foldr': OK
  5459. 300.97 s [vector] +++ OK, passed 100 tests.
  5460. 300.97 s [vector] foldr1': OK
  5461. 300.97 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5462. 300.97 s [vector] ifoldl: OK
  5463. 300.97 s [vector] +++ OK, passed 100 tests.
  5464. 300.97 s [vector] ifoldl': OK
  5465. 300.97 s [vector] +++ OK, passed 100 tests.
  5466. 300.97 s [vector] ifoldr: OK
  5467. 300.97 s [vector] +++ OK, passed 100 tests.
  5468. 300.98 s [vector] ifoldr': OK
  5469. 300.98 s [vector] +++ OK, passed 100 tests.
  5470. 300.98 s [vector] ifoldM: OK
  5471. 300.98 s [vector] +++ OK, passed 100 tests.
  5472. 300.99 s [vector] ifoldM': OK
  5473. 300.99 s [vector] +++ OK, passed 100 tests.
  5474. 301.01 s [vector] ifoldM_: OK (0.01s)
  5475. 301.01 s [vector] +++ OK, passed 100 tests.
  5476. 301.01 s [vector] ifoldM'_: OK (0.01s)
  5477. 301.01 s [vector] +++ OK, passed 100 tests.
  5478. 301.01 s [vector] all: OK
  5479. 301.01 s [vector] +++ OK, passed 100 tests.
  5480. 301.01 s [vector] any: OK
  5481. 301.01 s [vector] +++ OK, passed 100 tests.
  5482. 301.01 s [vector] prescanl: OK
  5483. 301.01 s [vector] +++ OK, passed 100 tests.
  5484. 301.01 s [vector] prescanl': OK
  5485. 301.01 s [vector] +++ OK, passed 100 tests.
  5486. 301.01 s [vector] postscanl: OK
  5487. 301.01 s [vector] +++ OK, passed 100 tests.
  5488. 301.01 s [vector] postscanl': OK
  5489. 301.01 s [vector] +++ OK, passed 100 tests.
  5490. 301.01 s [vector] scanl: OK
  5491. 301.01 s [vector] +++ OK, passed 100 tests.
  5492. 301.02 s [vector] scanl': OK
  5493. 301.02 s [vector] +++ OK, passed 100 tests.
  5494. 301.02 s [vector] scanl1: OK
  5495. 301.02 s [vector] +++ OK, passed 100 tests.
  5496. 301.02 s [vector] scanl1': OK
  5497. 301.02 s [vector] +++ OK, passed 100 tests.
  5498. 301.02 s [vector] iscanl: OK
  5499. 301.02 s [vector] +++ OK, passed 100 tests.
  5500. 301.02 s [vector] iscanl': OK
  5501. 301.02 s [vector] +++ OK, passed 100 tests.
  5502. 301.02 s [vector] prescanr: OK
  5503. 301.03 s [vector] +++ OK, passed 100 tests.
  5504. 301.03 s [vector] prescanr': OK
  5505. 301.03 s [vector] +++ OK, passed 100 tests.
  5506. 301.03 s [vector] postscanr: OK
  5507. 301.03 s [vector] +++ OK, passed 100 tests.
  5508. 301.03 s [vector] postscanr': OK
  5509. 301.03 s [vector] +++ OK, passed 100 tests.
  5510. 301.03 s [vector] scanr: OK
  5511. 301.03 s [vector] +++ OK, passed 100 tests.
  5512. 301.03 s [vector] scanr': OK
  5513. 301.03 s [vector] +++ OK, passed 100 tests.
  5514. 301.03 s [vector] scanr1: OK
  5515. 301.03 s [vector] +++ OK, passed 100 tests.
  5516. 301.03 s [vector] scanr1': OK
  5517. 301.03 s [vector] +++ OK, passed 100 tests.
  5518. 301.03 s [vector] iscanr: OK
  5519. 301.03 s [vector] +++ OK, passed 100 tests.
  5520. 301.03 s [vector] iscanr': OK
  5521. 301.04 s [vector] +++ OK, passed 100 tests.
  5522. 301.04 s [vector] mut_read: OK
  5523. 301.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5524. 301.04 s [vector] mut_write: OK
  5525. 301.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5526. 301.04 s [vector] mut_modify: OK
  5527. 301.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5528. 301.04 s [vector] mut_generate: OK
  5529. 301.04 s [vector] +++ OK, passed 100 tests.
  5530. 301.05 s [vector] mut_generateM: OK
  5531. 301.05 s [vector] +++ OK, passed 100 tests.
  5532. 301.07 s [vector] mut_mapM_: OK
  5533. 301.07 s [vector] +++ OK, passed 100 tests.
  5534. 301.07 s [vector] mut_imapM_: OK
  5535. 301.07 s [vector] +++ OK, passed 100 tests.
  5536. 301.09 s [vector] mut_forM_: OK
  5537. 301.09 s [vector] +++ OK, passed 100 tests.
  5538. 301.09 s [vector] mut_iforM_: OK (0.01s)
  5539. 301.09 s [vector] +++ OK, passed 100 tests.
  5540. 301.09 s [vector] mut_foldr: OK
  5541. 301.09 s [vector] +++ OK, passed 100 tests.
  5542. 301.09 s [vector] mut_foldr': OK
  5543. 301.09 s [vector] +++ OK, passed 100 tests.
  5544. 301.09 s [vector] mut_foldl: OK
  5545. 301.09 s [vector] +++ OK, passed 100 tests.
  5546. 301.09 s [vector] mut_foldl': OK
  5547. 301.09 s [vector] +++ OK, passed 100 tests.
  5548. 301.09 s [vector] mut_ifoldr: OK
  5549. 301.09 s [vector] +++ OK, passed 100 tests.
  5550. 301.09 s [vector] mut_ifoldr': OK
  5551. 301.09 s [vector] +++ OK, passed 100 tests.
  5552. 301.09 s [vector] mut_ifoldl: OK
  5553. 301.09 s [vector] +++ OK, passed 100 tests.
  5554. 301.09 s [vector] mut_ifoldl': OK
  5555. 301.09 s [vector] +++ OK, passed 100 tests.
  5556. 301.09 s [vector] mut_foldM: OK
  5557. 301.09 s [vector] +++ OK, passed 100 tests.
  5558. 301.10 s [vector] mut_foldM': OK
  5559. 301.10 s [vector] +++ OK, passed 100 tests.
  5560. 301.10 s [vector] mut_foldrM: OK
  5561. 301.10 s [vector] +++ OK, passed 100 tests.
  5562. 301.10 s [vector] mut_foldrM': OK
  5563. 301.10 s [vector] +++ OK, passed 100 tests.
  5564. 301.10 s [vector] mut_ifoldM: OK
  5565. 301.10 s [vector] +++ OK, passed 100 tests.
  5566. 301.10 s [vector] mut_ifoldM': OK
  5567. 301.10 s [vector] +++ OK, passed 100 tests.
  5568. 301.10 s [vector] mut_ifoldrM: OK
  5569. 301.10 s [vector] +++ OK, passed 100 tests.
  5570. 301.10 s [vector] mut_ifoldrM': OK
  5571. 301.10 s [vector] +++ OK, passed 100 tests.
  5572. 301.11 s [vector] compare: OK
  5573. 301.11 s [vector] +++ OK, passed 100 tests.
  5574. 301.11 s [vector] maximum: OK
  5575. 301.11 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5576. 301.11 s [vector] minimum: OK
  5577. 301.11 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5578. 301.11 s [vector] minIndex: OK
  5579. 301.11 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5580. 301.11 s [vector] maxIndex: OK
  5581. 301.11 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5582. 301.11 s [vector] maximumBy: OK
  5583. 301.11 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5584. 301.11 s [vector] minimumBy: OK
  5585. 301.11 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5586. 301.11 s [vector] maximumOn: OK
  5587. 301.11 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5588. 301.11 s [vector] minimumOn: OK
  5589. 301.11 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5590. 301.11 s [vector] maxIndexBy: OK
  5591. 301.11 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5592. 301.11 s [vector] minIndexBy: OK
  5593. 301.11 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5594. 301.11 s [vector] ListFirstMaxIndexWins: OK
  5595. 301.11 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5596. 301.11 s [vector] FalseListFirstMaxIndexWins: OK
  5597. 301.11 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  5598. 301.11 s [vector] []
  5599. 301.11 s [vector] zip: OK
  5600. 301.11 s [vector] +++ OK, passed 100 tests.
  5601. 301.11 s [vector] zip3: OK
  5602. 301.11 s [vector] +++ OK, passed 100 tests.
  5603. 301.12 s [vector] unzip: OK
  5604. 301.12 s [vector] +++ OK, passed 100 tests.
  5605. 301.12 s [vector] unzip3: OK
  5606. 301.12 s [vector] +++ OK, passed 100 tests.
  5607. 301.12 s [vector] indexed: OK
  5608. 301.12 s [vector] +++ OK, passed 100 tests.
  5609. 301.12 s [vector] update: OK
  5610. 301.12 s [vector] +++ OK, passed 100 tests.
  5611. 301.12 s [vector] mempty: OK
  5612. 301.12 s [vector] +++ OK, passed 1 test.
  5613. 301.13 s [vector] mappend: OK
  5614. 301.13 s [vector] +++ OK, passed 100 tests.
  5615. 301.13 s [vector] mconcat: OK (0.01s)
  5616. 301.13 s [vector] +++ OK, passed 100 tests.
  5617. 301.13 s [vector] glength: OK
  5618. 301.13 s [vector] +++ OK, passed 100 tests.
  5619. 301.13 s [vector] (Bool)
  5620. 301.13 s [vector] fromList.toList == id: OK
  5621. 301.13 s [vector] +++ OK, passed 100 tests.
  5622. 301.13 s [vector] toList.fromList == id: OK
  5623. 301.13 s [vector] +++ OK, passed 100 tests.
  5624. 301.13 s [vector] unstream.stream == id: OK
  5625. 301.13 s [vector] +++ OK, passed 100 tests.
  5626. 301.13 s [vector] stream.unstream == id: OK
  5627. 301.13 s [vector] +++ OK, passed 100 tests.
  5628. 301.13 s [vector] eq: OK
  5629. 301.13 s [vector] +++ OK, passed 100 tests.
  5630. 301.13 s [vector] length: OK
  5631. 301.13 s [vector] +++ OK, passed 100 tests.
  5632. 301.14 s [vector] null: OK
  5633. 301.14 s [vector] +++ OK, passed 100 tests.
  5634. 301.14 s [vector] index: OK
  5635. 301.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5636. 301.14 s [vector] safeIndex: OK
  5637. 301.14 s [vector] +++ OK, passed 100 tests.
  5638. 301.14 s [vector] head: OK
  5639. 301.14 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5640. 301.14 s [vector] last: OK
  5641. 301.14 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5642. 301.14 s [vector] unsafeIndex: OK
  5643. 301.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5644. 301.14 s [vector] unsafeHead: OK
  5645. 301.14 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5646. 301.14 s [vector] unsafeLast: OK
  5647. 301.14 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5648. 301.14 s [vector] slice: OK
  5649. 301.14 s [vector] +++ OK, passed 100 tests.
  5650. 301.14 s [vector] init: OK
  5651. 301.14 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5652. 301.14 s [vector] tail: OK
  5653. 301.14 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5654. 301.14 s [vector] take: OK
  5655. 301.14 s [vector] +++ OK, passed 100 tests.
  5656. 301.14 s [vector] drop: OK
  5657. 301.14 s [vector] +++ OK, passed 100 tests.
  5658. 301.14 s [vector] splitAt: OK
  5659. 301.14 s [vector] +++ OK, passed 100 tests.
  5660. 301.14 s [vector] empty: OK
  5661. 301.14 s [vector] +++ OK, passed 1 test.
  5662. 301.15 s [vector] singleton: OK
  5663. 301.15 s [vector] +++ OK, passed 100 tests.
  5664. 301.15 s [vector] replicate: OK
  5665. 301.15 s [vector] +++ OK, passed 100 tests.
  5666. 301.15 s [vector] generate: OK
  5667. 301.15 s [vector] +++ OK, passed 100 tests.
  5668. 301.15 s [vector] iterateN: OK
  5669. 301.15 s [vector] +++ OK, passed 100 tests.
  5670. 301.19 s [vector] iterateNM: OK (0.02s)
  5671. 301.19 s [vector] +++ OK, passed 100 tests.
  5672. 301.21 s [vector] generateM: OK (0.03s)
  5673. 301.21 s [vector] +++ OK, passed 100 tests.
  5674. 301.21 s [vector] replicateM: OK (0.01s)
  5675. 301.21 s [vector] +++ OK, passed 100 tests.
  5676. 301.21 s [vector] create: OK
  5677. 301.21 s [vector] +++ OK, passed 100 tests.
  5678. 301.21 s [vector] createT: OK
  5679. 301.21 s [vector] +++ OK, passed 100 tests.
  5680. 301.21 s [vector] unfoldr: OK
  5681. 301.21 s [vector] +++ OK, passed 100 tests.
  5682. 301.21 s [vector] unfoldrN: OK
  5683. 301.22 s [vector] +++ OK, passed 100 tests.
  5684. 301.22 s [vector] unfoldrExactN: OK
  5685. 301.22 s [vector] +++ OK, passed 100 tests.
  5686. 301.22 s [vector] unfoldrM: OK
  5687. 301.22 s [vector] +++ OK, passed 100 tests.
  5688. 301.23 s [vector] unfoldrNM: OK
  5689. 301.23 s [vector] +++ OK, passed 100 tests.
  5690. 301.29 s [vector] unfoldrExactNM: OK (0.06s)
  5691. 301.29 s [vector] +++ OK, passed 100 tests.
  5692. 301.29 s [vector] constructN: OK
  5693. 301.29 s [vector] +++ OK, passed 100 tests.
  5694. 301.29 s [vector] constructrN: OK
  5695. 301.29 s [vector] +++ OK, passed 100 tests.
  5696. 301.29 s [vector] cons: OK
  5697. 301.29 s [vector] +++ OK, passed 100 tests.
  5698. 301.29 s [vector] snoc: OK
  5699. 301.29 s [vector] +++ OK, passed 100 tests.
  5700. 301.31 s [vector] append: OK
  5701. 301.31 s [vector] +++ OK, passed 100 tests.
  5702. 301.31 s [vector] concat: OK (0.02s)
  5703. 301.31 s [vector] +++ OK, passed 100 tests.
  5704. 301.31 s [vector] force: OK
  5705. 301.31 s [vector] +++ OK, passed 100 tests.
  5706. 301.31 s [vector] upd: OK
  5707. 301.32 s [vector] +++ OK, passed 100 tests.
  5708. 301.32 s [vector] accum: OK
  5709. 301.32 s [vector] +++ OK, passed 100 tests.
  5710. 301.32 s [vector] reverse: OK
  5711. 301.32 s [vector] +++ OK, passed 100 tests.
  5712. 301.32 s [vector] backpermute: OK
  5713. 301.32 s [vector] +++ OK, passed 100 tests.
  5714. 301.32 s [vector] map: OK
  5715. 301.32 s [vector] +++ OK, passed 100 tests.
  5716. 301.33 s [vector] imap: OK
  5717. 301.33 s [vector] +++ OK, passed 100 tests.
  5718. 301.33 s [vector] concatMap: OK
  5719. 301.33 s [vector] +++ OK, passed 100 tests.
  5720. 301.33 s [vector] mapM: OK
  5721. 301.33 s [vector] +++ OK, passed 100 tests.
  5722. 301.34 s [vector] mapM_: OK (0.01s)
  5723. 301.34 s [vector] +++ OK, passed 100 tests.
  5724. 301.36 s [vector] forM: OK
  5725. 301.36 s [vector] +++ OK, passed 100 tests.
  5726. 301.36 s [vector] forM_: OK (0.01s)
  5727. 301.36 s [vector] +++ OK, passed 100 tests.
  5728. 301.36 s [vector] imapM: OK
  5729. 301.37 s [vector] +++ OK, passed 100 tests.
  5730. 301.38 s [vector] imapM_: OK (0.01s)
  5731. 301.38 s [vector] +++ OK, passed 100 tests.
  5732. 301.38 s [vector] zipWith: OK
  5733. 301.38 s [vector] +++ OK, passed 100 tests.
  5734. 301.38 s [vector] zipWith3: OK
  5735. 301.38 s [vector] +++ OK, passed 100 tests.
  5736. 301.38 s [vector] izipWith: OK
  5737. 301.38 s [vector] +++ OK, passed 100 tests.
  5738. 301.39 s [vector] izipWith3: OK
  5739. 301.39 s [vector] +++ OK, passed 100 tests.
  5740. 301.39 s [vector] izipWithM: OK
  5741. 301.39 s [vector] +++ OK, passed 100 tests.
  5742. 301.40 s [vector] izipWithM_: OK (0.01s)
  5743. 301.40 s [vector] +++ OK, passed 100 tests.
  5744. 301.41 s [vector] zipWithM: OK
  5745. 301.41 s [vector] +++ OK, passed 100 tests.
  5746. 301.41 s [vector] zipWithM_: OK
  5747. 301.41 s [vector] +++ OK, passed 100 tests.
  5748. 301.41 s [vector] filter: OK
  5749. 301.41 s [vector] +++ OK, passed 100 tests.
  5750. 301.41 s [vector] ifilter: OK
  5751. 301.43 s [vector] +++ OK, passed 100 tests.
  5752. 301.45 s [vector] filterM: OK (0.04s)
  5753. 301.45 s [vector] +++ OK, passed 100 tests.
  5754. 301.45 s [vector] uniq: OK
  5755. 301.45 s [vector] +++ OK, passed 100 tests.
  5756. 301.45 s [vector] mapMaybe: OK
  5757. 301.45 s [vector] +++ OK, passed 100 tests.
  5758. 301.45 s [vector] imapMaybe: OK
  5759. 301.45 s [vector] +++ OK, passed 100 tests.
  5760. 301.46 s [vector] takeWhile: OK
  5761. 301.46 s [vector] +++ OK, passed 100 tests.
  5762. 301.46 s [vector] dropWhile: OK
  5763. 301.46 s [vector] +++ OK, passed 100 tests.
  5764. 301.46 s [vector] partition: OK
  5765. 301.46 s [vector] +++ OK, passed 100 tests.
  5766. 301.46 s [vector] partitionWith: OK
  5767. 301.46 s [vector] +++ OK, passed 100 tests.
  5768. 301.46 s [vector] span: OK
  5769. 301.46 s [vector] +++ OK, passed 100 tests.
  5770. 301.46 s [vector] break: OK
  5771. 301.46 s [vector] +++ OK, passed 100 tests.
  5772. 301.46 s [vector] spanR: OK
  5773. 301.46 s [vector] +++ OK, passed 100 tests.
  5774. 301.47 s [vector] breakR: OK
  5775. 301.47 s [vector] +++ OK, passed 100 tests.
  5776. 301.47 s [vector] groupBy: OK
  5777. 301.47 s [vector] +++ OK, passed 100 tests.
  5778. 301.47 s [vector] elem: OK
  5779. 301.47 s [vector] +++ OK, passed 100 tests.
  5780. 301.47 s [vector] notElem: OK
  5781. 301.47 s [vector] +++ OK, passed 100 tests.
  5782. 301.47 s [vector] find: OK
  5783. 301.47 s [vector] +++ OK, passed 100 tests.
  5784. 301.47 s [vector] findIndex: OK
  5785. 301.47 s [vector] +++ OK, passed 100 tests.
  5786. 301.47 s [vector] findIndexR: OK
  5787. 301.47 s [vector] +++ OK, passed 100 tests.
  5788. 301.47 s [vector] findIndices: OK
  5789. 301.47 s [vector] +++ OK, passed 100 tests.
  5790. 301.47 s [vector] elemIndex: OK
  5791. 301.47 s [vector] +++ OK, passed 100 tests.
  5792. 301.47 s [vector] elemIndices: OK
  5793. 301.47 s [vector] +++ OK, passed 100 tests.
  5794. 301.47 s [vector] foldl: OK
  5795. 301.47 s [vector] +++ OK, passed 100 tests.
  5796. 301.48 s [vector] foldl1: OK
  5797. 301.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5798. 301.48 s [vector] foldl': OK
  5799. 301.48 s [vector] +++ OK, passed 100 tests.
  5800. 301.48 s [vector] foldl1': OK
  5801. 301.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5802. 301.48 s [vector] foldr: OK
  5803. 301.48 s [vector] +++ OK, passed 100 tests.
  5804. 301.48 s [vector] foldr1: OK
  5805. 301.48 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5806. 301.48 s [vector] foldr': OK
  5807. 301.48 s [vector] +++ OK, passed 100 tests.
  5808. 301.49 s [vector] foldr1': OK
  5809. 301.49 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5810. 301.49 s [vector] ifoldl: OK
  5811. 301.49 s [vector] +++ OK, passed 100 tests.
  5812. 301.49 s [vector] ifoldl': OK
  5813. 301.49 s [vector] +++ OK, passed 100 tests.
  5814. 301.49 s [vector] ifoldr: OK
  5815. 301.49 s [vector] +++ OK, passed 100 tests.
  5816. 301.50 s [vector] ifoldr': OK
  5817. 301.50 s [vector] +++ OK, passed 100 tests.
  5818. 301.50 s [vector] ifoldM: OK
  5819. 301.50 s [vector] +++ OK, passed 100 tests.
  5820. 301.50 s [vector] ifoldM': OK
  5821. 301.51 s [vector] +++ OK, passed 100 tests.
  5822. 301.53 s [vector] ifoldM_: OK (0.02s)
  5823. 301.53 s [vector] +++ OK, passed 100 tests.
  5824. 301.54 s [vector] ifoldM'_: OK (0.02s)
  5825. 301.54 s [vector] +++ OK, passed 100 tests.
  5826. 301.54 s [vector] all: OK
  5827. 301.54 s [vector] +++ OK, passed 100 tests.
  5828. 301.54 s [vector] any: OK
  5829. 301.54 s [vector] +++ OK, passed 100 tests.
  5830. 301.54 s [vector] prescanl: OK
  5831. 301.54 s [vector] +++ OK, passed 100 tests.
  5832. 301.55 s [vector] prescanl': OK
  5833. 301.55 s [vector] +++ OK, passed 100 tests.
  5834. 301.55 s [vector] postscanl: OK
  5835. 301.55 s [vector] +++ OK, passed 100 tests.
  5836. 301.55 s [vector] postscanl': OK
  5837. 301.55 s [vector] +++ OK, passed 100 tests.
  5838. 301.55 s [vector] scanl: OK
  5839. 301.55 s [vector] +++ OK, passed 100 tests.
  5840. 301.55 s [vector] scanl': OK
  5841. 301.55 s [vector] +++ OK, passed 100 tests.
  5842. 301.56 s [vector] scanl1: OK
  5843. 301.56 s [vector] +++ OK, passed 100 tests.
  5844. 301.56 s [vector] scanl1': OK
  5845. 301.56 s [vector] +++ OK, passed 100 tests.
  5846. 301.56 s [vector] iscanl: OK
  5847. 301.56 s [vector] +++ OK, passed 100 tests.
  5848. 301.56 s [vector] iscanl': OK
  5849. 301.56 s [vector] +++ OK, passed 100 tests.
  5850. 301.56 s [vector] prescanr: OK
  5851. 301.57 s [vector] +++ OK, passed 100 tests.
  5852. 301.57 s [vector] prescanr': OK
  5853. 301.57 s [vector] +++ OK, passed 100 tests.
  5854. 301.57 s [vector] postscanr: OK
  5855. 301.57 s [vector] +++ OK, passed 100 tests.
  5856. 301.57 s [vector] postscanr': OK
  5857. 301.57 s [vector] +++ OK, passed 100 tests.
  5858. 301.57 s [vector] scanr: OK
  5859. 301.57 s [vector] +++ OK, passed 100 tests.
  5860. 301.57 s [vector] scanr': OK
  5861. 301.58 s [vector] +++ OK, passed 100 tests.
  5862. 301.58 s [vector] scanr1: OK
  5863. 301.58 s [vector] +++ OK, passed 100 tests.
  5864. 301.58 s [vector] scanr1': OK
  5865. 301.58 s [vector] +++ OK, passed 100 tests.
  5866. 301.58 s [vector] iscanr: OK
  5867. 301.59 s [vector] +++ OK, passed 100 tests.
  5868. 301.59 s [vector] iscanr': OK
  5869. 301.59 s [vector] +++ OK, passed 100 tests.
  5870. 301.59 s [vector] mut_read: OK
  5871. 301.59 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5872. 301.59 s [vector] mut_write: OK
  5873. 301.59 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5874. 301.59 s [vector] mut_modify: OK
  5875. 301.59 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5876. 301.59 s [vector] mut_generate: OK
  5877. 301.60 s [vector] +++ OK, passed 100 tests.
  5878. 301.60 s [vector] mut_generateM: OK
  5879. 301.61 s [vector] +++ OK, passed 100 tests.
  5880. 301.63 s [vector] mut_mapM_: OK (0.02s)
  5881. 301.63 s [vector] +++ OK, passed 100 tests.
  5882. 301.65 s [vector] mut_imapM_: OK (0.02s)
  5883. 301.65 s [vector] +++ OK, passed 100 tests.
  5884. 301.65 s [vector] mut_forM_: OK (0.01s)
  5885. 301.65 s [vector] +++ OK, passed 100 tests.
  5886. 301.67 s [vector] mut_iforM_: OK (0.02s)
  5887. 301.67 s [vector] +++ OK, passed 100 tests.
  5888. 301.67 s [vector] mut_foldr: OK
  5889. 301.67 s [vector] +++ OK, passed 100 tests.
  5890. 301.67 s [vector] mut_foldr': OK
  5891. 301.67 s [vector] +++ OK, passed 100 tests.
  5892. 301.67 s [vector] mut_foldl: OK
  5893. 301.67 s [vector] +++ OK, passed 100 tests.
  5894. 301.67 s [vector] mut_foldl': OK
  5895. 301.68 s [vector] +++ OK, passed 100 tests.
  5896. 301.68 s [vector] mut_ifoldr: OK
  5897. 301.68 s [vector] +++ OK, passed 100 tests.
  5898. 301.68 s [vector] mut_ifoldr': OK
  5899. 301.68 s [vector] +++ OK, passed 100 tests.
  5900. 301.68 s [vector] mut_ifoldl: OK
  5901. 301.68 s [vector] +++ OK, passed 100 tests.
  5902. 301.68 s [vector] mut_ifoldl': OK
  5903. 301.68 s [vector] +++ OK, passed 100 tests.
  5904. 301.68 s [vector] mut_foldM: OK
  5905. 301.69 s [vector] +++ OK, passed 100 tests.
  5906. 301.69 s [vector] mut_foldM': OK
  5907. 301.69 s [vector] +++ OK, passed 100 tests.
  5908. 301.69 s [vector] mut_foldrM: OK
  5909. 301.69 s [vector] +++ OK, passed 100 tests.
  5910. 301.69 s [vector] mut_foldrM': OK
  5911. 301.70 s [vector] +++ OK, passed 100 tests.
  5912. 301.70 s [vector] mut_ifoldM: OK
  5913. 301.70 s [vector] +++ OK, passed 100 tests.
  5914. 301.70 s [vector] mut_ifoldM': OK
  5915. 301.70 s [vector] +++ OK, passed 100 tests.
  5916. 301.71 s [vector] mut_ifoldrM: OK
  5917. 301.71 s [vector] +++ OK, passed 100 tests.
  5918. 301.71 s [vector] mut_ifoldrM': OK
  5919. 301.71 s [vector] +++ OK, passed 100 tests.
  5920. 301.71 s [vector] compare: OK
  5921. 301.71 s [vector] +++ OK, passed 100 tests.
  5922. 301.71 s [vector] maximum: OK
  5923. 301.71 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5924. 301.71 s [vector] minimum: OK
  5925. 301.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5926. 301.71 s [vector] minIndex: OK
  5927. 301.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5928. 301.71 s [vector] maxIndex: OK
  5929. 301.71 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5930. 301.71 s [vector] maximumBy: OK
  5931. 301.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5932. 301.71 s [vector] minimumBy: OK
  5933. 301.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5934. 301.71 s [vector] maximumOn: OK
  5935. 301.71 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5936. 301.71 s [vector] minimumOn: OK
  5937. 301.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5938. 301.71 s [vector] maxIndexBy: OK
  5939. 301.71 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5940. 301.71 s [vector] minIndexBy: OK
  5941. 301.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5942. 301.71 s [vector] ListFirstMaxIndexWins: OK
  5943. 301.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5944. 301.72 s [vector] FalseListFirstMaxIndexWins: OK
  5945. 301.72 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  5946. 301.72 s [vector] []
  5947. 301.72 s [vector] zip: OK
  5948. 301.72 s [vector] +++ OK, passed 100 tests.
  5949. 301.72 s [vector] zip3: OK
  5950. 301.72 s [vector] +++ OK, passed 100 tests.
  5951. 301.72 s [vector] unzip: OK
  5952. 301.72 s [vector] +++ OK, passed 100 tests.
  5953. 301.72 s [vector] unzip3: OK
  5954. 301.72 s [vector] +++ OK, passed 100 tests.
  5955. 301.72 s [vector] indexed: OK
  5956. 301.73 s [vector] +++ OK, passed 100 tests.
  5957. 301.73 s [vector] update: OK
  5958. 301.73 s [vector] +++ OK, passed 100 tests.
  5959. 301.73 s [vector] mempty: OK
  5960. 301.73 s [vector] +++ OK, passed 1 test.
  5961. 301.73 s [vector] mappend: OK
  5962. 301.75 s [vector] +++ OK, passed 100 tests.
  5963. 301.75 s [vector] mconcat: OK (0.02s)
  5964. 301.75 s [vector] +++ OK, passed 100 tests.
  5965. 301.75 s [vector] glength: OK
  5966. 301.75 s [vector] +++ OK, passed 100 tests.
  5967. 301.75 s [vector] and: OK
  5968. 301.75 s [vector] +++ OK, passed 100 tests.
  5969. 301.75 s [vector] or: OK
  5970. 301.75 s [vector] +++ OK, passed 100 tests.
  5971. 301.75 s [vector] (Int)
  5972. 301.75 s [vector] fromList.toList == id: OK
  5973. 301.75 s [vector] +++ OK, passed 100 tests.
  5974. 301.75 s [vector] toList.fromList == id: OK
  5975. 301.75 s [vector] +++ OK, passed 100 tests.
  5976. 301.75 s [vector] unstream.stream == id: OK
  5977. 301.75 s [vector] +++ OK, passed 100 tests.
  5978. 301.75 s [vector] stream.unstream == id: OK
  5979. 301.75 s [vector] +++ OK, passed 100 tests.
  5980. 301.76 s [vector] eq: OK
  5981. 301.76 s [vector] +++ OK, passed 100 tests.
  5982. 301.76 s [vector] length: OK
  5983. 301.76 s [vector] +++ OK, passed 100 tests.
  5984. 301.76 s [vector] null: OK
  5985. 301.76 s [vector] +++ OK, passed 100 tests.
  5986. 301.76 s [vector] index: OK
  5987. 301.76 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5988. 301.76 s [vector] safeIndex: OK
  5989. 301.76 s [vector] +++ OK, passed 100 tests.
  5990. 301.76 s [vector] head: OK
  5991. 301.76 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5992. 301.76 s [vector] last: OK
  5993. 301.76 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5994. 301.76 s [vector] unsafeIndex: OK
  5995. 301.76 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5996. 301.76 s [vector] unsafeHead: OK
  5997. 301.76 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5998. 301.76 s [vector] unsafeLast: OK
  5999. 301.76 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6000. 301.76 s [vector] slice: OK
  6001. 301.76 s [vector] +++ OK, passed 100 tests.
  6002. 301.76 s [vector] init: OK
  6003. 301.76 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6004. 301.76 s [vector] tail: OK
  6005. 301.76 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6006. 301.76 s [vector] take: OK
  6007. 301.76 s [vector] +++ OK, passed 100 tests.
  6008. 301.76 s [vector] drop: OK
  6009. 301.76 s [vector] +++ OK, passed 100 tests.
  6010. 301.76 s [vector] splitAt: OK
  6011. 301.76 s [vector] +++ OK, passed 100 tests.
  6012. 301.76 s [vector] empty: OK
  6013. 301.76 s [vector] +++ OK, passed 1 test.
  6014. 301.76 s [vector] singleton: OK
  6015. 301.76 s [vector] +++ OK, passed 100 tests.
  6016. 301.76 s [vector] replicate: OK
  6017. 301.77 s [vector] +++ OK, passed 100 tests.
  6018. 301.77 s [vector] generate: OK
  6019. 301.77 s [vector] +++ OK, passed 100 tests.
  6020. 301.77 s [vector] iterateN: OK
  6021. 301.77 s [vector] +++ OK, passed 100 tests.
  6022. 301.81 s [vector] iterateNM: OK (0.04s)
  6023. 301.81 s [vector] +++ OK, passed 100 tests.
  6024. 301.83 s [vector] generateM: OK (0.02s)
  6025. 301.83 s [vector] +++ OK, passed 100 tests.
  6026. 301.84 s [vector] replicateM: OK (0.01s)
  6027. 301.84 s [vector] +++ OK, passed 100 tests.
  6028. 301.85 s [vector] create: OK
  6029. 301.85 s [vector] +++ OK, passed 100 tests.
  6030. 301.85 s [vector] createT: OK
  6031. 301.85 s [vector] +++ OK, passed 100 tests.
  6032. 301.85 s [vector] unfoldr: OK
  6033. 301.85 s [vector] +++ OK, passed 100 tests.
  6034. 301.85 s [vector] unfoldrN: OK
  6035. 301.85 s [vector] +++ OK, passed 100 tests.
  6036. 301.85 s [vector] unfoldrExactN: OK
  6037. 301.86 s [vector] +++ OK, passed 100 tests.
  6038. 301.86 s [vector] unfoldrM: OK
  6039. 301.86 s [vector] +++ OK, passed 100 tests.
  6040. 301.86 s [vector] unfoldrNM: OK
  6041. 301.87 s [vector] +++ OK, passed 100 tests.
  6042. 301.91 s [vector] unfoldrExactNM: OK (0.05s)
  6043. 301.91 s [vector] +++ OK, passed 100 tests.
  6044. 301.91 s [vector] constructN: OK
  6045. 301.91 s [vector] +++ OK, passed 100 tests.
  6046. 301.91 s [vector] constructrN: OK
  6047. 301.91 s [vector] +++ OK, passed 100 tests.
  6048. 301.91 s [vector] cons: OK
  6049. 301.91 s [vector] +++ OK, passed 100 tests.
  6050. 301.92 s [vector] snoc: OK
  6051. 301.92 s [vector] +++ OK, passed 100 tests.
  6052. 301.93 s [vector] append: OK
  6053. 301.93 s [vector] +++ OK, passed 100 tests.
  6054. 301.93 s [vector] concat: OK (0.02s)
  6055. 301.93 s [vector] +++ OK, passed 100 tests.
  6056. 301.93 s [vector] force: OK
  6057. 301.94 s [vector] +++ OK, passed 100 tests.
  6058. 301.94 s [vector] upd: OK
  6059. 301.94 s [vector] +++ OK, passed 100 tests.
  6060. 301.94 s [vector] accum: OK
  6061. 301.94 s [vector] +++ OK, passed 100 tests.
  6062. 301.95 s [vector] reverse: OK
  6063. 301.95 s [vector] +++ OK, passed 100 tests.
  6064. 301.95 s [vector] backpermute: OK
  6065. 301.95 s [vector] +++ OK, passed 100 tests.
  6066. 301.95 s [vector] map: OK
  6067. 301.95 s [vector] +++ OK, passed 100 tests.
  6068. 301.95 s [vector] imap: OK
  6069. 301.95 s [vector] +++ OK, passed 100 tests.
  6070. 301.95 s [vector] concatMap: OK
  6071. 301.96 s [vector] +++ OK, passed 100 tests.
  6072. 301.97 s [vector] mapM: OK
  6073. 301.97 s [vector] +++ OK, passed 100 tests.
  6074. 301.98 s [vector] mapM_: OK (0.02s)
  6075. 301.98 s [vector] +++ OK, passed 100 tests.
  6076. 301.99 s [vector] forM: OK
  6077. 301.99 s [vector] +++ OK, passed 100 tests.
  6078. 302.00 s [vector] forM_: OK (0.02s)
  6079. 302.00 s [vector] +++ OK, passed 100 tests.
  6080. 302.01 s [vector] imapM: OK
  6081. 302.01 s [vector] +++ OK, passed 100 tests.
  6082. 302.03 s [vector] imapM_: OK (0.02s)
  6083. 302.03 s [vector] +++ OK, passed 100 tests.
  6084. 302.03 s [vector] zipWith: OK
  6085. 302.03 s [vector] +++ OK, passed 100 tests.
  6086. 302.03 s [vector] zipWith3: OK
  6087. 302.03 s [vector] +++ OK, passed 100 tests.
  6088. 302.04 s [vector] izipWith: OK
  6089. 302.04 s [vector] +++ OK, passed 100 tests.
  6090. 302.04 s [vector] izipWith3: OK
  6091. 302.04 s [vector] +++ OK, passed 100 tests.
  6092. 302.05 s [vector] izipWithM: OK
  6093. 302.05 s [vector] +++ OK, passed 100 tests.
  6094. 302.06 s [vector] izipWithM_: OK (0.01s)
  6095. 302.06 s [vector] +++ OK, passed 100 tests.
  6096. 302.07 s [vector] zipWithM: OK
  6097. 302.07 s [vector] +++ OK, passed 100 tests.
  6098. 302.07 s [vector] zipWithM_: OK (0.01s)
  6099. 302.07 s [vector] +++ OK, passed 100 tests.
  6100. 302.07 s [vector] filter: OK
  6101. 302.07 s [vector] +++ OK, passed 100 tests.
  6102. 302.07 s [vector] ifilter: OK
  6103. 302.09 s [vector] +++ OK, passed 100 tests.
  6104. 302.11 s [vector] filterM: OK (0.03s)
  6105. 302.11 s [vector] +++ OK, passed 100 tests.
  6106. 302.11 s [vector] uniq: OK
  6107. 302.11 s [vector] +++ OK, passed 100 tests.
  6108. 302.11 s [vector] mapMaybe: OK
  6109. 302.11 s [vector] +++ OK, passed 100 tests.
  6110. 302.11 s [vector] imapMaybe: OK
  6111. 302.12 s [vector] +++ OK, passed 100 tests.
  6112. 302.12 s [vector] takeWhile: OK
  6113. 302.12 s [vector] +++ OK, passed 100 tests.
  6114. 302.12 s [vector] dropWhile: OK
  6115. 302.12 s [vector] +++ OK, passed 100 tests.
  6116. 302.12 s [vector] partition: OK
  6117. 302.12 s [vector] +++ OK, passed 100 tests.
  6118. 302.12 s [vector] partitionWith: OK
  6119. 302.12 s [vector] +++ OK, passed 100 tests.
  6120. 302.12 s [vector] span: OK
  6121. 302.12 s [vector] +++ OK, passed 100 tests.
  6122. 302.12 s [vector] break: OK
  6123. 302.12 s [vector] +++ OK, passed 100 tests.
  6124. 302.12 s [vector] spanR: OK
  6125. 302.12 s [vector] +++ OK, passed 100 tests.
  6126. 302.13 s [vector] breakR: OK
  6127. 302.13 s [vector] +++ OK, passed 100 tests.
  6128. 302.13 s [vector] groupBy: OK
  6129. 302.13 s [vector] +++ OK, passed 100 tests.
  6130. 302.13 s [vector] elem: OK
  6131. 302.13 s [vector] +++ OK, passed 100 tests.
  6132. 302.13 s [vector] notElem: OK
  6133. 302.13 s [vector] +++ OK, passed 100 tests.
  6134. 302.13 s [vector] find: OK
  6135. 302.13 s [vector] +++ OK, passed 100 tests.
  6136. 302.13 s [vector] findIndex: OK
  6137. 302.13 s [vector] +++ OK, passed 100 tests.
  6138. 302.13 s [vector] findIndexR: OK
  6139. 302.13 s [vector] +++ OK, passed 100 tests.
  6140. 302.13 s [vector] findIndices: OK
  6141. 302.13 s [vector] +++ OK, passed 100 tests.
  6142. 302.13 s [vector] elemIndex: OK
  6143. 302.13 s [vector] +++ OK, passed 100 tests.
  6144. 302.14 s [vector] elemIndices: OK
  6145. 302.14 s [vector] +++ OK, passed 100 tests.
  6146. 302.14 s [vector] foldl: OK
  6147. 302.14 s [vector] +++ OK, passed 100 tests.
  6148. 302.14 s [vector] foldl1: OK
  6149. 302.14 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6150. 302.15 s [vector] foldl': OK
  6151. 302.15 s [vector] +++ OK, passed 100 tests.
  6152. 302.15 s [vector] foldl1': OK
  6153. 302.15 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6154. 302.15 s [vector] foldr: OK
  6155. 302.15 s [vector] +++ OK, passed 100 tests.
  6156. 302.15 s [vector] foldr1: OK
  6157. 302.15 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6158. 302.16 s [vector] foldr': OK
  6159. 302.16 s [vector] +++ OK, passed 100 tests.
  6160. 302.16 s [vector] foldr1': OK
  6161. 302.16 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6162. 302.16 s [vector] ifoldl: OK
  6163. 302.16 s [vector] +++ OK, passed 100 tests.
  6164. 302.17 s [vector] ifoldl': OK
  6165. 302.17 s [vector] +++ OK, passed 100 tests.
  6166. 302.17 s [vector] ifoldr: OK
  6167. 302.17 s [vector] +++ OK, passed 100 tests.
  6168. 302.17 s [vector] ifoldr': OK
  6169. 302.18 s [vector] +++ OK, passed 100 tests.
  6170. 302.18 s [vector] ifoldM: OK
  6171. 302.18 s [vector] +++ OK, passed 100 tests.
  6172. 302.18 s [vector] ifoldM': OK
  6173. 302.19 s [vector] +++ OK, passed 100 tests.
  6174. 302.21 s [vector] ifoldM_: OK (0.02s)
  6175. 302.21 s [vector] +++ OK, passed 100 tests.
  6176. 302.22 s [vector] ifoldM'_: OK (0.02s)
  6177. 302.22 s [vector] +++ OK, passed 100 tests.
  6178. 302.22 s [vector] all: OK
  6179. 302.22 s [vector] +++ OK, passed 100 tests.
  6180. 302.22 s [vector] any: OK
  6181. 302.23 s [vector] +++ OK, passed 100 tests.
  6182. 302.23 s [vector] prescanl: OK
  6183. 302.23 s [vector] +++ OK, passed 100 tests.
  6184. 302.23 s [vector] prescanl': OK
  6185. 302.23 s [vector] +++ OK, passed 100 tests.
  6186. 302.23 s [vector] postscanl: OK
  6187. 302.24 s [vector] +++ OK, passed 100 tests.
  6188. 302.24 s [vector] postscanl': OK
  6189. 302.24 s [vector] +++ OK, passed 100 tests.
  6190. 302.24 s [vector] scanl: OK
  6191. 302.24 s [vector] +++ OK, passed 100 tests.
  6192. 302.24 s [vector] scanl': OK
  6193. 302.25 s [vector] +++ OK, passed 100 tests.
  6194. 302.25 s [vector] scanl1: OK
  6195. 302.25 s [vector] +++ OK, passed 100 tests.
  6196. 302.25 s [vector] scanl1': OK
  6197. 302.25 s [vector] +++ OK, passed 100 tests.
  6198. 302.26 s [vector] iscanl: OK
  6199. 302.26 s [vector] +++ OK, passed 100 tests.
  6200. 302.26 s [vector] iscanl': OK
  6201. 302.26 s [vector] +++ OK, passed 100 tests.
  6202. 302.26 s [vector] prescanr: OK
  6203. 302.26 s [vector] +++ OK, passed 100 tests.
  6204. 302.27 s [vector] prescanr': OK
  6205. 302.27 s [vector] +++ OK, passed 100 tests.
  6206. 302.27 s [vector] postscanr: OK
  6207. 302.27 s [vector] +++ OK, passed 100 tests.
  6208. 302.27 s [vector] postscanr': OK
  6209. 302.27 s [vector] +++ OK, passed 100 tests.
  6210. 302.27 s [vector] scanr: OK
  6211. 302.28 s [vector] +++ OK, passed 100 tests.
  6212. 302.28 s [vector] scanr': OK
  6213. 302.28 s [vector] +++ OK, passed 100 tests.
  6214. 302.28 s [vector] scanr1: OK
  6215. 302.28 s [vector] +++ OK, passed 100 tests.
  6216. 302.28 s [vector] scanr1': OK
  6217. 302.29 s [vector] +++ OK, passed 100 tests.
  6218. 302.29 s [vector] iscanr: OK
  6219. 302.29 s [vector] +++ OK, passed 100 tests.
  6220. 302.29 s [vector] iscanr': OK
  6221. 302.29 s [vector] +++ OK, passed 100 tests.
  6222. 302.29 s [vector] mut_read: OK
  6223. 302.30 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6224. 302.30 s [vector] mut_write: OK
  6225. 302.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6226. 302.30 s [vector] mut_modify: OK
  6227. 302.30 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6228. 302.31 s [vector] mut_generate: OK
  6229. 302.31 s [vector] +++ OK, passed 100 tests.
  6230. 302.33 s [vector] mut_generateM: OK (0.01s)
  6231. 302.33 s [vector] +++ OK, passed 100 tests.
  6232. 302.35 s [vector] mut_mapM_: OK (0.02s)
  6233. 302.35 s [vector] +++ OK, passed 100 tests.
  6234. 302.37 s [vector] mut_imapM_: OK (0.02s)
  6235. 302.37 s [vector] +++ OK, passed 100 tests.
  6236. 302.37 s [vector] mut_forM_: OK (0.02s)
  6237. 302.37 s [vector] +++ OK, passed 100 tests.
  6238. 302.39 s [vector] mut_iforM_: OK (0.02s)
  6239. 302.39 s [vector] +++ OK, passed 100 tests.
  6240. 302.39 s [vector] mut_foldr: OK
  6241. 302.39 s [vector] +++ OK, passed 100 tests.
  6242. 302.40 s [vector] mut_foldr': OK
  6243. 302.40 s [vector] +++ OK, passed 100 tests.
  6244. 302.40 s [vector] mut_foldl: OK
  6245. 302.40 s [vector] +++ OK, passed 100 tests.
  6246. 302.40 s [vector] mut_foldl': OK
  6247. 302.40 s [vector] +++ OK, passed 100 tests.
  6248. 302.40 s [vector] mut_ifoldr: OK
  6249. 302.41 s [vector] +++ OK, passed 100 tests.
  6250. 302.41 s [vector] mut_ifoldr': OK
  6251. 302.41 s [vector] +++ OK, passed 100 tests.
  6252. 302.42 s [vector] mut_ifoldl: OK
  6253. 302.42 s [vector] +++ OK, passed 100 tests.
  6254. 302.42 s [vector] mut_ifoldl': OK
  6255. 302.42 s [vector] +++ OK, passed 100 tests.
  6256. 302.42 s [vector] mut_foldM: OK
  6257. 302.42 s [vector] +++ OK, passed 100 tests.
  6258. 302.43 s [vector] mut_foldM': OK
  6259. 302.43 s [vector] +++ OK, passed 100 tests.
  6260. 302.43 s [vector] mut_foldrM: OK
  6261. 302.43 s [vector] +++ OK, passed 100 tests.
  6262. 302.43 s [vector] mut_foldrM': OK
  6263. 302.44 s [vector] +++ OK, passed 100 tests.
  6264. 302.44 s [vector] mut_ifoldM: OK
  6265. 302.44 s [vector] +++ OK, passed 100 tests.
  6266. 302.44 s [vector] mut_ifoldM': OK
  6267. 302.44 s [vector] +++ OK, passed 100 tests.
  6268. 302.45 s [vector] mut_ifoldrM: OK
  6269. 302.45 s [vector] +++ OK, passed 100 tests.
  6270. 302.45 s [vector] mut_ifoldrM': OK
  6271. 302.45 s [vector] +++ OK, passed 100 tests.
  6272. 302.45 s [vector] compare: OK
  6273. 302.45 s [vector] +++ OK, passed 100 tests.
  6274. 302.45 s [vector] maximum: OK
  6275. 302.45 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6276. 302.45 s [vector] minimum: OK
  6277. 302.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6278. 302.45 s [vector] minIndex: OK
  6279. 302.45 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6280. 302.45 s [vector] maxIndex: OK
  6281. 302.45 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6282. 302.46 s [vector] maximumBy: OK
  6283. 302.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6284. 302.46 s [vector] minimumBy: OK
  6285. 302.46 s [vector] +++ OK, passed 100 tests; 23 discarded.
  6286. 302.46 s [vector] maximumOn: OK
  6287. 302.46 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6288. 302.46 s [vector] minimumOn: OK
  6289. 302.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6290. 302.46 s [vector] maxIndexBy: OK
  6291. 302.46 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6292. 302.46 s [vector] minIndexBy: OK
  6293. 302.46 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6294. 302.46 s [vector] ListFirstMaxIndexWins: OK
  6295. 302.46 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6296. 302.46 s [vector] FalseListFirstMaxIndexWins: OK
  6297. 302.46 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  6298. 302.46 s [vector] []
  6299. 302.46 s [vector] zip: OK
  6300. 302.46 s [vector] +++ OK, passed 100 tests.
  6301. 302.46 s [vector] zip3: OK
  6302. 302.46 s [vector] +++ OK, passed 100 tests.
  6303. 302.47 s [vector] unzip: OK
  6304. 302.47 s [vector] +++ OK, passed 100 tests.
  6305. 302.47 s [vector] unzip3: OK
  6306. 302.47 s [vector] +++ OK, passed 100 tests.
  6307. 302.47 s [vector] indexed: OK
  6308. 302.47 s [vector] +++ OK, passed 100 tests.
  6309. 302.47 s [vector] update: OK
  6310. 302.47 s [vector] +++ OK, passed 100 tests.
  6311. 302.47 s [vector] mempty: OK
  6312. 302.47 s [vector] +++ OK, passed 1 test.
  6313. 302.47 s [vector] mappend: OK
  6314. 302.49 s [vector] +++ OK, passed 100 tests.
  6315. 302.49 s [vector] mconcat: OK (0.02s)
  6316. 302.50 s [vector] +++ OK, passed 100 tests.
  6317. 302.50 s [vector] glength: OK
  6318. 302.50 s [vector] +++ OK, passed 100 tests.
  6319. 302.50 s [vector] sum: OK
  6320. 302.50 s [vector] +++ OK, passed 100 tests.
  6321. 302.50 s [vector] product: OK
  6322. 302.50 s [vector] +++ OK, passed 100 tests.
  6323. 302.50 s [vector] enumFromN: OK
  6324. 302.50 s [vector] +++ OK, passed 100 tests.
  6325. 302.50 s [vector] enumFromThenN: OK
  6326. 302.50 s [vector] +++ OK, passed 100 tests.
  6327. 302.50 s [vector] enumFromTo: OK
  6328. 302.50 s [vector] +++ OK, passed 100 tests.
  6329. 302.50 s [vector] enumFromThenTo: OK
  6330. 302.51 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6331. 302.51 s [vector] (Float)
  6332. 302.51 s [vector] fromList.toList == id: OK
  6333. 302.51 s [vector] +++ OK, passed 100 tests.
  6334. 302.51 s [vector] toList.fromList == id: OK
  6335. 302.51 s [vector] +++ OK, passed 100 tests.
  6336. 302.51 s [vector] unstream.stream == id: OK
  6337. 302.51 s [vector] +++ OK, passed 100 tests.
  6338. 302.51 s [vector] stream.unstream == id: OK
  6339. 302.51 s [vector] +++ OK, passed 100 tests.
  6340. 302.51 s [vector] eq: OK
  6341. 302.51 s [vector] +++ OK, passed 100 tests.
  6342. 302.51 s [vector] length: OK
  6343. 302.51 s [vector] +++ OK, passed 100 tests.
  6344. 302.51 s [vector] null: OK
  6345. 302.51 s [vector] +++ OK, passed 100 tests.
  6346. 302.51 s [vector] index: OK
  6347. 302.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6348. 302.51 s [vector] safeIndex: OK
  6349. 302.51 s [vector] +++ OK, passed 100 tests.
  6350. 302.51 s [vector] head: OK
  6351. 302.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6352. 302.51 s [vector] last: OK
  6353. 302.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6354. 302.51 s [vector] unsafeIndex: OK
  6355. 302.51 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6356. 302.51 s [vector] unsafeHead: OK
  6357. 302.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6358. 302.52 s [vector] unsafeLast: OK
  6359. 302.52 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6360. 302.52 s [vector] slice: OK
  6361. 302.52 s [vector] +++ OK, passed 100 tests.
  6362. 302.52 s [vector] init: OK
  6363. 302.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6364. 302.53 s [vector] tail: OK
  6365. 302.53 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6366. 302.53 s [vector] take: OK
  6367. 302.53 s [vector] +++ OK, passed 100 tests.
  6368. 302.53 s [vector] drop: OK
  6369. 302.53 s [vector] +++ OK, passed 100 tests.
  6370. 302.53 s [vector] splitAt: OK
  6371. 302.53 s [vector] +++ OK, passed 100 tests.
  6372. 302.53 s [vector] empty: OK
  6373. 302.53 s [vector] +++ OK, passed 1 test.
  6374. 302.53 s [vector] singleton: OK
  6375. 302.53 s [vector] +++ OK, passed 100 tests.
  6376. 302.53 s [vector] replicate: OK
  6377. 302.53 s [vector] +++ OK, passed 100 tests.
  6378. 302.53 s [vector] generate: OK
  6379. 302.53 s [vector] +++ OK, passed 100 tests.
  6380. 302.55 s [vector] iterateN: OK
  6381. 302.55 s [vector] +++ OK, passed 100 tests.
  6382. 302.59 s [vector] iterateNM: OK (0.05s)
  6383. 302.59 s [vector] +++ OK, passed 100 tests.
  6384. 302.63 s [vector] generateM: OK (0.04s)
  6385. 302.63 s [vector] +++ OK, passed 100 tests.
  6386. 302.63 s [vector] replicateM: OK
  6387. 302.63 s [vector] +++ OK, passed 100 tests.
  6388. 302.63 s [vector] create: OK
  6389. 302.63 s [vector] +++ OK, passed 100 tests.
  6390. 302.63 s [vector] createT: OK
  6391. 302.63 s [vector] +++ OK, passed 100 tests.
  6392. 302.63 s [vector] unfoldr: OK
  6393. 302.63 s [vector] +++ OK, passed 100 tests.
  6394. 302.63 s [vector] unfoldrN: OK
  6395. 302.63 s [vector] +++ OK, passed 100 tests.
  6396. 302.63 s [vector] unfoldrExactN: OK
  6397. 302.63 s [vector] +++ OK, passed 100 tests.
  6398. 302.63 s [vector] unfoldrM: OK
  6399. 302.63 s [vector] +++ OK, passed 100 tests.
  6400. 302.65 s [vector] unfoldrNM: OK
  6401. 302.65 s [vector] +++ OK, passed 100 tests.
  6402. 302.69 s [vector] unfoldrExactNM: OK (0.04s)
  6403. 302.69 s [vector] +++ OK, passed 100 tests.
  6404. 302.69 s [vector] constructN: OK
  6405. 302.69 s [vector] +++ OK, passed 100 tests.
  6406. 302.70 s [vector] constructrN: OK (0.01s)
  6407. 302.70 s [vector] +++ OK, passed 100 tests.
  6408. 302.70 s [vector] cons: OK
  6409. 302.70 s [vector] +++ OK, passed 100 tests.
  6410. 302.70 s [vector] snoc: OK
  6411. 302.70 s [vector] +++ OK, passed 100 tests.
  6412. 302.70 s [vector] append: OK
  6413. 302.71 s [vector] +++ OK, passed 100 tests.
  6414. 302.73 s [vector] concat: OK (0.03s)
  6415. 302.73 s [vector] +++ OK, passed 100 tests.
  6416. 302.73 s [vector] force: OK
  6417. 302.73 s [vector] +++ OK, passed 100 tests.
  6418. 302.74 s [vector] upd: OK
  6419. 302.74 s [vector] +++ OK, passed 100 tests.
  6420. 302.75 s [vector] accum: OK (0.01s)
  6421. 302.75 s [vector] +++ OK, passed 100 tests.
  6422. 302.75 s [vector] reverse: OK
  6423. 302.75 s [vector] +++ OK, passed 100 tests.
  6424. 302.75 s [vector] backpermute: OK
  6425. 302.75 s [vector] +++ OK, passed 100 tests.
  6426. 302.76 s [vector] map: OK
  6427. 303.19 s [vector] +++ OK, passed 100 tests.
  6428. 303.19 s [vector] imap: OK
  6429. 303.19 s [vector] +++ OK, passed 100 tests.
  6430. 303.19 s [vector] concatMap: OK
  6431. 303.19 s [vector] +++ OK, passed 100 tests.
  6432. 303.19 s [vector] mapM: OK
  6433. 303.19 s [vector] +++ OK, passed 100 tests.
  6434. 303.19 s [vector] mapM_: OK (0.04s)
  6435. 303.19 s [vector] +++ OK, passed 100 tests.
  6436. 303.19 s [vector] forM: OK
  6437. 303.19 s [vector] +++ OK, passed 100 tests.
  6438. 303.19 s [vector] forM_: OK (0.04s)
  6439. 303.19 s [vector] +++ OK, passed 100 tests.
  6440. 303.19 s [vector] imapM: OK
  6441. 303.19 s [vector] +++ OK, passed 100 tests.
  6442. 303.19 s [vector] imapM_: OK (0.04s)
  6443. 303.19 s [vector] +++ OK, passed 100 tests.
  6444. 303.19 s [vector] zipWith: OK
  6445. 303.19 s [vector] +++ OK, passed 100 tests.
  6446. 303.19 s [vector] zipWith3: OK
  6447. 303.19 s [vector] +++ OK, passed 100 tests.
  6448. 303.19 s [vector] izipWith: OK
  6449. 303.19 s [vector] +++ OK, passed 100 tests.
  6450. 303.19 s [vector] izipWith3: OK
  6451. 303.19 s [vector] +++ OK, passed 100 tests.
  6452. 303.19 s [vector] izipWithM: OK
  6453. 303.19 s [vector] +++ OK, passed 100 tests.
  6454. 303.19 s [vector] izipWithM_: OK (0.03s)
  6455. 303.19 s [vector] +++ OK, passed 100 tests.
  6456. 303.19 s [vector] zipWithM: OK
  6457. 303.19 s [vector] +++ OK, passed 100 tests.
  6458. 303.19 s [vector] zipWithM_: OK (0.03s)
  6459. 303.19 s [vector] +++ OK, passed 100 tests.
  6460. 303.19 s [vector] filter: OK
  6461. 303.19 s [vector] +++ OK, passed 100 tests.
  6462. 303.19 s [vector] ifilter: OK
  6463. 303.19 s [vector] +++ OK, passed 100 tests.
  6464. 303.19 s [vector] filterM: OK (0.05s)
  6465. 303.19 s [vector] +++ OK, passed 100 tests.
  6466. 303.19 s [vector] uniq: OK
  6467. 303.19 s [vector] +++ OK, passed 100 tests.
  6468. 303.19 s [vector] mapMaybe: OK
  6469. 303.19 s [vector] +++ OK, passed 100 tests.
  6470. 303.19 s [vector] imapMaybe: OK
  6471. 303.19 s [vector] +++ OK, passed 100 tests.
  6472. 303.19 s [vector] takeWhile: OK
  6473. 303.19 s [vector] +++ OK, passed 100 tests.
  6474. 303.19 s [vector] dropWhile: OK
  6475. 303.19 s [vector] +++ OK, passed 100 tests.
  6476. 303.19 s [vector] partition: OK
  6477. 303.19 s [vector] +++ OK, passed 100 tests.
  6478. 303.19 s [vector] partitionWith: OK
  6479. 303.19 s [vector] +++ OK, passed 100 tests.
  6480. 303.19 s [vector] span: OK
  6481. 303.19 s [vector] +++ OK, passed 100 tests.
  6482. 303.19 s [vector] break: OK
  6483. 303.19 s [vector] +++ OK, passed 100 tests.
  6484. 303.19 s [vector] spanR: OK
  6485. 303.19 s [vector] +++ OK, passed 100 tests.
  6486. 303.19 s [vector] breakR: OK
  6487. 303.19 s [vector] +++ OK, passed 100 tests.
  6488. 303.19 s [vector] groupBy: OK
  6489. 303.19 s [vector] +++ OK, passed 100 tests.
  6490. 303.19 s [vector] elem: OK
  6491. 303.19 s [vector] +++ OK, passed 100 tests.
  6492. 303.19 s [vector] notElem: OK
  6493. 303.19 s [vector] +++ OK, passed 100 tests.
  6494. 303.19 s [vector] find: OK
  6495. 303.19 s [vector] +++ OK, passed 100 tests.
  6496. 303.19 s [vector] findIndex: OK
  6497. 303.19 s [vector] +++ OK, passed 100 tests.
  6498. 303.19 s [vector] findIndexR: OK
  6499. 303.19 s [vector] +++ OK, passed 100 tests.
  6500. 303.19 s [vector] findIndices: OK
  6501. 303.19 s [vector] +++ OK, passed 100 tests.
  6502. 303.19 s [vector] elemIndex: OK
  6503. 303.19 s [vector] +++ OK, passed 100 tests.
  6504. 303.19 s [vector] elemIndices: OK
  6505. 303.19 s [vector] +++ OK, passed 100 tests.
  6506. 303.19 s [vector] foldl: OK
  6507. 303.19 s [vector] +++ OK, passed 100 tests.
  6508. 303.19 s [vector] foldl1: OK
  6509. 303.19 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6510. 303.19 s [vector] foldl': OK
  6511. 303.20 s [vector] +++ OK, passed 100 tests.
  6512. 303.20 s [vector] foldl1': OK
  6513. 303.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6514. 303.20 s [vector] foldr: OK
  6515. 303.20 s [vector] +++ OK, passed 100 tests.
  6516. 303.20 s [vector] foldr1: OK
  6517. 303.20 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6518. 303.20 s [vector] foldr': OK
  6519. 303.20 s [vector] +++ OK, passed 100 tests.
  6520. 303.20 s [vector] foldr1': OK
  6521. 303.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6522. 303.20 s [vector] ifoldl: OK (0.01s)
  6523. 303.20 s [vector] +++ OK, passed 100 tests.
  6524. 303.21 s [vector] ifoldl': OK (0.01s)
  6525. 303.21 s [vector] +++ OK, passed 100 tests.
  6526. 303.22 s [vector] ifoldr: OK (0.01s)
  6527. 303.22 s [vector] +++ OK, passed 100 tests.
  6528. 303.23 s [vector] ifoldr': OK (0.01s)
  6529. 303.23 s [vector] +++ OK, passed 100 tests.
  6530. 303.23 s [vector] ifoldM: OK
  6531. 303.24 s [vector] +++ OK, passed 100 tests.
  6532. 303.25 s [vector] ifoldM': OK (0.01s)
  6533. 303.25 s [vector] +++ OK, passed 100 tests.
  6534. 303.29 s [vector] ifoldM_: OK (0.03s)
  6535. 303.29 s [vector] +++ OK, passed 100 tests.
  6536. 303.32 s [vector] ifoldM'_: OK (0.04s)
  6537. 303.32 s [vector] +++ OK, passed 100 tests.
  6538. 303.32 s [vector] all: OK
  6539. 303.32 s [vector] +++ OK, passed 100 tests.
  6540. 303.32 s [vector] any: OK
  6541. 303.33 s [vector] +++ OK, passed 100 tests.
  6542. 303.33 s [vector] prescanl: OK
  6543. 303.33 s [vector] +++ OK, passed 100 tests.
  6544. 303.34 s [vector] prescanl': OK
  6545. 303.34 s [vector] +++ OK, passed 100 tests.
  6546. 303.35 s [vector] postscanl: OK
  6547. 303.35 s [vector] +++ OK, passed 100 tests.
  6548. 303.36 s [vector] postscanl': OK
  6549. 303.36 s [vector] +++ OK, passed 100 tests.
  6550. 303.37 s [vector] scanl: OK (0.01s)
  6551. 303.37 s [vector] +++ OK, passed 100 tests.
  6552. 303.37 s [vector] scanl': OK
  6553. 303.38 s [vector] +++ OK, passed 100 tests.
  6554. 303.38 s [vector] scanl1: OK
  6555. 303.38 s [vector] +++ OK, passed 100 tests.
  6556. 303.39 s [vector] scanl1': OK
  6557. 303.39 s [vector] +++ OK, passed 100 tests.
  6558. 303.41 s [vector] iscanl: OK (0.01s)
  6559. 303.41 s [vector] +++ OK, passed 100 tests.
  6560. 303.42 s [vector] iscanl': OK
  6561. 303.42 s [vector] +++ OK, passed 100 tests.
  6562. 303.42 s [vector] prescanr: OK
  6563. 303.43 s [vector] +++ OK, passed 100 tests.
  6564. 303.43 s [vector] prescanr': OK
  6565. 303.43 s [vector] +++ OK, passed 100 tests.
  6566. 303.45 s [vector] postscanr: OK (0.01s)
  6567. 303.45 s [vector] +++ OK, passed 100 tests.
  6568. 303.45 s [vector] postscanr': OK
  6569. 303.45 s [vector] +++ OK, passed 100 tests.
  6570. 303.46 s [vector] scanr: OK
  6571. 303.46 s [vector] +++ OK, passed 100 tests.
  6572. 303.46 s [vector] scanr': OK
  6573. 303.47 s [vector] +++ OK, passed 100 tests.
  6574. 303.48 s [vector] scanr1: OK
  6575. 303.48 s [vector] +++ OK, passed 100 tests.
  6576. 303.48 s [vector] scanr1': OK
  6577. 303.49 s [vector] +++ OK, passed 100 tests.
  6578. 303.51 s [vector] iscanr: OK (0.02s)
  6579. 303.51 s [vector] +++ OK, passed 100 tests.
  6580. 303.51 s [vector] iscanr': OK (0.01s)
  6581. 303.51 s [vector] +++ OK, passed 100 tests.
  6582. 303.51 s [vector] mut_read: OK
  6583. 303.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6584. 303.51 s [vector] mut_write: OK
  6585. 303.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6586. 303.51 s [vector] mut_modify: OK
  6587. 303.51 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6588. 303.51 s [vector] mut_generate: OK
  6589. 303.51 s [vector] +++ OK, passed 100 tests.
  6590. 303.53 s [vector] mut_generateM: OK
  6591. 303.55 s [vector] +++ OK, passed 100 tests.
  6592. 303.59 s [vector] mut_mapM_: OK (0.04s)
  6593. 303.59 s [vector] +++ OK, passed 100 tests.
  6594. 303.63 s [vector] mut_imapM_: OK (0.04s)
  6595. 303.63 s [vector] +++ OK, passed 100 tests.
  6596. 303.65 s [vector] mut_forM_: OK (0.03s)
  6597. 303.65 s [vector] +++ OK, passed 100 tests.
  6598. 303.69 s [vector] mut_iforM_: OK (0.04s)
  6599. 303.69 s [vector] +++ OK, passed 100 tests.
  6600. 303.71 s [vector] mut_foldr: OK (0.01s)
  6601. 303.71 s [vector] +++ OK, passed 100 tests.
  6602. 303.71 s [vector] mut_foldr': OK
  6603. 303.71 s [vector] +++ OK, passed 100 tests.
  6604. 303.72 s [vector] mut_foldl: OK
  6605. 303.72 s [vector] +++ OK, passed 100 tests.
  6606. 303.72 s [vector] mut_foldl': OK
  6607. 303.72 s [vector] +++ OK, passed 100 tests.
  6608. 303.73 s [vector] mut_ifoldr: OK
  6609. 303.74 s [vector] +++ OK, passed 100 tests.
  6610. 303.75 s [vector] mut_ifoldr': OK (0.01s)
  6611. 303.75 s [vector] +++ OK, passed 100 tests.
  6612. 303.76 s [vector] mut_ifoldl: OK (0.01s)
  6613. 303.76 s [vector] +++ OK, passed 100 tests.
  6614. 303.77 s [vector] mut_ifoldl': OK
  6615. 303.77 s [vector] +++ OK, passed 100 tests.
  6616. 303.78 s [vector] mut_foldM: OK
  6617. 303.78 s [vector] +++ OK, passed 100 tests.
  6618. 303.79 s [vector] mut_foldM': OK (0.01s)
  6619. 303.79 s [vector] +++ OK, passed 100 tests.
  6620. 303.80 s [vector] mut_foldrM: OK
  6621. 303.80 s [vector] +++ OK, passed 100 tests.
  6622. 303.80 s [vector] mut_foldrM': OK
  6623. 303.81 s [vector] +++ OK, passed 100 tests.
  6624. 303.81 s [vector] mut_ifoldM: OK (0.01s)
  6625. 303.81 s [vector] +++ OK, passed 100 tests.
  6626. 303.82 s [vector] mut_ifoldM': OK
  6627. 303.83 s [vector] +++ OK, passed 100 tests.
  6628. 303.83 s [vector] mut_ifoldrM: OK
  6629. 303.83 s [vector] +++ OK, passed 100 tests.
  6630. 303.84 s [vector] mut_ifoldrM': OK
  6631. 303.84 s [vector] +++ OK, passed 100 tests.
  6632. 303.84 s [vector] compare: OK
  6633. 303.84 s [vector] +++ OK, passed 100 tests.
  6634. 303.84 s [vector] maximum: OK
  6635. 303.84 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6636. 303.84 s [vector] minimum: OK
  6637. 303.84 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6638. 303.84 s [vector] minIndex: OK
  6639. 303.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6640. 303.85 s [vector] maxIndex: OK
  6641. 303.85 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6642. 303.85 s [vector] maximumBy: OK
  6643. 303.85 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6644. 303.85 s [vector] minimumBy: OK
  6645. 303.85 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6646. 303.85 s [vector] maximumOn: OK
  6647. 303.85 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6648. 303.85 s [vector] minimumOn: OK
  6649. 303.85 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6650. 303.85 s [vector] maxIndexBy: OK
  6651. 303.85 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6652. 303.85 s [vector] minIndexBy: OK
  6653. 303.85 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6654. 303.85 s [vector] ListFirstMaxIndexWins: OK
  6655. 303.85 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6656. 303.85 s [vector] FalseListFirstMaxIndexWins: OK
  6657. 303.85 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  6658. 303.85 s [vector] []
  6659. 303.85 s [vector] zip: OK
  6660. 303.85 s [vector] +++ OK, passed 100 tests.
  6661. 303.85 s [vector] zip3: OK
  6662. 303.86 s [vector] +++ OK, passed 100 tests.
  6663. 303.86 s [vector] unzip: OK
  6664. 303.86 s [vector] +++ OK, passed 100 tests.
  6665. 303.87 s [vector] unzip3: OK
  6666. 303.87 s [vector] +++ OK, passed 100 tests.
  6667. 303.87 s [vector] indexed: OK
  6668. 303.87 s [vector] +++ OK, passed 100 tests.
  6669. 303.87 s [vector] update: OK
  6670. 303.87 s [vector] +++ OK, passed 100 tests.
  6671. 303.87 s [vector] mempty: OK
  6672. 303.87 s [vector] +++ OK, passed 1 test.
  6673. 303.89 s [vector] mappend: OK
  6674. 303.89 s [vector] +++ OK, passed 100 tests.
  6675. 303.90 s [vector] mconcat: OK (0.02s)
  6676. 303.90 s [vector] +++ OK, passed 100 tests.
  6677. 303.90 s [vector] glength: OK
  6678. 303.90 s [vector] +++ OK, passed 100 tests.
  6679. 303.90 s [vector] sum: OK
  6680. 303.90 s [vector] +++ OK, passed 100 tests.
  6681. 303.91 s [vector] product: OK
  6682. 303.91 s [vector] +++ OK, passed 100 tests.
  6683. 303.91 s [vector] enumFromN: OK
  6684. 303.91 s [vector] +++ OK, passed 100 tests.
  6685. 303.91 s [vector] enumFromThenN: OK
  6686. 303.91 s [vector] +++ OK, passed 100 tests.
  6687. 303.91 s [vector] enumFromTo: OK
  6688. 303.91 s [vector] +++ OK, passed 100 tests.
  6689. 303.91 s [vector] enumFromThenTo: OK
  6690. 303.91 s [vector] +++ OK, passed 100 tests; 3 discarded.
  6691. 303.91 s [vector] (Double)
  6692. 303.91 s [vector] fromList.toList == id: OK
  6693. 303.91 s [vector] +++ OK, passed 100 tests.
  6694. 303.91 s [vector] toList.fromList == id: OK
  6695. 303.91 s [vector] +++ OK, passed 100 tests.
  6696. 303.91 s [vector] unstream.stream == id: OK
  6697. 303.91 s [vector] +++ OK, passed 100 tests.
  6698. 303.91 s [vector] stream.unstream == id: OK
  6699. 303.91 s [vector] +++ OK, passed 100 tests.
  6700. 303.91 s [vector] eq: OK
  6701. 303.91 s [vector] +++ OK, passed 100 tests.
  6702. 303.91 s [vector] length: OK
  6703. 303.91 s [vector] +++ OK, passed 100 tests.
  6704. 303.91 s [vector] null: OK
  6705. 303.91 s [vector] +++ OK, passed 100 tests.
  6706. 303.91 s [vector] index: OK
  6707. 303.91 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6708. 303.91 s [vector] safeIndex: OK
  6709. 303.91 s [vector] +++ OK, passed 100 tests.
  6710. 303.91 s [vector] head: OK
  6711. 303.91 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6712. 303.92 s [vector] last: OK
  6713. 303.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6714. 303.92 s [vector] unsafeIndex: OK
  6715. 303.92 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6716. 303.92 s [vector] unsafeHead: OK
  6717. 303.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6718. 303.92 s [vector] unsafeLast: OK
  6719. 303.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6720. 303.92 s [vector] slice: OK
  6721. 303.92 s [vector] +++ OK, passed 100 tests.
  6722. 303.92 s [vector] init: OK
  6723. 303.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6724. 303.92 s [vector] tail: OK
  6725. 303.92 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6726. 303.92 s [vector] take: OK
  6727. 303.92 s [vector] +++ OK, passed 100 tests.
  6728. 303.92 s [vector] drop: OK
  6729. 303.92 s [vector] +++ OK, passed 100 tests.
  6730. 303.92 s [vector] splitAt: OK
  6731. 303.92 s [vector] +++ OK, passed 100 tests.
  6732. 303.92 s [vector] empty: OK
  6733. 303.92 s [vector] +++ OK, passed 1 test.
  6734. 303.92 s [vector] singleton: OK
  6735. 303.92 s [vector] +++ OK, passed 100 tests.
  6736. 303.92 s [vector] replicate: OK
  6737. 303.92 s [vector] +++ OK, passed 100 tests.
  6738. 303.92 s [vector] generate: OK
  6739. 303.93 s [vector] +++ OK, passed 100 tests.
  6740. 303.93 s [vector] iterateN: OK
  6741. 303.95 s [vector] +++ OK, passed 100 tests.
  6742. 303.97 s [vector] iterateNM: OK (0.04s)
  6743. 303.97 s [vector] +++ OK, passed 100 tests.
  6744. 304.01 s [vector] generateM: OK (0.03s)
  6745. 304.01 s [vector] +++ OK, passed 100 tests.
  6746. 304.01 s [vector] replicateM: OK (0.01s)
  6747. 304.01 s [vector] +++ OK, passed 100 tests.
  6748. 304.01 s [vector] create: OK
  6749. 304.01 s [vector] +++ OK, passed 100 tests.
  6750. 304.01 s [vector] createT: OK
  6751. 304.01 s [vector] +++ OK, passed 100 tests.
  6752. 304.01 s [vector] unfoldr: OK
  6753. 304.01 s [vector] +++ OK, passed 100 tests.
  6754. 304.01 s [vector] unfoldrN: OK
  6755. 304.01 s [vector] +++ OK, passed 100 tests.
  6756. 304.01 s [vector] unfoldrExactN: OK
  6757. 304.01 s [vector] +++ OK, passed 100 tests.
  6758. 304.02 s [vector] unfoldrM: OK
  6759. 304.02 s [vector] +++ OK, passed 100 tests.
  6760. 304.02 s [vector] unfoldrNM: OK
  6761. 304.02 s [vector] +++ OK, passed 100 tests.
  6762. 304.07 s [vector] unfoldrExactNM: OK (0.03s)
  6763. 304.07 s [vector] +++ OK, passed 100 tests.
  6764. 304.07 s [vector] constructN: OK (0.02s)
  6765. 304.07 s [vector] +++ OK, passed 100 tests.
  6766. 304.08 s [vector] constructrN: OK (0.01s)
  6767. 304.08 s [vector] +++ OK, passed 100 tests.
  6768. 304.09 s [vector] cons: OK
  6769. 304.09 s [vector] +++ OK, passed 100 tests.
  6770. 304.09 s [vector] snoc: OK
  6771. 304.09 s [vector] +++ OK, passed 100 tests.
  6772. 304.11 s [vector] append: OK
  6773. 304.11 s [vector] +++ OK, passed 100 tests.
  6774. 304.12 s [vector] concat: OK (0.03s)
  6775. 304.12 s [vector] +++ OK, passed 100 tests.
  6776. 304.12 s [vector] force: OK
  6777. 304.12 s [vector] +++ OK, passed 100 tests.
  6778. 304.13 s [vector] upd: OK
  6779. 304.13 s [vector] +++ OK, passed 100 tests.
  6780. 304.13 s [vector] accum: OK (0.02s)
  6781. 304.13 s [vector] +++ OK, passed 100 tests.
  6782. 304.13 s [vector] reverse: OK
  6783. 304.14 s [vector] +++ OK, passed 100 tests.
  6784. 304.14 s [vector] backpermute: OK
  6785. 304.15 s [vector] +++ OK, passed 100 tests.
  6786. 304.15 s [vector] map: OK
  6787. 304.15 s [vector] +++ OK, passed 100 tests.
  6788. 304.16 s [vector] imap: OK
  6789. 304.16 s [vector] +++ OK, passed 100 tests.
  6790. 304.16 s [vector] concatMap: OK
  6791. 304.17 s [vector] +++ OK, passed 100 tests.
  6792. 304.17 s [vector] mapM: OK
  6793. 304.18 s [vector] +++ OK, passed 100 tests.
  6794. 304.22 s [vector] mapM_: OK (0.04s)
  6795. 304.22 s [vector] +++ OK, passed 100 tests.
  6796. 304.22 s [vector] forM: OK
  6797. 304.22 s [vector] +++ OK, passed 100 tests.
  6798. 304.27 s [vector] forM_: OK (0.02s)
  6799. 304.27 s [vector] +++ OK, passed 100 tests.
  6800. 304.27 s [vector] imapM: OK (0.01s)
  6801. 304.27 s [vector] +++ OK, passed 100 tests.
  6802. 304.32 s [vector] imapM_: OK (0.03s)
  6803. 304.32 s [vector] +++ OK, passed 100 tests.
  6804. 304.33 s [vector] zipWith: OK (0.01s)
  6805. 304.33 s [vector] +++ OK, passed 100 tests.
  6806. 304.34 s [vector] zipWith3: OK (0.01s)
  6807. 304.34 s [vector] +++ OK, passed 100 tests.
  6808. 304.36 s [vector] izipWith: OK (0.01s)
  6809. 304.36 s [vector] +++ OK, passed 100 tests.
  6810. 304.36 s [vector] izipWith3: OK (0.01s)
  6811. 304.36 s [vector] +++ OK, passed 100 tests.
  6812. 304.38 s [vector] izipWithM: OK (0.01s)
  6813. 304.38 s [vector] +++ OK, passed 100 tests.
  6814. 304.41 s [vector] izipWithM_: OK (0.03s)
  6815. 304.41 s [vector] +++ OK, passed 100 tests.
  6816. 304.42 s [vector] zipWithM: OK (0.01s)
  6817. 304.42 s [vector] +++ OK, passed 100 tests.
  6818. 304.45 s [vector] zipWithM_: OK (0.03s)
  6819. 304.45 s [vector] +++ OK, passed 100 tests.
  6820. 304.45 s [vector] filter: OK
  6821. 304.46 s [vector] +++ OK, passed 100 tests.
  6822. 304.46 s [vector] ifilter: OK
  6823. 304.46 s [vector] +++ OK, passed 100 tests.
  6824. 304.51 s [vector] filterM: OK (0.05s)
  6825. 304.51 s [vector] +++ OK, passed 100 tests.
  6826. 304.52 s [vector] uniq: OK
  6827. 304.52 s [vector] +++ OK, passed 100 tests.
  6828. 304.53 s [vector] mapMaybe: OK
  6829. 304.53 s [vector] +++ OK, passed 100 tests.
  6830. 304.53 s [vector] imapMaybe: OK
  6831. 304.54 s [vector] +++ OK, passed 100 tests.
  6832. 304.54 s [vector] takeWhile: OK
  6833. 304.54 s [vector] +++ OK, passed 100 tests.
  6834. 304.54 s [vector] dropWhile: OK
  6835. 304.54 s [vector] +++ OK, passed 100 tests.
  6836. 304.54 s [vector] partition: OK
  6837. 304.55 s [vector] +++ OK, passed 100 tests.
  6838. 304.55 s [vector] partitionWith: OK
  6839. 304.55 s [vector] +++ OK, passed 100 tests.
  6840. 304.55 s [vector] span: OK
  6841. 304.56 s [vector] +++ OK, passed 100 tests.
  6842. 304.56 s [vector] break: OK
  6843. 304.56 s [vector] +++ OK, passed 100 tests.
  6844. 304.56 s [vector] spanR: OK
  6845. 304.56 s [vector] +++ OK, passed 100 tests.
  6846. 304.56 s [vector] breakR: OK
  6847. 304.57 s [vector] +++ OK, passed 100 tests.
  6848. 304.57 s [vector] groupBy: OK (0.01s)
  6849. 304.57 s [vector] +++ OK, passed 100 tests.
  6850. 304.57 s [vector] elem: OK
  6851. 304.57 s [vector] +++ OK, passed 100 tests.
  6852. 304.57 s [vector] notElem: OK
  6853. 304.57 s [vector] +++ OK, passed 100 tests.
  6854. 304.57 s [vector] find: OK
  6855. 304.57 s [vector] +++ OK, passed 100 tests.
  6856. 304.57 s [vector] findIndex: OK
  6857. 304.57 s [vector] +++ OK, passed 100 tests.
  6858. 304.58 s [vector] findIndexR: OK
  6859. 304.58 s [vector] +++ OK, passed 100 tests.
  6860. 304.58 s [vector] findIndices: OK
  6861. 304.58 s [vector] +++ OK, passed 100 tests.
  6862. 304.58 s [vector] elemIndex: OK
  6863. 304.59 s [vector] +++ OK, passed 100 tests.
  6864. 304.59 s [vector] elemIndices: OK
  6865. 304.59 s [vector] +++ OK, passed 100 tests.
  6866. 304.61 s [vector] foldl: OK
  6867. 304.61 s [vector] +++ OK, passed 100 tests.
  6868. 304.62 s [vector] foldl1: OK (0.01s)
  6869. 304.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6870. 304.64 s [vector] foldl': OK (0.01s)
  6871. 304.64 s [vector] +++ OK, passed 100 tests.
  6872. 304.66 s [vector] foldl1': OK (0.02s)
  6873. 304.66 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6874. 304.68 s [vector] foldr: OK (0.02s)
  6875. 304.68 s [vector] +++ OK, passed 100 tests.
  6876. 304.68 s [vector] foldr1: OK (0.02s)
  6877. 304.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6878. 304.70 s [vector] foldr': OK (0.02s)
  6879. 304.70 s [vector] +++ OK, passed 100 tests.
  6880. 304.72 s [vector] foldr1': OK (0.02s)
  6881. 304.72 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6882. 304.74 s [vector] ifoldl: OK (0.02s)
  6883. 304.74 s [vector] +++ OK, passed 100 tests.
  6884. 304.76 s [vector] ifoldl': OK (0.02s)
  6885. 304.76 s [vector] +++ OK, passed 100 tests.
  6886. 304.76 s [vector] ifoldr: OK (0.02s)
  6887. 304.76 s [vector] +++ OK, passed 100 tests.
  6888. 304.78 s [vector] ifoldr': OK (0.02s)
  6889. 304.78 s [vector] +++ OK, passed 100 tests.
  6890. 304.80 s [vector] ifoldM: OK (0.02s)
  6891. 304.80 s [vector] +++ OK, passed 100 tests.
  6892. 304.84 s [vector] ifoldM': OK (0.02s)
  6893. 304.84 s [vector] +++ OK, passed 100 tests.
  6894. 304.88 s [vector] ifoldM_: OK (0.05s)
  6895. 304.88 s [vector] +++ OK, passed 100 tests.
  6896. 304.91 s [vector] ifoldM'_: OK (0.05s)
  6897. 304.91 s [vector] +++ OK, passed 100 tests.
  6898. 304.91 s [vector] all: OK
  6899. 304.91 s [vector] +++ OK, passed 100 tests.
  6900. 304.92 s [vector] any: OK
  6901. 304.92 s [vector] +++ OK, passed 100 tests.
  6902. 304.94 s [vector] prescanl: OK (0.02s)
  6903. 304.94 s [vector] +++ OK, passed 100 tests.
  6904. 304.94 s [vector] prescanl': OK (0.01s)
  6905. 304.94 s [vector] +++ OK, passed 100 tests.
  6906. 304.96 s [vector] postscanl: OK
  6907. 304.97 s [vector] +++ OK, passed 100 tests.
  6908. 304.98 s [vector] postscanl': OK (0.01s)
  6909. 304.98 s [vector] +++ OK, passed 100 tests.
  6910. 305.00 s [vector] scanl: OK (0.02s)
  6911. 305.00 s [vector] +++ OK, passed 100 tests.
  6912. 305.02 s [vector] scanl': OK (0.02s)
  6913. 305.02 s [vector] +++ OK, passed 100 tests.
  6914. 305.02 s [vector] scanl1: OK (0.01s)
  6915. 305.02 s [vector] +++ OK, passed 100 tests.
  6916. 305.04 s [vector] scanl1': OK (0.01s)
  6917. 305.04 s [vector] +++ OK, passed 100 tests.
  6918. 305.05 s [vector] iscanl: OK (0.02s)
  6919. 305.05 s [vector] +++ OK, passed 100 tests.
  6920. 305.07 s [vector] iscanl': OK
  6921. 305.07 s [vector] +++ OK, passed 100 tests.
  6922. 305.08 s [vector] prescanr: OK (0.01s)
  6923. 305.08 s [vector] +++ OK, passed 100 tests.
  6924. 305.10 s [vector] prescanr': OK (0.01s)
  6925. 305.10 s [vector] +++ OK, passed 100 tests.
  6926. 305.12 s [vector] postscanr: OK (0.02s)
  6927. 305.12 s [vector] +++ OK, passed 100 tests.
  6928. 305.13 s [vector] postscanr': OK (0.02s)
  6929. 305.13 s [vector] +++ OK, passed 100 tests.
  6930. 305.14 s [vector] scanr: OK (0.01s)
  6931. 305.14 s [vector] +++ OK, passed 100 tests.
  6932. 305.15 s [vector] scanr': OK (0.01s)
  6933. 305.15 s [vector] +++ OK, passed 100 tests.
  6934. 305.18 s [vector] scanr1: OK
  6935. 305.18 s [vector] +++ OK, passed 100 tests.
  6936. 305.18 s [vector] scanr1': OK (0.01s)
  6937. 305.18 s [vector] +++ OK, passed 100 tests.
  6938. 305.20 s [vector] iscanr: OK (0.02s)
  6939. 305.20 s [vector] +++ OK, passed 100 tests.
  6940. 305.21 s [vector] iscanr': OK (0.02s)
  6941. 305.21 s [vector] +++ OK, passed 100 tests.
  6942. 305.21 s [vector] mut_read: OK
  6943. 305.21 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6944. 305.22 s [vector] mut_write: OK
  6945. 305.22 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6946. 305.22 s [vector] mut_modify: OK
  6947. 305.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6948. 305.22 s [vector] mut_generate: OK
  6949. 305.22 s [vector] +++ OK, passed 100 tests.
  6950. 305.23 s [vector] mut_generateM: OK (0.01s)
  6951. 305.23 s [vector] +++ OK, passed 100 tests.
  6952. 305.27 s [vector] mut_mapM_: OK (0.03s)
  6953. 305.27 s [vector] +++ OK, passed 100 tests.
  6954. 305.32 s [vector] mut_imapM_: OK (0.03s)
  6955. 305.32 s [vector] +++ OK, passed 100 tests.
  6956. 305.36 s [vector] mut_forM_: OK (0.04s)
  6957. 305.36 s [vector] +++ OK, passed 100 tests.
  6958. 305.40 s [vector] mut_iforM_: OK (0.04s)
  6959. 305.40 s [vector] +++ OK, passed 100 tests.
  6960. 305.42 s [vector] mut_foldr: OK (0.01s)
  6961. 305.42 s [vector] +++ OK, passed 100 tests.
  6962. 305.44 s [vector] mut_foldr': OK (0.01s)
  6963. 305.44 s [vector] +++ OK, passed 100 tests.
  6964. 305.46 s [vector] mut_foldl: OK (0.02s)
  6965. 305.46 s [vector] +++ OK, passed 100 tests.
  6966. 305.46 s [vector] mut_foldl': OK (0.01s)
  6967. 305.46 s [vector] +++ OK, passed 100 tests.
  6968. 305.48 s [vector] mut_ifoldr: OK (0.02s)
  6969. 305.48 s [vector] +++ OK, passed 100 tests.
  6970. 305.50 s [vector] mut_ifoldr': OK (0.02s)
  6971. 305.50 s [vector] +++ OK, passed 100 tests.
  6972. 305.53 s [vector] mut_ifoldl: OK (0.02s)
  6973. 305.53 s [vector] +++ OK, passed 100 tests.
  6974. 305.53 s [vector] mut_ifoldl': OK (0.02s)
  6975. 305.53 s [vector] +++ OK, passed 100 tests.
  6976. 305.56 s [vector] mut_foldM: OK (0.02s)
  6977. 305.56 s [vector] +++ OK, passed 100 tests.
  6978. 305.56 s [vector] mut_foldM': OK (0.02s)
  6979. 305.56 s [vector] +++ OK, passed 100 tests.
  6980. 305.58 s [vector] mut_foldrM: OK (0.02s)
  6981. 305.59 s [vector] +++ OK, passed 100 tests.
  6982. 305.64 s [vector] mut_foldrM': OK (0.02s)
  6983. 305.64 s [vector] +++ OK, passed 100 tests.
  6984. 305.64 s [vector] mut_ifoldM: OK (0.02s)
  6985. 305.64 s [vector] +++ OK, passed 100 tests.
  6986. 305.64 s [vector] mut_ifoldM': OK (0.02s)
  6987. 305.64 s [vector] +++ OK, passed 100 tests.
  6988. 305.64 s [vector] mut_ifoldrM: OK (0.02s)
  6989. 305.64 s [vector] +++ OK, passed 100 tests.
  6990. 305.65 s [vector] mut_ifoldrM': OK (0.01s)
  6991. 305.65 s [vector] +++ OK, passed 100 tests.
  6992. 305.65 s [vector] compare: OK
  6993. 305.65 s [vector] +++ OK, passed 100 tests.
  6994. 305.65 s [vector] maximum: OK
  6995. 305.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6996. 305.65 s [vector] minimum: OK
  6997. 305.65 s [vector] +++ OK, passed 100 tests; 20 discarded.
  6998. 305.65 s [vector] minIndex: OK
  6999. 305.66 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7000. 305.66 s [vector] maxIndex: OK
  7001. 305.66 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7002. 305.66 s [vector] maximumBy: OK
  7003. 305.66 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7004. 305.66 s [vector] minimumBy: OK
  7005. 305.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7006. 305.66 s [vector] maximumOn: OK
  7007. 305.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7008. 305.66 s [vector] minimumOn: OK
  7009. 305.66 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7010. 305.66 s [vector] maxIndexBy: OK
  7011. 305.66 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7012. 305.66 s [vector] minIndexBy: OK
  7013. 305.66 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7014. 305.66 s [vector] ListFirstMaxIndexWins: OK
  7015. 305.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7016. 305.66 s [vector] FalseListFirstMaxIndexWins: OK
  7017. 305.66 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  7018. 305.66 s [vector] []
  7019. 305.66 s [vector] zip: OK
  7020. 305.67 s [vector] +++ OK, passed 100 tests.
  7021. 305.67 s [vector] zip3: OK
  7022. 305.67 s [vector] +++ OK, passed 100 tests.
  7023. 305.67 s [vector] unzip: OK
  7024. 305.68 s [vector] +++ OK, passed 100 tests.
  7025. 305.68 s [vector] unzip3: OK
  7026. 305.68 s [vector] +++ OK, passed 100 tests.
  7027. 305.68 s [vector] indexed: OK
  7028. 305.68 s [vector] +++ OK, passed 100 tests.
  7029. 305.68 s [vector] update: OK
  7030. 305.68 s [vector] +++ OK, passed 100 tests.
  7031. 305.68 s [vector] mempty: OK
  7032. 305.68 s [vector] +++ OK, passed 1 test.
  7033. 305.68 s [vector] mappend: OK
  7034. 305.70 s [vector] +++ OK, passed 100 tests.
  7035. 305.70 s [vector] mconcat: OK (0.02s)
  7036. 305.70 s [vector] +++ OK, passed 100 tests.
  7037. 305.71 s [vector] glength: OK
  7038. 305.71 s [vector] +++ OK, passed 100 tests.
  7039. 305.71 s [vector] sum: OK
  7040. 305.71 s [vector] +++ OK, passed 100 tests.
  7041. 305.71 s [vector] product: OK
  7042. 305.71 s [vector] +++ OK, passed 100 tests.
  7043. 305.71 s [vector] enumFromN: OK
  7044. 305.71 s [vector] +++ OK, passed 100 tests.
  7045. 305.71 s [vector] enumFromThenN: OK
  7046. 305.71 s [vector] +++ OK, passed 100 tests.
  7047. 305.71 s [vector] enumFromTo: OK
  7048. 305.71 s [vector] +++ OK, passed 100 tests.
  7049. 305.72 s [vector] enumFromThenTo: OK
  7050. 305.72 s [vector] +++ OK, passed 100 tests.
  7051. 305.72 s [vector] (Int,Bool)
  7052. 305.72 s [vector] fromList.toList == id: OK
  7053. 305.72 s [vector] +++ OK, passed 100 tests.
  7054. 305.72 s [vector] toList.fromList == id: OK
  7055. 305.72 s [vector] +++ OK, passed 100 tests.
  7056. 305.72 s [vector] unstream.stream == id: OK
  7057. 305.72 s [vector] +++ OK, passed 100 tests.
  7058. 305.72 s [vector] stream.unstream == id: OK
  7059. 305.72 s [vector] +++ OK, passed 100 tests.
  7060. 305.72 s [vector] eq: OK
  7061. 305.72 s [vector] +++ OK, passed 100 tests.
  7062. 305.72 s [vector] length: OK
  7063. 305.72 s [vector] +++ OK, passed 100 tests.
  7064. 305.72 s [vector] null: OK
  7065. 305.72 s [vector] +++ OK, passed 100 tests.
  7066. 305.72 s [vector] index: OK
  7067. 305.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7068. 305.72 s [vector] safeIndex: OK
  7069. 305.72 s [vector] +++ OK, passed 100 tests.
  7070. 305.72 s [vector] head: OK
  7071. 305.72 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7072. 305.73 s [vector] last: OK
  7073. 305.73 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7074. 305.73 s [vector] unsafeIndex: OK
  7075. 305.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7076. 305.73 s [vector] unsafeHead: OK
  7077. 305.73 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7078. 305.73 s [vector] unsafeLast: OK
  7079. 305.73 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7080. 305.73 s [vector] slice: OK
  7081. 305.73 s [vector] +++ OK, passed 100 tests.
  7082. 305.73 s [vector] init: OK
  7083. 305.73 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7084. 305.73 s [vector] tail: OK
  7085. 305.73 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7086. 305.73 s [vector] take: OK
  7087. 305.73 s [vector] +++ OK, passed 100 tests.
  7088. 305.74 s [vector] drop: OK
  7089. 305.74 s [vector] +++ OK, passed 100 tests.
  7090. 305.74 s [vector] splitAt: OK
  7091. 305.74 s [vector] +++ OK, passed 100 tests.
  7092. 305.74 s [vector] empty: OK
  7093. 305.74 s [vector] +++ OK, passed 1 test.
  7094. 305.74 s [vector] singleton: OK
  7095. 305.74 s [vector] +++ OK, passed 100 tests.
  7096. 305.74 s [vector] replicate: OK
  7097. 305.74 s [vector] +++ OK, passed 100 tests.
  7098. 305.74 s [vector] generate: OK
  7099. 305.74 s [vector] +++ OK, passed 100 tests.
  7100. 305.76 s [vector] iterateN: OK
  7101. 305.76 s [vector] +++ OK, passed 100 tests.
  7102. 305.80 s [vector] iterateNM: OK (0.04s)
  7103. 305.80 s [vector] +++ OK, passed 100 tests.
  7104. 305.84 s [vector] generateM: OK (0.05s)
  7105. 305.84 s [vector] +++ OK, passed 100 tests.
  7106. 305.85 s [vector] replicateM: OK (0.02s)
  7107. 305.85 s [vector] +++ OK, passed 100 tests.
  7108. 305.85 s [vector] create: OK
  7109. 305.85 s [vector] +++ OK, passed 100 tests.
  7110. 305.85 s [vector] createT: OK
  7111. 305.85 s [vector] +++ OK, passed 100 tests.
  7112. 305.85 s [vector] unfoldr: OK
  7113. 305.85 s [vector] +++ OK, passed 100 tests.
  7114. 305.85 s [vector] unfoldrN: OK
  7115. 305.85 s [vector] +++ OK, passed 100 tests.
  7116. 305.85 s [vector] unfoldrExactN: OK
  7117. 305.86 s [vector] +++ OK, passed 100 tests.
  7118. 305.86 s [vector] unfoldrM: OK
  7119. 305.86 s [vector] +++ OK, passed 100 tests.
  7120. 305.88 s [vector] unfoldrNM: OK
  7121. 305.88 s [vector] +++ OK, passed 100 tests.
  7122. 305.91 s [vector] unfoldrExactNM: OK (0.03s)
  7123. 305.91 s [vector] +++ OK, passed 100 tests.
  7124. 305.91 s [vector] constructN: OK
  7125. 305.91 s [vector] +++ OK, passed 100 tests.
  7126. 305.91 s [vector] constructrN: OK
  7127. 305.91 s [vector] +++ OK, passed 100 tests.
  7128. 305.91 s [vector] cons: OK
  7129. 305.92 s [vector] +++ OK, passed 100 tests.
  7130. 305.92 s [vector] snoc: OK
  7131. 305.92 s [vector] +++ OK, passed 100 tests.
  7132. 305.92 s [vector] append: OK
  7133. 305.94 s [vector] +++ OK, passed 100 tests.
  7134. 305.97 s [vector] concat: OK (0.04s)
  7135. 305.97 s [vector] +++ OK, passed 100 tests.
  7136. 305.97 s [vector] force: OK
  7137. 305.97 s [vector] +++ OK, passed 100 tests.
  7138. 305.97 s [vector] upd: OK
  7139. 305.97 s [vector] +++ OK, passed 100 tests.
  7140. 305.98 s [vector] accum: OK
  7141. 305.98 s [vector] +++ OK, passed 100 tests.
  7142. 305.98 s [vector] reverse: OK
  7143. 305.98 s [vector] +++ OK, passed 100 tests.
  7144. 305.99 s [vector] backpermute: OK
  7145. 305.99 s [vector] +++ OK, passed 100 tests.
  7146. 305.99 s [vector] map: OK
  7147. 305.99 s [vector] +++ OK, passed 100 tests.
  7148. 306.00 s [vector] imap: OK
  7149. 306.00 s [vector] +++ OK, passed 100 tests.
  7150. 306.00 s [vector] concatMap: OK
  7151. 306.00 s [vector] +++ OK, passed 100 tests.
  7152. 306.02 s [vector] mapM: OK
  7153. 306.02 s [vector] +++ OK, passed 100 tests.
  7154. 306.04 s [vector] mapM_: OK (0.03s)
  7155. 306.04 s [vector] +++ OK, passed 100 tests.
  7156. 306.04 s [vector] forM: OK
  7157. 306.06 s [vector] +++ OK, passed 100 tests.
  7158. 306.08 s [vector] forM_: OK (0.03s)
  7159. 306.08 s [vector] +++ OK, passed 100 tests.
  7160. 306.10 s [vector] imapM: OK
  7161. 306.10 s [vector] +++ OK, passed 100 tests.
  7162. 306.12 s [vector] imapM_: OK (0.03s)
  7163. 306.12 s [vector] +++ OK, passed 100 tests.
  7164. 306.12 s [vector] zipWith: OK
  7165. 306.12 s [vector] +++ OK, passed 100 tests.
  7166. 306.13 s [vector] zipWith3: OK
  7167. 306.13 s [vector] +++ OK, passed 100 tests.
  7168. 306.13 s [vector] izipWith: OK
  7169. 306.13 s [vector] +++ OK, passed 100 tests.
  7170. 306.14 s [vector] izipWith3: OK
  7171. 306.14 s [vector] +++ OK, passed 100 tests.
  7172. 306.14 s [vector] izipWithM: OK
  7173. 306.16 s [vector] +++ OK, passed 100 tests.
  7174. 306.17 s [vector] izipWithM_: OK (0.02s)
  7175. 306.17 s [vector] +++ OK, passed 100 tests.
  7176. 306.18 s [vector] zipWithM: OK
  7177. 306.18 s [vector] +++ OK, passed 100 tests.
  7178. 306.20 s [vector] zipWithM_: OK (0.02s)
  7179. 306.20 s [vector] +++ OK, passed 100 tests.
  7180. 306.20 s [vector] filter: OK
  7181. 306.20 s [vector] +++ OK, passed 100 tests.
  7182. 306.20 s [vector] ifilter: OK
  7183. 306.22 s [vector] +++ OK, passed 100 tests.
  7184. 306.26 s [vector] filterM: OK (0.05s)
  7185. 306.26 s [vector] +++ OK, passed 100 tests.
  7186. 306.26 s [vector] uniq: OK
  7187. 306.26 s [vector] +++ OK, passed 100 tests.
  7188. 306.26 s [vector] mapMaybe: OK
  7189. 306.27 s [vector] +++ OK, passed 100 tests.
  7190. 306.27 s [vector] imapMaybe: OK
  7191. 306.27 s [vector] +++ OK, passed 100 tests.
  7192. 306.27 s [vector] takeWhile: OK
  7193. 306.27 s [vector] +++ OK, passed 100 tests.
  7194. 306.27 s [vector] dropWhile: OK
  7195. 306.28 s [vector] +++ OK, passed 100 tests.
  7196. 306.28 s [vector] partition: OK
  7197. 306.28 s [vector] +++ OK, passed 100 tests.
  7198. 306.28 s [vector] partitionWith: OK
  7199. 306.28 s [vector] +++ OK, passed 100 tests.
  7200. 306.28 s [vector] span: OK
  7201. 306.28 s [vector] +++ OK, passed 100 tests.
  7202. 306.28 s [vector] break: OK
  7203. 306.28 s [vector] +++ OK, passed 100 tests.
  7204. 306.29 s [vector] spanR: OK
  7205. 306.29 s [vector] +++ OK, passed 100 tests.
  7206. 306.29 s [vector] breakR: OK
  7207. 306.29 s [vector] +++ OK, passed 100 tests.
  7208. 306.29 s [vector] groupBy: OK
  7209. 306.29 s [vector] +++ OK, passed 100 tests.
  7210. 306.29 s [vector] elem: OK
  7211. 306.29 s [vector] +++ OK, passed 100 tests.
  7212. 306.29 s [vector] notElem: OK
  7213. 306.29 s [vector] +++ OK, passed 100 tests.
  7214. 306.29 s [vector] find: OK
  7215. 306.30 s [vector] +++ OK, passed 100 tests.
  7216. 306.30 s [vector] findIndex: OK
  7217. 306.30 s [vector] +++ OK, passed 100 tests.
  7218. 306.30 s [vector] findIndexR: OK
  7219. 306.30 s [vector] +++ OK, passed 100 tests.
  7220. 306.30 s [vector] findIndices: OK
  7221. 306.30 s [vector] +++ OK, passed 100 tests.
  7222. 306.30 s [vector] elemIndex: OK
  7223. 306.30 s [vector] +++ OK, passed 100 tests.
  7224. 306.30 s [vector] elemIndices: OK
  7225. 306.30 s [vector] +++ OK, passed 100 tests.
  7226. 306.32 s [vector] foldl: OK
  7227. 306.32 s [vector] +++ OK, passed 100 tests.
  7228. 306.32 s [vector] foldl1: OK
  7229. 306.32 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7230. 306.32 s [vector] foldl': OK
  7231. 306.32 s [vector] +++ OK, passed 100 tests.
  7232. 306.32 s [vector] foldl1': OK
  7233. 306.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7234. 306.33 s [vector] foldr: OK
  7235. 306.33 s [vector] +++ OK, passed 100 tests.
  7236. 306.34 s [vector] foldr1: OK
  7237. 306.34 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7238. 306.34 s [vector] foldr': OK
  7239. 306.34 s [vector] +++ OK, passed 100 tests.
  7240. 306.35 s [vector] foldr1': OK
  7241. 306.35 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7242. 306.35 s [vector] ifoldl: OK
  7243. 306.36 s [vector] +++ OK, passed 100 tests.
  7244. 306.36 s [vector] ifoldl': OK
  7245. 306.36 s [vector] +++ OK, passed 100 tests.
  7246. 306.36 s [vector] ifoldr: OK
  7247. 306.37 s [vector] +++ OK, passed 100 tests.
  7248. 306.38 s [vector] ifoldr': OK
  7249. 306.38 s [vector] +++ OK, passed 100 tests.
  7250. 306.38 s [vector] ifoldM: OK
  7251. 306.38 s [vector] +++ OK, passed 100 tests.
  7252. 306.38 s [vector] ifoldM': OK
  7253. 306.40 s [vector] +++ OK, passed 100 tests.
  7254. 306.42 s [vector] ifoldM_: OK (0.03s)
  7255. 306.42 s [vector] +++ OK, passed 100 tests.
  7256. 306.47 s [vector] ifoldM'_: OK (0.05s)
  7257. 306.47 s [vector] +++ OK, passed 100 tests.
  7258. 306.47 s [vector] all: OK
  7259. 306.47 s [vector] +++ OK, passed 100 tests.
  7260. 306.47 s [vector] any: OK
  7261. 306.47 s [vector] +++ OK, passed 100 tests.
  7262. 306.47 s [vector] prescanl: OK
  7263. 306.47 s [vector] +++ OK, passed 100 tests.
  7264. 306.48 s [vector] prescanl': OK
  7265. 306.49 s [vector] +++ OK, passed 100 tests.
  7266. 306.50 s [vector] postscanl: OK (0.01s)
  7267. 306.50 s [vector] +++ OK, passed 100 tests.
  7268. 306.50 s [vector] postscanl': OK
  7269. 306.50 s [vector] +++ OK, passed 100 tests.
  7270. 306.51 s [vector] scanl: OK
  7271. 306.51 s [vector] +++ OK, passed 100 tests.
  7272. 306.53 s [vector] scanl': OK (0.01s)
  7273. 306.53 s [vector] +++ OK, passed 100 tests.
  7274. 306.54 s [vector] scanl1: OK (0.01s)
  7275. 306.54 s [vector] +++ OK, passed 100 tests.
  7276. 306.56 s [vector] scanl1': OK (0.01s)
  7277. 306.56 s [vector] +++ OK, passed 100 tests.
  7278. 306.58 s [vector] iscanl: OK (0.01s)
  7279. 306.58 s [vector] +++ OK, passed 100 tests.
  7280. 306.58 s [vector] iscanl': OK (0.01s)
  7281. 306.58 s [vector] +++ OK, passed 100 tests.
  7282. 306.60 s [vector] prescanr: OK (0.01s)
  7283. 306.60 s [vector] +++ OK, passed 100 tests.
  7284. 306.61 s [vector] prescanr': OK (0.01s)
  7285. 306.61 s [vector] +++ OK, passed 100 tests.
  7286. 306.63 s [vector] postscanr: OK (0.01s)
  7287. 306.63 s [vector] +++ OK, passed 100 tests.
  7288. 306.64 s [vector] postscanr': OK (0.01s)
  7289. 306.64 s [vector] +++ OK, passed 100 tests.
  7290. 306.67 s [vector] scanr: OK (0.02s)
  7291. 306.67 s [vector] +++ OK, passed 100 tests.
  7292. 306.68 s [vector] scanr': OK (0.01s)
  7293. 306.68 s [vector] +++ OK, passed 100 tests.
  7294. 306.68 s [vector] scanr1: OK (0.01s)
  7295. 306.68 s [vector] +++ OK, passed 100 tests.
  7296. 306.68 s [vector] scanr1': OK
  7297. 306.68 s [vector] +++ OK, passed 100 tests.
  7298. 306.69 s [vector] iscanr: OK
  7299. 306.69 s [vector] +++ OK, passed 100 tests.
  7300. 306.69 s [vector] iscanr': OK
  7301. 306.69 s [vector] +++ OK, passed 100 tests.
  7302. 306.70 s [vector] mut_read: OK
  7303. 306.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7304. 306.70 s [vector] mut_write: OK
  7305. 306.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7306. 306.70 s [vector] mut_modify: OK
  7307. 306.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7308. 306.70 s [vector] mut_generate: OK
  7309. 306.72 s [vector] +++ OK, passed 100 tests.
  7310. 306.72 s [vector] mut_generateM: OK (0.02s)
  7311. 306.72 s [vector] +++ OK, passed 100 tests.
  7312. 306.76 s [vector] mut_mapM_: OK (0.03s)
  7313. 306.76 s [vector] +++ OK, passed 100 tests.
  7314. 306.80 s [vector] mut_imapM_: OK (0.04s)
  7315. 306.80 s [vector] +++ OK, passed 100 tests.
  7316. 306.84 s [vector] mut_forM_: OK (0.04s)
  7317. 306.84 s [vector] +++ OK, passed 100 tests.
  7318. 306.87 s [vector] mut_iforM_: OK (0.04s)
  7319. 306.87 s [vector] +++ OK, passed 100 tests.
  7320. 306.87 s [vector] mut_foldr: OK
  7321. 306.87 s [vector] +++ OK, passed 100 tests.
  7322. 306.88 s [vector] mut_foldr': OK
  7323. 306.88 s [vector] +++ OK, passed 100 tests.
  7324. 306.88 s [vector] mut_foldl: OK
  7325. 306.88 s [vector] +++ OK, passed 100 tests.
  7326. 306.88 s [vector] mut_foldl': OK
  7327. 306.88 s [vector] +++ OK, passed 100 tests.
  7328. 306.89 s [vector] mut_ifoldr: OK
  7329. 306.89 s [vector] +++ OK, passed 100 tests.
  7330. 306.89 s [vector] mut_ifoldr': OK
  7331. 306.90 s [vector] +++ OK, passed 100 tests.
  7332. 306.91 s [vector] mut_ifoldl: OK
  7333. 306.91 s [vector] +++ OK, passed 100 tests.
  7334. 306.91 s [vector] mut_ifoldl': OK
  7335. 306.91 s [vector] +++ OK, passed 100 tests.
  7336. 306.92 s [vector] mut_foldM: OK
  7337. 306.92 s [vector] +++ OK, passed 100 tests.
  7338. 306.92 s [vector] mut_foldM': OK
  7339. 306.92 s [vector] +++ OK, passed 100 tests.
  7340. 306.93 s [vector] mut_foldrM: OK
  7341. 306.93 s [vector] +++ OK, passed 100 tests.
  7342. 306.93 s [vector] mut_foldrM': OK
  7343. 306.94 s [vector] +++ OK, passed 100 tests.
  7344. 306.95 s [vector] mut_ifoldM: OK
  7345. 306.95 s [vector] +++ OK, passed 100 tests.
  7346. 306.95 s [vector] mut_ifoldM': OK
  7347. 306.95 s [vector] +++ OK, passed 100 tests.
  7348. 306.96 s [vector] mut_ifoldrM: OK
  7349. 306.96 s [vector] +++ OK, passed 100 tests.
  7350. 306.96 s [vector] mut_ifoldrM': OK
  7351. 306.96 s [vector] +++ OK, passed 100 tests.
  7352. 306.96 s [vector] compare: OK
  7353. 306.96 s [vector] +++ OK, passed 100 tests.
  7354. 306.96 s [vector] maximum: OK
  7355. 306.96 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7356. 306.97 s [vector] minimum: OK
  7357. 306.97 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7358. 306.97 s [vector] minIndex: OK
  7359. 306.97 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7360. 306.97 s [vector] maxIndex: OK
  7361. 306.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7362. 306.97 s [vector] maximumBy: OK
  7363. 306.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7364. 306.97 s [vector] minimumBy: OK
  7365. 306.97 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7366. 306.97 s [vector] maximumOn: OK
  7367. 306.97 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7368. 306.97 s [vector] minimumOn: OK
  7369. 306.97 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7370. 306.97 s [vector] maxIndexBy: OK
  7371. 306.97 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7372. 306.97 s [vector] minIndexBy: OK
  7373. 306.97 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7374. 306.98 s [vector] ListFirstMaxIndexWins: OK
  7375. 306.98 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7376. 306.98 s [vector] FalseListFirstMaxIndexWins: OK
  7377. 306.98 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  7378. 306.98 s [vector] []
  7379. 306.98 s [vector] zip: OK
  7380. 306.98 s [vector] +++ OK, passed 100 tests.
  7381. 306.99 s [vector] zip3: OK
  7382. 306.99 s [vector] +++ OK, passed 100 tests.
  7383. 306.99 s [vector] unzip: OK
  7384. 306.99 s [vector] +++ OK, passed 100 tests.
  7385. 307.00 s [vector] unzip3: OK
  7386. 307.00 s [vector] +++ OK, passed 100 tests.
  7387. 307.00 s [vector] indexed: OK
  7388. 307.00 s [vector] +++ OK, passed 100 tests.
  7389. 307.00 s [vector] update: OK
  7390. 307.00 s [vector] +++ OK, passed 100 tests.
  7391. 307.00 s [vector] mempty: OK
  7392. 307.00 s [vector] +++ OK, passed 1 test.
  7393. 307.02 s [vector] mappend: OK
  7394. 307.02 s [vector] +++ OK, passed 100 tests.
  7395. 307.06 s [vector] mconcat: OK (0.05s)
  7396. 307.06 s [vector] +++ OK, passed 100 tests.
  7397. 307.06 s [vector] glength: OK
  7398. 307.06 s [vector] +++ OK, passed 100 tests.
  7399. 307.06 s [vector] (Int,Bool,Int)
  7400. 307.06 s [vector] fromList.toList == id: OK
  7401. 307.06 s [vector] +++ OK, passed 100 tests.
  7402. 307.07 s [vector] toList.fromList == id: OK
  7403. 307.07 s [vector] +++ OK, passed 100 tests.
  7404. 307.07 s [vector] unstream.stream == id: OK
  7405. 307.07 s [vector] +++ OK, passed 100 tests.
  7406. 307.07 s [vector] stream.unstream == id: OK
  7407. 307.07 s [vector] +++ OK, passed 100 tests.
  7408. 307.07 s [vector] eq: OK
  7409. 307.07 s [vector] +++ OK, passed 100 tests.
  7410. 307.07 s [vector] length: OK
  7411. 307.07 s [vector] +++ OK, passed 100 tests.
  7412. 307.07 s [vector] null: OK
  7413. 307.07 s [vector] +++ OK, passed 100 tests.
  7414. 307.08 s [vector] index: OK
  7415. 307.08 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7416. 307.08 s [vector] safeIndex: OK
  7417. 307.08 s [vector] +++ OK, passed 100 tests.
  7418. 307.08 s [vector] head: OK
  7419. 307.08 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7420. 307.08 s [vector] last: OK
  7421. 307.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7422. 307.08 s [vector] unsafeIndex: OK
  7423. 307.08 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7424. 307.08 s [vector] unsafeHead: OK
  7425. 307.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7426. 307.08 s [vector] unsafeLast: OK
  7427. 307.08 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7428. 307.09 s [vector] slice: OK
  7429. 307.09 s [vector] +++ OK, passed 100 tests.
  7430. 307.09 s [vector] init: OK
  7431. 307.09 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7432. 307.09 s [vector] tail: OK
  7433. 307.09 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7434. 307.09 s [vector] take: OK
  7435. 307.09 s [vector] +++ OK, passed 100 tests.
  7436. 307.09 s [vector] drop: OK
  7437. 307.10 s [vector] +++ OK, passed 100 tests.
  7438. 307.10 s [vector] splitAt: OK
  7439. 307.10 s [vector] +++ OK, passed 100 tests.
  7440. 307.10 s [vector] empty: OK
  7441. 307.10 s [vector] +++ OK, passed 1 test.
  7442. 307.10 s [vector] singleton: OK
  7443. 307.10 s [vector] +++ OK, passed 100 tests.
  7444. 307.10 s [vector] replicate: OK
  7445. 307.10 s [vector] +++ OK, passed 100 tests.
  7446. 307.10 s [vector] generate: OK
  7447. 307.10 s [vector] +++ OK, passed 100 tests.
  7448. 307.10 s [vector] iterateN: OK
  7449. 307.12 s [vector] +++ OK, passed 100 tests.
  7450. 307.16 s [vector] iterateNM: OK (0.04s)
  7451. 307.16 s [vector] +++ OK, passed 100 tests.
  7452. 307.22 s [vector] generateM: OK (0.07s)
  7453. 307.22 s [vector] +++ OK, passed 100 tests.
  7454. 307.22 s [vector] replicateM: OK (0.01s)
  7455. 307.22 s [vector] +++ OK, passed 100 tests.
  7456. 307.22 s [vector] create: OK
  7457. 307.22 s [vector] +++ OK, passed 100 tests.
  7458. 307.23 s [vector] createT: OK
  7459. 307.23 s [vector] +++ OK, passed 100 tests.
  7460. 307.23 s [vector] unfoldr: OK
  7461. 307.23 s [vector] +++ OK, passed 100 tests.
  7462. 307.23 s [vector] unfoldrN: OK
  7463. 307.23 s [vector] +++ OK, passed 100 tests.
  7464. 307.23 s [vector] unfoldrExactN: OK
  7465. 307.23 s [vector] +++ OK, passed 100 tests.
  7466. 307.23 s [vector] unfoldrM: OK
  7467. 307.24 s [vector] +++ OK, passed 100 tests.
  7468. 307.24 s [vector] unfoldrNM: OK
  7469. 307.24 s [vector] +++ OK, passed 100 tests.
  7470. 307.31 s [vector] unfoldrExactNM: OK (0.06s)
  7471. 307.31 s [vector] +++ OK, passed 100 tests.
  7472. 307.31 s [vector] constructN: OK (0.01s)
  7473. 307.31 s [vector] +++ OK, passed 100 tests.
  7474. 307.32 s [vector] constructrN: OK
  7475. 307.32 s [vector] +++ OK, passed 100 tests.
  7476. 307.32 s [vector] cons: OK
  7477. 307.33 s [vector] +++ OK, passed 100 tests.
  7478. 307.33 s [vector] snoc: OK
  7479. 307.33 s [vector] +++ OK, passed 100 tests.
  7480. 307.34 s [vector] append: OK
  7481. 307.34 s [vector] +++ OK, passed 100 tests.
  7482. 307.39 s [vector] concat: OK (0.06s)
  7483. 307.39 s [vector] +++ OK, passed 100 tests.
  7484. 307.39 s [vector] force: OK
  7485. 307.39 s [vector] +++ OK, passed 100 tests.
  7486. 307.40 s [vector] upd: OK
  7487. 307.40 s [vector] +++ OK, passed 100 tests.
  7488. 307.41 s [vector] accum: OK (0.01s)
  7489. 307.41 s [vector] +++ OK, passed 100 tests.
  7490. 307.41 s [vector] reverse: OK
  7491. 307.41 s [vector] +++ OK, passed 100 tests.
  7492. 307.41 s [vector] backpermute: OK
  7493. 307.41 s [vector] +++ OK, passed 100 tests.
  7494. 307.42 s [vector] map: OK
  7495. 307.42 s [vector] +++ OK, passed 100 tests.
  7496. 307.44 s [vector] imap: OK
  7497. 307.44 s [vector] +++ OK, passed 100 tests.
  7498. 307.44 s [vector] concatMap: OK
  7499. 307.44 s [vector] +++ OK, passed 100 tests.
  7500. 307.44 s [vector] mapM: OK
  7501. 307.46 s [vector] +++ OK, passed 100 tests.
  7502. 307.50 s [vector] mapM_: OK (0.05s)
  7503. 307.50 s [vector] +++ OK, passed 100 tests.
  7504. 307.50 s [vector] forM: OK
  7505. 307.52 s [vector] +++ OK, passed 100 tests.
  7506. 307.58 s [vector] forM_: OK (0.07s)
  7507. 307.58 s [vector] +++ OK, passed 100 tests.
  7508. 307.60 s [vector] imapM: OK (0.01s)
  7509. 307.60 s [vector] +++ OK, passed 100 tests.
  7510. 307.64 s [vector] imapM_: OK (0.06s)
  7511. 307.64 s [vector] +++ OK, passed 100 tests.
  7512. 307.65 s [vector] zipWith: OK
  7513. 307.65 s [vector] +++ OK, passed 100 tests.
  7514. 307.66 s [vector] zipWith3: OK
  7515. 307.66 s [vector] +++ OK, passed 100 tests.
  7516. 307.67 s [vector] izipWith: OK
  7517. 307.67 s [vector] +++ OK, passed 100 tests.
  7518. 307.68 s [vector] izipWith3: OK
  7519. 307.68 s [vector] +++ OK, passed 100 tests.
  7520. 307.68 s [vector] izipWithM: OK
  7521. 307.70 s [vector] +++ OK, passed 100 tests.
  7522. 307.73 s [vector] izipWithM_: OK (0.04s)
  7523. 307.73 s [vector] +++ OK, passed 100 tests.
  7524. 307.73 s [vector] zipWithM: OK
  7525. 307.73 s [vector] +++ OK, passed 100 tests.
  7526. 307.78 s [vector] zipWithM_: OK (0.04s)
  7527. 307.78 s [vector] +++ OK, passed 100 tests.
  7528. 308.09 s [vector] filter: OK
  7529. 308.09 s [vector] +++ OK, passed 100 tests.
  7530. 308.09 s [vector] ifilter: OK
  7531. 308.09 s [vector] +++ OK, passed 100 tests.
  7532. 308.09 s [vector] filterM: OK (0.07s)
  7533. 308.09 s [vector] +++ OK, passed 100 tests.
  7534. 308.09 s [vector] uniq: OK
  7535. 308.09 s [vector] +++ OK, passed 100 tests.
  7536. 308.09 s [vector] mapMaybe: OK
  7537. 308.09 s [vector] +++ OK, passed 100 tests.
  7538. 308.09 s [vector] imapMaybe: OK
  7539. 308.09 s [vector] +++ OK, passed 100 tests.
  7540. 308.09 s [vector] takeWhile: OK
  7541. 308.09 s [vector] +++ OK, passed 100 tests.
  7542. 308.09 s [vector] dropWhile: OK
  7543. 308.09 s [vector] +++ OK, passed 100 tests.
  7544. 308.09 s [vector] partition: OK
  7545. 308.09 s [vector] +++ OK, passed 100 tests.
  7546. 308.09 s [vector] partitionWith: OK
  7547. 308.09 s [vector] +++ OK, passed 100 tests.
  7548. 308.09 s [vector] span: OK
  7549. 308.09 s [vector] +++ OK, passed 100 tests.
  7550. 308.09 s [vector] break: OK (0.01s)
  7551. 308.09 s [vector] +++ OK, passed 100 tests.
  7552. 308.09 s [vector] spanR: OK
  7553. 308.09 s [vector] +++ OK, passed 100 tests.
  7554. 308.09 s [vector] breakR: OK
  7555. 308.09 s [vector] +++ OK, passed 100 tests.
  7556. 308.09 s [vector] groupBy: OK
  7557. 308.09 s [vector] +++ OK, passed 100 tests.
  7558. 308.09 s [vector] elem: OK
  7559. 308.09 s [vector] +++ OK, passed 100 tests.
  7560. 308.09 s [vector] notElem: OK
  7561. 308.09 s [vector] +++ OK, passed 100 tests.
  7562. 308.09 s [vector] find: OK
  7563. 308.09 s [vector] +++ OK, passed 100 tests.
  7564. 308.09 s [vector] findIndex: OK
  7565. 308.09 s [vector] +++ OK, passed 100 tests.
  7566. 308.09 s [vector] findIndexR: OK
  7567. 308.09 s [vector] +++ OK, passed 100 tests.
  7568. 308.09 s [vector] findIndices: OK
  7569. 308.09 s [vector] +++ OK, passed 100 tests.
  7570. 308.09 s [vector] elemIndex: OK
  7571. 308.09 s [vector] +++ OK, passed 100 tests.
  7572. 308.09 s [vector] elemIndices: OK
  7573. 308.09 s [vector] +++ OK, passed 100 tests.
  7574. 308.09 s [vector] foldl: OK
  7575. 308.09 s [vector] +++ OK, passed 100 tests.
  7576. 308.09 s [vector] foldl1: OK
  7577. 308.09 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7578. 308.09 s [vector] foldl': OK
  7579. 308.09 s [vector] +++ OK, passed 100 tests.
  7580. 308.09 s [vector] foldl1': OK
  7581. 308.09 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7582. 308.09 s [vector] foldr: OK
  7583. 308.09 s [vector] +++ OK, passed 100 tests.
  7584. 308.09 s [vector] foldr1: OK
  7585. 308.09 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7586. 308.09 s [vector] foldr': OK
  7587. 308.09 s [vector] +++ OK, passed 100 tests.
  7588. 308.09 s [vector] foldr1': OK
  7589. 308.09 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7590. 308.09 s [vector] ifoldl: OK
  7591. 308.09 s [vector] +++ OK, passed 100 tests.
  7592. 308.09 s [vector] ifoldl': OK
  7593. 308.09 s [vector] +++ OK, passed 100 tests.
  7594. 308.09 s [vector] ifoldr: OK
  7595. 308.09 s [vector] +++ OK, passed 100 tests.
  7596. 308.09 s [vector] ifoldr': OK
  7597. 308.09 s [vector] +++ OK, passed 100 tests.
  7598. 308.09 s [vector] ifoldM: OK
  7599. 308.09 s [vector] +++ OK, passed 100 tests.
  7600. 308.09 s [vector] ifoldM': OK
  7601. 308.09 s [vector] +++ OK, passed 100 tests.
  7602. 308.10 s [vector] ifoldM_: OK (0.05s)
  7603. 308.10 s [vector] +++ OK, passed 100 tests.
  7604. 308.14 s [vector] ifoldM'_: OK (0.05s)
  7605. 308.15 s [vector] +++ OK, passed 100 tests.
  7606. 308.15 s [vector] all: OK
  7607. 308.15 s [vector] +++ OK, passed 100 tests.
  7608. 308.15 s [vector] any: OK
  7609. 308.15 s [vector] +++ OK, passed 100 tests.
  7610. 308.15 s [vector] prescanl: OK
  7611. 308.16 s [vector] +++ OK, passed 100 tests.
  7612. 308.16 s [vector] prescanl': OK
  7613. 308.17 s [vector] +++ OK, passed 100 tests.
  7614. 308.18 s [vector] postscanl: OK
  7615. 308.18 s [vector] +++ OK, passed 100 tests.
  7616. 308.19 s [vector] postscanl': OK
  7617. 308.19 s [vector] +++ OK, passed 100 tests.
  7618. 308.20 s [vector] scanl: OK (0.01s)
  7619. 308.20 s [vector] +++ OK, passed 100 tests.
  7620. 308.20 s [vector] scanl': OK
  7621. 308.21 s [vector] +++ OK, passed 100 tests.
  7622. 308.22 s [vector] scanl1: OK
  7623. 308.22 s [vector] +++ OK, passed 100 tests.
  7624. 308.22 s [vector] scanl1': OK
  7625. 308.22 s [vector] +++ OK, passed 100 tests.
  7626. 308.24 s [vector] iscanl: OK (0.01s)
  7627. 308.24 s [vector] +++ OK, passed 100 tests.
  7628. 308.24 s [vector] iscanl': OK (0.01s)
  7629. 308.24 s [vector] +++ OK, passed 100 tests.
  7630. 308.25 s [vector] prescanr: OK
  7631. 308.25 s [vector] +++ OK, passed 100 tests.
  7632. 308.26 s [vector] prescanr': OK
  7633. 308.27 s [vector] +++ OK, passed 100 tests.
  7634. 308.28 s [vector] postscanr: OK
  7635. 308.28 s [vector] +++ OK, passed 100 tests.
  7636. 308.28 s [vector] postscanr': OK
  7637. 308.28 s [vector] +++ OK, passed 100 tests.
  7638. 308.30 s [vector] scanr: OK
  7639. 308.30 s [vector] +++ OK, passed 100 tests.
  7640. 308.30 s [vector] scanr': OK
  7641. 308.30 s [vector] +++ OK, passed 100 tests.
  7642. 308.32 s [vector] scanr1: OK
  7643. 308.32 s [vector] +++ OK, passed 100 tests.
  7644. 308.32 s [vector] scanr1': OK (0.01s)
  7645. 308.32 s [vector] +++ OK, passed 100 tests.
  7646. 308.34 s [vector] iscanr: OK (0.01s)
  7647. 308.34 s [vector] +++ OK, passed 100 tests.
  7648. 308.34 s [vector] iscanr': OK (0.01s)
  7649. 308.34 s [vector] +++ OK, passed 100 tests.
  7650. 308.34 s [vector] mut_read: OK
  7651. 308.34 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7652. 308.34 s [vector] mut_write: OK
  7653. 308.34 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7654. 308.34 s [vector] mut_modify: OK
  7655. 308.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7656. 308.34 s [vector] mut_generate: OK
  7657. 308.34 s [vector] +++ OK, passed 100 tests.
  7658. 308.38 s [vector] mut_generateM: OK (0.01s)
  7659. 308.38 s [vector] +++ OK, passed 100 tests.
  7660. 308.42 s [vector] mut_mapM_: OK (0.05s)
  7661. 308.42 s [vector] +++ OK, passed 100 tests.
  7662. 308.48 s [vector] mut_imapM_: OK (0.06s)
  7663. 308.48 s [vector] +++ OK, passed 100 tests.
  7664. 308.54 s [vector] mut_forM_: OK (0.06s)
  7665. 308.54 s [vector] +++ OK, passed 100 tests.
  7666. 308.61 s [vector] mut_iforM_: OK (0.07s)
  7667. 308.61 s [vector] +++ OK, passed 100 tests.
  7668. 308.61 s [vector] mut_foldr: OK
  7669. 308.61 s [vector] +++ OK, passed 100 tests.
  7670. 308.62 s [vector] mut_foldr': OK
  7671. 308.62 s [vector] +++ OK, passed 100 tests.
  7672. 308.63 s [vector] mut_foldl: OK
  7673. 308.63 s [vector] +++ OK, passed 100 tests.
  7674. 308.63 s [vector] mut_foldl': OK
  7675. 308.64 s [vector] +++ OK, passed 100 tests.
  7676. 308.64 s [vector] mut_ifoldr: OK
  7677. 308.65 s [vector] +++ OK, passed 100 tests.
  7678. 308.65 s [vector] mut_ifoldr': OK
  7679. 308.66 s [vector] +++ OK, passed 100 tests.
  7680. 308.66 s [vector] mut_ifoldl: OK
  7681. 308.66 s [vector] +++ OK, passed 100 tests.
  7682. 308.67 s [vector] mut_ifoldl': OK
  7683. 308.68 s [vector] +++ OK, passed 100 tests.
  7684. 308.68 s [vector] mut_foldM: OK
  7685. 308.68 s [vector] +++ OK, passed 100 tests.
  7686. 308.71 s [vector] mut_foldM': OK
  7687. 308.71 s [vector] +++ OK, passed 100 tests.
  7688. 308.71 s [vector] mut_foldrM: OK
  7689. 308.71 s [vector] +++ OK, passed 100 tests.
  7690. 308.71 s [vector] mut_foldrM': OK
  7691. 308.71 s [vector] +++ OK, passed 100 tests.
  7692. 308.71 s [vector] mut_ifoldM: OK
  7693. 308.72 s [vector] +++ OK, passed 100 tests.
  7694. 308.72 s [vector] mut_ifoldM': OK
  7695. 308.72 s [vector] +++ OK, passed 100 tests.
  7696. 308.74 s [vector] mut_ifoldrM: OK
  7697. 308.74 s [vector] +++ OK, passed 100 tests.
  7698. 308.74 s [vector] mut_ifoldrM': OK
  7699. 308.74 s [vector] +++ OK, passed 100 tests.
  7700. 308.74 s [vector] compare: OK
  7701. 308.74 s [vector] +++ OK, passed 100 tests.
  7702. 308.74 s [vector] maximum: OK
  7703. 308.74 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7704. 308.74 s [vector] minimum: OK
  7705. 308.74 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7706. 308.74 s [vector] minIndex: OK
  7707. 308.75 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7708. 308.75 s [vector] maxIndex: OK
  7709. 308.75 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7710. 308.75 s [vector] maximumBy: OK
  7711. 308.75 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7712. 308.75 s [vector] minimumBy: OK
  7713. 308.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7714. 308.75 s [vector] maximumOn: OK
  7715. 308.75 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7716. 308.75 s [vector] minimumOn: OK
  7717. 308.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7718. 308.75 s [vector] maxIndexBy: OK
  7719. 308.75 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7720. 308.75 s [vector] minIndexBy: OK
  7721. 308.76 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7722. 308.76 s [vector] ListFirstMaxIndexWins: OK
  7723. 308.76 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7724. 308.76 s [vector] FalseListFirstMaxIndexWins: OK
  7725. 308.76 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  7726. 308.76 s [vector] []
  7727. 308.76 s [vector] zip: OK
  7728. 308.76 s [vector] +++ OK, passed 100 tests.
  7729. 308.77 s [vector] zip3: OK
  7730. 308.77 s [vector] +++ OK, passed 100 tests.
  7731. 308.78 s [vector] unzip: OK
  7732. 308.78 s [vector] +++ OK, passed 100 tests.
  7733. 308.78 s [vector] unzip3: OK
  7734. 308.79 s [vector] +++ OK, passed 100 tests.
  7735. 308.79 s [vector] indexed: OK
  7736. 308.79 s [vector] +++ OK, passed 100 tests.
  7737. 308.79 s [vector] update: OK
  7738. 308.79 s [vector] +++ OK, passed 100 tests.
  7739. 308.79 s [vector] mempty: OK
  7740. 308.79 s [vector] +++ OK, passed 1 test.
  7741. 308.80 s [vector] mappend: OK
  7742. 308.80 s [vector] +++ OK, passed 100 tests.
  7743. 308.86 s [vector] mconcat: OK (0.06s)
  7744. 308.86 s [vector] +++ OK, passed 100 tests.
  7745. 308.86 s [vector] glength: OK
  7746. 308.86 s [vector] +++ OK, passed 100 tests.
  7747. 308.86 s [vector] unstream
  7748. 308.86 s [vector] unstream == vunstream (exact): OK
  7749. 308.86 s [vector] +++ OK, passed 100 tests.
  7750. 308.86 s [vector] unstream == vunstream (unknown): OK
  7751. 308.86 s [vector] +++ OK, passed 100 tests.
  7752. 308.87 s [vector] unstreamR ~= vunstream (exact): OK
  7753. 308.87 s [vector] +++ OK, passed 100 tests.
  7754. 308.87 s [vector] unstreamR ~= vunstream (unknown): OK
  7755. 308.87 s [vector] +++ OK, passed 100 tests.
  7756. 308.87 s [vector] Data.Vector.Storable.Vector Alignment
  7757. 308.87 s [vector] Aligned Double: OK
  7758. 308.87 s [vector] Aligned Int: OK
  7759. 308.87 s [vector] Regression tests
  7760. 308.87 s [vector] enumFromTo crash #188
  7761. 308.87 s [vector] Word8: OK
  7762. 308.87 s [vector] Word16: OK
  7763. 308.87 s [vector] Word32: OK
  7764. 308.87 s [vector] Word64: OK
  7765. 308.87 s [vector] Word: OK
  7766. 308.87 s [vector] Int8: OK
  7767. 308.87 s [vector] Int16: OK
  7768. 308.87 s [vector] Int32: OK
  7769. 308.87 s [vector] Int64: OK
  7770. 308.87 s [vector] Int: OK
  7771. 308.87 s [vector] Char: OK
  7772. 308.87 s [vector] Negative tests
  7773. 308.87 s [vector] slice out of bounds #257
  7774. 308.87 s [vector] Boxed
  7775. 308.87 s [vector] Negative ix: OK
  7776. 308.87 s [vector] Negative size: OK
  7777. 308.87 s [vector] Negative ix and size: OK
  7778. 308.87 s [vector] Too large ix: OK
  7779. 308.87 s [vector] Too large size: OK
  7780. 308.87 s [vector] Too large ix and size: OK
  7781. 308.87 s [vector] Overflow: OK
  7782. 308.87 s [vector] OutOfMemory: OK
  7783. 308.87 s [vector] Primitive
  7784. 308.87 s [vector] Negative ix: OK
  7785. 308.87 s [vector] Negative size: OK
  7786. 308.87 s [vector] Negative ix and size: OK
  7787. 308.87 s [vector] Too large ix: OK
  7788. 308.87 s [vector] Too large size: OK
  7789. 308.87 s [vector] Too large ix and size: OK
  7790. 308.87 s [vector] Overflow: OK
  7791. 308.87 s [vector] OutOfMemory: OK
  7792. 308.87 s [vector] Storable
  7793. 308.87 s [vector] Negative ix: OK
  7794. 308.87 s [vector] Negative size: OK
  7795. 308.87 s [vector] Negative ix and size: OK
  7796. 308.87 s [vector] Too large ix: OK
  7797. 308.87 s [vector] Too large size: OK
  7798. 308.87 s [vector] Too large ix and size: OK
  7799. 308.87 s [vector] Overflow: OK
  7800. 308.87 s [vector] OutOfMemory: OK
  7801. 308.87 s [vector] Unboxed
  7802. 308.87 s [vector] Negative ix: OK
  7803. 308.87 s [vector] Negative size: OK
  7804. 308.87 s [vector] Negative ix and size: OK
  7805. 308.87 s [vector] Too large ix: OK
  7806. 308.87 s [vector] Too large size: OK
  7807. 308.87 s [vector] Too large ix and size: OK
  7808. 308.87 s [vector] Overflow: OK
  7809. 308.87 s [vector] OutOfMemory: OK
  7810. 308.87 s [vector] take #282
  7811. 308.87 s [vector] Boxed: OK
  7812. 308.87 s [vector] Primitive: OK
  7813. 308.87 s [vector] Storable: OK
  7814. 308.87 s [vector] Unboxed: OK
  7815. 308.87 s [vector] Data.Vector
  7816. 308.87 s [vector] MonadFix: OK
  7817. 308.87 s [vector] toFromArray: OK
  7818. 308.87 s [vector] toFromArraySlice: OK
  7819. 308.87 s [vector] toFromArraySliceUnsafe: OK
  7820. 308.87 s [vector] toFromMutableArray: OK
  7821. 308.87 s [vector] Data.Vector.Mutable (Move): OK
  7822. 308.87 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7823. 308.87 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  7824. 308.87 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7825. 308.87 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  7826. 308.88 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7827. 308.90 s [vector] Data.Vector.Storable.Mutable (Move): OK (0.01s)
  7828. 308.90 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7829. 308.90 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK (0.01s)
  7830. 308.90 s [vector] +++ OK, passed 1 test.
  7831. 308.91 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK (0.01s)
  7832. 308.91 s [vector] +++ OK, passed 1 test.
  7833. 308.91 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  7834. 308.91 s [vector] +++ OK, passed 100 tests.
  7835. 308.91 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  7836. 308.91 s [vector] +++ OK, passed 100 tests.
  7837. 308.91 s [vector]
  7838. 308.91 s [vector] All 2808 tests passed (15.91s)
  7839. 308.92 s [vector] Test suite vector-tests-O0: PASS
  7840. 308.92 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  7841. 308.92 s [vector] Test suite vector-tests-O2: RUNNING...
  7842. 308.95 s [vector] toplevel
  7843. 308.95 s [vector] Data.Vector.Fusion.Bundle
  7844. 308.95 s [vector] fromList.toList == id: OK
  7845. 308.95 s [vector] +++ OK, passed 100 tests.
  7846. 308.95 s [vector] toList.fromList == id: OK
  7847. 308.95 s [vector] +++ OK, passed 100 tests.
  7848. 308.95 s [vector] eq: OK
  7849. 308.95 s [vector] +++ OK, passed 100 tests.
  7850. 308.96 s [vector] length: OK
  7851. 308.96 s [vector] +++ OK, passed 100 tests.
  7852. 308.96 s [vector] null: OK
  7853. 308.96 s [vector] +++ OK, passed 100 tests.
  7854. 308.96 s [vector] empty: OK
  7855. 308.96 s [vector] +++ OK, passed 1 test.
  7856. 308.96 s [vector] singleton: OK
  7857. 308.96 s [vector] +++ OK, passed 100 tests.
  7858. 308.96 s [vector] replicate: OK
  7859. 308.96 s [vector] +++ OK, passed 100 tests.
  7860. 308.96 s [vector] cons: OK
  7861. 308.96 s [vector] +++ OK, passed 100 tests.
  7862. 308.96 s [vector] snoc: OK
  7863. 308.96 s [vector] +++ OK, passed 100 tests.
  7864. 308.96 s [vector] append: OK
  7865. 308.96 s [vector] +++ OK, passed 100 tests.
  7866. 308.96 s [vector] head: OK
  7867. 308.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7868. 308.96 s [vector] last: OK
  7869. 308.96 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7870. 308.96 s [vector] index: OK
  7871. 308.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7872. 308.96 s [vector] extract: OK
  7873. 308.96 s [vector] +++ OK, passed 100 tests.
  7874. 308.96 s [vector] init: OK
  7875. 308.96 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7876. 308.96 s [vector] tail: OK
  7877. 308.96 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7878. 308.96 s [vector] take: OK
  7879. 308.96 s [vector] +++ OK, passed 100 tests.
  7880. 308.96 s [vector] drop: OK
  7881. 308.96 s [vector] +++ OK, passed 100 tests.
  7882. 308.97 s [vector] map: OK
  7883. 308.97 s [vector] +++ OK, passed 100 tests.
  7884. 308.97 s [vector] zipWith: OK
  7885. 308.97 s [vector] +++ OK, passed 100 tests.
  7886. 308.97 s [vector] zipWith3: OK
  7887. 308.97 s [vector] +++ OK, passed 100 tests.
  7888. 308.97 s [vector] filter: OK
  7889. 308.97 s [vector] +++ OK, passed 100 tests.
  7890. 308.97 s [vector] takeWhile: OK
  7891. 308.97 s [vector] +++ OK, passed 100 tests.
  7892. 308.97 s [vector] dropWhile: OK
  7893. 308.97 s [vector] +++ OK, passed 100 tests.
  7894. 308.97 s [vector] elem: OK
  7895. 308.97 s [vector] +++ OK, passed 100 tests.
  7896. 308.97 s [vector] notElem: OK
  7897. 308.97 s [vector] +++ OK, passed 100 tests.
  7898. 308.97 s [vector] find: OK
  7899. 308.97 s [vector] +++ OK, passed 100 tests.
  7900. 308.97 s [vector] findIndex: OK
  7901. 308.97 s [vector] +++ OK, passed 100 tests.
  7902. 308.98 s [vector] foldl: OK
  7903. 308.98 s [vector] +++ OK, passed 100 tests.
  7904. 308.98 s [vector] foldl1: OK
  7905. 308.98 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7906. 308.98 s [vector] foldl': OK
  7907. 308.98 s [vector] +++ OK, passed 100 tests.
  7908. 308.98 s [vector] foldl1': OK
  7909. 308.98 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7910. 308.99 s [vector] foldr: OK
  7911. 308.99 s [vector] +++ OK, passed 100 tests.
  7912. 308.99 s [vector] foldr1: OK
  7913. 308.99 s [vector] +++ OK, passed 100 tests; 11 discarded.
  7914. 308.99 s [vector] prescanl: OK
  7915. 308.99 s [vector] +++ OK, passed 100 tests.
  7916. 308.99 s [vector] prescanl': OK
  7917. 308.99 s [vector] +++ OK, passed 100 tests.
  7918. 309.00 s [vector] postscanl: OK
  7919. 309.00 s [vector] +++ OK, passed 100 tests.
  7920. 309.00 s [vector] postscanl': OK
  7921. 309.00 s [vector] +++ OK, passed 100 tests.
  7922. 309.00 s [vector] scanl: OK
  7923. 309.00 s [vector] +++ OK, passed 100 tests.
  7924. 309.00 s [vector] scanl': OK
  7925. 309.00 s [vector] +++ OK, passed 100 tests.
  7926. 309.00 s [vector] scanl1: OK
  7927. 309.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7928. 309.01 s [vector] scanl1': OK
  7929. 309.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7930. 309.01 s [vector] concatMap: OK
  7931. 309.01 s [vector] +++ OK, passed 100 tests.
  7932. 309.01 s [vector] unfoldr: OK
  7933. 309.01 s [vector] +++ OK, passed 100 tests.
  7934. 309.01 s [vector] and: OK
  7935. 309.01 s [vector] +++ OK, passed 100 tests.
  7936. 309.01 s [vector] or: OK
  7937. 309.01 s [vector] +++ OK, passed 100 tests.
  7938. 309.01 s [vector] Tests.Vector.Boxed
  7939. 309.01 s [vector] Bool
  7940. 309.01 s [vector] fromList.toList == id: OK
  7941. 309.01 s [vector] +++ OK, passed 100 tests.
  7942. 309.01 s [vector] toList.fromList == id: OK
  7943. 309.01 s [vector] +++ OK, passed 100 tests.
  7944. 309.01 s [vector] unstream.stream == id: OK
  7945. 309.01 s [vector] +++ OK, passed 100 tests.
  7946. 309.01 s [vector] stream.unstream == id: OK
  7947. 309.01 s [vector] +++ OK, passed 100 tests.
  7948. 309.01 s [vector] eq: OK
  7949. 309.01 s [vector] +++ OK, passed 100 tests.
  7950. 309.01 s [vector] length: OK
  7951. 309.01 s [vector] +++ OK, passed 100 tests.
  7952. 309.01 s [vector] null: OK
  7953. 309.01 s [vector] +++ OK, passed 100 tests.
  7954. 309.01 s [vector] index: OK
  7955. 309.01 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7956. 309.01 s [vector] safeIndex: OK
  7957. 309.01 s [vector] +++ OK, passed 100 tests.
  7958. 309.01 s [vector] head: OK
  7959. 309.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7960. 309.01 s [vector] last: OK
  7961. 309.01 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7962. 309.01 s [vector] unsafeIndex: OK
  7963. 309.01 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7964. 309.01 s [vector] unsafeHead: OK
  7965. 309.01 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7966. 309.01 s [vector] unsafeLast: OK
  7967. 309.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7968. 309.01 s [vector] slice: OK
  7969. 309.01 s [vector] +++ OK, passed 100 tests.
  7970. 309.01 s [vector] init: OK
  7971. 309.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7972. 309.01 s [vector] tail: OK
  7973. 309.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7974. 309.01 s [vector] take: OK
  7975. 309.01 s [vector] +++ OK, passed 100 tests.
  7976. 309.01 s [vector] drop: OK
  7977. 309.01 s [vector] +++ OK, passed 100 tests.
  7978. 309.01 s [vector] splitAt: OK
  7979. 309.01 s [vector] +++ OK, passed 100 tests.
  7980. 309.01 s [vector] empty: OK
  7981. 309.01 s [vector] +++ OK, passed 1 test.
  7982. 309.01 s [vector] singleton: OK
  7983. 309.01 s [vector] +++ OK, passed 100 tests.
  7984. 309.01 s [vector] replicate: OK
  7985. 309.01 s [vector] +++ OK, passed 100 tests.
  7986. 309.01 s [vector] generate: OK
  7987. 309.01 s [vector] +++ OK, passed 100 tests.
  7988. 309.02 s [vector] iterateN: OK
  7989. 309.02 s [vector] +++ OK, passed 100 tests.
  7990. 309.04 s [vector] iterateNM: OK (0.01s)
  7991. 309.04 s [vector] +++ OK, passed 100 tests.
  7992. 309.06 s [vector] generateM: OK (0.01s)
  7993. 309.06 s [vector] +++ OK, passed 100 tests.
  7994. 309.06 s [vector] replicateM: OK (0.02s)
  7995. 309.06 s [vector] +++ OK, passed 100 tests.
  7996. 309.06 s [vector] create: OK
  7997. 309.06 s [vector] +++ OK, passed 100 tests.
  7998. 309.06 s [vector] createT: OK
  7999. 309.06 s [vector] +++ OK, passed 100 tests.
  8000. 309.06 s [vector] unfoldr: OK
  8001. 309.06 s [vector] +++ OK, passed 100 tests.
  8002. 309.06 s [vector] unfoldrN: OK
  8003. 309.06 s [vector] +++ OK, passed 100 tests.
  8004. 309.06 s [vector] unfoldrExactN: OK
  8005. 309.06 s [vector] +++ OK, passed 100 tests.
  8006. 309.07 s [vector] unfoldrM: OK
  8007. 309.07 s [vector] +++ OK, passed 100 tests.
  8008. 309.07 s [vector] unfoldrNM: OK
  8009. 309.08 s [vector] +++ OK, passed 100 tests.
  8010. 309.09 s [vector] unfoldrExactNM: OK (0.02s)
  8011. 309.09 s [vector] +++ OK, passed 100 tests.
  8012. 309.09 s [vector] constructN: OK
  8013. 309.10 s [vector] +++ OK, passed 100 tests.
  8014. 309.10 s [vector] constructrN: OK
  8015. 309.10 s [vector] +++ OK, passed 100 tests.
  8016. 309.10 s [vector] cons: OK
  8017. 309.10 s [vector] +++ OK, passed 100 tests.
  8018. 309.10 s [vector] snoc: OK
  8019. 309.10 s [vector] +++ OK, passed 100 tests.
  8020. 309.10 s [vector] append: OK
  8021. 309.11 s [vector] +++ OK, passed 100 tests.
  8022. 309.11 s [vector] concat: OK
  8023. 309.11 s [vector] +++ OK, passed 100 tests.
  8024. 309.11 s [vector] force: OK
  8025. 309.11 s [vector] +++ OK, passed 100 tests.
  8026. 309.11 s [vector] upd: OK
  8027. 309.11 s [vector] +++ OK, passed 100 tests.
  8028. 309.11 s [vector] accum: OK
  8029. 309.11 s [vector] +++ OK, passed 100 tests.
  8030. 309.11 s [vector] reverse: OK
  8031. 309.11 s [vector] +++ OK, passed 100 tests.
  8032. 309.11 s [vector] backpermute: OK
  8033. 309.11 s [vector] +++ OK, passed 100 tests.
  8034. 309.11 s [vector] map: OK
  8035. 309.11 s [vector] +++ OK, passed 100 tests.
  8036. 309.12 s [vector] imap: OK
  8037. 309.12 s [vector] +++ OK, passed 100 tests.
  8038. 309.12 s [vector] concatMap: OK
  8039. 309.12 s [vector] +++ OK, passed 100 tests.
  8040. 309.12 s [vector] mapM: OK
  8041. 309.13 s [vector] +++ OK, passed 100 tests.
  8042. 309.13 s [vector] mapM_: OK (0.01s)
  8043. 309.13 s [vector] +++ OK, passed 100 tests.
  8044. 309.13 s [vector] forM: OK
  8045. 309.14 s [vector] +++ OK, passed 100 tests.
  8046. 309.14 s [vector] forM_: OK (0.01s)
  8047. 309.14 s [vector] +++ OK, passed 100 tests.
  8048. 309.16 s [vector] imapM: OK
  8049. 309.16 s [vector] +++ OK, passed 100 tests.
  8050. 309.16 s [vector] imapM_: OK (0.01s)
  8051. 309.16 s [vector] +++ OK, passed 100 tests.
  8052. 309.16 s [vector] zipWith: OK
  8053. 309.16 s [vector] +++ OK, passed 100 tests.
  8054. 309.16 s [vector] zipWith3: OK
  8055. 309.16 s [vector] +++ OK, passed 100 tests.
  8056. 309.16 s [vector] izipWith: OK
  8057. 309.16 s [vector] +++ OK, passed 100 tests.
  8058. 309.16 s [vector] izipWith3: OK
  8059. 309.17 s [vector] +++ OK, passed 100 tests.
  8060. 309.17 s [vector] izipWithM: OK
  8061. 309.17 s [vector] +++ OK, passed 100 tests.
  8062. 309.18 s [vector] izipWithM_: OK
  8063. 309.18 s [vector] +++ OK, passed 100 tests.
  8064. 309.18 s [vector] zipWithM: OK
  8065. 309.18 s [vector] +++ OK, passed 100 tests.
  8066. 309.18 s [vector] zipWithM_: OK
  8067. 309.19 s [vector] +++ OK, passed 100 tests.
  8068. 309.19 s [vector] filter: OK
  8069. 309.19 s [vector] +++ OK, passed 100 tests.
  8070. 309.20 s [vector] ifilter: OK
  8071. 309.20 s [vector] +++ OK, passed 100 tests.
  8072. 309.22 s [vector] filterM: OK (0.03s)
  8073. 309.22 s [vector] +++ OK, passed 100 tests.
  8074. 309.22 s [vector] uniq: OK
  8075. 309.22 s [vector] +++ OK, passed 100 tests.
  8076. 309.22 s [vector] mapMaybe: OK
  8077. 309.22 s [vector] +++ OK, passed 100 tests.
  8078. 309.22 s [vector] imapMaybe: OK
  8079. 309.22 s [vector] +++ OK, passed 100 tests.
  8080. 309.22 s [vector] takeWhile: OK
  8081. 309.22 s [vector] +++ OK, passed 100 tests.
  8082. 309.22 s [vector] dropWhile: OK
  8083. 309.22 s [vector] +++ OK, passed 100 tests.
  8084. 309.22 s [vector] partition: OK
  8085. 309.23 s [vector] +++ OK, passed 100 tests.
  8086. 309.23 s [vector] partitionWith: OK
  8087. 309.23 s [vector] +++ OK, passed 100 tests.
  8088. 309.23 s [vector] span: OK
  8089. 309.23 s [vector] +++ OK, passed 100 tests.
  8090. 309.23 s [vector] break: OK
  8091. 309.23 s [vector] +++ OK, passed 100 tests.
  8092. 309.23 s [vector] spanR: OK
  8093. 309.23 s [vector] +++ OK, passed 100 tests.
  8094. 309.23 s [vector] breakR: OK
  8095. 309.23 s [vector] +++ OK, passed 100 tests.
  8096. 309.23 s [vector] groupBy: OK
  8097. 309.23 s [vector] +++ OK, passed 100 tests.
  8098. 309.23 s [vector] elem: OK
  8099. 309.23 s [vector] +++ OK, passed 100 tests.
  8100. 309.23 s [vector] notElem: OK
  8101. 309.23 s [vector] +++ OK, passed 100 tests.
  8102. 309.23 s [vector] find: OK
  8103. 309.23 s [vector] +++ OK, passed 100 tests.
  8104. 309.23 s [vector] findIndex: OK
  8105. 309.23 s [vector] +++ OK, passed 100 tests.
  8106. 309.23 s [vector] findIndexR: OK
  8107. 309.23 s [vector] +++ OK, passed 100 tests.
  8108. 309.23 s [vector] findIndices: OK
  8109. 309.23 s [vector] +++ OK, passed 100 tests.
  8110. 309.23 s [vector] elemIndex: OK
  8111. 309.23 s [vector] +++ OK, passed 100 tests.
  8112. 309.24 s [vector] elemIndices: OK
  8113. 309.24 s [vector] +++ OK, passed 100 tests.
  8114. 309.24 s [vector] foldl: OK
  8115. 309.24 s [vector] +++ OK, passed 100 tests.
  8116. 309.24 s [vector] foldl1: OK
  8117. 309.24 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8118. 309.24 s [vector] foldl': OK
  8119. 309.24 s [vector] +++ OK, passed 100 tests.
  8120. 309.24 s [vector] foldl1': OK
  8121. 309.24 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8122. 309.24 s [vector] foldr: OK
  8123. 309.24 s [vector] +++ OK, passed 100 tests.
  8124. 309.24 s [vector] foldr1: OK
  8125. 309.24 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8126. 309.24 s [vector] foldr': OK
  8127. 309.24 s [vector] +++ OK, passed 100 tests.
  8128. 309.24 s [vector] foldr1': OK
  8129. 309.24 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8130. 309.25 s [vector] ifoldl: OK
  8131. 309.25 s [vector] +++ OK, passed 100 tests.
  8132. 309.25 s [vector] ifoldl': OK
  8133. 309.25 s [vector] +++ OK, passed 100 tests.
  8134. 309.25 s [vector] ifoldr: OK
  8135. 309.25 s [vector] +++ OK, passed 100 tests.
  8136. 309.25 s [vector] ifoldr': OK
  8137. 309.25 s [vector] +++ OK, passed 100 tests.
  8138. 309.25 s [vector] ifoldM: OK
  8139. 309.25 s [vector] +++ OK, passed 100 tests.
  8140. 309.25 s [vector] ifoldM': OK
  8141. 309.26 s [vector] +++ OK, passed 100 tests.
  8142. 309.26 s [vector] ifoldM_: OK
  8143. 309.27 s [vector] +++ OK, passed 100 tests.
  8144. 309.28 s [vector] ifoldM'_: OK (0.01s)
  8145. 309.28 s [vector] +++ OK, passed 100 tests.
  8146. 309.28 s [vector] all: OK
  8147. 309.28 s [vector] +++ OK, passed 100 tests.
  8148. 309.28 s [vector] any: OK
  8149. 309.28 s [vector] +++ OK, passed 100 tests.
  8150. 309.28 s [vector] prescanl: OK
  8151. 309.28 s [vector] +++ OK, passed 100 tests.
  8152. 309.28 s [vector] prescanl': OK
  8153. 309.28 s [vector] +++ OK, passed 100 tests.
  8154. 309.28 s [vector] postscanl: OK
  8155. 309.28 s [vector] +++ OK, passed 100 tests.
  8156. 309.28 s [vector] postscanl': OK
  8157. 309.28 s [vector] +++ OK, passed 100 tests.
  8158. 309.28 s [vector] scanl: OK
  8159. 309.28 s [vector] +++ OK, passed 100 tests.
  8160. 309.28 s [vector] scanl': OK
  8161. 309.29 s [vector] +++ OK, passed 100 tests.
  8162. 309.29 s [vector] scanl1: OK
  8163. 309.29 s [vector] +++ OK, passed 100 tests.
  8164. 309.29 s [vector] scanl1': OK
  8165. 309.29 s [vector] +++ OK, passed 100 tests.
  8166. 309.29 s [vector] iscanl: OK
  8167. 309.29 s [vector] +++ OK, passed 100 tests.
  8168. 309.29 s [vector] iscanl': OK
  8169. 309.29 s [vector] +++ OK, passed 100 tests.
  8170. 309.29 s [vector] prescanr: OK
  8171. 309.29 s [vector] +++ OK, passed 100 tests.
  8172. 309.29 s [vector] prescanr': OK
  8173. 309.29 s [vector] +++ OK, passed 100 tests.
  8174. 309.29 s [vector] postscanr: OK
  8175. 309.29 s [vector] +++ OK, passed 100 tests.
  8176. 309.29 s [vector] postscanr': OK
  8177. 309.30 s [vector] +++ OK, passed 100 tests.
  8178. 309.30 s [vector] scanr: OK
  8179. 309.30 s [vector] +++ OK, passed 100 tests.
  8180. 309.30 s [vector] scanr': OK
  8181. 309.30 s [vector] +++ OK, passed 100 tests.
  8182. 309.30 s [vector] scanr1: OK
  8183. 309.30 s [vector] +++ OK, passed 100 tests.
  8184. 309.30 s [vector] scanr1': OK
  8185. 309.30 s [vector] +++ OK, passed 100 tests.
  8186. 309.31 s [vector] iscanr: OK
  8187. 309.31 s [vector] +++ OK, passed 100 tests.
  8188. 309.31 s [vector] iscanr': OK
  8189. 309.31 s [vector] +++ OK, passed 100 tests.
  8190. 309.31 s [vector] mut_read: OK
  8191. 309.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8192. 309.31 s [vector] mut_write: OK
  8193. 309.31 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8194. 309.31 s [vector] mut_modify: OK
  8195. 309.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8196. 309.31 s [vector] mut_generate: OK
  8197. 309.31 s [vector] +++ OK, passed 100 tests.
  8198. 309.31 s [vector] mut_generateM: OK
  8199. 309.32 s [vector] +++ OK, passed 100 tests.
  8200. 309.33 s [vector] mut_mapM_: OK (0.01s)
  8201. 309.33 s [vector] +++ OK, passed 100 tests.
  8202. 309.34 s [vector] mut_imapM_: OK
  8203. 309.34 s [vector] +++ OK, passed 100 tests.
  8204. 309.36 s [vector] mut_forM_: OK (0.01s)
  8205. 309.36 s [vector] +++ OK, passed 100 tests.
  8206. 309.36 s [vector] mut_iforM_: OK (0.01s)
  8207. 309.36 s [vector] +++ OK, passed 100 tests.
  8208. 309.36 s [vector] mut_foldr: OK
  8209. 309.36 s [vector] +++ OK, passed 100 tests.
  8210. 309.36 s [vector] mut_foldr': OK
  8211. 309.36 s [vector] +++ OK, passed 100 tests.
  8212. 309.36 s [vector] mut_foldl: OK
  8213. 309.36 s [vector] +++ OK, passed 100 tests.
  8214. 309.36 s [vector] mut_foldl': OK
  8215. 309.36 s [vector] +++ OK, passed 100 tests.
  8216. 309.36 s [vector] mut_ifoldr: OK
  8217. 309.36 s [vector] +++ OK, passed 100 tests.
  8218. 309.36 s [vector] mut_ifoldr': OK
  8219. 309.36 s [vector] +++ OK, passed 100 tests.
  8220. 309.37 s [vector] mut_ifoldl: OK
  8221. 309.37 s [vector] +++ OK, passed 100 tests.
  8222. 309.37 s [vector] mut_ifoldl': OK
  8223. 309.37 s [vector] +++ OK, passed 100 tests.
  8224. 309.37 s [vector] mut_foldM: OK
  8225. 309.37 s [vector] +++ OK, passed 100 tests.
  8226. 309.37 s [vector] mut_foldM': OK
  8227. 309.37 s [vector] +++ OK, passed 100 tests.
  8228. 309.37 s [vector] mut_foldrM: OK
  8229. 309.37 s [vector] +++ OK, passed 100 tests.
  8230. 309.37 s [vector] mut_foldrM': OK
  8231. 309.37 s [vector] +++ OK, passed 100 tests.
  8232. 309.37 s [vector] mut_ifoldM: OK
  8233. 309.37 s [vector] +++ OK, passed 100 tests.
  8234. 309.37 s [vector] mut_ifoldM': OK
  8235. 309.37 s [vector] +++ OK, passed 100 tests.
  8236. 309.37 s [vector] mut_ifoldrM: OK
  8237. 309.38 s [vector] +++ OK, passed 100 tests.
  8238. 309.38 s [vector] mut_ifoldrM': OK
  8239. 309.38 s [vector] +++ OK, passed 100 tests.
  8240. 309.38 s [vector] compare: OK
  8241. 309.38 s [vector] +++ OK, passed 100 tests.
  8242. 309.38 s [vector] maximum: OK
  8243. 309.38 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8244. 309.38 s [vector] minimum: OK
  8245. 309.38 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8246. 309.38 s [vector] minIndex: OK
  8247. 309.38 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8248. 309.38 s [vector] maxIndex: OK
  8249. 309.38 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8250. 309.38 s [vector] maximumBy: OK
  8251. 309.38 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8252. 309.38 s [vector] minimumBy: OK
  8253. 309.38 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8254. 309.38 s [vector] maximumOn: OK
  8255. 309.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8256. 309.38 s [vector] minimumOn: OK
  8257. 309.38 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8258. 309.38 s [vector] maxIndexBy: OK
  8259. 309.38 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8260. 309.38 s [vector] minIndexBy: OK
  8261. 309.38 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8262. 309.38 s [vector] ListFirstMaxIndexWins: OK
  8263. 309.38 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8264. 309.38 s [vector] FalseListFirstMaxIndexWins: OK
  8265. 309.38 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  8266. 309.38 s [vector] []
  8267. 309.38 s [vector] zip: OK
  8268. 309.38 s [vector] +++ OK, passed 100 tests.
  8269. 309.38 s [vector] zip3: OK
  8270. 309.38 s [vector] +++ OK, passed 100 tests.
  8271. 309.38 s [vector] unzip: OK
  8272. 309.38 s [vector] +++ OK, passed 100 tests.
  8273. 309.38 s [vector] unzip3: OK
  8274. 309.39 s [vector] +++ OK, passed 100 tests.
  8275. 309.39 s [vector] indexed: OK
  8276. 309.39 s [vector] +++ OK, passed 100 tests.
  8277. 309.39 s [vector] update: OK
  8278. 309.39 s [vector] +++ OK, passed 100 tests.
  8279. 309.39 s [vector] concat: OK
  8280. 309.39 s [vector] +++ OK, passed 100 tests.
  8281. 309.39 s [vector] mempty: OK
  8282. 309.39 s [vector] +++ OK, passed 1 test.
  8283. 309.39 s [vector] mappend: OK
  8284. 309.39 s [vector] +++ OK, passed 100 tests.
  8285. 309.40 s [vector] mconcat: OK
  8286. 309.40 s [vector] +++ OK, passed 100 tests.
  8287. 309.40 s [vector] fmap: OK
  8288. 309.40 s [vector] +++ OK, passed 100 tests.
  8289. 309.40 s [vector] return: OK
  8290. 309.42 s [vector] +++ OK, passed 100 tests.
  8291. 309.42 s [vector] bind: OK
  8292. 309.42 s [vector] +++ OK, passed 100 tests.
  8293. 309.42 s [vector] mzip: OK
  8294. 309.42 s [vector] +++ OK, passed 100 tests.
  8295. 309.42 s [vector] munzip: OK
  8296. 309.42 s [vector] +++ OK, passed 100 tests.
  8297. 309.42 s [vector] applicative_pure: OK
  8298. 309.42 s [vector] +++ OK, passed 100 tests.
  8299. 309.43 s [vector] applicative_appl: OK (0.02s)
  8300. 309.43 s [vector] +++ OK, passed 100 tests.
  8301. 309.43 s [vector] alternative_empty: OK
  8302. 309.43 s [vector] +++ OK, passed 1 test.
  8303. 309.43 s [vector] alternative_or: OK
  8304. 309.43 s [vector] +++ OK, passed 100 tests.
  8305. 309.46 s [vector] sequence: OK (0.02s)
  8306. 309.46 s [vector] +++ OK, passed 100 tests.
  8307. 309.47 s [vector] sequence_: OK
  8308. 309.47 s [vector] +++ OK, passed 100 tests.
  8309. 309.47 s [vector] glength: OK
  8310. 309.47 s [vector] +++ OK, passed 100 tests.
  8311. 309.47 s [vector] and: OK
  8312. 309.47 s [vector] +++ OK, passed 100 tests.
  8313. 309.47 s [vector] or: OK
  8314. 309.47 s [vector] +++ OK, passed 100 tests.
  8315. 309.47 s [vector] Int
  8316. 309.47 s [vector] fromList.toList == id: OK
  8317. 309.47 s [vector] +++ OK, passed 100 tests.
  8318. 309.47 s [vector] toList.fromList == id: OK
  8319. 309.47 s [vector] +++ OK, passed 100 tests.
  8320. 309.47 s [vector] unstream.stream == id: OK
  8321. 309.47 s [vector] +++ OK, passed 100 tests.
  8322. 309.47 s [vector] stream.unstream == id: OK
  8323. 309.47 s [vector] +++ OK, passed 100 tests.
  8324. 309.47 s [vector] eq: OK
  8325. 309.47 s [vector] +++ OK, passed 100 tests.
  8326. 309.47 s [vector] length: OK
  8327. 309.47 s [vector] +++ OK, passed 100 tests.
  8328. 309.47 s [vector] null: OK
  8329. 309.47 s [vector] +++ OK, passed 100 tests.
  8330. 309.47 s [vector] index: OK
  8331. 309.47 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8332. 309.47 s [vector] safeIndex: OK
  8333. 309.47 s [vector] +++ OK, passed 100 tests.
  8334. 309.48 s [vector] head: OK
  8335. 309.48 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8336. 309.48 s [vector] last: OK
  8337. 309.48 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8338. 309.48 s [vector] unsafeIndex: OK
  8339. 309.48 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8340. 309.48 s [vector] unsafeHead: OK
  8341. 309.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8342. 309.48 s [vector] unsafeLast: OK
  8343. 309.48 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8344. 309.48 s [vector] slice: OK
  8345. 309.48 s [vector] +++ OK, passed 100 tests.
  8346. 309.48 s [vector] init: OK
  8347. 309.48 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8348. 309.48 s [vector] tail: OK
  8349. 309.48 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8350. 309.48 s [vector] take: OK
  8351. 309.48 s [vector] +++ OK, passed 100 tests.
  8352. 309.48 s [vector] drop: OK
  8353. 309.48 s [vector] +++ OK, passed 100 tests.
  8354. 309.48 s [vector] splitAt: OK
  8355. 309.48 s [vector] +++ OK, passed 100 tests.
  8356. 309.48 s [vector] empty: OK
  8357. 309.48 s [vector] +++ OK, passed 1 test.
  8358. 309.48 s [vector] singleton: OK
  8359. 309.48 s [vector] +++ OK, passed 100 tests.
  8360. 309.48 s [vector] replicate: OK
  8361. 309.49 s [vector] +++ OK, passed 100 tests.
  8362. 309.49 s [vector] generate: OK
  8363. 309.49 s [vector] +++ OK, passed 100 tests.
  8364. 309.49 s [vector] iterateN: OK
  8365. 309.49 s [vector] +++ OK, passed 100 tests.
  8366. 309.50 s [vector] iterateNM: OK (0.01s)
  8367. 309.50 s [vector] +++ OK, passed 100 tests.
  8368. 309.54 s [vector] generateM: OK (0.03s)
  8369. 309.54 s [vector] +++ OK, passed 100 tests.
  8370. 309.54 s [vector] replicateM: OK (0.01s)
  8371. 309.54 s [vector] +++ OK, passed 100 tests.
  8372. 309.54 s [vector] create: OK
  8373. 309.54 s [vector] +++ OK, passed 100 tests.
  8374. 309.54 s [vector] createT: OK
  8375. 309.54 s [vector] +++ OK, passed 100 tests.
  8376. 309.54 s [vector] unfoldr: OK
  8377. 309.54 s [vector] +++ OK, passed 100 tests.
  8378. 309.54 s [vector] unfoldrN: OK
  8379. 309.55 s [vector] +++ OK, passed 100 tests.
  8380. 309.55 s [vector] unfoldrExactN: OK
  8381. 309.55 s [vector] +++ OK, passed 100 tests.
  8382. 309.55 s [vector] unfoldrM: OK
  8383. 309.55 s [vector] +++ OK, passed 100 tests.
  8384. 309.56 s [vector] unfoldrNM: OK
  8385. 309.56 s [vector] +++ OK, passed 100 tests.
  8386. 309.57 s [vector] unfoldrExactNM: OK (0.02s)
  8387. 309.57 s [vector] +++ OK, passed 100 tests.
  8388. 309.57 s [vector] constructN: OK
  8389. 309.57 s [vector] +++ OK, passed 100 tests.
  8390. 309.57 s [vector] constructrN: OK
  8391. 309.57 s [vector] +++ OK, passed 100 tests.
  8392. 309.57 s [vector] cons: OK
  8393. 309.57 s [vector] +++ OK, passed 100 tests.
  8394. 309.57 s [vector] snoc: OK
  8395. 309.57 s [vector] +++ OK, passed 100 tests.
  8396. 309.57 s [vector] append: OK
  8397. 309.58 s [vector] +++ OK, passed 100 tests.
  8398. 309.59 s [vector] concat: OK (0.01s)
  8399. 309.59 s [vector] +++ OK, passed 100 tests.
  8400. 309.59 s [vector] force: OK
  8401. 309.59 s [vector] +++ OK, passed 100 tests.
  8402. 309.59 s [vector] upd: OK
  8403. 309.59 s [vector] +++ OK, passed 100 tests.
  8404. 309.60 s [vector] accum: OK
  8405. 309.60 s [vector] +++ OK, passed 100 tests.
  8406. 309.60 s [vector] reverse: OK
  8407. 309.60 s [vector] +++ OK, passed 100 tests.
  8408. 309.60 s [vector] backpermute: OK
  8409. 309.60 s [vector] +++ OK, passed 100 tests.
  8410. 309.60 s [vector] map: OK
  8411. 309.60 s [vector] +++ OK, passed 100 tests.
  8412. 309.60 s [vector] imap: OK
  8413. 309.60 s [vector] +++ OK, passed 100 tests.
  8414. 309.60 s [vector] concatMap: OK
  8415. 309.60 s [vector] +++ OK, passed 100 tests.
  8416. 309.62 s [vector] mapM: OK
  8417. 309.62 s [vector] +++ OK, passed 100 tests.
  8418. 309.62 s [vector] mapM_: OK (0.02s)
  8419. 309.62 s [vector] +++ OK, passed 100 tests.
  8420. 309.62 s [vector] forM: OK
  8421. 309.64 s [vector] +++ OK, passed 100 tests.
  8422. 309.64 s [vector] forM_: OK (0.02s)
  8423. 309.64 s [vector] +++ OK, passed 100 tests.
  8424. 309.64 s [vector] imapM: OK
  8425. 309.66 s [vector] +++ OK, passed 100 tests.
  8426. 309.66 s [vector] imapM_: OK (0.02s)
  8427. 309.66 s [vector] +++ OK, passed 100 tests.
  8428. 309.66 s [vector] zipWith: OK
  8429. 309.66 s [vector] +++ OK, passed 100 tests.
  8430. 309.66 s [vector] zipWith3: OK
  8431. 309.66 s [vector] +++ OK, passed 100 tests.
  8432. 309.66 s [vector] izipWith: OK
  8433. 309.66 s [vector] +++ OK, passed 100 tests.
  8434. 309.67 s [vector] izipWith3: OK
  8435. 309.67 s [vector] +++ OK, passed 100 tests.
  8436. 309.68 s [vector] izipWithM: OK
  8437. 309.68 s [vector] +++ OK, passed 100 tests.
  8438. 309.68 s [vector] izipWithM_: OK (0.01s)
  8439. 309.68 s [vector] +++ OK, passed 100 tests.
  8440. 309.69 s [vector] zipWithM: OK
  8441. 309.69 s [vector] +++ OK, passed 100 tests.
  8442. 309.69 s [vector] zipWithM_: OK (0.01s)
  8443. 309.69 s [vector] +++ OK, passed 100 tests.
  8444. 309.69 s [vector] filter: OK
  8445. 309.69 s [vector] +++ OK, passed 100 tests.
  8446. 309.70 s [vector] ifilter: OK
  8447. 309.70 s [vector] +++ OK, passed 100 tests.
  8448. 309.73 s [vector] filterM: OK (0.03s)
  8449. 309.73 s [vector] +++ OK, passed 100 tests.
  8450. 309.73 s [vector] uniq: OK
  8451. 309.73 s [vector] +++ OK, passed 100 tests.
  8452. 309.73 s [vector] mapMaybe: OK
  8453. 309.73 s [vector] +++ OK, passed 100 tests.
  8454. 309.73 s [vector] imapMaybe: OK
  8455. 309.73 s [vector] +++ OK, passed 100 tests.
  8456. 309.73 s [vector] takeWhile: OK
  8457. 309.73 s [vector] +++ OK, passed 100 tests.
  8458. 309.74 s [vector] dropWhile: OK
  8459. 309.74 s [vector] +++ OK, passed 100 tests.
  8460. 309.74 s [vector] partition: OK
  8461. 309.74 s [vector] +++ OK, passed 100 tests.
  8462. 309.74 s [vector] partitionWith: OK
  8463. 309.74 s [vector] +++ OK, passed 100 tests.
  8464. 309.74 s [vector] span: OK
  8465. 309.74 s [vector] +++ OK, passed 100 tests.
  8466. 309.74 s [vector] break: OK
  8467. 309.74 s [vector] +++ OK, passed 100 tests.
  8468. 309.74 s [vector] spanR: OK
  8469. 309.74 s [vector] +++ OK, passed 100 tests.
  8470. 309.74 s [vector] breakR: OK
  8471. 309.74 s [vector] +++ OK, passed 100 tests.
  8472. 309.74 s [vector] groupBy: OK
  8473. 309.74 s [vector] +++ OK, passed 100 tests.
  8474. 309.74 s [vector] elem: OK
  8475. 309.74 s [vector] +++ OK, passed 100 tests.
  8476. 309.74 s [vector] notElem: OK
  8477. 309.74 s [vector] +++ OK, passed 100 tests.
  8478. 309.74 s [vector] find: OK
  8479. 309.74 s [vector] +++ OK, passed 100 tests.
  8480. 309.74 s [vector] findIndex: OK
  8481. 309.74 s [vector] +++ OK, passed 100 tests.
  8482. 309.75 s [vector] findIndexR: OK
  8483. 309.75 s [vector] +++ OK, passed 100 tests.
  8484. 309.75 s [vector] findIndices: OK
  8485. 309.75 s [vector] +++ OK, passed 100 tests.
  8486. 309.75 s [vector] elemIndex: OK
  8487. 309.75 s [vector] +++ OK, passed 100 tests.
  8488. 309.75 s [vector] elemIndices: OK
  8489. 309.75 s [vector] +++ OK, passed 100 tests.
  8490. 309.75 s [vector] foldl: OK
  8491. 309.75 s [vector] +++ OK, passed 100 tests.
  8492. 309.75 s [vector] foldl1: OK
  8493. 309.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8494. 309.75 s [vector] foldl': OK
  8495. 309.76 s [vector] +++ OK, passed 100 tests.
  8496. 309.76 s [vector] foldl1': OK
  8497. 309.76 s [vector] +++ OK, passed 100 tests; 24 discarded.
  8498. 309.76 s [vector] foldr: OK
  8499. 309.76 s [vector] +++ OK, passed 100 tests.
  8500. 309.76 s [vector] foldr1: OK
  8501. 309.76 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8502. 309.76 s [vector] foldr': OK
  8503. 309.76 s [vector] +++ OK, passed 100 tests.
  8504. 309.76 s [vector] foldr1': OK
  8505. 309.77 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8506. 309.77 s [vector] ifoldl: OK
  8507. 309.77 s [vector] +++ OK, passed 100 tests.
  8508. 309.77 s [vector] ifoldl': OK
  8509. 309.77 s [vector] +++ OK, passed 100 tests.
  8510. 309.77 s [vector] ifoldr: OK
  8511. 309.77 s [vector] +++ OK, passed 100 tests.
  8512. 309.78 s [vector] ifoldr': OK
  8513. 309.78 s [vector] +++ OK, passed 100 tests.
  8514. 309.78 s [vector] ifoldM: OK
  8515. 309.78 s [vector] +++ OK, passed 100 tests.
  8516. 309.80 s [vector] ifoldM': OK
  8517. 309.80 s [vector] +++ OK, passed 100 tests.
  8518. 309.82 s [vector] ifoldM_: OK (0.02s)
  8519. 309.82 s [vector] +++ OK, passed 100 tests.
  8520. 309.82 s [vector] ifoldM'_: OK (0.02s)
  8521. 309.82 s [vector] +++ OK, passed 100 tests.
  8522. 309.82 s [vector] all: OK
  8523. 309.82 s [vector] +++ OK, passed 100 tests.
  8524. 309.82 s [vector] any: OK
  8525. 309.82 s [vector] +++ OK, passed 100 tests.
  8526. 309.82 s [vector] prescanl: OK
  8527. 309.82 s [vector] +++ OK, passed 100 tests.
  8528. 309.82 s [vector] prescanl': OK
  8529. 309.82 s [vector] +++ OK, passed 100 tests.
  8530. 309.83 s [vector] postscanl: OK
  8531. 309.83 s [vector] +++ OK, passed 100 tests.
  8532. 309.83 s [vector] postscanl': OK
  8533. 309.83 s [vector] +++ OK, passed 100 tests.
  8534. 309.83 s [vector] scanl: OK
  8535. 309.83 s [vector] +++ OK, passed 100 tests.
  8536. 309.83 s [vector] scanl': OK
  8537. 309.83 s [vector] +++ OK, passed 100 tests.
  8538. 309.84 s [vector] scanl1: OK
  8539. 309.84 s [vector] +++ OK, passed 100 tests.
  8540. 309.84 s [vector] scanl1': OK
  8541. 309.84 s [vector] +++ OK, passed 100 tests.
  8542. 309.84 s [vector] iscanl: OK
  8543. 309.84 s [vector] +++ OK, passed 100 tests.
  8544. 309.85 s [vector] iscanl': OK
  8545. 309.85 s [vector] +++ OK, passed 100 tests.
  8546. 309.85 s [vector] prescanr: OK
  8547. 309.85 s [vector] +++ OK, passed 100 tests.
  8548. 309.85 s [vector] prescanr': OK
  8549. 309.85 s [vector] +++ OK, passed 100 tests.
  8550. 309.86 s [vector] postscanr: OK
  8551. 309.86 s [vector] +++ OK, passed 100 tests.
  8552. 309.86 s [vector] postscanr': OK
  8553. 309.86 s [vector] +++ OK, passed 100 tests.
  8554. 309.86 s [vector] scanr: OK
  8555. 309.86 s [vector] +++ OK, passed 100 tests.
  8556. 309.86 s [vector] scanr': OK
  8557. 309.86 s [vector] +++ OK, passed 100 tests.
  8558. 309.86 s [vector] scanr1: OK
  8559. 309.86 s [vector] +++ OK, passed 100 tests.
  8560. 309.87 s [vector] scanr1': OK
  8561. 309.87 s [vector] +++ OK, passed 100 tests.
  8562. 309.87 s [vector] iscanr: OK
  8563. 309.87 s [vector] +++ OK, passed 100 tests.
  8564. 309.87 s [vector] iscanr': OK
  8565. 309.87 s [vector] +++ OK, passed 100 tests.
  8566. 309.87 s [vector] mut_read: OK
  8567. 309.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8568. 309.87 s [vector] mut_write: OK
  8569. 309.87 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8570. 309.87 s [vector] mut_modify: OK
  8571. 309.87 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8572. 309.87 s [vector] mut_generate: OK
  8573. 309.87 s [vector] +++ OK, passed 100 tests.
  8574. 309.90 s [vector] mut_generateM: OK
  8575. 309.90 s [vector] +++ OK, passed 100 tests.
  8576. 309.91 s [vector] mut_mapM_: OK (0.01s)
  8577. 309.91 s [vector] +++ OK, passed 100 tests.
  8578. 309.92 s [vector] mut_imapM_: OK (0.02s)
  8579. 309.92 s [vector] +++ OK, passed 100 tests.
  8580. 309.94 s [vector] mut_forM_: OK (0.02s)
  8581. 309.94 s [vector] +++ OK, passed 100 tests.
  8582. 309.95 s [vector] mut_iforM_: OK (0.02s)
  8583. 309.95 s [vector] +++ OK, passed 100 tests.
  8584. 309.95 s [vector] mut_foldr: OK
  8585. 309.95 s [vector] +++ OK, passed 100 tests.
  8586. 309.96 s [vector] mut_foldr': OK
  8587. 309.96 s [vector] +++ OK, passed 100 tests.
  8588. 309.96 s [vector] mut_foldl: OK
  8589. 309.96 s [vector] +++ OK, passed 100 tests.
  8590. 309.96 s [vector] mut_foldl': OK
  8591. 309.96 s [vector] +++ OK, passed 100 tests.
  8592. 309.96 s [vector] mut_ifoldr: OK
  8593. 309.97 s [vector] +++ OK, passed 100 tests.
  8594. 309.97 s [vector] mut_ifoldr': OK
  8595. 309.97 s [vector] +++ OK, passed 100 tests.
  8596. 309.97 s [vector] mut_ifoldl: OK
  8597. 309.97 s [vector] +++ OK, passed 100 tests.
  8598. 309.97 s [vector] mut_ifoldl': OK
  8599. 309.97 s [vector] +++ OK, passed 100 tests.
  8600. 309.98 s [vector] mut_foldM: OK
  8601. 309.98 s [vector] +++ OK, passed 100 tests.
  8602. 309.98 s [vector] mut_foldM': OK
  8603. 309.98 s [vector] +++ OK, passed 100 tests.
  8604. 309.98 s [vector] mut_foldrM: OK
  8605. 309.98 s [vector] +++ OK, passed 100 tests.
  8606. 309.98 s [vector] mut_foldrM': OK
  8607. 309.98 s [vector] +++ OK, passed 100 tests.
  8608. 309.98 s [vector] mut_ifoldM: OK
  8609. 309.99 s [vector] +++ OK, passed 100 tests.
  8610. 309.99 s [vector] mut_ifoldM': OK
  8611. 309.99 s [vector] +++ OK, passed 100 tests.
  8612. 309.99 s [vector] mut_ifoldrM: OK
  8613. 309.99 s [vector] +++ OK, passed 100 tests.
  8614. 309.99 s [vector] mut_ifoldrM': OK
  8615. 309.99 s [vector] +++ OK, passed 100 tests.
  8616. 309.99 s [vector] compare: OK
  8617. 309.99 s [vector] +++ OK, passed 100 tests.
  8618. 309.99 s [vector] maximum: OK
  8619. 310.00 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8620. 310.00 s [vector] minimum: OK
  8621. 310.00 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8622. 310.00 s [vector] minIndex: OK
  8623. 310.00 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8624. 310.00 s [vector] maxIndex: OK
  8625. 310.00 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8626. 310.00 s [vector] maximumBy: OK
  8627. 310.00 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8628. 310.00 s [vector] minimumBy: OK
  8629. 310.00 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8630. 310.00 s [vector] maximumOn: OK
  8631. 310.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8632. 310.00 s [vector] minimumOn: OK
  8633. 310.00 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8634. 310.00 s [vector] maxIndexBy: OK
  8635. 310.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8636. 310.00 s [vector] minIndexBy: OK
  8637. 310.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8638. 310.00 s [vector] ListFirstMaxIndexWins: OK
  8639. 310.00 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8640. 310.00 s [vector] FalseListFirstMaxIndexWins: OK
  8641. 310.00 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  8642. 310.00 s [vector] []
  8643. 310.00 s [vector] zip: OK
  8644. 310.00 s [vector] +++ OK, passed 100 tests.
  8645. 310.00 s [vector] zip3: OK
  8646. 310.00 s [vector] +++ OK, passed 100 tests.
  8647. 310.00 s [vector] unzip: OK
  8648. 310.00 s [vector] +++ OK, passed 100 tests.
  8649. 310.00 s [vector] unzip3: OK
  8650. 310.00 s [vector] +++ OK, passed 100 tests.
  8651. 310.00 s [vector] indexed: OK
  8652. 310.00 s [vector] +++ OK, passed 100 tests.
  8653. 310.00 s [vector] update: OK
  8654. 310.01 s [vector] +++ OK, passed 100 tests.
  8655. 310.01 s [vector] concat: OK
  8656. 310.01 s [vector] +++ OK, passed 100 tests.
  8657. 310.01 s [vector] mempty: OK
  8658. 310.01 s [vector] +++ OK, passed 1 test.
  8659. 310.02 s [vector] mappend: OK
  8660. 310.02 s [vector] +++ OK, passed 100 tests.
  8661. 310.03 s [vector] mconcat: OK (0.02s)
  8662. 310.03 s [vector] +++ OK, passed 100 tests.
  8663. 310.03 s [vector] fmap: OK
  8664. 310.03 s [vector] +++ OK, passed 100 tests.
  8665. 310.03 s [vector] return: OK
  8666. 310.04 s [vector] +++ OK, passed 100 tests.
  8667. 310.05 s [vector] bind: OK (0.02s)
  8668. 310.05 s [vector] +++ OK, passed 100 tests.
  8669. 310.05 s [vector] mzip: OK
  8670. 310.05 s [vector] +++ OK, passed 100 tests.
  8671. 310.05 s [vector] munzip: OK
  8672. 310.05 s [vector] +++ OK, passed 100 tests.
  8673. 310.05 s [vector] applicative_pure: OK
  8674. 310.06 s [vector] +++ OK, passed 100 tests.
  8675. 310.09 s [vector] applicative_appl: OK (0.04s)
  8676. 310.09 s [vector] +++ OK, passed 100 tests.
  8677. 310.09 s [vector] alternative_empty: OK
  8678. 310.09 s [vector] +++ OK, passed 1 test.
  8679. 310.09 s [vector] alternative_or: OK
  8680. 310.10 s [vector] +++ OK, passed 100 tests.
  8681. 310.14 s [vector] sequence: OK (0.04s)
  8682. 310.14 s [vector] +++ OK, passed 100 tests.
  8683. 310.14 s [vector] sequence_: OK (0.01s)
  8684. 310.14 s [vector] +++ OK, passed 100 tests.
  8685. 310.14 s [vector] glength: OK
  8686. 310.14 s [vector] +++ OK, passed 100 tests.
  8687. 310.14 s [vector] sum: OK
  8688. 310.14 s [vector] +++ OK, passed 100 tests.
  8689. 310.14 s [vector] product: OK
  8690. 310.14 s [vector] +++ OK, passed 100 tests.
  8691. 310.14 s [vector] enumFromN: OK
  8692. 310.14 s [vector] +++ OK, passed 100 tests.
  8693. 310.14 s [vector] enumFromThenN: OK
  8694. 310.14 s [vector] +++ OK, passed 100 tests.
  8695. 310.14 s [vector] enumFromTo: OK
  8696. 310.14 s [vector] +++ OK, passed 100 tests.
  8697. 310.14 s [vector] enumFromThenTo: OK
  8698. 310.14 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8699. 310.14 s [vector] unstream
  8700. 310.14 s [vector] unstream == vunstream (exact): OK
  8701. 310.14 s [vector] +++ OK, passed 100 tests.
  8702. 310.14 s [vector] unstream == vunstream (unknown): OK
  8703. 310.14 s [vector] +++ OK, passed 100 tests.
  8704. 310.14 s [vector] unstreamR ~= vunstream (exact): OK
  8705. 310.14 s [vector] +++ OK, passed 100 tests.
  8706. 310.14 s [vector] unstreamR ~= vunstream (unknown): OK
  8707. 310.14 s [vector] +++ OK, passed 100 tests.
  8708. 310.14 s [vector] Tests.Vector.Primitive
  8709. 310.14 s [vector] Int
  8710. 310.14 s [vector] fromList.toList == id: OK
  8711. 310.14 s [vector] +++ OK, passed 100 tests.
  8712. 310.14 s [vector] toList.fromList == id: OK
  8713. 310.14 s [vector] +++ OK, passed 100 tests.
  8714. 310.14 s [vector] unstream.stream == id: OK
  8715. 310.14 s [vector] +++ OK, passed 100 tests.
  8716. 310.14 s [vector] stream.unstream == id: OK
  8717. 310.14 s [vector] +++ OK, passed 100 tests.
  8718. 310.14 s [vector] eq: OK
  8719. 310.14 s [vector] +++ OK, passed 100 tests.
  8720. 310.14 s [vector] length: OK
  8721. 310.14 s [vector] +++ OK, passed 100 tests.
  8722. 310.14 s [vector] null: OK
  8723. 310.14 s [vector] +++ OK, passed 100 tests.
  8724. 310.14 s [vector] index: OK
  8725. 310.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8726. 310.14 s [vector] safeIndex: OK
  8727. 310.14 s [vector] +++ OK, passed 100 tests.
  8728. 310.14 s [vector] head: OK
  8729. 310.14 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8730. 310.15 s [vector] last: OK
  8731. 310.15 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8732. 310.15 s [vector] unsafeIndex: OK
  8733. 310.15 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8734. 310.15 s [vector] unsafeHead: OK
  8735. 310.15 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8736. 310.15 s [vector] unsafeLast: OK
  8737. 310.15 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8738. 310.15 s [vector] slice: OK
  8739. 310.15 s [vector] +++ OK, passed 100 tests.
  8740. 310.15 s [vector] init: OK
  8741. 310.15 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8742. 310.15 s [vector] tail: OK
  8743. 310.15 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8744. 310.15 s [vector] take: OK
  8745. 310.15 s [vector] +++ OK, passed 100 tests.
  8746. 310.15 s [vector] drop: OK
  8747. 310.15 s [vector] +++ OK, passed 100 tests.
  8748. 310.15 s [vector] splitAt: OK
  8749. 310.15 s [vector] +++ OK, passed 100 tests.
  8750. 310.15 s [vector] empty: OK
  8751. 310.15 s [vector] +++ OK, passed 1 test.
  8752. 310.15 s [vector] singleton: OK
  8753. 310.15 s [vector] +++ OK, passed 100 tests.
  8754. 310.15 s [vector] replicate: OK
  8755. 310.15 s [vector] +++ OK, passed 100 tests.
  8756. 310.16 s [vector] generate: OK
  8757. 310.16 s [vector] +++ OK, passed 100 tests.
  8758. 310.16 s [vector] iterateN: OK
  8759. 310.16 s [vector] +++ OK, passed 100 tests.
  8760. 310.18 s [vector] iterateNM: OK (0.01s)
  8761. 310.18 s [vector] +++ OK, passed 100 tests.
  8762. 310.19 s [vector] generateM: OK (0.01s)
  8763. 310.19 s [vector] +++ OK, passed 100 tests.
  8764. 310.19 s [vector] replicateM: OK
  8765. 310.19 s [vector] +++ OK, passed 100 tests.
  8766. 310.19 s [vector] create: OK
  8767. 310.19 s [vector] +++ OK, passed 100 tests.
  8768. 310.19 s [vector] createT: OK
  8769. 310.19 s [vector] +++ OK, passed 100 tests.
  8770. 310.19 s [vector] unfoldr: OK
  8771. 310.19 s [vector] +++ OK, passed 100 tests.
  8772. 310.19 s [vector] unfoldrN: OK
  8773. 310.20 s [vector] +++ OK, passed 100 tests.
  8774. 310.20 s [vector] unfoldrExactN: OK
  8775. 310.20 s [vector] +++ OK, passed 100 tests.
  8776. 310.20 s [vector] unfoldrM: OK
  8777. 310.20 s [vector] +++ OK, passed 100 tests.
  8778. 310.20 s [vector] unfoldrNM: OK
  8779. 310.20 s [vector] +++ OK, passed 100 tests.
  8780. 310.24 s [vector] unfoldrExactNM: OK (0.01s)
  8781. 310.24 s [vector] +++ OK, passed 100 tests.
  8782. 310.24 s [vector] constructN: OK
  8783. 310.24 s [vector] +++ OK, passed 100 tests.
  8784. 310.24 s [vector] constructrN: OK
  8785. 310.24 s [vector] +++ OK, passed 100 tests.
  8786. 310.24 s [vector] cons: OK
  8787. 310.24 s [vector] +++ OK, passed 100 tests.
  8788. 310.24 s [vector] snoc: OK
  8789. 310.25 s [vector] +++ OK, passed 100 tests.
  8790. 310.25 s [vector] append: OK
  8791. 310.26 s [vector] +++ OK, passed 100 tests.
  8792. 310.26 s [vector] concat: OK (0.02s)
  8793. 310.26 s [vector] +++ OK, passed 100 tests.
  8794. 310.27 s [vector] force: OK
  8795. 310.27 s [vector] +++ OK, passed 100 tests.
  8796. 310.27 s [vector] upd: OK
  8797. 310.27 s [vector] +++ OK, passed 100 tests.
  8798. 310.27 s [vector] accum: OK
  8799. 310.27 s [vector] +++ OK, passed 100 tests.
  8800. 310.27 s [vector] reverse: OK
  8801. 310.27 s [vector] +++ OK, passed 100 tests.
  8802. 310.27 s [vector] backpermute: OK
  8803. 310.28 s [vector] +++ OK, passed 100 tests.
  8804. 310.28 s [vector] map: OK
  8805. 310.28 s [vector] +++ OK, passed 100 tests.
  8806. 310.28 s [vector] imap: OK
  8807. 310.28 s [vector] +++ OK, passed 100 tests.
  8808. 310.28 s [vector] concatMap: OK
  8809. 310.28 s [vector] +++ OK, passed 100 tests.
  8810. 310.28 s [vector] mapM: OK
  8811. 310.30 s [vector] +++ OK, passed 100 tests.
  8812. 310.30 s [vector] mapM_: OK (0.01s)
  8813. 310.30 s [vector] +++ OK, passed 100 tests.
  8814. 310.32 s [vector] forM: OK
  8815. 310.32 s [vector] +++ OK, passed 100 tests.
  8816. 310.32 s [vector] forM_: OK (0.02s)
  8817. 310.32 s [vector] +++ OK, passed 100 tests.
  8818. 310.34 s [vector] imapM: OK
  8819. 310.34 s [vector] +++ OK, passed 100 tests.
  8820. 310.34 s [vector] imapM_: OK (0.02s)
  8821. 310.34 s [vector] +++ OK, passed 100 tests.
  8822. 310.34 s [vector] zipWith: OK
  8823. 310.34 s [vector] +++ OK, passed 100 tests.
  8824. 310.34 s [vector] zipWith3: OK
  8825. 310.35 s [vector] +++ OK, passed 100 tests.
  8826. 310.35 s [vector] izipWith: OK
  8827. 310.35 s [vector] +++ OK, passed 100 tests.
  8828. 310.35 s [vector] izipWith3: OK
  8829. 310.35 s [vector] +++ OK, passed 100 tests.
  8830. 310.35 s [vector] izipWithM: OK
  8831. 310.36 s [vector] +++ OK, passed 100 tests.
  8832. 310.37 s [vector] izipWithM_: OK (0.01s)
  8833. 310.37 s [vector] +++ OK, passed 100 tests.
  8834. 310.38 s [vector] zipWithM: OK
  8835. 310.38 s [vector] +++ OK, passed 100 tests.
  8836. 310.38 s [vector] zipWithM_: OK (0.01s)
  8837. 310.38 s [vector] +++ OK, passed 100 tests.
  8838. 310.38 s [vector] filter: OK
  8839. 310.38 s [vector] +++ OK, passed 100 tests.
  8840. 310.40 s [vector] ifilter: OK
  8841. 310.40 s [vector] +++ OK, passed 100 tests.
  8842. 310.40 s [vector] filterM: OK (0.02s)
  8843. 310.40 s [vector] +++ OK, passed 100 tests.
  8844. 310.40 s [vector] uniq: OK
  8845. 310.40 s [vector] +++ OK, passed 100 tests.
  8846. 310.40 s [vector] mapMaybe: OK
  8847. 310.41 s [vector] +++ OK, passed 100 tests.
  8848. 310.41 s [vector] imapMaybe: OK
  8849. 310.41 s [vector] +++ OK, passed 100 tests.
  8850. 310.41 s [vector] takeWhile: OK
  8851. 310.41 s [vector] +++ OK, passed 100 tests.
  8852. 310.41 s [vector] dropWhile: OK
  8853. 310.41 s [vector] +++ OK, passed 100 tests.
  8854. 310.41 s [vector] partition: OK
  8855. 310.41 s [vector] +++ OK, passed 100 tests.
  8856. 310.41 s [vector] partitionWith: OK
  8857. 310.41 s [vector] +++ OK, passed 100 tests.
  8858. 310.41 s [vector] span: OK
  8859. 310.41 s [vector] +++ OK, passed 100 tests.
  8860. 310.41 s [vector] break: OK
  8861. 310.41 s [vector] +++ OK, passed 100 tests.
  8862. 310.42 s [vector] spanR: OK
  8863. 310.42 s [vector] +++ OK, passed 100 tests.
  8864. 310.42 s [vector] breakR: OK
  8865. 310.42 s [vector] +++ OK, passed 100 tests.
  8866. 310.42 s [vector] groupBy: OK
  8867. 310.42 s [vector] +++ OK, passed 100 tests.
  8868. 310.42 s [vector] elem: OK
  8869. 310.42 s [vector] +++ OK, passed 100 tests.
  8870. 310.42 s [vector] notElem: OK
  8871. 310.42 s [vector] +++ OK, passed 100 tests.
  8872. 310.42 s [vector] find: OK
  8873. 310.42 s [vector] +++ OK, passed 100 tests.
  8874. 310.42 s [vector] findIndex: OK
  8875. 310.42 s [vector] +++ OK, passed 100 tests.
  8876. 310.42 s [vector] findIndexR: OK
  8877. 310.42 s [vector] +++ OK, passed 100 tests.
  8878. 310.42 s [vector] findIndices: OK
  8879. 310.42 s [vector] +++ OK, passed 100 tests.
  8880. 310.42 s [vector] elemIndex: OK
  8881. 310.42 s [vector] +++ OK, passed 100 tests.
  8882. 310.43 s [vector] elemIndices: OK
  8883. 310.43 s [vector] +++ OK, passed 100 tests.
  8884. 310.43 s [vector] foldl: OK
  8885. 310.43 s [vector] +++ OK, passed 100 tests.
  8886. 310.43 s [vector] foldl1: OK
  8887. 310.43 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8888. 310.43 s [vector] foldl': OK
  8889. 310.44 s [vector] +++ OK, passed 100 tests.
  8890. 310.44 s [vector] foldl1': OK
  8891. 310.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8892. 310.44 s [vector] foldr: OK
  8893. 310.44 s [vector] +++ OK, passed 100 tests.
  8894. 310.44 s [vector] foldr1: OK
  8895. 310.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8896. 310.45 s [vector] foldr': OK
  8897. 310.45 s [vector] +++ OK, passed 100 tests.
  8898. 310.45 s [vector] foldr1': OK
  8899. 310.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8900. 310.45 s [vector] ifoldl: OK
  8901. 310.45 s [vector] +++ OK, passed 100 tests.
  8902. 310.45 s [vector] ifoldl': OK
  8903. 310.46 s [vector] +++ OK, passed 100 tests.
  8904. 310.46 s [vector] ifoldr: OK
  8905. 310.46 s [vector] +++ OK, passed 100 tests.
  8906. 310.46 s [vector] ifoldr': OK
  8907. 310.46 s [vector] +++ OK, passed 100 tests.
  8908. 310.47 s [vector] ifoldM: OK
  8909. 310.47 s [vector] +++ OK, passed 100 tests.
  8910. 310.49 s [vector] ifoldM': OK
  8911. 310.49 s [vector] +++ OK, passed 100 tests.
  8912. 310.51 s [vector] ifoldM_: OK (0.02s)
  8913. 310.51 s [vector] +++ OK, passed 100 tests.
  8914. 310.51 s [vector] ifoldM'_: OK (0.02s)
  8915. 310.51 s [vector] +++ OK, passed 100 tests.
  8916. 310.51 s [vector] all: OK
  8917. 310.51 s [vector] +++ OK, passed 100 tests.
  8918. 310.51 s [vector] any: OK
  8919. 310.51 s [vector] +++ OK, passed 100 tests.
  8920. 310.51 s [vector] prescanl: OK
  8921. 310.51 s [vector] +++ OK, passed 100 tests.
  8922. 310.51 s [vector] prescanl': OK
  8923. 310.52 s [vector] +++ OK, passed 100 tests.
  8924. 310.52 s [vector] postscanl: OK
  8925. 310.52 s [vector] +++ OK, passed 100 tests.
  8926. 310.52 s [vector] postscanl': OK
  8927. 310.52 s [vector] +++ OK, passed 100 tests.
  8928. 310.52 s [vector] scanl: OK
  8929. 310.52 s [vector] +++ OK, passed 100 tests.
  8930. 310.53 s [vector] scanl': OK
  8931. 310.53 s [vector] +++ OK, passed 100 tests.
  8932. 310.53 s [vector] scanl1: OK
  8933. 310.53 s [vector] +++ OK, passed 100 tests.
  8934. 310.53 s [vector] scanl1': OK
  8935. 310.53 s [vector] +++ OK, passed 100 tests.
  8936. 310.53 s [vector] iscanl: OK
  8937. 310.54 s [vector] +++ OK, passed 100 tests.
  8938. 310.54 s [vector] iscanl': OK
  8939. 310.54 s [vector] +++ OK, passed 100 tests.
  8940. 310.54 s [vector] prescanr: OK
  8941. 310.54 s [vector] +++ OK, passed 100 tests.
  8942. 310.55 s [vector] prescanr': OK
  8943. 310.55 s [vector] +++ OK, passed 100 tests.
  8944. 310.55 s [vector] postscanr: OK
  8945. 310.55 s [vector] +++ OK, passed 100 tests.
  8946. 310.55 s [vector] postscanr': OK
  8947. 310.55 s [vector] +++ OK, passed 100 tests.
  8948. 310.55 s [vector] scanr: OK
  8949. 310.55 s [vector] +++ OK, passed 100 tests.
  8950. 310.56 s [vector] scanr': OK
  8951. 310.56 s [vector] +++ OK, passed 100 tests.
  8952. 310.56 s [vector] scanr1: OK
  8953. 310.56 s [vector] +++ OK, passed 100 tests.
  8954. 310.56 s [vector] scanr1': OK
  8955. 310.56 s [vector] +++ OK, passed 100 tests.
  8956. 310.56 s [vector] iscanr: OK
  8957. 310.56 s [vector] +++ OK, passed 100 tests.
  8958. 310.58 s [vector] iscanr': OK
  8959. 310.58 s [vector] +++ OK, passed 100 tests.
  8960. 310.58 s [vector] mut_read: OK
  8961. 310.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8962. 310.58 s [vector] mut_write: OK
  8963. 310.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8964. 310.58 s [vector] mut_modify: OK
  8965. 310.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8966. 310.58 s [vector] mut_generate: OK
  8967. 310.58 s [vector] +++ OK, passed 100 tests.
  8968. 310.59 s [vector] mut_generateM: OK (0.01s)
  8969. 310.59 s [vector] +++ OK, passed 100 tests.
  8970. 310.61 s [vector] mut_mapM_: OK (0.01s)
  8971. 310.61 s [vector] +++ OK, passed 100 tests.
  8972. 310.63 s [vector] mut_imapM_: OK (0.02s)
  8973. 310.63 s [vector] +++ OK, passed 100 tests.
  8974. 310.65 s [vector] mut_forM_: OK (0.02s)
  8975. 310.65 s [vector] +++ OK, passed 100 tests.
  8976. 310.65 s [vector] mut_iforM_: OK (0.02s)
  8977. 310.65 s [vector] +++ OK, passed 100 tests.
  8978. 310.65 s [vector] mut_foldr: OK
  8979. 310.66 s [vector] +++ OK, passed 100 tests.
  8980. 310.66 s [vector] mut_foldr': OK
  8981. 310.66 s [vector] +++ OK, passed 100 tests.
  8982. 310.66 s [vector] mut_foldl: OK
  8983. 310.66 s [vector] +++ OK, passed 100 tests.
  8984. 310.67 s [vector] mut_foldl': OK
  8985. 310.67 s [vector] +++ OK, passed 100 tests.
  8986. 310.67 s [vector] mut_ifoldr: OK
  8987. 310.67 s [vector] +++ OK, passed 100 tests.
  8988. 310.68 s [vector] mut_ifoldr': OK
  8989. 310.68 s [vector] +++ OK, passed 100 tests.
  8990. 310.68 s [vector] mut_ifoldl: OK
  8991. 310.68 s [vector] +++ OK, passed 100 tests.
  8992. 310.68 s [vector] mut_ifoldl': OK
  8993. 310.68 s [vector] +++ OK, passed 100 tests.
  8994. 310.68 s [vector] mut_foldM: OK
  8995. 310.68 s [vector] +++ OK, passed 100 tests.
  8996. 310.68 s [vector] mut_foldM': OK
  8997. 310.69 s [vector] +++ OK, passed 100 tests.
  8998. 310.69 s [vector] mut_foldrM: OK
  8999. 310.69 s [vector] +++ OK, passed 100 tests.
  9000. 310.70 s [vector] mut_foldrM': OK
  9001. 310.70 s [vector] +++ OK, passed 100 tests.
  9002. 310.70 s [vector] mut_ifoldM: OK
  9003. 310.70 s [vector] +++ OK, passed 100 tests.
  9004. 310.70 s [vector] mut_ifoldM': OK
  9005. 310.70 s [vector] +++ OK, passed 100 tests.
  9006. 310.70 s [vector] mut_ifoldrM: OK
  9007. 310.70 s [vector] +++ OK, passed 100 tests.
  9008. 310.70 s [vector] mut_ifoldrM': OK
  9009. 310.70 s [vector] +++ OK, passed 100 tests.
  9010. 310.70 s [vector] compare: OK
  9011. 310.70 s [vector] +++ OK, passed 100 tests.
  9012. 310.70 s [vector] maximum: OK
  9013. 310.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9014. 310.70 s [vector] minimum: OK
  9015. 310.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9016. 310.71 s [vector] minIndex: OK
  9017. 310.71 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9018. 310.71 s [vector] maxIndex: OK
  9019. 310.71 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9020. 310.71 s [vector] maximumBy: OK
  9021. 310.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9022. 310.71 s [vector] minimumBy: OK
  9023. 310.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9024. 310.71 s [vector] maximumOn: OK
  9025. 310.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9026. 310.71 s [vector] minimumOn: OK
  9027. 310.71 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9028. 310.71 s [vector] maxIndexBy: OK
  9029. 310.71 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9030. 310.71 s [vector] minIndexBy: OK
  9031. 310.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9032. 310.71 s [vector] ListFirstMaxIndexWins: OK
  9033. 310.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9034. 310.71 s [vector] FalseListFirstMaxIndexWins: OK
  9035. 310.71 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  9036. 310.71 s [vector] []
  9037. 310.71 s [vector] mempty: OK
  9038. 310.71 s [vector] +++ OK, passed 1 test.
  9039. 310.71 s [vector] mappend: OK
  9040. 310.71 s [vector] +++ OK, passed 100 tests.
  9041. 310.73 s [vector] mconcat: OK (0.02s)
  9042. 310.73 s [vector] +++ OK, passed 100 tests.
  9043. 310.73 s [vector] glength: OK
  9044. 310.73 s [vector] +++ OK, passed 100 tests.
  9045. 310.73 s [vector] sum: OK
  9046. 310.73 s [vector] +++ OK, passed 100 tests.
  9047. 310.73 s [vector] product: OK
  9048. 310.73 s [vector] +++ OK, passed 100 tests.
  9049. 310.73 s [vector] enumFromN: OK
  9050. 310.73 s [vector] +++ OK, passed 100 tests.
  9051. 310.73 s [vector] enumFromThenN: OK
  9052. 310.73 s [vector] +++ OK, passed 100 tests.
  9053. 310.73 s [vector] enumFromTo: OK
  9054. 310.73 s [vector] +++ OK, passed 100 tests.
  9055. 310.73 s [vector] enumFromThenTo: OK
  9056. 310.73 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9057. 310.73 s [vector] Double
  9058. 310.74 s [vector] fromList.toList == id: OK
  9059. 310.74 s [vector] +++ OK, passed 100 tests.
  9060. 310.74 s [vector] toList.fromList == id: OK
  9061. 310.74 s [vector] +++ OK, passed 100 tests.
  9062. 310.74 s [vector] unstream.stream == id: OK
  9063. 310.74 s [vector] +++ OK, passed 100 tests.
  9064. 310.74 s [vector] stream.unstream == id: OK
  9065. 310.74 s [vector] +++ OK, passed 100 tests.
  9066. 310.74 s [vector] eq: OK
  9067. 310.74 s [vector] +++ OK, passed 100 tests.
  9068. 310.74 s [vector] length: OK
  9069. 310.74 s [vector] +++ OK, passed 100 tests.
  9070. 310.74 s [vector] null: OK
  9071. 310.74 s [vector] +++ OK, passed 100 tests.
  9072. 310.74 s [vector] index: OK
  9073. 310.74 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9074. 310.74 s [vector] safeIndex: OK
  9075. 310.74 s [vector] +++ OK, passed 100 tests.
  9076. 310.74 s [vector] head: OK
  9077. 310.74 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9078. 310.74 s [vector] last: OK
  9079. 310.74 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9080. 310.74 s [vector] unsafeIndex: OK
  9081. 310.74 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9082. 310.74 s [vector] unsafeHead: OK
  9083. 310.74 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9084. 310.74 s [vector] unsafeLast: OK
  9085. 310.74 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9086. 310.74 s [vector] slice: OK
  9087. 310.74 s [vector] +++ OK, passed 100 tests.
  9088. 310.75 s [vector] init: OK
  9089. 310.75 s [vector] +++ OK, passed 100 tests; 25 discarded.
  9090. 310.75 s [vector] tail: OK
  9091. 310.75 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9092. 310.75 s [vector] take: OK
  9093. 310.75 s [vector] +++ OK, passed 100 tests.
  9094. 310.75 s [vector] drop: OK
  9095. 310.75 s [vector] +++ OK, passed 100 tests.
  9096. 310.75 s [vector] splitAt: OK
  9097. 310.75 s [vector] +++ OK, passed 100 tests.
  9098. 310.75 s [vector] empty: OK
  9099. 310.75 s [vector] +++ OK, passed 1 test.
  9100. 310.75 s [vector] singleton: OK
  9101. 310.75 s [vector] +++ OK, passed 100 tests.
  9102. 310.75 s [vector] replicate: OK
  9103. 310.75 s [vector] +++ OK, passed 100 tests.
  9104. 310.75 s [vector] generate: OK
  9105. 310.75 s [vector] +++ OK, passed 100 tests.
  9106. 310.77 s [vector] iterateN: OK
  9107. 310.77 s [vector] +++ OK, passed 100 tests.
  9108. 310.79 s [vector] iterateNM: OK (0.02s)
  9109. 310.79 s [vector] +++ OK, passed 100 tests.
  9110. 310.81 s [vector] generateM: OK (0.03s)
  9111. 310.81 s [vector] +++ OK, passed 100 tests.
  9112. 310.82 s [vector] replicateM: OK (0.01s)
  9113. 310.82 s [vector] +++ OK, passed 100 tests.
  9114. 310.82 s [vector] create: OK
  9115. 310.82 s [vector] +++ OK, passed 100 tests.
  9116. 310.82 s [vector] createT: OK
  9117. 310.82 s [vector] +++ OK, passed 100 tests.
  9118. 310.82 s [vector] unfoldr: OK
  9119. 310.82 s [vector] +++ OK, passed 100 tests.
  9120. 310.83 s [vector] unfoldrN: OK
  9121. 310.83 s [vector] +++ OK, passed 100 tests.
  9122. 310.83 s [vector] unfoldrExactN: OK
  9123. 310.83 s [vector] +++ OK, passed 100 tests.
  9124. 310.83 s [vector] unfoldrM: OK
  9125. 310.83 s [vector] +++ OK, passed 100 tests.
  9126. 310.83 s [vector] unfoldrNM: OK
  9127. 310.83 s [vector] +++ OK, passed 100 tests.
  9128. 310.87 s [vector] unfoldrExactNM: OK
  9129. 310.87 s [vector] +++ OK, passed 100 tests.
  9130. 310.87 s [vector] constructN: OK (0.02s)
  9131. 310.87 s [vector] +++ OK, passed 100 tests.
  9132. 310.89 s [vector] constructrN: OK (0.02s)
  9133. 310.89 s [vector] +++ OK, passed 100 tests.
  9134. 310.89 s [vector] cons: OK
  9135. 310.89 s [vector] +++ OK, passed 100 tests.
  9136. 310.89 s [vector] snoc: OK
  9137. 310.89 s [vector] +++ OK, passed 100 tests.
  9138. 310.89 s [vector] append: OK
  9139. 310.91 s [vector] +++ OK, passed 100 tests.
  9140. 310.91 s [vector] concat: OK
  9141. 310.91 s [vector] +++ OK, passed 100 tests.
  9142. 310.92 s [vector] force: OK
  9143. 310.92 s [vector] +++ OK, passed 100 tests.
  9144. 310.92 s [vector] upd: OK
  9145. 310.93 s [vector] +++ OK, passed 100 tests.
  9146. 310.93 s [vector] accum: OK (0.02s)
  9147. 310.93 s [vector] +++ OK, passed 100 tests.
  9148. 310.93 s [vector] reverse: OK
  9149. 310.93 s [vector] +++ OK, passed 100 tests.
  9150. 310.93 s [vector] backpermute: OK
  9151. 310.95 s [vector] +++ OK, passed 100 tests.
  9152. 310.95 s [vector] map: OK
  9153. 310.95 s [vector] +++ OK, passed 100 tests.
  9154. 310.95 s [vector] imap: OK
  9155. 310.96 s [vector] +++ OK, passed 100 tests.
  9156. 310.97 s [vector] concatMap: OK
  9157. 310.97 s [vector] +++ OK, passed 100 tests.
  9158. 310.97 s [vector] mapM: OK
  9159. 310.99 s [vector] +++ OK, passed 100 tests.
  9160. 311.02 s [vector] mapM_: OK (0.04s)
  9161. 311.02 s [vector] +++ OK, passed 100 tests.
  9162. 311.03 s [vector] forM: OK
  9163. 311.03 s [vector] +++ OK, passed 100 tests.
  9164. 311.07 s [vector] forM_: OK (0.04s)
  9165. 311.07 s [vector] +++ OK, passed 100 tests.
  9166. 311.09 s [vector] imapM: OK (0.01s)
  9167. 311.09 s [vector] +++ OK, passed 100 tests.
  9168. 311.13 s [vector] imapM_: OK (0.06s)
  9169. 311.13 s [vector] +++ OK, passed 100 tests.
  9170. 311.14 s [vector] zipWith: OK (0.01s)
  9171. 311.14 s [vector] +++ OK, passed 100 tests.
  9172. 311.14 s [vector] zipWith3: OK
  9173. 311.15 s [vector] +++ OK, passed 100 tests.
  9174. 311.18 s [vector] izipWith: OK (0.02s)
  9175. 311.18 s [vector] +++ OK, passed 100 tests.
  9176. 311.18 s [vector] izipWith3: OK (0.01s)
  9177. 311.18 s [vector] +++ OK, passed 100 tests.
  9178. 311.20 s [vector] izipWithM: OK
  9179. 311.20 s [vector] +++ OK, passed 100 tests.
  9180. 311.22 s [vector] izipWithM_: OK (0.03s)
  9181. 311.22 s [vector] +++ OK, passed 100 tests.
  9182. 311.24 s [vector] zipWithM: OK (0.01s)
  9183. 311.24 s [vector] +++ OK, passed 100 tests.
  9184. 311.26 s [vector] zipWithM_: OK (0.03s)
  9185. 311.26 s [vector] +++ OK, passed 100 tests.
  9186. 311.26 s [vector] filter: OK
  9187. 311.26 s [vector] +++ OK, passed 100 tests.
  9188. 311.28 s [vector] ifilter: OK
  9189. 311.28 s [vector] +++ OK, passed 100 tests.
  9190. 311.32 s [vector] filterM: OK (0.06s)
  9191. 311.32 s [vector] +++ OK, passed 100 tests.
  9192. 311.33 s [vector] uniq: OK
  9193. 311.33 s [vector] +++ OK, passed 100 tests.
  9194. 311.33 s [vector] mapMaybe: OK
  9195. 311.33 s [vector] +++ OK, passed 100 tests.
  9196. 311.34 s [vector] imapMaybe: OK
  9197. 311.34 s [vector] +++ OK, passed 100 tests.
  9198. 311.34 s [vector] takeWhile: OK
  9199. 311.34 s [vector] +++ OK, passed 100 tests.
  9200. 311.35 s [vector] dropWhile: OK
  9201. 311.35 s [vector] +++ OK, passed 100 tests.
  9202. 311.35 s [vector] partition: OK
  9203. 311.36 s [vector] +++ OK, passed 100 tests.
  9204. 311.36 s [vector] partitionWith: OK
  9205. 311.36 s [vector] +++ OK, passed 100 tests.
  9206. 311.36 s [vector] span: OK
  9207. 311.36 s [vector] +++ OK, passed 100 tests.
  9208. 311.36 s [vector] break: OK
  9209. 311.36 s [vector] +++ OK, passed 100 tests.
  9210. 311.36 s [vector] spanR: OK
  9211. 311.36 s [vector] +++ OK, passed 100 tests.
  9212. 311.37 s [vector] breakR: OK
  9213. 311.37 s [vector] +++ OK, passed 100 tests.
  9214. 311.37 s [vector] groupBy: OK
  9215. 311.37 s [vector] +++ OK, passed 100 tests.
  9216. 311.37 s [vector] elem: OK
  9217. 311.37 s [vector] +++ OK, passed 100 tests.
  9218. 311.38 s [vector] notElem: OK
  9219. 311.38 s [vector] +++ OK, passed 100 tests.
  9220. 311.38 s [vector] find: OK
  9221. 311.38 s [vector] +++ OK, passed 100 tests.
  9222. 311.38 s [vector] findIndex: OK
  9223. 311.38 s [vector] +++ OK, passed 100 tests.
  9224. 311.39 s [vector] findIndexR: OK
  9225. 311.39 s [vector] +++ OK, passed 100 tests.
  9226. 311.39 s [vector] findIndices: OK
  9227. 311.39 s [vector] +++ OK, passed 100 tests.
  9228. 311.39 s [vector] elemIndex: OK
  9229. 311.39 s [vector] +++ OK, passed 100 tests.
  9230. 311.39 s [vector] elemIndices: OK
  9231. 311.40 s [vector] +++ OK, passed 100 tests.
  9232. 311.42 s [vector] foldl: OK (0.01s)
  9233. 311.42 s [vector] +++ OK, passed 100 tests.
  9234. 311.42 s [vector] foldl1: OK (0.01s)
  9235. 311.42 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9236. 311.44 s [vector] foldl': OK (0.01s)
  9237. 311.44 s [vector] +++ OK, passed 100 tests.
  9238. 311.45 s [vector] foldl1': OK (0.01s)
  9239. 311.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9240. 311.46 s [vector] foldr: OK (0.01s)
  9241. 311.46 s [vector] +++ OK, passed 100 tests.
  9242. 311.47 s [vector] foldr1: OK (0.01s)
  9243. 311.47 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9244. 311.48 s [vector] foldr': OK
  9245. 311.49 s [vector] +++ OK, passed 100 tests.
  9246. 311.50 s [vector] foldr1': OK (0.01s)
  9247. 311.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9248. 311.52 s [vector] ifoldl: OK (0.01s)
  9249. 311.52 s [vector] +++ OK, passed 100 tests.
  9250. 311.54 s [vector] ifoldl': OK (0.01s)
  9251. 311.54 s [vector] +++ OK, passed 100 tests.
  9252. 311.55 s [vector] ifoldr: OK (0.01s)
  9253. 311.55 s [vector] +++ OK, passed 100 tests.
  9254. 311.56 s [vector] ifoldr': OK (0.01s)
  9255. 311.56 s [vector] +++ OK, passed 100 tests.
  9256. 311.58 s [vector] ifoldM: OK (0.01s)
  9257. 311.58 s [vector] +++ OK, passed 100 tests.
  9258. 311.58 s [vector] ifoldM': OK (0.02s)
  9259. 311.58 s [vector] +++ OK, passed 100 tests.
  9260. 311.62 s [vector] ifoldM_: OK (0.04s)
  9261. 311.62 s [vector] +++ OK, passed 100 tests.
  9262. 311.65 s [vector] ifoldM'_: OK (0.03s)
  9263. 311.65 s [vector] +++ OK, passed 100 tests.
  9264. 311.65 s [vector] all: OK
  9265. 311.65 s [vector] +++ OK, passed 100 tests.
  9266. 311.66 s [vector] any: OK
  9267. 311.66 s [vector] +++ OK, passed 100 tests.
  9268. 311.68 s [vector] prescanl: OK (0.01s)
  9269. 311.68 s [vector] +++ OK, passed 100 tests.
  9270. 311.69 s [vector] prescanl': OK (0.02s)
  9271. 311.69 s [vector] +++ OK, passed 100 tests.
  9272. 311.70 s [vector] postscanl: OK (0.01s)
  9273. 311.70 s [vector] +++ OK, passed 100 tests.
  9274. 311.72 s [vector] postscanl': OK (0.02s)
  9275. 311.72 s [vector] +++ OK, passed 100 tests.
  9276. 311.74 s [vector] scanl: OK (0.02s)
  9277. 311.74 s [vector] +++ OK, passed 100 tests.
  9278. 311.76 s [vector] scanl': OK (0.02s)
  9279. 311.76 s [vector] +++ OK, passed 100 tests.
  9280. 311.78 s [vector] scanl1: OK (0.02s)
  9281. 311.78 s [vector] +++ OK, passed 100 tests.
  9282. 311.78 s [vector] scanl1': OK (0.02s)
  9283. 311.78 s [vector] +++ OK, passed 100 tests.
  9284. 311.80 s [vector] iscanl: OK (0.01s)
  9285. 311.80 s [vector] +++ OK, passed 100 tests.
  9286. 311.82 s [vector] iscanl': OK (0.02s)
  9287. 311.82 s [vector] +++ OK, passed 100 tests.
  9288. 311.84 s [vector] prescanr: OK (0.02s)
  9289. 311.84 s [vector] +++ OK, passed 100 tests.
  9290. 311.84 s [vector] prescanr': OK (0.01s)
  9291. 311.84 s [vector] +++ OK, passed 100 tests.
  9292. 311.86 s [vector] postscanr: OK (0.01s)
  9293. 311.86 s [vector] +++ OK, passed 100 tests.
  9294. 311.88 s [vector] postscanr': OK (0.02s)
  9295. 311.88 s [vector] +++ OK, passed 100 tests.
  9296. 311.89 s [vector] scanr: OK (0.01s)
  9297. 311.89 s [vector] +++ OK, passed 100 tests.
  9298. 311.90 s [vector] scanr': OK (0.01s)
  9299. 311.90 s [vector] +++ OK, passed 100 tests.
  9300. 311.91 s [vector] scanr1: OK (0.02s)
  9301. 311.91 s [vector] +++ OK, passed 100 tests.
  9302. 311.94 s [vector] scanr1': OK (0.01s)
  9303. 311.94 s [vector] +++ OK, passed 100 tests.
  9304. 311.95 s [vector] iscanr: OK (0.02s)
  9305. 311.95 s [vector] +++ OK, passed 100 tests.
  9306. 311.95 s [vector] iscanr': OK (0.01s)
  9307. 311.95 s [vector] +++ OK, passed 100 tests.
  9308. 311.95 s [vector] mut_read: OK
  9309. 311.95 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9310. 311.95 s [vector] mut_write: OK
  9311. 311.96 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9312. 311.96 s [vector] mut_modify: OK
  9313. 311.96 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9314. 311.98 s [vector] mut_generate: OK
  9315. 311.98 s [vector] +++ OK, passed 100 tests.
  9316. 311.98 s [vector] mut_generateM: OK (0.02s)
  9317. 311.98 s [vector] +++ OK, passed 100 tests.
  9318. 312.04 s [vector] mut_mapM_: OK (0.04s)
  9319. 312.04 s [vector] +++ OK, passed 100 tests.
  9320. 312.06 s [vector] mut_imapM_: OK (0.04s)
  9321. 312.06 s [vector] +++ OK, passed 100 tests.
  9322. 312.10 s [vector] mut_forM_: OK (0.04s)
  9323. 312.10 s [vector] +++ OK, passed 100 tests.
  9324. 312.13 s [vector] mut_iforM_: OK (0.03s)
  9325. 312.13 s [vector] +++ OK, passed 100 tests.
  9326. 312.14 s [vector] mut_foldr: OK (0.01s)
  9327. 312.14 s [vector] +++ OK, passed 100 tests.
  9328. 312.16 s [vector] mut_foldr': OK (0.01s)
  9329. 312.16 s [vector] +++ OK, passed 100 tests.
  9330. 312.18 s [vector] mut_foldl: OK (0.01s)
  9331. 312.18 s [vector] +++ OK, passed 100 tests.
  9332. 312.18 s [vector] mut_foldl': OK (0.01s)
  9333. 312.18 s [vector] +++ OK, passed 100 tests.
  9334. 312.20 s [vector] mut_ifoldr: OK (0.01s)
  9335. 312.20 s [vector] +++ OK, passed 100 tests.
  9336. 312.22 s [vector] mut_ifoldr': OK (0.01s)
  9337. 312.22 s [vector] +++ OK, passed 100 tests.
  9338. 312.22 s [vector] mut_ifoldl: OK (0.01s)
  9339. 312.22 s [vector] +++ OK, passed 100 tests.
  9340. 312.24 s [vector] mut_ifoldl': OK (0.01s)
  9341. 312.24 s [vector] +++ OK, passed 100 tests.
  9342. 312.25 s [vector] mut_foldM: OK (0.01s)
  9343. 312.25 s [vector] +++ OK, passed 100 tests.
  9344. 312.26 s [vector] mut_foldM': OK (0.01s)
  9345. 312.26 s [vector] +++ OK, passed 100 tests.
  9346. 312.27 s [vector] mut_foldrM: OK (0.01s)
  9347. 312.27 s [vector] +++ OK, passed 100 tests.
  9348. 312.28 s [vector] mut_foldrM': OK (0.01s)
  9349. 312.28 s [vector] +++ OK, passed 100 tests.
  9350. 312.30 s [vector] mut_ifoldM: OK (0.01s)
  9351. 312.30 s [vector] +++ OK, passed 100 tests.
  9352. 312.31 s [vector] mut_ifoldM': OK (0.01s)
  9353. 312.31 s [vector] +++ OK, passed 100 tests.
  9354. 312.32 s [vector] mut_ifoldrM: OK (0.01s)
  9355. 312.32 s [vector] +++ OK, passed 100 tests.
  9356. 312.33 s [vector] mut_ifoldrM': OK (0.01s)
  9357. 312.33 s [vector] +++ OK, passed 100 tests.
  9358. 312.33 s [vector] compare: OK
  9359. 312.33 s [vector] +++ OK, passed 100 tests.
  9360. 312.33 s [vector] maximum: OK
  9361. 312.33 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9362. 312.33 s [vector] minimum: OK
  9363. 312.33 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9364. 312.33 s [vector] minIndex: OK
  9365. 312.33 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9366. 312.33 s [vector] maxIndex: OK
  9367. 312.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9368. 312.33 s [vector] maximumBy: OK
  9369. 312.33 s [vector] +++ OK, passed 100 tests; 10 discarded.
  9370. 312.33 s [vector] minimumBy: OK
  9371. 312.33 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9372. 312.33 s [vector] maximumOn: OK
  9373. 312.33 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9374. 312.33 s [vector] minimumOn: OK
  9375. 312.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9376. 312.33 s [vector] maxIndexBy: OK
  9377. 312.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9378. 312.33 s [vector] minIndexBy: OK
  9379. 312.33 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9380. 312.33 s [vector] ListFirstMaxIndexWins: OK
  9381. 312.33 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9382. 312.33 s [vector] FalseListFirstMaxIndexWins: OK
  9383. 312.33 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  9384. 312.33 s [vector] []
  9385. 312.34 s [vector] mempty: OK
  9386. 312.34 s [vector] +++ OK, passed 1 test.
  9387. 312.34 s [vector] mappend: OK
  9388. 312.34 s [vector] +++ OK, passed 100 tests.
  9389. 312.37 s [vector] mconcat: OK (0.02s)
  9390. 312.37 s [vector] +++ OK, passed 100 tests.
  9391. 312.37 s [vector] glength: OK
  9392. 312.37 s [vector] +++ OK, passed 100 tests.
  9393. 312.37 s [vector] sum: OK
  9394. 312.37 s [vector] +++ OK, passed 100 tests.
  9395. 312.37 s [vector] product: OK
  9396. 312.37 s [vector] +++ OK, passed 100 tests.
  9397. 312.37 s [vector] enumFromN: OK
  9398. 312.37 s [vector] +++ OK, passed 100 tests.
  9399. 312.37 s [vector] enumFromThenN: OK
  9400. 312.37 s [vector] +++ OK, passed 100 tests.
  9401. 312.37 s [vector] enumFromTo: OK
  9402. 312.37 s [vector] +++ OK, passed 100 tests.
  9403. 312.37 s [vector] enumFromThenTo: OK
  9404. 312.37 s [vector] +++ OK, passed 100 tests; 3 discarded.
  9405. 312.37 s [vector] unstream
  9406. 312.37 s [vector] unstream == vunstream (exact): OK
  9407. 312.37 s [vector] +++ OK, passed 100 tests.
  9408. 312.37 s [vector] unstream == vunstream (unknown): OK
  9409. 312.37 s [vector] +++ OK, passed 100 tests.
  9410. 312.37 s [vector] unstreamR ~= vunstream (exact): OK
  9411. 312.37 s [vector] +++ OK, passed 100 tests.
  9412. 312.37 s [vector] unstreamR ~= vunstream (unknown): OK
  9413. 312.37 s [vector] +++ OK, passed 100 tests.
  9414. 312.37 s [vector] Tests.Vector.Storable
  9415. 312.37 s [vector] Data.Vector.Storable.Vector (Int)
  9416. 312.37 s [vector] fromList.toList == id: OK
  9417. 312.37 s [vector] +++ OK, passed 100 tests.
  9418. 312.37 s [vector] toList.fromList == id: OK
  9419. 312.37 s [vector] +++ OK, passed 100 tests.
  9420. 312.37 s [vector] unstream.stream == id: OK
  9421. 312.37 s [vector] +++ OK, passed 100 tests.
  9422. 312.37 s [vector] stream.unstream == id: OK
  9423. 312.38 s [vector] +++ OK, passed 100 tests.
  9424. 312.38 s [vector] eq: OK
  9425. 312.38 s [vector] +++ OK, passed 100 tests.
  9426. 312.38 s [vector] length: OK
  9427. 312.38 s [vector] +++ OK, passed 100 tests.
  9428. 312.38 s [vector] null: OK
  9429. 312.38 s [vector] +++ OK, passed 100 tests.
  9430. 312.38 s [vector] index: OK
  9431. 312.38 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9432. 312.38 s [vector] safeIndex: OK
  9433. 312.38 s [vector] +++ OK, passed 100 tests.
  9434. 312.38 s [vector] head: OK
  9435. 312.38 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9436. 312.38 s [vector] last: OK
  9437. 312.38 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9438. 312.38 s [vector] unsafeIndex: OK
  9439. 312.38 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9440. 312.38 s [vector] unsafeHead: OK
  9441. 312.38 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9442. 312.38 s [vector] unsafeLast: OK
  9443. 312.38 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9444. 312.38 s [vector] slice: OK
  9445. 312.38 s [vector] +++ OK, passed 100 tests.
  9446. 312.38 s [vector] init: OK
  9447. 312.38 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9448. 312.38 s [vector] tail: OK
  9449. 312.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9450. 312.38 s [vector] take: OK
  9451. 312.38 s [vector] +++ OK, passed 100 tests.
  9452. 312.38 s [vector] drop: OK
  9453. 312.39 s [vector] +++ OK, passed 100 tests.
  9454. 312.39 s [vector] splitAt: OK
  9455. 312.39 s [vector] +++ OK, passed 100 tests.
  9456. 312.39 s [vector] empty: OK
  9457. 312.39 s [vector] +++ OK, passed 1 test.
  9458. 312.39 s [vector] singleton: OK
  9459. 312.39 s [vector] +++ OK, passed 100 tests.
  9460. 312.39 s [vector] replicate: OK
  9461. 312.39 s [vector] +++ OK, passed 100 tests.
  9462. 312.39 s [vector] generate: OK
  9463. 312.39 s [vector] +++ OK, passed 100 tests.
  9464. 312.39 s [vector] iterateN: OK
  9465. 312.39 s [vector] +++ OK, passed 100 tests.
  9466. 312.42 s [vector] iterateNM: OK (0.02s)
  9467. 312.42 s [vector] +++ OK, passed 100 tests.
  9468. 312.44 s [vector] generateM: OK (0.03s)
  9469. 312.44 s [vector] +++ OK, passed 100 tests.
  9470. 312.45 s [vector] replicateM: OK (0.01s)
  9471. 312.45 s [vector] +++ OK, passed 100 tests.
  9472. 312.45 s [vector] create: OK
  9473. 312.45 s [vector] +++ OK, passed 100 tests.
  9474. 312.45 s [vector] createT: OK
  9475. 312.45 s [vector] +++ OK, passed 100 tests.
  9476. 312.45 s [vector] unfoldr: OK
  9477. 312.45 s [vector] +++ OK, passed 100 tests.
  9478. 312.45 s [vector] unfoldrN: OK
  9479. 312.45 s [vector] +++ OK, passed 100 tests.
  9480. 312.45 s [vector] unfoldrExactN: OK
  9481. 312.45 s [vector] +++ OK, passed 100 tests.
  9482. 312.45 s [vector] unfoldrM: OK
  9483. 312.45 s [vector] +++ OK, passed 100 tests.
  9484. 312.45 s [vector] unfoldrNM: OK
  9485. 312.46 s [vector] +++ OK, passed 100 tests.
  9486. 312.47 s [vector] unfoldrExactNM: OK (0.01s)
  9487. 312.47 s [vector] +++ OK, passed 100 tests.
  9488. 312.47 s [vector] constructN: OK
  9489. 312.47 s [vector] +++ OK, passed 100 tests.
  9490. 312.47 s [vector] constructrN: OK
  9491. 312.47 s [vector] +++ OK, passed 100 tests.
  9492. 312.47 s [vector] cons: OK
  9493. 312.47 s [vector] +++ OK, passed 100 tests.
  9494. 312.47 s [vector] snoc: OK
  9495. 312.47 s [vector] +++ OK, passed 100 tests.
  9496. 312.48 s [vector] append: OK
  9497. 312.48 s [vector] +++ OK, passed 100 tests.
  9498. 312.50 s [vector] concat: OK (0.02s)
  9499. 312.50 s [vector] +++ OK, passed 100 tests.
  9500. 312.50 s [vector] force: OK
  9501. 312.50 s [vector] +++ OK, passed 100 tests.
  9502. 312.50 s [vector] upd: OK
  9503. 312.50 s [vector] +++ OK, passed 100 tests.
  9504. 312.50 s [vector] accum: OK
  9505. 312.50 s [vector] +++ OK, passed 100 tests.
  9506. 312.50 s [vector] reverse: OK
  9507. 312.50 s [vector] +++ OK, passed 100 tests.
  9508. 312.50 s [vector] backpermute: OK
  9509. 312.50 s [vector] +++ OK, passed 100 tests.
  9510. 312.50 s [vector] map: OK
  9511. 312.51 s [vector] +++ OK, passed 100 tests.
  9512. 312.51 s [vector] imap: OK
  9513. 312.51 s [vector] +++ OK, passed 100 tests.
  9514. 312.51 s [vector] concatMap: OK
  9515. 312.51 s [vector] +++ OK, passed 100 tests.
  9516. 312.52 s [vector] mapM: OK
  9517. 312.52 s [vector] +++ OK, passed 100 tests.
  9518. 312.53 s [vector] mapM_: OK (0.02s)
  9519. 312.53 s [vector] +++ OK, passed 100 tests.
  9520. 312.54 s [vector] forM: OK
  9521. 312.54 s [vector] +++ OK, passed 100 tests.
  9522. 312.55 s [vector] forM_: OK (0.02s)
  9523. 312.55 s [vector] +++ OK, passed 100 tests.
  9524. 312.55 s [vector] imapM: OK
  9525. 312.56 s [vector] +++ OK, passed 100 tests.
  9526. 312.57 s [vector] imapM_: OK (0.01s)
  9527. 312.57 s [vector] +++ OK, passed 100 tests.
  9528. 312.57 s [vector] zipWith: OK
  9529. 312.57 s [vector] +++ OK, passed 100 tests.
  9530. 312.57 s [vector] zipWith3: OK
  9531. 312.57 s [vector] +++ OK, passed 100 tests.
  9532. 312.57 s [vector] izipWith: OK
  9533. 312.58 s [vector] +++ OK, passed 100 tests.
  9534. 312.58 s [vector] izipWith3: OK
  9535. 312.58 s [vector] +++ OK, passed 100 tests.
  9536. 312.59 s [vector] izipWithM: OK
  9537. 312.59 s [vector] +++ OK, passed 100 tests.
  9538. 312.59 s [vector] izipWithM_: OK (0.01s)
  9539. 312.59 s [vector] +++ OK, passed 100 tests.
  9540. 312.60 s [vector] zipWithM: OK
  9541. 312.60 s [vector] +++ OK, passed 100 tests.
  9542. 312.60 s [vector] zipWithM_: OK (0.01s)
  9543. 312.60 s [vector] +++ OK, passed 100 tests.
  9544. 312.61 s [vector] filter: OK
  9545. 312.61 s [vector] +++ OK, passed 100 tests.
  9546. 312.62 s [vector] ifilter: OK
  9547. 312.62 s [vector] +++ OK, passed 100 tests.
  9548. 312.63 s [vector] filterM: OK (0.02s)
  9549. 312.63 s [vector] +++ OK, passed 100 tests.
  9550. 312.63 s [vector] uniq: OK
  9551. 312.63 s [vector] +++ OK, passed 100 tests.
  9552. 312.63 s [vector] mapMaybe: OK
  9553. 312.63 s [vector] +++ OK, passed 100 tests.
  9554. 312.64 s [vector] imapMaybe: OK
  9555. 312.64 s [vector] +++ OK, passed 100 tests.
  9556. 312.64 s [vector] takeWhile: OK
  9557. 312.64 s [vector] +++ OK, passed 100 tests.
  9558. 312.64 s [vector] dropWhile: OK
  9559. 312.64 s [vector] +++ OK, passed 100 tests.
  9560. 312.64 s [vector] partition: OK
  9561. 312.64 s [vector] +++ OK, passed 100 tests.
  9562. 312.64 s [vector] partitionWith: OK
  9563. 312.64 s [vector] +++ OK, passed 100 tests.
  9564. 312.64 s [vector] span: OK
  9565. 312.64 s [vector] +++ OK, passed 100 tests.
  9566. 312.64 s [vector] break: OK
  9567. 312.64 s [vector] +++ OK, passed 100 tests.
  9568. 312.64 s [vector] spanR: OK
  9569. 312.64 s [vector] +++ OK, passed 100 tests.
  9570. 312.65 s [vector] breakR: OK
  9571. 312.65 s [vector] +++ OK, passed 100 tests.
  9572. 312.65 s [vector] groupBy: OK
  9573. 312.65 s [vector] +++ OK, passed 100 tests.
  9574. 312.65 s [vector] elem: OK
  9575. 312.65 s [vector] +++ OK, passed 100 tests.
  9576. 312.65 s [vector] notElem: OK
  9577. 312.65 s [vector] +++ OK, passed 100 tests.
  9578. 312.65 s [vector] find: OK
  9579. 312.65 s [vector] +++ OK, passed 100 tests.
  9580. 312.65 s [vector] findIndex: OK
  9581. 312.65 s [vector] +++ OK, passed 100 tests.
  9582. 312.65 s [vector] findIndexR: OK
  9583. 312.65 s [vector] +++ OK, passed 100 tests.
  9584. 312.65 s [vector] findIndices: OK
  9585. 312.65 s [vector] +++ OK, passed 100 tests.
  9586. 312.65 s [vector] elemIndex: OK
  9587. 312.65 s [vector] +++ OK, passed 100 tests.
  9588. 312.65 s [vector] elemIndices: OK
  9589. 312.65 s [vector] +++ OK, passed 100 tests.
  9590. 312.65 s [vector] foldl: OK
  9591. 312.66 s [vector] +++ OK, passed 100 tests.
  9592. 312.66 s [vector] foldl1: OK
  9593. 312.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9594. 312.66 s [vector] foldl': OK
  9595. 312.66 s [vector] +++ OK, passed 100 tests.
  9596. 312.66 s [vector] foldl1': OK
  9597. 312.66 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9598. 312.66 s [vector] foldr: OK
  9599. 312.67 s [vector] +++ OK, passed 100 tests.
  9600. 312.67 s [vector] foldr1: OK
  9601. 312.67 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9602. 312.67 s [vector] foldr': OK
  9603. 312.67 s [vector] +++ OK, passed 100 tests.
  9604. 312.68 s [vector] foldr1': OK
  9605. 312.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9606. 312.68 s [vector] ifoldl: OK
  9607. 312.68 s [vector] +++ OK, passed 100 tests.
  9608. 312.68 s [vector] ifoldl': OK
  9609. 312.68 s [vector] +++ OK, passed 100 tests.
  9610. 312.69 s [vector] ifoldr: OK
  9611. 312.69 s [vector] +++ OK, passed 100 tests.
  9612. 312.69 s [vector] ifoldr': OK
  9613. 312.69 s [vector] +++ OK, passed 100 tests.
  9614. 312.69 s [vector] ifoldM: OK
  9615. 312.69 s [vector] +++ OK, passed 100 tests.
  9616. 312.70 s [vector] ifoldM': OK
  9617. 312.70 s [vector] +++ OK, passed 100 tests.
  9618. 312.72 s [vector] ifoldM_: OK (0.02s)
  9619. 312.72 s [vector] +++ OK, passed 100 tests.
  9620. 312.73 s [vector] ifoldM'_: OK (0.02s)
  9621. 312.73 s [vector] +++ OK, passed 100 tests.
  9622. 312.73 s [vector] all: OK
  9623. 312.73 s [vector] +++ OK, passed 100 tests.
  9624. 312.73 s [vector] any: OK
  9625. 312.73 s [vector] +++ OK, passed 100 tests.
  9626. 312.73 s [vector] prescanl: OK
  9627. 312.73 s [vector] +++ OK, passed 100 tests.
  9628. 312.74 s [vector] prescanl': OK
  9629. 312.74 s [vector] +++ OK, passed 100 tests.
  9630. 312.74 s [vector] postscanl: OK
  9631. 312.74 s [vector] +++ OK, passed 100 tests.
  9632. 312.74 s [vector] postscanl': OK
  9633. 312.74 s [vector] +++ OK, passed 100 tests.
  9634. 312.75 s [vector] scanl: OK
  9635. 312.75 s [vector] +++ OK, passed 100 tests.
  9636. 312.75 s [vector] scanl': OK
  9637. 312.75 s [vector] +++ OK, passed 100 tests.
  9638. 312.75 s [vector] scanl1: OK
  9639. 312.75 s [vector] +++ OK, passed 100 tests.
  9640. 312.75 s [vector] scanl1': OK
  9641. 312.75 s [vector] +++ OK, passed 100 tests.
  9642. 312.75 s [vector] iscanl: OK
  9643. 312.76 s [vector] +++ OK, passed 100 tests.
  9644. 312.76 s [vector] iscanl': OK
  9645. 312.76 s [vector] +++ OK, passed 100 tests.
  9646. 312.76 s [vector] prescanr: OK
  9647. 312.76 s [vector] +++ OK, passed 100 tests.
  9648. 312.77 s [vector] prescanr': OK
  9649. 312.77 s [vector] +++ OK, passed 100 tests.
  9650. 312.77 s [vector] postscanr: OK
  9651. 312.77 s [vector] +++ OK, passed 100 tests.
  9652. 312.77 s [vector] postscanr': OK
  9653. 312.77 s [vector] +++ OK, passed 100 tests.
  9654. 312.77 s [vector] scanr: OK
  9655. 312.77 s [vector] +++ OK, passed 100 tests.
  9656. 312.78 s [vector] scanr': OK
  9657. 312.78 s [vector] +++ OK, passed 100 tests.
  9658. 312.78 s [vector] scanr1: OK
  9659. 312.78 s [vector] +++ OK, passed 100 tests.
  9660. 313.22 s [vector] scanr1': OK
  9661. 313.22 s [vector] +++ OK, passed 100 tests.
  9662. 313.22 s [vector] iscanr: OK
  9663. 313.22 s [vector] +++ OK, passed 100 tests.
  9664. 313.22 s [vector] iscanr': OK
  9665. 313.22 s [vector] +++ OK, passed 100 tests.
  9666. 313.22 s [vector] mut_read: OK
  9667. 313.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9668. 313.22 s [vector] mut_write: OK
  9669. 313.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9670. 313.22 s [vector] mut_modify: OK
  9671. 313.22 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9672. 313.22 s [vector] mut_generate: OK
  9673. 313.22 s [vector] +++ OK, passed 100 tests.
  9674. 313.22 s [vector] mut_generateM: OK (0.01s)
  9675. 313.22 s [vector] +++ OK, passed 100 tests.
  9676. 313.22 s [vector] mut_mapM_: OK (0.02s)
  9677. 313.22 s [vector] +++ OK, passed 100 tests.
  9678. 313.22 s [vector] mut_imapM_: OK (0.02s)
  9679. 313.22 s [vector] +++ OK, passed 100 tests.
  9680. 313.22 s [vector] mut_forM_: OK (0.02s)
  9681. 313.22 s [vector] +++ OK, passed 100 tests.
  9682. 313.22 s [vector] mut_iforM_: OK (0.02s)
  9683. 313.22 s [vector] +++ OK, passed 100 tests.
  9684. 313.22 s [vector] mut_foldr: OK
  9685. 313.22 s [vector] +++ OK, passed 100 tests.
  9686. 313.22 s [vector] mut_foldr': OK
  9687. 313.22 s [vector] +++ OK, passed 100 tests.
  9688. 313.22 s [vector] mut_foldl: OK
  9689. 313.22 s [vector] +++ OK, passed 100 tests.
  9690. 313.22 s [vector] mut_foldl': OK
  9691. 313.22 s [vector] +++ OK, passed 100 tests.
  9692. 313.22 s [vector] mut_ifoldr: OK
  9693. 313.22 s [vector] +++ OK, passed 100 tests.
  9694. 313.22 s [vector] mut_ifoldr': OK
  9695. 313.22 s [vector] +++ OK, passed 100 tests.
  9696. 313.22 s [vector] mut_ifoldl: OK
  9697. 313.22 s [vector] +++ OK, passed 100 tests.
  9698. 313.22 s [vector] mut_ifoldl': OK
  9699. 313.22 s [vector] +++ OK, passed 100 tests.
  9700. 313.22 s [vector] mut_foldM: OK
  9701. 313.22 s [vector] +++ OK, passed 100 tests.
  9702. 313.22 s [vector] mut_foldM': OK
  9703. 313.22 s [vector] +++ OK, passed 100 tests.
  9704. 313.22 s [vector] mut_foldrM: OK
  9705. 313.22 s [vector] +++ OK, passed 100 tests.
  9706. 313.22 s [vector] mut_foldrM': OK
  9707. 313.22 s [vector] +++ OK, passed 100 tests.
  9708. 313.22 s [vector] mut_ifoldM: OK
  9709. 313.22 s [vector] +++ OK, passed 100 tests.
  9710. 313.22 s [vector] mut_ifoldM': OK
  9711. 313.22 s [vector] +++ OK, passed 100 tests.
  9712. 313.22 s [vector] mut_ifoldrM: OK
  9713. 313.22 s [vector] +++ OK, passed 100 tests.
  9714. 313.22 s [vector] mut_ifoldrM': OK
  9715. 313.22 s [vector] +++ OK, passed 100 tests.
  9716. 313.22 s [vector] compare: OK
  9717. 313.22 s [vector] +++ OK, passed 100 tests.
  9718. 313.22 s [vector] maximum: OK
  9719. 313.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9720. 313.22 s [vector] minimum: OK
  9721. 313.22 s [vector] +++ OK, passed 100 tests; 24 discarded.
  9722. 313.22 s [vector] minIndex: OK
  9723. 313.22 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9724. 313.22 s [vector] maxIndex: OK
  9725. 313.22 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9726. 313.22 s [vector] maximumBy: OK
  9727. 313.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9728. 313.22 s [vector] minimumBy: OK
  9729. 313.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9730. 313.22 s [vector] maximumOn: OK
  9731. 313.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9732. 313.22 s [vector] minimumOn: OK
  9733. 313.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9734. 313.22 s [vector] maxIndexBy: OK
  9735. 313.22 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9736. 313.22 s [vector] minIndexBy: OK
  9737. 313.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9738. 313.22 s [vector] ListFirstMaxIndexWins: OK
  9739. 313.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9740. 313.22 s [vector] FalseListFirstMaxIndexWins: OK
  9741. 313.22 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  9742. 313.22 s [vector] []
  9743. 313.22 s [vector] mempty: OK
  9744. 313.22 s [vector] +++ OK, passed 1 test.
  9745. 313.22 s [vector] mappend: OK
  9746. 313.22 s [vector] +++ OK, passed 100 tests.
  9747. 313.22 s [vector] mconcat: OK (0.02s)
  9748. 313.22 s [vector] +++ OK, passed 100 tests.
  9749. 313.22 s [vector] glength: OK
  9750. 313.22 s [vector] +++ OK, passed 100 tests.
  9751. 313.22 s [vector] sum: OK
  9752. 313.22 s [vector] +++ OK, passed 100 tests.
  9753. 313.22 s [vector] product: OK
  9754. 313.22 s [vector] +++ OK, passed 100 tests.
  9755. 313.22 s [vector] enumFromN: OK
  9756. 313.22 s [vector] +++ OK, passed 100 tests.
  9757. 313.22 s [vector] enumFromThenN: OK
  9758. 313.22 s [vector] +++ OK, passed 100 tests.
  9759. 313.22 s [vector] enumFromTo: OK
  9760. 313.22 s [vector] +++ OK, passed 100 tests.
  9761. 313.22 s [vector] enumFromThenTo: OK
  9762. 313.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9763. 313.22 s [vector] Data.Vector.Storable.Vector (Double)
  9764. 313.22 s [vector] fromList.toList == id: OK
  9765. 313.22 s [vector] +++ OK, passed 100 tests.
  9766. 313.22 s [vector] toList.fromList == id: OK
  9767. 313.22 s [vector] +++ OK, passed 100 tests.
  9768. 313.22 s [vector] unstream.stream == id: OK
  9769. 313.22 s [vector] +++ OK, passed 100 tests.
  9770. 313.22 s [vector] stream.unstream == id: OK
  9771. 313.22 s [vector] +++ OK, passed 100 tests.
  9772. 313.22 s [vector] eq: OK
  9773. 313.22 s [vector] +++ OK, passed 100 tests.
  9774. 313.22 s [vector] length: OK
  9775. 313.22 s [vector] +++ OK, passed 100 tests.
  9776. 313.22 s [vector] null: OK
  9777. 313.22 s [vector] +++ OK, passed 100 tests.
  9778. 313.22 s [vector] index: OK
  9779. 313.22 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9780. 313.22 s [vector] safeIndex: OK
  9781. 313.22 s [vector] +++ OK, passed 100 tests.
  9782. 313.22 s [vector] head: OK
  9783. 313.22 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9784. 313.22 s [vector] last: OK
  9785. 313.22 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9786. 313.22 s [vector] unsafeIndex: OK
  9787. 313.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9788. 313.22 s [vector] unsafeHead: OK
  9789. 313.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9790. 313.22 s [vector] unsafeLast: OK
  9791. 313.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9792. 313.22 s [vector] slice: OK
  9793. 313.22 s [vector] +++ OK, passed 100 tests.
  9794. 313.22 s [vector] init: OK
  9795. 313.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9796. 313.22 s [vector] tail: OK
  9797. 313.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9798. 313.22 s [vector] take: OK
  9799. 313.22 s [vector] +++ OK, passed 100 tests.
  9800. 313.22 s [vector] drop: OK
  9801. 313.22 s [vector] +++ OK, passed 100 tests.
  9802. 313.22 s [vector] splitAt: OK
  9803. 313.22 s [vector] +++ OK, passed 100 tests.
  9804. 313.22 s [vector] empty: OK
  9805. 313.22 s [vector] +++ OK, passed 1 test.
  9806. 313.22 s [vector] singleton: OK
  9807. 313.22 s [vector] +++ OK, passed 100 tests.
  9808. 313.22 s [vector] replicate: OK
  9809. 313.22 s [vector] +++ OK, passed 100 tests.
  9810. 313.22 s [vector] generate: OK
  9811. 313.22 s [vector] +++ OK, passed 100 tests.
  9812. 313.22 s [vector] iterateN: OK
  9813. 313.22 s [vector] +++ OK, passed 100 tests.
  9814. 313.22 s [vector] iterateNM: OK (0.02s)
  9815. 313.22 s [vector] +++ OK, passed 100 tests.
  9816. 313.22 s [vector] generateM: OK (0.04s)
  9817. 313.22 s [vector] +++ OK, passed 100 tests.
  9818. 313.22 s [vector] replicateM: OK (0.02s)
  9819. 313.22 s [vector] +++ OK, passed 100 tests.
  9820. 313.22 s [vector] create: OK
  9821. 313.22 s [vector] +++ OK, passed 100 tests.
  9822. 313.22 s [vector] createT: OK
  9823. 313.22 s [vector] +++ OK, passed 100 tests.
  9824. 313.22 s [vector] unfoldr: OK
  9825. 313.22 s [vector] +++ OK, passed 100 tests.
  9826. 313.22 s [vector] unfoldrN: OK
  9827. 313.22 s [vector] +++ OK, passed 100 tests.
  9828. 313.22 s [vector] unfoldrExactN: OK
  9829. 313.22 s [vector] +++ OK, passed 100 tests.
  9830. 313.22 s [vector] unfoldrM: OK
  9831. 313.22 s [vector] +++ OK, passed 100 tests.
  9832. 313.22 s [vector] unfoldrNM: OK
  9833. 313.22 s [vector] +++ OK, passed 100 tests.
  9834. 313.22 s [vector] unfoldrExactNM: OK (0.01s)
  9835. 313.22 s [vector] +++ OK, passed 100 tests.
  9836. 313.22 s [vector] constructN: OK (0.01s)
  9837. 313.22 s [vector] +++ OK, passed 100 tests.
  9838. 313.22 s [vector] constructrN: OK (0.02s)
  9839. 313.22 s [vector] +++ OK, passed 100 tests.
  9840. 313.22 s [vector] cons: OK
  9841. 313.22 s [vector] +++ OK, passed 100 tests.
  9842. 313.22 s [vector] snoc: OK
  9843. 313.22 s [vector] +++ OK, passed 100 tests.
  9844. 313.22 s [vector] append: OK
  9845. 313.22 s [vector] +++ OK, passed 100 tests.
  9846. 313.22 s [vector] concat: OK (0.02s)
  9847. 313.22 s [vector] +++ OK, passed 100 tests.
  9848. 313.22 s [vector] force: OK
  9849. 313.22 s [vector] +++ OK, passed 100 tests.
  9850. 313.22 s [vector] upd: OK
  9851. 313.22 s [vector] +++ OK, passed 100 tests.
  9852. 313.22 s [vector] accum: OK (0.01s)
  9853. 313.22 s [vector] +++ OK, passed 100 tests.
  9854. 313.22 s [vector] reverse: OK
  9855. 313.22 s [vector] +++ OK, passed 100 tests.
  9856. 313.22 s [vector] backpermute: OK
  9857. 313.22 s [vector] +++ OK, passed 100 tests.
  9858. 313.22 s [vector] map: OK
  9859. 313.22 s [vector] +++ OK, passed 100 tests.
  9860. 313.22 s [vector] imap: OK
  9861. 313.22 s [vector] +++ OK, passed 100 tests.
  9862. 313.22 s [vector] concatMap: OK
  9863. 313.22 s [vector] +++ OK, passed 100 tests.
  9864. 313.22 s [vector] mapM: OK
  9865. 313.22 s [vector] +++ OK, passed 100 tests.
  9866. 313.22 s [vector] mapM_: OK (0.03s)
  9867. 313.22 s [vector] +++ OK, passed 100 tests.
  9868. 313.22 s [vector] forM: OK
  9869. 313.23 s [vector] +++ OK, passed 100 tests.
  9870. 313.26 s [vector] forM_: OK (0.03s)
  9871. 313.26 s [vector] +++ OK, passed 100 tests.
  9872. 313.26 s [vector] imapM: OK
  9873. 313.28 s [vector] +++ OK, passed 100 tests.
  9874. 313.30 s [vector] imapM_: OK (0.04s)
  9875. 313.30 s [vector] +++ OK, passed 100 tests.
  9876. 313.30 s [vector] zipWith: OK
  9877. 313.32 s [vector] +++ OK, passed 100 tests.
  9878. 313.33 s [vector] zipWith3: OK (0.02s)
  9879. 313.33 s [vector] +++ OK, passed 100 tests.
  9880. 313.34 s [vector] izipWith: OK
  9881. 313.34 s [vector] +++ OK, passed 100 tests.
  9882. 313.34 s [vector] izipWith3: OK
  9883. 313.35 s [vector] +++ OK, passed 100 tests.
  9884. 313.35 s [vector] izipWithM: OK
  9885. 313.35 s [vector] +++ OK, passed 100 tests.
  9886. 313.38 s [vector] izipWithM_: OK (0.03s)
  9887. 313.38 s [vector] +++ OK, passed 100 tests.
  9888. 313.39 s [vector] zipWithM: OK
  9889. 313.40 s [vector] +++ OK, passed 100 tests.
  9890. 313.41 s [vector] zipWithM_: OK (0.03s)
  9891. 313.41 s [vector] +++ OK, passed 100 tests.
  9892. 313.42 s [vector] filter: OK
  9893. 313.43 s [vector] +++ OK, passed 100 tests.
  9894. 313.44 s [vector] ifilter: OK
  9895. 313.44 s [vector] +++ OK, passed 100 tests.
  9896. 313.47 s [vector] filterM: OK (0.04s)
  9897. 313.47 s [vector] +++ OK, passed 100 tests.
  9898. 313.47 s [vector] uniq: OK
  9899. 313.47 s [vector] +++ OK, passed 100 tests.
  9900. 313.48 s [vector] mapMaybe: OK
  9901. 313.48 s [vector] +++ OK, passed 100 tests.
  9902. 313.48 s [vector] imapMaybe: OK
  9903. 313.48 s [vector] +++ OK, passed 100 tests.
  9904. 313.49 s [vector] takeWhile: OK
  9905. 313.49 s [vector] +++ OK, passed 100 tests.
  9906. 313.49 s [vector] dropWhile: OK
  9907. 313.49 s [vector] +++ OK, passed 100 tests.
  9908. 313.49 s [vector] partition: OK
  9909. 313.50 s [vector] +++ OK, passed 100 tests.
  9910. 313.50 s [vector] partitionWith: OK
  9911. 313.50 s [vector] +++ OK, passed 100 tests.
  9912. 313.50 s [vector] span: OK
  9913. 313.50 s [vector] +++ OK, passed 100 tests.
  9914. 313.50 s [vector] break: OK
  9915. 313.50 s [vector] +++ OK, passed 100 tests.
  9916. 313.51 s [vector] spanR: OK
  9917. 313.51 s [vector] +++ OK, passed 100 tests.
  9918. 313.52 s [vector] breakR: OK
  9919. 313.52 s [vector] +++ OK, passed 100 tests.
  9920. 313.52 s [vector] groupBy: OK (0.01s)
  9921. 313.52 s [vector] +++ OK, passed 100 tests.
  9922. 313.52 s [vector] elem: OK
  9923. 313.52 s [vector] +++ OK, passed 100 tests.
  9924. 313.52 s [vector] notElem: OK
  9925. 313.52 s [vector] +++ OK, passed 100 tests.
  9926. 313.52 s [vector] find: OK
  9927. 313.52 s [vector] +++ OK, passed 100 tests.
  9928. 313.52 s [vector] findIndex: OK
  9929. 313.52 s [vector] +++ OK, passed 100 tests.
  9930. 313.53 s [vector] findIndexR: OK
  9931. 313.53 s [vector] +++ OK, passed 100 tests.
  9932. 313.53 s [vector] findIndices: OK
  9933. 313.53 s [vector] +++ OK, passed 100 tests.
  9934. 313.53 s [vector] elemIndex: OK
  9935. 313.53 s [vector] +++ OK, passed 100 tests.
  9936. 313.54 s [vector] elemIndices: OK
  9937. 313.54 s [vector] +++ OK, passed 100 tests.
  9938. 313.56 s [vector] foldl: OK (0.01s)
  9939. 313.56 s [vector] +++ OK, passed 100 tests.
  9940. 313.57 s [vector] foldl1: OK (0.01s)
  9941. 313.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9942. 313.57 s [vector] foldl': OK (0.01s)
  9943. 313.57 s [vector] +++ OK, passed 100 tests.
  9944. 313.60 s [vector] foldl1': OK (0.01s)
  9945. 313.60 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9946. 313.61 s [vector] foldr: OK (0.01s)
  9947. 313.61 s [vector] +++ OK, passed 100 tests.
  9948. 313.62 s [vector] foldr1: OK (0.01s)
  9949. 313.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9950. 313.63 s [vector] foldr': OK (0.01s)
  9951. 313.63 s [vector] +++ OK, passed 100 tests.
  9952. 313.64 s [vector] foldr1': OK (0.01s)
  9953. 313.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9954. 313.65 s [vector] ifoldl: OK (0.01s)
  9955. 313.65 s [vector] +++ OK, passed 100 tests.
  9956. 313.67 s [vector] ifoldl': OK (0.01s)
  9957. 313.67 s [vector] +++ OK, passed 100 tests.
  9958. 313.69 s [vector] ifoldr: OK (0.01s)
  9959. 313.69 s [vector] +++ OK, passed 100 tests.
  9960. 313.69 s [vector] ifoldr': OK (0.02s)
  9961. 313.69 s [vector] +++ OK, passed 100 tests.
  9962. 313.71 s [vector] ifoldM: OK (0.01s)
  9963. 313.71 s [vector] +++ OK, passed 100 tests.
  9964. 313.73 s [vector] ifoldM': OK (0.01s)
  9965. 313.73 s [vector] +++ OK, passed 100 tests.
  9966. 313.75 s [vector] ifoldM_: OK (0.04s)
  9967. 313.75 s [vector] +++ OK, passed 100 tests.
  9968. 313.79 s [vector] ifoldM'_: OK (0.02s)
  9969. 313.79 s [vector] +++ OK, passed 100 tests.
  9970. 313.79 s [vector] all: OK
  9971. 313.79 s [vector] +++ OK, passed 100 tests.
  9972. 313.79 s [vector] any: OK
  9973. 313.79 s [vector] +++ OK, passed 100 tests.
  9974. 313.81 s [vector] prescanl: OK (0.01s)
  9975. 313.81 s [vector] +++ OK, passed 100 tests.
  9976. 313.82 s [vector] prescanl': OK (0.01s)
  9977. 313.82 s [vector] +++ OK, passed 100 tests.
  9978. 313.83 s [vector] postscanl: OK (0.01s)
  9979. 313.83 s [vector] +++ OK, passed 100 tests.
  9980. 313.85 s [vector] postscanl': OK (0.01s)
  9981. 313.85 s [vector] +++ OK, passed 100 tests.
  9982. 313.86 s [vector] scanl: OK (0.01s)
  9983. 313.86 s [vector] +++ OK, passed 100 tests.
  9984. 313.87 s [vector] scanl': OK (0.01s)
  9985. 313.87 s [vector] +++ OK, passed 100 tests.
  9986. 313.89 s [vector] scanl1: OK (0.01s)
  9987. 313.89 s [vector] +++ OK, passed 100 tests.
  9988. 313.90 s [vector] scanl1': OK (0.01s)
  9989. 313.90 s [vector] +++ OK, passed 100 tests.
  9990. 313.90 s [vector] iscanl: OK (0.02s)
  9991. 313.90 s [vector] +++ OK, passed 100 tests.
  9992. 313.93 s [vector] iscanl': OK (0.01s)
  9993. 313.93 s [vector] +++ OK, passed 100 tests.
  9994. 313.95 s [vector] prescanr: OK (0.01s)
  9995. 313.95 s [vector] +++ OK, passed 100 tests.
  9996. 313.95 s [vector] prescanr': OK (0.01s)
  9997. 313.95 s [vector] +++ OK, passed 100 tests.
  9998. 313.97 s [vector] postscanr: OK (0.01s)
  9999. 313.97 s [vector] +++ OK, passed 100 tests.
  10000. 313.99 s [vector] postscanr': OK (0.01s)
  10001. 313.99 s [vector] +++ OK, passed 100 tests.
  10002. 313.99 s [vector] scanr: OK (0.01s)
  10003. 313.99 s [vector] +++ OK, passed 100 tests.
  10004. 314.01 s [vector] scanr': OK (0.01s)
  10005. 314.01 s [vector] +++ OK, passed 100 tests.
  10006. 314.02 s [vector] scanr1: OK (0.01s)
  10007. 314.02 s [vector] +++ OK, passed 100 tests.
  10008. 314.02 s [vector] scanr1': OK (0.01s)
  10009. 314.02 s [vector] +++ OK, passed 100 tests.
  10010. 314.05 s [vector] iscanr: OK (0.01s)
  10011. 314.05 s [vector] +++ OK, passed 100 tests.
  10012. 314.05 s [vector] iscanr': OK (0.02s)
  10013. 314.05 s [vector] +++ OK, passed 100 tests.
  10014. 314.06 s [vector] mut_read: OK
  10015. 314.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10016. 314.06 s [vector] mut_write: OK
  10017. 314.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10018. 314.06 s [vector] mut_modify: OK
  10019. 314.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10020. 314.06 s [vector] mut_generate: OK
  10021. 314.07 s [vector] +++ OK, passed 100 tests.
  10022. 314.09 s [vector] mut_generateM: OK (0.01s)
  10023. 314.09 s [vector] +++ OK, passed 100 tests.
  10024. 314.13 s [vector] mut_mapM_: OK (0.04s)
  10025. 314.13 s [vector] +++ OK, passed 100 tests.
  10026. 314.17 s [vector] mut_imapM_: OK (0.04s)
  10027. 314.17 s [vector] +++ OK, passed 100 tests.
  10028. 314.21 s [vector] mut_forM_: OK (0.04s)
  10029. 314.21 s [vector] +++ OK, passed 100 tests.
  10030. 314.25 s [vector] mut_iforM_: OK (0.05s)
  10031. 314.25 s [vector] +++ OK, passed 100 tests.
  10032. 314.27 s [vector] mut_foldr: OK (0.02s)
  10033. 314.27 s [vector] +++ OK, passed 100 tests.
  10034. 314.28 s [vector] mut_foldr': OK (0.01s)
  10035. 314.28 s [vector] +++ OK, passed 100 tests.
  10036. 314.29 s [vector] mut_foldl: OK (0.02s)
  10037. 314.29 s [vector] +++ OK, passed 100 tests.
  10038. 314.31 s [vector] mut_foldl': OK (0.02s)
  10039. 314.31 s [vector] +++ OK, passed 100 tests.
  10040. 314.35 s [vector] mut_ifoldr: OK (0.02s)
  10041. 314.35 s [vector] +++ OK, passed 100 tests.
  10042. 314.37 s [vector] mut_ifoldr': OK (0.02s)
  10043. 314.37 s [vector] +++ OK, passed 100 tests.
  10044. 314.39 s [vector] mut_ifoldl: OK (0.03s)
  10045. 314.39 s [vector] +++ OK, passed 100 tests.
  10046. 314.41 s [vector] mut_ifoldl': OK (0.02s)
  10047. 314.41 s [vector] +++ OK, passed 100 tests.
  10048. 314.45 s [vector] mut_foldM: OK (0.02s)
  10049. 314.45 s [vector] +++ OK, passed 100 tests.
  10050. 314.47 s [vector] mut_foldM': OK (0.03s)
  10051. 314.47 s [vector] +++ OK, passed 100 tests.
  10052. 314.49 s [vector] mut_foldrM: OK (0.03s)
  10053. 314.49 s [vector] +++ OK, passed 100 tests.
  10054. 314.51 s [vector] mut_foldrM': OK (0.02s)
  10055. 314.51 s [vector] +++ OK, passed 100 tests.
  10056. 314.53 s [vector] mut_ifoldM: OK (0.02s)
  10057. 314.53 s [vector] +++ OK, passed 100 tests.
  10058. 314.55 s [vector] mut_ifoldM': OK (0.02s)
  10059. 314.55 s [vector] +++ OK, passed 100 tests.
  10060. 314.56 s [vector] mut_ifoldrM: OK (0.02s)
  10061. 314.56 s [vector] +++ OK, passed 100 tests.
  10062. 314.57 s [vector] mut_ifoldrM': OK (0.02s)
  10063. 314.57 s [vector] +++ OK, passed 100 tests.
  10064. 314.57 s [vector] compare: OK
  10065. 314.57 s [vector] +++ OK, passed 100 tests.
  10066. 314.57 s [vector] maximum: OK
  10067. 314.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10068. 314.57 s [vector] minimum: OK
  10069. 314.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10070. 314.57 s [vector] minIndex: OK
  10071. 314.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10072. 314.57 s [vector] maxIndex: OK
  10073. 314.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10074. 314.57 s [vector] maximumBy: OK
  10075. 314.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10076. 314.57 s [vector] minimumBy: OK
  10077. 314.57 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10078. 314.57 s [vector] maximumOn: OK
  10079. 314.57 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10080. 314.57 s [vector] minimumOn: OK
  10081. 314.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10082. 314.58 s [vector] maxIndexBy: OK
  10083. 314.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10084. 314.58 s [vector] minIndexBy: OK
  10085. 314.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10086. 314.58 s [vector] ListFirstMaxIndexWins: OK
  10087. 314.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10088. 314.58 s [vector] FalseListFirstMaxIndexWins: OK
  10089. 314.58 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  10090. 314.58 s [vector] []
  10091. 314.58 s [vector] mempty: OK
  10092. 314.58 s [vector] +++ OK, passed 1 test.
  10093. 314.60 s [vector] mappend: OK
  10094. 314.60 s [vector] +++ OK, passed 100 tests.
  10095. 314.60 s [vector] mconcat: OK (0.02s)
  10096. 314.60 s [vector] +++ OK, passed 100 tests.
  10097. 314.61 s [vector] glength: OK
  10098. 314.61 s [vector] +++ OK, passed 100 tests.
  10099. 314.61 s [vector] sum: OK
  10100. 314.61 s [vector] +++ OK, passed 100 tests.
  10101. 314.61 s [vector] product: OK
  10102. 314.61 s [vector] +++ OK, passed 100 tests.
  10103. 314.61 s [vector] enumFromN: OK
  10104. 314.61 s [vector] +++ OK, passed 100 tests.
  10105. 314.61 s [vector] enumFromThenN: OK
  10106. 314.61 s [vector] +++ OK, passed 100 tests.
  10107. 314.61 s [vector] enumFromTo: OK
  10108. 314.61 s [vector] +++ OK, passed 100 tests.
  10109. 314.61 s [vector] enumFromThenTo: OK
  10110. 314.61 s [vector] +++ OK, passed 100 tests; 2 discarded.
  10111. 314.61 s [vector] unstream
  10112. 314.61 s [vector] unstream == vunstream (exact): OK
  10113. 314.61 s [vector] +++ OK, passed 100 tests.
  10114. 314.61 s [vector] unstream == vunstream (unknown): OK
  10115. 314.61 s [vector] +++ OK, passed 100 tests.
  10116. 314.61 s [vector] unstreamR ~= vunstream (exact): OK
  10117. 314.61 s [vector] +++ OK, passed 100 tests.
  10118. 314.61 s [vector] unstreamR ~= vunstream (unknown): OK
  10119. 314.61 s [vector] +++ OK, passed 100 tests.
  10120. 314.61 s [vector] Tests.Vector.Strict
  10121. 314.61 s [vector] Bool
  10122. 314.61 s [vector] fromList.toList == id: OK
  10123. 314.61 s [vector] +++ OK, passed 100 tests.
  10124. 314.61 s [vector] toList.fromList == id: OK
  10125. 314.61 s [vector] +++ OK, passed 100 tests.
  10126. 314.61 s [vector] unstream.stream == id: OK
  10127. 314.61 s [vector] +++ OK, passed 100 tests.
  10128. 314.61 s [vector] stream.unstream == id: OK
  10129. 314.61 s [vector] +++ OK, passed 100 tests.
  10130. 314.61 s [vector] eq: OK
  10131. 314.61 s [vector] +++ OK, passed 100 tests.
  10132. 314.61 s [vector] length: OK
  10133. 314.61 s [vector] +++ OK, passed 100 tests.
  10134. 314.61 s [vector] null: OK
  10135. 314.61 s [vector] +++ OK, passed 100 tests.
  10136. 314.61 s [vector] index: OK
  10137. 314.61 s [vector] +++ OK, passed 100 tests; 24 discarded.
  10138. 314.61 s [vector] safeIndex: OK
  10139. 314.61 s [vector] +++ OK, passed 100 tests.
  10140. 314.61 s [vector] head: OK
  10141. 314.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10142. 314.61 s [vector] last: OK
  10143. 314.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10144. 314.62 s [vector] unsafeIndex: OK
  10145. 314.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10146. 314.62 s [vector] unsafeHead: OK
  10147. 314.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10148. 314.62 s [vector] unsafeLast: OK
  10149. 314.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10150. 314.62 s [vector] slice: OK
  10151. 314.62 s [vector] +++ OK, passed 100 tests.
  10152. 314.62 s [vector] init: OK
  10153. 314.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10154. 314.62 s [vector] tail: OK
  10155. 314.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10156. 314.62 s [vector] take: OK
  10157. 314.62 s [vector] +++ OK, passed 100 tests.
  10158. 314.62 s [vector] drop: OK
  10159. 314.62 s [vector] +++ OK, passed 100 tests.
  10160. 314.62 s [vector] splitAt: OK
  10161. 314.62 s [vector] +++ OK, passed 100 tests.
  10162. 314.62 s [vector] empty: OK
  10163. 314.62 s [vector] +++ OK, passed 1 test.
  10164. 314.62 s [vector] singleton: OK
  10165. 314.62 s [vector] +++ OK, passed 100 tests.
  10166. 314.62 s [vector] replicate: OK
  10167. 314.62 s [vector] +++ OK, passed 100 tests.
  10168. 314.62 s [vector] generate: OK
  10169. 314.62 s [vector] +++ OK, passed 100 tests.
  10170. 314.63 s [vector] iterateN: OK
  10171. 314.63 s [vector] +++ OK, passed 100 tests.
  10172. 314.64 s [vector] iterateNM: OK (0.01s)
  10173. 314.64 s [vector] +++ OK, passed 100 tests.
  10174. 314.66 s [vector] generateM: OK (0.02s)
  10175. 314.66 s [vector] +++ OK, passed 100 tests.
  10176. 314.67 s [vector] replicateM: OK (0.01s)
  10177. 314.67 s [vector] +++ OK, passed 100 tests.
  10178. 314.67 s [vector] create: OK
  10179. 314.67 s [vector] +++ OK, passed 100 tests.
  10180. 314.67 s [vector] createT: OK
  10181. 314.67 s [vector] +++ OK, passed 100 tests.
  10182. 314.67 s [vector] unfoldr: OK
  10183. 314.67 s [vector] +++ OK, passed 100 tests.
  10184. 314.67 s [vector] unfoldrN: OK
  10185. 314.67 s [vector] +++ OK, passed 100 tests.
  10186. 314.68 s [vector] unfoldrExactN: OK
  10187. 314.68 s [vector] +++ OK, passed 100 tests.
  10188. 314.68 s [vector] unfoldrM: OK
  10189. 314.68 s [vector] +++ OK, passed 100 tests.
  10190. 314.69 s [vector] unfoldrNM: OK
  10191. 314.69 s [vector] +++ OK, passed 100 tests.
  10192. 314.69 s [vector] unfoldrExactNM: OK (0.01s)
  10193. 314.69 s [vector] +++ OK, passed 100 tests.
  10194. 314.70 s [vector] constructN: OK
  10195. 314.70 s [vector] +++ OK, passed 100 tests.
  10196. 314.70 s [vector] constructrN: OK
  10197. 314.70 s [vector] +++ OK, passed 100 tests.
  10198. 314.70 s [vector] cons: OK
  10199. 314.70 s [vector] +++ OK, passed 100 tests.
  10200. 314.70 s [vector] snoc: OK
  10201. 314.70 s [vector] +++ OK, passed 100 tests.
  10202. 314.71 s [vector] append: OK
  10203. 314.71 s [vector] +++ OK, passed 100 tests.
  10204. 314.71 s [vector] concat: OK
  10205. 314.71 s [vector] +++ OK, passed 100 tests.
  10206. 314.71 s [vector] force: OK
  10207. 314.71 s [vector] +++ OK, passed 100 tests.
  10208. 314.71 s [vector] upd: OK
  10209. 314.71 s [vector] +++ OK, passed 100 tests.
  10210. 314.71 s [vector] accum: OK
  10211. 314.71 s [vector] +++ OK, passed 100 tests.
  10212. 314.71 s [vector] reverse: OK
  10213. 314.71 s [vector] +++ OK, passed 100 tests.
  10214. 314.71 s [vector] backpermute: OK
  10215. 314.71 s [vector] +++ OK, passed 100 tests.
  10216. 314.71 s [vector] map: OK
  10217. 314.71 s [vector] +++ OK, passed 100 tests.
  10218. 314.71 s [vector] imap: OK
  10219. 314.71 s [vector] +++ OK, passed 100 tests.
  10220. 314.72 s [vector] concatMap: OK
  10221. 314.72 s [vector] +++ OK, passed 100 tests.
  10222. 314.72 s [vector] mapM: OK
  10223. 314.73 s [vector] +++ OK, passed 100 tests.
  10224. 314.73 s [vector] mapM_: OK (0.01s)
  10225. 314.73 s [vector] +++ OK, passed 100 tests.
  10226. 314.73 s [vector] forM: OK
  10227. 314.74 s [vector] +++ OK, passed 100 tests.
  10228. 314.75 s [vector] forM_: OK (0.01s)
  10229. 314.75 s [vector] +++ OK, passed 100 tests.
  10230. 314.75 s [vector] imapM: OK
  10231. 314.76 s [vector] +++ OK, passed 100 tests.
  10232. 314.77 s [vector] imapM_: OK (0.02s)
  10233. 314.77 s [vector] +++ OK, passed 100 tests.
  10234. 314.77 s [vector] zipWith: OK
  10235. 314.77 s [vector] +++ OK, passed 100 tests.
  10236. 314.77 s [vector] zipWith3: OK
  10237. 314.77 s [vector] +++ OK, passed 100 tests.
  10238. 314.77 s [vector] izipWith: OK
  10239. 314.77 s [vector] +++ OK, passed 100 tests.
  10240. 314.78 s [vector] izipWith3: OK
  10241. 314.78 s [vector] +++ OK, passed 100 tests.
  10242. 314.78 s [vector] izipWithM: OK
  10243. 314.78 s [vector] +++ OK, passed 100 tests.
  10244. 314.79 s [vector] izipWithM_: OK (0.01s)
  10245. 314.79 s [vector] +++ OK, passed 100 tests.
  10246. 314.80 s [vector] zipWithM: OK
  10247. 314.80 s [vector] +++ OK, passed 100 tests.
  10248. 314.80 s [vector] zipWithM_: OK (0.01s)
  10249. 314.80 s [vector] +++ OK, passed 100 tests.
  10250. 314.80 s [vector] filter: OK
  10251. 314.80 s [vector] +++ OK, passed 100 tests.
  10252. 314.80 s [vector] ifilter: OK
  10253. 314.80 s [vector] +++ OK, passed 100 tests.
  10254. 314.83 s [vector] filterM: OK (0.03s)
  10255. 314.83 s [vector] +++ OK, passed 100 tests.
  10256. 314.83 s [vector] uniq: OK
  10257. 314.83 s [vector] +++ OK, passed 100 tests.
  10258. 314.83 s [vector] mapMaybe: OK
  10259. 314.83 s [vector] +++ OK, passed 100 tests.
  10260. 314.83 s [vector] imapMaybe: OK
  10261. 314.83 s [vector] +++ OK, passed 100 tests.
  10262. 314.83 s [vector] takeWhile: OK
  10263. 314.83 s [vector] +++ OK, passed 100 tests.
  10264. 314.83 s [vector] dropWhile: OK
  10265. 314.83 s [vector] +++ OK, passed 100 tests.
  10266. 314.83 s [vector] partition: OK
  10267. 314.84 s [vector] +++ OK, passed 100 tests.
  10268. 314.84 s [vector] partitionWith: OK
  10269. 314.84 s [vector] +++ OK, passed 100 tests.
  10270. 314.84 s [vector] span: OK
  10271. 314.84 s [vector] +++ OK, passed 100 tests.
  10272. 314.84 s [vector] break: OK
  10273. 314.84 s [vector] +++ OK, passed 100 tests.
  10274. 314.84 s [vector] spanR: OK
  10275. 314.84 s [vector] +++ OK, passed 100 tests.
  10276. 314.84 s [vector] breakR: OK
  10277. 314.84 s [vector] +++ OK, passed 100 tests.
  10278. 314.84 s [vector] groupBy: OK
  10279. 314.84 s [vector] +++ OK, passed 100 tests.
  10280. 314.84 s [vector] elem: OK
  10281. 314.84 s [vector] +++ OK, passed 100 tests.
  10282. 314.84 s [vector] notElem: OK
  10283. 314.84 s [vector] +++ OK, passed 100 tests.
  10284. 314.84 s [vector] find: OK
  10285. 314.84 s [vector] +++ OK, passed 100 tests.
  10286. 314.84 s [vector] findIndex: OK
  10287. 314.84 s [vector] +++ OK, passed 100 tests.
  10288. 314.84 s [vector] findIndexR: OK
  10289. 314.84 s [vector] +++ OK, passed 100 tests.
  10290. 314.84 s [vector] findIndices: OK
  10291. 314.84 s [vector] +++ OK, passed 100 tests.
  10292. 314.84 s [vector] elemIndex: OK
  10293. 314.84 s [vector] +++ OK, passed 100 tests.
  10294. 314.84 s [vector] elemIndices: OK
  10295. 314.84 s [vector] +++ OK, passed 100 tests.
  10296. 314.85 s [vector] foldl: OK
  10297. 314.85 s [vector] +++ OK, passed 100 tests.
  10298. 314.85 s [vector] foldl1: OK
  10299. 314.85 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10300. 314.85 s [vector] foldl': OK
  10301. 314.85 s [vector] +++ OK, passed 100 tests.
  10302. 314.85 s [vector] foldl1': OK
  10303. 314.85 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10304. 314.85 s [vector] foldr: OK
  10305. 314.85 s [vector] +++ OK, passed 100 tests.
  10306. 314.85 s [vector] foldr1: OK
  10307. 314.85 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10308. 314.85 s [vector] foldr': OK
  10309. 314.85 s [vector] +++ OK, passed 100 tests.
  10310. 314.85 s [vector] foldr1': OK
  10311. 314.85 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10312. 314.86 s [vector] ifoldl: OK
  10313. 314.86 s [vector] +++ OK, passed 100 tests.
  10314. 314.86 s [vector] ifoldl': OK
  10315. 314.86 s [vector] +++ OK, passed 100 tests.
  10316. 314.86 s [vector] ifoldr: OK
  10317. 314.86 s [vector] +++ OK, passed 100 tests.
  10318. 314.86 s [vector] ifoldr': OK
  10319. 314.87 s [vector] +++ OK, passed 100 tests.
  10320. 314.87 s [vector] ifoldM: OK
  10321. 314.87 s [vector] +++ OK, passed 100 tests.
  10322. 314.88 s [vector] ifoldM': OK
  10323. 314.88 s [vector] +++ OK, passed 100 tests.
  10324. 314.90 s [vector] ifoldM_: OK (0.01s)
  10325. 314.90 s [vector] +++ OK, passed 100 tests.
  10326. 314.90 s [vector] ifoldM'_: OK (0.01s)
  10327. 314.90 s [vector] +++ OK, passed 100 tests.
  10328. 314.90 s [vector] all: OK
  10329. 314.90 s [vector] +++ OK, passed 100 tests.
  10330. 314.90 s [vector] any: OK
  10331. 314.90 s [vector] +++ OK, passed 100 tests.
  10332. 314.90 s [vector] prescanl: OK
  10333. 314.90 s [vector] +++ OK, passed 100 tests.
  10334. 314.90 s [vector] prescanl': OK
  10335. 314.91 s [vector] +++ OK, passed 100 tests.
  10336. 314.91 s [vector] postscanl: OK
  10337. 314.91 s [vector] +++ OK, passed 100 tests.
  10338. 314.92 s [vector] postscanl': OK
  10339. 314.92 s [vector] +++ OK, passed 100 tests.
  10340. 314.92 s [vector] scanl: OK
  10341. 314.92 s [vector] +++ OK, passed 100 tests.
  10342. 314.92 s [vector] scanl': OK
  10343. 314.92 s [vector] +++ OK, passed 100 tests.
  10344. 314.92 s [vector] scanl1: OK
  10345. 314.93 s [vector] +++ OK, passed 100 tests.
  10346. 314.93 s [vector] scanl1': OK
  10347. 314.93 s [vector] +++ OK, passed 100 tests.
  10348. 314.93 s [vector] iscanl: OK
  10349. 314.93 s [vector] +++ OK, passed 100 tests.
  10350. 314.93 s [vector] iscanl': OK
  10351. 314.93 s [vector] +++ OK, passed 100 tests.
  10352. 314.93 s [vector] prescanr: OK
  10353. 314.93 s [vector] +++ OK, passed 100 tests.
  10354. 314.93 s [vector] prescanr': OK
  10355. 314.93 s [vector] +++ OK, passed 100 tests.
  10356. 314.93 s [vector] postscanr: OK
  10357. 314.94 s [vector] +++ OK, passed 100 tests.
  10358. 314.94 s [vector] postscanr': OK
  10359. 314.94 s [vector] +++ OK, passed 100 tests.
  10360. 314.94 s [vector] scanr: OK
  10361. 314.94 s [vector] +++ OK, passed 100 tests.
  10362. 314.94 s [vector] scanr': OK
  10363. 314.94 s [vector] +++ OK, passed 100 tests.
  10364. 314.94 s [vector] scanr1: OK
  10365. 314.94 s [vector] +++ OK, passed 100 tests.
  10366. 314.94 s [vector] scanr1': OK
  10367. 314.94 s [vector] +++ OK, passed 100 tests.
  10368. 314.94 s [vector] iscanr: OK
  10369. 314.94 s [vector] +++ OK, passed 100 tests.
  10370. 314.94 s [vector] iscanr': OK
  10371. 314.94 s [vector] +++ OK, passed 100 tests.
  10372. 314.94 s [vector] mut_read: OK
  10373. 314.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10374. 314.94 s [vector] mut_write: OK
  10375. 314.94 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10376. 314.94 s [vector] mut_modify: OK
  10377. 314.94 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10378. 314.94 s [vector] mut_generate: OK
  10379. 314.95 s [vector] +++ OK, passed 100 tests.
  10380. 314.96 s [vector] mut_generateM: OK
  10381. 314.96 s [vector] +++ OK, passed 100 tests.
  10382. 314.97 s [vector] mut_mapM_: OK
  10383. 314.97 s [vector] +++ OK, passed 100 tests.
  10384. 314.97 s [vector] mut_imapM_: OK (0.01s)
  10385. 314.97 s [vector] +++ OK, passed 100 tests.
  10386. 315.00 s [vector] mut_forM_: OK (0.01s)
  10387. 315.00 s [vector] +++ OK, passed 100 tests.
  10388. 315.00 s [vector] mut_iforM_: OK (0.01s)
  10389. 315.00 s [vector] +++ OK, passed 100 tests.
  10390. 315.00 s [vector] mut_foldr: OK
  10391. 315.00 s [vector] +++ OK, passed 100 tests.
  10392. 315.00 s [vector] mut_foldr': OK
  10393. 315.00 s [vector] +++ OK, passed 100 tests.
  10394. 315.00 s [vector] mut_foldl: OK
  10395. 315.00 s [vector] +++ OK, passed 100 tests.
  10396. 315.01 s [vector] mut_foldl': OK
  10397. 315.01 s [vector] +++ OK, passed 100 tests.
  10398. 315.01 s [vector] mut_ifoldr: OK
  10399. 315.01 s [vector] +++ OK, passed 100 tests.
  10400. 315.01 s [vector] mut_ifoldr': OK
  10401. 315.01 s [vector] +++ OK, passed 100 tests.
  10402. 315.01 s [vector] mut_ifoldl: OK
  10403. 315.01 s [vector] +++ OK, passed 100 tests.
  10404. 315.01 s [vector] mut_ifoldl': OK
  10405. 315.01 s [vector] +++ OK, passed 100 tests.
  10406. 315.01 s [vector] mut_foldM: OK
  10407. 315.01 s [vector] +++ OK, passed 100 tests.
  10408. 315.01 s [vector] mut_foldM': OK
  10409. 315.01 s [vector] +++ OK, passed 100 tests.
  10410. 315.01 s [vector] mut_foldrM: OK
  10411. 315.01 s [vector] +++ OK, passed 100 tests.
  10412. 315.02 s [vector] mut_foldrM': OK
  10413. 315.02 s [vector] +++ OK, passed 100 tests.
  10414. 315.02 s [vector] mut_ifoldM: OK
  10415. 315.02 s [vector] +++ OK, passed 100 tests.
  10416. 315.02 s [vector] mut_ifoldM': OK
  10417. 315.02 s [vector] +++ OK, passed 100 tests.
  10418. 315.02 s [vector] mut_ifoldrM: OK
  10419. 315.02 s [vector] +++ OK, passed 100 tests.
  10420. 315.02 s [vector] mut_ifoldrM': OK
  10421. 315.02 s [vector] +++ OK, passed 100 tests.
  10422. 315.02 s [vector] compare: OK
  10423. 315.02 s [vector] +++ OK, passed 100 tests.
  10424. 315.02 s [vector] maximum: OK
  10425. 315.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10426. 315.02 s [vector] minimum: OK
  10427. 315.02 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10428. 315.02 s [vector] minIndex: OK
  10429. 315.02 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10430. 315.02 s [vector] maxIndex: OK
  10431. 315.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10432. 315.02 s [vector] maximumBy: OK
  10433. 315.02 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10434. 315.02 s [vector] minimumBy: OK
  10435. 315.02 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10436. 315.02 s [vector] maximumOn: OK
  10437. 315.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10438. 315.02 s [vector] minimumOn: OK
  10439. 315.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10440. 315.02 s [vector] maxIndexBy: OK
  10441. 315.02 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10442. 315.04 s [vector] minIndexBy: OK
  10443. 315.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10444. 315.04 s [vector] ListFirstMaxIndexWins: OK
  10445. 315.04 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10446. 315.04 s [vector] FalseListFirstMaxIndexWins: OK
  10447. 315.04 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  10448. 315.04 s [vector] []
  10449. 315.04 s [vector] zip: OK
  10450. 315.04 s [vector] +++ OK, passed 100 tests.
  10451. 315.04 s [vector] zip3: OK
  10452. 315.04 s [vector] +++ OK, passed 100 tests.
  10453. 315.04 s [vector] unzip: OK
  10454. 315.04 s [vector] +++ OK, passed 100 tests.
  10455. 315.04 s [vector] unzip3: OK
  10456. 315.04 s [vector] +++ OK, passed 100 tests.
  10457. 315.04 s [vector] indexed: OK
  10458. 315.04 s [vector] +++ OK, passed 100 tests.
  10459. 315.04 s [vector] update: OK
  10460. 315.04 s [vector] +++ OK, passed 100 tests.
  10461. 315.04 s [vector] concat: OK
  10462. 315.04 s [vector] +++ OK, passed 100 tests.
  10463. 315.04 s [vector] mempty: OK
  10464. 315.04 s [vector] +++ OK, passed 1 test.
  10465. 315.04 s [vector] mappend: OK
  10466. 315.04 s [vector] +++ OK, passed 100 tests.
  10467. 315.06 s [vector] mconcat: OK
  10468. 315.06 s [vector] +++ OK, passed 100 tests.
  10469. 315.06 s [vector] fmap: OK
  10470. 315.06 s [vector] +++ OK, passed 100 tests.
  10471. 315.06 s [vector] return: OK
  10472. 315.06 s [vector] +++ OK, passed 100 tests.
  10473. 315.06 s [vector] bind: OK (0.01s)
  10474. 315.06 s [vector] +++ OK, passed 100 tests.
  10475. 315.06 s [vector] mzip: OK
  10476. 315.06 s [vector] +++ OK, passed 100 tests.
  10477. 315.06 s [vector] munzip: OK
  10478. 315.06 s [vector] +++ OK, passed 100 tests.
  10479. 315.06 s [vector] applicative_pure: OK
  10480. 315.06 s [vector] +++ OK, passed 100 tests.
  10481. 315.08 s [vector] applicative_appl: OK (0.02s)
  10482. 315.08 s [vector] +++ OK, passed 100 tests.
  10483. 315.08 s [vector] alternative_empty: OK
  10484. 315.08 s [vector] +++ OK, passed 1 test.
  10485. 315.08 s [vector] alternative_or: OK
  10486. 315.08 s [vector] +++ OK, passed 100 tests.
  10487. 315.12 s [vector] sequence: OK (0.03s)
  10488. 315.12 s [vector] +++ OK, passed 100 tests.
  10489. 315.12 s [vector] sequence_: OK
  10490. 315.12 s [vector] +++ OK, passed 100 tests.
  10491. 315.12 s [vector] glength: OK
  10492. 315.12 s [vector] +++ OK, passed 100 tests.
  10493. 315.12 s [vector] and: OK
  10494. 315.12 s [vector] +++ OK, passed 100 tests.
  10495. 315.12 s [vector] or: OK
  10496. 315.12 s [vector] +++ OK, passed 100 tests.
  10497. 315.12 s [vector] Int
  10498. 315.12 s [vector] fromList.toList == id: OK
  10499. 315.12 s [vector] +++ OK, passed 100 tests.
  10500. 315.12 s [vector] toList.fromList == id: OK
  10501. 315.12 s [vector] +++ OK, passed 100 tests.
  10502. 315.12 s [vector] unstream.stream == id: OK
  10503. 315.12 s [vector] +++ OK, passed 100 tests.
  10504. 315.12 s [vector] stream.unstream == id: OK
  10505. 315.12 s [vector] +++ OK, passed 100 tests.
  10506. 315.12 s [vector] eq: OK
  10507. 315.12 s [vector] +++ OK, passed 100 tests.
  10508. 315.12 s [vector] length: OK
  10509. 315.12 s [vector] +++ OK, passed 100 tests.
  10510. 315.12 s [vector] null: OK
  10511. 315.12 s [vector] +++ OK, passed 100 tests.
  10512. 315.12 s [vector] index: OK
  10513. 315.12 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10514. 315.12 s [vector] safeIndex: OK
  10515. 315.12 s [vector] +++ OK, passed 100 tests.
  10516. 315.12 s [vector] head: OK
  10517. 315.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10518. 315.12 s [vector] last: OK
  10519. 315.12 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10520. 315.12 s [vector] unsafeIndex: OK
  10521. 315.13 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10522. 315.13 s [vector] unsafeHead: OK
  10523. 315.13 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10524. 315.13 s [vector] unsafeLast: OK
  10525. 315.13 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10526. 315.13 s [vector] slice: OK
  10527. 315.13 s [vector] +++ OK, passed 100 tests.
  10528. 315.13 s [vector] init: OK
  10529. 315.13 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10530. 315.13 s [vector] tail: OK
  10531. 315.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10532. 315.13 s [vector] take: OK
  10533. 315.13 s [vector] +++ OK, passed 100 tests.
  10534. 315.13 s [vector] drop: OK
  10535. 315.13 s [vector] +++ OK, passed 100 tests.
  10536. 315.13 s [vector] splitAt: OK
  10537. 315.13 s [vector] +++ OK, passed 100 tests.
  10538. 315.13 s [vector] empty: OK
  10539. 315.13 s [vector] +++ OK, passed 1 test.
  10540. 315.13 s [vector] singleton: OK
  10541. 315.13 s [vector] +++ OK, passed 100 tests.
  10542. 315.13 s [vector] replicate: OK
  10543. 315.13 s [vector] +++ OK, passed 100 tests.
  10544. 315.13 s [vector] generate: OK
  10545. 315.13 s [vector] +++ OK, passed 100 tests.
  10546. 315.13 s [vector] iterateN: OK
  10547. 315.14 s [vector] +++ OK, passed 100 tests.
  10548. 315.16 s [vector] iterateNM: OK (0.02s)
  10549. 315.16 s [vector] +++ OK, passed 100 tests.
  10550. 315.18 s [vector] generateM: OK (0.03s)
  10551. 315.18 s [vector] +++ OK, passed 100 tests.
  10552. 315.18 s [vector] replicateM: OK
  10553. 315.18 s [vector] +++ OK, passed 100 tests.
  10554. 315.18 s [vector] create: OK
  10555. 315.18 s [vector] +++ OK, passed 100 tests.
  10556. 315.18 s [vector] createT: OK
  10557. 315.19 s [vector] +++ OK, passed 100 tests.
  10558. 315.19 s [vector] unfoldr: OK
  10559. 315.19 s [vector] +++ OK, passed 100 tests.
  10560. 315.19 s [vector] unfoldrN: OK
  10561. 315.19 s [vector] +++ OK, passed 100 tests.
  10562. 315.19 s [vector] unfoldrExactN: OK
  10563. 315.19 s [vector] +++ OK, passed 100 tests.
  10564. 315.19 s [vector] unfoldrM: OK
  10565. 315.19 s [vector] +++ OK, passed 100 tests.
  10566. 315.20 s [vector] unfoldrNM: OK
  10567. 315.20 s [vector] +++ OK, passed 100 tests.
  10568. 315.20 s [vector] unfoldrExactNM: OK
  10569. 315.20 s [vector] +++ OK, passed 100 tests.
  10570. 315.20 s [vector] constructN: OK
  10571. 315.20 s [vector] +++ OK, passed 100 tests.
  10572. 315.20 s [vector] constructrN: OK
  10573. 315.21 s [vector] +++ OK, passed 100 tests.
  10574. 315.21 s [vector] cons: OK
  10575. 315.21 s [vector] +++ OK, passed 100 tests.
  10576. 315.21 s [vector] snoc: OK
  10577. 315.21 s [vector] +++ OK, passed 100 tests.
  10578. 315.21 s [vector] append: OK
  10579. 315.22 s [vector] +++ OK, passed 100 tests.
  10580. 315.22 s [vector] concat: OK (0.01s)
  10581. 315.22 s [vector] +++ OK, passed 100 tests.
  10582. 315.22 s [vector] force: OK
  10583. 315.22 s [vector] +++ OK, passed 100 tests.
  10584. 315.22 s [vector] upd: OK
  10585. 315.22 s [vector] +++ OK, passed 100 tests.
  10586. 315.23 s [vector] accum: OK
  10587. 315.23 s [vector] +++ OK, passed 100 tests.
  10588. 315.23 s [vector] reverse: OK
  10589. 315.23 s [vector] +++ OK, passed 100 tests.
  10590. 315.23 s [vector] backpermute: OK
  10591. 315.23 s [vector] +++ OK, passed 100 tests.
  10592. 315.23 s [vector] map: OK
  10593. 315.23 s [vector] +++ OK, passed 100 tests.
  10594. 315.23 s [vector] imap: OK
  10595. 315.23 s [vector] +++ OK, passed 100 tests.
  10596. 315.23 s [vector] concatMap: OK
  10597. 315.23 s [vector] +++ OK, passed 100 tests.
  10598. 315.24 s [vector] mapM: OK
  10599. 315.24 s [vector] +++ OK, passed 100 tests.
  10600. 315.25 s [vector] mapM_: OK (0.02s)
  10601. 315.25 s [vector] +++ OK, passed 100 tests.
  10602. 315.26 s [vector] forM: OK
  10603. 315.26 s [vector] +++ OK, passed 100 tests.
  10604. 315.27 s [vector] forM_: OK (0.01s)
  10605. 315.27 s [vector] +++ OK, passed 100 tests.
  10606. 315.28 s [vector] imapM: OK
  10607. 315.28 s [vector] +++ OK, passed 100 tests.
  10608. 315.29 s [vector] imapM_: OK (0.02s)
  10609. 315.29 s [vector] +++ OK, passed 100 tests.
  10610. 315.29 s [vector] zipWith: OK
  10611. 315.29 s [vector] +++ OK, passed 100 tests.
  10612. 315.29 s [vector] zipWith3: OK
  10613. 315.29 s [vector] +++ OK, passed 100 tests.
  10614. 315.30 s [vector] izipWith: OK
  10615. 315.30 s [vector] +++ OK, passed 100 tests.
  10616. 315.30 s [vector] izipWith3: OK
  10617. 315.30 s [vector] +++ OK, passed 100 tests.
  10618. 315.30 s [vector] izipWithM: OK
  10619. 315.31 s [vector] +++ OK, passed 100 tests.
  10620. 315.31 s [vector] izipWithM_: OK (0.01s)
  10621. 315.31 s [vector] +++ OK, passed 100 tests.
  10622. 315.31 s [vector] zipWithM: OK
  10623. 315.32 s [vector] +++ OK, passed 100 tests.
  10624. 315.33 s [vector] zipWithM_: OK (0.01s)
  10625. 315.33 s [vector] +++ OK, passed 100 tests.
  10626. 315.33 s [vector] filter: OK
  10627. 315.33 s [vector] +++ OK, passed 100 tests.
  10628. 315.33 s [vector] ifilter: OK
  10629. 315.34 s [vector] +++ OK, passed 100 tests.
  10630. 315.35 s [vector] filterM: OK (0.03s)
  10631. 315.35 s [vector] +++ OK, passed 100 tests.
  10632. 315.35 s [vector] uniq: OK
  10633. 315.36 s [vector] +++ OK, passed 100 tests.
  10634. 315.36 s [vector] mapMaybe: OK
  10635. 315.36 s [vector] +++ OK, passed 100 tests.
  10636. 315.36 s [vector] imapMaybe: OK
  10637. 315.36 s [vector] +++ OK, passed 100 tests.
  10638. 315.36 s [vector] takeWhile: OK
  10639. 315.36 s [vector] +++ OK, passed 100 tests.
  10640. 315.36 s [vector] dropWhile: OK
  10641. 315.36 s [vector] +++ OK, passed 100 tests.
  10642. 315.36 s [vector] partition: OK
  10643. 315.36 s [vector] +++ OK, passed 100 tests.
  10644. 315.36 s [vector] partitionWith: OK
  10645. 315.36 s [vector] +++ OK, passed 100 tests.
  10646. 315.36 s [vector] span: OK
  10647. 315.36 s [vector] +++ OK, passed 100 tests.
  10648. 315.37 s [vector] break: OK
  10649. 315.37 s [vector] +++ OK, passed 100 tests.
  10650. 315.37 s [vector] spanR: OK
  10651. 315.37 s [vector] +++ OK, passed 100 tests.
  10652. 315.37 s [vector] breakR: OK
  10653. 315.37 s [vector] +++ OK, passed 100 tests.
  10654. 315.37 s [vector] groupBy: OK
  10655. 315.37 s [vector] +++ OK, passed 100 tests.
  10656. 315.37 s [vector] elem: OK
  10657. 315.37 s [vector] +++ OK, passed 100 tests.
  10658. 315.37 s [vector] notElem: OK
  10659. 315.37 s [vector] +++ OK, passed 100 tests.
  10660. 315.37 s [vector] find: OK
  10661. 315.37 s [vector] +++ OK, passed 100 tests.
  10662. 315.37 s [vector] findIndex: OK
  10663. 315.37 s [vector] +++ OK, passed 100 tests.
  10664. 315.37 s [vector] findIndexR: OK
  10665. 315.37 s [vector] +++ OK, passed 100 tests.
  10666. 315.37 s [vector] findIndices: OK
  10667. 315.37 s [vector] +++ OK, passed 100 tests.
  10668. 315.37 s [vector] elemIndex: OK
  10669. 315.37 s [vector] +++ OK, passed 100 tests.
  10670. 315.37 s [vector] elemIndices: OK
  10671. 315.38 s [vector] +++ OK, passed 100 tests.
  10672. 315.38 s [vector] foldl: OK
  10673. 315.38 s [vector] +++ OK, passed 100 tests.
  10674. 315.38 s [vector] foldl1: OK
  10675. 315.38 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10676. 315.38 s [vector] foldl': OK
  10677. 315.38 s [vector] +++ OK, passed 100 tests.
  10678. 315.39 s [vector] foldl1': OK
  10679. 315.39 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10680. 315.39 s [vector] foldr: OK
  10681. 315.39 s [vector] +++ OK, passed 100 tests.
  10682. 315.39 s [vector] foldr1: OK
  10683. 315.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10684. 315.39 s [vector] foldr': OK
  10685. 315.40 s [vector] +++ OK, passed 100 tests.
  10686. 315.40 s [vector] foldr1': OK
  10687. 315.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10688. 315.41 s [vector] ifoldl: OK
  10689. 315.41 s [vector] +++ OK, passed 100 tests.
  10690. 315.41 s [vector] ifoldl': OK
  10691. 315.41 s [vector] +++ OK, passed 100 tests.
  10692. 315.41 s [vector] ifoldr: OK
  10693. 315.41 s [vector] +++ OK, passed 100 tests.
  10694. 315.42 s [vector] ifoldr': OK
  10695. 315.42 s [vector] +++ OK, passed 100 tests.
  10696. 315.42 s [vector] ifoldM: OK
  10697. 315.42 s [vector] +++ OK, passed 100 tests.
  10698. 315.42 s [vector] ifoldM': OK
  10699. 315.43 s [vector] +++ OK, passed 100 tests.
  10700. 315.44 s [vector] ifoldM_: OK (0.02s)
  10701. 315.44 s [vector] +++ OK, passed 100 tests.
  10702. 315.45 s [vector] ifoldM'_: OK (0.02s)
  10703. 315.45 s [vector] +++ OK, passed 100 tests.
  10704. 315.45 s [vector] all: OK
  10705. 315.45 s [vector] +++ OK, passed 100 tests.
  10706. 315.45 s [vector] any: OK
  10707. 315.45 s [vector] +++ OK, passed 100 tests.
  10708. 315.46 s [vector] prescanl: OK
  10709. 315.46 s [vector] +++ OK, passed 100 tests.
  10710. 315.47 s [vector] prescanl': OK
  10711. 315.47 s [vector] +++ OK, passed 100 tests.
  10712. 315.47 s [vector] postscanl: OK
  10713. 315.47 s [vector] +++ OK, passed 100 tests.
  10714. 315.47 s [vector] postscanl': OK
  10715. 315.47 s [vector] +++ OK, passed 100 tests.
  10716. 315.47 s [vector] scanl: OK
  10717. 315.48 s [vector] +++ OK, passed 100 tests.
  10718. 315.48 s [vector] scanl': OK
  10719. 315.49 s [vector] +++ OK, passed 100 tests.
  10720. 315.49 s [vector] scanl1: OK
  10721. 315.49 s [vector] +++ OK, passed 100 tests.
  10722. 315.49 s [vector] scanl1': OK
  10723. 315.49 s [vector] +++ OK, passed 100 tests.
  10724. 315.49 s [vector] iscanl: OK
  10725. 315.49 s [vector] +++ OK, passed 100 tests.
  10726. 315.50 s [vector] iscanl': OK
  10727. 315.50 s [vector] +++ OK, passed 100 tests.
  10728. 315.50 s [vector] prescanr: OK
  10729. 315.50 s [vector] +++ OK, passed 100 tests.
  10730. 315.50 s [vector] prescanr': OK
  10731. 315.50 s [vector] +++ OK, passed 100 tests.
  10732. 315.50 s [vector] postscanr: OK
  10733. 315.51 s [vector] +++ OK, passed 100 tests.
  10734. 315.51 s [vector] postscanr': OK
  10735. 315.51 s [vector] +++ OK, passed 100 tests.
  10736. 315.51 s [vector] scanr: OK
  10737. 315.51 s [vector] +++ OK, passed 100 tests.
  10738. 315.51 s [vector] scanr': OK
  10739. 315.51 s [vector] +++ OK, passed 100 tests.
  10740. 315.51 s [vector] scanr1: OK
  10741. 315.52 s [vector] +++ OK, passed 100 tests.
  10742. 315.52 s [vector] scanr1': OK
  10743. 315.52 s [vector] +++ OK, passed 100 tests.
  10744. 315.52 s [vector] iscanr: OK
  10745. 315.52 s [vector] +++ OK, passed 100 tests.
  10746. 315.52 s [vector] iscanr': OK
  10747. 315.52 s [vector] +++ OK, passed 100 tests.
  10748. 315.52 s [vector] mut_read: OK
  10749. 315.52 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10750. 315.52 s [vector] mut_write: OK
  10751. 315.52 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10752. 315.52 s [vector] mut_modify: OK
  10753. 315.52 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10754. 315.52 s [vector] mut_generate: OK
  10755. 315.54 s [vector] +++ OK, passed 100 tests.
  10756. 315.56 s [vector] mut_generateM: OK (0.02s)
  10757. 315.56 s [vector] +++ OK, passed 100 tests.
  10758. 315.56 s [vector] mut_mapM_: OK (0.01s)
  10759. 315.56 s [vector] +++ OK, passed 100 tests.
  10760. 315.58 s [vector] mut_imapM_: OK (0.02s)
  10761. 315.58 s [vector] +++ OK, passed 100 tests.
  10762. 315.60 s [vector] mut_forM_: OK (0.01s)
  10763. 315.60 s [vector] +++ OK, passed 100 tests.
  10764. 315.60 s [vector] mut_iforM_: OK (0.02s)
  10765. 315.60 s [vector] +++ OK, passed 100 tests.
  10766. 315.60 s [vector] mut_foldr: OK
  10767. 315.61 s [vector] +++ OK, passed 100 tests.
  10768. 315.61 s [vector] mut_foldr': OK
  10769. 315.61 s [vector] +++ OK, passed 100 tests.
  10770. 315.62 s [vector] mut_foldl: OK
  10771. 315.62 s [vector] +++ OK, passed 100 tests.
  10772. 315.62 s [vector] mut_foldl': OK
  10773. 315.62 s [vector] +++ OK, passed 100 tests.
  10774. 315.62 s [vector] mut_ifoldr: OK
  10775. 315.62 s [vector] +++ OK, passed 100 tests.
  10776. 315.62 s [vector] mut_ifoldr': OK
  10777. 315.63 s [vector] +++ OK, passed 100 tests.
  10778. 315.63 s [vector] mut_ifoldl: OK
  10779. 315.63 s [vector] +++ OK, passed 100 tests.
  10780. 315.64 s [vector] mut_ifoldl': OK
  10781. 315.64 s [vector] +++ OK, passed 100 tests.
  10782. 315.64 s [vector] mut_foldM: OK
  10783. 315.64 s [vector] +++ OK, passed 100 tests.
  10784. 315.64 s [vector] mut_foldM': OK
  10785. 315.64 s [vector] +++ OK, passed 100 tests.
  10786. 315.64 s [vector] mut_foldrM: OK
  10787. 315.65 s [vector] +++ OK, passed 100 tests.
  10788. 315.65 s [vector] mut_foldrM': OK
  10789. 315.65 s [vector] +++ OK, passed 100 tests.
  10790. 315.65 s [vector] mut_ifoldM: OK
  10791. 315.66 s [vector] +++ OK, passed 100 tests.
  10792. 315.66 s [vector] mut_ifoldM': OK
  10793. 315.66 s [vector] +++ OK, passed 100 tests.
  10794. 315.66 s [vector] mut_ifoldrM: OK
  10795. 315.66 s [vector] +++ OK, passed 100 tests.
  10796. 315.66 s [vector] mut_ifoldrM': OK
  10797. 315.66 s [vector] +++ OK, passed 100 tests.
  10798. 315.66 s [vector] compare: OK
  10799. 315.66 s [vector] +++ OK, passed 100 tests.
  10800. 315.66 s [vector] maximum: OK
  10801. 315.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10802. 315.67 s [vector] minimum: OK
  10803. 315.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10804. 315.67 s [vector] minIndex: OK
  10805. 315.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10806. 315.67 s [vector] maxIndex: OK
  10807. 315.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10808. 315.67 s [vector] maximumBy: OK
  10809. 315.67 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10810. 315.67 s [vector] minimumBy: OK
  10811. 315.67 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10812. 315.67 s [vector] maximumOn: OK
  10813. 315.67 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10814. 315.67 s [vector] minimumOn: OK
  10815. 315.67 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10816. 315.67 s [vector] maxIndexBy: OK
  10817. 315.67 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10818. 315.67 s [vector] minIndexBy: OK
  10819. 315.67 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10820. 315.67 s [vector] ListFirstMaxIndexWins: OK
  10821. 315.67 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10822. 315.67 s [vector] FalseListFirstMaxIndexWins: OK
  10823. 315.68 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  10824. 315.68 s [vector] []
  10825. 315.68 s [vector] zip: OK
  10826. 315.68 s [vector] +++ OK, passed 100 tests.
  10827. 315.68 s [vector] zip3: OK
  10828. 315.68 s [vector] +++ OK, passed 100 tests.
  10829. 315.68 s [vector] unzip: OK
  10830. 315.68 s [vector] +++ OK, passed 100 tests.
  10831. 315.68 s [vector] unzip3: OK
  10832. 315.68 s [vector] +++ OK, passed 100 tests.
  10833. 315.68 s [vector] indexed: OK
  10834. 315.68 s [vector] +++ OK, passed 100 tests.
  10835. 315.68 s [vector] update: OK
  10836. 315.69 s [vector] +++ OK, passed 100 tests.
  10837. 315.69 s [vector] concat: OK (0.01s)
  10838. 315.69 s [vector] +++ OK, passed 100 tests.
  10839. 315.69 s [vector] mempty: OK
  10840. 315.69 s [vector] +++ OK, passed 1 test.
  10841. 315.70 s [vector] mappend: OK
  10842. 315.70 s [vector] +++ OK, passed 100 tests.
  10843. 315.70 s [vector] mconcat: OK (0.01s)
  10844. 315.70 s [vector] +++ OK, passed 100 tests.
  10845. 315.70 s [vector] fmap: OK
  10846. 315.70 s [vector] +++ OK, passed 100 tests.
  10847. 315.70 s [vector] return: OK
  10848. 315.72 s [vector] +++ OK, passed 100 tests.
  10849. 315.72 s [vector] bind: OK (0.02s)
  10850. 315.72 s [vector] +++ OK, passed 100 tests.
  10851. 315.72 s [vector] mzip: OK
  10852. 315.72 s [vector] +++ OK, passed 100 tests.
  10853. 315.72 s [vector] munzip: OK
  10854. 315.72 s [vector] +++ OK, passed 100 tests.
  10855. 315.74 s [vector] applicative_pure: OK
  10856. 315.74 s [vector] +++ OK, passed 100 tests.
  10857. 315.77 s [vector] applicative_appl: OK (0.04s)
  10858. 315.77 s [vector] +++ OK, passed 100 tests.
  10859. 315.77 s [vector] alternative_empty: OK
  10860. 315.77 s [vector] +++ OK, passed 1 test.
  10861. 315.77 s [vector] alternative_or: OK
  10862. 315.78 s [vector] +++ OK, passed 100 tests.
  10863. 315.81 s [vector] sequence: OK (0.03s)
  10864. 315.81 s [vector] +++ OK, passed 100 tests.
  10865. 315.81 s [vector] sequence_: OK (0.01s)
  10866. 315.81 s [vector] +++ OK, passed 100 tests.
  10867. 315.81 s [vector] glength: OK
  10868. 315.81 s [vector] +++ OK, passed 100 tests.
  10869. 315.81 s [vector] sum: OK
  10870. 315.81 s [vector] +++ OK, passed 100 tests.
  10871. 315.81 s [vector] product: OK
  10872. 315.81 s [vector] +++ OK, passed 100 tests.
  10873. 315.81 s [vector] enumFromN: OK
  10874. 315.81 s [vector] +++ OK, passed 100 tests.
  10875. 315.81 s [vector] enumFromThenN: OK
  10876. 315.82 s [vector] +++ OK, passed 100 tests.
  10877. 315.82 s [vector] enumFromTo: OK
  10878. 315.82 s [vector] +++ OK, passed 100 tests.
  10879. 315.82 s [vector] enumFromThenTo: OK
  10880. 315.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10881. 315.82 s [vector] unstream
  10882. 315.82 s [vector] unstream == vunstream (exact): OK
  10883. 315.82 s [vector] +++ OK, passed 100 tests.
  10884. 315.82 s [vector] unstream == vunstream (unknown): OK
  10885. 315.82 s [vector] +++ OK, passed 100 tests.
  10886. 315.82 s [vector] unstreamR ~= vunstream (exact): OK
  10887. 315.82 s [vector] +++ OK, passed 100 tests.
  10888. 315.82 s [vector] unstreamR ~= vunstream (unknown): OK
  10889. 315.82 s [vector] +++ OK, passed 100 tests.
  10890. 315.82 s [vector] Tests.Vector.Unboxed
  10891. 315.82 s [vector] ()
  10892. 315.82 s [vector] fromList.toList == id: OK
  10893. 315.82 s [vector] +++ OK, passed 100 tests.
  10894. 315.82 s [vector] toList.fromList == id: OK
  10895. 315.82 s [vector] +++ OK, passed 100 tests.
  10896. 315.82 s [vector] unstream.stream == id: OK
  10897. 315.82 s [vector] +++ OK, passed 100 tests.
  10898. 315.82 s [vector] stream.unstream == id: OK
  10899. 315.82 s [vector] +++ OK, passed 100 tests.
  10900. 315.82 s [vector] eq: OK
  10901. 315.82 s [vector] +++ OK, passed 100 tests.
  10902. 315.82 s [vector] length: OK
  10903. 315.82 s [vector] +++ OK, passed 100 tests.
  10904. 315.82 s [vector] null: OK
  10905. 315.82 s [vector] +++ OK, passed 100 tests.
  10906. 315.82 s [vector] index: OK
  10907. 315.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10908. 315.82 s [vector] safeIndex: OK
  10909. 315.82 s [vector] +++ OK, passed 100 tests.
  10910. 315.82 s [vector] head: OK
  10911. 315.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10912. 315.82 s [vector] last: OK
  10913. 315.82 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10914. 315.82 s [vector] unsafeIndex: OK
  10915. 315.82 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10916. 315.82 s [vector] unsafeHead: OK
  10917. 315.82 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10918. 315.82 s [vector] unsafeLast: OK
  10919. 315.82 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10920. 315.82 s [vector] slice: OK
  10921. 315.83 s [vector] +++ OK, passed 100 tests.
  10922. 315.83 s [vector] init: OK
  10923. 315.83 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10924. 315.83 s [vector] tail: OK
  10925. 315.83 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10926. 315.83 s [vector] take: OK
  10927. 315.83 s [vector] +++ OK, passed 100 tests.
  10928. 315.83 s [vector] drop: OK
  10929. 315.83 s [vector] +++ OK, passed 100 tests.
  10930. 315.83 s [vector] splitAt: OK
  10931. 315.83 s [vector] +++ OK, passed 100 tests.
  10932. 315.83 s [vector] empty: OK
  10933. 315.83 s [vector] +++ OK, passed 1 test.
  10934. 315.83 s [vector] singleton: OK
  10935. 315.83 s [vector] +++ OK, passed 100 tests.
  10936. 315.83 s [vector] replicate: OK
  10937. 315.83 s [vector] +++ OK, passed 100 tests.
  10938. 315.83 s [vector] generate: OK
  10939. 315.83 s [vector] +++ OK, passed 100 tests.
  10940. 315.84 s [vector] iterateN: OK
  10941. 315.84 s [vector] +++ OK, passed 100 tests.
  10942. 315.86 s [vector] iterateNM: OK (0.02s)
  10943. 315.86 s [vector] +++ OK, passed 100 tests.
  10944. 315.86 s [vector] generateM: OK
  10945. 315.87 s [vector] +++ OK, passed 100 tests.
  10946. 315.87 s [vector] replicateM: OK
  10947. 315.87 s [vector] +++ OK, passed 100 tests.
  10948. 315.87 s [vector] create: OK
  10949. 315.87 s [vector] +++ OK, passed 100 tests.
  10950. 315.87 s [vector] createT: OK
  10951. 315.87 s [vector] +++ OK, passed 100 tests.
  10952. 315.87 s [vector] unfoldr: OK
  10953. 315.87 s [vector] +++ OK, passed 100 tests.
  10954. 315.87 s [vector] unfoldrN: OK
  10955. 315.87 s [vector] +++ OK, passed 100 tests.
  10956. 315.87 s [vector] unfoldrExactN: OK
  10957. 315.87 s [vector] +++ OK, passed 100 tests.
  10958. 315.87 s [vector] unfoldrM: OK
  10959. 315.87 s [vector] +++ OK, passed 100 tests.
  10960. 315.87 s [vector] unfoldrNM: OK
  10961. 315.88 s [vector] +++ OK, passed 100 tests.
  10962. 315.89 s [vector] unfoldrExactNM: OK (0.01s)
  10963. 315.89 s [vector] +++ OK, passed 100 tests.
  10964. 315.89 s [vector] constructN: OK
  10965. 315.89 s [vector] +++ OK, passed 100 tests.
  10966. 315.89 s [vector] constructrN: OK
  10967. 315.89 s [vector] +++ OK, passed 100 tests.
  10968. 315.89 s [vector] cons: OK
  10969. 315.89 s [vector] +++ OK, passed 100 tests.
  10970. 315.89 s [vector] snoc: OK
  10971. 315.89 s [vector] +++ OK, passed 100 tests.
  10972. 315.90 s [vector] append: OK
  10973. 315.90 s [vector] +++ OK, passed 100 tests.
  10974. 315.90 s [vector] concat: OK
  10975. 315.90 s [vector] +++ OK, passed 100 tests.
  10976. 315.90 s [vector] force: OK
  10977. 315.91 s [vector] +++ OK, passed 100 tests.
  10978. 315.91 s [vector] upd: OK
  10979. 315.91 s [vector] +++ OK, passed 100 tests.
  10980. 315.91 s [vector] accum: OK
  10981. 315.91 s [vector] +++ OK, passed 100 tests.
  10982. 315.91 s [vector] reverse: OK
  10983. 315.91 s [vector] +++ OK, passed 100 tests.
  10984. 315.91 s [vector] backpermute: OK
  10985. 315.91 s [vector] +++ OK, passed 100 tests.
  10986. 315.91 s [vector] map: OK
  10987. 315.91 s [vector] +++ OK, passed 100 tests.
  10988. 315.91 s [vector] imap: OK
  10989. 315.91 s [vector] +++ OK, passed 100 tests.
  10990. 315.91 s [vector] concatMap: OK
  10991. 315.91 s [vector] +++ OK, passed 100 tests.
  10992. 315.91 s [vector] mapM: OK
  10993. 315.92 s [vector] +++ OK, passed 100 tests.
  10994. 315.92 s [vector] mapM_: OK
  10995. 315.92 s [vector] +++ OK, passed 100 tests.
  10996. 315.92 s [vector] forM: OK
  10997. 315.93 s [vector] +++ OK, passed 100 tests.
  10998. 315.94 s [vector] forM_: OK (0.01s)
  10999. 315.94 s [vector] +++ OK, passed 100 tests.
  11000. 315.94 s [vector] imapM: OK
  11001. 315.94 s [vector] +++ OK, passed 100 tests.
  11002. 315.95 s [vector] imapM_: OK (0.01s)
  11003. 315.95 s [vector] +++ OK, passed 100 tests.
  11004. 315.95 s [vector] zipWith: OK
  11005. 315.95 s [vector] +++ OK, passed 100 tests.
  11006. 315.95 s [vector] zipWith3: OK
  11007. 315.95 s [vector] +++ OK, passed 100 tests.
  11008. 315.95 s [vector] izipWith: OK
  11009. 315.95 s [vector] +++ OK, passed 100 tests.
  11010. 315.95 s [vector] izipWith3: OK
  11011. 315.95 s [vector] +++ OK, passed 100 tests.
  11012. 315.95 s [vector] izipWithM: OK
  11013. 315.96 s [vector] +++ OK, passed 100 tests.
  11014. 315.96 s [vector] izipWithM_: OK
  11015. 315.96 s [vector] +++ OK, passed 100 tests.
  11016. 315.97 s [vector] zipWithM: OK
  11017. 315.97 s [vector] +++ OK, passed 100 tests.
  11018. 315.97 s [vector] zipWithM_: OK
  11019. 315.97 s [vector] +++ OK, passed 100 tests.
  11020. 315.97 s [vector] filter: OK
  11021. 315.97 s [vector] +++ OK, passed 100 tests.
  11022. 315.97 s [vector] ifilter: OK
  11023. 315.98 s [vector] +++ OK, passed 100 tests.
  11024. 315.98 s [vector] filterM: OK (0.01s)
  11025. 315.98 s [vector] +++ OK, passed 100 tests.
  11026. 315.98 s [vector] uniq: OK
  11027. 315.98 s [vector] +++ OK, passed 100 tests.
  11028. 315.98 s [vector] mapMaybe: OK
  11029. 315.99 s [vector] +++ OK, passed 100 tests.
  11030. 315.99 s [vector] imapMaybe: OK
  11031. 315.99 s [vector] +++ OK, passed 100 tests.
  11032. 315.99 s [vector] takeWhile: OK
  11033. 315.99 s [vector] +++ OK, passed 100 tests.
  11034. 315.99 s [vector] dropWhile: OK
  11035. 315.99 s [vector] +++ OK, passed 100 tests.
  11036. 315.99 s [vector] partition: OK
  11037. 315.99 s [vector] +++ OK, passed 100 tests.
  11038. 315.99 s [vector] partitionWith: OK
  11039. 315.99 s [vector] +++ OK, passed 100 tests.
  11040. 315.99 s [vector] span: OK
  11041. 315.99 s [vector] +++ OK, passed 100 tests.
  11042. 315.99 s [vector] break: OK
  11043. 315.99 s [vector] +++ OK, passed 100 tests.
  11044. 315.99 s [vector] spanR: OK
  11045. 315.99 s [vector] +++ OK, passed 100 tests.
  11046. 315.99 s [vector] breakR: OK
  11047. 315.99 s [vector] +++ OK, passed 100 tests.
  11048. 315.99 s [vector] groupBy: OK
  11049. 315.99 s [vector] +++ OK, passed 100 tests.
  11050. 315.99 s [vector] elem: OK
  11051. 315.99 s [vector] +++ OK, passed 100 tests.
  11052. 315.99 s [vector] notElem: OK
  11053. 315.99 s [vector] +++ OK, passed 100 tests.
  11054. 316.00 s [vector] find: OK
  11055. 316.00 s [vector] +++ OK, passed 100 tests.
  11056. 316.00 s [vector] findIndex: OK
  11057. 316.00 s [vector] +++ OK, passed 100 tests.
  11058. 316.00 s [vector] findIndexR: OK
  11059. 316.00 s [vector] +++ OK, passed 100 tests.
  11060. 316.00 s [vector] findIndices: OK
  11061. 316.00 s [vector] +++ OK, passed 100 tests.
  11062. 316.00 s [vector] elemIndex: OK
  11063. 316.00 s [vector] +++ OK, passed 100 tests.
  11064. 316.00 s [vector] elemIndices: OK
  11065. 316.00 s [vector] +++ OK, passed 100 tests.
  11066. 316.00 s [vector] foldl: OK
  11067. 316.00 s [vector] +++ OK, passed 100 tests.
  11068. 316.00 s [vector] foldl1: OK
  11069. 316.00 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11070. 316.00 s [vector] foldl': OK
  11071. 316.00 s [vector] +++ OK, passed 100 tests.
  11072. 316.00 s [vector] foldl1': OK
  11073. 316.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11074. 316.00 s [vector] foldr: OK
  11075. 316.00 s [vector] +++ OK, passed 100 tests.
  11076. 316.00 s [vector] foldr1: OK
  11077. 316.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11078. 316.00 s [vector] foldr': OK
  11079. 316.00 s [vector] +++ OK, passed 100 tests.
  11080. 316.00 s [vector] foldr1': OK
  11081. 316.00 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11082. 316.00 s [vector] ifoldl: OK
  11083. 316.00 s [vector] +++ OK, passed 100 tests.
  11084. 316.00 s [vector] ifoldl': OK
  11085. 316.00 s [vector] +++ OK, passed 100 tests.
  11086. 316.00 s [vector] ifoldr: OK
  11087. 316.00 s [vector] +++ OK, passed 100 tests.
  11088. 316.00 s [vector] ifoldr': OK
  11089. 316.00 s [vector] +++ OK, passed 100 tests.
  11090. 316.00 s [vector] ifoldM: OK
  11091. 316.01 s [vector] +++ OK, passed 100 tests.
  11092. 316.01 s [vector] ifoldM': OK
  11093. 316.01 s [vector] +++ OK, passed 100 tests.
  11094. 316.02 s [vector] ifoldM_: OK
  11095. 316.02 s [vector] +++ OK, passed 100 tests.
  11096. 316.02 s [vector] ifoldM'_: OK
  11097. 316.02 s [vector] +++ OK, passed 100 tests.
  11098. 316.02 s [vector] all: OK
  11099. 316.02 s [vector] +++ OK, passed 100 tests.
  11100. 316.02 s [vector] any: OK
  11101. 316.02 s [vector] +++ OK, passed 100 tests.
  11102. 316.02 s [vector] prescanl: OK
  11103. 316.02 s [vector] +++ OK, passed 100 tests.
  11104. 316.03 s [vector] prescanl': OK
  11105. 316.03 s [vector] +++ OK, passed 100 tests.
  11106. 316.03 s [vector] postscanl: OK
  11107. 316.03 s [vector] +++ OK, passed 100 tests.
  11108. 316.03 s [vector] postscanl': OK
  11109. 316.03 s [vector] +++ OK, passed 100 tests.
  11110. 316.03 s [vector] scanl: OK
  11111. 316.03 s [vector] +++ OK, passed 100 tests.
  11112. 316.03 s [vector] scanl': OK
  11113. 316.03 s [vector] +++ OK, passed 100 tests.
  11114. 316.03 s [vector] scanl1: OK
  11115. 316.03 s [vector] +++ OK, passed 100 tests.
  11116. 316.03 s [vector] scanl1': OK
  11117. 316.03 s [vector] +++ OK, passed 100 tests.
  11118. 316.03 s [vector] iscanl: OK
  11119. 316.03 s [vector] +++ OK, passed 100 tests.
  11120. 316.03 s [vector] iscanl': OK
  11121. 316.03 s [vector] +++ OK, passed 100 tests.
  11122. 316.03 s [vector] prescanr: OK
  11123. 316.03 s [vector] +++ OK, passed 100 tests.
  11124. 316.03 s [vector] prescanr': OK
  11125. 316.03 s [vector] +++ OK, passed 100 tests.
  11126. 316.04 s [vector] postscanr: OK
  11127. 316.04 s [vector] +++ OK, passed 100 tests.
  11128. 316.04 s [vector] postscanr': OK
  11129. 316.04 s [vector] +++ OK, passed 100 tests.
  11130. 316.04 s [vector] scanr: OK
  11131. 316.04 s [vector] +++ OK, passed 100 tests.
  11132. 316.04 s [vector] scanr': OK
  11133. 316.04 s [vector] +++ OK, passed 100 tests.
  11134. 316.04 s [vector] scanr1: OK
  11135. 316.04 s [vector] +++ OK, passed 100 tests.
  11136. 316.04 s [vector] scanr1': OK
  11137. 316.04 s [vector] +++ OK, passed 100 tests.
  11138. 316.04 s [vector] iscanr: OK
  11139. 316.04 s [vector] +++ OK, passed 100 tests.
  11140. 316.04 s [vector] iscanr': OK
  11141. 316.04 s [vector] +++ OK, passed 100 tests.
  11142. 316.04 s [vector] mut_read: OK
  11143. 316.04 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11144. 316.04 s [vector] mut_write: OK
  11145. 316.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11146. 316.04 s [vector] mut_modify: OK
  11147. 316.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11148. 316.04 s [vector] mut_generate: OK
  11149. 316.05 s [vector] +++ OK, passed 100 tests.
  11150. 316.05 s [vector] mut_generateM: OK
  11151. 316.06 s [vector] +++ OK, passed 100 tests.
  11152. 316.06 s [vector] mut_mapM_: OK
  11153. 316.06 s [vector] +++ OK, passed 100 tests.
  11154. 316.07 s [vector] mut_imapM_: OK
  11155. 316.07 s [vector] +++ OK, passed 100 tests.
  11156. 316.07 s [vector] mut_forM_: OK
  11157. 316.07 s [vector] +++ OK, passed 100 tests.
  11158. 316.08 s [vector] mut_iforM_: OK
  11159. 316.08 s [vector] +++ OK, passed 100 tests.
  11160. 316.08 s [vector] mut_foldr: OK
  11161. 316.08 s [vector] +++ OK, passed 100 tests.
  11162. 316.08 s [vector] mut_foldr': OK
  11163. 316.08 s [vector] +++ OK, passed 100 tests.
  11164. 316.08 s [vector] mut_foldl: OK
  11165. 316.08 s [vector] +++ OK, passed 100 tests.
  11166. 316.08 s [vector] mut_foldl': OK
  11167. 316.08 s [vector] +++ OK, passed 100 tests.
  11168. 316.08 s [vector] mut_ifoldr: OK
  11169. 316.08 s [vector] +++ OK, passed 100 tests.
  11170. 316.08 s [vector] mut_ifoldr': OK
  11171. 316.08 s [vector] +++ OK, passed 100 tests.
  11172. 316.08 s [vector] mut_ifoldl: OK
  11173. 316.09 s [vector] +++ OK, passed 100 tests.
  11174. 316.09 s [vector] mut_ifoldl': OK
  11175. 316.09 s [vector] +++ OK, passed 100 tests.
  11176. 316.09 s [vector] mut_foldM: OK
  11177. 316.09 s [vector] +++ OK, passed 100 tests.
  11178. 316.09 s [vector] mut_foldM': OK
  11179. 316.09 s [vector] +++ OK, passed 100 tests.
  11180. 316.09 s [vector] mut_foldrM: OK
  11181. 316.09 s [vector] +++ OK, passed 100 tests.
  11182. 316.09 s [vector] mut_foldrM': OK
  11183. 316.09 s [vector] +++ OK, passed 100 tests.
  11184. 316.09 s [vector] mut_ifoldM: OK
  11185. 316.09 s [vector] +++ OK, passed 100 tests.
  11186. 316.09 s [vector] mut_ifoldM': OK
  11187. 316.09 s [vector] +++ OK, passed 100 tests.
  11188. 316.09 s [vector] mut_ifoldrM: OK
  11189. 316.09 s [vector] +++ OK, passed 100 tests.
  11190. 316.09 s [vector] mut_ifoldrM': OK
  11191. 316.09 s [vector] +++ OK, passed 100 tests.
  11192. 316.09 s [vector] compare: OK
  11193. 316.09 s [vector] +++ OK, passed 100 tests.
  11194. 316.09 s [vector] maximum: OK
  11195. 316.09 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11196. 316.09 s [vector] minimum: OK
  11197. 316.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11198. 316.09 s [vector] minIndex: OK
  11199. 316.09 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11200. 316.09 s [vector] maxIndex: OK
  11201. 316.09 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11202. 316.09 s [vector] maximumBy: OK
  11203. 316.09 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11204. 316.09 s [vector] minimumBy: OK
  11205. 316.09 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11206. 316.09 s [vector] maximumOn: OK
  11207. 316.09 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11208. 316.09 s [vector] minimumOn: OK
  11209. 316.09 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11210. 316.09 s [vector] maxIndexBy: OK
  11211. 316.10 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11212. 316.10 s [vector] minIndexBy: OK
  11213. 316.10 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11214. 316.10 s [vector] ListFirstMaxIndexWins: OK
  11215. 316.10 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11216. 316.10 s [vector] FalseListFirstMaxIndexWins: OK
  11217. 316.10 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  11218. 316.10 s [vector] []
  11219. 316.10 s [vector] zip: OK
  11220. 316.10 s [vector] +++ OK, passed 100 tests.
  11221. 316.10 s [vector] zip3: OK
  11222. 316.10 s [vector] +++ OK, passed 100 tests.
  11223. 316.10 s [vector] unzip: OK
  11224. 316.10 s [vector] +++ OK, passed 100 tests.
  11225. 316.10 s [vector] unzip3: OK
  11226. 316.10 s [vector] +++ OK, passed 100 tests.
  11227. 316.10 s [vector] indexed: OK
  11228. 316.10 s [vector] +++ OK, passed 100 tests.
  11229. 316.10 s [vector] update: OK
  11230. 316.10 s [vector] +++ OK, passed 100 tests.
  11231. 316.10 s [vector] mempty: OK
  11232. 316.10 s [vector] +++ OK, passed 1 test.
  11233. 316.10 s [vector] mappend: OK
  11234. 316.12 s [vector] +++ OK, passed 100 tests.
  11235. 316.12 s [vector] mconcat: OK (0.01s)
  11236. 316.12 s [vector] +++ OK, passed 100 tests.
  11237. 316.12 s [vector] glength: OK
  11238. 316.12 s [vector] +++ OK, passed 100 tests.
  11239. 316.12 s [vector] (Bool)
  11240. 316.12 s [vector] fromList.toList == id: OK
  11241. 316.12 s [vector] +++ OK, passed 100 tests.
  11242. 316.12 s [vector] toList.fromList == id: OK
  11243. 316.12 s [vector] +++ OK, passed 100 tests.
  11244. 316.12 s [vector] unstream.stream == id: OK
  11245. 316.12 s [vector] +++ OK, passed 100 tests.
  11246. 316.12 s [vector] stream.unstream == id: OK
  11247. 316.12 s [vector] +++ OK, passed 100 tests.
  11248. 316.12 s [vector] eq: OK
  11249. 316.12 s [vector] +++ OK, passed 100 tests.
  11250. 316.12 s [vector] length: OK
  11251. 316.12 s [vector] +++ OK, passed 100 tests.
  11252. 316.12 s [vector] null: OK
  11253. 316.12 s [vector] +++ OK, passed 100 tests.
  11254. 316.12 s [vector] index: OK
  11255. 316.12 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11256. 316.12 s [vector] safeIndex: OK
  11257. 316.12 s [vector] +++ OK, passed 100 tests.
  11258. 316.12 s [vector] head: OK
  11259. 316.12 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11260. 316.12 s [vector] last: OK
  11261. 316.12 s [vector] +++ OK, passed 100 tests; 25 discarded.
  11262. 316.12 s [vector] unsafeIndex: OK
  11263. 316.12 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11264. 316.13 s [vector] unsafeHead: OK
  11265. 316.13 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11266. 316.13 s [vector] unsafeLast: OK
  11267. 316.13 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11268. 316.13 s [vector] slice: OK
  11269. 316.13 s [vector] +++ OK, passed 100 tests.
  11270. 316.13 s [vector] init: OK
  11271. 316.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11272. 316.13 s [vector] tail: OK
  11273. 316.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11274. 316.13 s [vector] take: OK
  11275. 316.13 s [vector] +++ OK, passed 100 tests.
  11276. 316.13 s [vector] drop: OK
  11277. 316.13 s [vector] +++ OK, passed 100 tests.
  11278. 316.13 s [vector] splitAt: OK
  11279. 316.13 s [vector] +++ OK, passed 100 tests.
  11280. 316.13 s [vector] empty: OK
  11281. 316.13 s [vector] +++ OK, passed 1 test.
  11282. 316.13 s [vector] singleton: OK
  11283. 316.13 s [vector] +++ OK, passed 100 tests.
  11284. 316.13 s [vector] replicate: OK
  11285. 316.13 s [vector] +++ OK, passed 100 tests.
  11286. 316.13 s [vector] generate: OK
  11287. 316.13 s [vector] +++ OK, passed 100 tests.
  11288. 316.13 s [vector] iterateN: OK
  11289. 316.15 s [vector] +++ OK, passed 100 tests.
  11290. 316.17 s [vector] iterateNM: OK (0.02s)
  11291. 316.17 s [vector] +++ OK, passed 100 tests.
  11292. 316.17 s [vector] generateM: OK (0.01s)
  11293. 316.17 s [vector] +++ OK, passed 100 tests.
  11294. 316.17 s [vector] replicateM: OK
  11295. 316.17 s [vector] +++ OK, passed 100 tests.
  11296. 316.17 s [vector] create: OK
  11297. 316.17 s [vector] +++ OK, passed 100 tests.
  11298. 316.17 s [vector] createT: OK
  11299. 316.17 s [vector] +++ OK, passed 100 tests.
  11300. 316.17 s [vector] unfoldr: OK
  11301. 316.18 s [vector] +++ OK, passed 100 tests.
  11302. 316.18 s [vector] unfoldrN: OK
  11303. 316.18 s [vector] +++ OK, passed 100 tests.
  11304. 316.18 s [vector] unfoldrExactN: OK
  11305. 316.18 s [vector] +++ OK, passed 100 tests.
  11306. 316.18 s [vector] unfoldrM: OK
  11307. 316.18 s [vector] +++ OK, passed 100 tests.
  11308. 316.19 s [vector] unfoldrNM: OK
  11309. 316.19 s [vector] +++ OK, passed 100 tests.
  11310. 316.20 s [vector] unfoldrExactNM: OK (0.01s)
  11311. 316.20 s [vector] +++ OK, passed 100 tests.
  11312. 316.20 s [vector] constructN: OK
  11313. 316.20 s [vector] +++ OK, passed 100 tests.
  11314. 316.21 s [vector] constructrN: OK
  11315. 316.21 s [vector] +++ OK, passed 100 tests.
  11316. 316.21 s [vector] cons: OK
  11317. 316.21 s [vector] +++ OK, passed 100 tests.
  11318. 316.21 s [vector] snoc: OK
  11319. 316.22 s [vector] +++ OK, passed 100 tests.
  11320. 316.22 s [vector] append: OK
  11321. 316.22 s [vector] +++ OK, passed 100 tests.
  11322. 316.23 s [vector] concat: OK
  11323. 316.23 s [vector] +++ OK, passed 100 tests.
  11324. 316.23 s [vector] force: OK
  11325. 316.23 s [vector] +++ OK, passed 100 tests.
  11326. 316.23 s [vector] upd: OK
  11327. 316.23 s [vector] +++ OK, passed 100 tests.
  11328. 316.23 s [vector] accum: OK
  11329. 316.23 s [vector] +++ OK, passed 100 tests.
  11330. 316.23 s [vector] reverse: OK
  11331. 316.24 s [vector] +++ OK, passed 100 tests.
  11332. 316.24 s [vector] backpermute: OK
  11333. 316.24 s [vector] +++ OK, passed 100 tests.
  11334. 316.24 s [vector] map: OK
  11335. 316.24 s [vector] +++ OK, passed 100 tests.
  11336. 316.24 s [vector] imap: OK
  11337. 316.24 s [vector] +++ OK, passed 100 tests.
  11338. 316.24 s [vector] concatMap: OK
  11339. 316.24 s [vector] +++ OK, passed 100 tests.
  11340. 316.24 s [vector] mapM: OK
  11341. 316.25 s [vector] +++ OK, passed 100 tests.
  11342. 316.25 s [vector] mapM_: OK (0.01s)
  11343. 316.25 s [vector] +++ OK, passed 100 tests.
  11344. 316.25 s [vector] forM: OK
  11345. 316.27 s [vector] +++ OK, passed 100 tests.
  11346. 316.27 s [vector] forM_: OK (0.01s)
  11347. 316.27 s [vector] +++ OK, passed 100 tests.
  11348. 316.27 s [vector] imapM: OK
  11349. 316.28 s [vector] +++ OK, passed 100 tests.
  11350. 316.29 s [vector] imapM_: OK (0.01s)
  11351. 316.29 s [vector] +++ OK, passed 100 tests.
  11352. 316.29 s [vector] zipWith: OK
  11353. 316.29 s [vector] +++ OK, passed 100 tests.
  11354. 316.29 s [vector] zipWith3: OK
  11355. 316.29 s [vector] +++ OK, passed 100 tests.
  11356. 316.29 s [vector] izipWith: OK
  11357. 316.29 s [vector] +++ OK, passed 100 tests.
  11358. 316.29 s [vector] izipWith3: OK
  11359. 316.29 s [vector] +++ OK, passed 100 tests.
  11360. 316.31 s [vector] izipWithM: OK
  11361. 316.31 s [vector] +++ OK, passed 100 tests.
  11362. 316.32 s [vector] izipWithM_: OK (0.02s)
  11363. 316.32 s [vector] +++ OK, passed 100 tests.
  11364. 316.33 s [vector] zipWithM: OK
  11365. 316.33 s [vector] +++ OK, passed 100 tests.
  11366. 316.33 s [vector] zipWithM_: OK (0.01s)
  11367. 316.33 s [vector] +++ OK, passed 100 tests.
  11368. 316.33 s [vector] filter: OK
  11369. 316.33 s [vector] +++ OK, passed 100 tests.
  11370. 316.35 s [vector] ifilter: OK
  11371. 316.35 s [vector] +++ OK, passed 100 tests.
  11372. 316.37 s [vector] filterM: OK (0.03s)
  11373. 316.37 s [vector] +++ OK, passed 100 tests.
  11374. 316.37 s [vector] uniq: OK
  11375. 316.37 s [vector] +++ OK, passed 100 tests.
  11376. 316.37 s [vector] mapMaybe: OK
  11377. 316.37 s [vector] +++ OK, passed 100 tests.
  11378. 316.37 s [vector] imapMaybe: OK
  11379. 316.37 s [vector] +++ OK, passed 100 tests.
  11380. 316.37 s [vector] takeWhile: OK
  11381. 316.37 s [vector] +++ OK, passed 100 tests.
  11382. 316.37 s [vector] dropWhile: OK
  11383. 316.37 s [vector] +++ OK, passed 100 tests.
  11384. 316.38 s [vector] partition: OK
  11385. 316.38 s [vector] +++ OK, passed 100 tests.
  11386. 316.38 s [vector] partitionWith: OK
  11387. 316.38 s [vector] +++ OK, passed 100 tests.
  11388. 316.38 s [vector] span: OK
  11389. 316.38 s [vector] +++ OK, passed 100 tests.
  11390. 316.38 s [vector] break: OK
  11391. 316.38 s [vector] +++ OK, passed 100 tests.
  11392. 316.38 s [vector] spanR: OK
  11393. 316.38 s [vector] +++ OK, passed 100 tests.
  11394. 316.38 s [vector] breakR: OK
  11395. 316.38 s [vector] +++ OK, passed 100 tests.
  11396. 316.38 s [vector] groupBy: OK
  11397. 316.38 s [vector] +++ OK, passed 100 tests.
  11398. 316.38 s [vector] elem: OK
  11399. 316.38 s [vector] +++ OK, passed 100 tests.
  11400. 316.38 s [vector] notElem: OK
  11401. 316.38 s [vector] +++ OK, passed 100 tests.
  11402. 316.38 s [vector] find: OK
  11403. 316.38 s [vector] +++ OK, passed 100 tests.
  11404. 316.38 s [vector] findIndex: OK
  11405. 316.38 s [vector] +++ OK, passed 100 tests.
  11406. 316.38 s [vector] findIndexR: OK
  11407. 316.38 s [vector] +++ OK, passed 100 tests.
  11408. 316.38 s [vector] findIndices: OK
  11409. 316.38 s [vector] +++ OK, passed 100 tests.
  11410. 316.39 s [vector] elemIndex: OK
  11411. 316.39 s [vector] +++ OK, passed 100 tests.
  11412. 316.39 s [vector] elemIndices: OK
  11413. 316.39 s [vector] +++ OK, passed 100 tests.
  11414. 316.39 s [vector] foldl: OK
  11415. 316.39 s [vector] +++ OK, passed 100 tests.
  11416. 316.39 s [vector] foldl1: OK
  11417. 316.39 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11418. 316.39 s [vector] foldl': OK
  11419. 316.39 s [vector] +++ OK, passed 100 tests.
  11420. 316.39 s [vector] foldl1': OK
  11421. 316.39 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11422. 316.39 s [vector] foldr: OK
  11423. 316.39 s [vector] +++ OK, passed 100 tests.
  11424. 316.40 s [vector] foldr1: OK
  11425. 316.40 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11426. 316.40 s [vector] foldr': OK
  11427. 316.40 s [vector] +++ OK, passed 100 tests.
  11428. 316.40 s [vector] foldr1': OK
  11429. 316.40 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11430. 316.40 s [vector] ifoldl: OK
  11431. 316.40 s [vector] +++ OK, passed 100 tests.
  11432. 316.40 s [vector] ifoldl': OK
  11433. 316.41 s [vector] +++ OK, passed 100 tests.
  11434. 316.41 s [vector] ifoldr: OK
  11435. 316.41 s [vector] +++ OK, passed 100 tests.
  11436. 316.41 s [vector] ifoldr': OK
  11437. 316.41 s [vector] +++ OK, passed 100 tests.
  11438. 316.41 s [vector] ifoldM: OK
  11439. 316.41 s [vector] +++ OK, passed 100 tests.
  11440. 316.41 s [vector] ifoldM': OK
  11441. 316.41 s [vector] +++ OK, passed 100 tests.
  11442. 316.43 s [vector] ifoldM_: OK (0.01s)
  11443. 316.43 s [vector] +++ OK, passed 100 tests.
  11444. 316.43 s [vector] ifoldM'_: OK
  11445. 316.43 s [vector] +++ OK, passed 100 tests.
  11446. 316.43 s [vector] all: OK
  11447. 316.43 s [vector] +++ OK, passed 100 tests.
  11448. 316.43 s [vector] any: OK
  11449. 316.43 s [vector] +++ OK, passed 100 tests.
  11450. 316.43 s [vector] prescanl: OK
  11451. 316.43 s [vector] +++ OK, passed 100 tests.
  11452. 316.44 s [vector] prescanl': OK
  11453. 316.44 s [vector] +++ OK, passed 100 tests.
  11454. 316.44 s [vector] postscanl: OK
  11455. 316.44 s [vector] +++ OK, passed 100 tests.
  11456. 316.44 s [vector] postscanl': OK
  11457. 316.44 s [vector] +++ OK, passed 100 tests.
  11458. 316.44 s [vector] scanl: OK
  11459. 316.44 s [vector] +++ OK, passed 100 tests.
  11460. 316.44 s [vector] scanl': OK
  11461. 316.44 s [vector] +++ OK, passed 100 tests.
  11462. 316.44 s [vector] scanl1: OK
  11463. 316.44 s [vector] +++ OK, passed 100 tests.
  11464. 316.44 s [vector] scanl1': OK
  11465. 316.45 s [vector] +++ OK, passed 100 tests.
  11466. 316.45 s [vector] iscanl: OK
  11467. 316.45 s [vector] +++ OK, passed 100 tests.
  11468. 316.45 s [vector] iscanl': OK
  11469. 316.45 s [vector] +++ OK, passed 100 tests.
  11470. 316.45 s [vector] prescanr: OK
  11471. 316.45 s [vector] +++ OK, passed 100 tests.
  11472. 316.45 s [vector] prescanr': OK
  11473. 316.45 s [vector] +++ OK, passed 100 tests.
  11474. 316.46 s [vector] postscanr: OK
  11475. 316.46 s [vector] +++ OK, passed 100 tests.
  11476. 316.46 s [vector] postscanr': OK
  11477. 316.46 s [vector] +++ OK, passed 100 tests.
  11478. 316.46 s [vector] scanr: OK
  11479. 316.46 s [vector] +++ OK, passed 100 tests.
  11480. 316.46 s [vector] scanr': OK
  11481. 316.46 s [vector] +++ OK, passed 100 tests.
  11482. 316.46 s [vector] scanr1: OK
  11483. 316.46 s [vector] +++ OK, passed 100 tests.
  11484. 316.46 s [vector] scanr1': OK
  11485. 316.46 s [vector] +++ OK, passed 100 tests.
  11486. 316.47 s [vector] iscanr: OK
  11487. 316.47 s [vector] +++ OK, passed 100 tests.
  11488. 316.47 s [vector] iscanr': OK
  11489. 316.47 s [vector] +++ OK, passed 100 tests.
  11490. 316.47 s [vector] mut_read: OK
  11491. 316.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11492. 316.47 s [vector] mut_write: OK
  11493. 316.47 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11494. 316.47 s [vector] mut_modify: OK
  11495. 316.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11496. 316.48 s [vector] mut_generate: OK
  11497. 316.48 s [vector] +++ OK, passed 100 tests.
  11498. 316.48 s [vector] mut_generateM: OK
  11499. 316.49 s [vector] +++ OK, passed 100 tests.
  11500. 316.50 s [vector] mut_mapM_: OK (0.01s)
  11501. 316.50 s [vector] +++ OK, passed 100 tests.
  11502. 316.50 s [vector] mut_imapM_: OK (0.01s)
  11503. 316.50 s [vector] +++ OK, passed 100 tests.
  11504. 316.53 s [vector] mut_forM_: OK (0.01s)
  11505. 316.53 s [vector] +++ OK, passed 100 tests.
  11506. 316.53 s [vector] mut_iforM_: OK (0.02s)
  11507. 316.53 s [vector] +++ OK, passed 100 tests.
  11508. 316.53 s [vector] mut_foldr: OK
  11509. 316.53 s [vector] +++ OK, passed 100 tests.
  11510. 316.53 s [vector] mut_foldr': OK
  11511. 316.53 s [vector] +++ OK, passed 100 tests.
  11512. 316.53 s [vector] mut_foldl: OK
  11513. 316.53 s [vector] +++ OK, passed 100 tests.
  11514. 316.54 s [vector] mut_foldl': OK
  11515. 316.54 s [vector] +++ OK, passed 100 tests.
  11516. 316.54 s [vector] mut_ifoldr: OK
  11517. 316.54 s [vector] +++ OK, passed 100 tests.
  11518. 316.54 s [vector] mut_ifoldr': OK
  11519. 316.54 s [vector] +++ OK, passed 100 tests.
  11520. 316.54 s [vector] mut_ifoldl: OK
  11521. 316.54 s [vector] +++ OK, passed 100 tests.
  11522. 316.54 s [vector] mut_ifoldl': OK
  11523. 316.54 s [vector] +++ OK, passed 100 tests.
  11524. 316.54 s [vector] mut_foldM: OK
  11525. 316.55 s [vector] +++ OK, passed 100 tests.
  11526. 316.55 s [vector] mut_foldM': OK
  11527. 316.55 s [vector] +++ OK, passed 100 tests.
  11528. 316.55 s [vector] mut_foldrM: OK
  11529. 316.55 s [vector] +++ OK, passed 100 tests.
  11530. 316.55 s [vector] mut_foldrM': OK
  11531. 316.55 s [vector] +++ OK, passed 100 tests.
  11532. 316.55 s [vector] mut_ifoldM: OK
  11533. 316.55 s [vector] +++ OK, passed 100 tests.
  11534. 316.55 s [vector] mut_ifoldM': OK
  11535. 316.56 s [vector] +++ OK, passed 100 tests.
  11536. 316.56 s [vector] mut_ifoldrM: OK
  11537. 316.56 s [vector] +++ OK, passed 100 tests.
  11538. 316.56 s [vector] mut_ifoldrM': OK
  11539. 316.56 s [vector] +++ OK, passed 100 tests.
  11540. 316.56 s [vector] compare: OK
  11541. 316.56 s [vector] +++ OK, passed 100 tests.
  11542. 316.56 s [vector] maximum: OK
  11543. 316.56 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11544. 316.56 s [vector] minimum: OK
  11545. 316.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11546. 316.56 s [vector] minIndex: OK
  11547. 316.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11548. 316.56 s [vector] maxIndex: OK
  11549. 316.56 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11550. 316.56 s [vector] maximumBy: OK
  11551. 316.56 s [vector] +++ OK, passed 100 tests; 27 discarded.
  11552. 316.56 s [vector] minimumBy: OK
  11553. 316.56 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11554. 316.56 s [vector] maximumOn: OK
  11555. 316.56 s [vector] +++ OK, passed 100 tests; 24 discarded.
  11556. 316.56 s [vector] minimumOn: OK
  11557. 316.56 s [vector] +++ OK, passed 100 tests; 26 discarded.
  11558. 316.56 s [vector] maxIndexBy: OK
  11559. 316.56 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11560. 316.57 s [vector] minIndexBy: OK
  11561. 316.57 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11562. 316.57 s [vector] ListFirstMaxIndexWins: OK
  11563. 316.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11564. 316.57 s [vector] FalseListFirstMaxIndexWins: OK
  11565. 316.57 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  11566. 316.57 s [vector] []
  11567. 316.57 s [vector] zip: OK
  11568. 316.57 s [vector] +++ OK, passed 100 tests.
  11569. 316.57 s [vector] zip3: OK
  11570. 316.57 s [vector] +++ OK, passed 100 tests.
  11571. 316.57 s [vector] unzip: OK
  11572. 316.57 s [vector] +++ OK, passed 100 tests.
  11573. 316.58 s [vector] unzip3: OK
  11574. 316.58 s [vector] +++ OK, passed 100 tests.
  11575. 316.58 s [vector] indexed: OK
  11576. 316.58 s [vector] +++ OK, passed 100 tests.
  11577. 316.58 s [vector] update: OK
  11578. 316.58 s [vector] +++ OK, passed 100 tests.
  11579. 316.58 s [vector] mempty: OK
  11580. 316.58 s [vector] +++ OK, passed 1 test.
  11581. 316.59 s [vector] mappend: OK
  11582. 316.59 s [vector] +++ OK, passed 100 tests.
  11583. 316.60 s [vector] mconcat: OK (0.02s)
  11584. 316.60 s [vector] +++ OK, passed 100 tests.
  11585. 316.60 s [vector] glength: OK
  11586. 316.60 s [vector] +++ OK, passed 100 tests.
  11587. 316.60 s [vector] and: OK
  11588. 316.60 s [vector] +++ OK, passed 100 tests.
  11589. 316.60 s [vector] or: OK
  11590. 316.60 s [vector] +++ OK, passed 100 tests.
  11591. 316.60 s [vector] (Int)
  11592. 316.60 s [vector] fromList.toList == id: OK
  11593. 316.60 s [vector] +++ OK, passed 100 tests.
  11594. 316.60 s [vector] toList.fromList == id: OK
  11595. 316.60 s [vector] +++ OK, passed 100 tests.
  11596. 316.60 s [vector] unstream.stream == id: OK
  11597. 316.60 s [vector] +++ OK, passed 100 tests.
  11598. 316.60 s [vector] stream.unstream == id: OK
  11599. 316.60 s [vector] +++ OK, passed 100 tests.
  11600. 316.60 s [vector] eq: OK
  11601. 316.60 s [vector] +++ OK, passed 100 tests.
  11602. 316.60 s [vector] length: OK
  11603. 316.60 s [vector] +++ OK, passed 100 tests.
  11604. 316.60 s [vector] null: OK
  11605. 316.60 s [vector] +++ OK, passed 100 tests.
  11606. 316.60 s [vector] index: OK
  11607. 316.60 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11608. 316.60 s [vector] safeIndex: OK
  11609. 316.61 s [vector] +++ OK, passed 100 tests.
  11610. 316.61 s [vector] head: OK
  11611. 316.61 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11612. 316.61 s [vector] last: OK
  11613. 316.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11614. 316.61 s [vector] unsafeIndex: OK
  11615. 316.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11616. 316.61 s [vector] unsafeHead: OK
  11617. 316.61 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11618. 316.61 s [vector] unsafeLast: OK
  11619. 316.61 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11620. 316.61 s [vector] slice: OK
  11621. 316.61 s [vector] +++ OK, passed 100 tests.
  11622. 316.61 s [vector] init: OK
  11623. 316.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11624. 316.61 s [vector] tail: OK
  11625. 316.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11626. 316.61 s [vector] take: OK
  11627. 316.61 s [vector] +++ OK, passed 100 tests.
  11628. 316.61 s [vector] drop: OK
  11629. 316.61 s [vector] +++ OK, passed 100 tests.
  11630. 316.61 s [vector] splitAt: OK
  11631. 316.61 s [vector] +++ OK, passed 100 tests.
  11632. 316.61 s [vector] empty: OK
  11633. 316.61 s [vector] +++ OK, passed 1 test.
  11634. 316.61 s [vector] singleton: OK
  11635. 316.61 s [vector] +++ OK, passed 100 tests.
  11636. 316.61 s [vector] replicate: OK
  11637. 316.61 s [vector] +++ OK, passed 100 tests.
  11638. 316.61 s [vector] generate: OK
  11639. 316.61 s [vector] +++ OK, passed 100 tests.
  11640. 316.61 s [vector] iterateN: OK
  11641. 316.61 s [vector] +++ OK, passed 100 tests.
  11642. 316.65 s [vector] iterateNM: OK (0.02s)
  11643. 316.65 s [vector] +++ OK, passed 100 tests.
  11644. 316.66 s [vector] generateM: OK (0.02s)
  11645. 316.66 s [vector] +++ OK, passed 100 tests.
  11646. 316.66 s [vector] replicateM: OK (0.01s)
  11647. 316.66 s [vector] +++ OK, passed 100 tests.
  11648. 316.66 s [vector] create: OK
  11649. 316.66 s [vector] +++ OK, passed 100 tests.
  11650. 316.66 s [vector] createT: OK
  11651. 316.66 s [vector] +++ OK, passed 100 tests.
  11652. 316.66 s [vector] unfoldr: OK
  11653. 316.66 s [vector] +++ OK, passed 100 tests.
  11654. 316.66 s [vector] unfoldrN: OK
  11655. 316.66 s [vector] +++ OK, passed 100 tests.
  11656. 316.66 s [vector] unfoldrExactN: OK
  11657. 316.67 s [vector] +++ OK, passed 100 tests.
  11658. 316.67 s [vector] unfoldrM: OK
  11659. 316.67 s [vector] +++ OK, passed 100 tests.
  11660. 316.67 s [vector] unfoldrNM: OK
  11661. 316.69 s [vector] +++ OK, passed 100 tests.
  11662. 316.70 s [vector] unfoldrExactNM: OK (0.02s)
  11663. 316.70 s [vector] +++ OK, passed 100 tests.
  11664. 316.70 s [vector] constructN: OK
  11665. 316.70 s [vector] +++ OK, passed 100 tests.
  11666. 316.70 s [vector] constructrN: OK
  11667. 316.70 s [vector] +++ OK, passed 100 tests.
  11668. 316.70 s [vector] cons: OK
  11669. 316.70 s [vector] +++ OK, passed 100 tests.
  11670. 316.70 s [vector] snoc: OK
  11671. 316.70 s [vector] +++ OK, passed 100 tests.
  11672. 316.71 s [vector] append: OK
  11673. 316.71 s [vector] +++ OK, passed 100 tests.
  11674. 316.72 s [vector] concat: OK (0.02s)
  11675. 316.72 s [vector] +++ OK, passed 100 tests.
  11676. 316.72 s [vector] force: OK
  11677. 316.72 s [vector] +++ OK, passed 100 tests.
  11678. 316.73 s [vector] upd: OK
  11679. 316.73 s [vector] +++ OK, passed 100 tests.
  11680. 316.73 s [vector] accum: OK
  11681. 316.73 s [vector] +++ OK, passed 100 tests.
  11682. 316.73 s [vector] reverse: OK
  11683. 316.73 s [vector] +++ OK, passed 100 tests.
  11684. 316.73 s [vector] backpermute: OK
  11685. 316.73 s [vector] +++ OK, passed 100 tests.
  11686. 316.73 s [vector] map: OK
  11687. 316.73 s [vector] +++ OK, passed 100 tests.
  11688. 316.74 s [vector] imap: OK
  11689. 316.74 s [vector] +++ OK, passed 100 tests.
  11690. 316.74 s [vector] concatMap: OK
  11691. 316.74 s [vector] +++ OK, passed 100 tests.
  11692. 316.74 s [vector] mapM: OK
  11693. 316.75 s [vector] +++ OK, passed 100 tests.
  11694. 316.75 s [vector] mapM_: OK (0.02s)
  11695. 316.75 s [vector] +++ OK, passed 100 tests.
  11696. 316.77 s [vector] forM: OK
  11697. 316.77 s [vector] +++ OK, passed 100 tests.
  11698. 316.78 s [vector] forM_: OK (0.02s)
  11699. 316.78 s [vector] +++ OK, passed 100 tests.
  11700. 316.78 s [vector] imapM: OK
  11701. 316.79 s [vector] +++ OK, passed 100 tests.
  11702. 316.81 s [vector] imapM_: OK (0.03s)
  11703. 316.81 s [vector] +++ OK, passed 100 tests.
  11704. 316.81 s [vector] zipWith: OK
  11705. 316.81 s [vector] +++ OK, passed 100 tests.
  11706. 316.81 s [vector] zipWith3: OK
  11707. 316.82 s [vector] +++ OK, passed 100 tests.
  11708. 316.82 s [vector] izipWith: OK
  11709. 316.82 s [vector] +++ OK, passed 100 tests.
  11710. 316.83 s [vector] izipWith3: OK
  11711. 316.83 s [vector] +++ OK, passed 100 tests.
  11712. 316.83 s [vector] izipWithM: OK
  11713. 316.83 s [vector] +++ OK, passed 100 tests.
  11714. 316.84 s [vector] izipWithM_: OK (0.01s)
  11715. 316.84 s [vector] +++ OK, passed 100 tests.
  11716. 316.84 s [vector] zipWithM: OK
  11717. 316.85 s [vector] +++ OK, passed 100 tests.
  11718. 316.86 s [vector] zipWithM_: OK (0.01s)
  11719. 316.86 s [vector] +++ OK, passed 100 tests.
  11720. 316.86 s [vector] filter: OK
  11721. 316.86 s [vector] +++ OK, passed 100 tests.
  11722. 316.86 s [vector] ifilter: OK
  11723. 316.87 s [vector] +++ OK, passed 100 tests.
  11724. 316.89 s [vector] filterM: OK (0.03s)
  11725. 316.89 s [vector] +++ OK, passed 100 tests.
  11726. 316.89 s [vector] uniq: OK
  11727. 316.89 s [vector] +++ OK, passed 100 tests.
  11728. 316.89 s [vector] mapMaybe: OK
  11729. 316.89 s [vector] +++ OK, passed 100 tests.
  11730. 316.89 s [vector] imapMaybe: OK
  11731. 316.89 s [vector] +++ OK, passed 100 tests.
  11732. 316.90 s [vector] takeWhile: OK
  11733. 316.90 s [vector] +++ OK, passed 100 tests.
  11734. 316.90 s [vector] dropWhile: OK
  11735. 316.90 s [vector] +++ OK, passed 100 tests.
  11736. 316.90 s [vector] partition: OK
  11737. 316.90 s [vector] +++ OK, passed 100 tests.
  11738. 316.90 s [vector] partitionWith: OK
  11739. 316.90 s [vector] +++ OK, passed 100 tests.
  11740. 316.90 s [vector] span: OK
  11741. 316.90 s [vector] +++ OK, passed 100 tests.
  11742. 316.90 s [vector] break: OK
  11743. 316.90 s [vector] +++ OK, passed 100 tests.
  11744. 316.90 s [vector] spanR: OK
  11745. 316.90 s [vector] +++ OK, passed 100 tests.
  11746. 316.90 s [vector] breakR: OK
  11747. 316.91 s [vector] +++ OK, passed 100 tests.
  11748. 316.91 s [vector] groupBy: OK
  11749. 316.91 s [vector] +++ OK, passed 100 tests.
  11750. 316.91 s [vector] elem: OK
  11751. 316.91 s [vector] +++ OK, passed 100 tests.
  11752. 316.91 s [vector] notElem: OK
  11753. 316.91 s [vector] +++ OK, passed 100 tests.
  11754. 316.91 s [vector] find: OK
  11755. 316.91 s [vector] +++ OK, passed 100 tests.
  11756. 316.91 s [vector] findIndex: OK
  11757. 316.91 s [vector] +++ OK, passed 100 tests.
  11758. 316.91 s [vector] findIndexR: OK
  11759. 316.91 s [vector] +++ OK, passed 100 tests.
  11760. 316.91 s [vector] findIndices: OK
  11761. 316.91 s [vector] +++ OK, passed 100 tests.
  11762. 316.91 s [vector] elemIndex: OK
  11763. 316.91 s [vector] +++ OK, passed 100 tests.
  11764. 316.91 s [vector] elemIndices: OK
  11765. 316.91 s [vector] +++ OK, passed 100 tests.
  11766. 316.92 s [vector] foldl: OK
  11767. 316.92 s [vector] +++ OK, passed 100 tests.
  11768. 316.92 s [vector] foldl1: OK
  11769. 316.92 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11770. 316.92 s [vector] foldl': OK
  11771. 316.93 s [vector] +++ OK, passed 100 tests.
  11772. 316.93 s [vector] foldl1': OK
  11773. 316.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11774. 316.93 s [vector] foldr: OK
  11775. 316.93 s [vector] +++ OK, passed 100 tests.
  11776. 316.93 s [vector] foldr1: OK
  11777. 316.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11778. 316.93 s [vector] foldr': OK
  11779. 316.93 s [vector] +++ OK, passed 100 tests.
  11780. 316.93 s [vector] foldr1': OK
  11781. 316.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11782. 316.94 s [vector] ifoldl: OK
  11783. 316.94 s [vector] +++ OK, passed 100 tests.
  11784. 316.94 s [vector] ifoldl': OK
  11785. 316.94 s [vector] +++ OK, passed 100 tests.
  11786. 316.94 s [vector] ifoldr: OK
  11787. 316.95 s [vector] +++ OK, passed 100 tests.
  11788. 316.95 s [vector] ifoldr': OK
  11789. 316.95 s [vector] +++ OK, passed 100 tests.
  11790. 316.95 s [vector] ifoldM: OK
  11791. 316.96 s [vector] +++ OK, passed 100 tests.
  11792. 316.96 s [vector] ifoldM': OK
  11793. 316.97 s [vector] +++ OK, passed 100 tests.
  11794. 316.97 s [vector] ifoldM_: OK (0.02s)
  11795. 316.97 s [vector] +++ OK, passed 100 tests.
  11796. 317.00 s [vector] ifoldM'_: OK
  11797. 317.00 s [vector] +++ OK, passed 100 tests.
  11798. 317.00 s [vector] all: OK
  11799. 317.00 s [vector] +++ OK, passed 100 tests.
  11800. 317.00 s [vector] any: OK
  11801. 317.00 s [vector] +++ OK, passed 100 tests.
  11802. 317.00 s [vector] prescanl: OK
  11803. 317.01 s [vector] +++ OK, passed 100 tests.
  11804. 317.01 s [vector] prescanl': OK
  11805. 317.01 s [vector] +++ OK, passed 100 tests.
  11806. 317.01 s [vector] postscanl: OK
  11807. 317.01 s [vector] +++ OK, passed 100 tests.
  11808. 317.01 s [vector] postscanl': OK
  11809. 317.02 s [vector] +++ OK, passed 100 tests.
  11810. 317.02 s [vector] scanl: OK
  11811. 317.02 s [vector] +++ OK, passed 100 tests.
  11812. 317.02 s [vector] scanl': OK
  11813. 317.02 s [vector] +++ OK, passed 100 tests.
  11814. 317.02 s [vector] scanl1: OK
  11815. 317.03 s [vector] +++ OK, passed 100 tests.
  11816. 317.03 s [vector] scanl1': OK
  11817. 317.03 s [vector] +++ OK, passed 100 tests.
  11818. 317.03 s [vector] iscanl: OK
  11819. 317.04 s [vector] +++ OK, passed 100 tests.
  11820. 317.04 s [vector] iscanl': OK
  11821. 317.04 s [vector] +++ OK, passed 100 tests.
  11822. 317.04 s [vector] prescanr: OK
  11823. 317.04 s [vector] +++ OK, passed 100 tests.
  11824. 317.04 s [vector] prescanr': OK
  11825. 317.05 s [vector] +++ OK, passed 100 tests.
  11826. 317.05 s [vector] postscanr: OK
  11827. 317.05 s [vector] +++ OK, passed 100 tests.
  11828. 317.05 s [vector] postscanr': OK
  11829. 317.05 s [vector] +++ OK, passed 100 tests.
  11830. 317.06 s [vector] scanr: OK
  11831. 317.06 s [vector] +++ OK, passed 100 tests.
  11832. 317.06 s [vector] scanr': OK
  11833. 317.07 s [vector] +++ OK, passed 100 tests.
  11834. 317.07 s [vector] scanr1: OK
  11835. 317.07 s [vector] +++ OK, passed 100 tests.
  11836. 317.07 s [vector] scanr1': OK
  11837. 317.07 s [vector] +++ OK, passed 100 tests.
  11838. 317.07 s [vector] iscanr: OK
  11839. 317.07 s [vector] +++ OK, passed 100 tests.
  11840. 317.07 s [vector] iscanr': OK
  11841. 317.07 s [vector] +++ OK, passed 100 tests.
  11842. 317.08 s [vector] mut_read: OK
  11843. 317.08 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11844. 317.08 s [vector] mut_write: OK
  11845. 317.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11846. 317.08 s [vector] mut_modify: OK
  11847. 317.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11848. 317.09 s [vector] mut_generate: OK
  11849. 317.09 s [vector] +++ OK, passed 100 tests.
  11850. 317.11 s [vector] mut_generateM: OK (0.01s)
  11851. 317.11 s [vector] +++ OK, passed 100 tests.
  11852. 317.11 s [vector] mut_mapM_: OK (0.02s)
  11853. 317.11 s [vector] +++ OK, passed 100 tests.
  11854. 317.13 s [vector] mut_imapM_: OK (0.02s)
  11855. 317.13 s [vector] +++ OK, passed 100 tests.
  11856. 317.15 s [vector] mut_forM_: OK (0.02s)
  11857. 317.15 s [vector] +++ OK, passed 100 tests.
  11858. 317.15 s [vector] mut_iforM_: OK (0.01s)
  11859. 317.15 s [vector] +++ OK, passed 100 tests.
  11860. 317.15 s [vector] mut_foldr: OK
  11861. 317.15 s [vector] +++ OK, passed 100 tests.
  11862. 317.16 s [vector] mut_foldr': OK
  11863. 317.16 s [vector] +++ OK, passed 100 tests.
  11864. 317.16 s [vector] mut_foldl: OK
  11865. 317.16 s [vector] +++ OK, passed 100 tests.
  11866. 317.16 s [vector] mut_foldl': OK
  11867. 317.16 s [vector] +++ OK, passed 100 tests.
  11868. 317.17 s [vector] mut_ifoldr: OK
  11869. 317.17 s [vector] +++ OK, passed 100 tests.
  11870. 317.17 s [vector] mut_ifoldr': OK
  11871. 317.17 s [vector] +++ OK, passed 100 tests.
  11872. 317.17 s [vector] mut_ifoldl: OK
  11873. 317.17 s [vector] +++ OK, passed 100 tests.
  11874. 317.18 s [vector] mut_ifoldl': OK
  11875. 317.18 s [vector] +++ OK, passed 100 tests.
  11876. 317.18 s [vector] mut_foldM: OK
  11877. 317.18 s [vector] +++ OK, passed 100 tests.
  11878. 317.18 s [vector] mut_foldM': OK
  11879. 317.18 s [vector] +++ OK, passed 100 tests.
  11880. 317.18 s [vector] mut_foldrM: OK
  11881. 317.18 s [vector] +++ OK, passed 100 tests.
  11882. 317.19 s [vector] mut_foldrM': OK
  11883. 317.19 s [vector] +++ OK, passed 100 tests.
  11884. 317.19 s [vector] mut_ifoldM: OK
  11885. 317.19 s [vector] +++ OK, passed 100 tests.
  11886. 317.19 s [vector] mut_ifoldM': OK
  11887. 317.19 s [vector] +++ OK, passed 100 tests.
  11888. 317.21 s [vector] mut_ifoldrM: OK
  11889. 317.21 s [vector] +++ OK, passed 100 tests.
  11890. 317.21 s [vector] mut_ifoldrM': OK
  11891. 317.21 s [vector] +++ OK, passed 100 tests.
  11892. 317.21 s [vector] compare: OK
  11893. 317.21 s [vector] +++ OK, passed 100 tests.
  11894. 317.21 s [vector] maximum: OK
  11895. 317.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11896. 317.21 s [vector] minimum: OK
  11897. 317.21 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11898. 317.21 s [vector] minIndex: OK
  11899. 317.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11900. 317.21 s [vector] maxIndex: OK
  11901. 317.21 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11902. 317.21 s [vector] maximumBy: OK
  11903. 317.21 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11904. 317.22 s [vector] minimumBy: OK
  11905. 317.22 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11906. 317.22 s [vector] maximumOn: OK
  11907. 317.22 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11908. 317.22 s [vector] minimumOn: OK
  11909. 317.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11910. 317.22 s [vector] maxIndexBy: OK
  11911. 317.22 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11912. 317.22 s [vector] minIndexBy: OK
  11913. 317.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11914. 317.22 s [vector] ListFirstMaxIndexWins: OK
  11915. 317.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11916. 317.22 s [vector] FalseListFirstMaxIndexWins: OK
  11917. 317.22 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  11918. 317.22 s [vector] []
  11919. 317.22 s [vector] zip: OK
  11920. 317.22 s [vector] +++ OK, passed 100 tests.
  11921. 317.22 s [vector] zip3: OK
  11922. 317.22 s [vector] +++ OK, passed 100 tests.
  11923. 317.22 s [vector] unzip: OK
  11924. 317.23 s [vector] +++ OK, passed 100 tests.
  11925. 317.23 s [vector] unzip3: OK
  11926. 317.23 s [vector] +++ OK, passed 100 tests.
  11927. 317.23 s [vector] indexed: OK
  11928. 317.23 s [vector] +++ OK, passed 100 tests.
  11929. 317.23 s [vector] update: OK
  11930. 317.23 s [vector] +++ OK, passed 100 tests.
  11931. 317.23 s [vector] mempty: OK
  11932. 317.23 s [vector] +++ OK, passed 1 test.
  11933. 317.25 s [vector] mappend: OK
  11934. 317.25 s [vector] +++ OK, passed 100 tests.
  11935. 317.25 s [vector] mconcat: OK (0.02s)
  11936. 317.25 s [vector] +++ OK, passed 100 tests.
  11937. 317.25 s [vector] glength: OK
  11938. 317.25 s [vector] +++ OK, passed 100 tests.
  11939. 317.25 s [vector] sum: OK
  11940. 317.25 s [vector] +++ OK, passed 100 tests.
  11941. 317.25 s [vector] product: OK
  11942. 317.25 s [vector] +++ OK, passed 100 tests.
  11943. 317.25 s [vector] enumFromN: OK
  11944. 317.25 s [vector] +++ OK, passed 100 tests.
  11945. 317.25 s [vector] enumFromThenN: OK
  11946. 317.25 s [vector] +++ OK, passed 100 tests.
  11947. 317.25 s [vector] enumFromTo: OK
  11948. 317.25 s [vector] +++ OK, passed 100 tests.
  11949. 317.25 s [vector] enumFromThenTo: OK
  11950. 317.25 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11951. 317.25 s [vector] (Float)
  11952. 317.25 s [vector] fromList.toList == id: OK
  11953. 317.25 s [vector] +++ OK, passed 100 tests.
  11954. 317.25 s [vector] toList.fromList == id: OK
  11955. 317.25 s [vector] +++ OK, passed 100 tests.
  11956. 317.25 s [vector] unstream.stream == id: OK
  11957. 317.25 s [vector] +++ OK, passed 100 tests.
  11958. 317.25 s [vector] stream.unstream == id: OK
  11959. 317.26 s [vector] +++ OK, passed 100 tests.
  11960. 317.26 s [vector] eq: OK
  11961. 317.26 s [vector] +++ OK, passed 100 tests.
  11962. 317.26 s [vector] length: OK
  11963. 317.26 s [vector] +++ OK, passed 100 tests.
  11964. 317.26 s [vector] null: OK
  11965. 317.26 s [vector] +++ OK, passed 100 tests.
  11966. 317.26 s [vector] index: OK
  11967. 317.26 s [vector] +++ OK, passed 100 tests; 11 discarded.
  11968. 317.26 s [vector] safeIndex: OK
  11969. 317.26 s [vector] +++ OK, passed 100 tests.
  11970. 317.26 s [vector] head: OK
  11971. 317.26 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11972. 317.26 s [vector] last: OK
  11973. 317.26 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11974. 317.26 s [vector] unsafeIndex: OK
  11975. 317.26 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11976. 317.26 s [vector] unsafeHead: OK
  11977. 317.26 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11978. 317.26 s [vector] unsafeLast: OK
  11979. 317.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11980. 317.27 s [vector] slice: OK
  11981. 317.27 s [vector] +++ OK, passed 100 tests.
  11982. 317.27 s [vector] init: OK
  11983. 317.27 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11984. 317.27 s [vector] tail: OK
  11985. 317.27 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11986. 317.27 s [vector] take: OK
  11987. 317.27 s [vector] +++ OK, passed 100 tests.
  11988. 317.27 s [vector] drop: OK
  11989. 317.27 s [vector] +++ OK, passed 100 tests.
  11990. 317.27 s [vector] splitAt: OK
  11991. 317.27 s [vector] +++ OK, passed 100 tests.
  11992. 317.27 s [vector] empty: OK
  11993. 317.27 s [vector] +++ OK, passed 1 test.
  11994. 317.27 s [vector] singleton: OK
  11995. 317.27 s [vector] +++ OK, passed 100 tests.
  11996. 317.27 s [vector] replicate: OK
  11997. 317.27 s [vector] +++ OK, passed 100 tests.
  11998. 317.27 s [vector] generate: OK
  11999. 317.27 s [vector] +++ OK, passed 100 tests.
  12000. 317.27 s [vector] iterateN: OK
  12001. 317.29 s [vector] +++ OK, passed 100 tests.
  12002. 317.31 s [vector] iterateNM: OK (0.03s)
  12003. 317.31 s [vector] +++ OK, passed 100 tests.
  12004. 317.35 s [vector] generateM: OK (0.04s)
  12005. 317.35 s [vector] +++ OK, passed 100 tests.
  12006. 317.36 s [vector] replicateM: OK
  12007. 317.36 s [vector] +++ OK, passed 100 tests.
  12008. 317.36 s [vector] create: OK
  12009. 317.36 s [vector] +++ OK, passed 100 tests.
  12010. 317.36 s [vector] createT: OK
  12011. 317.36 s [vector] +++ OK, passed 100 tests.
  12012. 317.36 s [vector] unfoldr: OK
  12013. 317.36 s [vector] +++ OK, passed 100 tests.
  12014. 317.36 s [vector] unfoldrN: OK
  12015. 317.36 s [vector] +++ OK, passed 100 tests.
  12016. 317.36 s [vector] unfoldrExactN: OK
  12017. 317.36 s [vector] +++ OK, passed 100 tests.
  12018. 317.36 s [vector] unfoldrM: OK
  12019. 317.37 s [vector] +++ OK, passed 100 tests.
  12020. 317.37 s [vector] unfoldrNM: OK
  12021. 317.37 s [vector] +++ OK, passed 100 tests.
  12022. 317.39 s [vector] unfoldrExactNM: OK (0.02s)
  12023. 317.39 s [vector] +++ OK, passed 100 tests.
  12024. 317.41 s [vector] constructN: OK (0.01s)
  12025. 317.41 s [vector] +++ OK, passed 100 tests.
  12026. 317.41 s [vector] constructrN: OK (0.01s)
  12027. 317.41 s [vector] +++ OK, passed 100 tests.
  12028. 317.41 s [vector] cons: OK
  12029. 317.41 s [vector] +++ OK, passed 100 tests.
  12030. 317.41 s [vector] snoc: OK
  12031. 317.41 s [vector] +++ OK, passed 100 tests.
  12032. 317.43 s [vector] append: OK
  12033. 317.43 s [vector] +++ OK, passed 100 tests.
  12034. 317.44 s [vector] concat: OK (0.03s)
  12035. 317.44 s [vector] +++ OK, passed 100 tests.
  12036. 317.44 s [vector] force: OK
  12037. 317.44 s [vector] +++ OK, passed 100 tests.
  12038. 317.45 s [vector] upd: OK
  12039. 317.45 s [vector] +++ OK, passed 100 tests.
  12040. 317.45 s [vector] accum: OK (0.01s)
  12041. 317.45 s [vector] +++ OK, passed 100 tests.
  12042. 317.46 s [vector] reverse: OK
  12043. 317.46 s [vector] +++ OK, passed 100 tests.
  12044. 317.46 s [vector] backpermute: OK
  12045. 317.46 s [vector] +++ OK, passed 100 tests.
  12046. 317.47 s [vector] map: OK
  12047. 317.47 s [vector] +++ OK, passed 100 tests.
  12048. 317.47 s [vector] imap: OK
  12049. 317.48 s [vector] +++ OK, passed 100 tests.
  12050. 317.48 s [vector] concatMap: OK
  12051. 317.48 s [vector] +++ OK, passed 100 tests.
  12052. 317.50 s [vector] mapM: OK
  12053. 317.50 s [vector] +++ OK, passed 100 tests.
  12054. 317.52 s [vector] mapM_: OK (0.04s)
  12055. 317.52 s [vector] +++ OK, passed 100 tests.
  12056. 317.54 s [vector] forM: OK
  12057. 317.54 s [vector] +++ OK, passed 100 tests.
  12058. 317.56 s [vector] forM_: OK (0.03s)
  12059. 317.56 s [vector] +++ OK, passed 100 tests.
  12060. 317.56 s [vector] imapM: OK
  12061. 317.56 s [vector] +++ OK, passed 100 tests.
  12062. 317.60 s [vector] imapM_: OK (0.04s)
  12063. 317.60 s [vector] +++ OK, passed 100 tests.
  12064. 317.60 s [vector] zipWith: OK
  12065. 317.61 s [vector] +++ OK, passed 100 tests.
  12066. 317.62 s [vector] zipWith3: OK
  12067. 317.62 s [vector] +++ OK, passed 100 tests.
  12068. 317.62 s [vector] izipWith: OK
  12069. 317.63 s [vector] +++ OK, passed 100 tests.
  12070. 317.64 s [vector] izipWith3: OK
  12071. 317.64 s [vector] +++ OK, passed 100 tests.
  12072. 317.64 s [vector] izipWithM: OK
  12073. 317.64 s [vector] +++ OK, passed 100 tests.
  12074. 317.66 s [vector] izipWithM_: OK (0.02s)
  12075. 317.66 s [vector] +++ OK, passed 100 tests.
  12076. 317.66 s [vector] zipWithM: OK
  12077. 317.68 s [vector] +++ OK, passed 100 tests.
  12078. 317.70 s [vector] zipWithM_: OK (0.03s)
  12079. 317.70 s [vector] +++ OK, passed 100 tests.
  12080. 317.70 s [vector] filter: OK
  12081. 317.70 s [vector] +++ OK, passed 100 tests.
  12082. 317.70 s [vector] ifilter: OK
  12083. 317.72 s [vector] +++ OK, passed 100 tests.
  12084. 317.75 s [vector] filterM: OK (0.05s)
  12085. 317.75 s [vector] +++ OK, passed 100 tests.
  12086. 317.75 s [vector] uniq: OK
  12087. 317.76 s [vector] +++ OK, passed 100 tests.
  12088. 317.77 s [vector] mapMaybe: OK
  12089. 317.77 s [vector] +++ OK, passed 100 tests.
  12090. 317.77 s [vector] imapMaybe: OK
  12091. 317.77 s [vector] +++ OK, passed 100 tests.
  12092. 317.77 s [vector] takeWhile: OK
  12093. 317.77 s [vector] +++ OK, passed 100 tests.
  12094. 317.77 s [vector] dropWhile: OK
  12095. 317.77 s [vector] +++ OK, passed 100 tests.
  12096. 317.78 s [vector] partition: OK
  12097. 317.78 s [vector] +++ OK, passed 100 tests.
  12098. 317.78 s [vector] partitionWith: OK
  12099. 317.78 s [vector] +++ OK, passed 100 tests.
  12100. 317.78 s [vector] span: OK
  12101. 317.78 s [vector] +++ OK, passed 100 tests.
  12102. 317.78 s [vector] break: OK
  12103. 317.78 s [vector] +++ OK, passed 100 tests.
  12104. 317.79 s [vector] spanR: OK
  12105. 317.79 s [vector] +++ OK, passed 100 tests.
  12106. 318.25 s [vector] breakR: OK
  12107. 318.25 s [vector] +++ OK, passed 100 tests.
  12108. 318.25 s [vector] groupBy: OK
  12109. 318.25 s [vector] +++ OK, passed 100 tests.
  12110. 318.25 s [vector] elem: OK
  12111. 318.25 s [vector] +++ OK, passed 100 tests.
  12112. 318.25 s [vector] notElem: OK
  12113. 318.25 s [vector] +++ OK, passed 100 tests.
  12114. 318.25 s [vector] find: OK
  12115. 318.25 s [vector] +++ OK, passed 100 tests.
  12116. 318.25 s [vector] findIndex: OK
  12117. 318.25 s [vector] +++ OK, passed 100 tests.
  12118. 318.25 s [vector] findIndexR: OK
  12119. 318.25 s [vector] +++ OK, passed 100 tests.
  12120. 318.25 s [vector] findIndices: OK
  12121. 318.25 s [vector] +++ OK, passed 100 tests.
  12122. 318.25 s [vector] elemIndex: OK
  12123. 318.25 s [vector] +++ OK, passed 100 tests.
  12124. 318.25 s [vector] elemIndices: OK
  12125. 318.25 s [vector] +++ OK, passed 100 tests.
  12126. 318.25 s [vector] foldl: OK
  12127. 318.25 s [vector] +++ OK, passed 100 tests.
  12128. 318.25 s [vector] foldl1: OK
  12129. 318.25 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12130. 318.25 s [vector] foldl': OK
  12131. 318.25 s [vector] +++ OK, passed 100 tests.
  12132. 318.25 s [vector] foldl1': OK
  12133. 318.25 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12134. 318.25 s [vector] foldr: OK
  12135. 318.25 s [vector] +++ OK, passed 100 tests.
  12136. 318.25 s [vector] foldr1: OK
  12137. 318.25 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12138. 318.25 s [vector] foldr': OK (0.01s)
  12139. 318.25 s [vector] +++ OK, passed 100 tests.
  12140. 318.25 s [vector] foldr1': OK (0.01s)
  12141. 318.25 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12142. 318.25 s [vector] ifoldl: OK (0.01s)
  12143. 318.25 s [vector] +++ OK, passed 100 tests.
  12144. 318.25 s [vector] ifoldl': OK (0.01s)
  12145. 318.25 s [vector] +++ OK, passed 100 tests.
  12146. 318.25 s [vector] ifoldr: OK
  12147. 318.25 s [vector] +++ OK, passed 100 tests.
  12148. 318.25 s [vector] ifoldr': OK
  12149. 318.25 s [vector] +++ OK, passed 100 tests.
  12150. 318.25 s [vector] ifoldM: OK
  12151. 318.25 s [vector] +++ OK, passed 100 tests.
  12152. 318.25 s [vector] ifoldM': OK
  12153. 318.25 s [vector] +++ OK, passed 100 tests.
  12154. 318.25 s [vector] ifoldM_: OK (0.03s)
  12155. 318.25 s [vector] +++ OK, passed 100 tests.
  12156. 318.25 s [vector] ifoldM'_: OK (0.03s)
  12157. 318.25 s [vector] +++ OK, passed 100 tests.
  12158. 318.25 s [vector] all: OK
  12159. 318.25 s [vector] +++ OK, passed 100 tests.
  12160. 318.25 s [vector] any: OK
  12161. 318.25 s [vector] +++ OK, passed 100 tests.
  12162. 318.25 s [vector] prescanl: OK
  12163. 318.25 s [vector] +++ OK, passed 100 tests.
  12164. 318.25 s [vector] prescanl': OK
  12165. 318.25 s [vector] +++ OK, passed 100 tests.
  12166. 318.25 s [vector] postscanl: OK
  12167. 318.25 s [vector] +++ OK, passed 100 tests.
  12168. 318.25 s [vector] postscanl': OK
  12169. 318.25 s [vector] +++ OK, passed 100 tests.
  12170. 318.25 s [vector] scanl: OK
  12171. 318.25 s [vector] +++ OK, passed 100 tests.
  12172. 318.25 s [vector] scanl': OK
  12173. 318.25 s [vector] +++ OK, passed 100 tests.
  12174. 318.25 s [vector] scanl1: OK
  12175. 318.25 s [vector] +++ OK, passed 100 tests.
  12176. 318.25 s [vector] scanl1': OK
  12177. 318.26 s [vector] +++ OK, passed 100 tests.
  12178. 318.26 s [vector] iscanl: OK (0.01s)
  12179. 318.26 s [vector] +++ OK, passed 100 tests.
  12180. 318.26 s [vector] iscanl': OK (0.01s)
  12181. 318.26 s [vector] +++ OK, passed 100 tests.
  12182. 318.26 s [vector] prescanr: OK
  12183. 318.26 s [vector] +++ OK, passed 100 tests.
  12184. 318.26 s [vector] prescanr': OK
  12185. 318.26 s [vector] +++ OK, passed 100 tests.
  12186. 318.26 s [vector] postscanr: OK
  12187. 318.26 s [vector] +++ OK, passed 100 tests.
  12188. 318.26 s [vector] postscanr': OK
  12189. 318.26 s [vector] +++ OK, passed 100 tests.
  12190. 318.26 s [vector] scanr: OK
  12191. 318.26 s [vector] +++ OK, passed 100 tests.
  12192. 318.26 s [vector] scanr': OK
  12193. 318.26 s [vector] +++ OK, passed 100 tests.
  12194. 318.26 s [vector] scanr1: OK
  12195. 318.26 s [vector] +++ OK, passed 100 tests.
  12196. 318.26 s [vector] scanr1': OK
  12197. 318.26 s [vector] +++ OK, passed 100 tests.
  12198. 318.26 s [vector] iscanr: OK
  12199. 318.26 s [vector] +++ OK, passed 100 tests.
  12200. 318.26 s [vector] iscanr': OK
  12201. 318.26 s [vector] +++ OK, passed 100 tests.
  12202. 318.26 s [vector] mut_read: OK
  12203. 318.26 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12204. 318.26 s [vector] mut_write: OK
  12205. 318.26 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12206. 318.26 s [vector] mut_modify: OK
  12207. 318.26 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12208. 318.26 s [vector] mut_generate: OK
  12209. 318.26 s [vector] +++ OK, passed 100 tests.
  12210. 318.26 s [vector] mut_generateM: OK (0.01s)
  12211. 318.26 s [vector] +++ OK, passed 100 tests.
  12212. 318.26 s [vector] mut_mapM_: OK (0.05s)
  12213. 318.26 s [vector] +++ OK, passed 100 tests.
  12214. 318.30 s [vector] mut_imapM_: OK (0.04s)
  12215. 318.30 s [vector] +++ OK, passed 100 tests.
  12216. 318.34 s [vector] mut_forM_: OK (0.03s)
  12217. 318.34 s [vector] +++ OK, passed 100 tests.
  12218. 318.36 s [vector] mut_iforM_: OK (0.04s)
  12219. 318.36 s [vector] +++ OK, passed 100 tests.
  12220. 318.36 s [vector] mut_foldr: OK
  12221. 318.37 s [vector] +++ OK, passed 100 tests.
  12222. 318.37 s [vector] mut_foldr': OK
  12223. 318.38 s [vector] +++ OK, passed 100 tests.
  12224. 318.39 s [vector] mut_foldl: OK
  12225. 318.39 s [vector] +++ OK, passed 100 tests.
  12226. 318.39 s [vector] mut_foldl': OK
  12227. 318.40 s [vector] +++ OK, passed 100 tests.
  12228. 318.40 s [vector] mut_ifoldr: OK
  12229. 318.40 s [vector] +++ OK, passed 100 tests.
  12230. 318.40 s [vector] mut_ifoldr': OK
  12231. 318.41 s [vector] +++ OK, passed 100 tests.
  12232. 318.41 s [vector] mut_ifoldl: OK
  12233. 318.42 s [vector] +++ OK, passed 100 tests.
  12234. 318.42 s [vector] mut_ifoldl': OK
  12235. 318.43 s [vector] +++ OK, passed 100 tests.
  12236. 318.43 s [vector] mut_foldM: OK
  12237. 318.43 s [vector] +++ OK, passed 100 tests.
  12238. 318.44 s [vector] mut_foldM': OK
  12239. 318.45 s [vector] +++ OK, passed 100 tests.
  12240. 318.45 s [vector] mut_foldrM: OK
  12241. 318.46 s [vector] +++ OK, passed 100 tests.
  12242. 318.46 s [vector] mut_foldrM': OK
  12243. 318.47 s [vector] +++ OK, passed 100 tests.
  12244. 318.47 s [vector] mut_ifoldM: OK
  12245. 318.47 s [vector] +++ OK, passed 100 tests.
  12246. 318.49 s [vector] mut_ifoldM': OK
  12247. 318.49 s [vector] +++ OK, passed 100 tests.
  12248. 318.50 s [vector] mut_ifoldrM: OK
  12249. 318.50 s [vector] +++ OK, passed 100 tests.
  12250. 318.50 s [vector] mut_ifoldrM': OK
  12251. 318.50 s [vector] +++ OK, passed 100 tests.
  12252. 318.50 s [vector] compare: OK
  12253. 318.50 s [vector] +++ OK, passed 100 tests.
  12254. 318.50 s [vector] maximum: OK
  12255. 318.50 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12256. 318.50 s [vector] minimum: OK
  12257. 318.50 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12258. 318.50 s [vector] minIndex: OK
  12259. 318.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12260. 318.50 s [vector] maxIndex: OK
  12261. 318.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12262. 318.50 s [vector] maximumBy: OK
  12263. 318.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12264. 318.50 s [vector] minimumBy: OK
  12265. 318.50 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12266. 318.50 s [vector] maximumOn: OK
  12267. 318.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12268. 318.51 s [vector] minimumOn: OK
  12269. 318.51 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12270. 318.51 s [vector] maxIndexBy: OK
  12271. 318.51 s [vector] +++ OK, passed 100 tests; 23 discarded.
  12272. 318.51 s [vector] minIndexBy: OK
  12273. 318.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12274. 318.51 s [vector] ListFirstMaxIndexWins: OK
  12275. 318.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12276. 318.51 s [vector] FalseListFirstMaxIndexWins: OK
  12277. 318.51 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  12278. 318.51 s [vector] []
  12279. 318.51 s [vector] zip: OK
  12280. 318.51 s [vector] +++ OK, passed 100 tests.
  12281. 318.51 s [vector] zip3: OK
  12282. 318.51 s [vector] +++ OK, passed 100 tests.
  12283. 318.51 s [vector] unzip: OK
  12284. 318.52 s [vector] +++ OK, passed 100 tests.
  12285. 318.52 s [vector] unzip3: OK
  12286. 318.52 s [vector] +++ OK, passed 100 tests.
  12287. 318.52 s [vector] indexed: OK
  12288. 318.52 s [vector] +++ OK, passed 100 tests.
  12289. 318.52 s [vector] update: OK
  12290. 318.52 s [vector] +++ OK, passed 100 tests.
  12291. 318.52 s [vector] mempty: OK
  12292. 318.52 s [vector] +++ OK, passed 1 test.
  12293. 318.52 s [vector] mappend: OK
  12294. 318.54 s [vector] +++ OK, passed 100 tests.
  12295. 318.56 s [vector] mconcat: OK (0.03s)
  12296. 318.56 s [vector] +++ OK, passed 100 tests.
  12297. 318.56 s [vector] glength: OK
  12298. 318.56 s [vector] +++ OK, passed 100 tests.
  12299. 318.56 s [vector] sum: OK
  12300. 318.56 s [vector] +++ OK, passed 100 tests.
  12301. 318.56 s [vector] product: OK
  12302. 318.56 s [vector] +++ OK, passed 100 tests.
  12303. 318.56 s [vector] enumFromN: OK
  12304. 318.56 s [vector] +++ OK, passed 100 tests.
  12305. 318.56 s [vector] enumFromThenN: OK
  12306. 318.56 s [vector] +++ OK, passed 100 tests.
  12307. 318.56 s [vector] enumFromTo: OK
  12308. 318.56 s [vector] +++ OK, passed 100 tests.
  12309. 318.56 s [vector] enumFromThenTo: OK
  12310. 318.56 s [vector] +++ OK, passed 100 tests; 4 discarded.
  12311. 318.56 s [vector] (Double)
  12312. 318.56 s [vector] fromList.toList == id: OK
  12313. 318.56 s [vector] +++ OK, passed 100 tests.
  12314. 318.56 s [vector] toList.fromList == id: OK
  12315. 318.56 s [vector] +++ OK, passed 100 tests.
  12316. 318.56 s [vector] unstream.stream == id: OK
  12317. 318.56 s [vector] +++ OK, passed 100 tests.
  12318. 318.57 s [vector] stream.unstream == id: OK
  12319. 318.57 s [vector] +++ OK, passed 100 tests.
  12320. 318.57 s [vector] eq: OK
  12321. 318.57 s [vector] +++ OK, passed 100 tests.
  12322. 318.57 s [vector] length: OK
  12323. 318.57 s [vector] +++ OK, passed 100 tests.
  12324. 318.57 s [vector] null: OK
  12325. 318.57 s [vector] +++ OK, passed 100 tests.
  12326. 318.57 s [vector] index: OK
  12327. 318.57 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12328. 318.57 s [vector] safeIndex: OK
  12329. 318.57 s [vector] +++ OK, passed 100 tests.
  12330. 318.57 s [vector] head: OK
  12331. 318.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12332. 318.57 s [vector] last: OK
  12333. 318.57 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12334. 318.57 s [vector] unsafeIndex: OK
  12335. 318.57 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12336. 318.57 s [vector] unsafeHead: OK
  12337. 318.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12338. 318.57 s [vector] unsafeLast: OK
  12339. 318.57 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12340. 318.57 s [vector] slice: OK
  12341. 318.57 s [vector] +++ OK, passed 100 tests.
  12342. 318.57 s [vector] init: OK
  12343. 318.57 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12344. 318.57 s [vector] tail: OK
  12345. 318.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12346. 318.57 s [vector] take: OK
  12347. 318.57 s [vector] +++ OK, passed 100 tests.
  12348. 318.57 s [vector] drop: OK
  12349. 318.58 s [vector] +++ OK, passed 100 tests.
  12350. 318.58 s [vector] splitAt: OK
  12351. 318.58 s [vector] +++ OK, passed 100 tests.
  12352. 318.58 s [vector] empty: OK
  12353. 318.58 s [vector] +++ OK, passed 1 test.
  12354. 318.58 s [vector] singleton: OK
  12355. 318.58 s [vector] +++ OK, passed 100 tests.
  12356. 318.58 s [vector] replicate: OK
  12357. 318.58 s [vector] +++ OK, passed 100 tests.
  12358. 318.58 s [vector] generate: OK
  12359. 318.58 s [vector] +++ OK, passed 100 tests.
  12360. 318.58 s [vector] iterateN: OK
  12361. 318.60 s [vector] +++ OK, passed 100 tests.
  12362. 318.60 s [vector] iterateNM: OK (0.01s)
  12363. 318.60 s [vector] +++ OK, passed 100 tests.
  12364. 318.63 s [vector] generateM: OK (0.03s)
  12365. 318.63 s [vector] +++ OK, passed 100 tests.
  12366. 318.63 s [vector] replicateM: OK
  12367. 318.63 s [vector] +++ OK, passed 100 tests.
  12368. 318.63 s [vector] create: OK
  12369. 318.63 s [vector] +++ OK, passed 100 tests.
  12370. 318.63 s [vector] createT: OK
  12371. 318.63 s [vector] +++ OK, passed 100 tests.
  12372. 318.63 s [vector] unfoldr: OK
  12373. 318.63 s [vector] +++ OK, passed 100 tests.
  12374. 318.64 s [vector] unfoldrN: OK
  12375. 318.64 s [vector] +++ OK, passed 100 tests.
  12376. 318.64 s [vector] unfoldrExactN: OK
  12377. 318.64 s [vector] +++ OK, passed 100 tests.
  12378. 318.64 s [vector] unfoldrM: OK
  12379. 318.64 s [vector] +++ OK, passed 100 tests.
  12380. 318.66 s [vector] unfoldrNM: OK
  12381. 318.66 s [vector] +++ OK, passed 100 tests.
  12382. 318.68 s [vector] unfoldrExactNM: OK (0.02s)
  12383. 318.68 s [vector] +++ OK, passed 100 tests.
  12384. 318.70 s [vector] constructN: OK (0.03s)
  12385. 318.70 s [vector] +++ OK, passed 100 tests.
  12386. 318.71 s [vector] constructrN: OK (0.02s)
  12387. 318.71 s [vector] +++ OK, passed 100 tests.
  12388. 318.71 s [vector] cons: OK
  12389. 318.71 s [vector] +++ OK, passed 100 tests.
  12390. 318.72 s [vector] snoc: OK
  12391. 318.72 s [vector] +++ OK, passed 100 tests.
  12392. 318.72 s [vector] append: OK
  12393. 318.72 s [vector] +++ OK, passed 100 tests.
  12394. 318.75 s [vector] concat: OK (0.03s)
  12395. 318.75 s [vector] +++ OK, passed 100 tests.
  12396. 318.75 s [vector] force: OK
  12397. 318.75 s [vector] +++ OK, passed 100 tests.
  12398. 318.76 s [vector] upd: OK
  12399. 318.76 s [vector] +++ OK, passed 100 tests.
  12400. 318.77 s [vector] accum: OK (0.02s)
  12401. 318.77 s [vector] +++ OK, passed 100 tests.
  12402. 318.77 s [vector] reverse: OK
  12403. 318.77 s [vector] +++ OK, passed 100 tests.
  12404. 318.77 s [vector] backpermute: OK
  12405. 318.78 s [vector] +++ OK, passed 100 tests.
  12406. 318.79 s [vector] map: OK (0.01s)
  12407. 318.79 s [vector] +++ OK, passed 100 tests.
  12408. 318.80 s [vector] imap: OK (0.01s)
  12409. 318.80 s [vector] +++ OK, passed 100 tests.
  12410. 318.81 s [vector] concatMap: OK
  12411. 318.81 s [vector] +++ OK, passed 100 tests.
  12412. 318.81 s [vector] mapM: OK
  12413. 318.82 s [vector] +++ OK, passed 100 tests.
  12414. 318.86 s [vector] mapM_: OK (0.04s)
  12415. 318.86 s [vector] +++ OK, passed 100 tests.
  12416. 318.86 s [vector] forM: OK
  12417. 318.86 s [vector] +++ OK, passed 100 tests.
  12418. 318.90 s [vector] forM_: OK (0.03s)
  12419. 318.90 s [vector] +++ OK, passed 100 tests.
  12420. 318.90 s [vector] imapM: OK
  12421. 318.90 s [vector] +++ OK, passed 100 tests.
  12422. 318.94 s [vector] imapM_: OK (0.03s)
  12423. 318.94 s [vector] +++ OK, passed 100 tests.
  12424. 318.95 s [vector] zipWith: OK (0.01s)
  12425. 318.95 s [vector] +++ OK, passed 100 tests.
  12426. 318.96 s [vector] zipWith3: OK (0.01s)
  12427. 318.96 s [vector] +++ OK, passed 100 tests.
  12428. 318.98 s [vector] izipWith: OK (0.01s)
  12429. 318.98 s [vector] +++ OK, passed 100 tests.
  12430. 318.98 s [vector] izipWith3: OK (0.01s)
  12431. 318.98 s [vector] +++ OK, passed 100 tests.
  12432. 319.00 s [vector] izipWithM: OK (0.01s)
  12433. 319.00 s [vector] +++ OK, passed 100 tests.
  12434. 319.04 s [vector] izipWithM_: OK (0.03s)
  12435. 319.04 s [vector] +++ OK, passed 100 tests.
  12436. 319.04 s [vector] zipWithM: OK (0.01s)
  12437. 319.04 s [vector] +++ OK, passed 100 tests.
  12438. 319.06 s [vector] zipWithM_: OK (0.03s)
  12439. 319.06 s [vector] +++ OK, passed 100 tests.
  12440. 319.06 s [vector] filter: OK
  12441. 319.06 s [vector] +++ OK, passed 100 tests.
  12442. 319.10 s [vector] ifilter: OK (0.01s)
  12443. 319.10 s [vector] +++ OK, passed 100 tests.
  12444. 319.14 s [vector] filterM: OK (0.06s)
  12445. 319.14 s [vector] +++ OK, passed 100 tests.
  12446. 319.15 s [vector] uniq: OK
  12447. 319.15 s [vector] +++ OK, passed 100 tests.
  12448. 319.15 s [vector] mapMaybe: OK
  12449. 319.16 s [vector] +++ OK, passed 100 tests.
  12450. 319.16 s [vector] imapMaybe: OK
  12451. 319.16 s [vector] +++ OK, passed 100 tests.
  12452. 319.16 s [vector] takeWhile: OK
  12453. 319.16 s [vector] +++ OK, passed 100 tests.
  12454. 319.17 s [vector] dropWhile: OK
  12455. 319.17 s [vector] +++ OK, passed 100 tests.
  12456. 319.17 s [vector] partition: OK
  12457. 319.18 s [vector] +++ OK, passed 100 tests.
  12458. 319.18 s [vector] partitionWith: OK
  12459. 319.18 s [vector] +++ OK, passed 100 tests.
  12460. 319.18 s [vector] span: OK
  12461. 319.18 s [vector] +++ OK, passed 100 tests.
  12462. 319.18 s [vector] break: OK
  12463. 319.18 s [vector] +++ OK, passed 100 tests.
  12464. 319.18 s [vector] spanR: OK
  12465. 319.18 s [vector] +++ OK, passed 100 tests.
  12466. 319.19 s [vector] breakR: OK
  12467. 319.19 s [vector] +++ OK, passed 100 tests.
  12468. 319.19 s [vector] groupBy: OK (0.01s)
  12469. 319.19 s [vector] +++ OK, passed 100 tests.
  12470. 319.19 s [vector] elem: OK
  12471. 319.19 s [vector] +++ OK, passed 100 tests.
  12472. 319.20 s [vector] notElem: OK
  12473. 319.20 s [vector] +++ OK, passed 100 tests.
  12474. 319.20 s [vector] find: OK
  12475. 319.20 s [vector] +++ OK, passed 100 tests.
  12476. 319.20 s [vector] findIndex: OK
  12477. 319.20 s [vector] +++ OK, passed 100 tests.
  12478. 319.21 s [vector] findIndexR: OK
  12479. 319.21 s [vector] +++ OK, passed 100 tests.
  12480. 319.21 s [vector] findIndices: OK
  12481. 319.21 s [vector] +++ OK, passed 100 tests.
  12482. 319.21 s [vector] elemIndex: OK
  12483. 319.21 s [vector] +++ OK, passed 100 tests.
  12484. 319.22 s [vector] elemIndices: OK
  12485. 319.22 s [vector] +++ OK, passed 100 tests.
  12486. 319.24 s [vector] foldl: OK (0.03s)
  12487. 319.24 s [vector] +++ OK, passed 100 tests.
  12488. 319.26 s [vector] foldl1: OK (0.02s)
  12489. 319.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12490. 319.30 s [vector] foldl': OK (0.03s)
  12491. 319.30 s [vector] +++ OK, passed 100 tests.
  12492. 319.32 s [vector] foldl1': OK (0.02s)
  12493. 319.32 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12494. 319.34 s [vector] foldr: OK (0.02s)
  12495. 319.34 s [vector] +++ OK, passed 100 tests.
  12496. 319.35 s [vector] foldr1: OK (0.02s)
  12497. 319.35 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12498. 319.36 s [vector] foldr': OK (0.02s)
  12499. 319.36 s [vector] +++ OK, passed 100 tests.
  12500. 319.38 s [vector] foldr1': OK (0.01s)
  12501. 319.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12502. 319.40 s [vector] ifoldl: OK (0.02s)
  12503. 319.40 s [vector] +++ OK, passed 100 tests.
  12504. 319.41 s [vector] ifoldl': OK (0.02s)
  12505. 319.42 s [vector] +++ OK, passed 100 tests.
  12506. 319.42 s [vector] ifoldr: OK (0.02s)
  12507. 319.42 s [vector] +++ OK, passed 100 tests.
  12508. 319.44 s [vector] ifoldr': OK (0.02s)
  12509. 319.44 s [vector] +++ OK, passed 100 tests.
  12510. 319.46 s [vector] ifoldM: OK (0.02s)
  12511. 319.46 s [vector] +++ OK, passed 100 tests.
  12512. 319.48 s [vector] ifoldM': OK (0.02s)
  12513. 319.48 s [vector] +++ OK, passed 100 tests.
  12514. 319.52 s [vector] ifoldM_: OK (0.04s)
  12515. 319.52 s [vector] +++ OK, passed 100 tests.
  12516. 319.55 s [vector] ifoldM'_: OK (0.04s)
  12517. 319.55 s [vector] +++ OK, passed 100 tests.
  12518. 319.55 s [vector] all: OK
  12519. 319.55 s [vector] +++ OK, passed 100 tests.
  12520. 319.55 s [vector] any: OK
  12521. 319.55 s [vector] +++ OK, passed 100 tests.
  12522. 319.58 s [vector] prescanl: OK (0.02s)
  12523. 319.58 s [vector] +++ OK, passed 100 tests.
  12524. 319.60 s [vector] prescanl': OK (0.02s)
  12525. 319.60 s [vector] +++ OK, passed 100 tests.
  12526. 319.61 s [vector] postscanl: OK (0.02s)
  12527. 319.61 s [vector] +++ OK, passed 100 tests.
  12528. 319.62 s [vector] postscanl': OK (0.02s)
  12529. 319.62 s [vector] +++ OK, passed 100 tests.
  12530. 319.64 s [vector] scanl: OK (0.01s)
  12531. 319.64 s [vector] +++ OK, passed 100 tests.
  12532. 319.65 s [vector] scanl': OK (0.01s)
  12533. 319.65 s [vector] +++ OK, passed 100 tests.
  12534. 319.65 s [vector] scanl1: OK (0.02s)
  12535. 319.66 s [vector] +++ OK, passed 100 tests.
  12536. 319.67 s [vector] scanl1': OK (0.02s)
  12537. 319.67 s [vector] +++ OK, passed 100 tests.
  12538. 319.70 s [vector] iscanl: OK (0.01s)
  12539. 319.70 s [vector] +++ OK, passed 100 tests.
  12540. 319.71 s [vector] iscanl': OK (0.02s)
  12541. 319.71 s [vector] +++ OK, passed 100 tests.
  12542. 319.72 s [vector] prescanr: OK (0.01s)
  12543. 319.72 s [vector] +++ OK, passed 100 tests.
  12544. 319.74 s [vector] prescanr': OK (0.01s)
  12545. 319.74 s [vector] +++ OK, passed 100 tests.
  12546. 319.76 s [vector] postscanr: OK (0.02s)
  12547. 319.76 s [vector] +++ OK, passed 100 tests.
  12548. 319.76 s [vector] postscanr': OK (0.02s)
  12549. 319.76 s [vector] +++ OK, passed 100 tests.
  12550. 319.78 s [vector] scanr: OK
  12551. 319.80 s [vector] +++ OK, passed 100 tests.
  12552. 319.80 s [vector] scanr': OK (0.01s)
  12553. 319.80 s [vector] +++ OK, passed 100 tests.
  12554. 319.82 s [vector] scanr1: OK
  12555. 319.82 s [vector] +++ OK, passed 100 tests.
  12556. 319.85 s [vector] scanr1': OK (0.01s)
  12557. 319.85 s [vector] +++ OK, passed 100 tests.
  12558. 319.85 s [vector] iscanr: OK (0.01s)
  12559. 319.85 s [vector] +++ OK, passed 100 tests.
  12560. 319.85 s [vector] iscanr': OK (0.02s)
  12561. 319.85 s [vector] +++ OK, passed 100 tests.
  12562. 319.86 s [vector] mut_read: OK
  12563. 319.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12564. 319.86 s [vector] mut_write: OK
  12565. 319.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12566. 319.86 s [vector] mut_modify: OK
  12567. 319.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12568. 319.86 s [vector] mut_generate: OK
  12569. 319.88 s [vector] +++ OK, passed 100 tests.
  12570. 319.90 s [vector] mut_generateM: OK (0.02s)
  12571. 319.90 s [vector] +++ OK, passed 100 tests.
  12572. 319.94 s [vector] mut_mapM_: OK (0.04s)
  12573. 319.94 s [vector] +++ OK, passed 100 tests.
  12574. 319.96 s [vector] mut_imapM_: OK (0.03s)
  12575. 319.96 s [vector] +++ OK, passed 100 tests.
  12576. 320.00 s [vector] mut_forM_: OK (0.03s)
  12577. 320.00 s [vector] +++ OK, passed 100 tests.
  12578. 320.04 s [vector] mut_iforM_: OK (0.04s)
  12579. 320.04 s [vector] +++ OK, passed 100 tests.
  12580. 320.06 s [vector] mut_foldr: OK (0.02s)
  12581. 320.06 s [vector] +++ OK, passed 100 tests.
  12582. 320.08 s [vector] mut_foldr': OK (0.02s)
  12583. 320.08 s [vector] +++ OK, passed 100 tests.
  12584. 320.09 s [vector] mut_foldl: OK (0.02s)
  12585. 320.09 s [vector] +++ OK, passed 100 tests.
  12586. 320.10 s [vector] mut_foldl': OK (0.02s)
  12587. 320.10 s [vector] +++ OK, passed 100 tests.
  12588. 320.12 s [vector] mut_ifoldr: OK (0.01s)
  12589. 320.12 s [vector] +++ OK, passed 100 tests.
  12590. 320.14 s [vector] mut_ifoldr': OK (0.02s)
  12591. 320.14 s [vector] +++ OK, passed 100 tests.
  12592. 320.16 s [vector] mut_ifoldl: OK (0.03s)
  12593. 320.16 s [vector] +++ OK, passed 100 tests.
  12594. 320.18 s [vector] mut_ifoldl': OK (0.02s)
  12595. 320.18 s [vector] +++ OK, passed 100 tests.
  12596. 320.20 s [vector] mut_foldM: OK (0.02s)
  12597. 320.20 s [vector] +++ OK, passed 100 tests.
  12598. 320.22 s [vector] mut_foldM': OK (0.02s)
  12599. 320.22 s [vector] +++ OK, passed 100 tests.
  12600. 320.23 s [vector] mut_foldrM: OK (0.01s)
  12601. 320.23 s [vector] +++ OK, passed 100 tests.
  12602. 320.24 s [vector] mut_foldrM': OK (0.02s)
  12603. 320.24 s [vector] +++ OK, passed 100 tests.
  12604. 320.25 s [vector] mut_ifoldM: OK (0.02s)
  12605. 320.25 s [vector] +++ OK, passed 100 tests.
  12606. 320.26 s [vector] mut_ifoldM': OK
  12607. 320.28 s [vector] +++ OK, passed 100 tests.
  12608. 320.29 s [vector] mut_ifoldrM: OK (0.02s)
  12609. 320.29 s [vector] +++ OK, passed 100 tests.
  12610. 320.29 s [vector] mut_ifoldrM': OK (0.01s)
  12611. 320.29 s [vector] +++ OK, passed 100 tests.
  12612. 320.30 s [vector] compare: OK
  12613. 320.30 s [vector] +++ OK, passed 100 tests.
  12614. 320.30 s [vector] maximum: OK
  12615. 320.30 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12616. 320.30 s [vector] minimum: OK
  12617. 320.30 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12618. 320.30 s [vector] minIndex: OK
  12619. 320.30 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12620. 320.30 s [vector] maxIndex: OK
  12621. 320.30 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12622. 320.30 s [vector] maximumBy: OK
  12623. 320.30 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12624. 320.30 s [vector] minimumBy: OK
  12625. 320.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12626. 320.30 s [vector] maximumOn: OK
  12627. 320.30 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12628. 320.30 s [vector] minimumOn: OK
  12629. 320.30 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12630. 320.31 s [vector] maxIndexBy: OK
  12631. 320.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12632. 320.31 s [vector] minIndexBy: OK
  12633. 320.31 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12634. 320.31 s [vector] ListFirstMaxIndexWins: OK
  12635. 320.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12636. 320.31 s [vector] FalseListFirstMaxIndexWins: OK
  12637. 320.31 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  12638. 320.31 s [vector] []
  12639. 320.31 s [vector] zip: OK
  12640. 320.31 s [vector] +++ OK, passed 100 tests.
  12641. 320.31 s [vector] zip3: OK
  12642. 320.31 s [vector] +++ OK, passed 100 tests.
  12643. 320.31 s [vector] unzip: OK
  12644. 320.31 s [vector] +++ OK, passed 100 tests.
  12645. 320.31 s [vector] unzip3: OK
  12646. 320.31 s [vector] +++ OK, passed 100 tests.
  12647. 320.32 s [vector] indexed: OK
  12648. 320.32 s [vector] +++ OK, passed 100 tests.
  12649. 320.32 s [vector] update: OK
  12650. 320.32 s [vector] +++ OK, passed 100 tests.
  12651. 320.32 s [vector] mempty: OK
  12652. 320.32 s [vector] +++ OK, passed 1 test.
  12653. 320.32 s [vector] mappend: OK
  12654. 320.32 s [vector] +++ OK, passed 100 tests.
  12655. 320.34 s [vector] mconcat: OK (0.02s)
  12656. 320.34 s [vector] +++ OK, passed 100 tests.
  12657. 320.34 s [vector] glength: OK
  12658. 320.34 s [vector] +++ OK, passed 100 tests.
  12659. 320.34 s [vector] sum: OK
  12660. 320.34 s [vector] +++ OK, passed 100 tests.
  12661. 320.34 s [vector] product: OK
  12662. 320.34 s [vector] +++ OK, passed 100 tests.
  12663. 320.34 s [vector] enumFromN: OK
  12664. 320.34 s [vector] +++ OK, passed 100 tests.
  12665. 320.34 s [vector] enumFromThenN: OK
  12666. 320.34 s [vector] +++ OK, passed 100 tests.
  12667. 320.35 s [vector] enumFromTo: OK
  12668. 320.35 s [vector] +++ OK, passed 100 tests.
  12669. 320.35 s [vector] enumFromThenTo: OK
  12670. 320.35 s [vector] +++ OK, passed 100 tests.
  12671. 320.35 s [vector] (Int,Bool)
  12672. 320.35 s [vector] fromList.toList == id: OK
  12673. 320.35 s [vector] +++ OK, passed 100 tests.
  12674. 320.35 s [vector] toList.fromList == id: OK
  12675. 320.35 s [vector] +++ OK, passed 100 tests.
  12676. 320.35 s [vector] unstream.stream == id: OK
  12677. 320.35 s [vector] +++ OK, passed 100 tests.
  12678. 320.35 s [vector] stream.unstream == id: OK
  12679. 320.35 s [vector] +++ OK, passed 100 tests.
  12680. 320.35 s [vector] eq: OK
  12681. 320.35 s [vector] +++ OK, passed 100 tests.
  12682. 320.35 s [vector] length: OK
  12683. 320.35 s [vector] +++ OK, passed 100 tests.
  12684. 320.35 s [vector] null: OK
  12685. 320.35 s [vector] +++ OK, passed 100 tests.
  12686. 320.35 s [vector] index: OK
  12687. 320.35 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12688. 320.35 s [vector] safeIndex: OK
  12689. 320.35 s [vector] +++ OK, passed 100 tests.
  12690. 320.36 s [vector] head: OK
  12691. 320.36 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12692. 320.36 s [vector] last: OK
  12693. 320.36 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12694. 320.36 s [vector] unsafeIndex: OK
  12695. 320.36 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12696. 320.36 s [vector] unsafeHead: OK
  12697. 320.36 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12698. 320.36 s [vector] unsafeLast: OK
  12699. 320.36 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12700. 320.36 s [vector] slice: OK
  12701. 320.36 s [vector] +++ OK, passed 100 tests.
  12702. 320.36 s [vector] init: OK
  12703. 320.36 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12704. 320.36 s [vector] tail: OK
  12705. 320.36 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12706. 320.37 s [vector] take: OK
  12707. 320.37 s [vector] +++ OK, passed 100 tests.
  12708. 320.37 s [vector] drop: OK
  12709. 320.37 s [vector] +++ OK, passed 100 tests.
  12710. 320.37 s [vector] splitAt: OK
  12711. 320.37 s [vector] +++ OK, passed 100 tests.
  12712. 320.37 s [vector] empty: OK
  12713. 320.37 s [vector] +++ OK, passed 1 test.
  12714. 320.37 s [vector] singleton: OK
  12715. 320.37 s [vector] +++ OK, passed 100 tests.
  12716. 320.37 s [vector] replicate: OK
  12717. 320.37 s [vector] +++ OK, passed 100 tests.
  12718. 320.37 s [vector] generate: OK
  12719. 320.37 s [vector] +++ OK, passed 100 tests.
  12720. 320.38 s [vector] iterateN: OK
  12721. 320.38 s [vector] +++ OK, passed 100 tests.
  12722. 320.40 s [vector] iterateNM: OK (0.02s)
  12723. 320.40 s [vector] +++ OK, passed 100 tests.
  12724. 320.44 s [vector] generateM: OK (0.04s)
  12725. 320.44 s [vector] +++ OK, passed 100 tests.
  12726. 320.46 s [vector] replicateM: OK (0.02s)
  12727. 320.46 s [vector] +++ OK, passed 100 tests.
  12728. 320.46 s [vector] create: OK
  12729. 320.46 s [vector] +++ OK, passed 100 tests.
  12730. 320.46 s [vector] createT: OK
  12731. 320.46 s [vector] +++ OK, passed 100 tests.
  12732. 320.46 s [vector] unfoldr: OK
  12733. 320.46 s [vector] +++ OK, passed 100 tests.
  12734. 320.46 s [vector] unfoldrN: OK
  12735. 320.46 s [vector] +++ OK, passed 100 tests.
  12736. 320.47 s [vector] unfoldrExactN: OK
  12737. 320.47 s [vector] +++ OK, passed 100 tests.
  12738. 320.47 s [vector] unfoldrM: OK
  12739. 320.47 s [vector] +++ OK, passed 100 tests.
  12740. 320.47 s [vector] unfoldrNM: OK
  12741. 320.47 s [vector] +++ OK, passed 100 tests.
  12742. 320.48 s [vector] unfoldrExactNM: OK
  12743. 320.49 s [vector] +++ OK, passed 100 tests.
  12744. 320.49 s [vector] constructN: OK
  12745. 320.49 s [vector] +++ OK, passed 100 tests.
  12746. 320.49 s [vector] constructrN: OK
  12747. 320.49 s [vector] +++ OK, passed 100 tests.
  12748. 320.49 s [vector] cons: OK
  12749. 320.50 s [vector] +++ OK, passed 100 tests.
  12750. 320.50 s [vector] snoc: OK
  12751. 320.50 s [vector] +++ OK, passed 100 tests.
  12752. 320.52 s [vector] append: OK
  12753. 320.52 s [vector] +++ OK, passed 100 tests.
  12754. 320.54 s [vector] concat: OK (0.04s)
  12755. 320.54 s [vector] +++ OK, passed 100 tests.
  12756. 320.54 s [vector] force: OK
  12757. 320.54 s [vector] +++ OK, passed 100 tests.
  12758. 320.54 s [vector] upd: OK
  12759. 320.55 s [vector] +++ OK, passed 100 tests.
  12760. 320.55 s [vector] accum: OK
  12761. 320.55 s [vector] +++ OK, passed 100 tests.
  12762. 320.55 s [vector] reverse: OK
  12763. 320.55 s [vector] +++ OK, passed 100 tests.
  12764. 320.55 s [vector] backpermute: OK
  12765. 320.55 s [vector] +++ OK, passed 100 tests.
  12766. 320.56 s [vector] map: OK
  12767. 320.56 s [vector] +++ OK, passed 100 tests.
  12768. 320.57 s [vector] imap: OK
  12769. 320.57 s [vector] +++ OK, passed 100 tests.
  12770. 320.57 s [vector] concatMap: OK
  12771. 320.57 s [vector] +++ OK, passed 100 tests.
  12772. 320.57 s [vector] mapM: OK
  12773. 320.58 s [vector] +++ OK, passed 100 tests.
  12774. 320.60 s [vector] mapM_: OK (0.03s)
  12775. 320.60 s [vector] +++ OK, passed 100 tests.
  12776. 320.62 s [vector] forM: OK
  12777. 320.62 s [vector] +++ OK, passed 100 tests.
  12778. 320.64 s [vector] forM_: OK (0.03s)
  12779. 320.64 s [vector] +++ OK, passed 100 tests.
  12780. 320.66 s [vector] imapM: OK
  12781. 320.66 s [vector] +++ OK, passed 100 tests.
  12782. 320.66 s [vector] imapM_: OK (0.02s)
  12783. 320.67 s [vector] +++ OK, passed 100 tests.
  12784. 320.68 s [vector] zipWith: OK
  12785. 320.68 s [vector] +++ OK, passed 100 tests.
  12786. 320.68 s [vector] zipWith3: OK
  12787. 320.68 s [vector] +++ OK, passed 100 tests.
  12788. 320.68 s [vector] izipWith: OK
  12789. 320.68 s [vector] +++ OK, passed 100 tests.
  12790. 320.68 s [vector] izipWith3: OK
  12791. 320.70 s [vector] +++ OK, passed 100 tests.
  12792. 320.70 s [vector] izipWithM: OK
  12793. 320.70 s [vector] +++ OK, passed 100 tests.
  12794. 320.71 s [vector] izipWithM_: OK (0.02s)
  12795. 320.72 s [vector] +++ OK, passed 100 tests.
  12796. 320.72 s [vector] zipWithM: OK
  12797. 320.72 s [vector] +++ OK, passed 100 tests.
  12798. 320.73 s [vector] zipWithM_: OK (0.02s)
  12799. 320.74 s [vector] +++ OK, passed 100 tests.
  12800. 320.76 s [vector] filter: OK
  12801. 320.76 s [vector] +++ OK, passed 100 tests.
  12802. 320.76 s [vector] ifilter: OK
  12803. 320.76 s [vector] +++ OK, passed 100 tests.
  12804. 320.78 s [vector] filterM: OK (0.04s)
  12805. 320.78 s [vector] +++ OK, passed 100 tests.
  12806. 320.78 s [vector] uniq: OK
  12807. 320.79 s [vector] +++ OK, passed 100 tests.
  12808. 320.79 s [vector] mapMaybe: OK
  12809. 320.79 s [vector] +++ OK, passed 100 tests.
  12810. 320.79 s [vector] imapMaybe: OK
  12811. 320.79 s [vector] +++ OK, passed 100 tests.
  12812. 320.79 s [vector] takeWhile: OK
  12813. 320.79 s [vector] +++ OK, passed 100 tests.
  12814. 320.79 s [vector] dropWhile: OK
  12815. 320.79 s [vector] +++ OK, passed 100 tests.
  12816. 320.79 s [vector] partition: OK
  12817. 320.79 s [vector] +++ OK, passed 100 tests.
  12818. 320.80 s [vector] partitionWith: OK
  12819. 320.80 s [vector] +++ OK, passed 100 tests.
  12820. 320.80 s [vector] span: OK
  12821. 320.80 s [vector] +++ OK, passed 100 tests.
  12822. 320.80 s [vector] break: OK
  12823. 320.80 s [vector] +++ OK, passed 100 tests.
  12824. 320.80 s [vector] spanR: OK
  12825. 320.80 s [vector] +++ OK, passed 100 tests.
  12826. 320.81 s [vector] breakR: OK
  12827. 320.81 s [vector] +++ OK, passed 100 tests.
  12828. 320.81 s [vector] groupBy: OK
  12829. 320.81 s [vector] +++ OK, passed 100 tests.
  12830. 320.81 s [vector] elem: OK
  12831. 320.81 s [vector] +++ OK, passed 100 tests.
  12832. 320.81 s [vector] notElem: OK
  12833. 320.81 s [vector] +++ OK, passed 100 tests.
  12834. 320.81 s [vector] find: OK
  12835. 320.81 s [vector] +++ OK, passed 100 tests.
  12836. 320.82 s [vector] findIndex: OK
  12837. 320.82 s [vector] +++ OK, passed 100 tests.
  12838. 320.82 s [vector] findIndexR: OK
  12839. 320.82 s [vector] +++ OK, passed 100 tests.
  12840. 320.82 s [vector] findIndices: OK
  12841. 320.82 s [vector] +++ OK, passed 100 tests.
  12842. 320.82 s [vector] elemIndex: OK
  12843. 320.82 s [vector] +++ OK, passed 100 tests.
  12844. 320.82 s [vector] elemIndices: OK
  12845. 320.82 s [vector] +++ OK, passed 100 tests.
  12846. 320.82 s [vector] foldl: OK
  12847. 320.82 s [vector] +++ OK, passed 100 tests.
  12848. 320.83 s [vector] foldl1: OK
  12849. 320.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12850. 320.83 s [vector] foldl': OK
  12851. 320.83 s [vector] +++ OK, passed 100 tests.
  12852. 320.83 s [vector] foldl1': OK
  12853. 320.83 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12854. 320.84 s [vector] foldr: OK
  12855. 320.84 s [vector] +++ OK, passed 100 tests.
  12856. 320.84 s [vector] foldr1: OK
  12857. 320.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12858. 320.85 s [vector] foldr': OK
  12859. 320.85 s [vector] +++ OK, passed 100 tests.
  12860. 320.86 s [vector] foldr1': OK
  12861. 320.86 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12862. 320.86 s [vector] ifoldl: OK
  12863. 320.86 s [vector] +++ OK, passed 100 tests.
  12864. 320.86 s [vector] ifoldl': OK
  12865. 320.86 s [vector] +++ OK, passed 100 tests.
  12866. 320.86 s [vector] ifoldr: OK
  12867. 320.86 s [vector] +++ OK, passed 100 tests.
  12868. 320.86 s [vector] ifoldr': OK
  12869. 320.86 s [vector] +++ OK, passed 100 tests.
  12870. 320.87 s [vector] ifoldM: OK
  12871. 320.87 s [vector] +++ OK, passed 100 tests.
  12872. 320.88 s [vector] ifoldM': OK
  12873. 320.88 s [vector] +++ OK, passed 100 tests.
  12874. 320.92 s [vector] ifoldM_: OK (0.03s)
  12875. 320.92 s [vector] +++ OK, passed 100 tests.
  12876. 320.93 s [vector] ifoldM'_: OK (0.03s)
  12877. 320.93 s [vector] +++ OK, passed 100 tests.
  12878. 320.93 s [vector] all: OK
  12879. 320.93 s [vector] +++ OK, passed 100 tests.
  12880. 320.93 s [vector] any: OK
  12881. 320.93 s [vector] +++ OK, passed 100 tests.
  12882. 320.94 s [vector] prescanl: OK
  12883. 320.94 s [vector] +++ OK, passed 100 tests.
  12884. 320.94 s [vector] prescanl': OK
  12885. 320.94 s [vector] +++ OK, passed 100 tests.
  12886. 320.95 s [vector] postscanl: OK
  12887. 320.95 s [vector] +++ OK, passed 100 tests.
  12888. 320.96 s [vector] postscanl': OK
  12889. 320.96 s [vector] +++ OK, passed 100 tests.
  12890. 320.96 s [vector] scanl: OK
  12891. 320.96 s [vector] +++ OK, passed 100 tests.
  12892. 320.96 s [vector] scanl': OK
  12893. 320.96 s [vector] +++ OK, passed 100 tests.
  12894. 320.96 s [vector] scanl1: OK
  12895. 320.96 s [vector] +++ OK, passed 100 tests.
  12896. 320.96 s [vector] scanl1': OK
  12897. 320.97 s [vector] +++ OK, passed 100 tests.
  12898. 320.97 s [vector] iscanl: OK
  12899. 320.97 s [vector] +++ OK, passed 100 tests.
  12900. 320.98 s [vector] iscanl': OK
  12901. 320.98 s [vector] +++ OK, passed 100 tests.
  12902. 320.98 s [vector] prescanr: OK
  12903. 320.99 s [vector] +++ OK, passed 100 tests.
  12904. 320.99 s [vector] prescanr': OK
  12905. 320.99 s [vector] +++ OK, passed 100 tests.
  12906. 320.99 s [vector] postscanr: OK
  12907. 320.99 s [vector] +++ OK, passed 100 tests.
  12908. 321.00 s [vector] postscanr': OK
  12909. 321.00 s [vector] +++ OK, passed 100 tests.
  12910. 321.01 s [vector] scanr: OK
  12911. 321.01 s [vector] +++ OK, passed 100 tests.
  12912. 321.01 s [vector] scanr': OK
  12913. 321.01 s [vector] +++ OK, passed 100 tests.
  12914. 321.01 s [vector] scanr1: OK
  12915. 321.01 s [vector] +++ OK, passed 100 tests.
  12916. 321.01 s [vector] scanr1': OK
  12917. 321.02 s [vector] +++ OK, passed 100 tests.
  12918. 321.02 s [vector] iscanr: OK
  12919. 321.02 s [vector] +++ OK, passed 100 tests.
  12920. 321.03 s [vector] iscanr': OK
  12921. 321.03 s [vector] +++ OK, passed 100 tests.
  12922. 321.03 s [vector] mut_read: OK
  12923. 321.03 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12924. 321.03 s [vector] mut_write: OK
  12925. 321.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12926. 321.03 s [vector] mut_modify: OK
  12927. 321.03 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12928. 321.03 s [vector] mut_generate: OK
  12929. 321.04 s [vector] +++ OK, passed 100 tests.
  12930. 321.06 s [vector] mut_generateM: OK (0.02s)
  12931. 321.06 s [vector] +++ OK, passed 100 tests.
  12932. 321.10 s [vector] mut_mapM_: OK (0.03s)
  12933. 321.10 s [vector] +++ OK, passed 100 tests.
  12934. 321.12 s [vector] mut_imapM_: OK (0.03s)
  12935. 321.12 s [vector] +++ OK, passed 100 tests.
  12936. 321.16 s [vector] mut_forM_: OK (0.01s)
  12937. 321.16 s [vector] +++ OK, passed 100 tests.
  12938. 321.18 s [vector] mut_iforM_: OK (0.03s)
  12939. 321.18 s [vector] +++ OK, passed 100 tests.
  12940. 321.19 s [vector] mut_foldr: OK
  12941. 321.19 s [vector] +++ OK, passed 100 tests.
  12942. 321.19 s [vector] mut_foldr': OK
  12943. 321.19 s [vector] +++ OK, passed 100 tests.
  12944. 321.19 s [vector] mut_foldl: OK
  12945. 321.19 s [vector] +++ OK, passed 100 tests.
  12946. 321.20 s [vector] mut_foldl': OK
  12947. 321.20 s [vector] +++ OK, passed 100 tests.
  12948. 321.20 s [vector] mut_ifoldr: OK
  12949. 321.21 s [vector] +++ OK, passed 100 tests.
  12950. 321.21 s [vector] mut_ifoldr': OK
  12951. 321.21 s [vector] +++ OK, passed 100 tests.
  12952. 321.22 s [vector] mut_ifoldl: OK
  12953. 321.22 s [vector] +++ OK, passed 100 tests.
  12954. 321.22 s [vector] mut_ifoldl': OK
  12955. 321.22 s [vector] +++ OK, passed 100 tests.
  12956. 321.22 s [vector] mut_foldM: OK
  12957. 321.22 s [vector] +++ OK, passed 100 tests.
  12958. 321.23 s [vector] mut_foldM': OK
  12959. 321.23 s [vector] +++ OK, passed 100 tests.
  12960. 321.23 s [vector] mut_foldrM: OK
  12961. 321.23 s [vector] +++ OK, passed 100 tests.
  12962. 321.24 s [vector] mut_foldrM': OK
  12963. 321.24 s [vector] +++ OK, passed 100 tests.
  12964. 321.25 s [vector] mut_ifoldM: OK
  12965. 321.25 s [vector] +++ OK, passed 100 tests.
  12966. 321.25 s [vector] mut_ifoldM': OK
  12967. 321.25 s [vector] +++ OK, passed 100 tests.
  12968. 321.25 s [vector] mut_ifoldrM: OK
  12969. 321.26 s [vector] +++ OK, passed 100 tests.
  12970. 321.26 s [vector] mut_ifoldrM': OK
  12971. 321.26 s [vector] +++ OK, passed 100 tests.
  12972. 321.26 s [vector] compare: OK
  12973. 321.26 s [vector] +++ OK, passed 100 tests.
  12974. 321.26 s [vector] maximum: OK
  12975. 321.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12976. 321.26 s [vector] minimum: OK
  12977. 321.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12978. 321.26 s [vector] minIndex: OK
  12979. 321.26 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12980. 321.26 s [vector] maxIndex: OK
  12981. 321.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12982. 321.26 s [vector] maximumBy: OK
  12983. 321.26 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12984. 321.26 s [vector] minimumBy: OK
  12985. 321.26 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12986. 321.27 s [vector] maximumOn: OK
  12987. 321.27 s [vector] +++ OK, passed 100 tests; 24 discarded.
  12988. 321.27 s [vector] minimumOn: OK
  12989. 321.27 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12990. 321.27 s [vector] maxIndexBy: OK
  12991. 321.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12992. 321.27 s [vector] minIndexBy: OK
  12993. 321.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12994. 321.27 s [vector] ListFirstMaxIndexWins: OK
  12995. 321.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12996. 321.27 s [vector] FalseListFirstMaxIndexWins: OK
  12997. 321.27 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  12998. 321.27 s [vector] []
  12999. 321.27 s [vector] zip: OK
  13000. 321.27 s [vector] +++ OK, passed 100 tests.
  13001. 321.28 s [vector] zip3: OK
  13002. 321.28 s [vector] +++ OK, passed 100 tests.
  13003. 321.28 s [vector] unzip: OK
  13004. 321.28 s [vector] +++ OK, passed 100 tests.
  13005. 321.28 s [vector] unzip3: OK
  13006. 321.28 s [vector] +++ OK, passed 100 tests.
  13007. 321.29 s [vector] indexed: OK
  13008. 321.29 s [vector] +++ OK, passed 100 tests.
  13009. 321.29 s [vector] update: OK
  13010. 321.29 s [vector] +++ OK, passed 100 tests.
  13011. 321.30 s [vector] mempty: OK
  13012. 321.30 s [vector] +++ OK, passed 1 test.
  13013. 321.30 s [vector] mappend: OK
  13014. 321.30 s [vector] +++ OK, passed 100 tests.
  13015. 321.34 s [vector] mconcat: OK (0.04s)
  13016. 321.34 s [vector] +++ OK, passed 100 tests.
  13017. 321.34 s [vector] glength: OK
  13018. 321.34 s [vector] +++ OK, passed 100 tests.
  13019. 321.34 s [vector] (Int,Bool,Int)
  13020. 321.34 s [vector] fromList.toList == id: OK
  13021. 321.34 s [vector] +++ OK, passed 100 tests.
  13022. 321.34 s [vector] toList.fromList == id: OK
  13023. 321.34 s [vector] +++ OK, passed 100 tests.
  13024. 321.34 s [vector] unstream.stream == id: OK
  13025. 321.34 s [vector] +++ OK, passed 100 tests.
  13026. 321.34 s [vector] stream.unstream == id: OK
  13027. 321.34 s [vector] +++ OK, passed 100 tests.
  13028. 321.34 s [vector] eq: OK
  13029. 321.34 s [vector] +++ OK, passed 100 tests.
  13030. 321.35 s [vector] length: OK
  13031. 321.35 s [vector] +++ OK, passed 100 tests.
  13032. 321.35 s [vector] null: OK
  13033. 321.35 s [vector] +++ OK, passed 100 tests.
  13034. 321.35 s [vector] index: OK
  13035. 321.35 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13036. 321.35 s [vector] safeIndex: OK
  13037. 321.35 s [vector] +++ OK, passed 100 tests.
  13038. 321.35 s [vector] head: OK
  13039. 321.35 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13040. 321.35 s [vector] last: OK
  13041. 321.35 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13042. 321.35 s [vector] unsafeIndex: OK
  13043. 321.35 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13044. 321.35 s [vector] unsafeHead: OK
  13045. 321.35 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13046. 321.35 s [vector] unsafeLast: OK
  13047. 321.35 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13048. 321.36 s [vector] slice: OK
  13049. 321.36 s [vector] +++ OK, passed 100 tests.
  13050. 321.36 s [vector] init: OK
  13051. 321.36 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13052. 321.36 s [vector] tail: OK
  13053. 321.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13054. 321.36 s [vector] take: OK
  13055. 321.36 s [vector] +++ OK, passed 100 tests.
  13056. 321.37 s [vector] drop: OK
  13057. 321.37 s [vector] +++ OK, passed 100 tests.
  13058. 321.37 s [vector] splitAt: OK
  13059. 321.37 s [vector] +++ OK, passed 100 tests.
  13060. 321.37 s [vector] empty: OK
  13061. 321.37 s [vector] +++ OK, passed 1 test.
  13062. 321.37 s [vector] singleton: OK
  13063. 321.37 s [vector] +++ OK, passed 100 tests.
  13064. 321.37 s [vector] replicate: OK
  13065. 321.37 s [vector] +++ OK, passed 100 tests.
  13066. 321.37 s [vector] generate: OK
  13067. 321.37 s [vector] +++ OK, passed 100 tests.
  13068. 321.38 s [vector] iterateN: OK
  13069. 321.38 s [vector] +++ OK, passed 100 tests.
  13070. 321.40 s [vector] iterateNM: OK (0.01s)
  13071. 321.40 s [vector] +++ OK, passed 100 tests.
  13072. 321.44 s [vector] generateM: OK (0.05s)
  13073. 321.44 s [vector] +++ OK, passed 100 tests.
  13074. 321.45 s [vector] replicateM: OK (0.01s)
  13075. 321.45 s [vector] +++ OK, passed 100 tests.
  13076. 321.45 s [vector] create: OK
  13077. 321.45 s [vector] +++ OK, passed 100 tests.
  13078. 321.45 s [vector] createT: OK
  13079. 321.45 s [vector] +++ OK, passed 100 tests.
  13080. 321.45 s [vector] unfoldr: OK
  13081. 321.45 s [vector] +++ OK, passed 100 tests.
  13082. 321.45 s [vector] unfoldrN: OK
  13083. 321.46 s [vector] +++ OK, passed 100 tests.
  13084. 321.46 s [vector] unfoldrExactN: OK
  13085. 321.46 s [vector] +++ OK, passed 100 tests.
  13086. 321.46 s [vector] unfoldrM: OK
  13087. 321.46 s [vector] +++ OK, passed 100 tests.
  13088. 321.46 s [vector] unfoldrNM: OK
  13089. 321.46 s [vector] +++ OK, passed 100 tests.
  13090. 321.51 s [vector] unfoldrExactNM: OK (0.02s)
  13091. 321.51 s [vector] +++ OK, passed 100 tests.
  13092. 321.51 s [vector] constructN: OK (0.01s)
  13093. 321.51 s [vector] +++ OK, passed 100 tests.
  13094. 321.52 s [vector] constructrN: OK
  13095. 321.53 s [vector] +++ OK, passed 100 tests.
  13096. 321.53 s [vector] cons: OK
  13097. 321.53 s [vector] +++ OK, passed 100 tests.
  13098. 321.53 s [vector] snoc: OK
  13099. 321.53 s [vector] +++ OK, passed 100 tests.
  13100. 321.53 s [vector] append: OK
  13101. 321.54 s [vector] +++ OK, passed 100 tests.
  13102. 321.59 s [vector] concat: OK (0.05s)
  13103. 321.59 s [vector] +++ OK, passed 100 tests.
  13104. 321.59 s [vector] force: OK
  13105. 321.59 s [vector] +++ OK, passed 100 tests.
  13106. 321.59 s [vector] upd: OK
  13107. 321.60 s [vector] +++ OK, passed 100 tests.
  13108. 321.60 s [vector] accum: OK
  13109. 321.60 s [vector] +++ OK, passed 100 tests.
  13110. 321.60 s [vector] reverse: OK
  13111. 321.61 s [vector] +++ OK, passed 100 tests.
  13112. 321.62 s [vector] backpermute: OK
  13113. 321.62 s [vector] +++ OK, passed 100 tests.
  13114. 321.62 s [vector] map: OK
  13115. 321.62 s [vector] +++ OK, passed 100 tests.
  13116. 321.62 s [vector] imap: OK
  13117. 321.62 s [vector] +++ OK, passed 100 tests.
  13118. 321.62 s [vector] concatMap: OK
  13119. 321.62 s [vector] +++ OK, passed 100 tests.
  13120. 321.64 s [vector] mapM: OK
  13121. 321.64 s [vector] +++ OK, passed 100 tests.
  13122. 321.68 s [vector] mapM_: OK (0.05s)
  13123. 321.70 s [vector] +++ OK, passed 100 tests.
  13124. 321.70 s [vector] forM: OK
  13125. 321.70 s [vector] +++ OK, passed 100 tests.
  13126. 321.73 s [vector] forM_: OK (0.03s)
  13127. 321.73 s [vector] +++ OK, passed 100 tests.
  13128. 321.74 s [vector] imapM: OK
  13129. 321.74 s [vector] +++ OK, passed 100 tests.
  13130. 321.76 s [vector] imapM_: OK (0.03s)
  13131. 321.77 s [vector] +++ OK, passed 100 tests.
  13132. 321.78 s [vector] zipWith: OK
  13133. 321.78 s [vector] +++ OK, passed 100 tests.
  13134. 321.78 s [vector] zipWith3: OK
  13135. 321.78 s [vector] +++ OK, passed 100 tests.
  13136. 321.78 s [vector] izipWith: OK
  13137. 321.78 s [vector] +++ OK, passed 100 tests.
  13138. 321.79 s [vector] izipWith3: OK
  13139. 321.79 s [vector] +++ OK, passed 100 tests.
  13140. 321.80 s [vector] izipWithM: OK
  13141. 321.80 s [vector] +++ OK, passed 100 tests.
  13142. 321.83 s [vector] izipWithM_: OK (0.04s)
  13143. 321.83 s [vector] +++ OK, passed 100 tests.
  13144. 321.84 s [vector] zipWithM: OK
  13145. 321.84 s [vector] +++ OK, passed 100 tests.
  13146. 321.88 s [vector] zipWithM_: OK (0.03s)
  13147. 321.88 s [vector] +++ OK, passed 100 tests.
  13148. 321.88 s [vector] filter: OK
  13149. 321.88 s [vector] +++ OK, passed 100 tests.
  13150. 321.90 s [vector] ifilter: OK
  13151. 321.90 s [vector] +++ OK, passed 100 tests.
  13152. 321.94 s [vector] filterM: OK (0.06s)
  13153. 321.94 s [vector] +++ OK, passed 100 tests.
  13154. 321.94 s [vector] uniq: OK
  13155. 321.94 s [vector] +++ OK, passed 100 tests.
  13156. 321.95 s [vector] mapMaybe: OK
  13157. 321.95 s [vector] +++ OK, passed 100 tests.
  13158. 321.96 s [vector] imapMaybe: OK
  13159. 321.96 s [vector] +++ OK, passed 100 tests.
  13160. 321.96 s [vector] takeWhile: OK
  13161. 321.96 s [vector] +++ OK, passed 100 tests.
  13162. 321.96 s [vector] dropWhile: OK
  13163. 321.97 s [vector] +++ OK, passed 100 tests.
  13164. 321.97 s [vector] partition: OK
  13165. 321.97 s [vector] +++ OK, passed 100 tests.
  13166. 321.98 s [vector] partitionWith: OK
  13167. 321.98 s [vector] +++ OK, passed 100 tests.
  13168. 321.98 s [vector] span: OK
  13169. 321.98 s [vector] +++ OK, passed 100 tests.
  13170. 321.98 s [vector] break: OK
  13171. 321.98 s [vector] +++ OK, passed 100 tests.
  13172. 321.98 s [vector] spanR: OK
  13173. 321.99 s [vector] +++ OK, passed 100 tests.
  13174. 321.99 s [vector] breakR: OK
  13175. 321.99 s [vector] +++ OK, passed 100 tests.
  13176. 321.99 s [vector] groupBy: OK
  13177. 321.99 s [vector] +++ OK, passed 100 tests.
  13178. 321.99 s [vector] elem: OK
  13179. 321.99 s [vector] +++ OK, passed 100 tests.
  13180. 321.99 s [vector] notElem: OK
  13181. 321.99 s [vector] +++ OK, passed 100 tests.
  13182. 321.99 s [vector] find: OK
  13183. 321.99 s [vector] +++ OK, passed 100 tests.
  13184. 321.99 s [vector] findIndex: OK
  13185. 321.99 s [vector] +++ OK, passed 100 tests.
  13186. 321.99 s [vector] findIndexR: OK
  13187. 321.99 s [vector] +++ OK, passed 100 tests.
  13188. 322.00 s [vector] findIndices: OK
  13189. 322.00 s [vector] +++ OK, passed 100 tests.
  13190. 322.00 s [vector] elemIndex: OK
  13191. 322.00 s [vector] +++ OK, passed 100 tests.
  13192. 322.01 s [vector] elemIndices: OK
  13193. 322.01 s [vector] +++ OK, passed 100 tests.
  13194. 322.01 s [vector] foldl: OK
  13195. 322.01 s [vector] +++ OK, passed 100 tests.
  13196. 322.01 s [vector] foldl1: OK
  13197. 322.01 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13198. 322.02 s [vector] foldl': OK
  13199. 322.03 s [vector] +++ OK, passed 100 tests.
  13200. 322.03 s [vector] foldl1': OK
  13201. 322.03 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13202. 322.03 s [vector] foldr: OK
  13203. 322.03 s [vector] +++ OK, passed 100 tests.
  13204. 322.04 s [vector] foldr1: OK
  13205. 322.04 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13206. 322.04 s [vector] foldr': OK
  13207. 322.05 s [vector] +++ OK, passed 100 tests.
  13208. 322.06 s [vector] foldr1': OK
  13209. 322.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  13210. 322.07 s [vector] ifoldl: OK
  13211. 322.07 s [vector] +++ OK, passed 100 tests.
  13212. 322.08 s [vector] ifoldl': OK
  13213. 322.08 s [vector] +++ OK, passed 100 tests.
  13214. 322.08 s [vector] ifoldr: OK
  13215. 322.08 s [vector] +++ OK, passed 100 tests.
  13216. 322.08 s [vector] ifoldr': OK
  13217. 322.08 s [vector] +++ OK, passed 100 tests.
  13218. 322.08 s [vector] ifoldM: OK
  13219. 322.08 s [vector] +++ OK, passed 100 tests.
  13220. 322.08 s [vector] ifoldM': OK
  13221. 322.08 s [vector] +++ OK, passed 100 tests.
  13222. 322.14 s [vector] ifoldM_: OK (0.05s)
  13223. 322.14 s [vector] +++ OK, passed 100 tests.
  13224. 322.16 s [vector] ifoldM'_: OK (0.03s)
  13225. 322.16 s [vector] +++ OK, passed 100 tests.
  13226. 322.16 s [vector] all: OK
  13227. 322.16 s [vector] +++ OK, passed 100 tests.
  13228. 322.16 s [vector] any: OK
  13229. 322.16 s [vector] +++ OK, passed 100 tests.
  13230. 322.17 s [vector] prescanl: OK
  13231. 322.17 s [vector] +++ OK, passed 100 tests.
  13232. 322.18 s [vector] prescanl': OK
  13233. 322.18 s [vector] +++ OK, passed 100 tests.
  13234. 322.18 s [vector] postscanl: OK
  13235. 322.18 s [vector] +++ OK, passed 100 tests.
  13236. 322.19 s [vector] postscanl': OK
  13237. 322.19 s [vector] +++ OK, passed 100 tests.
  13238. 322.21 s [vector] scanl: OK
  13239. 322.21 s [vector] +++ OK, passed 100 tests.
  13240. 322.22 s [vector] scanl': OK
  13241. 322.22 s [vector] +++ OK, passed 100 tests.
  13242. 322.22 s [vector] scanl1: OK
  13243. 322.22 s [vector] +++ OK, passed 100 tests.
  13244. 322.22 s [vector] scanl1': OK
  13245. 322.22 s [vector] +++ OK, passed 100 tests.
  13246. 322.23 s [vector] iscanl: OK
  13247. 322.23 s [vector] +++ OK, passed 100 tests.
  13248. 322.24 s [vector] iscanl': OK
  13249. 322.24 s [vector] +++ OK, passed 100 tests.
  13250. 322.25 s [vector] prescanr: OK
  13251. 322.26 s [vector] +++ OK, passed 100 tests.
  13252. 322.26 s [vector] prescanr': OK
  13253. 322.26 s [vector] +++ OK, passed 100 tests.
  13254. 322.26 s [vector] postscanr: OK
  13255. 322.26 s [vector] +++ OK, passed 100 tests.
  13256. 322.26 s [vector] postscanr': OK
  13257. 322.27 s [vector] +++ OK, passed 100 tests.
  13258. 322.28 s [vector] scanr: OK
  13259. 322.28 s [vector] +++ OK, passed 100 tests.
  13260. 322.29 s [vector] scanr': OK (0.02s)
  13261. 322.30 s [vector] +++ OK, passed 100 tests.
  13262. 322.30 s [vector] scanr1: OK
  13263. 322.30 s [vector] +++ OK, passed 100 tests.
  13264. 322.30 s [vector] scanr1': OK
  13265. 322.31 s [vector] +++ OK, passed 100 tests.
  13266. 322.32 s [vector] iscanr: OK (0.01s)
  13267. 322.32 s [vector] +++ OK, passed 100 tests.
  13268. 322.32 s [vector] iscanr': OK
  13269. 322.32 s [vector] +++ OK, passed 100 tests.
  13270. 322.32 s [vector] mut_read: OK
  13271. 322.32 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13272. 322.32 s [vector] mut_write: OK
  13273. 322.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13274. 322.33 s [vector] mut_modify: OK
  13275. 322.34 s [vector] +++ OK, passed 100 tests; 12 discarded.
  13276. 322.34 s [vector] mut_generate: OK
  13277. 322.34 s [vector] +++ OK, passed 100 tests.
  13278. 322.36 s [vector] mut_generateM: OK (0.02s)
  13279. 322.36 s [vector] +++ OK, passed 100 tests.
  13280. 322.40 s [vector] mut_mapM_: OK (0.04s)
  13281. 322.40 s [vector] +++ OK, passed 100 tests.
  13282. 322.44 s [vector] mut_imapM_: OK (0.05s)
  13283. 322.44 s [vector] +++ OK, passed 100 tests.
  13284. 322.48 s [vector] mut_forM_: OK (0.04s)
  13285. 322.48 s [vector] +++ OK, passed 100 tests.
  13286. 322.52 s [vector] mut_iforM_: OK (0.05s)
  13287. 322.52 s [vector] +++ OK, passed 100 tests.
  13288. 322.52 s [vector] mut_foldr: OK
  13289. 322.52 s [vector] +++ OK, passed 100 tests.
  13290. 322.52 s [vector] mut_foldr': OK
  13291. 322.52 s [vector] +++ OK, passed 100 tests.
  13292. 322.54 s [vector] mut_foldl: OK
  13293. 322.54 s [vector] +++ OK, passed 100 tests.
  13294. 322.54 s [vector] mut_foldl': OK
  13295. 322.54 s [vector] +++ OK, passed 100 tests.
  13296. 322.54 s [vector] mut_ifoldr: OK
  13297. 322.54 s [vector] +++ OK, passed 100 tests.
  13298. 322.55 s [vector] mut_ifoldr': OK
  13299. 322.55 s [vector] +++ OK, passed 100 tests.
  13300. 322.55 s [vector] mut_ifoldl: OK
  13301. 322.55 s [vector] +++ OK, passed 100 tests.
  13302. 322.56 s [vector] mut_ifoldl': OK
  13303. 322.56 s [vector] +++ OK, passed 100 tests.
  13304. 322.56 s [vector] mut_foldM: OK
  13305. 322.56 s [vector] +++ OK, passed 100 tests.
  13306. 322.57 s [vector] mut_foldM': OK
  13307. 322.58 s [vector] +++ OK, passed 100 tests.
  13308. 322.58 s [vector] mut_foldrM: OK
  13309. 322.58 s [vector] +++ OK, passed 100 tests.
  13310. 322.58 s [vector] mut_foldrM': OK
  13311. 322.58 s [vector] +++ OK, passed 100 tests.
  13312. 322.59 s [vector] mut_ifoldM: OK
  13313. 322.60 s [vector] +++ OK, passed 100 tests.
  13314. 322.60 s [vector] mut_ifoldM': OK
  13315. 322.60 s [vector] +++ OK, passed 100 tests.
  13316. 322.60 s [vector] mut_ifoldrM: OK
  13317. 322.60 s [vector] +++ OK, passed 100 tests.
  13318. 322.60 s [vector] mut_ifoldrM': OK
  13319. 322.61 s [vector] +++ OK, passed 100 tests.
  13320. 322.61 s [vector] compare: OK
  13321. 322.61 s [vector] +++ OK, passed 100 tests.
  13322. 322.61 s [vector] maximum: OK
  13323. 322.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13324. 322.61 s [vector] minimum: OK
  13325. 322.61 s [vector] +++ OK, passed 100 tests; 24 discarded.
  13326. 322.61 s [vector] minIndex: OK
  13327. 322.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  13328. 322.61 s [vector] maxIndex: OK
  13329. 322.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  13330. 322.61 s [vector] maximumBy: OK
  13331. 322.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13332. 322.61 s [vector] minimumBy: OK
  13333. 322.61 s [vector] +++ OK, passed 100 tests; 11 discarded.
  13334. 322.61 s [vector] maximumOn: OK
  13335. 322.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13336. 322.61 s [vector] minimumOn: OK
  13337. 322.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13338. 322.62 s [vector] maxIndexBy: OK
  13339. 322.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13340. 322.62 s [vector] minIndexBy: OK
  13341. 322.62 s [vector] +++ OK, passed 100 tests; 29 discarded.
  13342. 322.62 s [vector] ListFirstMaxIndexWins: OK
  13343. 322.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13344. 322.62 s [vector] FalseListFirstMaxIndexWins: OK
  13345. 322.62 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  13346. 322.62 s [vector] []
  13347. 322.62 s [vector] zip: OK
  13348. 322.62 s [vector] +++ OK, passed 100 tests.
  13349. 322.63 s [vector] zip3: OK
  13350. 322.63 s [vector] +++ OK, passed 100 tests.
  13351. 322.64 s [vector] unzip: OK
  13352. 322.64 s [vector] +++ OK, passed 100 tests.
  13353. 322.64 s [vector] unzip3: OK
  13354. 322.64 s [vector] +++ OK, passed 100 tests.
  13355. 322.64 s [vector] indexed: OK
  13356. 322.64 s [vector] +++ OK, passed 100 tests.
  13357. 322.64 s [vector] update: OK
  13358. 322.64 s [vector] +++ OK, passed 100 tests.
  13359. 322.64 s [vector] mempty: OK
  13360. 322.65 s [vector] +++ OK, passed 1 test.
  13361. 322.66 s [vector] mappend: OK
  13362. 322.66 s [vector] +++ OK, passed 100 tests.
  13363. 322.70 s [vector] mconcat: OK (0.05s)
  13364. 322.70 s [vector] +++ OK, passed 100 tests.
  13365. 322.70 s [vector] glength: OK
  13366. 322.70 s [vector] +++ OK, passed 100 tests.
  13367. 322.70 s [vector] unstream
  13368. 322.70 s [vector] unstream == vunstream (exact): OK
  13369. 322.70 s [vector] +++ OK, passed 100 tests.
  13370. 322.70 s [vector] unstream == vunstream (unknown): OK
  13371. 322.70 s [vector] +++ OK, passed 100 tests.
  13372. 322.70 s [vector] unstreamR ~= vunstream (exact): OK
  13373. 322.70 s [vector] +++ OK, passed 100 tests.
  13374. 322.70 s [vector] unstreamR ~= vunstream (unknown): OK
  13375. 322.70 s [vector] +++ OK, passed 100 tests.
  13376. 322.70 s [vector] Data.Vector.Storable.Vector Alignment
  13377. 322.70 s [vector] Aligned Double: OK
  13378. 322.70 s [vector] Aligned Int: OK
  13379. 322.70 s [vector] Regression tests
  13380. 322.70 s [vector] enumFromTo crash #188
  13381. 322.70 s [vector] Word8: OK
  13382. 322.70 s [vector] Word16: OK
  13383. 322.70 s [vector] Word32: OK
  13384. 322.70 s [vector] Word64: OK
  13385. 322.70 s [vector] Word: OK
  13386. 322.70 s [vector] Int8: OK
  13387. 322.70 s [vector] Int16: OK
  13388. 322.70 s [vector] Int32: OK
  13389. 322.70 s [vector] Int64: OK
  13390. 322.70 s [vector] Int: OK
  13391. 322.70 s [vector] Char: OK
  13392. 322.70 s [vector] Negative tests
  13393. 322.70 s [vector] slice out of bounds #257
  13394. 322.70 s [vector] Boxed
  13395. 322.70 s [vector] Negative ix: OK
  13396. 322.70 s [vector] Negative size: OK
  13397. 322.70 s [vector] Negative ix and size: OK
  13398. 322.70 s [vector] Too large ix: OK
  13399. 322.70 s [vector] Too large size: OK
  13400. 322.70 s [vector] Too large ix and size: OK
  13401. 322.70 s [vector] Overflow: OK
  13402. 322.70 s [vector] OutOfMemory: OK
  13403. 322.70 s [vector] Primitive
  13404. 322.71 s [vector] Negative ix: OK
  13405. 322.71 s [vector] Negative size: OK
  13406. 322.71 s [vector] Negative ix and size: OK
  13407. 322.71 s [vector] Too large ix: OK
  13408. 322.71 s [vector] Too large size: OK
  13409. 322.71 s [vector] Too large ix and size: OK
  13410. 322.71 s [vector] Overflow: OK
  13411. 322.71 s [vector] OutOfMemory: OK
  13412. 322.71 s [vector] Storable
  13413. 322.71 s [vector] Negative ix: OK
  13414. 322.71 s [vector] Negative size: OK
  13415. 322.71 s [vector] Negative ix and size: OK
  13416. 322.71 s [vector] Too large ix: OK
  13417. 322.71 s [vector] Too large size: OK
  13418. 322.71 s [vector] Too large ix and size: OK
  13419. 322.71 s [vector] Overflow: OK
  13420. 322.71 s [vector] OutOfMemory: OK
  13421. 322.71 s [vector] Unboxed
  13422. 322.71 s [vector] Negative ix: OK
  13423. 322.71 s [vector] Negative size: OK
  13424. 322.71 s [vector] Negative ix and size: OK
  13425. 322.71 s [vector] Too large ix: OK
  13426. 322.71 s [vector] Too large size: OK
  13427. 322.71 s [vector] Too large ix and size: OK
  13428. 322.71 s [vector] Overflow: OK
  13429. 322.71 s [vector] OutOfMemory: OK
  13430. 322.71 s [vector] take #282
  13431. 322.71 s [vector] Boxed: OK
  13432. 322.71 s [vector] Primitive: OK
  13433. 322.71 s [vector] Storable: OK
  13434. 322.71 s [vector] Unboxed: OK
  13435. 322.71 s [vector] Data.Vector
  13436. 322.71 s [vector] MonadFix: OK
  13437. 322.71 s [vector] toFromArray: OK
  13438. 322.71 s [vector] toFromArraySlice: OK
  13439. 322.71 s [vector] toFromArraySliceUnsafe: OK
  13440. 322.71 s [vector] toFromMutableArray: OK
  13441. 322.71 s [vector] Data.Vector.Mutable (Move): OK
  13442. 322.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  13443. 322.72 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  13444. 322.72 s [vector] +++ OK, passed 100 tests; 17 discarded.
  13445. 322.72 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  13446. 322.72 s [vector] +++ OK, passed 100 tests; 20 discarded.
  13447. 322.72 s [vector] Data.Vector.Storable.Mutable (Move): OK
  13448. 322.72 s [vector] +++ OK, passed 100 tests; 15 discarded.
  13449. 322.72 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  13450. 322.72 s [vector] +++ OK, passed 1 test.
  13451. 322.73 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK
  13452. 322.73 s [vector] +++ OK, passed 1 test.
  13453. 322.73 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  13454. 322.73 s [vector] +++ OK, passed 100 tests.
  13455. 322.73 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  13456. 322.73 s [vector] +++ OK, passed 100 tests.
  13457. 322.73 s [vector]
  13458. 322.73 s [vector] All 2808 tests passed (13.79s)
  13459. 322.74 s [vector] Test suite vector-tests-O2: PASS
  13460. 322.74 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  13461. 322.74 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  13462. 322.74 s [vector] checkPhase completed in 30 seconds
  13463. 322.74 s [vector] Phase: haddockPhase
  13464. 322.75 s [vector] Phase: installPhase
  13465. 322.81 s [vector] Installing library in /nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  13466. 323.50 s [vector] Installing internal library benchmarks-O2 in /nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/vector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2
  13467. 323.77 s [vector] Phase: fixupPhase
  13468. 323.78 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0
  13469. 323.80 s [vector] shrinking /nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSvector-0.13.2.0-LKSB10K7yAABOTSbq9H69q-ghc9.12.1.so
  13470. 323.83 s [vector] shrinking /nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSvector-0.13.2.0-DjlYysY7oyRDDxvCXTem9p-benchmarks-O2-ghc9.12.1.so
  13471. 323.83 s [vector] checking for references to /build/ in /nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0...
  13472. 323.89 s [vector] patching script interpreter paths in /nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0
  13473. 323.89 s [vector] stripping (with command strip and flags -S -p) in /nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0/lib
  13474. 324.64 s [vector:post-build] Uploading to cachix cache "sellout": /nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0
  13475. 325.11 s [vector:post-build] Pushing 1 paths (93 are already present) using zstd to cache sellout ⏳
  13476. 325.11 s [vector:post-build]
  13477. 325.51 s [vector:post-build] Pushing /nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0 (54.18 MiB)
  13478. 326.98 s [vector:post-build]
  13479. 326.98 s [vector:post-build] All done.
  13480. 327.00 s [vector:post-build] Uploading to the NixCI cache: /nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0
  13481. 327.04 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13482. 327.06 s [vector:post-build] copying 11 paths...
  13483. 327.06 s [vector:post-build] copying path '/nix/store/h0x9ly2229gw6fpvjxx5mykxib4mz0f5-prettyprinter-1.7.1-doc' to 'https://cache.nix-ci.com'...
  13484. 327.06 s [vector:post-build] copying path '/nix/store/shpn13dk8v3c1m8xmknbi3379kzqhsc7-vector-stream-0.1.0.1-doc' to 'https://cache.nix-ci.com'...
  13485. 327.68 s [vector:post-build] copying path '/nix/store/plb8bzi0brkg86wdfwh7yln4qb68gxw2-vector-stream-0.1.0.1' to 'https://cache.nix-ci.com'...
  13486. 327.73 s [vector:post-build] copying path '/nix/store/bm4k7maab3jz91saxa1s4vrfrj25i27p-prettyprinter-ansi-terminal-1.1.3-doc' to 'https://cache.nix-ci.com'...
  13487. 327.73 s [vector:post-build] copying path '/nix/store/j6ay2g3nwkvx9ynsi5wimjly38jc5wam-prettyprinter-1.7.1' to 'https://cache.nix-ci.com'...
  13488. 328.04 s [vector:post-build] copying path '/nix/store/8yw7r550gahlslw5q7dz8b3a8glshz2p-optparse-applicative-0.18.1.0-doc' to 'https://cache.nix-ci.com'...
  13489. 329.25 s [vector:post-build] copying path '/nix/store/6fp7vmq2yfid3pqwbfrr2yvvc3xz2kxn-tasty-1.5.3-doc' to 'https://cache.nix-ci.com'...
  13490. 329.72 s [vector:post-build] copying path '/nix/store/q93ij5z4a1p89qwj7rwrj5siqxr3dd9f-prettyprinter-ansi-terminal-1.1.3' to 'https://cache.nix-ci.com'...
  13491. 330.19 s [vector:post-build] copying path '/nix/store/wikxhzzg7cg0d2wl14979iqsgbx6b7ib-optparse-applicative-0.18.1.0' to 'https://cache.nix-ci.com'...
  13492. 332.41 s [vector:post-build] copying path '/nix/store/c7k7sbv1wysaacrqn9vnbyj218pansgb-tasty-1.5.3' to 'https://cache.nix-ci.com'...
  13493. 334.85 s [vector:post-build] copying path '/nix/store/rzlsazxa5farxpka9flrcm35idfgf98f-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  13494. 349.35 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13495. 349.62 s [vector:post-build] copying 4 paths...
  13496. 349.67 s [vector:post-build] copying path '/nix/store/iki6s11mzyjqd64ib9f80366vnhnpkih-vector-stream-0.1.0.1.drv' to 'https://cache.nix-ci.com'...
  13497. 349.67 s [vector:post-build] copying path '/nix/store/b0khbv4wrxikr8dqsl2lcv4qwwr9dv1l-inspection-testing-0.5.0.3.drv' to 'https://cache.nix-ci.com'...
  13498. 349.87 s [vector:post-build] copying path '/nix/store/mif1gqw3hgy40yyvd3mah832h2qg9g2m-tasty-inspection-testing-0.2.1.drv' to 'https://cache.nix-ci.com'...
  13499. 350.10 s [vector:post-build] copying path '/nix/store/1sakmmkyvdprx7zb24ip9yzyh8ss9hq9-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...
  13500. 350.36 s Progress: 4 of 14 built, 145 of 145 downloaded from cache
  13501. 350.41 s Building /nix/store/zp8wpxihkdkmqvgw0kg46mg2n96h7hc1-nothunks-0.3.0.0.drv
  13502. 350.57 s [nothunks] Phase: setupCompilerEnvironmentPhase
  13503. 350.57 s [nothunks] Build with /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1.
  13504. 350.79 s [nothunks] Phase: unpackPhase
  13505. 350.80 s [nothunks] unpacking source archive /nix/store/wzdyx5j9ylkjc475kaylxv5w38vhyy44-nothunks-0.3.0.0.tar.gz
  13506. 350.80 s [nothunks] source root is nothunks-0.3.0.0
  13507. 350.81 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.0.0/test/Test/NoThunks/Class.hs"
  13508. 350.81 s [nothunks] Phase: patchPhase
  13509. 350.82 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.0.0/revision/1.cabal.
  13510. 350.82 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  13511. 350.83 s [nothunks] Phase: compileBuildDriverPhase
  13512. 350.83 s [nothunks] setupCompileFlags: -package-db=/build/tmp.OjcQ4SsXGd/setup-package.conf.d -threaded
  13513. 350.88 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.OjcQ4SsXGd/Main.o )
  13514. 350.93 s [nothunks] [2 of 2] Linking Setup
  13515. 352.21 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  13516. 352.22 s [nothunks] Phase: configurePhase
  13517. 352.23 s [nothunks] configureFlags: --verbose --prefix=/nix/store/0p3nwgqv5mxbk8sc5d3vl3slvy0yma6w-nothunks-0.3.0.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/ak45jx69lx5vvnasdyg36hci52abxhx6-nothunks-0.3.0.0-doc/share/doc/nothunks-0.3.0.0 --with-gcc=gcc --package-db=/build/tmp.OjcQ4SsXGd/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
  13518. 352.23 s [nothunks] Using Parsec parser
  13519. 352.23 s [nothunks] Configuring nothunks-0.3.0.0...
  13520. 352.27 s [nothunks] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  13521. 352.27 s [nothunks] 'ghc' version < 9.12):
  13522. 352.27 s [nothunks] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc is version
  13523. 352.27 s [nothunks] 9.12.1
  13524. 352.56 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  13525. 352.78 s [nothunks] Dependency base: using base-4.21.0.0
  13526. 352.78 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.2.0
  13527. 352.78 s [nothunks] Dependency containers: using containers-0.7
  13528. 352.78 s [nothunks] Dependency ghc-heap: using ghc-heap-9.12.1
  13529. 352.78 s [nothunks] Dependency stm: using stm-2.5.3.1
  13530. 352.78 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1.2
  13531. 352.78 s [nothunks] Dependency time: using time-1.14
  13532. 352.78 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  13533. 352.78 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.2: using wherefrom-compat-0.1.1.1
  13534. 352.78 s [nothunks] Dependency base: using base-4.21.0.0
  13535. 352.78 s [nothunks] Dependency containers: using containers-0.7
  13536. 352.78 s [nothunks] Dependency ghc-prim: using ghc-prim-0.13.0
  13537. 352.79 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  13538. 352.79 s [nothunks] Dependency nothunks: using nothunks-0.3.0.0
  13539. 352.79 s [nothunks] Dependency random: using random-1.2.1.3
  13540. 352.79 s [nothunks] Dependency stm: using stm-2.5.3.1
  13541. 352.79 s [nothunks] Dependency tasty: using tasty-1.5.3
  13542. 352.79 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  13543. 352.79 s [nothunks] Source component graph:
  13544. 352.79 s [nothunks] component lib
  13545. 352.79 s [nothunks] component test:nothunks-test dependency lib
  13546. 352.79 s [nothunks] Configured component graph:
  13547. 352.79 s [nothunks] component nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
  13548. 352.79 s [nothunks] include base-4.21.0.0-f068
  13549. 352.79 s [nothunks] include bytestring-0.12.2.0-be6d
  13550. 352.79 s [nothunks] include containers-0.7-647d
  13551. 352.79 s [nothunks] include ghc-heap-9.12.1-2947
  13552. 352.79 s [nothunks] include stm-2.5.3.1-0481
  13553. 352.79 s [nothunks] include text-2.1.2-5eaa
  13554. 352.79 s [nothunks] include time-1.14-f7a8
  13555. 352.79 s [nothunks] include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  13556. 352.79 s [nothunks] include wherefrom-compat-0.1.1.1-1SO6aWtLEGxDvvOmeHtXpg
  13557. 352.79 s [nothunks] component nothunks-0.3.0.0-G3fXlDy46iWHhRRbcTDdSO-nothunks-test
  13558. 352.79 s [nothunks] include base-4.21.0.0-f068
  13559. 352.79 s [nothunks] include containers-0.7-647d
  13560. 352.79 s [nothunks] include ghc-prim-0.13.0-cfc8
  13561. 352.79 s [nothunks] include hedgehog-1.5-LcsFpG0Er7ZGRzxTgWdRj1
  13562. 352.79 s [nothunks] include nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
  13563. 352.79 s [nothunks] include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
  13564. 352.79 s [nothunks] include stm-2.5.3.1-0481
  13565. 352.79 s [nothunks] include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
  13566. 352.79 s [nothunks] include tasty-hedgehog-1.4.0.2-CbtR3hq33K86Et4pHsWsA8
  13567. 352.79 s [nothunks] Linked component graph:
  13568. 352.79 s [nothunks] unit nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
  13569. 352.79 s [nothunks] include base-4.21.0.0-f068
  13570. 352.79 s [nothunks] include bytestring-0.12.2.0-be6d
  13571. 352.79 s [nothunks] include containers-0.7-647d
  13572. 352.79 s [nothunks] include ghc-heap-9.12.1-2947
  13573. 352.79 s [nothunks] include stm-2.5.3.1-0481
  13574. 352.79 s [nothunks] include text-2.1.2-5eaa
  13575. 352.79 s [nothunks] include time-1.14-f7a8
  13576. 352.79 s [nothunks] include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  13577. 352.79 s [nothunks] include wherefrom-compat-0.1.1.1-1SO6aWtLEGxDvvOmeHtXpg
  13578. 352.79 s [nothunks] NoThunks.Class=nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX:NoThunks.Class
  13579. 352.79 s [nothunks] unit nothunks-0.3.0.0-G3fXlDy46iWHhRRbcTDdSO-nothunks-test
  13580. 352.79 s [nothunks] include base-4.21.0.0-f068
  13581. 352.79 s [nothunks] include containers-0.7-647d
  13582. 352.79 s [nothunks] include ghc-prim-0.13.0-cfc8
  13583. 352.79 s [nothunks] include hedgehog-1.5-LcsFpG0Er7ZGRzxTgWdRj1
  13584. 352.79 s [nothunks] include nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
  13585. 352.79 s [nothunks] include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
  13586. 352.79 s [nothunks] include stm-2.5.3.1-0481
  13587. 352.79 s [nothunks] include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
  13588. 352.79 s [nothunks] include tasty-hedgehog-1.4.0.2-CbtR3hq33K86Et4pHsWsA8
  13589. 352.79 s [nothunks] Ready component graph:
  13590. 352.79 s [nothunks] definite nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
  13591. 352.79 s [nothunks] depends base-4.21.0.0-f068
  13592. 352.79 s [nothunks] depends bytestring-0.12.2.0-be6d
  13593. 352.79 s [nothunks] depends containers-0.7-647d
  13594. 352.79 s [nothunks] depends ghc-heap-9.12.1-2947
  13595. 352.79 s [nothunks] depends stm-2.5.3.1-0481
  13596. 352.79 s [nothunks] depends text-2.1.2-5eaa
  13597. 352.79 s [nothunks] depends time-1.14-f7a8
  13598. 352.79 s [nothunks] depends vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  13599. 352.79 s [nothunks] depends wherefrom-compat-0.1.1.1-1SO6aWtLEGxDvvOmeHtXpg
  13600. 352.79 s [nothunks] definite nothunks-0.3.0.0-G3fXlDy46iWHhRRbcTDdSO-nothunks-test
  13601. 352.79 s [nothunks] depends base-4.21.0.0-f068
  13602. 352.79 s [nothunks] depends containers-0.7-647d
  13603. 352.79 s [nothunks] depends ghc-prim-0.13.0-cfc8
  13604. 352.79 s [nothunks] depends hedgehog-1.5-LcsFpG0Er7ZGRzxTgWdRj1
  13605. 352.79 s [nothunks] depends nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
  13606. 352.79 s [nothunks] depends random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
  13607. 352.79 s [nothunks] depends stm-2.5.3.1-0481
  13608. 352.79 s [nothunks] depends tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
  13609. 352.79 s [nothunks] depends tasty-hedgehog-1.4.0.2-CbtR3hq33K86Et4pHsWsA8
  13610. 352.79 s [nothunks] Using Cabal-3.14.1.0 compiled by ghc-9.12
  13611. 352.79 s [nothunks] Using compiler: ghc-9.12.1
  13612. 352.79 s [nothunks] Using install prefix:
  13613. 352.79 s [nothunks] /nix/store/0p3nwgqv5mxbk8sc5d3vl3slvy0yma6w-nothunks-0.3.0.0
  13614. 352.79 s [nothunks] Executables installed in:
  13615. 352.79 s [nothunks] /nix/store/0p3nwgqv5mxbk8sc5d3vl3slvy0yma6w-nothunks-0.3.0.0/bin
  13616. 352.79 s [nothunks] Libraries installed in:
  13617. 352.79 s [nothunks] /nix/store/0p3nwgqv5mxbk8sc5d3vl3slvy0yma6w-nothunks-0.3.0.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
  13618. 352.79 s [nothunks] Dynamic Libraries installed in:
  13619. 352.79 s [nothunks] /nix/store/0p3nwgqv5mxbk8sc5d3vl3slvy0yma6w-nothunks-0.3.0.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
  13620. 352.79 s [nothunks] Private executables installed in:
  13621. 352.79 s [nothunks] /nix/store/0p3nwgqv5mxbk8sc5d3vl3slvy0yma6w-nothunks-0.3.0.0/libexec/x86_64-linux-ghc-9.12.1-f739/nothunks-0.3.0.0
  13622. 352.79 s [nothunks] Data files installed in:
  13623. 352.79 s [nothunks] /nix/store/0p3nwgqv5mxbk8sc5d3vl3slvy0yma6w-nothunks-0.3.0.0/share/x86_64-linux-ghc-9.12.1-f739/nothunks-0.3.0.0
  13624. 352.79 s [nothunks] Documentation installed in:
  13625. 352.79 s [nothunks] /nix/store/ak45jx69lx5vvnasdyg36hci52abxhx6-nothunks-0.3.0.0-doc/share/doc/nothunks-0.3.0.0
  13626. 352.79 s [nothunks] Configuration files installed in:
  13627. 352.79 s [nothunks] /nix/store/0p3nwgqv5mxbk8sc5d3vl3slvy0yma6w-nothunks-0.3.0.0/etc
  13628. 352.79 s [nothunks] No alex found
  13629. 352.79 s [nothunks] Using ar found on system at:
  13630. 352.79 s [nothunks] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  13631. 352.79 s [nothunks] No c2hs found
  13632. 352.79 s [nothunks] No cpphs found
  13633. 352.79 s [nothunks] No doctest found
  13634. 352.79 s [nothunks] Using gcc version 14.3.0 given by user at:
  13635. 352.79 s [nothunks] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  13636. 352.79 s [nothunks] Using ghc version 9.12.1 found on system at:
  13637. 352.79 s [nothunks] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc
  13638. 352.79 s [nothunks] Using ghc-pkg version 9.12.1 found on system at:
  13639. 352.79 s [nothunks] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc-pkg-9.12.1
  13640. 352.79 s [nothunks] No ghcjs found
  13641. 352.79 s [nothunks] No ghcjs-pkg found
  13642. 352.79 s [nothunks] No greencard found
  13643. 352.79 s [nothunks] Using haddock version 2.30.0 found on system at:
  13644. 352.79 s [nothunks] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/haddock-ghc-9.12.1
  13645. 352.79 s [nothunks] No happy found
  13646. 352.79 s [nothunks] No haskell-suite found
  13647. 352.79 s [nothunks] No haskell-suite-pkg found
  13648. 352.79 s [nothunks] No hmake found
  13649. 352.79 s [nothunks] Using hpc version 0.69 found on system at:
  13650. 352.79 s [nothunks] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hpc-ghc-9.12.1
  13651. 352.79 s [nothunks] Using hsc2hs version 0.68.10 found on system at:
  13652. 352.79 s [nothunks] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
  13653. 352.79 s [nothunks] Using hscolour version 1.25 found on system at:
  13654. 352.79 s [nothunks] /nix/store/q6qz2x3a08capyv98w52zizgxcnmv4hb-hscolour-1.25/bin/HsColour
  13655. 352.79 s [nothunks] No jhc found
  13656. 352.79 s [nothunks] Using ld found on system at:
  13657. 352.79 s [nothunks] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  13658. 352.79 s [nothunks] No pkg-config found
  13659. 352.79 s [nothunks] Using runghc version 9.12.1 found on system at:
  13660. 352.79 s [nothunks] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/runghc-9.12.1
  13661. 352.79 s [nothunks] Using strip version 2.44 found on system at:
  13662. 352.79 s [nothunks] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  13663. 352.79 s [nothunks] Using tar found on system at:
  13664. 352.79 s [nothunks] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  13665. 352.79 s [nothunks] No uhc found
  13666. 352.93 s [nothunks] Phase: buildPhase
  13667. 352.99 s [nothunks] Preprocessing library for nothunks-0.3.0.0...
  13668. 352.99 s [nothunks] Building library for nothunks-0.3.0.0...
  13669. 353.09 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  13670. 355.45 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  13671. 358.80 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.0.0...
  13672. 358.80 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.0.0...
  13673. 358.90 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 )
  13674. 361.08 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  13675. 361.43 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  13676. 362.57 s [nothunks] Phase: checkPhase
  13677. 362.87 s [nothunks] Running 1 test suites...
  13678. 362.87 s [nothunks] Test suite nothunks-test: RUNNING...
  13679. 362.87 s [nothunks] Tests
  13680. 362.87 s [nothunks] NoThunks.Class
  13681. 362.87 s [nothunks] Sanity
  13682. 362.87 s [nothunks] IntNotNF: OK
  13683. 362.87 s [nothunks] ✓ <interactive> passed 1 test.
  13684. 362.87 s [nothunks] IntIsNF: OK
  13685. 362.87 s [nothunks] ✓ <interactive> passed 1 test.
  13686. 362.87 s [nothunks] Pair: OK
  13687. 362.87 s [nothunks] ✓ <interactive> passed 1 test.
  13688. 362.87 s [nothunks] Sum: OK
  13689. 362.88 s [nothunks] ✓ <interactive> passed 1 test.
  13690. 362.88 s [nothunks] Fn: OK
  13691. 362.88 s [nothunks] ✓ <interactive> passed 1 test.
  13692. 362.88 s [nothunks] IO: OK
  13693. 362.88 s [nothunks] ✓ <interactive> passed 1 test.
  13694. 362.88 s [nothunks] InspectHeap
  13695. 362.90 s [nothunks] Int: OK (0.02s)
  13696. 362.90 s [nothunks] ✓ <interactive> passed 1000 tests.
  13697. 362.90 s [nothunks] Just ["Int"] 51% ██████████▏·········
  13698. 362.90 s [nothunks] Nothing 49% █████████▊··········
  13699. 362.92 s [nothunks] IntInt: OK (0.02s)
  13700. 362.92 s [nothunks] ✓ <interactive> passed 1000 tests.
  13701. 362.92 s [nothunks] Just ["Int","Tuple2"] 36% ███████▏············
  13702. 362.92 s [nothunks] Just ["Tuple2"] 51% ██████████▏·········
  13703. 362.92 s [nothunks] Nothing 13% ██▌·················
  13704. 362.94 s [nothunks] SumInt: OK (0.02s)
  13705. 362.94 s [nothunks] ✓ <interactive> passed 1000 tests.
  13706. 362.94 s [nothunks] Just ["Either"] 35% ██████▉·············
  13707. 362.94 s [nothunks] Just ["Int","Either"] 31% ██████▎·············
  13708. 362.94 s [nothunks] Nothing 34% ██████▊·············
  13709. 362.96 s [nothunks] ListInt: OK (0.02s)
  13710. 362.96 s [nothunks] ✓ <interactive> passed 1000 tests.
  13711. 362.96 s [nothunks] Just ["Int","List"] 21% ████▎···············
  13712. 362.96 s [nothunks] Just ["List"] 45% ████████▉···········
  13713. 362.96 s [nothunks] Nothing 34% ██████▋·············
  13714. 362.98 s [nothunks] IntListInt: OK (0.03s)
  13715. 362.98 s [nothunks] ✓ <interactive> passed 1000 tests.
  13716. 362.98 s [nothunks] Just ["Int","List","Tuple2"] 6% █▏··················
  13717. 362.98 s [nothunks] Just ["Int","Tuple2"] 25% █████···············
  13718. 362.98 s [nothunks] Just ["List","Tuple2"] 10% █▉··················
  13719. 362.98 s [nothunks] Just ["Tuple2"] 52% ██████████▎·········
  13720. 362.98 s [nothunks] Nothing 8% █▌··················
  13721. 363.00 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  13722. 363.00 s [nothunks] after 7 tests.
  13723. 363.00 s [nothunks] shrink path: 7:
  13724. 363.00 s [nothunks] Just ["Int","Seq"] 14% ██▊·················
  13725. 363.00 s [nothunks] Nothing 71% ██████████████▎·····
  13726. 363.00 s [nothunks]
  13727. 363.00 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  13728. 363.00 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  13729. 363.00 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  13730. 363.00 s [nothunks] 168 ┃ -> Proxy a
  13731. 363.00 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  13732. 363.00 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  13733. 363.00 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  13734. 363.00 s [nothunks] 172 ┃ -> Property
  13735. 363.00 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  13736. 363.00 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  13737. 363.00 s [nothunks] ┃ │ Wrap
  13738. 363.00 s [nothunks] ┃ │ { unwrap =
  13739. 363.00 s [nothunks] ┃ │ SeqEnqueue
  13740. 363.00 s [nothunks] ┃ │ (IntValue 0)
  13741. 363.00 s [nothunks] ┃ │ (SeqEnqueue
  13742. 363.00 s [nothunks] ┃ │ (IntValue 0)
  13743. 363.00 s [nothunks] ┃ │ (SeqEnqueue
  13744. 363.00 s [nothunks] ┃ │ (IntValue 0)
  13745. 363.00 s [nothunks] ┃ │ (SeqEnqueue
  13746. 363.00 s [nothunks] ┃ │ (IntValue 0)
  13747. 363.00 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  13748. 363.00 s [nothunks] ┃ │ }
  13749. 363.00 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  13750. 363.00 s [nothunks] 176 ┃ fromModel m $ \a -> do
  13751. 363.00 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  13752. 363.00 s [nothunks] ┃ │ IsNF
  13753. 363.00 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  13754. 363.00 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  13755. 363.00 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  13756. 363.01 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  13757. 363.01 s [nothunks] ┃ │ - Just
  13758. 363.01 s [nothunks] ┃ │ - ThunkInfo
  13759. 363.01 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  13760. 363.01 s [nothunks] ┃ │ + Nothing
  13761. 363.01 s [nothunks]
  13762. 363.01 s [nothunks] This failure can be reproduced by running:
  13763. 363.01 s [nothunks] > recheckAt (Seed 1473056987652116386 13728472172571151637) "7:" EXPECTED FAILURE
  13764. 363.01 s [nothunks]
  13765. 363.01 s [nothunks] OK (0.02s)
  13766. 363.01 s [nothunks] ✓ <interactive> passed 1 test.
  13767. 363.01 s [nothunks] Model
  13768. 363.02 s [nothunks] Int: OK
  13769. 363.02 s [nothunks] ✓ <interactive> passed 1000 tests.
  13770. 363.02 s [nothunks] Just ["Int"] 53% ██████████▌·········
  13771. 363.02 s [nothunks] Nothing 47% █████████▍··········
  13772. 363.04 s [nothunks] IntInt: OK (0.02s)
  13773. 363.04 s [nothunks] ✓ <interactive> passed 1000 tests.
  13774. 363.04 s [nothunks] Just ["Int","Tuple2"] 37% ███████▍············
  13775. 363.04 s [nothunks] Just ["Tuple2"] 49% █████████▊··········
  13776. 363.04 s [nothunks] Nothing 13% ██▋·················
  13777. 363.06 s [nothunks] SumInt: OK (0.01s)
  13778. 363.06 s [nothunks] ✓ <interactive> passed 1000 tests.
  13779. 363.06 s [nothunks] Just ["Either"] 32% ██████▌·············
  13780. 363.06 s [nothunks] Just ["Int","Either"] 35% ███████·············
  13781. 363.06 s [nothunks] Nothing 32% ██████▍·············
  13782. 363.08 s [nothunks] ListInt: OK (0.03s)
  13783. 363.08 s [nothunks] ✓ <interactive> passed 1000 tests.
  13784. 363.08 s [nothunks] Just ["Int","List"] 24% ████▊···············
  13785. 363.08 s [nothunks] Just ["List"] 43% ████████▌···········
  13786. 363.08 s [nothunks] Nothing 33% ██████▌·············
  13787. 363.12 s [nothunks] IntListInt: OK (0.03s)
  13788. 363.12 s [nothunks] ✓ <interactive> passed 1000 tests.
  13789. 363.12 s [nothunks] Just ["Int","List","Tuple2"] 6% █▏··················
  13790. 363.12 s [nothunks] Just ["Int","Tuple2"] 22% ████▍···············
  13791. 363.12 s [nothunks] Just ["List","Tuple2"] 12% ██▎·················
  13792. 363.12 s [nothunks] Just ["Tuple2"] 51% ██████████▏·········
  13793. 363.12 s [nothunks] Nothing 9% █▊··················
  13794. 363.18 s [nothunks] SeqInt: OK (0.07s)
  13795. 363.18 s [nothunks] ✓ <interactive> passed 1000 tests.
  13796. 363.18 s [nothunks] Just ["Int","Seq"] 47% █████████▎··········
  13797. 363.18 s [nothunks] Nothing 53% ██████████▋·········
  13798. 363.20 s [nothunks] AllowThunksIn: OK (0.02s)
  13799. 363.20 s [nothunks] ✓ <interactive> passed 1000 tests.
  13800. 363.20 s [nothunks] Just ["Int","field2","Record"] 24% ████▉···············
  13801. 363.20 s [nothunks] Just ["Record"] 50% ██████████··········
  13802. 363.20 s [nothunks] Nothing 25% █████···············
  13803. 363.22 s [nothunks] Fn: OK (0.01s)
  13804. 363.22 s [nothunks] ✓ <interactive> passed 1000 tests.
  13805. 363.22 s [nothunks] Just ["->"] 22% ████▌···············
  13806. 363.22 s [nothunks] Nothing 78% ███████████████▌····
  13807. 363.23 s [nothunks] IO: OK (0.01s)
  13808. 363.23 s [nothunks] ✓ <interactive> passed 1000 tests.
  13809. 363.23 s [nothunks] Just ["IO"] 25% ████▉···············
  13810. 363.23 s [nothunks] Nothing 75% ███████████████·····
  13811. 363.24 s [nothunks] ThunkFreeFn: OK (0.01s)
  13812. 363.24 s [nothunks] ✓ <interactive> passed 1000 tests.
  13813. 363.24 s [nothunks] Just ["->"] 24% ████▋···············
  13814. 363.24 s [nothunks] Just ["...","->"] 38% ███████▋············
  13815. 363.24 s [nothunks] Nothing 38% ███████▌············
  13816. 363.24 s [nothunks] ThunkFreeIO: OK (0.01s)
  13817. 363.24 s [nothunks] ✓ <interactive> passed 1000 tests.
  13818. 363.24 s [nothunks] Just ["...","IO"] 36% ███████▏············
  13819. 363.24 s [nothunks] Just ["IO"] 27% █████▎··············
  13820. 363.24 s [nothunks] Nothing 37% ███████▍············
  13821. 363.24 s [nothunks] MutableVars
  13822. 363.24 s [nothunks] IORef
  13823. 363.24 s [nothunks] NotNF: OK
  13824. 363.24 s [nothunks] ✓ <interactive> passed 1 test.
  13825. 363.25 s [nothunks] NF: OK
  13826. 363.25 s [nothunks] ✓ <interactive> passed 1 test.
  13827. 363.25 s [nothunks] NotNFPure: OK
  13828. 363.25 s [nothunks] ✓ <interactive> passed 1 test.
  13829. 363.25 s [nothunks] NFPure: OK
  13830. 363.25 s [nothunks] ✓ <interactive> passed 1 test.
  13831. 363.25 s [nothunks] NotNFAtomically: OK
  13832. 363.25 s [nothunks] ✓ <interactive> passed 1 test.
  13833. 363.25 s [nothunks] NFAtomically: OK
  13834. 363.25 s [nothunks] ✓ <interactive> passed 1 test.
  13835. 363.25 s [nothunks] MVar
  13836. 363.25 s [nothunks] NotNF: OK
  13837. 363.25 s [nothunks] ✓ <interactive> passed 1 test.
  13838. 363.25 s [nothunks] NF: OK
  13839. 363.25 s [nothunks] ✓ <interactive> passed 1 test.
  13840. 363.25 s [nothunks] NotNFPure: OK
  13841. 363.25 s [nothunks] ✓ <interactive> passed 1 test.
  13842. 363.25 s [nothunks] NFPure: OK
  13843. 363.25 s [nothunks] ✓ <interactive> passed 1 test.
  13844. 363.25 s [nothunks] NotNFAtomically: OK
  13845. 363.25 s [nothunks] ✓ <interactive> passed 1 test.
  13846. 363.25 s [nothunks] NFAtomically: OK
  13847. 363.25 s [nothunks] ✓ <interactive> passed 1 test.
  13848. 363.25 s [nothunks] TVar
  13849. 363.25 s [nothunks] NotNF: OK
  13850. 363.25 s [nothunks] ✓ <interactive> passed 1 test.
  13851. 363.25 s [nothunks] NF: OK
  13852. 363.25 s [nothunks] ✓ <interactive> passed 1 test.
  13853. 363.25 s [nothunks] NotNFPure: OK
  13854. 363.25 s [nothunks] ✓ <interactive> passed 1 test.
  13855. 363.25 s [nothunks] NFPure: OK
  13856. 363.25 s [nothunks] ✓ <interactive> passed 1 test.
  13857. 363.25 s [nothunks] NotNFAtomically: OK
  13858. 363.25 s [nothunks] ✓ <interactive> passed 1 test.
  13859. 363.25 s [nothunks] NFAtomically: OK
  13860. 363.25 s [nothunks] ✓ <interactive> passed 1 test.
  13861. 363.25 s [nothunks]
  13862. 363.25 s [nothunks] All 41 tests passed (0.37s)
  13863. 363.25 s [nothunks] Test suite nothunks-test: PASS
  13864. 363.25 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.0.0-nothunks-test.log
  13865. 363.25 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  13866. 363.26 s [nothunks] Phase: haddockPhase
  13867. 363.75 s [nothunks] Preprocessing library for nothunks-0.3.0.0...
  13868. 363.75 s [nothunks] Running Haddock on library for nothunks-0.3.0.0...
  13869. 363.75 s [nothunks] Warning: The documentation for the following packages are not installed. No
  13870. 363.75 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  13871. 364.04 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, nothing ) [HIE file is missing]
  13872. 364.77 s [nothunks] Haddock coverage:
  13873. 364.77 s [nothunks] Warning: 'ThunkInfo' is ambiguous. It is defined
  13874. 364.77 s [nothunks] * at src/NoThunks/Class.hs:230:18
  13875. 364.77 s [nothunks] * at src/NoThunks/Class.hs:230:1
  13876. 364.77 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13877. 364.77 s [nothunks] by specifying the type/value namespace explicitly.
  13878. 364.77 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:230:1
  13879. 364.77 s [nothunks] Warning: 'GHC' is out of scope.
  13880. 364.77 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  13881. 364.77 s [nothunks] Warning: 'a' is out of scope.
  13882. 364.77 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  13883. 364.77 s [nothunks] Warning: 'AllowThunksIn' is ambiguous. It is defined
  13884. 364.77 s [nothunks] * at src/NoThunks/Class.hs:334:48
  13885. 364.77 s [nothunks] * at src/NoThunks/Class.hs:334:1
  13886. 364.77 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13887. 364.77 s [nothunks] by specifying the type/value namespace explicitly.
  13888. 364.77 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:334:1
  13889. 364.78 s [nothunks] Warning: 'InspectHeap' is ambiguous. It is defined
  13890. 364.78 s [nothunks] * at src/NoThunks/Class.hs:353:25
  13891. 364.78 s [nothunks] * at src/NoThunks/Class.hs:353:1
  13892. 364.78 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13893. 364.78 s [nothunks] by specifying the type/value namespace explicitly.
  13894. 364.78 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:353:1
  13895. 364.78 s [nothunks] Warning: 'InspectHeapNamed' is ambiguous. It is defined
  13896. 364.78 s [nothunks] * at src/NoThunks/Class.hs:358:47
  13897. 364.78 s [nothunks] * at src/NoThunks/Class.hs:358:1
  13898. 364.78 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13899. 364.78 s [nothunks] by specifying the type/value namespace explicitly.
  13900. 364.78 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:358:1
  13901. 364.78 s [nothunks] Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
  13902. 364.78 s [nothunks] * at src/NoThunks/Class.hs:308:27
  13903. 364.78 s [nothunks] * at src/NoThunks/Class.hs:308:1
  13904. 364.78 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13905. 364.78 s [nothunks] by specifying the type/value namespace explicitly.
  13906. 364.78 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:308:1
  13907. 364.85 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  13908. 364.85 s [nothunks] Missing documentation for:
  13909. 364.85 s [nothunks] Module header
  13910. 365.29 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  13911. 365.29 s [nothunks] - NoThunks.Class.Elem
  13912. 365.29 s [nothunks] - NoThunks.Class.GShowTypeOf
  13913. 365.29 s [nothunks] - NoThunks.Class.GWRecordField
  13914. 365.29 s [nothunks] - NoThunks.Class.HasFields
  13915. 365.29 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  13916. 365.29 s [nothunks] - Data.Vector.Vector
  13917. 365.29 s [nothunks] - NoThunks.Class.checkContainsThunks
  13918. 369.76 s [nothunks] Documentation created: dist/doc/html/nothunks,
  13919. 369.85 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  13920. 370.19 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.0.0...
  13921. 370.23 s [nothunks] Phase: installPhase
  13922. 370.28 s [nothunks] Installing library in /nix/store/0p3nwgqv5mxbk8sc5d3vl3slvy0yma6w-nothunks-0.3.0.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
  13923. 370.48 s [nothunks] Phase: fixupPhase
  13924. 370.50 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/0p3nwgqv5mxbk8sc5d3vl3slvy0yma6w-nothunks-0.3.0.0
  13925. 370.50 s [nothunks] shrinking /nix/store/0p3nwgqv5mxbk8sc5d3vl3slvy0yma6w-nothunks-0.3.0.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSnothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX-ghc9.12.1.so
  13926. 370.50 s [nothunks] checking for references to /build/ in /nix/store/0p3nwgqv5mxbk8sc5d3vl3slvy0yma6w-nothunks-0.3.0.0...
  13927. 370.51 s [nothunks] patching script interpreter paths in /nix/store/0p3nwgqv5mxbk8sc5d3vl3slvy0yma6w-nothunks-0.3.0.0
  13928. 370.52 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/0p3nwgqv5mxbk8sc5d3vl3slvy0yma6w-nothunks-0.3.0.0/lib
  13929. 370.57 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/ak45jx69lx5vvnasdyg36hci52abxhx6-nothunks-0.3.0.0-doc
  13930. 370.57 s [nothunks] checking for references to /build/ in /nix/store/ak45jx69lx5vvnasdyg36hci52abxhx6-nothunks-0.3.0.0-doc...
  13931. 370.58 s [nothunks] patching script interpreter paths in /nix/store/ak45jx69lx5vvnasdyg36hci52abxhx6-nothunks-0.3.0.0-doc
  13932. 370.67 s [nothunks:post-build] Uploading to cachix cache "sellout": /nix/store/0p3nwgqv5mxbk8sc5d3vl3slvy0yma6w-nothunks-0.3.0.0 /nix/store/ak45jx69lx5vvnasdyg36hci52abxhx6-nothunks-0.3.0.0-doc
  13933. 371.25 s [nothunks:post-build] Pushing 2 paths (96 are already present) using zstd to cache sellout ⏳
  13934. 371.25 s [nothunks:post-build]
  13935. 371.61 s [nothunks:post-build] Pushing /nix/store/0p3nwgqv5mxbk8sc5d3vl3slvy0yma6w-nothunks-0.3.0.0 (2.88 MiB)
  13936. 371.69 s [nothunks:post-build] Pushing /nix/store/ak45jx69lx5vvnasdyg36hci52abxhx6-nothunks-0.3.0.0-doc (839.20 KiB)
  13937. 372.85 s [nothunks:post-build]
  13938. 372.85 s [nothunks:post-build] All done.
  13939. 372.86 s [nothunks:post-build] Uploading to the NixCI cache: /nix/store/0p3nwgqv5mxbk8sc5d3vl3slvy0yma6w-nothunks-0.3.0.0 /nix/store/ak45jx69lx5vvnasdyg36hci52abxhx6-nothunks-0.3.0.0-doc
  13940. 372.91 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13941. 373.13 s [nothunks:post-build] copying 4 paths...
  13942. 373.13 s [nothunks:post-build] copying path '/nix/store/506wd36hzdg95arf318yl50vibfbjwmz-wherefrom-compat-0.1.1.1-doc' to 'https://cache.nix-ci.com'...
  13943. 373.42 s [nothunks:post-build] copying path '/nix/store/982v0gj90dbdnax1l3diplal7flrcdlk-wherefrom-compat-0.1.1.1' to 'https://cache.nix-ci.com'...
  13944. 373.42 s [nothunks:post-build] copying path '/nix/store/ak45jx69lx5vvnasdyg36hci52abxhx6-nothunks-0.3.0.0-doc' to 'https://cache.nix-ci.com'...
  13945. 373.79 s [nothunks:post-build] copying path '/nix/store/0p3nwgqv5mxbk8sc5d3vl3slvy0yma6w-nothunks-0.3.0.0' to 'https://cache.nix-ci.com'...
  13946. 374.73 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13947. 375.01 s [nothunks:post-build] copying 3 paths...
  13948. 375.01 s [nothunks:post-build] copying path '/nix/store/asr1rg62gjy8cymx3wl942x3pp6y062j-wherefrom-compat-0.1.1.1.drv' to 'https://cache.nix-ci.com'...
  13949. 375.06 s [nothunks:post-build] copying path '/nix/store/j8kr3h91zbj2fb6iff0xpix067hzb5z8-tasty-hedgehog-1.4.0.2.drv' to 'https://cache.nix-ci.com'...
  13950. 375.25 s [nothunks:post-build] copying path '/nix/store/zp8wpxihkdkmqvgw0kg46mg2n96h7hc1-nothunks-0.3.0.0.drv' to 'https://cache.nix-ci.com'...
  13951. 375.50 s Progress: 5 of 14 built, 145 of 145 downloaded from cache
  13952. 375.53 s Building /nix/store/fbqzfaggj1qpgfhqardy5hbifamsjhqz-unordered-containers-0.2.20.drv
  13953. 375.65 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  13954. 375.66 s [unordered-containers] Build with /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1.
  13955. 375.83 s [unordered-containers] Phase: unpackPhase
  13956. 375.83 s [unordered-containers] unpacking source archive /nix/store/46rvk8vjzsagr58a6pqwimivmr0ahxys-unordered-containers-0.2.20.tar.gz
  13957. 375.84 s [unordered-containers] source root is unordered-containers-0.2.20
  13958. 375.85 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20/unordered-containers.cabal"
  13959. 375.85 s [unordered-containers] Phase: patchPhase
  13960. 375.85 s [unordered-containers] Replace Cabal file with edited version from mirror://hackage/unordered-containers-0.2.20/revision/4.cabal.
  13961. 375.86 s [unordered-containers] Phase: compileBuildDriverPhase
  13962. 375.86 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.9QJhRXGi0F/setup-package.conf.d -threaded
  13963. 375.91 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.9QJhRXGi0F/Main.o )
  13964. 375.96 s [unordered-containers] [2 of 2] Linking Setup
  13965. 377.31 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  13966. 377.32 s [unordered-containers] Phase: configurePhase
  13967. 377.33 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/fqlwhm7awx32h5gjwm1x40rw81ivhnb1-unordered-containers-0.2.20 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/2kzw5nvb6hk4c6jkxa6jw977rskvkrf3-unordered-containers-0.2.20-doc/share/doc/unordered-containers-0.2.20 --with-gcc=gcc --package-db=/build/tmp.9QJhRXGi0F/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
  13968. 377.34 s [unordered-containers] Using Parsec parser
  13969. 377.34 s [unordered-containers] Configuring unordered-containers-0.2.20...
  13970. 377.38 s [unordered-containers] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  13971. 377.38 s [unordered-containers] 'ghc' version < 9.12):
  13972. 377.38 s [unordered-containers] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc is version
  13973. 377.38 s [unordered-containers] 9.12.1
  13974. 377.75 s [unordered-containers] Flags chosen: debug=False
  13975. 378.03 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.21.0.0
  13976. 378.03 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.5.1.0
  13977. 378.03 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.4.7.0
  13978. 378.03 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.23.0.0
  13979. 378.03 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.15
  13980. 378.03 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  13981. 378.03 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.14.3
  13982. 378.03 s [unordered-containers] Dependency base: using base-4.21.0.0
  13983. 378.03 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.7
  13984. 378.03 s [unordered-containers] Dependency hashable: using hashable-1.4.7.0
  13985. 378.03 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.0.0
  13986. 378.03 s [unordered-containers] Dependency random: using random-1.2.1.3
  13987. 378.03 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  13988. 378.03 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  13989. 378.03 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11
  13990. 378.03 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20
  13991. 378.03 s [unordered-containers] Source component graph:
  13992. 378.03 s [unordered-containers] component lib
  13993. 378.03 s [unordered-containers] component test:unordered-containers-tests dependency lib
  13994. 378.03 s [unordered-containers] Configured component graph:
  13995. 378.03 s [unordered-containers] component unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
  13996. 378.03 s [unordered-containers] include base-4.21.0.0-f068
  13997. 378.03 s [unordered-containers] include deepseq-1.5.1.0-b096
  13998. 378.03 s [unordered-containers] include hashable-1.4.7.0-FrCvEjo9HTdHfqyBqag94O
  13999. 378.03 s [unordered-containers] include template-haskell-2.23.0.0-125a
  14000. 378.03 s [unordered-containers] component unordered-containers-0.2.20-8V1CbZs5KiA6Dx9xccQiI7-unordered-containers-tests
  14001. 378.03 s [unordered-containers] include ChasingBottoms-1.3.1.15-7UJDQm86uOU1SZ4bdf8VsE
  14002. 378.03 s [unordered-containers] include HUnit-1.6.2.0-qUaw1nn5Lc6mWzDeZqcfq
  14003. 378.03 s [unordered-containers] include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  14004. 378.03 s [unordered-containers] include base-4.21.0.0-f068
  14005. 378.03 s [unordered-containers] include containers-0.7-647d
  14006. 378.03 s [unordered-containers] include hashable-1.4.7.0-FrCvEjo9HTdHfqyBqag94O
  14007. 378.03 s [unordered-containers] include nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
  14008. 378.03 s [unordered-containers] include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
  14009. 378.03 s [unordered-containers] include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
  14010. 378.03 s [unordered-containers] include tasty-hunit-0.10.2-GxiECQtHLG9JqzzTC7gSqY
  14011. 378.03 s [unordered-containers] include tasty-quickcheck-0.11-597oKWlAkLA6PjifDQdXTX
  14012. 378.03 s [unordered-containers] include unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
  14013. 378.03 s [unordered-containers] Linked component graph:
  14014. 378.03 s [unordered-containers] unit unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
  14015. 378.03 s [unordered-containers] include base-4.21.0.0-f068
  14016. 378.03 s [unordered-containers] include deepseq-1.5.1.0-b096
  14017. 378.03 s [unordered-containers] include hashable-1.4.7.0-FrCvEjo9HTdHfqyBqag94O
  14018. 378.03 s [unordered-containers] include template-haskell-2.23.0.0-125a
  14019. 378.03 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV:Data.HashSet.Internal
  14020. 378.03 s [unordered-containers] unit unordered-containers-0.2.20-8V1CbZs5KiA6Dx9xccQiI7-unordered-containers-tests
  14021. 378.03 s [unordered-containers] include ChasingBottoms-1.3.1.15-7UJDQm86uOU1SZ4bdf8VsE
  14022. 378.03 s [unordered-containers] include HUnit-1.6.2.0-qUaw1nn5Lc6mWzDeZqcfq
  14023. 378.03 s [unordered-containers] include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  14024. 378.03 s [unordered-containers] include base-4.21.0.0-f068
  14025. 378.03 s [unordered-containers] include containers-0.7-647d
  14026. 378.03 s [unordered-containers] include hashable-1.4.7.0-FrCvEjo9HTdHfqyBqag94O
  14027. 378.03 s [unordered-containers] include nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
  14028. 378.03 s [unordered-containers] include random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
  14029. 378.03 s [unordered-containers] include tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
  14030. 378.03 s [unordered-containers] include tasty-hunit-0.10.2-GxiECQtHLG9JqzzTC7gSqY
  14031. 378.03 s [unordered-containers] include tasty-quickcheck-0.11-597oKWlAkLA6PjifDQdXTX
  14032. 378.03 s [unordered-containers] include unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
  14033. 378.03 s [unordered-containers] Ready component graph:
  14034. 378.03 s [unordered-containers] definite unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
  14035. 378.03 s [unordered-containers] depends base-4.21.0.0-f068
  14036. 378.04 s [unordered-containers] depends deepseq-1.5.1.0-b096
  14037. 378.04 s [unordered-containers] depends hashable-1.4.7.0-FrCvEjo9HTdHfqyBqag94O
  14038. 378.04 s [unordered-containers] depends template-haskell-2.23.0.0-125a
  14039. 378.04 s [unordered-containers] definite unordered-containers-0.2.20-8V1CbZs5KiA6Dx9xccQiI7-unordered-containers-tests
  14040. 378.04 s [unordered-containers] depends ChasingBottoms-1.3.1.15-7UJDQm86uOU1SZ4bdf8VsE
  14041. 378.04 s [unordered-containers] depends HUnit-1.6.2.0-qUaw1nn5Lc6mWzDeZqcfq
  14042. 378.04 s [unordered-containers] depends QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  14043. 378.04 s [unordered-containers] depends base-4.21.0.0-f068
  14044. 378.04 s [unordered-containers] depends containers-0.7-647d
  14045. 378.04 s [unordered-containers] depends hashable-1.4.7.0-FrCvEjo9HTdHfqyBqag94O
  14046. 378.04 s [unordered-containers] depends nothunks-0.3.0.0-7ovWfKwC4XCFEPam20TTHX
  14047. 378.04 s [unordered-containers] depends random-1.2.1.3-Fu806TZniKRG79uAj7bp6W
  14048. 378.04 s [unordered-containers] depends tasty-1.5.3-2LfycgWm1o5IAj3wjDgcIY
  14049. 378.04 s [unordered-containers] depends tasty-hunit-0.10.2-GxiECQtHLG9JqzzTC7gSqY
  14050. 378.04 s [unordered-containers] depends tasty-quickcheck-0.11-597oKWlAkLA6PjifDQdXTX
  14051. 378.04 s [unordered-containers] depends unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
  14052. 378.04 s [unordered-containers] Using Cabal-3.14.1.0 compiled by ghc-9.12
  14053. 378.04 s [unordered-containers] Using compiler: ghc-9.12.1
  14054. 378.04 s [unordered-containers] Using install prefix:
  14055. 378.04 s [unordered-containers] /nix/store/fqlwhm7awx32h5gjwm1x40rw81ivhnb1-unordered-containers-0.2.20
  14056. 378.04 s [unordered-containers] Executables installed in:
  14057. 378.04 s [unordered-containers] /nix/store/fqlwhm7awx32h5gjwm1x40rw81ivhnb1-unordered-containers-0.2.20/bin
  14058. 378.04 s [unordered-containers] Libraries installed in:
  14059. 378.04 s [unordered-containers] /nix/store/fqlwhm7awx32h5gjwm1x40rw81ivhnb1-unordered-containers-0.2.20/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
  14060. 378.04 s [unordered-containers] Dynamic Libraries installed in:
  14061. 378.04 s [unordered-containers] /nix/store/fqlwhm7awx32h5gjwm1x40rw81ivhnb1-unordered-containers-0.2.20/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
  14062. 378.04 s [unordered-containers] Private executables installed in:
  14063. 378.04 s [unordered-containers] /nix/store/fqlwhm7awx32h5gjwm1x40rw81ivhnb1-unordered-containers-0.2.20/libexec/x86_64-linux-ghc-9.12.1-f739/unordered-containers-0.2.20
  14064. 378.04 s [unordered-containers] Data files installed in:
  14065. 378.04 s [unordered-containers] /nix/store/fqlwhm7awx32h5gjwm1x40rw81ivhnb1-unordered-containers-0.2.20/share/x86_64-linux-ghc-9.12.1-f739/unordered-containers-0.2.20
  14066. 378.04 s [unordered-containers] Documentation installed in:
  14067. 378.04 s [unordered-containers] /nix/store/2kzw5nvb6hk4c6jkxa6jw977rskvkrf3-unordered-containers-0.2.20-doc/share/doc/unordered-containers-0.2.20
  14068. 378.04 s [unordered-containers] Configuration files installed in:
  14069. 378.04 s [unordered-containers] /nix/store/fqlwhm7awx32h5gjwm1x40rw81ivhnb1-unordered-containers-0.2.20/etc
  14070. 378.04 s [unordered-containers] No alex found
  14071. 378.04 s [unordered-containers] Using ar found on system at:
  14072. 378.04 s [unordered-containers] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  14073. 378.04 s [unordered-containers] No c2hs found
  14074. 378.04 s [unordered-containers] No cpphs found
  14075. 378.04 s [unordered-containers] No doctest found
  14076. 378.04 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  14077. 378.04 s [unordered-containers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  14078. 378.04 s [unordered-containers] Using ghc version 9.12.1 found on system at:
  14079. 378.04 s [unordered-containers] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc
  14080. 378.04 s [unordered-containers] Using ghc-pkg version 9.12.1 found on system at:
  14081. 378.04 s [unordered-containers] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc-pkg-9.12.1
  14082. 378.04 s [unordered-containers] No ghcjs found
  14083. 378.04 s [unordered-containers] No ghcjs-pkg found
  14084. 378.04 s [unordered-containers] No greencard found
  14085. 378.04 s [unordered-containers] Using haddock version 2.30.0 found on system at:
  14086. 378.04 s [unordered-containers] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/haddock-ghc-9.12.1
  14087. 378.04 s [unordered-containers] No happy found
  14088. 378.04 s [unordered-containers] No haskell-suite found
  14089. 378.04 s [unordered-containers] No haskell-suite-pkg found
  14090. 378.04 s [unordered-containers] No hmake found
  14091. 378.04 s [unordered-containers] Using hpc version 0.69 found on system at:
  14092. 378.04 s [unordered-containers] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hpc-ghc-9.12.1
  14093. 378.04 s [unordered-containers] Using hsc2hs version 0.68.10 found on system at:
  14094. 378.04 s [unordered-containers] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
  14095. 378.04 s [unordered-containers] Using hscolour version 1.25 found on system at:
  14096. 378.04 s [unordered-containers] /nix/store/q6qz2x3a08capyv98w52zizgxcnmv4hb-hscolour-1.25/bin/HsColour
  14097. 378.04 s [unordered-containers] No jhc found
  14098. 378.04 s [unordered-containers] Using ld found on system at:
  14099. 378.04 s [unordered-containers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  14100. 378.04 s [unordered-containers] No pkg-config found
  14101. 378.04 s [unordered-containers] Using runghc version 9.12.1 found on system at:
  14102. 378.04 s [unordered-containers] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/runghc-9.12.1
  14103. 378.04 s [unordered-containers] Using strip version 2.44 found on system at:
  14104. 378.04 s [unordered-containers] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  14105. 378.04 s [unordered-containers] Using tar found on system at:
  14106. 378.04 s [unordered-containers] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  14107. 378.04 s [unordered-containers] No uhc found
  14108. 378.17 s [unordered-containers] Phase: buildPhase
  14109. 378.24 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20...
  14110. 378.24 s [unordered-containers] Building library for unordered-containers-0.2.20...
  14111. 378.33 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  14112. 378.33 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  14113. 378.33 s [unordered-containers] |
  14114. 378.33 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  14115. 378.33 s [unordered-containers] | ^^^^^^^^^^
  14116. 378.33 s [unordered-containers]
  14117. 378.53 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 )
  14118. 378.75 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  14119. 378.75 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  14120. 378.75 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  14121. 378.75 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  14122. 378.75 s [unordered-containers] |
  14123. 378.75 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  14124. 378.75 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14125. 378.75 s [unordered-containers]
  14126. 378.75 s [unordered-containers] Data/HashMap/Internal/Array.hs:162:20-43: warning: [GHC-68441] [-Wdeprecations]
  14127. 378.75 s [unordered-containers] In the use of ‘sizeofSmallMutableArray#’
  14128. 378.75 s [unordered-containers] (imported from GHC.Exts, but defined in GHC.Prim):
  14129. 378.75 s [unordered-containers] Deprecated: " Use 'getSizeofSmallMutableArray#' instead "
  14130. 378.75 s [unordered-containers] |
  14131. 378.75 s [unordered-containers] 162 | lengthM mary = I# (sizeofSmallMutableArray# (unMArray mary))
  14132. 378.75 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^
  14133. 378.75 s [unordered-containers]
  14134. 379.39 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 )
  14135. 379.40 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 )
  14136. 386.50 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 )
  14137. 386.99 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 )
  14138. 389.11 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 )
  14139. 389.11 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  14140. 389.11 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 )
  14141. 389.14 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 )
  14142. 389.46 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  14143. 389.46 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  14144. 389.47 s [unordered-containers] |
  14145. 389.47 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  14146. 389.47 s [unordered-containers] | ^^^^^^^^^^
  14147. 389.47 s [unordered-containers]
  14148. 389.69 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  14149. 389.87 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  14150. 389.87 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  14151. 389.87 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  14152. 389.87 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  14153. 389.87 s [unordered-containers] |
  14154. 389.88 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  14155. 389.88 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14156. 389.88 s [unordered-containers]
  14157. 389.88 s [unordered-containers] Data/HashMap/Internal/Array.hs:162:20-43: warning: [GHC-68441] [-Wdeprecations]
  14158. 389.88 s [unordered-containers] In the use of ‘sizeofSmallMutableArray#’
  14159. 389.88 s [unordered-containers] (imported from GHC.Exts, but defined in GHC.Prim):
  14160. 389.88 s [unordered-containers] Deprecated: " Use 'getSizeofSmallMutableArray#' instead "
  14161. 389.88 s [unordered-containers] |
  14162. 389.88 s [unordered-containers] 162 | lengthM mary = I# (sizeofSmallMutableArray# (unMArray mary))
  14163. 389.88 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^
  14164. 389.88 s [unordered-containers]
  14165. 390.74 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  14166. 390.74 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  14167. 400.46 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  14168. 401.04 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  14169. 403.16 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  14170. 403.16 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  14171. 403.16 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  14172. 403.26 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  14173. 404.47 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20...
  14174. 404.48 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20...
  14175. 404.61 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 )
  14176. 404.82 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  14177. 404.82 s [unordered-containers] tests/Regressions.hs:91:16: warning: [GHC-63394] [-Wx-partial]
  14178. 404.82 s [unordered-containers] In the use of ‘head’
  14179. 404.82 s [unordered-containers] (imported from Prelude, but defined in GHC.Internal.List):
  14180. 404.82 s [unordered-containers] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  14181. 404.82 s [unordered-containers] |
  14182. 404.82 s [unordered-containers] 91 | k = head keys
  14183. 404.82 s [unordered-containers] | ^^^^
  14184. 404.82 s [unordered-containers]
  14185. 406.96 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 )
  14186. 407.00 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  14187. 407.00 s [unordered-containers] tests/Strictness.hs:7:1: warning: [GHC-66111] [-Wunused-imports]
  14188. 407.00 s [unordered-containers] The import of ‘Data.Foldable’ is redundant
  14189. 407.00 s [unordered-containers] except perhaps to import instances from ‘Data.Foldable’
  14190. 407.00 s [unordered-containers] To import instances alone, use: import Data.Foldable()
  14191. 407.00 s [unordered-containers] |
  14192. 407.00 s [unordered-containers] 7 | import Data.Foldable (foldl')
  14193. 407.00 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14194. 407.00 s [unordered-containers]
  14195. 407.00 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 )
  14196. 407.00 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 )
  14197. 413.30 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 )
  14198. 413.34 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  14199. 413.34 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  14200. 414.10 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  14201. 415.04 s [unordered-containers] buildPhase completed in 37 seconds
  14202. 415.04 s [unordered-containers] Phase: checkPhase
  14203. 415.35 s [unordered-containers] Running 1 test suites...
  14204. 415.35 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  14205. 415.41 s [unordered-containers] All
  14206. 415.41 s [unordered-containers] Properties
  14207. 415.41 s [unordered-containers] Data.HashMap.Lazy
  14208. 415.41 s [unordered-containers] instances
  14209. 415.41 s [unordered-containers] Eq
  14210. 415.47 s [unordered-containers] ==: OK (0.10s)
  14211. 415.47 s [unordered-containers] +++ OK, passed 100 tests.
  14212. 415.47 s [unordered-containers] /=: OK
  14213. 415.47 s [unordered-containers] +++ OK, passed 100 tests.
  14214. 415.47 s [unordered-containers] Ord
  14215. 415.47 s [unordered-containers] compare reflexive: OK (0.01s)
  14216. 415.47 s [unordered-containers] +++ OK, passed 100 tests.
  14217. 415.47 s [unordered-containers] compare transitive: OK (0.03s)
  14218. 415.47 s [unordered-containers] +++ OK, passed 100 tests.
  14219. 415.47 s [unordered-containers] compare antisymmetric: OK (0.02s)
  14220. 415.47 s [unordered-containers] +++ OK, passed 100 tests.
  14221. 415.47 s [unordered-containers] Ord => Eq: OK (0.03s)
  14222. 415.47 s [unordered-containers] +++ OK, passed 100 tests.
  14223. 415.65 s [unordered-containers] Read/Show: OK (0.28s)
  14224. 415.65 s [unordered-containers] +++ OK, passed 100 tests.
  14225. 415.65 s [unordered-containers] Functor: OK (0.09s)
  14226. 415.65 s [unordered-containers] +++ OK, passed 100 tests.
  14227. 415.65 s [unordered-containers] Foldable: OK (0.07s)
  14228. 415.65 s [unordered-containers] +++ OK, passed 100 tests.
  14229. 415.65 s [unordered-containers] Bifoldable
  14230. 415.65 s [unordered-containers] bifoldMap: OK (0.02s)
  14231. 415.65 s [unordered-containers] +++ OK, passed 100 tests.
  14232. 415.65 s [unordered-containers] bifoldr: OK (0.02s)
  14233. 415.65 s [unordered-containers] +++ OK, passed 100 tests.
  14234. 415.65 s [unordered-containers] bifoldl: OK (0.02s)
  14235. 415.65 s [unordered-containers] +++ OK, passed 100 tests.
  14236. 415.65 s [unordered-containers] Hashable: OK (0.03s)
  14237. 415.65 s [unordered-containers] +++ OK, passed 100 tests.
  14238. 415.65 s [unordered-containers] empty
  14239. 415.65 s [unordered-containers] valid: OK
  14240. 415.65 s [unordered-containers] +++ OK, passed 1 test.
  14241. 415.65 s [unordered-containers] singleton
  14242. 415.65 s [unordered-containers] valid: OK
  14243. 415.65 s [unordered-containers] +++ OK, passed 100 tests.
  14244. 415.65 s [unordered-containers] size: OK
  14245. 415.65 s [unordered-containers] +++ OK, passed 100 tests.
  14246. 415.65 s [unordered-containers] member: OK
  14247. 415.65 s [unordered-containers] +++ OK, passed 100 tests.
  14248. 415.65 s [unordered-containers] lookup: OK
  14249. 415.65 s [unordered-containers] +++ OK, passed 100 tests.
  14250. 415.65 s [unordered-containers] !?: OK (0.02s)
  14251. 415.65 s [unordered-containers] +++ OK, passed 100 tests.
  14252. 415.65 s [unordered-containers] insert
  14253. 415.65 s [unordered-containers] model: OK
  14254. 415.65 s [unordered-containers] +++ OK, passed 100 tests.
  14255. 415.65 s [unordered-containers] valid: OK
  14256. 415.65 s [unordered-containers] +++ OK, passed 100 tests.
  14257. 415.65 s [unordered-containers] insertWith
  14258. 415.65 s [unordered-containers] insertWith: OK (0.02s)
  14259. 415.65 s [unordered-containers] +++ OK, passed 100 tests.
  14260. 415.66 s [unordered-containers] valid: OK (0.01s)
  14261. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14262. 415.66 s [unordered-containers] delete
  14263. 415.66 s [unordered-containers] model: OK
  14264. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14265. 415.66 s [unordered-containers] valid: OK
  14266. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14267. 415.66 s [unordered-containers] adjust
  14268. 415.66 s [unordered-containers] model: OK (0.01s)
  14269. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14270. 415.66 s [unordered-containers] valid: OK (0.07s)
  14271. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14272. 415.66 s [unordered-containers] update
  14273. 415.66 s [unordered-containers] model: OK
  14274. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14275. 415.66 s [unordered-containers] valid: OK
  14276. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14277. 415.66 s [unordered-containers] alter
  14278. 415.66 s [unordered-containers] model: OK (0.05s)
  14279. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14280. 415.66 s [unordered-containers] valid: OK
  14281. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14282. 415.66 s [unordered-containers] alterF
  14283. 415.66 s [unordered-containers] model
  14284. 415.66 s [unordered-containers] []: OK (0.15s)
  14285. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14286. 415.66 s [unordered-containers] adjust: OK (0.02s)
  14287. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14288. 415.66 s [unordered-containers] insert: OK (0.06s)
  14289. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14290. 415.66 s [unordered-containers] insertWith: OK (0.06s)
  14291. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14292. 415.66 s [unordered-containers] delete: OK
  14293. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14294. 415.66 s [unordered-containers] lookup: OK (0.06s)
  14295. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14296. 415.66 s [unordered-containers] valid: OK (0.07s)
  14297. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14298. 415.66 s [unordered-containers] isSubmapOf
  14299. 415.66 s [unordered-containers] model: OK (0.06s)
  14300. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14301. 415.66 s [unordered-containers] m ⊆ m: OK (0.04s)
  14302. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14303. 415.66 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.03s)
  14304. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14305. 415.66 s [unordered-containers] m1 ⊈ m2 ⇒ m1 ∪ m2 ⊈ m1: OK (0.02s)
  14306. 415.66 s [unordered-containers] +++ OK, passed 100 tests; 13 discarded.
  14307. 415.66 s [unordered-containers] m1\m2 ⊆ m1: OK (0.03s)
  14308. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14309. 415.66 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.02s)
  14310. 415.66 s [unordered-containers] +++ OK, passed 100 tests; 150 discarded.
  14311. 415.66 s [unordered-containers] delete k m ⊆ m: OK (0.01s)
  14312. 415.66 s [unordered-containers] +++ OK, passed 100 tests; 17 discarded.
  14313. 415.66 s [unordered-containers] m ⊈ delete k m : OK (0.02s)
  14314. 415.66 s [unordered-containers] +++ OK, passed 100 tests; 20 discarded.
  14315. 415.66 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK (0.01s)
  14316. 415.66 s [unordered-containers] +++ OK, passed 100 tests; 6 discarded.
  14317. 415.66 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.02s)
  14318. 415.66 s [unordered-containers] +++ OK, passed 100 tests; 5 discarded.
  14319. 415.66 s [unordered-containers] union
  14320. 415.66 s [unordered-containers] model: OK (0.04s)
  14321. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14322. 415.66 s [unordered-containers] valid: OK (0.01s)
  14323. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14324. 415.66 s [unordered-containers] unionWith
  14325. 415.66 s [unordered-containers] model: OK (0.03s)
  14326. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14327. 415.66 s [unordered-containers] valid: OK (0.02s)
  14328. 415.66 s [unordered-containers] +++ OK, passed 100 tests.
  14329. 415.66 s [unordered-containers] unionWithKey
  14330. 415.71 s [unordered-containers] model: OK (0.06s)
  14331. 415.71 s [unordered-containers] +++ OK, passed 100 tests.
  14332. 415.71 s [unordered-containers] valid: OK (0.02s)
  14333. 415.72 s [unordered-containers] +++ OK, passed 100 tests.
  14334. 415.72 s [unordered-containers] unions
  14335. 416.32 s [unordered-containers] model: OK (0.83s)
  14336. 416.32 s [unordered-containers] +++ OK, passed 100 tests.
  14337. 416.32 s [unordered-containers] valid: OK (0.53s)
  14338. 416.32 s [unordered-containers] +++ OK, passed 100 tests.
  14339. 416.32 s [unordered-containers] difference
  14340. 416.32 s [unordered-containers] model: OK (0.03s)
  14341. 416.32 s [unordered-containers] +++ OK, passed 100 tests.
  14342. 416.32 s [unordered-containers] valid: OK
  14343. 416.32 s [unordered-containers] +++ OK, passed 100 tests.
  14344. 416.32 s [unordered-containers] differenceWith
  14345. 416.33 s [unordered-containers] model: OK (0.04s)
  14346. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14347. 416.33 s [unordered-containers] valid: OK (0.02s)
  14348. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14349. 416.33 s [unordered-containers] intersection
  14350. 416.33 s [unordered-containers] model: OK (0.04s)
  14351. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14352. 416.33 s [unordered-containers] valid: OK (0.01s)
  14353. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14354. 416.33 s [unordered-containers] intersectionWith
  14355. 416.33 s [unordered-containers] model: OK (0.06s)
  14356. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14357. 416.33 s [unordered-containers] valid: OK (0.02s)
  14358. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14359. 416.33 s [unordered-containers] intersectionWithKey
  14360. 416.33 s [unordered-containers] model: OK (0.07s)
  14361. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14362. 416.33 s [unordered-containers] valid: OK (0.02s)
  14363. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14364. 416.33 s [unordered-containers] compose
  14365. 416.33 s [unordered-containers] valid: OK (0.04s)
  14366. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14367. 416.33 s [unordered-containers] map
  14368. 416.33 s [unordered-containers] model: OK (0.04s)
  14369. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14370. 416.33 s [unordered-containers] valid: OK (0.02s)
  14371. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14372. 416.33 s [unordered-containers] traverseWithKey
  14373. 416.33 s [unordered-containers] model: OK (0.17s)
  14374. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14375. 416.33 s [unordered-containers] valid: OK (0.02s)
  14376. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14377. 416.33 s [unordered-containers] mapKeys
  14378. 416.33 s [unordered-containers] model: OK (0.05s)
  14379. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14380. 416.33 s [unordered-containers] valid: OK (0.46s)
  14381. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14382. 416.33 s [unordered-containers] foldr: OK (0.02s)
  14383. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14384. 416.33 s [unordered-containers] foldl: OK
  14385. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14386. 416.33 s [unordered-containers] foldrWithKey: OK
  14387. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14388. 416.33 s [unordered-containers] foldlWithKey: OK (0.02s)
  14389. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14390. 416.33 s [unordered-containers] foldrWithKey': OK (0.01s)
  14391. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14392. 416.33 s [unordered-containers] foldlWithKey': OK (0.03s)
  14393. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14394. 416.33 s [unordered-containers] foldl': OK (0.02s)
  14395. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14396. 416.33 s [unordered-containers] foldr': OK (0.01s)
  14397. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14398. 416.33 s [unordered-containers] foldMapWithKey: OK
  14399. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14400. 416.33 s [unordered-containers] filter
  14401. 416.33 s [unordered-containers] model: OK (0.07s)
  14402. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14403. 416.33 s [unordered-containers] valid: OK (0.02s)
  14404. 416.33 s [unordered-containers] +++ OK, passed 100 tests.
  14405. 416.33 s [unordered-containers] filterWithKey
  14406. 416.75 s [unordered-containers] model: OK (1.21s)
  14407. 416.75 s [unordered-containers] +++ OK, passed 100 tests.
  14408. 416.75 s [unordered-containers] valid: OK (0.68s)
  14409. 416.75 s [unordered-containers] +++ OK, passed 100 tests.
  14410. 416.75 s [unordered-containers] mapMaybe
  14411. 416.75 s [unordered-containers] model: OK (0.06s)
  14412. 416.75 s [unordered-containers] +++ OK, passed 100 tests.
  14413. 416.75 s [unordered-containers] valid: OK (0.03s)
  14414. 416.75 s [unordered-containers] +++ OK, passed 100 tests.
  14415. 416.75 s [unordered-containers] mapMaybeWithKey
  14416. 416.98 s [unordered-containers] model: OK (1.44s)
  14417. 416.98 s [unordered-containers] +++ OK, passed 100 tests.
  14418. 416.98 s [unordered-containers] valid: OK (0.65s)
  14419. 416.98 s [unordered-containers] +++ OK, passed 100 tests.
  14420. 416.98 s [unordered-containers] elems: OK (0.02s)
  14421. 416.98 s [unordered-containers] +++ OK, passed 100 tests.
  14422. 416.98 s [unordered-containers] keys: OK
  14423. 416.98 s [unordered-containers] +++ OK, passed 100 tests.
  14424. 416.98 s [unordered-containers] fromList
  14425. 416.98 s [unordered-containers] model: OK
  14426. 416.98 s [unordered-containers] +++ OK, passed 100 tests.
  14427. 416.98 s [unordered-containers] valid: OK
  14428. 416.98 s [unordered-containers] +++ OK, passed 100 tests.
  14429. 416.98 s [unordered-containers] fromListWith
  14430. 416.98 s [unordered-containers] model: OK (0.01s)
  14431. 416.98 s [unordered-containers] +++ OK, passed 100 tests.
  14432. 416.98 s [unordered-containers] valid: OK
  14433. 416.98 s [unordered-containers] +++ OK, passed 100 tests.
  14434. 416.98 s [unordered-containers] fromListWithKey
  14435. 416.98 s [unordered-containers] model: OK (0.02s)
  14436. 416.98 s [unordered-containers] +++ OK, passed 100 tests.
  14437. 416.98 s [unordered-containers] valid: OK
  14438. 416.98 s [unordered-containers] +++ OK, passed 100 tests.
  14439. 416.98 s [unordered-containers] toList: OK (0.02s)
  14440. 416.98 s [unordered-containers] +++ OK, passed 100 tests.
  14441. 416.98 s [unordered-containers] Data.HashMap.Strict
  14442. 416.98 s [unordered-containers] instances
  14443. 416.98 s [unordered-containers] Eq
  14444. 416.98 s [unordered-containers] ==: OK (0.02s)
  14445. 416.98 s [unordered-containers] +++ OK, passed 100 tests.
  14446. 416.98 s [unordered-containers] /=: OK (0.04s)
  14447. 416.98 s [unordered-containers] +++ OK, passed 100 tests.
  14448. 416.98 s [unordered-containers] Ord
  14449. 416.98 s [unordered-containers] compare reflexive: OK (0.02s)
  14450. 416.98 s [unordered-containers] +++ OK, passed 100 tests.
  14451. 416.99 s [unordered-containers] compare transitive: OK (0.02s)
  14452. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14453. 416.99 s [unordered-containers] compare antisymmetric: OK (0.03s)
  14454. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14455. 416.99 s [unordered-containers] Ord => Eq: OK (0.02s)
  14456. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14457. 416.99 s [unordered-containers] Read/Show: OK (0.39s)
  14458. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14459. 416.99 s [unordered-containers] Functor: OK (0.11s)
  14460. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14461. 416.99 s [unordered-containers] Foldable: OK (0.05s)
  14462. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14463. 416.99 s [unordered-containers] Bifoldable
  14464. 416.99 s [unordered-containers] bifoldMap: OK (0.08s)
  14465. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14466. 416.99 s [unordered-containers] bifoldr: OK (0.04s)
  14467. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14468. 416.99 s [unordered-containers] bifoldl: OK (0.05s)
  14469. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14470. 416.99 s [unordered-containers] Hashable: OK (0.06s)
  14471. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14472. 416.99 s [unordered-containers] empty
  14473. 416.99 s [unordered-containers] valid: OK
  14474. 416.99 s [unordered-containers] +++ OK, passed 1 test.
  14475. 416.99 s [unordered-containers] singleton
  14476. 416.99 s [unordered-containers] valid: OK
  14477. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14478. 416.99 s [unordered-containers] size: OK (0.02s)
  14479. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14480. 416.99 s [unordered-containers] member: OK
  14481. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14482. 416.99 s [unordered-containers] lookup: OK
  14483. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14484. 416.99 s [unordered-containers] !?: OK (0.04s)
  14485. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14486. 416.99 s [unordered-containers] insert
  14487. 416.99 s [unordered-containers] model: OK (0.03s)
  14488. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14489. 416.99 s [unordered-containers] valid: OK (0.02s)
  14490. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14491. 416.99 s [unordered-containers] insertWith
  14492. 416.99 s [unordered-containers] insertWith: OK (0.04s)
  14493. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14494. 416.99 s [unordered-containers] valid: OK
  14495. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14496. 416.99 s [unordered-containers] delete
  14497. 416.99 s [unordered-containers] model: OK (0.01s)
  14498. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14499. 416.99 s [unordered-containers] valid: OK (0.03s)
  14500. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14501. 416.99 s [unordered-containers] adjust
  14502. 416.99 s [unordered-containers] model: OK (0.04s)
  14503. 416.99 s [unordered-containers] +++ OK, passed 100 tests.
  14504. 417.00 s [unordered-containers] valid: OK
  14505. 417.00 s [unordered-containers] +++ OK, passed 100 tests.
  14506. 417.00 s [unordered-containers] update
  14507. 417.00 s [unordered-containers] model: OK (0.04s)
  14508. 417.00 s [unordered-containers] +++ OK, passed 100 tests.
  14509. 417.00 s [unordered-containers] valid: OK (0.01s)
  14510. 417.00 s [unordered-containers] +++ OK, passed 100 tests.
  14511. 417.00 s [unordered-containers] alter
  14512. 417.00 s [unordered-containers] model: OK (0.02s)
  14513. 417.00 s [unordered-containers] +++ OK, passed 100 tests.
  14514. 417.00 s [unordered-containers] valid: OK (0.02s)
  14515. 417.00 s [unordered-containers] +++ OK, passed 100 tests.
  14516. 417.00 s [unordered-containers] alterF
  14517. 417.00 s [unordered-containers] model
  14518. 417.01 s [unordered-containers] []: OK (0.18s)
  14519. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14520. 417.01 s [unordered-containers] adjust: OK (0.03s)
  14521. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14522. 417.01 s [unordered-containers] insert: OK (0.02s)
  14523. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14524. 417.01 s [unordered-containers] insertWith: OK (0.03s)
  14525. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14526. 417.01 s [unordered-containers] delete: OK (0.02s)
  14527. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14528. 417.01 s [unordered-containers] lookup: OK (0.03s)
  14529. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14530. 417.01 s [unordered-containers] valid: OK (0.03s)
  14531. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14532. 417.01 s [unordered-containers] isSubmapOf
  14533. 417.01 s [unordered-containers] model: OK (0.08s)
  14534. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14535. 417.01 s [unordered-containers] m ⊆ m: OK (0.02s)
  14536. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14537. 417.01 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK (0.02s)
  14538. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14539. 417.01 s [unordered-containers] m1 ⊈ m2 ⇒ m1 ∪ m2 ⊈ m1: OK (0.04s)
  14540. 417.01 s [unordered-containers] +++ OK, passed 100 tests; 18 discarded.
  14541. 417.01 s [unordered-containers] m1\m2 ⊆ m1: OK (0.03s)
  14542. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14543. 417.01 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.05s)
  14544. 417.01 s [unordered-containers] +++ OK, passed 100 tests; 155 discarded.
  14545. 417.01 s [unordered-containers] delete k m ⊆ m: OK (0.01s)
  14546. 417.01 s [unordered-containers] +++ OK, passed 100 tests; 15 discarded.
  14547. 417.01 s [unordered-containers] m ⊈ delete k m : OK (0.02s)
  14548. 417.01 s [unordered-containers] +++ OK, passed 100 tests; 18 discarded.
  14549. 417.01 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK
  14550. 417.01 s [unordered-containers] +++ OK, passed 100 tests; 8 discarded.
  14551. 417.01 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK (0.01s)
  14552. 417.01 s [unordered-containers] +++ OK, passed 100 tests; 5 discarded.
  14553. 417.01 s [unordered-containers] union
  14554. 417.01 s [unordered-containers] model: OK (0.07s)
  14555. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14556. 417.01 s [unordered-containers] valid: OK (0.08s)
  14557. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14558. 417.01 s [unordered-containers] unionWith
  14559. 417.01 s [unordered-containers] model: OK (0.10s)
  14560. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14561. 417.01 s [unordered-containers] valid: OK (0.06s)
  14562. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14563. 417.01 s [unordered-containers] unionWithKey
  14564. 417.01 s [unordered-containers] model: OK (0.12s)
  14565. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14566. 417.01 s [unordered-containers] valid: OK (0.11s)
  14567. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14568. 417.01 s [unordered-containers] unions
  14569. 417.01 s [unordered-containers] model: OK (1.16s)
  14570. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14571. 417.01 s [unordered-containers] valid: OK (0.79s)
  14572. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14573. 417.01 s [unordered-containers] difference
  14574. 417.01 s [unordered-containers] model: OK (0.04s)
  14575. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14576. 417.01 s [unordered-containers] valid: OK (0.04s)
  14577. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14578. 417.01 s [unordered-containers] differenceWith
  14579. 417.01 s [unordered-containers] model: OK (0.10s)
  14580. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14581. 417.01 s [unordered-containers] valid: OK (0.07s)
  14582. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14583. 417.01 s [unordered-containers] intersection
  14584. 417.01 s [unordered-containers] model: OK (0.06s)
  14585. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14586. 417.01 s [unordered-containers] valid: OK (0.06s)
  14587. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14588. 417.01 s [unordered-containers] intersectionWith
  14589. 417.01 s [unordered-containers] model: OK (0.05s)
  14590. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14591. 417.01 s [unordered-containers] valid: OK (0.09s)
  14592. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14593. 417.01 s [unordered-containers] intersectionWithKey
  14594. 417.01 s [unordered-containers] model: OK (0.09s)
  14595. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14596. 417.01 s [unordered-containers] valid: OK (0.06s)
  14597. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14598. 417.01 s [unordered-containers] compose
  14599. 417.01 s [unordered-containers] valid: OK (0.04s)
  14600. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14601. 417.01 s [unordered-containers] map
  14602. 417.01 s [unordered-containers] model: OK (0.11s)
  14603. 417.01 s [unordered-containers] +++ OK, passed 100 tests.
  14604. 417.02 s [unordered-containers] valid: OK (0.05s)
  14605. 417.02 s [unordered-containers] +++ OK, passed 100 tests.
  14606. 417.02 s [unordered-containers] traverseWithKey
  14607. 417.02 s [unordered-containers] model: OK (0.13s)
  14608. 417.02 s [unordered-containers] +++ OK, passed 100 tests.
  14609. 417.02 s [unordered-containers] valid: OK (0.04s)
  14610. 417.02 s [unordered-containers] +++ OK, passed 100 tests.
  14611. 417.02 s [unordered-containers] mapKeys
  14612. 417.02 s [unordered-containers] model: OK (0.06s)
  14613. 417.02 s [unordered-containers] +++ OK, passed 100 tests.
  14614. 417.02 s [unordered-containers] valid: OK (0.56s)
  14615. 417.02 s [unordered-containers] +++ OK, passed 100 tests.
  14616. 417.02 s [unordered-containers] foldr: OK (0.02s)
  14617. 417.02 s [unordered-containers] +++ OK, passed 100 tests.
  14618. 417.02 s [unordered-containers] foldl: OK (0.04s)
  14619. 417.02 s [unordered-containers] +++ OK, passed 100 tests.
  14620. 417.02 s [unordered-containers] foldrWithKey: OK (0.02s)
  14621. 417.02 s [unordered-containers] +++ OK, passed 100 tests.
  14622. 417.02 s [unordered-containers] foldlWithKey: OK (0.04s)
  14623. 417.02 s [unordered-containers] +++ OK, passed 100 tests.
  14624. 417.02 s [unordered-containers] foldrWithKey': OK (0.03s)
  14625. 417.02 s [unordered-containers] +++ OK, passed 100 tests.
  14626. 417.02 s [unordered-containers] foldlWithKey': OK (0.06s)
  14627. 417.02 s [unordered-containers] +++ OK, passed 100 tests.
  14628. 417.02 s [unordered-containers] foldl': OK (0.04s)
  14629. 417.02 s [unordered-containers] +++ OK, passed 100 tests.
  14630. 417.02 s [unordered-containers] foldr': OK (0.03s)
  14631. 417.02 s [unordered-containers] +++ OK, passed 100 tests.
  14632. 417.02 s [unordered-containers] foldMapWithKey: OK (0.02s)
  14633. 417.02 s [unordered-containers] +++ OK, passed 100 tests.
  14634. 417.02 s [unordered-containers] filter
  14635. 417.02 s [unordered-containers] model: OK (0.12s)
  14636. 417.02 s [unordered-containers] +++ OK, passed 100 tests.
  14637. 417.02 s [unordered-containers] valid: OK (0.05s)
  14638. 417.02 s [unordered-containers] +++ OK, passed 100 tests.
  14639. 417.02 s [unordered-containers] filterWithKey
  14640. 417.10 s [unordered-containers] model: OK (1.02s)
  14641. 417.10 s [unordered-containers] +++ OK, passed 100 tests.
  14642. 417.10 s [unordered-containers] valid: OK (0.67s)
  14643. 417.10 s [unordered-containers] +++ OK, passed 100 tests.
  14644. 417.10 s [unordered-containers] mapMaybe
  14645. 417.10 s [unordered-containers] model: OK (0.14s)
  14646. 417.10 s [unordered-containers] +++ OK, passed 100 tests.
  14647. 417.10 s [unordered-containers] valid: OK (0.08s)
  14648. 417.10 s [unordered-containers] +++ OK, passed 100 tests.
  14649. 417.10 s [unordered-containers] mapMaybeWithKey
  14650. 417.17 s [unordered-containers] model: OK (1.09s)
  14651. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14652. 417.17 s [unordered-containers] valid: OK (0.60s)
  14653. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14654. 417.17 s [unordered-containers] elems: OK (0.06s)
  14655. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14656. 417.17 s [unordered-containers] keys: OK (0.04s)
  14657. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14658. 417.17 s [unordered-containers] fromList
  14659. 417.17 s [unordered-containers] model: OK (0.02s)
  14660. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14661. 417.17 s [unordered-containers] valid: OK (0.01s)
  14662. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14663. 417.17 s [unordered-containers] fromListWith
  14664. 417.17 s [unordered-containers] model: OK (0.02s)
  14665. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14666. 417.17 s [unordered-containers] valid: OK (0.02s)
  14667. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14668. 417.17 s [unordered-containers] fromListWithKey
  14669. 417.17 s [unordered-containers] model: OK (0.02s)
  14670. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14671. 417.17 s [unordered-containers] valid: OK (0.04s)
  14672. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14673. 417.17 s [unordered-containers] toList: OK (0.02s)
  14674. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14675. 417.17 s [unordered-containers] Data.HashSet
  14676. 417.17 s [unordered-containers] instances
  14677. 417.17 s [unordered-containers] Eq
  14678. 417.17 s [unordered-containers] ==: OK (0.02s)
  14679. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14680. 417.17 s [unordered-containers] == permutations: OK (0.02s)
  14681. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14682. 417.17 s [unordered-containers] /=: OK (0.07s)
  14683. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14684. 417.17 s [unordered-containers] Ord
  14685. 417.17 s [unordered-containers] compare reflexive: OK (0.03s)
  14686. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14687. 417.17 s [unordered-containers] compare transitive: OK (0.02s)
  14688. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14689. 417.17 s [unordered-containers] compare antisymmetric: OK (0.02s)
  14690. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14691. 417.17 s [unordered-containers] Ord => Eq: OK (0.02s)
  14692. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14693. 417.17 s [unordered-containers] Read/Show: OK (0.31s)
  14694. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14695. 417.17 s [unordered-containers] Foldable: OK (0.02s)
  14696. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14697. 417.17 s [unordered-containers] Hashable: OK (0.03s)
  14698. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14699. 417.17 s [unordered-containers] size: OK (0.01s)
  14700. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14701. 417.17 s [unordered-containers] member: OK (0.01s)
  14702. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14703. 417.17 s [unordered-containers] insert: OK (0.01s)
  14704. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14705. 417.17 s [unordered-containers] delete: OK
  14706. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14707. 417.17 s [unordered-containers] union: OK (0.03s)
  14708. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14709. 417.17 s [unordered-containers] map: OK (0.81s)
  14710. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14711. 417.17 s [unordered-containers] foldr: OK (0.06s)
  14712. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14713. 417.17 s [unordered-containers] foldl': OK (0.03s)
  14714. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14715. 417.17 s [unordered-containers] filter: OK (0.80s)
  14716. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14717. 417.17 s [unordered-containers] toList: OK (0.03s)
  14718. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14719. 417.17 s [unordered-containers] Data.HashMap.Internal.List
  14720. 417.17 s [unordered-containers] isPermutationBy: OK (0.02s)
  14721. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14722. 417.17 s [unordered-containers] isPermutationBy of different length: OK (0.01s)
  14723. 417.17 s [unordered-containers] +++ OK, passed 100 tests; 17 discarded.
  14724. 417.17 s [unordered-containers] pUnorderedCompare: OK (0.06s)
  14725. 417.17 s [unordered-containers] +++ OK, passed 100 tests.
  14726. 417.17 s [unordered-containers] modelUnorderedCompare
  14727. 417.17 s [unordered-containers] reflexive: OK (0.03s)
  14728. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14729. 417.18 s [unordered-containers] anti-symmetric: OK (0.02s)
  14730. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14731. 417.18 s [unordered-containers] transitive: OK (0.04s)
  14732. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14733. 417.18 s [unordered-containers] Regression tests
  14734. 417.18 s [unordered-containers] issue32: OK (0.01s)
  14735. 417.18 s [unordered-containers] issue39a: OK
  14736. 417.18 s [unordered-containers] issue39b: OK (0.03s)
  14737. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14738. 417.18 s [unordered-containers] issue254 lazy: OK
  14739. 417.18 s [unordered-containers] issue254 strict: OK
  14740. 417.18 s [unordered-containers] issue379
  14741. 417.18 s [unordered-containers] Lazy.unionWith: OK
  14742. 417.18 s [unordered-containers] union: OK
  14743. 417.18 s [unordered-containers] Strict.unionWith: OK
  14744. 417.18 s [unordered-containers] Strict.unionWithKey: OK
  14745. 417.18 s [unordered-containers] issue381
  14746. 417.18 s [unordered-containers] mapMaybe: OK
  14747. 417.18 s [unordered-containers] mapMaybeWithKey: OK
  14748. 417.18 s [unordered-containers] issue382: OK
  14749. 417.18 s [unordered-containers] issue383: OK
  14750. 417.18 s [unordered-containers] issue420: OK
  14751. 417.18 s [unordered-containers] Strictness
  14752. 417.18 s [unordered-containers] HashMap.Strict
  14753. 417.18 s [unordered-containers] singleton is key-strict: OK
  14754. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14755. 417.18 s [unordered-containers] singleton is value-strict: OK
  14756. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14757. 417.18 s [unordered-containers] member is key-strict: OK
  14758. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14759. 417.18 s [unordered-containers] lookup is key-strict: OK
  14760. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14761. 417.18 s [unordered-containers] lookupDefault is key-strict: OK
  14762. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14763. 417.18 s [unordered-containers] findWithDefault is key-strict: OK
  14764. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14765. 417.18 s [unordered-containers] ! is key-strict: OK
  14766. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14767. 417.18 s [unordered-containers] delete is key-strict: OK
  14768. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14769. 417.18 s [unordered-containers] adjust is key-strict: OK
  14770. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14771. 417.18 s [unordered-containers] adjust is value-strict: OK (0.02s)
  14772. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14773. 417.18 s [unordered-containers] insert is key-strict: OK
  14774. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14775. 417.18 s [unordered-containers] insert is value-strict: OK
  14776. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14777. 417.18 s [unordered-containers] insertWith is key-strict: OK
  14778. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14779. 417.18 s [unordered-containers] insertWith is value-strict: OK (0.01s)
  14780. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14781. 417.18 s [unordered-containers] fromList is key-strict: OK
  14782. 417.18 s [unordered-containers] +++ OK, passed 1 test.
  14783. 417.18 s [unordered-containers] fromList is value-strict: OK
  14784. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14785. 417.18 s [unordered-containers] fromListWith is key-strict: OK
  14786. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14787. 417.18 s [unordered-containers] fromListWith is value-strict: OK (0.02s)
  14788. 417.18 s [unordered-containers] +++ OK, passed 100 tests.
  14789. 417.18 s [unordered-containers]
  14790. 417.18 s [unordered-containers] All 256 tests passed (1.81s)
  14791. 417.19 s [unordered-containers] Test suite unordered-containers-tests: PASS
  14792. 417.19 s [unordered-containers] Test suite logged to:
  14793. 417.19 s [unordered-containers] dist/test/unordered-containers-0.2.20-unordered-containers-tests.log
  14794. 417.19 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  14795. 417.19 s [unordered-containers] Phase: haddockPhase
  14796. 417.77 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20...
  14797. 417.77 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20...
  14798. 417.97 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  14799. 417.97 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  14800. 417.97 s [unordered-containers] |
  14801. 417.98 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  14802. 417.98 s [unordered-containers] | ^^^^^^^^^^
  14803. 417.98 s [unordered-containers]
  14804. 418.14 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing ) [Flags changed]
  14805. 418.54 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  14806. 418.69 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  14807. 418.69 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  14808. 418.69 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  14809. 418.69 s [unordered-containers] |
  14810. 418.69 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  14811. 418.69 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14812. 418.69 s [unordered-containers]
  14813. 418.69 s [unordered-containers] Data/HashMap/Internal/Array.hs:162:20-43: warning: [GHC-68441] [-Wdeprecations]
  14814. 418.69 s [unordered-containers] In the use of ‘sizeofSmallMutableArray#’
  14815. 418.69 s [unordered-containers] (imported from GHC.Exts, but defined in GHC.Prim):
  14816. 418.69 s [unordered-containers] Deprecated: " Use 'getSizeofSmallMutableArray#' instead "
  14817. 418.69 s [unordered-containers] |
  14818. 418.69 s [unordered-containers] 162 | lengthM mary = I# (sizeofSmallMutableArray# (unMArray mary))
  14819. 418.69 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^
  14820. 418.69 s [unordered-containers]
  14821. 418.69 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing ) [Flags changed]
  14822. 418.69 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing ) [Flags changed]
  14823. 419.53 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing ) [Flags changed]
  14824. 419.57 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing ) [Flags changed]
  14825. 419.74 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing ) [Flags changed]
  14826. 419.80 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, nothing ) [Flags changed]
  14827. 419.81 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing ) [Flags changed]
  14828. 419.81 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing ) [Flags changed]
  14829. 419.81 s [unordered-containers] Haddock coverage:
  14830. 419.93 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  14831. 419.93 s [unordered-containers] Missing documentation for:
  14832. 419.93 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  14833. 419.93 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  14834. 419.93 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:208)
  14835. 419.94 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:225)
  14836. 419.94 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:229)
  14837. 419.94 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:233)
  14838. 419.94 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:242)
  14839. 419.94 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:154)
  14840. 419.94 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:162)
  14841. 419.94 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:249)
  14842. 419.94 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:255)
  14843. 419.94 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:262)
  14844. 419.94 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:274)
  14845. 419.94 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:268)
  14846. 419.94 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:140)
  14847. 419.94 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
  14848. 419.94 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:286)
  14849. 419.94 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
  14850. 419.94 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:292)
  14851. 419.94 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:314)
  14852. 419.94 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:404)
  14853. 419.94 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:375)
  14854. 419.94 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:394)
  14855. 419.94 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:385)
  14856. 419.94 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:417)
  14857. 419.94 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:436)
  14858. 419.94 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:461)
  14859. 419.94 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:537)
  14860. 419.94 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:553)
  14861. 419.94 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:529)
  14862. 419.94 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:494)
  14863. 419.94 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:506)
  14864. 419.94 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  14865. 419.94 s [unordered-containers] Missing documentation for:
  14866. 419.94 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:40)
  14867. 419.94 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:83)
  14868. 419.94 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:68)
  14869. 419.94 s [unordered-containers] Warning: 'at' is out of scope.
  14870. 419.94 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  14871. 419.94 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  14872. 419.94 s [unordered-containers] * at Data/HashMap/Internal.hs:225:7
  14873. 419.94 s [unordered-containers] * at Data/HashMap/Internal.hs:185:1
  14874. 419.94 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14875. 419.94 s [unordered-containers] by specifying the type/value namespace explicitly.
  14876. 419.94 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:185:1
  14877. 419.95 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  14878. 419.95 s [unordered-containers] Missing documentation for:
  14879. 419.95 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:185)
  14880. 419.95 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1855)
  14881. 419.95 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2368)
  14882. 419.95 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:511)
  14883. 419.95 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:495)
  14884. 419.95 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:678)
  14885. 419.95 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:657)
  14886. 419.95 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:660)
  14887. 419.95 s [unordered-containers] insert' (Data/HashMap/Internal.hs:806)
  14888. 419.95 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1124)
  14889. 419.95 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:848)
  14890. 419.95 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:883)
  14891. 419.95 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  14892. 419.95 s [unordered-containers] Missing documentation for:
  14893. 419.95 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:98)
  14894. 419.95 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  14895. 419.95 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  14896. 419.95 s [unordered-containers] Warning: 'lookup' is out of scope.
  14897. 419.95 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  14898. 419.95 s [unordered-containers] Warning: 'at' is out of scope.
  14899. 419.95 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  14900. 419.96 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  14901. 419.96 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  14902. 419.96 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  14903. 419.96 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  14904. 419.96 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14905. 419.96 s [unordered-containers] by specifying the type/value namespace explicitly.
  14906. 419.96 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  14907. 419.96 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  14908. 419.96 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  14909. 419.96 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  14910. 419.96 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  14911. 419.96 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14912. 419.96 s [unordered-containers] by specifying the type/value namespace explicitly.
  14913. 419.96 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  14914. 419.96 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  14915. 419.97 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  14916. 419.97 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  14917. 420.12 s [unordered-containers] Warning: Data.HashMap.Internal: could not find link destinations for:
  14918. 420.12 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14919. 420.12 s [unordered-containers] Warning: Data.HashMap.Internal.Strict: could not find link destinations for:
  14920. 420.12 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14921. 420.13 s [unordered-containers] Warning: Data.HashSet.Internal: could not find link destinations for:
  14922. 420.13 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  14923. 420.13 s [unordered-containers] Warning: Data.HashSet: could not find link destinations for:
  14924. 420.13 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  14925. 420.31 s [unordered-containers] Warning: Data.HashMap.Strict: could not find link destinations for:
  14926. 420.31 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14927. 420.32 s [unordered-containers] Warning: Data.HashMap.Lazy: could not find link destinations for:
  14928. 420.32 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14929. 426.68 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers,
  14930. 426.68 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  14931. 427.18 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20...
  14932. 427.24 s [unordered-containers] Phase: installPhase
  14933. 427.31 s [unordered-containers] Installing library in /nix/store/fqlwhm7awx32h5gjwm1x40rw81ivhnb1-unordered-containers-0.2.20/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
  14934. 427.66 s [unordered-containers] Phase: fixupPhase
  14935. 427.68 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/fqlwhm7awx32h5gjwm1x40rw81ivhnb1-unordered-containers-0.2.20
  14936. 427.69 s [unordered-containers] shrinking /nix/store/fqlwhm7awx32h5gjwm1x40rw81ivhnb1-unordered-containers-0.2.20/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSunordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV-ghc9.12.1.so
  14937. 427.70 s [unordered-containers] checking for references to /build/ in /nix/store/fqlwhm7awx32h5gjwm1x40rw81ivhnb1-unordered-containers-0.2.20...
  14938. 427.71 s [unordered-containers] patching script interpreter paths in /nix/store/fqlwhm7awx32h5gjwm1x40rw81ivhnb1-unordered-containers-0.2.20
  14939. 427.72 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/fqlwhm7awx32h5gjwm1x40rw81ivhnb1-unordered-containers-0.2.20/lib
  14940. 427.85 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/2kzw5nvb6hk4c6jkxa6jw977rskvkrf3-unordered-containers-0.2.20-doc
  14941. 427.86 s [unordered-containers] checking for references to /build/ in /nix/store/2kzw5nvb6hk4c6jkxa6jw977rskvkrf3-unordered-containers-0.2.20-doc...
  14942. 427.87 s [unordered-containers] patching script interpreter paths in /nix/store/2kzw5nvb6hk4c6jkxa6jw977rskvkrf3-unordered-containers-0.2.20-doc
  14943. 427.98 s [unordered-containers:post-build] Uploading to cachix cache "sellout": /nix/store/2kzw5nvb6hk4c6jkxa6jw977rskvkrf3-unordered-containers-0.2.20-doc /nix/store/fqlwhm7awx32h5gjwm1x40rw81ivhnb1-unordered-containers-0.2.20
  14944. 428.53 s [unordered-containers:post-build] Pushing 2 paths (68 are already present) using zstd to cache sellout ⏳
  14945. 428.53 s [unordered-containers:post-build]
  14946. 428.95 s [unordered-containers:post-build] Pushing /nix/store/fqlwhm7awx32h5gjwm1x40rw81ivhnb1-unordered-containers-0.2.20 (9.78 MiB)
  14947. 429.03 s [unordered-containers:post-build] Pushing /nix/store/2kzw5nvb6hk4c6jkxa6jw977rskvkrf3-unordered-containers-0.2.20-doc (4.46 MiB)
  14948. 430.10 s [unordered-containers:post-build]
  14949. 430.10 s [unordered-containers:post-build] All done.
  14950. 430.12 s [unordered-containers:post-build] Uploading to the NixCI cache: /nix/store/2kzw5nvb6hk4c6jkxa6jw977rskvkrf3-unordered-containers-0.2.20-doc /nix/store/fqlwhm7awx32h5gjwm1x40rw81ivhnb1-unordered-containers-0.2.20
  14951. 430.17 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14952. 430.43 s [unordered-containers:post-build] copying 2 paths...
  14953. 430.43 s [unordered-containers:post-build] copying path '/nix/store/2kzw5nvb6hk4c6jkxa6jw977rskvkrf3-unordered-containers-0.2.20-doc' to 'https://cache.nix-ci.com'...
  14954. 431.26 s [unordered-containers:post-build] copying path '/nix/store/fqlwhm7awx32h5gjwm1x40rw81ivhnb1-unordered-containers-0.2.20' to 'https://cache.nix-ci.com'...
  14955. 433.66 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14956. 433.94 s [unordered-containers:post-build] copying 2 paths...
  14957. 433.99 s [unordered-containers:post-build] copying path '/nix/store/xkj9addxivy9k961xsg5llffgy6bsiac-ChasingBottoms-1.3.1.15.drv' to 'https://cache.nix-ci.com'...
  14958. 434.18 s [unordered-containers:post-build] copying path '/nix/store/fbqzfaggj1qpgfhqardy5hbifamsjhqz-unordered-containers-0.2.20.drv' to 'https://cache.nix-ci.com'...
  14959. 434.45 s Progress: 6 of 14 built, 145 of 145 downloaded from cache
  14960. 434.49 s Building /nix/store/64wvpr5l98zqx896sqy10dh2a6hc9l5j-quickcheck-instances-0.3.32.drv
  14961. 434.63 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  14962. 434.65 s [quickcheck-instances] Build with /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1.
  14963. 434.85 s [quickcheck-instances] Phase: unpackPhase
  14964. 434.85 s [quickcheck-instances] unpacking source archive /nix/store/kz0fzqcr8g42rvq6dwlwvzxmg8rjfhqn-quickcheck-instances-0.3.32.tar.gz
  14965. 434.86 s [quickcheck-instances] source root is quickcheck-instances-0.3.32
  14966. 434.86 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.32/test/Tests.hs"
  14967. 434.87 s [quickcheck-instances] Phase: patchPhase
  14968. 434.87 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.32/revision/1.cabal.
  14969. 434.87 s [quickcheck-instances] Phase: compileBuildDriverPhase
  14970. 434.88 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.71CPdWKL7q/setup-package.conf.d -threaded
  14971. 434.93 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.71CPdWKL7q/Main.o )
  14972. 434.98 s [quickcheck-instances] [2 of 2] Linking Setup
  14973. 436.32 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  14974. 436.33 s [quickcheck-instances] Phase: configurePhase
  14975. 436.34 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/1x3phxs3627g6gxws2hmr6hz11x5z1pf-quickcheck-instances-0.3.32 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/yvidpx3i492r6gkwwwp0fbr303dgzaff-quickcheck-instances-0.3.32-doc/share/doc/quickcheck-instances-0.3.32 --with-gcc=gcc --package-db=/build/tmp.71CPdWKL7q/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
  14976. 436.35 s [quickcheck-instances] Using Parsec parser
  14977. 436.35 s [quickcheck-instances] Configuring quickcheck-instances-0.3.32...
  14978. 436.38 s [quickcheck-instances] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  14979. 436.38 s [quickcheck-instances] 'ghc' version < 9.12):
  14980. 436.38 s [quickcheck-instances] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc is version
  14981. 436.38 s [quickcheck-instances] 9.12.1
  14982. 436.89 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  14983. 436.89 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.15.1: using QuickCheck-2.14.3
  14984. 436.89 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
  14985. 436.89 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.21.0.0
  14986. 436.89 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.2.0
  14987. 436.89 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  14988. 436.89 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.7
  14989. 436.89 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  14990. 436.89 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.4.7.0
  14991. 436.89 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  14992. 436.89 s [quickcheck-instances] integer-logarithms-1.0.4
  14993. 436.89 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  14994. 436.89 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  14995. 436.89 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  14996. 436.89 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.1
  14997. 436.89 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  14998. 436.89 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
  14999. 436.89 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.2
  15000. 436.89 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  15001. 436.89 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  15002. 436.89 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
  15003. 436.89 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.2
  15004. 436.89 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  15005. 436.89 s [quickcheck-instances] unordered-containers-0.2.20
  15006. 436.89 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  15007. 436.89 s [quickcheck-instances] Dependency vector >=0.13.1.0 && <0.14: using vector-0.13.2.0
  15008. 436.89 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.14.3
  15009. 436.89 s [quickcheck-instances] Dependency base: using base-4.21.0.0
  15010. 436.89 s [quickcheck-instances] Dependency containers: using containers-0.7
  15011. 436.89 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  15012. 436.89 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.32
  15013. 436.89 s [quickcheck-instances] Dependency tagged: using tagged-0.8.9
  15014. 436.89 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  15015. 436.89 s [quickcheck-instances] Source component graph:
  15016. 436.89 s [quickcheck-instances] component lib
  15017. 436.89 s [quickcheck-instances] component test:self-test dependency lib
  15018. 436.89 s [quickcheck-instances] Configured component graph:
  15019. 436.89 s [quickcheck-instances] component quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
  15020. 436.89 s [quickcheck-instances] include OneTuple-0.4.2-1etABur84rnIpm4BxUeGkM
  15021. 436.89 s [quickcheck-instances] include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  15022. 436.89 s [quickcheck-instances] include array-0.5.8.0-038b
  15023. 436.89 s [quickcheck-instances] include base-4.21.0.0-f068
  15024. 436.89 s [quickcheck-instances] include bytestring-0.12.2.0-be6d
  15025. 436.89 s [quickcheck-instances] include case-insensitive-1.2.1.0-1111wd92GfMLQ0M9sgP9TH
  15026. 436.89 s [quickcheck-instances] include containers-0.7-647d
  15027. 436.89 s [quickcheck-instances] include data-fix-0.3.4-5Z91m5Lp4p63x0eKjxyDHe
  15028. 436.89 s [quickcheck-instances] include hashable-1.4.7.0-FrCvEjo9HTdHfqyBqag94O
  15029. 436.89 s [quickcheck-instances] include integer-logarithms-1.0.4-A2xX46hbkgB7IChpMOBT0v
  15030. 436.89 s [quickcheck-instances] include old-time-1.1.0.4-27MPESX8Qdi6qL3OyG7GpW
  15031. 436.89 s [quickcheck-instances] include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  15032. 436.89 s [quickcheck-instances] include scientific-0.3.8.0-3okI0OjyUAXLySDZVSci1b
  15033. 436.89 s [quickcheck-instances] include splitmix-0.1.1-1EvesHEIqnf3WPcxWKF8Uw
  15034. 436.89 s [quickcheck-instances] include strict-0.5.1-E9ObxZudiKK9J4xi4Pfq2i
  15035. 436.89 s [quickcheck-instances] include tagged-0.8.9-KKVCaQOOaOC48LiR7ACFoh
  15036. 436.89 s [quickcheck-instances] include text-2.1.2-5eaa
  15037. 436.89 s [quickcheck-instances] include text-short-0.1.6-KmYT3m6Juw2HuCbOYybAlN
  15038. 436.89 s [quickcheck-instances] include these-1.2.1-77B7QTdYqCB8IXgulz2Gp9
  15039. 436.89 s [quickcheck-instances] include time-compat-1.9.8-2QmdPYKcH0x6Rtj68lHp55
  15040. 436.89 s [quickcheck-instances] include transformers-0.6.1.2-199f
  15041. 436.89 s [quickcheck-instances] include unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
  15042. 436.89 s [quickcheck-instances] include uuid-types-1.0.6-7IjrXtTlAmBDvZGWy9lb0E
  15043. 436.89 s [quickcheck-instances] include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  15044. 436.89 s [quickcheck-instances] component quickcheck-instances-0.3.32-GLVoDjQO9W6LtAZCy0oWT7-self-test
  15045. 436.89 s [quickcheck-instances] include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  15046. 436.89 s [quickcheck-instances] include base-4.21.0.0-f068
  15047. 436.89 s [quickcheck-instances] include containers-0.7-647d
  15048. 436.89 s [quickcheck-instances] include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  15049. 436.89 s [quickcheck-instances] include quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
  15050. 436.89 s [quickcheck-instances] include tagged-0.8.9-KKVCaQOOaOC48LiR7ACFoh
  15051. 436.89 s [quickcheck-instances] include uuid-types-1.0.6-7IjrXtTlAmBDvZGWy9lb0E
  15052. 436.89 s [quickcheck-instances] Linked component graph:
  15053. 436.89 s [quickcheck-instances] unit quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
  15054. 436.89 s [quickcheck-instances] include OneTuple-0.4.2-1etABur84rnIpm4BxUeGkM
  15055. 436.89 s [quickcheck-instances] include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  15056. 436.89 s [quickcheck-instances] include array-0.5.8.0-038b
  15057. 436.89 s [quickcheck-instances] include base-4.21.0.0-f068
  15058. 436.89 s [quickcheck-instances] include bytestring-0.12.2.0-be6d
  15059. 436.89 s [quickcheck-instances] include case-insensitive-1.2.1.0-1111wd92GfMLQ0M9sgP9TH
  15060. 436.89 s [quickcheck-instances] include containers-0.7-647d
  15061. 436.89 s [quickcheck-instances] include data-fix-0.3.4-5Z91m5Lp4p63x0eKjxyDHe
  15062. 436.89 s [quickcheck-instances] include hashable-1.4.7.0-FrCvEjo9HTdHfqyBqag94O
  15063. 436.89 s [quickcheck-instances] include integer-logarithms-1.0.4-A2xX46hbkgB7IChpMOBT0v
  15064. 436.89 s [quickcheck-instances] include old-time-1.1.0.4-27MPESX8Qdi6qL3OyG7GpW
  15065. 436.89 s [quickcheck-instances] include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  15066. 436.89 s [quickcheck-instances] include scientific-0.3.8.0-3okI0OjyUAXLySDZVSci1b
  15067. 436.89 s [quickcheck-instances] include splitmix-0.1.1-1EvesHEIqnf3WPcxWKF8Uw
  15068. 436.89 s [quickcheck-instances] include strict-0.5.1-E9ObxZudiKK9J4xi4Pfq2i
  15069. 436.89 s [quickcheck-instances] include tagged-0.8.9-KKVCaQOOaOC48LiR7ACFoh
  15070. 436.89 s [quickcheck-instances] include text-2.1.2-5eaa
  15071. 436.89 s [quickcheck-instances] include text-short-0.1.6-KmYT3m6Juw2HuCbOYybAlN
  15072. 436.89 s [quickcheck-instances] include these-1.2.1-77B7QTdYqCB8IXgulz2Gp9
  15073. 436.89 s [quickcheck-instances] include time-compat-1.9.8-2QmdPYKcH0x6Rtj68lHp55
  15074. 436.89 s [quickcheck-instances] include transformers-0.6.1.2-199f
  15075. 436.89 s [quickcheck-instances] include unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
  15076. 436.89 s [quickcheck-instances] include uuid-types-1.0.6-7IjrXtTlAmBDvZGWy9lb0E
  15077. 436.89 s [quickcheck-instances] include vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  15078. 436.89 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx:Test.QuickCheck.Instances.Void
  15079. 436.89 s [quickcheck-instances] unit quickcheck-instances-0.3.32-GLVoDjQO9W6LtAZCy0oWT7-self-test
  15080. 436.89 s [quickcheck-instances] include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  15081. 436.91 s [quickcheck-instances] include base-4.21.0.0-f068
  15082. 436.91 s [quickcheck-instances] include containers-0.7-647d
  15083. 436.91 s [quickcheck-instances] include primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  15084. 436.91 s [quickcheck-instances] include quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
  15085. 436.91 s [quickcheck-instances] include tagged-0.8.9-KKVCaQOOaOC48LiR7ACFoh
  15086. 436.91 s [quickcheck-instances] include uuid-types-1.0.6-7IjrXtTlAmBDvZGWy9lb0E
  15087. 436.91 s [quickcheck-instances] Ready component graph:
  15088. 436.91 s [quickcheck-instances] definite quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
  15089. 436.91 s [quickcheck-instances] depends OneTuple-0.4.2-1etABur84rnIpm4BxUeGkM
  15090. 436.91 s [quickcheck-instances] depends QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  15091. 436.91 s [quickcheck-instances] depends array-0.5.8.0-038b
  15092. 436.91 s [quickcheck-instances] depends base-4.21.0.0-f068
  15093. 436.91 s [quickcheck-instances] depends bytestring-0.12.2.0-be6d
  15094. 436.91 s [quickcheck-instances] depends case-insensitive-1.2.1.0-1111wd92GfMLQ0M9sgP9TH
  15095. 436.91 s [quickcheck-instances] depends containers-0.7-647d
  15096. 436.91 s [quickcheck-instances] depends data-fix-0.3.4-5Z91m5Lp4p63x0eKjxyDHe
  15097. 436.91 s [quickcheck-instances] depends hashable-1.4.7.0-FrCvEjo9HTdHfqyBqag94O
  15098. 436.91 s [quickcheck-instances] depends integer-logarithms-1.0.4-A2xX46hbkgB7IChpMOBT0v
  15099. 436.91 s [quickcheck-instances] depends old-time-1.1.0.4-27MPESX8Qdi6qL3OyG7GpW
  15100. 436.91 s [quickcheck-instances] depends primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  15101. 436.91 s [quickcheck-instances] depends scientific-0.3.8.0-3okI0OjyUAXLySDZVSci1b
  15102. 436.91 s [quickcheck-instances] depends splitmix-0.1.1-1EvesHEIqnf3WPcxWKF8Uw
  15103. 436.91 s [quickcheck-instances] depends strict-0.5.1-E9ObxZudiKK9J4xi4Pfq2i
  15104. 436.91 s [quickcheck-instances] depends tagged-0.8.9-KKVCaQOOaOC48LiR7ACFoh
  15105. 436.91 s [quickcheck-instances] depends text-2.1.2-5eaa
  15106. 436.91 s [quickcheck-instances] depends text-short-0.1.6-KmYT3m6Juw2HuCbOYybAlN
  15107. 436.91 s [quickcheck-instances] depends these-1.2.1-77B7QTdYqCB8IXgulz2Gp9
  15108. 436.91 s [quickcheck-instances] depends time-compat-1.9.8-2QmdPYKcH0x6Rtj68lHp55
  15109. 436.91 s [quickcheck-instances] depends transformers-0.6.1.2-199f
  15110. 436.91 s [quickcheck-instances] depends unordered-containers-0.2.20-IEfXmzpziDy5vqCdrwDTPV
  15111. 436.91 s [quickcheck-instances] depends uuid-types-1.0.6-7IjrXtTlAmBDvZGWy9lb0E
  15112. 436.91 s [quickcheck-instances] depends vector-0.13.2.0-LKSB10K7yAABOTSbq9H69q
  15113. 436.91 s [quickcheck-instances] definite quickcheck-instances-0.3.32-GLVoDjQO9W6LtAZCy0oWT7-self-test
  15114. 436.91 s [quickcheck-instances] depends QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  15115. 436.91 s [quickcheck-instances] depends base-4.21.0.0-f068
  15116. 436.91 s [quickcheck-instances] depends containers-0.7-647d
  15117. 436.91 s [quickcheck-instances] depends primitive-0.9.1.0-4mP32nrOmbODcFIoSZ6ejg
  15118. 436.91 s [quickcheck-instances] depends quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
  15119. 436.91 s [quickcheck-instances] depends tagged-0.8.9-KKVCaQOOaOC48LiR7ACFoh
  15120. 436.91 s [quickcheck-instances] depends uuid-types-1.0.6-7IjrXtTlAmBDvZGWy9lb0E
  15121. 436.91 s [quickcheck-instances] Using Cabal-3.14.1.0 compiled by ghc-9.12
  15122. 436.91 s [quickcheck-instances] Using compiler: ghc-9.12.1
  15123. 436.91 s [quickcheck-instances] Using install prefix:
  15124. 436.91 s [quickcheck-instances] /nix/store/1x3phxs3627g6gxws2hmr6hz11x5z1pf-quickcheck-instances-0.3.32
  15125. 436.91 s [quickcheck-instances] Executables installed in:
  15126. 436.91 s [quickcheck-instances] /nix/store/1x3phxs3627g6gxws2hmr6hz11x5z1pf-quickcheck-instances-0.3.32/bin
  15127. 436.91 s [quickcheck-instances] Libraries installed in:
  15128. 436.91 s [quickcheck-instances] /nix/store/1x3phxs3627g6gxws2hmr6hz11x5z1pf-quickcheck-instances-0.3.32/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
  15129. 436.91 s [quickcheck-instances] Dynamic Libraries installed in:
  15130. 436.91 s [quickcheck-instances] /nix/store/1x3phxs3627g6gxws2hmr6hz11x5z1pf-quickcheck-instances-0.3.32/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
  15131. 436.91 s [quickcheck-instances] Private executables installed in:
  15132. 436.91 s [quickcheck-instances] /nix/store/1x3phxs3627g6gxws2hmr6hz11x5z1pf-quickcheck-instances-0.3.32/libexec/x86_64-linux-ghc-9.12.1-f739/quickcheck-instances-0.3.32
  15133. 436.91 s [quickcheck-instances] Data files installed in:
  15134. 436.91 s [quickcheck-instances] /nix/store/1x3phxs3627g6gxws2hmr6hz11x5z1pf-quickcheck-instances-0.3.32/share/x86_64-linux-ghc-9.12.1-f739/quickcheck-instances-0.3.32
  15135. 436.91 s [quickcheck-instances] Documentation installed in:
  15136. 436.91 s [quickcheck-instances] /nix/store/yvidpx3i492r6gkwwwp0fbr303dgzaff-quickcheck-instances-0.3.32-doc/share/doc/quickcheck-instances-0.3.32
  15137. 436.91 s [quickcheck-instances] Configuration files installed in:
  15138. 436.91 s [quickcheck-instances] /nix/store/1x3phxs3627g6gxws2hmr6hz11x5z1pf-quickcheck-instances-0.3.32/etc
  15139. 436.91 s [quickcheck-instances] No alex found
  15140. 436.91 s [quickcheck-instances] Using ar found on system at:
  15141. 436.91 s [quickcheck-instances] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  15142. 436.91 s [quickcheck-instances] No c2hs found
  15143. 436.91 s [quickcheck-instances] No cpphs found
  15144. 436.91 s [quickcheck-instances] No doctest found
  15145. 436.91 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  15146. 436.91 s [quickcheck-instances] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  15147. 436.91 s [quickcheck-instances] Using ghc version 9.12.1 found on system at:
  15148. 436.91 s [quickcheck-instances] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc
  15149. 436.91 s [quickcheck-instances] Using ghc-pkg version 9.12.1 found on system at:
  15150. 436.91 s [quickcheck-instances] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc-pkg-9.12.1
  15151. 436.91 s [quickcheck-instances] No ghcjs found
  15152. 436.92 s [quickcheck-instances] No ghcjs-pkg found
  15153. 436.92 s [quickcheck-instances] No greencard found
  15154. 436.92 s [quickcheck-instances] Using haddock version 2.30.0 found on system at:
  15155. 436.92 s [quickcheck-instances] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/haddock-ghc-9.12.1
  15156. 436.92 s [quickcheck-instances] No happy found
  15157. 436.92 s [quickcheck-instances] No haskell-suite found
  15158. 436.92 s [quickcheck-instances] No haskell-suite-pkg found
  15159. 436.92 s [quickcheck-instances] No hmake found
  15160. 436.92 s [quickcheck-instances] Using hpc version 0.69 found on system at:
  15161. 436.92 s [quickcheck-instances] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hpc-ghc-9.12.1
  15162. 436.92 s [quickcheck-instances] Using hsc2hs version 0.68.10 found on system at:
  15163. 436.92 s [quickcheck-instances] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
  15164. 436.92 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  15165. 436.92 s [quickcheck-instances] /nix/store/q6qz2x3a08capyv98w52zizgxcnmv4hb-hscolour-1.25/bin/HsColour
  15166. 436.92 s [quickcheck-instances] No jhc found
  15167. 436.92 s [quickcheck-instances] Using ld found on system at:
  15168. 436.92 s [quickcheck-instances] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  15169. 436.92 s [quickcheck-instances] No pkg-config found
  15170. 436.92 s [quickcheck-instances] Using runghc version 9.12.1 found on system at:
  15171. 436.92 s [quickcheck-instances] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/runghc-9.12.1
  15172. 436.92 s [quickcheck-instances] Using strip version 2.44 found on system at:
  15173. 436.92 s [quickcheck-instances] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  15174. 436.92 s [quickcheck-instances] Using tar found on system at:
  15175. 436.92 s [quickcheck-instances] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  15176. 436.92 s [quickcheck-instances] No uhc found
  15177. 437.03 s [quickcheck-instances] Phase: buildPhase
  15178. 437.09 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.32...
  15179. 437.10 s [quickcheck-instances] Building library for quickcheck-instances-0.3.32...
  15180. 437.22 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 )
  15181. 437.27 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 )
  15182. 437.81 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 )
  15183. 437.95 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 )
  15184. 437.95 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 )
  15185. 438.36 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 )
  15186. 438.36 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 )
  15187. 438.36 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 )
  15188. 438.36 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 )
  15189. 438.36 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 )
  15190. 438.36 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 )
  15191. 438.36 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 )
  15192. 438.36 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 )
  15193. 438.36 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 )
  15194. 438.36 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 )
  15195. 438.38 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 )
  15196. 438.38 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 )
  15197. 438.38 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 )
  15198. 438.38 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 )
  15199. 438.38 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 )
  15200. 438.70 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 )
  15201. 438.70 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 )
  15202. 438.70 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 )
  15203. 438.70 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 )
  15204. 438.70 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 )
  15205. 438.70 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 )
  15206. 439.03 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 )
  15207. 439.16 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 )
  15208. 439.17 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 )
  15209. 439.62 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 )
  15210. 439.62 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 )
  15211. 439.90 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 )
  15212. 439.90 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 )
  15213. 439.92 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 )
  15214. 439.92 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 )
  15215. 439.92 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 )
  15216. 439.92 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 )
  15217. 440.01 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 )
  15218. 440.01 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 )
  15219. 440.01 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 )
  15220. 440.01 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 )
  15221. 440.01 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 )
  15222. 440.01 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 )
  15223. 440.01 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 )
  15224. 440.01 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 )
  15225. 440.01 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 )
  15226. 440.25 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 )
  15227. 440.25 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 )
  15228. 440.25 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 )
  15229. 440.25 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 )
  15230. 440.25 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 )
  15231. 440.25 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  15232. 441.92 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.32...
  15233. 441.92 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.32...
  15234. 441.99 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  15235. 442.21 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  15236. 442.84 s [quickcheck-instances] Phase: checkPhase
  15237. 443.13 s [quickcheck-instances] Running 1 test suites...
  15238. 443.13 s [quickcheck-instances] Test suite self-test: RUNNING...
  15239. 443.14 s [quickcheck-instances] +++ OK, passed 100 tests.
  15240. 443.14 s [quickcheck-instances] +++ OK, passed 100 tests.
  15241. 443.14 s [quickcheck-instances] +++ OK, passed 100 tests.
  15242. 443.14 s [quickcheck-instances] +++ OK, passed 100 tests.
  15243. 443.14 s [quickcheck-instances] +++ OK, passed 100 tests.
  15244. 443.14 s [quickcheck-instances] Test suite self-test: PASS
  15245. 443.14 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.32-self-test.log
  15246. 443.14 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  15247. 443.15 s [quickcheck-instances] Phase: haddockPhase
  15248. 443.73 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.32...
  15249. 443.73 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.32...
  15250. 443.74 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  15251. 443.74 s [quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
  15252. 444.06 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing ) [HIE file is missing]
  15253. 444.11 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing ) [HIE file is missing]
  15254. 444.11 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing ) [HIE file is missing]
  15255. 444.24 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing ) [HIE file is missing]
  15256. 444.28 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing ) [HIE file is missing]
  15257. 444.31 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing ) [HIE file is missing]
  15258. 444.33 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing ) [HIE file is missing]
  15259. 444.35 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing ) [HIE file is missing]
  15260. 444.35 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing ) [HIE file is missing]
  15261. 444.45 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing ) [HIE file is missing]
  15262. 444.49 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing ) [HIE file is missing]
  15263. 444.49 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing ) [HIE file is missing]
  15264. 444.50 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing ) [HIE file is missing]
  15265. 444.54 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing ) [HIE file is missing]
  15266. 444.55 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing ) [HIE file is missing]
  15267. 444.61 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing ) [HIE file is missing]
  15268. 444.63 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing ) [HIE file is missing]
  15269. 444.64 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing ) [HIE file is missing]
  15270. 444.65 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing ) [HIE file is missing]
  15271. 444.67 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing ) [HIE file is missing]
  15272. 444.86 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing ) [HIE file is missing]
  15273. 444.92 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing ) [HIE file is missing]
  15274. 444.93 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing ) [HIE file is missing]
  15275. 444.95 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing ) [HIE file is missing]
  15276. 445.01 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing ) [HIE file is missing]
  15277. 445.01 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing ) [HIE file is missing]
  15278. 445.02 s [quickcheck-instances] Haddock coverage:
  15279. 445.02 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  15280. 445.02 s [quickcheck-instances] Missing documentation for:
  15281. 445.02 s [quickcheck-instances] Module header
  15282. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  15283. 445.27 s [quickcheck-instances] Missing documentation for:
  15284. 445.27 s [quickcheck-instances] Module header
  15285. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  15286. 445.27 s [quickcheck-instances] Missing documentation for:
  15287. 445.27 s [quickcheck-instances] Module header
  15288. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  15289. 445.27 s [quickcheck-instances] Missing documentation for:
  15290. 445.27 s [quickcheck-instances] Module header
  15291. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  15292. 445.27 s [quickcheck-instances] Missing documentation for:
  15293. 445.27 s [quickcheck-instances] Module header
  15294. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  15295. 445.27 s [quickcheck-instances] Missing documentation for:
  15296. 445.27 s [quickcheck-instances] Module header
  15297. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  15298. 445.27 s [quickcheck-instances] Missing documentation for:
  15299. 445.27 s [quickcheck-instances] Module header
  15300. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  15301. 445.27 s [quickcheck-instances] Missing documentation for:
  15302. 445.27 s [quickcheck-instances] Module header
  15303. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  15304. 445.27 s [quickcheck-instances] Missing documentation for:
  15305. 445.27 s [quickcheck-instances] Module header
  15306. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  15307. 445.27 s [quickcheck-instances] Missing documentation for:
  15308. 445.27 s [quickcheck-instances] Module header
  15309. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  15310. 445.27 s [quickcheck-instances] Missing documentation for:
  15311. 445.27 s [quickcheck-instances] Module header
  15312. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  15313. 445.27 s [quickcheck-instances] Missing documentation for:
  15314. 445.27 s [quickcheck-instances] Module header
  15315. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  15316. 445.27 s [quickcheck-instances] Missing documentation for:
  15317. 445.27 s [quickcheck-instances] Module header
  15318. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  15319. 445.27 s [quickcheck-instances] Missing documentation for:
  15320. 445.27 s [quickcheck-instances] Module header
  15321. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  15322. 445.27 s [quickcheck-instances] Missing documentation for:
  15323. 445.27 s [quickcheck-instances] Module header
  15324. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  15325. 445.27 s [quickcheck-instances] Missing documentation for:
  15326. 445.27 s [quickcheck-instances] Module header
  15327. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  15328. 445.27 s [quickcheck-instances] Missing documentation for:
  15329. 445.27 s [quickcheck-instances] Module header
  15330. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  15331. 445.27 s [quickcheck-instances] Missing documentation for:
  15332. 445.27 s [quickcheck-instances] Module header
  15333. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  15334. 445.27 s [quickcheck-instances] Missing documentation for:
  15335. 445.27 s [quickcheck-instances] Module header
  15336. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  15337. 445.27 s [quickcheck-instances] Missing documentation for:
  15338. 445.27 s [quickcheck-instances] Module header
  15339. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  15340. 445.27 s [quickcheck-instances] Missing documentation for:
  15341. 445.27 s [quickcheck-instances] Module header
  15342. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  15343. 445.27 s [quickcheck-instances] Missing documentation for:
  15344. 445.27 s [quickcheck-instances] Module header
  15345. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  15346. 445.27 s [quickcheck-instances] Missing documentation for:
  15347. 445.27 s [quickcheck-instances] Module header
  15348. 445.27 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  15349. 445.27 s [quickcheck-instances] Missing documentation for:
  15350. 445.27 s [quickcheck-instances] Module header
  15351. 445.27 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  15352. 445.69 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  15353. 445.69 s [quickcheck-instances] - Data.Vector.Vector
  15354. 445.69 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  15355. 445.69 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  15356. 445.69 s [quickcheck-instances] - Data.Vector.Storable.Vector
  15357. 445.69 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  15358. 451.52 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances,
  15359. 451.55 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  15360. 452.04 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.32...
  15361. 452.10 s [quickcheck-instances] Phase: installPhase
  15362. 452.15 s [quickcheck-instances] Installing library in /nix/store/1x3phxs3627g6gxws2hmr6hz11x5z1pf-quickcheck-instances-0.3.32/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
  15363. 452.59 s [quickcheck-instances] Phase: fixupPhase
  15364. 452.61 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/1x3phxs3627g6gxws2hmr6hz11x5z1pf-quickcheck-instances-0.3.32
  15365. 452.61 s [quickcheck-instances] shrinking /nix/store/1x3phxs3627g6gxws2hmr6hz11x5z1pf-quickcheck-instances-0.3.32/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSquickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx-ghc9.12.1.so
  15366. 452.64 s [quickcheck-instances] checking for references to /build/ in /nix/store/1x3phxs3627g6gxws2hmr6hz11x5z1pf-quickcheck-instances-0.3.32...
  15367. 452.67 s [quickcheck-instances] patching script interpreter paths in /nix/store/1x3phxs3627g6gxws2hmr6hz11x5z1pf-quickcheck-instances-0.3.32
  15368. 452.67 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/1x3phxs3627g6gxws2hmr6hz11x5z1pf-quickcheck-instances-0.3.32/lib
  15369. 452.80 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/yvidpx3i492r6gkwwwp0fbr303dgzaff-quickcheck-instances-0.3.32-doc
  15370. 452.81 s [quickcheck-instances] checking for references to /build/ in /nix/store/yvidpx3i492r6gkwwwp0fbr303dgzaff-quickcheck-instances-0.3.32-doc...
  15371. 452.83 s [quickcheck-instances] patching script interpreter paths in /nix/store/yvidpx3i492r6gkwwwp0fbr303dgzaff-quickcheck-instances-0.3.32-doc
  15372. 452.95 s [quickcheck-instances:post-build] Uploading to cachix cache "sellout": /nix/store/1x3phxs3627g6gxws2hmr6hz11x5z1pf-quickcheck-instances-0.3.32 /nix/store/yvidpx3i492r6gkwwwp0fbr303dgzaff-quickcheck-instances-0.3.32-doc
  15373. 453.47 s [quickcheck-instances:post-build] Pushing 2 paths (128 are already present) using zstd to cache sellout ⏳
  15374. 453.47 s [quickcheck-instances:post-build]
  15375. 453.85 s [quickcheck-instances:post-build] Pushing /nix/store/yvidpx3i492r6gkwwwp0fbr303dgzaff-quickcheck-instances-0.3.32-doc (1.49 MiB)
  15376. 453.92 s [quickcheck-instances:post-build] Pushing /nix/store/1x3phxs3627g6gxws2hmr6hz11x5z1pf-quickcheck-instances-0.3.32 (5.43 MiB)
  15377. 454.90 s [quickcheck-instances:post-build]
  15378. 454.90 s [quickcheck-instances:post-build] All done.
  15379. 454.99 s [quickcheck-instances:post-build] Uploading to the NixCI cache: /nix/store/1x3phxs3627g6gxws2hmr6hz11x5z1pf-quickcheck-instances-0.3.32 /nix/store/yvidpx3i492r6gkwwwp0fbr303dgzaff-quickcheck-instances-0.3.32-doc
  15380. 455.06 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15381. 455.30 s [quickcheck-instances:post-build] copying 30 paths...
  15382. 455.30 s [quickcheck-instances:post-build] copying path '/nix/store/3hxiikv9al61qplkvvizh4f01rgaf1sc-assoc-1.1.1-doc' to 'https://cache.nix-ci.com'...
  15383. 455.30 s [quickcheck-instances:post-build] copying path '/nix/store/4f4nsc2g5g1qr3rf5m62lb7wv1f2dmdn-uuid-types-1.0.6-doc' to 'https://cache.nix-ci.com'...
  15384. 455.30 s [quickcheck-instances:post-build] copying path '/nix/store/g2kjzjz3ga2csbc023nwdfhhxfn8gmkw-time-compat-1.9.8-doc' to 'https://cache.nix-ci.com'...
  15385. 455.30 s [quickcheck-instances:post-build] copying path '/nix/store/mfv9dkd1hvv0yvhin3jx6fz7gl165fym-old-locale-1.0.0.7-doc' to 'https://cache.nix-ci.com'...
  15386. 455.30 s [quickcheck-instances:post-build] copying path '/nix/store/98rkd35mwavkg6lfvq7m72yfrz33bw24-integer-logarithms-1.0.4-doc' to 'https://cache.nix-ci.com'...
  15387. 455.30 s [quickcheck-instances:post-build] copying path '/nix/store/a40yl078mxny761h3r8v8qyyniv4bc0r-OneTuple-0.4.2-doc' to 'https://cache.nix-ci.com'...
  15388. 455.30 s [quickcheck-instances:post-build] copying path '/nix/store/d1khs60gd5lbw9m67bwz4crpq5gs3n56-text-short-0.1.6-doc' to 'https://cache.nix-ci.com'...
  15389. 455.31 s [quickcheck-instances:post-build] copying path '/nix/store/gqx9sdcry0ka6vlfrcs7g4m8abg0mf7d-data-fix-0.3.4-doc' to 'https://cache.nix-ci.com'...
  15390. 455.31 s [quickcheck-instances:post-build] copying path '/nix/store/zljidk8sldhlsm4hx56ibfyqiw9dmh0s-QuickCheck-2.14.3-doc' to 'https://cache.nix-ci.com'...
  15391. 455.31 s [quickcheck-instances:post-build] copying path '/nix/store/pvy1kvc0i799v73cgizykcwr8mcm11b9-case-insensitive-1.2.1.0-doc' to 'https://cache.nix-ci.com'...
  15392. 455.67 s [quickcheck-instances:post-build] copying path '/nix/store/69dp54py8m7cb9yfpfa1l2hypwf4xx3b-old-time-1.1.0.4-doc' to 'https://cache.nix-ci.com'...
  15393. 455.67 s [quickcheck-instances:post-build] copying path '/nix/store/6jch9h3x1k9p4isbjw7mh01yq0qs9crz-old-locale-1.0.0.7' to 'https://cache.nix-ci.com'...
  15394. 455.71 s [quickcheck-instances:post-build] copying path '/nix/store/a844w445hrvi65zy7rk0j2k4nqzjsdnp-OneTuple-0.4.2' to 'https://cache.nix-ci.com'...
  15395. 455.71 s [quickcheck-instances:post-build] copying path '/nix/store/5ikijxf7biy0rpi3vrpp73jq28is0gyv-case-insensitive-1.2.1.0' to 'https://cache.nix-ci.com'...
  15396. 455.71 s [quickcheck-instances:post-build] copying path '/nix/store/yp3sp44a71pr3m4pqizxmxm6fdqjkmp0-data-fix-0.3.4' to 'https://cache.nix-ci.com'...
  15397. 455.74 s [quickcheck-instances:post-build] copying path '/nix/store/ncszvvbmknkxfh8rkyj1l9svxd850gqn-integer-logarithms-1.0.4' to 'https://cache.nix-ci.com'...
  15398. 455.74 s [quickcheck-instances:post-build] copying path '/nix/store/z853j9438f932ipir0zwqlj9383c7qlm-scientific-0.3.8.0-doc' to 'https://cache.nix-ci.com'...
  15399. 455.75 s [quickcheck-instances:post-build] copying path '/nix/store/9a3nxi7mvzi4bq3bdsxm7zc3savyk21f-assoc-1.1.1' to 'https://cache.nix-ci.com'...
  15400. 455.75 s [quickcheck-instances:post-build] copying path '/nix/store/sg5dfw22r3xd45p0jj2xmmx6gbxdigas-these-1.2.1-doc' to 'https://cache.nix-ci.com'...
  15401. 455.78 s [quickcheck-instances:post-build] copying path '/nix/store/m4l4yqmm0mbyzpwyd6rgbcjd2gpikpwm-uuid-types-1.0.6' to 'https://cache.nix-ci.com'...
  15402. 455.88 s [quickcheck-instances:post-build] copying path '/nix/store/kgsimvi0xn1j88pf99d4nrg1bd21h74g-text-short-0.1.6' to 'https://cache.nix-ci.com'...
  15403. 455.96 s [quickcheck-instances:post-build] copying path '/nix/store/2l8239njkkjgqqyqiz96rw3k22w8w482-time-compat-1.9.8' to 'https://cache.nix-ci.com'...
  15404. 456.15 s [quickcheck-instances:post-build] copying path '/nix/store/pj3fdl6hwiscn5isx19p1vc423nvhmcn-old-time-1.1.0.4' to 'https://cache.nix-ci.com'...
  15405. 456.24 s [quickcheck-instances:post-build] copying path '/nix/store/bm1vjc0xi0i6s8p7xs67gvhzrd72rpcp-strict-0.5.1-doc' to 'https://cache.nix-ci.com'...
  15406. 456.25 s [quickcheck-instances:post-build] copying path '/nix/store/ai933wp9lwi3n5py5wlxfjli3gj6bgv2-these-1.2.1' to 'https://cache.nix-ci.com'...
  15407. 456.38 s [quickcheck-instances:post-build] copying path '/nix/store/hcxpwmv4fh9v5f0sn3l4724h4pm7pcbq-scientific-0.3.8.0' to 'https://cache.nix-ci.com'...
  15408. 456.92 s [quickcheck-instances:post-build] copying path '/nix/store/jjsx05jb5plgdqcz21ck0q0vdzigmr84-QuickCheck-2.14.3' to 'https://cache.nix-ci.com'...
  15409. 457.44 s [quickcheck-instances:post-build] copying path '/nix/store/yvidpx3i492r6gkwwwp0fbr303dgzaff-quickcheck-instances-0.3.32-doc' to 'https://cache.nix-ci.com'...
  15410. 459.11 s [quickcheck-instances:post-build] copying path '/nix/store/khkp4izpdn7zbhqsb9nda9dlhl2dbsf3-strict-0.5.1' to 'https://cache.nix-ci.com'...
  15411. 465.40 s [quickcheck-instances:post-build] copying path '/nix/store/1x3phxs3627g6gxws2hmr6hz11x5z1pf-quickcheck-instances-0.3.32' to 'https://cache.nix-ci.com'...
  15412. 467.64 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15413. 468.06 s [quickcheck-instances:post-build] copying 16 paths...
  15414. 468.07 s [quickcheck-instances:post-build] copying path '/nix/store/8n94d6lnql3cgh4q8gqy8p1h1bcm4qn3-old-time-1.1.0.4.drv' to 'https://cache.nix-ci.com'...
  15415. 468.07 s [quickcheck-instances:post-build] copying path '/nix/store/vdlcnynrlnxbq68dyrnm6ndln0r23gm7-OneTuple-0.4.2.drv' to 'https://cache.nix-ci.com'...
  15416. 468.07 s [quickcheck-instances:post-build] copying path '/nix/store/jz9ic0pmiw1891z6gq2ifbsy8p9lkv9n-uuid-types-1.0.6.drv' to 'https://cache.nix-ci.com'...
  15417. 468.07 s [quickcheck-instances:post-build] copying path '/nix/store/99jamq968q6yyay3dsai05k2igc024vv-logict-0.8.2.0.drv' to 'https://cache.nix-ci.com'...
  15418. 468.07 s [quickcheck-instances:post-build] copying path '/nix/store/jdp74pz4953pmajh1945r1p979yl01qv-data-fix-0.3.4.drv' to 'https://cache.nix-ci.com'...
  15419. 468.07 s [quickcheck-instances:post-build] copying path '/nix/store/gyqnzb6sjp1arp7aczs2z83b3v2rvr1i-text-short-0.1.6.drv' to 'https://cache.nix-ci.com'...
  15420. 468.07 s [quickcheck-instances:post-build] copying path '/nix/store/al1in77jg55lvsnsbcadhsjrhyql5lsz-case-insensitive-1.2.1.0.drv' to 'https://cache.nix-ci.com'...
  15421. 468.07 s [quickcheck-instances:post-build] copying path '/nix/store/abp3cdgx63f0w2fvr5nms272sgj8i08h-time-compat-1.9.8.drv' to 'https://cache.nix-ci.com'...
  15422. 468.08 s [quickcheck-instances:post-build] copying path '/nix/store/pdy4nb8hnpsqsl463d2nlk8d9ad0ifbr-assoc-1.1.1.drv' to 'https://cache.nix-ci.com'...
  15423. 468.37 s [quickcheck-instances:post-build] copying path '/nix/store/8npafc38afjksnw9w4rwcb4sxadflhfk-smallcheck-1.2.1.1.drv' to 'https://cache.nix-ci.com'...
  15424. 468.38 s [quickcheck-instances:post-build] copying path '/nix/store/bhmv0hnpasfg5yhr01214adwghqbfi60-these-1.2.1.drv' to 'https://cache.nix-ci.com'...
  15425. 468.60 s [quickcheck-instances:post-build] copying path '/nix/store/8qn1bcp3g50dvd8grhm0y2nk6p0xrq9s-tasty-smallcheck-0.8.2.drv' to 'https://cache.nix-ci.com'...
  15426. 468.61 s [quickcheck-instances:post-build] copying path '/nix/store/zlbg8j9hbba3z7cz5s0b0wff1lnr3kbb-strict-0.5.1.drv' to 'https://cache.nix-ci.com'...
  15427. 468.84 s [quickcheck-instances:post-build] copying path '/nix/store/c7g3dv8gcd6lb1a91p32dhs9h2ps784x-integer-logarithms-1.0.4.drv' to 'https://cache.nix-ci.com'...
  15428. 469.69 s [quickcheck-instances:post-build] copying path '/nix/store/12m0986mzhzqxy9cfkyr5fbw60kjs6f5-scientific-0.3.8.0.drv' to 'https://cache.nix-ci.com'...
  15429. 469.92 s [quickcheck-instances:post-build] copying path '/nix/store/64wvpr5l98zqx896sqy10dh2a6hc9l5j-quickcheck-instances-0.3.32.drv' to 'https://cache.nix-ci.com'...
  15430. 470.17 s Progress: 7 of 14 built, 145 of 145 downloaded from cache
  15431. 470.21 s Building /nix/store/ynxk5naxzl6140kszbkqw048ddk0ah8m-extra-1.8.drv
  15432. 470.37 s [extra] Phase: setupCompilerEnvironmentPhase
  15433. 470.37 s [extra] Build with /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1.
  15434. 470.58 s [extra] Phase: unpackPhase
  15435. 470.59 s [extra] unpacking source archive /nix/store/djwymlbaqpzn2y2l24hzjxn7wfn797lb-extra-1.8.tar.gz
  15436. 470.63 s [extra] source root is extra-1.8
  15437. 470.63 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8/test/TestUtil.hs"
  15438. 470.63 s [extra] Phase: patchPhase
  15439. 470.63 s [extra] Phase: compileBuildDriverPhase
  15440. 470.63 s [extra] setupCompileFlags: -package-db=/build/tmp.OdXDW0fKA0/setup-package.conf.d -threaded
  15441. 470.69 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.OdXDW0fKA0/Main.o )
  15442. 470.74 s [extra] [2 of 2] Linking Setup
  15443. 472.33 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  15444. 472.34 s [extra] Phase: configurePhase
  15445. 472.35 s [extra] configureFlags: --verbose --prefix=/nix/store/sqycaz5ccqfg14vfjyj6r1cp53zdkrg2-extra-1.8 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/n0xyban5iq2s4bpbwcm6s222c1nvw1y3-extra-1.8-doc/share/doc/extra-1.8 --with-gcc=gcc --package-db=/build/tmp.OdXDW0fKA0/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
  15446. 472.36 s [extra] Using Parsec parser
  15447. 472.36 s [extra] Configuring extra-1.8...
  15448. 472.39 s [extra] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  15449. 472.39 s [extra] 'ghc' version < 9.12):
  15450. 472.39 s [extra] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc is version
  15451. 472.39 s [extra] 9.12.1
  15452. 473.02 s [extra] Dependency base >=4.9 && <5: using base-4.21.0.0
  15453. 473.02 s [extra] Dependency clock >=0.7: using clock-0.8.4
  15454. 473.02 s [extra] Dependency directory: using directory-1.3.9.0
  15455. 473.02 s [extra] Dependency filepath: using filepath-1.5.4.0
  15456. 473.02 s [extra] Dependency process: using process-1.6.25.0
  15457. 473.02 s [extra] Dependency time: using time-1.14
  15458. 473.02 s [extra] Dependency unix: using unix-2.8.6.0
  15459. 473.02 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.14.3
  15460. 473.02 s [extra] Dependency base >=4 && <5: using base-4.21.0.0
  15461. 473.02 s [extra] Dependency directory: using directory-1.3.9.0
  15462. 473.02 s [extra] Dependency extra: using extra-1.8
  15463. 473.02 s [extra] Dependency filepath: using filepath-1.5.4.0
  15464. 473.02 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.32
  15465. 473.02 s [extra] Dependency unix: using unix-2.8.6.0
  15466. 473.02 s [extra] Source component graph:
  15467. 473.02 s [extra] component lib
  15468. 473.02 s [extra] component test:extra-test dependency lib
  15469. 473.02 s [extra] Configured component graph:
  15470. 473.02 s [extra] component extra-1.8-GxUfFMQp4R7HmYwoSoVuga
  15471. 473.02 s [extra] include base-4.21.0.0-f068
  15472. 473.02 s [extra] include clock-0.8.4-Anpw0cdR7mRADMTnlDMyXN
  15473. 473.02 s [extra] include directory-1.3.9.0-9eff
  15474. 473.02 s [extra] include filepath-1.5.4.0-7ce6
  15475. 473.02 s [extra] include process-1.6.25.0-4623
  15476. 473.02 s [extra] include time-1.14-f7a8
  15477. 473.02 s [extra] include unix-2.8.6.0-6369
  15478. 473.02 s [extra] component extra-1.8-L5li7mcIG4uIAGoQVyko2B-extra-test
  15479. 473.02 s [extra] include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  15480. 473.02 s [extra] include base-4.21.0.0-f068
  15481. 473.02 s [extra] include directory-1.3.9.0-9eff
  15482. 473.02 s [extra] include extra-1.8-GxUfFMQp4R7HmYwoSoVuga
  15483. 473.02 s [extra] include filepath-1.5.4.0-7ce6
  15484. 473.02 s [extra] include quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
  15485. 473.02 s [extra] include unix-2.8.6.0-6369
  15486. 473.02 s [extra] Linked component graph:
  15487. 473.02 s [extra] unit extra-1.8-GxUfFMQp4R7HmYwoSoVuga
  15488. 473.02 s [extra] include base-4.21.0.0-f068
  15489. 473.02 s [extra] include clock-0.8.4-Anpw0cdR7mRADMTnlDMyXN
  15490. 473.02 s [extra] include directory-1.3.9.0-9eff
  15491. 473.02 s [extra] include filepath-1.5.4.0-7ce6
  15492. 473.02 s [extra] include process-1.6.25.0-4623
  15493. 473.02 s [extra] include time-1.14-f7a8
  15494. 473.02 s [extra] include unix-2.8.6.0-6369
  15495. 473.02 s [extra] Control.Concurrent.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Control.Exception.Extra,Control.Monad.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Control.Monad.Extra,Data.Either.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Data.Either.Extra,Data.Foldable.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Data.IORef.Extra,Data.List.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Data.Typeable.Extra,Data.Version.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Data.Version.Extra,Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Extra,Numeric.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Numeric.Extra,System.Directory.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:System.Directory.Extra,System.Environment.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:System.Environment.Extra,System.IO.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:System.IO.Extra,System.Info.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:System.Info.Extra,System.Process.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:System.Process.Extra,System.Time.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:System.Time.Extra,Text.Read.Extra=extra-1.8-GxUfFMQp4R7HmYwoSoVuga:Text.Read.Extra
  15496. 473.02 s [extra] unit extra-1.8-L5li7mcIG4uIAGoQVyko2B-extra-test
  15497. 473.02 s [extra] include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  15498. 473.02 s [extra] include base-4.21.0.0-f068
  15499. 473.02 s [extra] include directory-1.3.9.0-9eff
  15500. 473.02 s [extra] include extra-1.8-GxUfFMQp4R7HmYwoSoVuga
  15501. 473.02 s [extra] include filepath-1.5.4.0-7ce6
  15502. 473.02 s [extra] include quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
  15503. 473.02 s [extra] include unix-2.8.6.0-6369
  15504. 473.02 s [extra] Ready component graph:
  15505. 473.02 s [extra] definite extra-1.8-GxUfFMQp4R7HmYwoSoVuga
  15506. 473.02 s [extra] depends base-4.21.0.0-f068
  15507. 473.02 s [extra] depends clock-0.8.4-Anpw0cdR7mRADMTnlDMyXN
  15508. 473.02 s [extra] depends directory-1.3.9.0-9eff
  15509. 473.02 s [extra] depends filepath-1.5.4.0-7ce6
  15510. 473.02 s [extra] depends process-1.6.25.0-4623
  15511. 473.02 s [extra] depends time-1.14-f7a8
  15512. 473.02 s [extra] depends unix-2.8.6.0-6369
  15513. 473.02 s [extra] definite extra-1.8-L5li7mcIG4uIAGoQVyko2B-extra-test
  15514. 473.02 s [extra] depends QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  15515. 473.02 s [extra] depends base-4.21.0.0-f068
  15516. 473.02 s [extra] depends directory-1.3.9.0-9eff
  15517. 473.02 s [extra] depends extra-1.8-GxUfFMQp4R7HmYwoSoVuga
  15518. 473.02 s [extra] depends filepath-1.5.4.0-7ce6
  15519. 473.02 s [extra] depends quickcheck-instances-0.3.32-1Rvlks8mvPJ595Q937YiXx
  15520. 473.02 s [extra] depends unix-2.8.6.0-6369
  15521. 473.02 s [extra] Using Cabal-3.14.1.0 compiled by ghc-9.12
  15522. 473.02 s [extra] Using compiler: ghc-9.12.1
  15523. 473.02 s [extra] Using install prefix: /nix/store/sqycaz5ccqfg14vfjyj6r1cp53zdkrg2-extra-1.8
  15524. 473.02 s [extra] Executables installed in:
  15525. 473.02 s [extra] /nix/store/sqycaz5ccqfg14vfjyj6r1cp53zdkrg2-extra-1.8/bin
  15526. 473.02 s [extra] Libraries installed in:
  15527. 473.02 s [extra] /nix/store/sqycaz5ccqfg14vfjyj6r1cp53zdkrg2-extra-1.8/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/extra-1.8-GxUfFMQp4R7HmYwoSoVuga
  15528. 473.02 s [extra] Dynamic Libraries installed in:
  15529. 473.02 s [extra] /nix/store/sqycaz5ccqfg14vfjyj6r1cp53zdkrg2-extra-1.8/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
  15530. 473.02 s [extra] Private executables installed in:
  15531. 473.02 s [extra] /nix/store/sqycaz5ccqfg14vfjyj6r1cp53zdkrg2-extra-1.8/libexec/x86_64-linux-ghc-9.12.1-f739/extra-1.8
  15532. 473.02 s [extra] Data files installed in:
  15533. 473.02 s [extra] /nix/store/sqycaz5ccqfg14vfjyj6r1cp53zdkrg2-extra-1.8/share/x86_64-linux-ghc-9.12.1-f739/extra-1.8
  15534. 473.02 s [extra] Documentation installed in:
  15535. 473.02 s [extra] /nix/store/n0xyban5iq2s4bpbwcm6s222c1nvw1y3-extra-1.8-doc/share/doc/extra-1.8
  15536. 473.02 s [extra] Configuration files installed in:
  15537. 473.02 s [extra] /nix/store/sqycaz5ccqfg14vfjyj6r1cp53zdkrg2-extra-1.8/etc
  15538. 473.02 s [extra] No alex found
  15539. 473.02 s [extra] Using ar found on system at:
  15540. 473.02 s [extra] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  15541. 473.02 s [extra] No c2hs found
  15542. 473.02 s [extra] No cpphs found
  15543. 473.02 s [extra] No doctest found
  15544. 473.02 s [extra] Using gcc version 14.3.0 given by user at:
  15545. 473.02 s [extra] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  15546. 473.02 s [extra] Using ghc version 9.12.1 found on system at:
  15547. 473.02 s [extra] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc
  15548. 473.02 s [extra] Using ghc-pkg version 9.12.1 found on system at:
  15549. 473.02 s [extra] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc-pkg-9.12.1
  15550. 473.02 s [extra] No ghcjs found
  15551. 473.02 s [extra] No ghcjs-pkg found
  15552. 473.02 s [extra] No greencard found
  15553. 473.02 s [extra] Using haddock version 2.30.0 found on system at:
  15554. 473.02 s [extra] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/haddock-ghc-9.12.1
  15555. 473.02 s [extra] No happy found
  15556. 473.02 s [extra] No haskell-suite found
  15557. 473.02 s [extra] No haskell-suite-pkg found
  15558. 473.02 s [extra] No hmake found
  15559. 473.02 s [extra] Using hpc version 0.69 found on system at:
  15560. 473.02 s [extra] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hpc-ghc-9.12.1
  15561. 473.02 s [extra] Using hsc2hs version 0.68.10 found on system at:
  15562. 473.02 s [extra] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
  15563. 473.02 s [extra] Using hscolour version 1.25 found on system at:
  15564. 473.02 s [extra] /nix/store/q6qz2x3a08capyv98w52zizgxcnmv4hb-hscolour-1.25/bin/HsColour
  15565. 473.02 s [extra] No jhc found
  15566. 473.02 s [extra] Using ld found on system at:
  15567. 473.02 s [extra] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  15568. 473.02 s [extra] No pkg-config found
  15569. 473.02 s [extra] Using runghc version 9.12.1 found on system at:
  15570. 473.02 s [extra] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/runghc-9.12.1
  15571. 473.02 s [extra] Using strip version 2.44 found on system at:
  15572. 473.02 s [extra] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  15573. 473.02 s [extra] Using tar found on system at:
  15574. 473.02 s [extra] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  15575. 473.02 s [extra] No uhc found
  15576. 473.17 s [extra] Phase: buildPhase
  15577. 473.23 s [extra] Preprocessing library for extra-1.8...
  15578. 473.25 s [extra] Building library for extra-1.8...
  15579. 473.54 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 )
  15580. 473.75 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 )
  15581. 473.75 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 )
  15582. 473.77 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 )
  15583. 473.77 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  15584. 473.77 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  15585. 473.77 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 )
  15586. 474.81 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 )
  15587. 474.92 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 )
  15588. 475.02 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 )
  15589. 475.02 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 )
  15590. 475.02 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 )
  15591. 475.25 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 )
  15592. 475.34 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 )
  15593. 475.67 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 )
  15594. 475.76 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 )
  15595. 475.76 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 )
  15596. 475.88 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 )
  15597. 475.88 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 )
  15598. 475.94 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 )
  15599. 475.94 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  15600. 476.03 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 )
  15601. 476.63 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  15602. 477.06 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  15603. 477.10 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  15604. 477.10 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  15605. 477.10 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  15606. 477.10 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  15607. 477.10 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  15608. 478.23 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  15609. 478.37 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  15610. 478.49 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  15611. 478.49 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  15612. 478.49 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  15613. 478.74 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  15614. 478.91 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  15615. 479.06 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  15616. 479.06 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  15617. 479.06 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  15618. 479.46 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  15619. 479.46 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  15620. 479.61 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  15621. 479.61 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  15622. 479.75 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  15623. 480.88 s [extra] Preprocessing test suite 'extra-test' for extra-1.8...
  15624. 480.88 s [extra] Building test suite 'extra-test' for extra-1.8...
  15625. 480.95 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  15626. 481.30 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  15627. 485.55 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  15628. 485.55 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  15629. 485.98 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  15630. 486.78 s [extra] Phase: checkPhase
  15631. 487.08 s [extra] Running 1 test suites...
  15632. 487.09 s [extra] Test suite extra-test: RUNNING...
  15633. 487.09 s [extra] withTempFile
  15634. 487.09 s [extra] +++ OK, passed 1 test.
  15635. 487.09 s [extra] captureOutput
  15636. 487.09 s [extra] +++ OK, passed 1 test.
  15637. 487.09 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  15638. 487.12 s [extra] +++ OK, passed 100 tests.
  15639. 487.12 s [extra] \(x :: IO Int) -> join (once x) == x
  15640. 487.15 s [extra] +++ OK, passed 100 tests.
  15641. 487.15 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  15642. 487.18 s [extra] +++ OK, passed 100 tests.
  15643. 487.18 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  15644. 487.22 s [extra] +++ OK, passed 100 tests.
  15645. 487.22 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  15646. 487.25 s [extra] +++ OK, passed 100 tests.
  15647. 487.25 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  15648. 487.28 s [extra] +++ OK, passed 100 tests.
  15649. 487.28 s [extra] stringException "test" == pure "test"
  15650. 487.28 s [extra] +++ OK, passed 1 test.
  15651. 487.28 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  15652. 487.29 s [extra] +++ OK, passed 1 test.
  15653. 487.29 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  15654. 487.29 s [extra] +++ OK, passed 1 test.
  15655. 487.29 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  15656. 487.29 s [extra] +++ OK, passed 1 test.
  15657. 487.29 s [extra] ignore (print 1) == print 1
  15658. 487.29 s [extra] +++ OK, passed 1 test.
  15659. 487.29 s [extra] ignore (fail "die") == pure ()
  15660. 487.29 s [extra] +++ OK, passed 1 test.
  15661. 487.29 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  15662. 487.29 s [extra] +++ OK, passed 1 test.
  15663. 487.29 s [extra] seq (errorIO "foo") (print 1) == print 1
  15664. 487.29 s [extra] +++ OK, passed 1 test.
  15665. 487.29 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  15666. 487.29 s [extra] +++ OK, passed 1 test.
  15667. 487.29 s [extra] seq (assertIO False) (print 1) == print 1
  15668. 487.29 s [extra] +++ OK, passed 1 test.
  15669. 487.29 s [extra] retry 1 (print "x") == print "x"
  15670. 487.29 s [extra] +++ OK, passed 1 test.
  15671. 487.29 s [extra] retry 3 (fail "die") == fail "die"
  15672. 487.29 s [extra] +++ OK, passed 1 test.
  15673. 487.29 s [extra] whenJust Nothing print == pure ()
  15674. 487.29 s [extra] +++ OK, passed 1 test.
  15675. 487.29 s [extra] whenJust (Just 1) print == print 1
  15676. 487.29 s [extra] +++ OK, passed 1 test.
  15677. 487.29 s [extra] pureIf @Maybe True 5 == Just 5
  15678. 487.29 s [extra] +++ OK, passed 1 test.
  15679. 487.29 s [extra] pureIf @Maybe False 5 == Nothing
  15680. 487.29 s [extra] +++ OK, passed 1 test.
  15681. 487.29 s [extra] pureIf @[] True 5 == [5]
  15682. 487.29 s [extra] +++ OK, passed 1 test.
  15683. 487.29 s [extra] pureIf @[] False 5 == []
  15684. 487.29 s [extra] +++ OK, passed 1 test.
  15685. 487.29 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  15686. 487.29 s [extra] +++ OK, passed 1 test.
  15687. 487.29 s [extra] whenMaybe False (print 1) == pure Nothing
  15688. 487.29 s [extra] +++ OK, passed 1 test.
  15689. 487.29 s [extra] \(x :: Maybe ()) -> unit x == x
  15690. 487.29 s [extra] +++ OK, passed 100 tests.
  15691. 487.29 s [extra] guarded even 2 == [2]
  15692. 487.29 s [extra] +++ OK, passed 1 test.
  15693. 487.29 s [extra] guarded odd 2 == Nothing
  15694. 487.29 s [extra] +++ OK, passed 1 test.
  15695. 487.29 s [extra] guarded (not.null) "My Name" == Just "My Name"
  15696. 487.29 s [extra] +++ OK, passed 1 test.
  15697. 487.29 s [extra] guardedA (return . even) 42 == Just [42]
  15698. 487.29 s [extra] +++ OK, passed 1 test.
  15699. 487.29 s [extra] guardedA (return . odd) 42 == Just []
  15700. 487.29 s [extra] +++ OK, passed 1 test.
  15701. 487.29 s [extra] guardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
  15702. 487.29 s [extra] +++ OK, passed 1 test.
  15703. 487.29 s [extra] fold1M (\x y -> Just x) [] == undefined
  15704. 487.29 s [extra] +++ OK, passed 1 test.
  15705. 487.29 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  15706. 487.29 s [extra] +++ OK, passed 1 test.
  15707. 487.29 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  15708. 487.29 s [extra] +++ OK, passed 1 test.
  15709. 487.29 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  15710. 487.29 s [extra] +++ OK, passed 1 test.
  15711. 487.29 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  15712. 487.29 s [extra] +++ OK, passed 1 test.
  15713. 487.29 s [extra] Just True ||^ undefined == Just True
  15714. 487.29 s [extra] +++ OK, passed 1 test.
  15715. 487.29 s [extra] Just False ||^ Just True == Just True
  15716. 487.29 s [extra] +++ OK, passed 1 test.
  15717. 487.29 s [extra] Just False ||^ Just False == Just False
  15718. 487.29 s [extra] +++ OK, passed 1 test.
  15719. 487.29 s [extra] Just False &&^ undefined == Just False
  15720. 487.29 s [extra] +++ OK, passed 1 test.
  15721. 487.29 s [extra] Just True &&^ Just True == Just True
  15722. 487.29 s [extra] +++ OK, passed 1 test.
  15723. 487.29 s [extra] Just True &&^ Just False == Just False
  15724. 487.29 s [extra] +++ OK, passed 1 test.
  15725. 487.29 s [extra] anyM Just [False,True ,undefined] == Just True
  15726. 487.29 s [extra] +++ OK, passed 1 test.
  15727. 487.29 s [extra] anyM Just [False,False,undefined] == undefined
  15728. 487.29 s [extra] +++ OK, passed 1 test.
  15729. 487.29 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  15730. 487.29 s [extra] +++ OK, passed 100 tests.
  15731. 487.30 s [extra] allM Just [True,False,undefined] == Just False
  15732. 487.30 s [extra] +++ OK, passed 1 test.
  15733. 487.30 s [extra] allM Just [True,True ,undefined] == undefined
  15734. 487.30 s [extra] +++ OK, passed 1 test.
  15735. 487.30 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  15736. 487.30 s [extra] +++ OK, passed 100 tests.
  15737. 487.30 s [extra] orM [Just False,Just True ,undefined] == Just True
  15738. 487.30 s [extra] +++ OK, passed 1 test.
  15739. 487.30 s [extra] orM [Just False,Just False,undefined] == undefined
  15740. 487.30 s [extra] +++ OK, passed 1 test.
  15741. 487.30 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  15742. 487.30 s [extra] +++ OK, passed 100 tests.
  15743. 487.30 s [extra] andM [Just True,Just False,undefined] == Just False
  15744. 487.30 s [extra] +++ OK, passed 1 test.
  15745. 487.30 s [extra] andM [Just True,Just True ,undefined] == undefined
  15746. 487.30 s [extra] +++ OK, passed 1 test.
  15747. 487.30 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  15748. 487.30 s [extra] +++ OK, passed 100 tests.
  15749. 487.30 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  15750. 487.30 s [extra] +++ OK, passed 1 test.
  15751. 487.30 s [extra] findM (Just . isUpper) "test" == Just Nothing
  15752. 487.30 s [extra] +++ OK, passed 1 test.
  15753. 487.30 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  15754. 487.30 s [extra] +++ OK, passed 1 test.
  15755. 487.30 s [extra] fromLeft 1 (Left 3) == 3
  15756. 487.30 s [extra] +++ OK, passed 1 test.
  15757. 487.30 s [extra] fromLeft 1 (Right "foo") == 1
  15758. 487.30 s [extra] +++ OK, passed 1 test.
  15759. 487.30 s [extra] fromRight 1 (Right 3) == 3
  15760. 487.30 s [extra] +++ OK, passed 1 test.
  15761. 487.30 s [extra] fromRight 1 (Left "foo") == 1
  15762. 487.30 s [extra] +++ OK, passed 1 test.
  15763. 487.30 s [extra] \x -> fromLeft' (Left x) == x
  15764. 487.30 s [extra] +++ OK, passed 100 tests.
  15765. 487.30 s [extra] \x -> fromLeft' (Right x) == undefined
  15766. 487.30 s [extra] +++ OK, passed 100 tests.
  15767. 487.30 s [extra] \x -> fromRight' (Right x) == x
  15768. 487.30 s [extra] +++ OK, passed 100 tests.
  15769. 487.30 s [extra] \x -> fromRight' (Left x) == undefined
  15770. 487.30 s [extra] +++ OK, passed 100 tests.
  15771. 487.30 s [extra] \x -> fromEither (Left x ) == x
  15772. 487.30 s [extra] +++ OK, passed 100 tests.
  15773. 487.30 s [extra] \x -> fromEither (Right x) == x
  15774. 487.30 s [extra] +++ OK, passed 100 tests.
  15775. 487.30 s [extra] \a b -> maybeToEither a (Just b) == Right b
  15776. 487.30 s [extra] +++ OK, passed 100 tests.
  15777. 487.30 s [extra] \a -> maybeToEither a Nothing == Left a
  15778. 487.30 s [extra] +++ OK, passed 100 tests.
  15779. 487.30 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  15780. 487.30 s [extra] +++ OK, passed 100 tests.
  15781. 487.30 s [extra] \x -> eitherToMaybe (Right x) == Just x
  15782. 487.30 s [extra] +++ OK, passed 100 tests.
  15783. 487.30 s [extra] mapLeft show (Left 1) == Left "1"
  15784. 487.30 s [extra] +++ OK, passed 1 test.
  15785. 487.30 s [extra] mapLeft show (Right True) == Right True
  15786. 487.30 s [extra] +++ OK, passed 1 test.
  15787. 487.30 s [extra] mapRight show (Left 1) == Left 1
  15788. 487.30 s [extra] +++ OK, passed 1 test.
  15789. 487.30 s [extra] mapRight show (Right True) == Right "True"
  15790. 487.30 s [extra] +++ OK, passed 1 test.
  15791. 487.30 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  15792. 487.31 s [extra] +++ OK, passed 100 tests.
  15793. 487.31 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  15794. 487.31 s [extra] +++ OK, passed 100 tests.
  15795. 487.31 s [extra] \xs -> repeatedly line1 xs == lines xs
  15796. 487.31 s [extra] +++ OK, passed 100 tests.
  15797. 487.31 s [extra] disjoint [1,2,3] [4,5] == True
  15798. 487.31 s [extra] +++ OK, passed 1 test.
  15799. 487.31 s [extra] disjoint [1,2,3] [4,1] == False
  15800. 487.31 s [extra] +++ OK, passed 1 test.
  15801. 487.31 s [extra] disjointOrd [1,2,3] [4,5] == True
  15802. 487.31 s [extra] +++ OK, passed 1 test.
  15803. 487.31 s [extra] disjointOrd [1,2,3] [4,1] == False
  15804. 487.31 s [extra] +++ OK, passed 1 test.
  15805. 487.31 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  15806. 487.31 s [extra] +++ OK, passed 1 test.
  15807. 487.31 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  15808. 487.31 s [extra] +++ OK, passed 1 test.
  15809. 487.31 s [extra] anySame [1,1,2] == True
  15810. 487.31 s [extra] +++ OK, passed 1 test.
  15811. 487.31 s [extra] anySame [1,2,3] == False
  15812. 487.31 s [extra] +++ OK, passed 1 test.
  15813. 487.31 s [extra] anySame (1:2:1:undefined) == True
  15814. 487.31 s [extra] +++ OK, passed 1 test.
  15815. 487.31 s [extra] anySame [] == False
  15816. 487.31 s [extra] +++ OK, passed 1 test.
  15817. 487.31 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  15818. 487.31 s [extra] +++ OK, passed 100 tests.
  15819. 487.31 s [extra] allSame [1,1,2] == False
  15820. 487.31 s [extra] +++ OK, passed 1 test.
  15821. 487.31 s [extra] allSame [1,1,1] == True
  15822. 487.31 s [extra] +++ OK, passed 1 test.
  15823. 487.31 s [extra] allSame [1] == True
  15824. 487.31 s [extra] +++ OK, passed 1 test.
  15825. 487.31 s [extra] allSame [] == True
  15826. 487.31 s [extra] +++ OK, passed 1 test.
  15827. 487.31 s [extra] allSame (1:1:2:undefined) == False
  15828. 487.31 s [extra] +++ OK, passed 1 test.
  15829. 487.31 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  15830. 487.31 s [extra] +++ OK, passed 100 tests.
  15831. 487.31 s [extra] headDef 1 [] == 1
  15832. 487.31 s [extra] +++ OK, passed 1 test.
  15833. 487.31 s [extra] headDef 1 [2,3,4] == 2
  15834. 487.31 s [extra] +++ OK, passed 1 test.
  15835. 487.31 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  15836. 487.32 s [extra] +++ OK, passed 100 tests.
  15837. 487.32 s [extra] lastDef 1 [] == 1
  15838. 487.32 s [extra] +++ OK, passed 1 test.
  15839. 487.32 s [extra] lastDef 1 [2,3,4] == 4
  15840. 487.32 s [extra] +++ OK, passed 1 test.
  15841. 487.32 s [extra] \x xs -> lastDef x xs == last (x:xs)
  15842. 487.32 s [extra] +++ OK, passed 100 tests.
  15843. 487.32 s [extra] [2,3,4] !? 1 == Just 3
  15844. 487.32 s [extra] +++ OK, passed 1 test.
  15845. 487.32 s [extra] [2,3,4] !? (-1) == Nothing
  15846. 487.32 s [extra] +++ OK, passed 1 test.
  15847. 487.32 s [extra] [] !? 0 == Nothing
  15848. 487.32 s [extra] +++ OK, passed 1 test.
  15849. 487.32 s [extra] notNull [] == False
  15850. 487.32 s [extra] +++ OK, passed 1 test.
  15851. 487.32 s [extra] notNull [1] == True
  15852. 487.32 s [extra] +++ OK, passed 1 test.
  15853. 487.32 s [extra] \xs -> notNull xs == not (null xs)
  15854. 487.32 s [extra] +++ OK, passed 100 tests.
  15855. 487.32 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  15856. 487.32 s [extra] +++ OK, passed 1 test.
  15857. 487.32 s [extra] list 1 (\v _ -> v - 2) [] == 1
  15858. 487.32 s [extra] +++ OK, passed 1 test.
  15859. 487.32 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  15860. 487.32 s [extra] +++ OK, passed 100 tests.
  15861. 487.32 s [extra] unsnoc "test" == Just ("tes",'t')
  15862. 487.32 s [extra] +++ OK, passed 1 test.
  15863. 487.32 s [extra] unsnoc "" == Nothing
  15864. 487.32 s [extra] +++ OK, passed 1 test.
  15865. 487.32 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  15866. 487.32 s [extra] +++ OK, passed 100 tests.
  15867. 487.32 s [extra] cons 't' "est" == "test"
  15868. 487.32 s [extra] +++ OK, passed 1 test.
  15869. 487.32 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  15870. 487.32 s [extra] +++ OK, passed 100 tests.
  15871. 487.32 s [extra] snoc "tes" 't' == "test"
  15872. 487.32 s [extra] +++ OK, passed 1 test.
  15873. 487.32 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  15874. 487.32 s [extra] +++ OK, passed 100 tests.
  15875. 487.32 s [extra] enumerate == [False, True]
  15876. 487.32 s [extra] +++ OK, passed 1 test.
  15877. 487.32 s [extra] takeEnd 3 "hello" == "llo"
  15878. 487.32 s [extra] +++ OK, passed 1 test.
  15879. 487.32 s [extra] takeEnd 5 "bye" == "bye"
  15880. 487.32 s [extra] +++ OK, passed 1 test.
  15881. 487.32 s [extra] takeEnd (-1) "bye" == ""
  15882. 487.32 s [extra] +++ OK, passed 1 test.
  15883. 487.32 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  15884. 487.32 s [extra] +++ OK, passed 100 tests.
  15885. 487.32 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  15886. 487.32 s [extra] +++ OK, passed 100 tests.
  15887. 487.32 s [extra] dropEnd 3 "hello" == "he"
  15888. 487.32 s [extra] +++ OK, passed 1 test.
  15889. 487.32 s [extra] dropEnd 5 "bye" == ""
  15890. 487.32 s [extra] +++ OK, passed 1 test.
  15891. 487.32 s [extra] dropEnd (-1) "bye" == "bye"
  15892. 487.32 s [extra] +++ OK, passed 1 test.
  15893. 487.32 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  15894. 487.32 s [extra] +++ OK, passed 100 tests.
  15895. 487.32 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  15896. 487.32 s [extra] +++ OK, passed 100 tests.
  15897. 487.32 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  15898. 487.32 s [extra] +++ OK, passed 100 tests.
  15899. 487.32 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  15900. 487.32 s [extra] +++ OK, passed 1 test.
  15901. 487.32 s [extra] splitAtEnd 3 "he" == ("", "he")
  15902. 487.32 s [extra] +++ OK, passed 1 test.
  15903. 487.32 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  15904. 487.32 s [extra] +++ OK, passed 100 tests.
  15905. 487.32 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  15906. 487.32 s [extra] +++ OK, passed 100 tests.
  15907. 487.32 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  15908. 487.32 s [extra] +++ OK, passed 100 tests.
  15909. 487.32 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  15910. 487.32 s [extra] +++ OK, passed 1 test.
  15911. 487.32 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  15912. 487.32 s [extra] +++ OK, passed 100 tests.
  15913. 487.32 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  15914. 487.32 s [extra] +++ OK, passed 1 test.
  15915. 487.32 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  15916. 487.32 s [extra] +++ OK, passed 1 test.
  15917. 487.32 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  15918. 487.32 s [extra] +++ OK, passed 1 test.
  15919. 487.32 s [extra] trim " hello " == "hello"
  15920. 487.32 s [extra] +++ OK, passed 1 test.
  15921. 487.33 s [extra] trimStart " hello " == "hello "
  15922. 487.33 s [extra] +++ OK, passed 1 test.
  15923. 487.33 s [extra] trimEnd " hello " == " hello"
  15924. 487.33 s [extra] +++ OK, passed 1 test.
  15925. 487.33 s [extra] \s -> trim s == trimEnd (trimStart s)
  15926. 487.33 s [extra] +++ OK, passed 100 tests.
  15927. 487.33 s [extra] lower "This is A TEST" == "this is a test"
  15928. 487.33 s [extra] +++ OK, passed 1 test.
  15929. 487.33 s [extra] lower "" == ""
  15930. 487.33 s [extra] +++ OK, passed 1 test.
  15931. 487.33 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  15932. 487.33 s [extra] +++ OK, passed 1 test.
  15933. 487.33 s [extra] upper "" == ""
  15934. 487.33 s [extra] +++ OK, passed 1 test.
  15935. 487.33 s [extra] word1 "" == ("", "")
  15936. 487.33 s [extra] +++ OK, passed 1 test.
  15937. 487.33 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  15938. 487.33 s [extra] +++ OK, passed 1 test.
  15939. 487.33 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  15940. 487.33 s [extra] +++ OK, passed 1 test.
  15941. 487.33 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  15942. 487.33 s [extra] +++ OK, passed 100 tests.
  15943. 487.33 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  15944. 487.33 s [extra] +++ OK, passed 100 tests.
  15945. 487.33 s [extra] line1 "" == ("", "")
  15946. 487.33 s [extra] +++ OK, passed 1 test.
  15947. 487.33 s [extra] line1 "test" == ("test","")
  15948. 487.33 s [extra] +++ OK, passed 1 test.
  15949. 487.33 s [extra] line1 "test\n" == ("test","")
  15950. 487.33 s [extra] +++ OK, passed 1 test.
  15951. 487.33 s [extra] line1 "test\nrest" == ("test","rest")
  15952. 487.33 s [extra] +++ OK, passed 1 test.
  15953. 487.33 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  15954. 487.33 s [extra] +++ OK, passed 1 test.
  15955. 487.33 s [extra] escapeHTML "this is a test" == "this is a test"
  15956. 487.33 s [extra] +++ OK, passed 1 test.
  15957. 487.33 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  15958. 487.33 s [extra] +++ OK, passed 1 test.
  15959. 487.33 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  15960. 487.33 s [extra] +++ OK, passed 1 test.
  15961. 487.33 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  15962. 487.33 s [extra] +++ OK, passed 100 tests.
  15963. 487.33 s [extra] escapeJSON "this is a test" == "this is a test"
  15964. 487.33 s [extra] +++ OK, passed 1 test.
  15965. 487.33 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  15966. 487.33 s [extra] +++ OK, passed 1 test.
  15967. 487.33 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  15968. 487.33 s [extra] +++ OK, passed 1 test.
  15969. 487.33 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  15970. 487.33 s [extra] +++ OK, passed 100 tests.
  15971. 487.33 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  15972. 487.33 s [extra] +++ OK, passed 1 test.
  15973. 487.33 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  15974. 487.33 s [extra] +++ OK, passed 1 test.
  15975. 487.33 s [extra] maximumOn id [] == undefined
  15976. 487.33 s [extra] +++ OK, passed 1 test.
  15977. 487.33 s [extra] maximumOn length ["test","extra","a"] == "extra"
  15978. 487.33 s [extra] +++ OK, passed 1 test.
  15979. 487.33 s [extra] minimumOn id [] == undefined
  15980. 487.33 s [extra] +++ OK, passed 1 test.
  15981. 487.33 s [extra] minimumOn length ["test","extra","a"] == "a"
  15982. 487.33 s [extra] +++ OK, passed 1 test.
  15983. 487.33 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  15984. 487.33 s [extra] +++ OK, passed 1 test.
  15985. 487.33 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  15986. 487.33 s [extra] +++ OK, passed 100 tests.
  15987. 487.33 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  15988. 487.34 s [extra] +++ OK, passed 100 tests.
  15989. 487.34 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  15990. 487.34 s [extra] +++ OK, passed 1 test.
  15991. 487.34 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  15992. 487.34 s [extra] +++ OK, passed 1 test.
  15993. 487.34 s [extra] sum' [1, 2, 3] == 6
  15994. 487.34 s [extra] +++ OK, passed 1 test.
  15995. 487.34 s [extra] sumOn' read ["1", "2", "3"] == 6
  15996. 487.34 s [extra] +++ OK, passed 1 test.
  15997. 487.34 s [extra] product' [1, 2, 4] == 8
  15998. 487.34 s [extra] +++ OK, passed 1 test.
  15999. 487.34 s [extra] productOn' read ["1", "2", "4"] == 8
  16000. 487.34 s [extra] +++ OK, passed 1 test.
  16001. 487.34 s [extra] merge "ace" "bd" == "abcde"
  16002. 487.34 s [extra] +++ OK, passed 1 test.
  16003. 487.34 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  16004. 487.34 s [extra] +++ OK, passed 100 tests.
  16005. 487.34 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  16006. 487.34 s [extra] +++ OK, passed 1 test.
  16007. 487.34 s [extra] replace "el" "e" "Hello" == "Helo"
  16008. 487.34 s [extra] +++ OK, passed 1 test.
  16009. 487.34 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  16010. 487.34 s [extra] +++ OK, passed 1 test.
  16011. 487.34 s [extra] replace "" "x" "" == "x"
  16012. 487.34 s [extra] +++ OK, passed 1 test.
  16013. 487.34 s [extra] \xs ys -> replace xs xs ys == ys
  16014. 487.34 s [extra] +++ OK, passed 100 tests.
  16015. 487.34 s [extra] breakEnd isLower "youRE" == ("you","RE")
  16016. 487.34 s [extra] +++ OK, passed 1 test.
  16017. 487.34 s [extra] breakEnd isLower "youre" == ("youre","")
  16018. 487.34 s [extra] +++ OK, passed 1 test.
  16019. 487.34 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  16020. 487.34 s [extra] +++ OK, passed 1 test.
  16021. 487.34 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  16022. 487.34 s [extra] +++ OK, passed 100 tests.
  16023. 487.34 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  16024. 487.34 s [extra] +++ OK, passed 1 test.
  16025. 487.34 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  16026. 487.34 s [extra] +++ OK, passed 1 test.
  16027. 487.34 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  16028. 487.34 s [extra] +++ OK, passed 100 tests.
  16029. 487.34 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  16030. 487.35 s [extra] +++ OK, passed 100 tests.
  16031. 487.35 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  16032. 487.35 s [extra] +++ OK, passed 1 test.
  16033. 487.35 s [extra] \s -> wordsBy isSpace s == words s
  16034. 487.35 s [extra] +++ OK, passed 100 tests.
  16035. 487.35 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  16036. 487.35 s [extra] +++ OK, passed 1 test.
  16037. 487.35 s [extra] \s -> linesBy (== '\n') s == lines s
  16038. 487.35 s [extra] +++ OK, passed 100 tests.
  16039. 487.35 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  16040. 487.35 s [extra] +++ OK, passed 1 test.
  16041. 487.35 s [extra] firstJust id [Nothing,Just 3] == Just 3
  16042. 487.35 s [extra] +++ OK, passed 1 test.
  16043. 487.35 s [extra] firstJust id [Nothing,Nothing] == Nothing
  16044. 487.35 s [extra] +++ OK, passed 1 test.
  16045. 487.35 s [extra] drop1 "" == ""
  16046. 487.35 s [extra] +++ OK, passed 1 test.
  16047. 487.35 s [extra] drop1 "test" == "est"
  16048. 487.35 s [extra] +++ OK, passed 1 test.
  16049. 487.35 s [extra] \xs -> drop 1 xs == drop1 xs
  16050. 487.35 s [extra] +++ OK, passed 100 tests.
  16051. 487.35 s [extra] dropEnd1 "" == ""
  16052. 487.35 s [extra] +++ OK, passed 1 test.
  16053. 487.35 s [extra] dropEnd1 "test" == "tes"
  16054. 487.35 s [extra] +++ OK, passed 1 test.
  16055. 487.35 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  16056. 487.35 s [extra] +++ OK, passed 100 tests.
  16057. 487.35 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  16058. 487.35 s [extra] +++ OK, passed 1 test.
  16059. 487.35 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  16060. 487.37 s [extra] +++ OK, passed 100 tests.
  16061. 487.37 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  16062. 487.37 s [extra] +++ OK, passed 1 test.
  16063. 487.37 s [extra] breakOn "/" "foobar" == ("foobar", "")
  16064. 487.37 s [extra] +++ OK, passed 1 test.
  16065. 487.37 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  16066. 487.37 s [extra] +++ OK, passed 100 tests.
  16067. 487.37 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  16068. 487.37 s [extra] +++ OK, passed 1 test.
  16069. 487.37 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  16070. 487.37 s [extra] +++ OK, passed 1 test.
  16071. 487.37 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  16072. 487.37 s [extra] +++ OK, passed 1 test.
  16073. 487.37 s [extra] splitOn "x" "x" == ["",""]
  16074. 487.37 s [extra] +++ OK, passed 1 test.
  16075. 487.37 s [extra] splitOn "x" "" == [""]
  16076. 487.37 s [extra] +++ OK, passed 1 test.
  16077. 487.37 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  16078. 487.38 s [extra] +++ OK, passed 100 tests; 18 discarded.
  16079. 487.38 s [extra] \c x -> splitOn [c] x == split (==c) x
  16080. 487.38 s [extra] +++ OK, passed 100 tests.
  16081. 487.38 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  16082. 487.38 s [extra] +++ OK, passed 1 test.
  16083. 487.38 s [extra] split (== 'a') "" == [""]
  16084. 487.38 s [extra] +++ OK, passed 1 test.
  16085. 487.38 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  16086. 487.38 s [extra] +++ OK, passed 1 test.
  16087. 487.38 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  16088. 487.38 s [extra] +++ OK, passed 1 test.
  16089. 487.38 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  16090. 487.38 s [extra] +++ OK, passed 1 test.
  16091. 487.38 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  16092. 487.38 s [extra] +++ OK, passed 1 test.
  16093. 487.38 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  16094. 487.38 s [extra] +++ OK, passed 1 test.
  16095. 487.38 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  16096. 487.38 s [extra] +++ OK, passed 1 test.
  16097. 487.38 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  16098. 487.38 s [extra] +++ OK, passed 1 test.
  16099. 487.38 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  16100. 487.38 s [extra] +++ OK, passed 1 test.
  16101. 487.38 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  16102. 487.38 s [extra] +++ OK, passed 1 test.
  16103. 487.38 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  16104. 487.38 s [extra] +++ OK, passed 1 test.
  16105. 487.38 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  16106. 487.38 s [extra] +++ OK, passed 1 test.
  16107. 487.38 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  16108. 487.38 s [extra] +++ OK, passed 1 test.
  16109. 487.38 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  16110. 487.38 s [extra] +++ OK, passed 1 test.
  16111. 487.38 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  16112. 487.38 s [extra] +++ OK, passed 1 test.
  16113. 487.38 s [extra] stripSuffix "" "baz" == Just "baz"
  16114. 487.38 s [extra] +++ OK, passed 1 test.
  16115. 487.38 s [extra] stripSuffix "foo" "quux" == Nothing
  16116. 487.38 s [extra] +++ OK, passed 1 test.
  16117. 487.38 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  16118. 487.38 s [extra] +++ OK, passed 1 test.
  16119. 487.38 s [extra] stripInfix "/" "foobar" == Nothing
  16120. 487.38 s [extra] +++ OK, passed 1 test.
  16121. 487.38 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  16122. 487.38 s [extra] +++ OK, passed 1 test.
  16123. 487.38 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  16124. 487.38 s [extra] +++ OK, passed 1 test.
  16125. 487.38 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  16126. 487.38 s [extra] +++ OK, passed 1 test.
  16127. 487.38 s [extra] chunksOf 8 "" == []
  16128. 487.38 s [extra] +++ OK, passed 1 test.
  16129. 487.38 s [extra] chunksOf 0 "test" == undefined
  16130. 487.38 s [extra] +++ OK, passed 1 test.
  16131. 487.38 s [extra] nubSort "this is a test" == " aehist"
  16132. 487.38 s [extra] +++ OK, passed 1 test.
  16133. 487.38 s [extra] \xs -> nubSort xs == nub (sort xs)
  16134. 487.38 s [extra] +++ OK, passed 100 tests.
  16135. 487.38 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  16136. 487.38 s [extra] +++ OK, passed 1 test.
  16137. 487.38 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  16138. 487.38 s [extra] +++ OK, passed 1 test.
  16139. 487.38 s [extra] nubOrd "this is a test" == "this ae"
  16140. 487.38 s [extra] +++ OK, passed 1 test.
  16141. 487.38 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  16142. 487.38 s [extra] +++ OK, passed 1 test.
  16143. 487.38 s [extra] \xs -> nubOrd xs == nub xs
  16144. 487.38 s [extra] +++ OK, passed 100 tests.
  16145. 487.38 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  16146. 487.38 s [extra] +++ OK, passed 1 test.
  16147. 487.38 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  16148. 487.38 s [extra] +++ OK, passed 1 test.
  16149. 487.38 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  16150. 487.38 s [extra] +++ OK, passed 1 test.
  16151. 487.39 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  16152. 487.39 s [extra] +++ OK, passed 1 test.
  16153. 487.39 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  16154. 487.39 s [extra] +++ OK, passed 1 test.
  16155. 487.39 s [extra] comparingLength [1,2,3] [False] == GT
  16156. 487.39 s [extra] +++ OK, passed 1 test.
  16157. 487.39 s [extra] comparingLength [1,2] "ab" == EQ
  16158. 487.39 s [extra] +++ OK, passed 1 test.
  16159. 487.39 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  16160. 487.39 s [extra] +++ OK, passed 100 tests.
  16161. 487.39 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  16162. 487.39 s [extra] +++ OK, passed 1 test.
  16163. 487.39 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  16164. 487.39 s [extra] +++ OK, passed 1 test.
  16165. 487.39 s [extra] mwhen True "test" == "test"
  16166. 487.39 s [extra] +++ OK, passed 1 test.
  16167. 487.39 s [extra] mwhen False "test" == ""
  16168. 487.39 s [extra] +++ OK, passed 1 test.
  16169. 487.39 s [extra] first succ (1,"test") == (2,"test")
  16170. 487.39 s [extra] +++ OK, passed 1 test.
  16171. 487.39 s [extra] second reverse (1,"test") == (1,"tset")
  16172. 487.39 s [extra] +++ OK, passed 1 test.
  16173. 487.39 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  16174. 487.39 s [extra] +++ OK, passed 1 test.
  16175. 487.39 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  16176. 487.39 s [extra] +++ OK, passed 1 test.
  16177. 487.39 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  16178. 487.39 s [extra] +++ OK, passed 1 test.
  16179. 487.39 s [extra] (succ &&& pred) 1 == (2,0)
  16180. 487.39 s [extra] +++ OK, passed 1 test.
  16181. 487.39 s [extra] dupe 12 == (12, 12)
  16182. 487.39 s [extra] +++ OK, passed 1 test.
  16183. 487.39 s [extra] both succ (1,2) == (2,3)
  16184. 487.39 s [extra] +++ OK, passed 1 test.
  16185. 487.39 s [extra] first3 succ (1,1,1) == (2,1,1)
  16186. 487.39 s [extra] +++ OK, passed 1 test.
  16187. 487.39 s [extra] second3 succ (1,1,1) == (1,2,1)
  16188. 487.39 s [extra] +++ OK, passed 1 test.
  16189. 487.39 s [extra] third3 succ (1,1,1) == (1,1,2)
  16190. 487.39 s [extra] +++ OK, passed 1 test.
  16191. 487.39 s [extra] \x -> readVersion (showVersion x) == x
  16192. 487.39 s [extra] +++ OK, passed 100 tests.
  16193. 487.39 s [extra] readVersion "hello" == undefined
  16194. 487.39 s [extra] +++ OK, passed 1 test.
  16195. 487.39 s [extra] showDP 4 pi == "3.1416"
  16196. 487.39 s [extra] +++ OK, passed 1 test.
  16197. 487.39 s [extra] showDP 0 pi == "3"
  16198. 487.39 s [extra] +++ OK, passed 1 test.
  16199. 487.39 s [extra] showDP 2 3 == "3.00"
  16200. 487.39 s [extra] +++ OK, passed 1 test.
  16201. 487.39 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  16202. 487.39 s [extra] +++ OK, passed 1 test.
  16203. 487.39 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  16204. 487.39 s [extra] +++ OK, passed 1 test.
  16205. 487.39 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  16206. 487.39 s [extra] +++ OK, passed 1 test.
  16207. 487.39 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  16208. 487.39 s [extra] +++ OK, passed 1 test.
  16209. 487.39 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  16210. 487.39 s [extra] +++ OK, passed 1 test.
  16211. 487.39 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  16212. 487.39 s [extra] +++ OK, passed 1 test.
  16213. 487.39 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  16214. 487.39 s [extra] +++ OK, passed 1 test.
  16215. 487.39 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  16216. 487.39 s [extra] +++ OK, passed 1 test.
  16217. 487.39 s [extra] isWindows == (os == "mingw32")
  16218. 487.39 s [extra] +++ OK, passed 1 test.
  16219. 487.39 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  16220. 487.42 s [extra] +++ OK, passed 100 tests.
  16221. 487.42 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  16222. 487.45 s [extra] +++ OK, passed 100 tests.
  16223. 487.45 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  16224. 487.47 s [extra] +++ OK, passed 100 tests.
  16225. 487.47 s [extra] captureOutput (print 1) == pure ("1\n",())
  16226. 487.47 s [extra] +++ OK, passed 1 test.
  16227. 487.47 s [extra] withTempFile doesFileExist == pure True
  16228. 487.47 s [extra] +++ OK, passed 1 test.
  16229. 487.47 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  16230. 487.47 s [extra] +++ OK, passed 1 test.
  16231. 487.47 s [extra] withTempFile readFile' == pure ""
  16232. 487.47 s [extra] +++ OK, passed 1 test.
  16233. 487.47 s [extra] withTempDir doesDirectoryExist == pure True
  16234. 487.47 s [extra] +++ OK, passed 1 test.
  16235. 487.47 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  16236. 487.47 s [extra] +++ OK, passed 1 test.
  16237. 487.47 s [extra] withTempDir listFiles == pure []
  16238. 487.47 s [extra] +++ OK, passed 1 test.
  16239. 487.47 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  16240. 487.47 s [extra] +++ OK, passed 1 test.
  16241. 487.47 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  16242. 487.47 s [extra] +++ OK, passed 1 test.
  16243. 487.47 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  16244. 487.47 s [extra] +++ OK, passed 1 test.
  16245. 487.47 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  16246. 487.47 s [extra] +++ OK, passed 1 test.
  16247. 487.47 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  16248. 487.47 s [extra] +++ OK, passed 1 test.
  16249. 487.47 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  16250. 487.47 s [extra] +++ OK, passed 1 test.
  16251. 487.47 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  16252. 488.47 s [extra] +++ OK, passed 1 test.
  16253. 488.47 s [extra] timeout (-3) (print 1) == pure Nothing
  16254. 488.47 s [extra] +++ OK, passed 1 test.
  16255. 488.47 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  16256. 488.48 s [extra] +++ OK, passed 1 test.
  16257. 488.48 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  16258. 488.58 s [extra] 0.10081943600000001
  16259. 488.58 s [extra] +++ OK, passed 1 test.
  16260. 488.58 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  16261. 488.68 s [extra] +++ OK, passed 1 test.
  16262. 488.68 s [extra] showDuration 3.435 == "3.44s"
  16263. 488.68 s [extra] +++ OK, passed 1 test.
  16264. 488.68 s [extra] showDuration 623.8 == "10m24s"
  16265. 488.68 s [extra] +++ OK, passed 1 test.
  16266. 488.68 s [extra] showDuration 62003.8 == "17h13m"
  16267. 488.68 s [extra] +++ OK, passed 1 test.
  16268. 488.68 s [extra] showDuration 1e8 == "27777h47m"
  16269. 488.68 s [extra] +++ OK, passed 1 test.
  16270. 488.68 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  16271. 488.68 s [extra] +++ OK, passed 1 test.
  16272. 488.68 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  16273. 489.68 s [extra] +++ OK, passed 1 test.
  16274. 489.68 s [extra] Extra export
  16275. 489.68 s [extra] +++ OK, passed 1 test.
  16276. 489.68 s [extra] withTempFile
  16277. 489.69 s [extra] ....done
  16278. 489.69 s [extra] withTempDir
  16279. 489.71 s [extra] ....done
  16280. 489.71 s [extra] retry
  16281. 489.71 s [extra] +++ OK, passed 1 test.
  16282. 489.71 s [extra] barrier
  16283. 489.71 s [extra] Success (325 tests)
  16284. 489.74 s [extra] Test suite extra-test: PASS
  16285. 489.74 s [extra] Test suite logged to: dist/test/extra-1.8-extra-test.log
  16286. 489.74 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  16287. 489.75 s [extra] Phase: haddockPhase
  16288. 490.20 s [extra] Preprocessing library for extra-1.8...
  16289. 490.20 s [extra] Running Haddock on library for extra-1.8...
  16290. 490.64 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing ) [HIE file is missing]
  16291. 490.67 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing ) [HIE file is missing]
  16292. 490.68 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing ) [HIE file is missing]
  16293. 490.72 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing ) [HIE file is missing]
  16294. 490.73 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, nothing ) [HIE file is missing]
  16295. 490.75 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, nothing ) [HIE file is missing]
  16296. 490.75 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, nothing ) [HIE file is missing]
  16297. 491.01 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing ) [HIE file is missing]
  16298. 491.18 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing ) [HIE file is missing]
  16299. 491.18 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing ) [HIE file is missing]
  16300. 491.18 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing ) [HIE file is missing]
  16301. 491.18 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing ) [HIE file is missing]
  16302. 491.21 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing ) [HIE file is missing]
  16303. 491.23 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing ) [HIE file is missing]
  16304. 491.26 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing ) [HIE file is missing]
  16305. 491.30 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing ) [HIE file is missing]
  16306. 491.30 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, nothing ) [HIE file is missing]
  16307. 491.44 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing ) [HIE file is missing]
  16308. 491.45 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing ) [HIE file is missing]
  16309. 491.46 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing ) [HIE file is missing]
  16310. 491.48 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, nothing ) [HIE file is missing]
  16311. 491.56 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, nothing ) [HIE file is missing]
  16312. 491.57 s [extra] Haddock coverage:
  16313. 491.72 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  16314. 491.72 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  16315. 491.73 s [extra] Warning: 'Arrow' is out of scope.
  16316. 491.73 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16317. 491.73 s [extra] 100% ( 28 / 28) in 'Data.Tuple.Extra'
  16318. 491.73 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  16319. 491.73 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  16320. 491.73 s [extra] Warning: 'unzip' is ambiguous. It is defined
  16321. 491.73 s [extra] * in ‘GHC.Internal.Data.Functor’
  16322. 491.73 s [extra] * in ‘GHC.Internal.List’
  16323. 491.73 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16324. 491.73 s [extra] by specifying the type/value namespace explicitly.
  16325. 491.73 s [extra] Defaulting to the one defined in ‘GHC.Internal.List’
  16326. 491.73 s [extra] Warning: '(:)' is out of scope.
  16327. 491.73 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16328. 491.73 s [extra] Warning: 'firstJustM' is out of scope.
  16329. 491.73 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16330. 491.74 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  16331. 491.74 s [extra] Warning: 'Version' is ambiguous. It is defined
  16332. 491.74 s [extra] * in ‘GHC.Internal.Data.Version’
  16333. 491.74 s [extra] * in ‘GHC.Internal.Data.Version’
  16334. 491.74 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16335. 491.74 s [extra] by specifying the type/value namespace explicitly.
  16336. 491.74 s [extra] Defaulting to the one defined in ‘GHC.Internal.Data.Version’
  16337. 491.74 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  16338. 491.74 s [extra] 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
  16339. 491.74 s [extra] Warning: 'fromJust' is out of scope.
  16340. 491.74 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16341. 491.74 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  16342. 491.74 s [extra] Warning: 'AssertionFailed' is ambiguous. It is defined
  16343. 491.74 s [extra] * in ‘GHC.Internal.IO.Exception’
  16344. 491.74 s [extra] * in ‘GHC.Internal.IO.Exception’
  16345. 491.74 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16346. 491.74 s [extra] by specifying the type/value namespace explicitly.
  16347. 491.74 s [extra] Defaulting to the one defined in ‘GHC.Internal.IO.Exception’
  16348. 491.74 s [extra] Warning: 'SomeException' is ambiguous. It is defined
  16349. 491.74 s [extra] * in ‘GHC.Internal.Exception.Type’
  16350. 491.74 s [extra] * in ‘GHC.Internal.Exception.Type’
  16351. 491.74 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16352. 491.74 s [extra] by specifying the type/value namespace explicitly.
  16353. 491.74 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
  16354. 491.74 s [extra] Warning: 'ErrorCall' is ambiguous. It is defined
  16355. 491.74 s [extra] * in ‘GHC.Internal.Exception’
  16356. 491.74 s [extra] * in ‘GHC.Internal.Exception’
  16357. 491.74 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16358. 491.74 s [extra] by specifying the type/value namespace explicitly.
  16359. 491.74 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception’
  16360. 491.74 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  16361. 491.75 s [extra] Warning: 'find' is out of scope.
  16362. 491.75 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16363. 491.75 s [extra] Warning: 'mconcatMap' is out of scope.
  16364. 491.75 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16365. 491.75 s [extra] Warning: 'partition' is out of scope.
  16366. 491.75 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  16367. 491.75 s [extra] 100% ( 40 / 40) in 'Control.Monad.Extra'
  16368. 491.75 s [extra] 92% ( 13 / 14) in 'Data.Foldable.Extra'
  16369. 491.75 s [extra] Missing documentation for:
  16370. 491.75 s [extra] Module header
  16371. 491.75 s [extra] Warning: 'Lock' is ambiguous. It is defined
  16372. 491.75 s [extra] * at src/Control/Concurrent/Extra.hs:106:16
  16373. 491.75 s [extra] * at src/Control/Concurrent/Extra.hs:106:1
  16374. 491.75 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16375. 491.75 s [extra] by specifying the type/value namespace explicitly.
  16376. 491.75 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
  16377. 491.75 s [extra] Warning: 'Var' is ambiguous. It is defined
  16378. 491.75 s [extra] * at src/Control/Concurrent/Extra.hs:146:17
  16379. 491.75 s [extra] * at src/Control/Concurrent/Extra.hs:146:1
  16380. 491.75 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16381. 491.75 s [extra] by specifying the type/value namespace explicitly.
  16382. 491.75 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
  16383. 491.75 s [extra] Warning: 'Barrier' is ambiguous. It is defined
  16384. 491.75 s [extra] * at src/Control/Concurrent/Extra.hs:210:21
  16385. 491.75 s [extra] * at src/Control/Concurrent/Extra.hs:210:1
  16386. 491.75 s [extra] You may be able to disambiguate the identifier by qualifying it or
  16387. 491.75 s [extra] by specifying the type/value namespace explicitly.
  16388. 491.75 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
  16389. 491.75 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  16390. 491.76 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  16391. 491.76 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  16392. 491.76 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  16393. 491.76 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  16394. 491.76 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  16395. 491.76 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  16396. 491.77 s [extra] 100% (270 /270) in 'Extra'
  16397. 491.77 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  16398. 491.96 s [extra] Warning: Data.Tuple.Extra: could not find link destinations for:
  16399. 491.96 s [extra] - GHC.Internal.Generics.Rep1_Solo
  16400. 491.96 s [extra] - GHC.Internal.Generics.Rep_Solo
  16401. 497.41 s [extra] Documentation created: dist/doc/html/extra, dist/doc/html/extra/extra.txt
  16402. 497.87 s [extra] Preprocessing test suite 'extra-test' for extra-1.8...
  16403. 497.92 s [extra] Phase: installPhase
  16404. 498.00 s [extra] Installing library in /nix/store/sqycaz5ccqfg14vfjyj6r1cp53zdkrg2-extra-1.8/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/extra-1.8-GxUfFMQp4R7HmYwoSoVuga
  16405. 498.52 s [extra] Phase: fixupPhase
  16406. 498.54 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/sqycaz5ccqfg14vfjyj6r1cp53zdkrg2-extra-1.8
  16407. 498.56 s [extra] shrinking /nix/store/sqycaz5ccqfg14vfjyj6r1cp53zdkrg2-extra-1.8/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSextra-1.8-GxUfFMQp4R7HmYwoSoVuga-ghc9.12.1.so
  16408. 498.56 s [extra] checking for references to /build/ in /nix/store/sqycaz5ccqfg14vfjyj6r1cp53zdkrg2-extra-1.8...
  16409. 498.59 s [extra] patching script interpreter paths in /nix/store/sqycaz5ccqfg14vfjyj6r1cp53zdkrg2-extra-1.8
  16410. 498.59 s [extra] stripping (with command strip and flags -S -p) in /nix/store/sqycaz5ccqfg14vfjyj6r1cp53zdkrg2-extra-1.8/lib
  16411. 498.72 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/n0xyban5iq2s4bpbwcm6s222c1nvw1y3-extra-1.8-doc
  16412. 498.74 s [extra] checking for references to /build/ in /nix/store/n0xyban5iq2s4bpbwcm6s222c1nvw1y3-extra-1.8-doc...
  16413. 498.76 s [extra] patching script interpreter paths in /nix/store/n0xyban5iq2s4bpbwcm6s222c1nvw1y3-extra-1.8-doc
  16414. 498.91 s [extra:post-build] Uploading to cachix cache "sellout": /nix/store/n0xyban5iq2s4bpbwcm6s222c1nvw1y3-extra-1.8-doc /nix/store/sqycaz5ccqfg14vfjyj6r1cp53zdkrg2-extra-1.8
  16415. 499.46 s [extra:post-build] Pushing 2 paths (68 are already present) using zstd to cache sellout ⏳
  16416. 499.46 s [extra:post-build]
  16417. 499.82 s [extra:post-build] Pushing /nix/store/n0xyban5iq2s4bpbwcm6s222c1nvw1y3-extra-1.8-doc (3.07 MiB)
  16418. 499.89 s [extra:post-build] Pushing /nix/store/sqycaz5ccqfg14vfjyj6r1cp53zdkrg2-extra-1.8 (4.45 MiB)
  16419. 500.93 s [extra:post-build]
  16420. 500.93 s [extra:post-build] All done.
  16421. 500.95 s [extra:post-build] Uploading to the NixCI cache: /nix/store/n0xyban5iq2s4bpbwcm6s222c1nvw1y3-extra-1.8-doc /nix/store/sqycaz5ccqfg14vfjyj6r1cp53zdkrg2-extra-1.8
  16422. 501.00 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16423. 501.26 s [extra:post-build] copying 4 paths...
  16424. 501.26 s [extra:post-build] copying path '/nix/store/cs5vi97hqs4dm2cngldgcnf88gz88h1d-clock-0.8.4-doc' to 'https://cache.nix-ci.com'...
  16425. 501.62 s [extra:post-build] copying path '/nix/store/n0xyban5iq2s4bpbwcm6s222c1nvw1y3-extra-1.8-doc' to 'https://cache.nix-ci.com'...
  16426. 501.62 s [extra:post-build] copying path '/nix/store/b9r2jfd82j9rppg6q30xsjmgyyg6vx1s-clock-0.8.4' to 'https://cache.nix-ci.com'...
  16427. 502.33 s [extra:post-build] copying path '/nix/store/sqycaz5ccqfg14vfjyj6r1cp53zdkrg2-extra-1.8' to 'https://cache.nix-ci.com'...
  16428. 503.78 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  16429. 504.04 s [extra:post-build] copying 2 paths...
  16430. 504.08 s [extra:post-build] copying path '/nix/store/ff13srvsxk26dpyx628vyphvh26vzdl8-clock-0.8.4.drv' to 'https://cache.nix-ci.com'...
  16431. 504.27 s [extra:post-build] copying path '/nix/store/ynxk5naxzl6140kszbkqw048ddk0ah8m-extra-1.8.drv' to 'https://cache.nix-ci.com'...
  16432. 504.52 s Progress: 8 of 14 built, 145 of 145 downloaded from cache
  16433. 504.55 s Building /nix/store/kvcg0i6hscdsp3k91crm7j0b125q987x-algebraic-graphs-0.7.drv
  16434. 504.64 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  16435. 504.65 s [algebraic-graphs] Build with /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1.
  16436. 504.80 s [algebraic-graphs] Phase: unpackPhase
  16437. 504.81 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  16438. 504.82 s [algebraic-graphs] source root is algebraic-graphs-0.7
  16439. 504.82 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  16440. 504.83 s [algebraic-graphs] Phase: patchPhase
  16441. 504.83 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  16442. 504.84 s [algebraic-graphs] Phase: compileBuildDriverPhase
  16443. 504.84 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.lNz7iO4P0Z/setup-package.conf.d -threaded
  16444. 504.90 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.lNz7iO4P0Z/Main.o )
  16445. 504.95 s [algebraic-graphs] [2 of 2] Linking Setup
  16446. 506.33 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  16447. 506.34 s [algebraic-graphs] Phase: configurePhase
  16448. 506.35 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/zwi1ml033xyrj6h60hxfvgwcsfkcz4sa-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.lNz7iO4P0Z/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/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/lib
  16449. 506.36 s [algebraic-graphs] Using Parsec parser
  16450. 506.36 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  16451. 506.39 s [algebraic-graphs] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  16452. 506.39 s [algebraic-graphs] 'ghc' version < 9.12):
  16453. 506.39 s [algebraic-graphs] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc is version
  16454. 506.39 s [algebraic-graphs] 9.12.1
  16455. 506.87 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  16456. 506.87 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.21.0.0
  16457. 506.87 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  16458. 506.87 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
  16459. 506.87 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.2
  16460. 506.87 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.14.3
  16461. 506.87 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  16462. 506.87 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  16463. 506.87 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.21.0.0
  16464. 506.87 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  16465. 506.87 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
  16466. 506.87 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8
  16467. 506.87 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.6: using
  16468. 506.87 s [algebraic-graphs] inspection-testing-0.5.0.3
  16469. 506.87 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.2
  16470. 506.87 s [algebraic-graphs] Source component graph:
  16471. 506.87 s [algebraic-graphs] component lib
  16472. 506.87 s [algebraic-graphs] component test:main dependency lib
  16473. 506.87 s [algebraic-graphs] Configured component graph:
  16474. 506.87 s [algebraic-graphs] component algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  16475. 506.87 s [algebraic-graphs] include array-0.5.8.0-038b
  16476. 506.87 s [algebraic-graphs] include base-4.21.0.0-f068
  16477. 506.87 s [algebraic-graphs] include containers-0.7-647d
  16478. 506.87 s [algebraic-graphs] include deepseq-1.5.1.0-b096
  16479. 506.87 s [algebraic-graphs] include transformers-0.6.1.2-199f
  16480. 506.87 s [algebraic-graphs] component algebraic-graphs-0.7-DUC0aIJJUCuCUbRi0dGT91-main
  16481. 506.87 s [algebraic-graphs] include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  16482. 506.87 s [algebraic-graphs] include algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  16483. 506.87 s [algebraic-graphs] include array-0.5.8.0-038b
  16484. 506.87 s [algebraic-graphs] include base-4.21.0.0-f068
  16485. 506.87 s [algebraic-graphs] include containers-0.7-647d
  16486. 506.87 s [algebraic-graphs] include deepseq-1.5.1.0-b096
  16487. 506.87 s [algebraic-graphs] include extra-1.8-GxUfFMQp4R7HmYwoSoVuga
  16488. 506.87 s [algebraic-graphs] include inspection-testing-0.5.0.3-6LnOBkVqnE2Cwk8gCmr2Oy
  16489. 506.87 s [algebraic-graphs] include transformers-0.6.1.2-199f
  16490. 506.87 s [algebraic-graphs] Linked component graph:
  16491. 506.87 s [algebraic-graphs] unit algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  16492. 506.87 s [algebraic-graphs] include array-0.5.8.0-038b
  16493. 506.87 s [algebraic-graphs] include base-4.21.0.0-f068
  16494. 506.87 s [algebraic-graphs] include containers-0.7-647d
  16495. 506.87 s [algebraic-graphs] include deepseq-1.5.1.0-b096
  16496. 506.87 s [algebraic-graphs] include transformers-0.6.1.2-199f
  16497. 506.87 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI:Data.Graph.Typed
  16498. 506.87 s [algebraic-graphs] unit algebraic-graphs-0.7-DUC0aIJJUCuCUbRi0dGT91-main
  16499. 506.87 s [algebraic-graphs] include QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  16500. 506.87 s [algebraic-graphs] include algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  16501. 506.87 s [algebraic-graphs] include array-0.5.8.0-038b
  16502. 506.87 s [algebraic-graphs] include base-4.21.0.0-f068
  16503. 506.87 s [algebraic-graphs] include containers-0.7-647d
  16504. 506.87 s [algebraic-graphs] include deepseq-1.5.1.0-b096
  16505. 506.87 s [algebraic-graphs] include extra-1.8-GxUfFMQp4R7HmYwoSoVuga
  16506. 506.87 s [algebraic-graphs] include inspection-testing-0.5.0.3-6LnOBkVqnE2Cwk8gCmr2Oy
  16507. 506.87 s [algebraic-graphs] include transformers-0.6.1.2-199f
  16508. 506.87 s [algebraic-graphs] Ready component graph:
  16509. 506.88 s [algebraic-graphs] definite algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  16510. 506.88 s [algebraic-graphs] depends array-0.5.8.0-038b
  16511. 506.88 s [algebraic-graphs] depends base-4.21.0.0-f068
  16512. 506.88 s [algebraic-graphs] depends containers-0.7-647d
  16513. 506.88 s [algebraic-graphs] depends deepseq-1.5.1.0-b096
  16514. 506.88 s [algebraic-graphs] depends transformers-0.6.1.2-199f
  16515. 506.88 s [algebraic-graphs] definite algebraic-graphs-0.7-DUC0aIJJUCuCUbRi0dGT91-main
  16516. 506.88 s [algebraic-graphs] depends QuickCheck-2.14.3-L4og0ZQ0UVv3NVnDTZSE7K
  16517. 506.88 s [algebraic-graphs] depends algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  16518. 506.88 s [algebraic-graphs] depends array-0.5.8.0-038b
  16519. 506.88 s [algebraic-graphs] depends base-4.21.0.0-f068
  16520. 506.88 s [algebraic-graphs] depends containers-0.7-647d
  16521. 506.88 s [algebraic-graphs] depends deepseq-1.5.1.0-b096
  16522. 506.88 s [algebraic-graphs] depends extra-1.8-GxUfFMQp4R7HmYwoSoVuga
  16523. 506.88 s [algebraic-graphs] depends inspection-testing-0.5.0.3-6LnOBkVqnE2Cwk8gCmr2Oy
  16524. 506.88 s [algebraic-graphs] depends transformers-0.6.1.2-199f
  16525. 506.88 s [algebraic-graphs] Using Cabal-3.14.1.0 compiled by ghc-9.12
  16526. 506.88 s [algebraic-graphs] Using compiler: ghc-9.12.1
  16527. 506.88 s [algebraic-graphs] Using install prefix:
  16528. 506.88 s [algebraic-graphs] /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7
  16529. 506.88 s [algebraic-graphs] Executables installed in:
  16530. 506.88 s [algebraic-graphs] /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7/bin
  16531. 506.88 s [algebraic-graphs] Libraries installed in:
  16532. 506.88 s [algebraic-graphs] /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  16533. 506.88 s [algebraic-graphs] Dynamic Libraries installed in:
  16534. 506.88 s [algebraic-graphs] /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
  16535. 506.88 s [algebraic-graphs] Private executables installed in:
  16536. 506.88 s [algebraic-graphs] /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.12.1-f739/algebraic-graphs-0.7
  16537. 506.88 s [algebraic-graphs] Data files installed in:
  16538. 506.88 s [algebraic-graphs] /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.12.1-f739/algebraic-graphs-0.7
  16539. 506.88 s [algebraic-graphs] Documentation installed in:
  16540. 506.88 s [algebraic-graphs] /nix/store/zwi1ml033xyrj6h60hxfvgwcsfkcz4sa-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  16541. 506.88 s [algebraic-graphs] Configuration files installed in:
  16542. 506.88 s [algebraic-graphs] /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7/etc
  16543. 506.88 s [algebraic-graphs] No alex found
  16544. 506.88 s [algebraic-graphs] Using ar found on system at:
  16545. 506.88 s [algebraic-graphs] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  16546. 506.88 s [algebraic-graphs] No c2hs found
  16547. 506.88 s [algebraic-graphs] No cpphs found
  16548. 506.88 s [algebraic-graphs] No doctest found
  16549. 506.88 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  16550. 506.88 s [algebraic-graphs] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  16551. 506.88 s [algebraic-graphs] Using ghc version 9.12.1 found on system at:
  16552. 506.88 s [algebraic-graphs] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc
  16553. 506.88 s [algebraic-graphs] Using ghc-pkg version 9.12.1 found on system at:
  16554. 506.88 s [algebraic-graphs] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc-pkg-9.12.1
  16555. 506.88 s [algebraic-graphs] No ghcjs found
  16556. 506.88 s [algebraic-graphs] No ghcjs-pkg found
  16557. 506.88 s [algebraic-graphs] No greencard found
  16558. 506.88 s [algebraic-graphs] Using haddock version 2.30.0 found on system at:
  16559. 506.88 s [algebraic-graphs] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/haddock-ghc-9.12.1
  16560. 506.88 s [algebraic-graphs] No happy found
  16561. 506.88 s [algebraic-graphs] No haskell-suite found
  16562. 506.88 s [algebraic-graphs] No haskell-suite-pkg found
  16563. 506.88 s [algebraic-graphs] No hmake found
  16564. 506.88 s [algebraic-graphs] Using hpc version 0.69 found on system at:
  16565. 506.88 s [algebraic-graphs] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hpc-ghc-9.12.1
  16566. 506.88 s [algebraic-graphs] Using hsc2hs version 0.68.10 found on system at:
  16567. 506.90 s [algebraic-graphs] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
  16568. 506.90 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  16569. 506.90 s [algebraic-graphs] /nix/store/q6qz2x3a08capyv98w52zizgxcnmv4hb-hscolour-1.25/bin/HsColour
  16570. 506.90 s [algebraic-graphs] No jhc found
  16571. 506.90 s [algebraic-graphs] Using ld found on system at:
  16572. 506.90 s [algebraic-graphs] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  16573. 506.90 s [algebraic-graphs] No pkg-config found
  16574. 506.90 s [algebraic-graphs] Using runghc version 9.12.1 found on system at:
  16575. 506.90 s [algebraic-graphs] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/runghc-9.12.1
  16576. 506.90 s [algebraic-graphs] Using strip version 2.44 found on system at:
  16577. 506.90 s [algebraic-graphs] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  16578. 506.90 s [algebraic-graphs] Using tar found on system at:
  16579. 506.90 s [algebraic-graphs] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  16580. 506.90 s [algebraic-graphs] No uhc found
  16581. 507.05 s [algebraic-graphs] Phase: buildPhase
  16582. 507.10 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  16583. 507.10 s [algebraic-graphs] Building library for algebraic-graphs-0.7...
  16584. 507.21 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 )
  16585. 508.23 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 )
  16586. 508.99 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 )
  16587. 509.56 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 )
  16588. 509.65 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  16589. 510.77 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 )
  16590. 511.09 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 )
  16591. 511.64 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 )
  16592. 512.38 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 )
  16593. 512.38 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 )
  16594. 512.38 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 )
  16595. 512.38 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  16596. 512.38 s [algebraic-graphs] In the use of ‘head’
  16597. 512.38 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16598. 512.38 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16599. 512.38 s [algebraic-graphs] |
  16600. 512.38 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  16601. 512.38 s [algebraic-graphs] | ^^^^
  16602. 512.38 s [algebraic-graphs]
  16603. 512.38 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  16604. 512.38 s [algebraic-graphs] In the use of ‘tail’
  16605. 512.38 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16606. 512.38 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 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16607. 512.38 s [algebraic-graphs] |
  16608. 512.38 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  16609. 512.38 s [algebraic-graphs] | ^^^^
  16610. 512.38 s [algebraic-graphs]
  16611. 512.38 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  16612. 512.38 s [algebraic-graphs] In the use of ‘head’
  16613. 512.38 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16614. 512.38 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16615. 512.38 s [algebraic-graphs] |
  16616. 512.38 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  16617. 512.38 s [algebraic-graphs] | ^^^^
  16618. 512.38 s [algebraic-graphs]
  16619. 512.38 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  16620. 512.39 s [algebraic-graphs] In the use of ‘tail’
  16621. 512.39 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16622. 512.39 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 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16623. 512.39 s [algebraic-graphs] |
  16624. 512.39 s [algebraic-graphs] 397 | bnd' = tail bnd
  16625. 512.39 s [algebraic-graphs] | ^^^^
  16626. 512.39 s [algebraic-graphs]
  16627. 512.39 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 )
  16628. 512.39 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 )
  16629. 512.39 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16630. 512.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16631. 512.39 s [algebraic-graphs] will become an error in a future GHC release.
  16632. 512.39 s [algebraic-graphs] Suggested fix:
  16633. 512.39 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16634. 512.39 s [algebraic-graphs] |
  16635. 512.39 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  16636. 512.39 s [algebraic-graphs] | ^
  16637. 512.39 s [algebraic-graphs]
  16638. 512.39 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16639. 512.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16640. 512.39 s [algebraic-graphs] will become an error in a future GHC release.
  16641. 512.39 s [algebraic-graphs] Suggested fix:
  16642. 512.39 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16643. 512.39 s [algebraic-graphs] |
  16644. 512.39 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16645. 512.39 s [algebraic-graphs] | ^
  16646. 512.39 s [algebraic-graphs]
  16647. 512.39 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16648. 512.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16649. 512.39 s [algebraic-graphs] will become an error in a future GHC release.
  16650. 512.39 s [algebraic-graphs] Suggested fix:
  16651. 512.39 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16652. 512.39 s [algebraic-graphs] |
  16653. 512.39 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16654. 512.39 s [algebraic-graphs] | ^
  16655. 512.39 s [algebraic-graphs]
  16656. 512.39 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16657. 512.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16658. 512.39 s [algebraic-graphs] will become an error in a future GHC release.
  16659. 512.39 s [algebraic-graphs] Suggested fix:
  16660. 512.39 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16661. 512.39 s [algebraic-graphs] |
  16662. 512.39 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16663. 512.39 s [algebraic-graphs] | ^
  16664. 512.39 s [algebraic-graphs]
  16665. 512.39 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16666. 512.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16667. 512.39 s [algebraic-graphs] will become an error in a future GHC release.
  16668. 512.39 s [algebraic-graphs] Suggested fix:
  16669. 512.39 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16670. 512.39 s [algebraic-graphs] |
  16671. 512.39 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16672. 512.39 s [algebraic-graphs] | ^
  16673. 512.39 s [algebraic-graphs]
  16674. 512.39 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16675. 512.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16676. 512.39 s [algebraic-graphs] will become an error in a future GHC release.
  16677. 512.39 s [algebraic-graphs] Suggested fix:
  16678. 512.39 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16679. 512.39 s [algebraic-graphs] |
  16680. 512.39 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16681. 512.39 s [algebraic-graphs] | ^
  16682. 512.39 s [algebraic-graphs]
  16683. 512.39 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16684. 512.39 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16685. 512.39 s [algebraic-graphs] will become an error in a future GHC release.
  16686. 512.39 s [algebraic-graphs] Suggested fix:
  16687. 512.39 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16688. 512.39 s [algebraic-graphs] |
  16689. 512.39 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16690. 512.39 s [algebraic-graphs] | ^
  16691. 512.39 s [algebraic-graphs]
  16692. 512.39 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 )
  16693. 512.42 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 )
  16694. 512.75 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 )
  16695. 512.75 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 )
  16696. 512.75 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 )
  16697. 513.21 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 )
  16698. 513.35 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 )
  16699. 513.51 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 )
  16700. 513.51 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16701. 513.51 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16702. 513.51 s [algebraic-graphs] will become an error in a future GHC release.
  16703. 513.51 s [algebraic-graphs] Suggested fix:
  16704. 513.51 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16705. 513.51 s [algebraic-graphs] |
  16706. 513.51 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  16707. 513.51 s [algebraic-graphs] | ^
  16708. 513.51 s [algebraic-graphs]
  16709. 513.51 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 )
  16710. 513.51 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16711. 513.51 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16712. 513.51 s [algebraic-graphs] will become an error in a future GHC release.
  16713. 513.51 s [algebraic-graphs] Suggested fix:
  16714. 513.51 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16715. 513.51 s [algebraic-graphs] |
  16716. 513.51 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  16717. 513.51 s [algebraic-graphs] | ^
  16718. 513.51 s [algebraic-graphs]
  16719. 513.51 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16720. 513.51 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16721. 513.51 s [algebraic-graphs] will become an error in a future GHC release.
  16722. 513.51 s [algebraic-graphs] Suggested fix:
  16723. 513.51 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16724. 513.51 s [algebraic-graphs] |
  16725. 513.51 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  16726. 513.51 s [algebraic-graphs] | ^
  16727. 513.51 s [algebraic-graphs]
  16728. 513.51 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 )
  16729. 513.51 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 )
  16730. 513.51 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 )
  16731. 513.57 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 )
  16732. 513.57 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 )
  16733. 513.57 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 )
  16734. 513.60 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 )
  16735. 513.86 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  16736. 514.72 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  16737. 515.27 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 )
  16738. 515.57 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  16739. 515.57 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  16740. 516.69 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 )
  16741. 517.00 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 )
  16742. 517.39 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 )
  16743. 518.11 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  16744. 518.11 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 )
  16745. 518.11 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 )
  16746. 518.11 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  16747. 518.11 s [algebraic-graphs] In the use of ‘head’
  16748. 518.11 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16749. 518.11 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16750. 518.11 s [algebraic-graphs] |
  16751. 518.11 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  16752. 518.11 s [algebraic-graphs] | ^^^^
  16753. 518.11 s [algebraic-graphs]
  16754. 518.11 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  16755. 518.11 s [algebraic-graphs] In the use of ‘tail’
  16756. 518.11 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16757. 518.11 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 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16758. 518.11 s [algebraic-graphs] |
  16759. 518.11 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  16760. 518.11 s [algebraic-graphs] | ^^^^
  16761. 518.11 s [algebraic-graphs]
  16762. 518.11 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  16763. 518.11 s [algebraic-graphs] In the use of ‘head’
  16764. 518.11 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16765. 518.11 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16766. 518.11 s [algebraic-graphs] |
  16767. 518.11 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  16768. 518.11 s [algebraic-graphs] | ^^^^
  16769. 518.11 s [algebraic-graphs]
  16770. 518.11 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  16771. 518.11 s [algebraic-graphs] In the use of ‘tail’
  16772. 518.11 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16773. 518.11 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 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  16774. 518.11 s [algebraic-graphs] |
  16775. 518.11 s [algebraic-graphs] 397 | bnd' = tail bnd
  16776. 518.11 s [algebraic-graphs] | ^^^^
  16777. 518.11 s [algebraic-graphs]
  16778. 518.11 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 )
  16779. 518.11 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  16780. 518.11 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16781. 518.11 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16782. 518.11 s [algebraic-graphs] will become an error in a future GHC release.
  16783. 518.11 s [algebraic-graphs] Suggested fix:
  16784. 518.11 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16785. 518.11 s [algebraic-graphs] |
  16786. 518.11 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  16787. 518.11 s [algebraic-graphs] | ^
  16788. 518.11 s [algebraic-graphs]
  16789. 518.11 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16790. 518.11 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16791. 518.11 s [algebraic-graphs] will become an error in a future GHC release.
  16792. 518.11 s [algebraic-graphs] Suggested fix:
  16793. 518.11 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16794. 518.11 s [algebraic-graphs] |
  16795. 518.11 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16796. 518.11 s [algebraic-graphs] | ^
  16797. 518.11 s [algebraic-graphs]
  16798. 518.11 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16799. 518.11 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16800. 518.11 s [algebraic-graphs] will become an error in a future GHC release.
  16801. 518.11 s [algebraic-graphs] Suggested fix:
  16802. 518.11 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16803. 518.11 s [algebraic-graphs] |
  16804. 518.11 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16805. 518.11 s [algebraic-graphs] | ^
  16806. 518.11 s [algebraic-graphs]
  16807. 518.11 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16808. 518.11 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16809. 518.11 s [algebraic-graphs] will become an error in a future GHC release.
  16810. 518.11 s [algebraic-graphs] Suggested fix:
  16811. 518.11 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16812. 518.11 s [algebraic-graphs] |
  16813. 518.11 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16814. 518.11 s [algebraic-graphs] | ^
  16815. 518.11 s [algebraic-graphs]
  16816. 518.11 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16817. 518.11 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16818. 518.11 s [algebraic-graphs] will become an error in a future GHC release.
  16819. 518.11 s [algebraic-graphs] Suggested fix:
  16820. 518.11 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16821. 518.11 s [algebraic-graphs] |
  16822. 518.11 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16823. 518.11 s [algebraic-graphs] | ^
  16824. 518.11 s [algebraic-graphs]
  16825. 518.11 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16826. 518.11 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16827. 518.11 s [algebraic-graphs] will become an error in a future GHC release.
  16828. 518.11 s [algebraic-graphs] Suggested fix:
  16829. 518.11 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16830. 518.11 s [algebraic-graphs] |
  16831. 518.11 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16832. 518.11 s [algebraic-graphs] | ^
  16833. 518.11 s [algebraic-graphs]
  16834. 518.11 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16835. 518.11 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16836. 518.11 s [algebraic-graphs] will become an error in a future GHC release.
  16837. 518.11 s [algebraic-graphs] Suggested fix:
  16838. 518.11 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16839. 518.11 s [algebraic-graphs] |
  16840. 518.11 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16841. 518.11 s [algebraic-graphs] | ^
  16842. 518.11 s [algebraic-graphs]
  16843. 518.11 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  16844. 518.11 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 )
  16845. 518.47 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  16846. 518.47 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 )
  16847. 518.47 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  16848. 518.96 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 )
  16849. 519.18 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 )
  16850. 519.33 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  16851. 519.33 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16852. 519.33 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16853. 519.33 s [algebraic-graphs] will become an error in a future GHC release.
  16854. 519.33 s [algebraic-graphs] Suggested fix:
  16855. 519.33 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16856. 519.33 s [algebraic-graphs] |
  16857. 519.33 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  16858. 519.33 s [algebraic-graphs] | ^
  16859. 519.33 s [algebraic-graphs]
  16860. 519.33 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 )
  16861. 519.33 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16862. 519.33 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16863. 519.33 s [algebraic-graphs] will become an error in a future GHC release.
  16864. 519.33 s [algebraic-graphs] Suggested fix:
  16865. 519.33 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16866. 519.33 s [algebraic-graphs] |
  16867. 519.33 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  16868. 519.33 s [algebraic-graphs] | ^
  16869. 519.33 s [algebraic-graphs]
  16870. 519.33 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16871. 519.33 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16872. 519.33 s [algebraic-graphs] will become an error in a future GHC release.
  16873. 519.33 s [algebraic-graphs] Suggested fix:
  16874. 519.33 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16875. 519.33 s [algebraic-graphs] |
  16876. 519.33 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  16877. 519.33 s [algebraic-graphs] | ^
  16878. 519.33 s [algebraic-graphs]
  16879. 519.33 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  16880. 519.33 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  16881. 519.33 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 )
  16882. 519.38 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 )
  16883. 519.39 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 )
  16884. 519.39 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 )
  16885. 519.42 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  16886. 520.40 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  16887. 520.54 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7...
  16888. 520.54 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 )
  16889. 521.73 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 )
  16890. 523.93 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 )
  16891. 523.93 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 )
  16892. 523.98 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 )
  16893. 523.98 s [algebraic-graphs] test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:71: warning: [GHC-00834] [-Wview-pattern-signatures]
  16894. 523.98 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  16895. 523.98 s [algebraic-graphs] • This code might stop working in a future GHC release
  16896. 523.98 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  16897. 523.98 s [algebraic-graphs] unless the view function is an endofunction.
  16898. 523.98 s [algebraic-graphs] • Current parse: ‘apply -> (f1 :: Int -> Int)’
  16899. 523.98 s [algebraic-graphs] Future parse: ‘(apply -> f1) :: Int -> Int’
  16900. 523.98 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  16901. 523.98 s [algebraic-graphs] |
  16902. 523.98 s [algebraic-graphs] 725 | test "bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)" $ \(apply -> f1 :: Int -> Int) (apply -> g1 :: Int -> Int) (apply -> f2 :: Int -> Int) (apply -> g2 :: Int -> Int) x ->
  16903. 523.98 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  16904. 523.98 s [algebraic-graphs]
  16905. 523.98 s [algebraic-graphs] test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:99: warning: [GHC-00834] [-Wview-pattern-signatures]
  16906. 523.98 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  16907. 523.98 s [algebraic-graphs] • This code might stop working in a future GHC release
  16908. 523.98 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  16909. 523.98 s [algebraic-graphs] unless the view function is an endofunction.
  16910. 523.98 s [algebraic-graphs] • Current parse: ‘apply -> (g1 :: Int -> Int)’
  16911. 523.98 s [algebraic-graphs] Future parse: ‘(apply -> g1) :: Int -> Int’
  16912. 523.99 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  16913. 523.99 s [algebraic-graphs] |
  16914. 523.99 s [algebraic-graphs] 725 | test "bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)" $ \(apply -> f1 :: Int -> Int) (apply -> g1 :: Int -> Int) (apply -> f2 :: Int -> Int) (apply -> g2 :: Int -> Int) x ->
  16915. 523.99 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  16916. 523.99 s [algebraic-graphs]
  16917. 523.99 s [algebraic-graphs] test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:127: warning: [GHC-00834] [-Wview-pattern-signatures]
  16918. 523.99 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  16919. 523.99 s [algebraic-graphs] • This code might stop working in a future GHC release
  16920. 523.99 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  16921. 523.99 s [algebraic-graphs] unless the view function is an endofunction.
  16922. 523.99 s [algebraic-graphs] • Current parse: ‘apply -> (f2 :: Int -> Int)’
  16923. 523.99 s [algebraic-graphs] Future parse: ‘(apply -> f2) :: Int -> Int’
  16924. 523.99 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  16925. 523.99 s [algebraic-graphs] |
  16926. 523.99 s [algebraic-graphs] 725 | test "bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)" $ \(apply -> f1 :: Int -> Int) (apply -> g1 :: Int -> Int) (apply -> f2 :: Int -> Int) (apply -> g2 :: Int -> Int) x ->
  16927. 523.99 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  16928. 523.99 s [algebraic-graphs]
  16929. 523.99 s [algebraic-graphs] test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:155: warning: [GHC-00834] [-Wview-pattern-signatures]
  16930. 523.99 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  16931. 523.99 s [algebraic-graphs] • This code might stop working in a future GHC release
  16932. 523.99 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  16933. 523.99 s [algebraic-graphs] unless the view function is an endofunction.
  16934. 523.99 s [algebraic-graphs] • Current parse: ‘apply -> (g2 :: Int -> Int)’
  16935. 523.99 s [algebraic-graphs] Future parse: ‘(apply -> g2) :: Int -> Int’
  16936. 523.99 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  16937. 523.99 s [algebraic-graphs] |
  16938. 523.99 s [algebraic-graphs] 725 | test "bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)" $ \(apply -> f1 :: Int -> Int) (apply -> g1 :: Int -> Int) (apply -> f2 :: Int -> Int) (apply -> g2 :: Int -> Int) x ->
  16939. 523.99 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  16940. 523.99 s [algebraic-graphs]
  16941. 525.73 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 )
  16942. 525.77 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 )
  16943. 525.77 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 )
  16944. 525.77 s [algebraic-graphs] test/Algebra/Graph/Test/Generic.hs:1501:50: warning: [GHC-00834] [-Wview-pattern-signatures]
  16945. 525.77 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  16946. 525.77 s [algebraic-graphs] • This code might stop working in a future GHC release
  16947. 525.77 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  16948. 525.77 s [algebraic-graphs] unless the view function is an endofunction.
  16949. 525.77 s [algebraic-graphs] • Current parse: ‘apply -> (f :: Int -> Int)’
  16950. 525.77 s [algebraic-graphs] Future parse: ‘(apply -> f) :: Int -> Int’
  16951. 525.77 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  16952. 525.77 s [algebraic-graphs] |
  16953. 525.77 s [algebraic-graphs] 1501 | test "gmap f . gmap g == gmap (f . g)" $ \(apply -> f :: Int -> Int) (apply -> g :: Int -> Int) x ->
  16954. 525.77 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^
  16955. 525.77 s [algebraic-graphs]
  16956. 525.77 s [algebraic-graphs] test/Algebra/Graph/Test/Generic.hs:1501:77: warning: [GHC-00834] [-Wview-pattern-signatures]
  16957. 525.77 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  16958. 525.77 s [algebraic-graphs] • This code might stop working in a future GHC release
  16959. 525.77 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  16960. 525.77 s [algebraic-graphs] unless the view function is an endofunction.
  16961. 525.77 s [algebraic-graphs] • Current parse: ‘apply -> (g :: Int -> Int)’
  16962. 525.77 s [algebraic-graphs] Future parse: ‘(apply -> g) :: Int -> Int’
  16963. 525.77 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  16964. 525.77 s [algebraic-graphs] |
  16965. 525.77 s [algebraic-graphs] 1501 | test "gmap f . gmap g == gmap (f . g)" $ \(apply -> f :: Int -> Int) (apply -> g :: Int -> Int) x ->
  16966. 525.77 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^
  16967. 525.77 s [algebraic-graphs]
  16968. 529.50 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 )
  16969. 529.68 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 )
  16970. 529.68 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 )
  16971. 530.36 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 )
  16972. 530.36 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 )
  16973. 530.36 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 )
  16974. 531.53 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 )
  16975. 531.57 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 )
  16976. 531.57 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 )
  16977. 531.57 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 )
  16978. 531.57 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 )
  16979. 531.57 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 )
  16980. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  16981. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  16982. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  16983. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  16984. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
  16985. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  16986. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
  16987. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  16988. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
  16989. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  16990. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  16991. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
  16992. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  16993. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
  16994. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  16995. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
  16996. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  16997. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  16998. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  16999. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  17000. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  17001. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  17002. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  17003. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  17004. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  17005. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  17006. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  17007. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  17008. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  17009. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  17010. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  17011. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  17012. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  17013. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  17014. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
  17015. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  17016. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  17017. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  17018. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  17019. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
  17020. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  17021. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  17022. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  17023. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  17024. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  17025. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  17026. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
  17027. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  17028. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  17029. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  17030. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
  17031. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  17032. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  17033. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  17034. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  17035. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  17036. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  17037. 531.57 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  17038. 531.57 s [algebraic-graphs] inspection testing successful
  17039. 531.57 s [algebraic-graphs] expected successes: 58
  17040. 531.57 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 )
  17041. 531.57 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 )
  17042. 531.57 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 )
  17043. 532.33 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  17044. 533.24 s [algebraic-graphs] Phase: checkPhase
  17045. 533.51 s [algebraic-graphs] Running 1 test suites...
  17046. 533.51 s [algebraic-graphs] Test suite main: RUNNING...
  17047. 541.26 s [algebraic-graphs]
  17048. 541.26 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  17049. 541.30 s [algebraic-graphs] OK: show empty == "empty"
  17050. 541.30 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  17051. 541.30 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  17052. 541.30 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  17053. 541.30 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  17054. 541.30 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  17055. 541.30 s [algebraic-graphs]
  17056. 541.30 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  17057. 541.30 s [algebraic-graphs] OK: fromAcyclic empty == empty
  17058. 541.30 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  17059. 541.30 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  17060. 541.30 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  17061. 541.30 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  17062. 541.30 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  17063. 541.30 s [algebraic-graphs]
  17064. 541.30 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  17065. 541.30 s [algebraic-graphs] OK: isEmpty empty == True
  17066. 541.30 s [algebraic-graphs] OK: hasVertex x empty == False
  17067. 541.30 s [algebraic-graphs] OK: vertexCount empty == 0
  17068. 541.30 s [algebraic-graphs] OK: edgeCount empty == 0
  17069. 541.30 s [algebraic-graphs]
  17070. 541.30 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  17071. 541.30 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17072. 541.30 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17073. 541.30 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17074. 541.30 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17075. 541.30 s [algebraic-graphs]
  17076. 541.30 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  17077. 541.30 s [algebraic-graphs] OK: vertices [] == empty
  17078. 541.30 s [algebraic-graphs] OK: vertices [x] == vertex x
  17079. 541.30 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17080. 541.30 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17081. 541.30 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17082. 541.30 s [algebraic-graphs]
  17083. 541.30 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  17084. 541.30 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  17085. 541.30 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  17086. 541.30 s [algebraic-graphs]
  17087. 541.30 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  17088. 541.30 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  17089. 541.30 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  17090. 541.30 s [algebraic-graphs]
  17091. 541.30 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  17092. 541.30 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17093. 541.30 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17094. 541.30 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17095. 541.30 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  17096. 541.30 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17097. 541.30 s [algebraic-graphs]
  17098. 541.30 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  17099. 541.30 s [algebraic-graphs] OK: isEmpty empty == True
  17100. 541.30 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17101. 541.30 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17102. 541.30 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  17103. 541.30 s [algebraic-graphs]
  17104. 541.30 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  17105. 541.30 s [algebraic-graphs] OK: hasVertex x empty == False
  17106. 541.30 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17107. 541.30 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17108. 541.30 s [algebraic-graphs]
  17109. 541.30 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  17110. 541.30 s [algebraic-graphs] OK: hasEdge x y empty == False
  17111. 541.30 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17112. 541.30 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  17113. 541.30 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17114. 541.30 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17115. 541.30 s [algebraic-graphs]
  17116. 541.30 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  17117. 541.30 s [algebraic-graphs] OK: vertexCount empty == 0
  17118. 541.30 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17119. 541.30 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17120. 541.30 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17121. 541.30 s [algebraic-graphs]
  17122. 541.30 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  17123. 541.30 s [algebraic-graphs] OK: edgeCount empty == 0
  17124. 541.30 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17125. 541.30 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  17126. 541.30 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17127. 541.30 s [algebraic-graphs]
  17128. 541.30 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  17129. 541.30 s [algebraic-graphs] OK: vertexList empty == []
  17130. 541.30 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17131. 541.30 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17132. 541.30 s [algebraic-graphs]
  17133. 541.30 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  17134. 541.30 s [algebraic-graphs] OK: edgeList empty == []
  17135. 541.30 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17136. 541.30 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  17137. 541.30 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17138. 541.30 s [algebraic-graphs]
  17139. 541.30 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  17140. 541.30 s [algebraic-graphs] OK: adjacencyList empty == []
  17141. 541.30 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  17142. 541.30 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  17143. 541.30 s [algebraic-graphs]
  17144. 541.30 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  17145. 541.30 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17146. 541.30 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17147. 541.30 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17148. 541.30 s [algebraic-graphs]
  17149. 541.30 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  17150. 541.30 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17151. 541.30 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17152. 541.30 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  17153. 541.30 s [algebraic-graphs]
  17154. 541.30 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  17155. 541.30 s [algebraic-graphs] OK: preSet x empty == Set.empty
  17156. 541.30 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  17157. 541.30 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  17158. 541.30 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  17159. 541.30 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  17160. 541.30 s [algebraic-graphs]
  17161. 541.30 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  17162. 541.30 s [algebraic-graphs] OK: postSet x empty == Set.empty
  17163. 541.30 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  17164. 541.30 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  17165. 541.30 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  17166. 541.31 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  17167. 541.31 s [algebraic-graphs]
  17168. 541.31 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  17169. 541.31 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  17170. 541.31 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  17171. 541.31 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  17172. 541.31 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  17173. 541.31 s [algebraic-graphs]
  17174. 541.31 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  17175. 541.31 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  17176. 541.31 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  17177. 541.31 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  17178. 541.31 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  17179. 541.31 s [algebraic-graphs]
  17180. 541.31 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  17181. 541.31 s [algebraic-graphs] OK: transpose empty == empty
  17182. 541.31 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  17183. 541.31 s [algebraic-graphs] OK: transpose . transpose == id
  17184. 541.31 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17185. 541.31 s [algebraic-graphs]
  17186. 541.31 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  17187. 541.31 s [algebraic-graphs] OK: induce (const True ) x == x
  17188. 541.31 s [algebraic-graphs] OK: induce (const False) x == empty
  17189. 541.31 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  17190. 541.31 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  17191. 541.31 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17192. 541.31 s [algebraic-graphs]
  17193. 541.31 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  17194. 541.31 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  17195. 541.31 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  17196. 541.31 s [algebraic-graphs]
  17197. 541.31 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  17198. 541.31 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  17199. 541.31 s [algebraic-graphs]
  17200. 541.31 s [algebraic-graphs] OK: box x y ~~ box y x
  17201. 541.31 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  17202. 541.31 s [algebraic-graphs] OK: box x empty ~~ empty
  17203. 541.31 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  17204. 541.31 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  17205. 541.31 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  17206. 541.31 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  17207. 541.31 s [algebraic-graphs]
  17208. 541.31 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  17209. 541.31 s [algebraic-graphs] OK: transitiveClosure empty == empty
  17210. 541.31 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  17211. 541.31 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  17212. 541.31 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  17213. 541.31 s [algebraic-graphs]
  17214. 541.31 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  17215. 541.31 s [algebraic-graphs] OK: topSort empty == []
  17216. 541.31 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  17217. 541.31 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  17218. 541.31 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  17219. 541.31 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  17220. 541.31 s [algebraic-graphs]
  17221. 541.31 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  17222. 541.31 s [algebraic-graphs] OK: scc empty == empty
  17223. 541.31 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  17224. 541.31 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  17225. 541.31 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  17226. 541.31 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  17227. 541.31 s [algebraic-graphs]
  17228. 541.31 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  17229. 541.31 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  17230. 541.31 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  17231. 541.31 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  17232. 541.31 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  17233. 541.31 s [algebraic-graphs]
  17234. 541.31 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  17235. 541.31 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  17236. 541.31 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  17237. 541.31 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  17238. 541.31 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  17239. 541.31 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  17240. 541.31 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  17241. 544.69 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  17242. 544.69 s [algebraic-graphs]
  17243. 544.69 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  17244. 544.69 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  17245. 544.69 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  17246. 544.69 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  17247. 544.69 s [algebraic-graphs]
  17248. 544.69 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  17249. 544.69 s [algebraic-graphs] OK: Arbitrary
  17250. 544.69 s [algebraic-graphs] OK: empty
  17251. 544.69 s [algebraic-graphs] OK: vertex
  17252. 544.69 s [algebraic-graphs] OK: vertices
  17253. 544.69 s [algebraic-graphs] OK: union
  17254. 544.69 s [algebraic-graphs] OK: join
  17255. 544.69 s [algebraic-graphs] OK: transpose
  17256. 544.69 s [algebraic-graphs] OK: box
  17257. 544.69 s [algebraic-graphs] OK: transitiveClosure
  17258. 544.69 s [algebraic-graphs] OK: scc
  17259. 544.69 s [algebraic-graphs] OK: toAcyclic
  17260. 544.69 s [algebraic-graphs] OK: toAcyclicOrd
  17261. 544.69 s [algebraic-graphs]
  17262. 544.69 s [algebraic-graphs] ============ AdjacencyIntMap ============
  17263. 544.69 s [algebraic-graphs] OK: Axioms of graphs
  17264. 544.69 s [algebraic-graphs]
  17265. 544.69 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  17266. 544.69 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  17267. 544.69 s [algebraic-graphs]
  17268. 544.69 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  17269. 544.69 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  17270. 544.69 s [algebraic-graphs]
  17271. 544.69 s [algebraic-graphs] OK: consistent empty == True
  17272. 544.69 s [algebraic-graphs] OK: consistent (vertex x) == True
  17273. 544.69 s [algebraic-graphs] OK: consistent (overlay x y) == True
  17274. 544.69 s [algebraic-graphs] OK: consistent (connect x y) == True
  17275. 544.69 s [algebraic-graphs] OK: consistent (edge x y) == True
  17276. 544.69 s [algebraic-graphs] OK: consistent (edges xs) == True
  17277. 544.69 s [algebraic-graphs] OK: consistent (stars xs) == True
  17278. 544.69 s [algebraic-graphs]
  17279. 544.69 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  17280. 544.69 s [algebraic-graphs] OK: show (empty ) == "empty"
  17281. 544.69 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  17282. 544.69 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  17283. 544.69 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  17284. 544.69 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  17285. 544.69 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  17286. 544.69 s [algebraic-graphs]
  17287. 544.69 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  17288. 544.69 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  17289. 544.69 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  17290. 544.69 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  17291. 544.69 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  17292. 544.69 s [algebraic-graphs]
  17293. 544.69 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  17294. 544.69 s [algebraic-graphs] OK: vertex 1 < vertex 2
  17295. 544.69 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  17296. 544.69 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  17297. 544.69 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  17298. 544.69 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  17299. 544.69 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  17300. 544.69 s [algebraic-graphs] OK: x <= x + y
  17301. 544.69 s [algebraic-graphs] OK: x + y <= x * y
  17302. 544.69 s [algebraic-graphs]
  17303. 544.69 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  17304. 544.69 s [algebraic-graphs] OK: isEmpty empty == True
  17305. 544.69 s [algebraic-graphs] OK: hasVertex x empty == False
  17306. 544.69 s [algebraic-graphs] OK: vertexCount empty == 0
  17307. 544.69 s [algebraic-graphs] OK: edgeCount empty == 0
  17308. 544.69 s [algebraic-graphs]
  17309. 544.69 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  17310. 544.69 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17311. 544.69 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17312. 544.69 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17313. 544.69 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17314. 544.69 s [algebraic-graphs]
  17315. 544.69 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  17316. 544.69 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  17317. 544.69 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17318. 544.69 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17319. 544.69 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  17320. 544.69 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  17321. 544.69 s [algebraic-graphs]
  17322. 544.69 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  17323. 544.69 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  17324. 544.69 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  17325. 544.69 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  17326. 544.69 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  17327. 544.69 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  17328. 544.69 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  17329. 544.69 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  17330. 544.69 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  17331. 544.69 s [algebraic-graphs]
  17332. 544.69 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  17333. 544.69 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  17334. 544.69 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  17335. 544.69 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  17336. 544.69 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  17337. 544.69 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  17338. 544.69 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  17339. 544.69 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  17340. 544.69 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  17341. 544.69 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  17342. 544.69 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  17343. 544.69 s [algebraic-graphs]
  17344. 544.69 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  17345. 544.69 s [algebraic-graphs] OK: vertices [] == empty
  17346. 544.69 s [algebraic-graphs] OK: vertices [x] == vertex x
  17347. 544.69 s [algebraic-graphs] OK: vertices == overlays . map vertex
  17348. 544.69 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17349. 544.69 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17350. 544.69 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17351. 544.69 s [algebraic-graphs]
  17352. 544.69 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  17353. 544.69 s [algebraic-graphs] OK: edges [] == empty
  17354. 544.69 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  17355. 544.69 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  17356. 544.69 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  17357. 544.69 s [algebraic-graphs]
  17358. 544.69 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  17359. 544.69 s [algebraic-graphs] OK: overlays [] == empty
  17360. 544.69 s [algebraic-graphs] OK: overlays [x] == x
  17361. 544.69 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  17362. 544.69 s [algebraic-graphs] OK: overlays == foldr overlay empty
  17363. 544.69 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  17364. 544.69 s [algebraic-graphs]
  17365. 544.69 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  17366. 544.69 s [algebraic-graphs] OK: connects [] == empty
  17367. 544.69 s [algebraic-graphs] OK: connects [x] == x
  17368. 544.69 s [algebraic-graphs] OK: connects [x,y] == connect x y
  17369. 544.69 s [algebraic-graphs] OK: connects == foldr connect empty
  17370. 544.69 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  17371. 544.69 s [algebraic-graphs]
  17372. 544.69 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  17373. 544.69 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  17374. 544.69 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  17375. 544.69 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  17376. 544.69 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  17377. 544.69 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  17378. 544.69 s [algebraic-graphs]
  17379. 544.69 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  17380. 544.69 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17381. 544.69 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17382. 544.69 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  17383. 544.69 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  17384. 544.69 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  17385. 544.69 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17386. 544.69 s [algebraic-graphs]
  17387. 544.69 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  17388. 544.69 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  17389. 544.69 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  17390. 544.69 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  17391. 544.69 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  17392. 544.69 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  17393. 544.69 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  17394. 544.69 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  17395. 544.69 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  17396. 544.69 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  17397. 544.69 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  17398. 544.69 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  17399. 544.69 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  17400. 544.69 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  17401. 544.69 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  17402. 544.69 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  17403. 544.69 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  17404. 544.69 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  17405. 544.69 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  17406. 544.69 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  17407. 544.69 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  17408. 544.69 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  17409. 544.69 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  17410. 544.69 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  17411. 544.69 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  17412. 544.69 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  17413. 544.69 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  17414. 544.69 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  17415. 544.69 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  17416. 544.69 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17417. 544.69 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  17418. 544.69 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  17419. 544.69 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  17420. 544.69 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  17421. 544.69 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  17422. 545.45 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17423. 545.45 s [algebraic-graphs]
  17424. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  17425. 545.45 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  17426. 545.45 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  17427. 545.45 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  17428. 545.45 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  17429. 545.45 s [algebraic-graphs]
  17430. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  17431. 545.45 s [algebraic-graphs] OK: isEmpty empty == True
  17432. 545.45 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  17433. 545.45 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17434. 545.45 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17435. 545.45 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  17436. 545.45 s [algebraic-graphs]
  17437. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  17438. 545.45 s [algebraic-graphs] OK: hasVertex x empty == False
  17439. 545.45 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17440. 545.45 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17441. 545.45 s [algebraic-graphs]
  17442. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  17443. 545.45 s [algebraic-graphs] OK: hasEdge x y empty == False
  17444. 545.45 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17445. 545.45 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17446. 545.45 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17447. 545.45 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17448. 545.45 s [algebraic-graphs]
  17449. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  17450. 545.45 s [algebraic-graphs] OK: vertexCount empty == 0
  17451. 545.45 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17452. 545.45 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17453. 545.45 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17454. 545.45 s [algebraic-graphs]
  17455. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  17456. 545.45 s [algebraic-graphs] OK: edgeCount empty == 0
  17457. 545.45 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17458. 545.45 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17459. 545.45 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17460. 545.45 s [algebraic-graphs]
  17461. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  17462. 545.45 s [algebraic-graphs] OK: vertexList empty == []
  17463. 545.45 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17464. 545.45 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17465. 545.45 s [algebraic-graphs]
  17466. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  17467. 545.45 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17468. 545.45 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17469. 545.45 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17470. 545.45 s [algebraic-graphs]
  17471. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  17472. 545.45 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  17473. 545.45 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  17474. 545.45 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  17475. 545.45 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  17476. 545.45 s [algebraic-graphs]
  17477. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  17478. 545.45 s [algebraic-graphs] OK: edgeList empty == []
  17479. 545.45 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17480. 545.45 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  17481. 545.45 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  17482. 545.45 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  17483. 545.45 s [algebraic-graphs]
  17484. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  17485. 545.45 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17486. 545.45 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17487. 545.45 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  17488. 545.45 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  17489. 545.45 s [algebraic-graphs]
  17490. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  17491. 545.45 s [algebraic-graphs] OK: adjacencyList empty == []
  17492. 545.45 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  17493. 545.45 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  17494. 545.45 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  17495. 545.45 s [algebraic-graphs]
  17496. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  17497. 545.45 s [algebraic-graphs] OK: preSet x empty == Set.empty
  17498. 545.45 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  17499. 545.45 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  17500. 545.45 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  17501. 545.45 s [algebraic-graphs]
  17502. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  17503. 545.45 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  17504. 545.45 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  17505. 545.45 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  17506. 545.45 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  17507. 545.45 s [algebraic-graphs]
  17508. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  17509. 545.45 s [algebraic-graphs] OK: postSet x empty == Set.empty
  17510. 545.45 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  17511. 545.45 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  17512. 545.45 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  17513. 545.45 s [algebraic-graphs]
  17514. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  17515. 545.45 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  17516. 545.45 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  17517. 545.45 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  17518. 545.45 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  17519. 545.45 s [algebraic-graphs]
  17520. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  17521. 545.45 s [algebraic-graphs] OK: path [] == empty
  17522. 545.45 s [algebraic-graphs] OK: path [x] == vertex x
  17523. 545.45 s [algebraic-graphs] OK: path [x,y] == edge x y
  17524. 545.45 s [algebraic-graphs]
  17525. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  17526. 545.45 s [algebraic-graphs] OK: circuit [] == empty
  17527. 545.45 s [algebraic-graphs] OK: circuit [x] == edge x x
  17528. 545.45 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  17529. 545.45 s [algebraic-graphs]
  17530. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  17531. 545.45 s [algebraic-graphs] OK: clique [] == empty
  17532. 545.45 s [algebraic-graphs] OK: clique [x] == vertex x
  17533. 545.45 s [algebraic-graphs] OK: clique [x,y] == edge x y
  17534. 545.45 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  17535. 545.45 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  17536. 545.45 s [algebraic-graphs]
  17537. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  17538. 545.45 s [algebraic-graphs] OK: biclique [] [] == empty
  17539. 545.45 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  17540. 545.45 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  17541. 545.45 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  17542. 545.45 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  17543. 545.45 s [algebraic-graphs]
  17544. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  17545. 545.45 s [algebraic-graphs] OK: star x [] == vertex x
  17546. 545.45 s [algebraic-graphs] OK: star x [y] == edge x y
  17547. 545.45 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  17548. 545.45 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  17549. 545.45 s [algebraic-graphs]
  17550. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  17551. 545.45 s [algebraic-graphs] OK: stars [] == empty
  17552. 545.45 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  17553. 545.45 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  17554. 545.45 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  17555. 545.45 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  17556. 545.45 s [algebraic-graphs] OK: stars . adjacencyList == id
  17557. 545.45 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  17558. 545.45 s [algebraic-graphs]
  17559. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  17560. 545.45 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  17561. 545.45 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  17562. 545.45 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  17563. 545.45 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  17564. 545.45 s [algebraic-graphs]
  17565. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  17566. 545.45 s [algebraic-graphs] OK: forest [] == empty
  17567. 545.45 s [algebraic-graphs] OK: forest [x] == tree x
  17568. 545.45 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  17569. 545.45 s [algebraic-graphs] OK: forest == overlays . map tree
  17570. 545.45 s [algebraic-graphs]
  17571. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  17572. 545.45 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  17573. 545.45 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  17574. 545.45 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  17575. 545.45 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  17576. 545.45 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  17577. 545.45 s [algebraic-graphs]
  17578. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  17579. 545.45 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  17580. 545.45 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  17581. 545.45 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  17582. 545.45 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  17583. 545.45 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  17584. 545.45 s [algebraic-graphs]
  17585. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  17586. 545.45 s [algebraic-graphs] OK: replaceVertex x x == id
  17587. 545.45 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  17588. 545.45 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  17589. 545.45 s [algebraic-graphs]
  17590. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  17591. 545.45 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  17592. 545.45 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  17593. 545.45 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  17594. 545.45 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  17595. 545.45 s [algebraic-graphs]
  17596. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  17597. 545.45 s [algebraic-graphs] OK: transpose empty == empty
  17598. 545.45 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  17599. 545.45 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  17600. 545.45 s [algebraic-graphs] OK: transpose . transpose == id
  17601. 545.45 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17602. 545.45 s [algebraic-graphs]
  17603. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  17604. 545.45 s [algebraic-graphs] OK: gmap f empty == empty
  17605. 545.45 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  17606. 545.45 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  17607. 545.45 s [algebraic-graphs] OK: gmap id == id
  17608. 545.45 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  17609. 545.45 s [algebraic-graphs]
  17610. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  17611. 545.45 s [algebraic-graphs] OK: induce (const True ) x == x
  17612. 545.45 s [algebraic-graphs] OK: induce (const False) x == empty
  17613. 545.45 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  17614. 545.45 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  17615. 545.45 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17616. 545.45 s [algebraic-graphs]
  17617. 545.45 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  17618. 545.45 s [algebraic-graphs] OK: compose empty x == empty
  17619. 545.45 s [algebraic-graphs] OK: compose x empty == empty
  17620. 545.45 s [algebraic-graphs] OK: compose (vertex x) y == empty
  17621. 545.45 s [algebraic-graphs] OK: compose x (vertex y) == empty
  17622. 545.45 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  17623. 545.45 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  17624. 545.68 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  17625. 545.68 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  17626. 545.68 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  17627. 545.68 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  17628. 545.68 s [algebraic-graphs]
  17629. 545.68 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  17630. 545.68 s [algebraic-graphs] OK: closure empty == empty
  17631. 545.68 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  17632. 545.68 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  17633. 545.68 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  17634. 545.68 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  17635. 545.68 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  17636. 545.68 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  17637. 545.68 s [algebraic-graphs] OK: closure . closure == closure
  17638. 545.68 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  17639. 545.68 s [algebraic-graphs]
  17640. 545.68 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  17641. 545.68 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  17642. 545.68 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  17643. 545.68 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  17644. 545.68 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  17645. 545.68 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  17646. 545.68 s [algebraic-graphs]
  17647. 545.68 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  17648. 545.68 s [algebraic-graphs] OK: symmetricClosure empty == empty
  17649. 545.68 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  17650. 545.68 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  17651. 545.68 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  17652. 545.68 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  17653. 545.68 s [algebraic-graphs]
  17654. 545.68 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  17655. 545.68 s [algebraic-graphs] OK: transitiveClosure empty == empty
  17656. 545.68 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  17657. 545.68 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  17658. 545.68 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  17659. 545.68 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  17660. 545.68 s [algebraic-graphs]
  17661. 545.68 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  17662. 545.68 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  17663. 545.68 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  17664. 545.68 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  17665. 545.68 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  17666. 545.68 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  17667. 545.68 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  17668. 545.68 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  17669. 545.68 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  17670. 545.68 s [algebraic-graphs] OK: bfsForest x [] == []
  17671. 545.68 s [algebraic-graphs] OK: bfsForest empty vs == []
  17672. 545.68 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  17673. 545.68 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  17674. 545.68 s [algebraic-graphs]
  17675. 545.68 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  17676. 545.68 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  17677. 545.68 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  17678. 545.68 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  17679. 545.68 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  17680. 545.68 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  17681. 545.68 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  17682. 545.68 s [algebraic-graphs] OK: bfs empty vs == []
  17683. 545.68 s [algebraic-graphs] OK: bfs x [] == []
  17684. 545.68 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  17685. 545.68 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  17686. 545.68 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  17687. 545.68 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  17688. 545.68 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  17689. 545.68 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  17690. 545.68 s [algebraic-graphs]
  17691. 545.68 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  17692. 545.68 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  17693. 545.68 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  17694. 545.68 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  17695. 545.68 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  17696. 545.68 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  17697. 545.68 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  17698. 545.68 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  17699. 545.68 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  17700. 545.68 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  17701. 545.68 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  17702. 545.68 s [algebraic-graphs]
  17703. 545.68 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  17704. 545.68 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  17705. 545.68 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  17706. 545.68 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  17707. 545.68 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  17708. 545.68 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  17709. 545.68 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  17710. 545.68 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  17711. 545.68 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  17712. 545.68 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  17713. 545.68 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  17714. 545.68 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  17715. 545.68 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  17716. 545.68 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  17717. 545.68 s [algebraic-graphs]
  17718. 545.68 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  17719. 545.68 s [algebraic-graphs] OK: dfs empty vs == []
  17720. 545.68 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  17721. 545.68 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  17722. 545.68 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  17723. 545.68 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  17724. 545.68 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  17725. 545.68 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  17726. 545.68 s [algebraic-graphs] OK: dfs x [] == []
  17727. 545.68 s [algebraic-graphs]
  17728. 545.68 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  17729. 545.68 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  17730. 545.68 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  17731. 545.68 s [algebraic-graphs]
  17732. 545.68 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  17733. 545.68 s [algebraic-graphs] OK: reachable empty x == []
  17734. 545.68 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  17735. 545.68 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  17736. 545.68 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  17737. 545.68 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  17738. 545.68 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  17739. 545.68 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  17740. 545.68 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  17741. 545.68 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  17742. 545.68 s [algebraic-graphs]
  17743. 545.68 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  17744. 545.68 s [algebraic-graphs]
  17745. 545.68 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  17746. 545.69 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  17747. 545.69 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  17748. 545.69 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  17749. 545.69 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  17750. 545.69 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  17751. 545.69 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  17752. 545.69 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  17753. 545.69 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  17754. 545.69 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  17755. 545.69 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  17756. 545.69 s [algebraic-graphs]
  17757. 545.69 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  17758. 545.69 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  17759. 545.69 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  17760. 545.69 s [algebraic-graphs] OK: isAcyclic . circuit == null
  17761. 545.69 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  17762. 545.69 s [algebraic-graphs]
  17763. 545.69 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  17764. 545.69 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  17765. 545.69 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  17766. 545.69 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  17767. 545.69 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  17768. 545.69 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  17769. 545.69 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  17770. 545.69 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  17771. 545.69 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  17772. 545.69 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  17773. 545.69 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  17774. 545.69 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  17775. 545.69 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  17776. 545.69 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  17777. 550.15 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  17778. 550.15 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  17779. 550.32 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  17780. 550.32 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  17781. 550.32 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  17782. 550.32 s [algebraic-graphs]
  17783. 550.32 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  17784. 550.32 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  17785. 550.32 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  17786. 550.32 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  17787. 550.32 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  17788. 550.32 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  17789. 550.32 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  17790. 550.32 s [algebraic-graphs]
  17791. 550.32 s [algebraic-graphs] ============ AdjacencyMap ============
  17792. 550.32 s [algebraic-graphs] OK: Axioms of graphs
  17793. 550.32 s [algebraic-graphs]
  17794. 550.32 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  17795. 550.32 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  17796. 550.32 s [algebraic-graphs]
  17797. 550.32 s [algebraic-graphs] OK: consistent empty == True
  17798. 550.32 s [algebraic-graphs] OK: consistent (vertex x) == True
  17799. 550.32 s [algebraic-graphs] OK: consistent (overlay x y) == True
  17800. 550.32 s [algebraic-graphs] OK: consistent (connect x y) == True
  17801. 550.32 s [algebraic-graphs] OK: consistent (edge x y) == True
  17802. 550.32 s [algebraic-graphs] OK: consistent (edges xs) == True
  17803. 550.32 s [algebraic-graphs] OK: consistent (stars xs) == True
  17804. 550.32 s [algebraic-graphs]
  17805. 550.32 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  17806. 550.32 s [algebraic-graphs] OK: show (empty ) == "empty"
  17807. 550.32 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  17808. 550.32 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  17809. 550.32 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  17810. 550.32 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  17811. 550.32 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  17812. 550.32 s [algebraic-graphs]
  17813. 550.32 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  17814. 550.32 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  17815. 550.32 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  17816. 550.32 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  17817. 550.32 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  17818. 550.32 s [algebraic-graphs]
  17819. 550.32 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  17820. 550.32 s [algebraic-graphs] OK: vertex 1 < vertex 2
  17821. 550.32 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  17822. 550.32 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  17823. 550.32 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  17824. 550.32 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  17825. 550.32 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  17826. 550.32 s [algebraic-graphs] OK: x <= x + y
  17827. 550.32 s [algebraic-graphs] OK: x + y <= x * y
  17828. 550.32 s [algebraic-graphs]
  17829. 550.32 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  17830. 550.32 s [algebraic-graphs] OK: isEmpty empty == True
  17831. 550.32 s [algebraic-graphs] OK: hasVertex x empty == False
  17832. 550.32 s [algebraic-graphs] OK: vertexCount empty == 0
  17833. 550.32 s [algebraic-graphs] OK: edgeCount empty == 0
  17834. 550.32 s [algebraic-graphs]
  17835. 550.32 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  17836. 550.32 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17837. 550.32 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17838. 550.32 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17839. 550.32 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17840. 550.32 s [algebraic-graphs]
  17841. 550.32 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  17842. 550.32 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  17843. 550.32 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17844. 550.32 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17845. 550.32 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  17846. 550.32 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  17847. 550.32 s [algebraic-graphs]
  17848. 550.32 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  17849. 550.32 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  17850. 550.32 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  17851. 550.32 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  17852. 550.32 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  17853. 550.32 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  17854. 550.32 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  17855. 550.32 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  17856. 550.32 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  17857. 550.32 s [algebraic-graphs]
  17858. 550.32 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  17859. 550.32 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  17860. 550.32 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  17861. 550.32 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  17862. 550.32 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  17863. 550.32 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  17864. 550.32 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  17865. 550.32 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  17866. 550.32 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  17867. 550.32 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  17868. 550.32 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  17869. 550.32 s [algebraic-graphs]
  17870. 550.32 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  17871. 550.32 s [algebraic-graphs] OK: vertices [] == empty
  17872. 550.32 s [algebraic-graphs] OK: vertices [x] == vertex x
  17873. 550.32 s [algebraic-graphs] OK: vertices == overlays . map vertex
  17874. 550.32 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17875. 550.32 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17876. 550.32 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17877. 550.32 s [algebraic-graphs]
  17878. 550.32 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  17879. 550.32 s [algebraic-graphs] OK: edges [] == empty
  17880. 550.32 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  17881. 550.32 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  17882. 550.32 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  17883. 550.32 s [algebraic-graphs]
  17884. 550.32 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  17885. 550.32 s [algebraic-graphs] OK: overlays [] == empty
  17886. 550.32 s [algebraic-graphs] OK: overlays [x] == x
  17887. 550.32 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  17888. 550.32 s [algebraic-graphs] OK: overlays == foldr overlay empty
  17889. 550.32 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  17890. 550.32 s [algebraic-graphs]
  17891. 550.32 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  17892. 550.32 s [algebraic-graphs] OK: connects [] == empty
  17893. 550.32 s [algebraic-graphs] OK: connects [x] == x
  17894. 550.32 s [algebraic-graphs] OK: connects [x,y] == connect x y
  17895. 550.32 s [algebraic-graphs] OK: connects == foldr connect empty
  17896. 550.32 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  17897. 550.32 s [algebraic-graphs]
  17898. 550.32 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  17899. 550.32 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  17900. 550.32 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  17901. 550.32 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  17902. 550.32 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  17903. 550.32 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  17904. 550.32 s [algebraic-graphs]
  17905. 550.32 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  17906. 550.32 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17907. 550.32 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17908. 550.32 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  17909. 550.32 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  17910. 550.32 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  17911. 550.32 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17912. 550.32 s [algebraic-graphs]
  17913. 550.32 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  17914. 550.32 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  17915. 550.32 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  17916. 550.32 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  17917. 550.32 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  17918. 550.32 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  17919. 550.32 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  17920. 550.32 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  17921. 550.32 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  17922. 550.32 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  17923. 550.32 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  17924. 550.32 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  17925. 550.32 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  17926. 550.32 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  17927. 550.32 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  17928. 550.32 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  17929. 550.32 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  17930. 550.32 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  17931. 550.32 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  17932. 550.32 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  17933. 550.32 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  17934. 550.32 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  17935. 550.32 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  17936. 550.32 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  17937. 550.32 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  17938. 550.32 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  17939. 550.32 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  17940. 550.32 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  17941. 550.32 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  17942. 550.32 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17943. 550.32 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  17944. 550.32 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  17945. 550.32 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  17946. 550.32 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  17947. 551.80 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  17948. 551.80 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17949. 551.80 s [algebraic-graphs]
  17950. 551.80 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  17951. 551.80 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  17952. 551.80 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  17953. 551.80 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  17954. 551.80 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  17955. 551.80 s [algebraic-graphs]
  17956. 551.80 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  17957. 551.80 s [algebraic-graphs] OK: isEmpty empty == True
  17958. 551.80 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  17959. 551.80 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17960. 551.80 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17961. 551.80 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  17962. 551.80 s [algebraic-graphs]
  17963. 551.80 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  17964. 551.80 s [algebraic-graphs] OK: hasVertex x empty == False
  17965. 551.80 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17966. 551.80 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17967. 551.80 s [algebraic-graphs]
  17968. 551.80 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  17969. 551.80 s [algebraic-graphs] OK: hasEdge x y empty == False
  17970. 551.80 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17971. 551.80 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17972. 551.80 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17973. 551.80 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17974. 551.80 s [algebraic-graphs]
  17975. 551.80 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  17976. 551.80 s [algebraic-graphs] OK: vertexCount empty == 0
  17977. 551.80 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17978. 551.80 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17979. 551.80 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17980. 551.80 s [algebraic-graphs]
  17981. 551.80 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  17982. 551.80 s [algebraic-graphs] OK: edgeCount empty == 0
  17983. 551.80 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17984. 551.80 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17985. 551.80 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17986. 551.80 s [algebraic-graphs]
  17987. 551.80 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  17988. 551.80 s [algebraic-graphs] OK: vertexList empty == []
  17989. 551.80 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17990. 551.80 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17991. 551.80 s [algebraic-graphs]
  17992. 551.80 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  17993. 551.80 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17994. 551.80 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17995. 551.80 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17996. 551.80 s [algebraic-graphs]
  17997. 551.80 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  17998. 551.80 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  17999. 551.80 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  18000. 551.80 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  18001. 551.80 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  18002. 551.80 s [algebraic-graphs]
  18003. 551.80 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  18004. 551.80 s [algebraic-graphs] OK: edgeList empty == []
  18005. 551.80 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18006. 551.80 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  18007. 551.80 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  18008. 551.80 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  18009. 551.80 s [algebraic-graphs]
  18010. 551.80 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  18011. 551.80 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  18012. 551.80 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18013. 551.80 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  18014. 551.80 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  18015. 551.80 s [algebraic-graphs]
  18016. 551.80 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  18017. 551.80 s [algebraic-graphs] OK: adjacencyList empty == []
  18018. 551.80 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  18019. 551.80 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  18020. 551.80 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  18021. 551.80 s [algebraic-graphs]
  18022. 551.80 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  18023. 551.80 s [algebraic-graphs] OK: preSet x empty == Set.empty
  18024. 551.80 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  18025. 551.80 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  18026. 551.80 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  18027. 551.80 s [algebraic-graphs]
  18028. 551.80 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  18029. 551.80 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  18030. 551.80 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  18031. 551.80 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  18032. 551.80 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  18033. 551.80 s [algebraic-graphs]
  18034. 551.80 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  18035. 551.80 s [algebraic-graphs] OK: postSet x empty == Set.empty
  18036. 551.80 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  18037. 551.80 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  18038. 551.80 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  18039. 551.80 s [algebraic-graphs]
  18040. 551.80 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  18041. 551.80 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  18042. 551.80 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  18043. 551.80 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  18044. 551.80 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  18045. 551.80 s [algebraic-graphs]
  18046. 551.80 s [algebraic-graphs] ============ AdjacencyMap.path ============
  18047. 551.80 s [algebraic-graphs] OK: path [] == empty
  18048. 551.80 s [algebraic-graphs] OK: path [x] == vertex x
  18049. 551.80 s [algebraic-graphs] OK: path [x,y] == edge x y
  18050. 551.80 s [algebraic-graphs]
  18051. 551.80 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  18052. 551.80 s [algebraic-graphs] OK: circuit [] == empty
  18053. 551.80 s [algebraic-graphs] OK: circuit [x] == edge x x
  18054. 551.80 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  18055. 551.80 s [algebraic-graphs]
  18056. 551.80 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  18057. 551.80 s [algebraic-graphs] OK: clique [] == empty
  18058. 551.80 s [algebraic-graphs] OK: clique [x] == vertex x
  18059. 551.80 s [algebraic-graphs] OK: clique [x,y] == edge x y
  18060. 551.80 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  18061. 551.80 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  18062. 551.80 s [algebraic-graphs]
  18063. 551.80 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  18064. 551.80 s [algebraic-graphs] OK: biclique [] [] == empty
  18065. 551.80 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  18066. 551.80 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  18067. 551.80 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  18068. 551.80 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  18069. 551.80 s [algebraic-graphs]
  18070. 551.80 s [algebraic-graphs] ============ AdjacencyMap.star ============
  18071. 551.80 s [algebraic-graphs] OK: star x [] == vertex x
  18072. 551.80 s [algebraic-graphs] OK: star x [y] == edge x y
  18073. 551.80 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18074. 551.80 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  18075. 551.80 s [algebraic-graphs]
  18076. 551.80 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  18077. 551.80 s [algebraic-graphs] OK: stars [] == empty
  18078. 551.80 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  18079. 551.80 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  18080. 551.80 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  18081. 551.80 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  18082. 551.80 s [algebraic-graphs] OK: stars . adjacencyList == id
  18083. 551.80 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  18084. 551.80 s [algebraic-graphs]
  18085. 551.80 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  18086. 551.80 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  18087. 551.80 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  18088. 551.80 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  18089. 551.80 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  18090. 551.80 s [algebraic-graphs]
  18091. 551.80 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  18092. 551.80 s [algebraic-graphs] OK: forest [] == empty
  18093. 551.80 s [algebraic-graphs] OK: forest [x] == tree x
  18094. 551.80 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  18095. 551.80 s [algebraic-graphs] OK: forest == overlays . map tree
  18096. 551.80 s [algebraic-graphs]
  18097. 551.80 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  18098. 551.80 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  18099. 551.80 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  18100. 551.80 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  18101. 551.80 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  18102. 551.80 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  18103. 551.80 s [algebraic-graphs]
  18104. 551.80 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  18105. 551.80 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  18106. 551.80 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18107. 551.80 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  18108. 551.80 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  18109. 551.80 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  18110. 551.80 s [algebraic-graphs]
  18111. 551.80 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  18112. 551.80 s [algebraic-graphs] OK: replaceVertex x x == id
  18113. 551.80 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  18114. 551.80 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  18115. 551.80 s [algebraic-graphs]
  18116. 551.80 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  18117. 551.80 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  18118. 551.80 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  18119. 551.80 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  18120. 551.80 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  18121. 551.80 s [algebraic-graphs]
  18122. 551.80 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  18123. 551.80 s [algebraic-graphs] OK: transpose empty == empty
  18124. 551.80 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  18125. 551.80 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  18126. 551.80 s [algebraic-graphs] OK: transpose . transpose == id
  18127. 551.80 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  18128. 551.80 s [algebraic-graphs]
  18129. 551.80 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  18130. 551.80 s [algebraic-graphs] OK: gmap f empty == empty
  18131. 551.80 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  18132. 551.80 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  18133. 551.80 s [algebraic-graphs] OK: gmap id == id
  18134. 551.80 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  18135. 551.80 s [algebraic-graphs]
  18136. 551.80 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  18137. 551.80 s [algebraic-graphs] OK: induce (const True ) x == x
  18138. 551.80 s [algebraic-graphs] OK: induce (const False) x == empty
  18139. 551.80 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  18140. 551.80 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  18141. 551.80 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  18142. 551.80 s [algebraic-graphs]
  18143. 551.80 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  18144. 551.80 s [algebraic-graphs] OK: compose empty x == empty
  18145. 551.80 s [algebraic-graphs] OK: compose x empty == empty
  18146. 551.80 s [algebraic-graphs] OK: compose (vertex x) y == empty
  18147. 551.80 s [algebraic-graphs] OK: compose x (vertex y) == empty
  18148. 551.80 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  18149. 551.80 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  18150. 554.50 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  18151. 554.50 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  18152. 554.50 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  18153. 554.50 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  18154. 554.50 s [algebraic-graphs]
  18155. 554.50 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  18156. 554.50 s [algebraic-graphs] OK: closure empty == empty
  18157. 554.50 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  18158. 554.50 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  18159. 554.50 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  18160. 554.50 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  18161. 554.50 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  18162. 554.50 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  18163. 554.50 s [algebraic-graphs] OK: closure . closure == closure
  18164. 554.50 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  18165. 554.50 s [algebraic-graphs]
  18166. 554.50 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  18167. 554.50 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  18168. 554.50 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  18169. 554.50 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  18170. 554.50 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  18171. 554.50 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  18172. 554.50 s [algebraic-graphs]
  18173. 554.50 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  18174. 554.50 s [algebraic-graphs] OK: symmetricClosure empty == empty
  18175. 554.50 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  18176. 554.50 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  18177. 554.50 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  18178. 554.50 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  18179. 554.50 s [algebraic-graphs]
  18180. 554.50 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  18181. 554.50 s [algebraic-graphs] OK: transitiveClosure empty == empty
  18182. 554.50 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  18183. 554.50 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  18184. 554.50 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  18185. 554.50 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  18186. 554.50 s [algebraic-graphs]
  18187. 554.50 s [algebraic-graphs] ============ AdjacencyMap.box ============
  18188. 554.50 s [algebraic-graphs] OK: box x y ~~ box y x
  18189. 554.50 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  18190. 554.50 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  18191. 554.50 s [algebraic-graphs] OK: box x empty ~~ empty
  18192. 554.50 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18193. 554.50 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  18194. 554.50 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  18195. 554.50 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  18196. 554.50 s [algebraic-graphs]
  18197. 554.50 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  18198. 554.50 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  18199. 554.50 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  18200. 554.50 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  18201. 554.50 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  18202. 554.50 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  18203. 554.50 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  18204. 554.50 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  18205. 554.50 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  18206. 554.50 s [algebraic-graphs] OK: bfsForest x [] == []
  18207. 554.50 s [algebraic-graphs] OK: bfsForest empty vs == []
  18208. 554.50 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  18209. 554.50 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  18210. 554.50 s [algebraic-graphs]
  18211. 554.50 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  18212. 554.50 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  18213. 554.50 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  18214. 554.50 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  18215. 554.50 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  18216. 554.50 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  18217. 554.50 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  18218. 554.50 s [algebraic-graphs] OK: bfs empty vs == []
  18219. 554.50 s [algebraic-graphs] OK: bfs x [] == []
  18220. 554.50 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  18221. 554.50 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  18222. 554.50 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  18223. 554.50 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  18224. 554.50 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  18225. 554.50 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  18226. 554.50 s [algebraic-graphs]
  18227. 554.50 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  18228. 554.50 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  18229. 554.50 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  18230. 554.50 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  18231. 554.50 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  18232. 554.50 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  18233. 554.50 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  18234. 554.50 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  18235. 554.50 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  18236. 554.50 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  18237. 554.50 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  18238. 554.50 s [algebraic-graphs]
  18239. 554.50 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  18240. 554.50 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  18241. 554.50 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  18242. 554.50 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  18243. 554.50 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  18244. 554.50 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  18245. 554.50 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  18246. 554.50 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  18247. 554.50 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  18248. 554.50 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  18249. 554.50 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  18250. 554.50 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  18251. 554.50 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  18252. 554.50 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  18253. 554.50 s [algebraic-graphs]
  18254. 554.50 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  18255. 554.50 s [algebraic-graphs] OK: dfs empty vs == []
  18256. 554.50 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  18257. 554.50 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  18258. 554.50 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  18259. 554.50 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  18260. 554.50 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  18261. 554.50 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  18262. 554.50 s [algebraic-graphs] OK: dfs x [] == []
  18263. 554.50 s [algebraic-graphs]
  18264. 554.50 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  18265. 554.50 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  18266. 554.50 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  18267. 554.50 s [algebraic-graphs]
  18268. 554.50 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  18269. 554.50 s [algebraic-graphs] OK: reachable empty x == []
  18270. 554.51 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  18271. 554.51 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  18272. 554.51 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  18273. 554.51 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  18274. 554.51 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  18275. 554.51 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  18276. 554.51 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  18277. 554.51 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  18278. 554.51 s [algebraic-graphs]
  18279. 554.51 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  18280. 554.51 s [algebraic-graphs]
  18281. 554.51 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  18282. 554.51 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  18283. 554.51 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  18284. 554.51 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  18285. 554.51 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  18286. 554.51 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  18287. 554.51 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  18288. 554.51 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  18289. 554.51 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  18290. 554.51 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  18291. 554.51 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  18292. 554.51 s [algebraic-graphs]
  18293. 554.51 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  18294. 554.51 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  18295. 554.51 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  18296. 554.51 s [algebraic-graphs] OK: isAcyclic . circuit == null
  18297. 554.51 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  18298. 554.51 s [algebraic-graphs]
  18299. 554.51 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  18300. 554.51 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  18301. 554.51 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  18302. 554.51 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  18303. 554.51 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  18304. 554.51 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  18305. 554.51 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  18306. 554.51 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  18307. 562.67 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  18308. 562.67 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  18309. 562.71 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  18310. 562.71 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  18311. 562.71 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  18312. 562.71 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  18313. 562.71 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  18314. 562.71 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  18315. 562.71 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  18316. 562.71 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  18317. 562.71 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  18318. 562.71 s [algebraic-graphs]
  18319. 562.71 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  18320. 562.71 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  18321. 562.71 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  18322. 562.71 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  18323. 562.71 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  18324. 562.71 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  18325. 562.71 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  18326. 562.71 s [algebraic-graphs]
  18327. 562.71 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  18328. 562.71 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  18329. 562.71 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  18330. 562.71 s [algebraic-graphs] OK: induceJust . gmap Just == id
  18331. 562.71 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  18332. 562.71 s [algebraic-graphs]
  18333. 562.71 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  18334. 562.71 s [algebraic-graphs] OK: scc empty == empty
  18335. 562.71 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  18336. 562.71 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  18337. 562.71 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  18338. 562.71 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  18339. 562.71 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  18340. 562.71 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  18341. 562.71 s [algebraic-graphs] OK: isAcyclic . scc == const True
  18342. 562.71 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  18343. 562.71 s [algebraic-graphs] OK: scc g == KL.scc g
  18344. 562.71 s [algebraic-graphs]
  18345. 562.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  18346. 562.71 s [algebraic-graphs] OK: 0 == rightVertex 0
  18347. 562.71 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  18348. 562.71 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  18349. 562.71 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  18350. 562.71 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  18351. 562.71 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  18352. 562.71 s [algebraic-graphs]
  18353. 562.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  18354. 562.71 s [algebraic-graphs] OK: show empty == "empty"
  18355. 562.71 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  18356. 562.71 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  18357. 562.71 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  18358. 562.71 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  18359. 562.71 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  18360. 562.71 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  18361. 562.71 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  18362. 562.71 s [algebraic-graphs]
  18363. 562.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  18364. 562.71 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  18365. 562.71 s [algebraic-graphs]
  18366. 562.71 s [algebraic-graphs] OK: x + y == y + x
  18367. 562.71 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  18368. 562.71 s [algebraic-graphs] OK: x * empty == x
  18369. 562.71 s [algebraic-graphs] OK: empty * x == x
  18370. 562.71 s [algebraic-graphs] OK: x * y == y * x
  18371. 562.71 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  18372. 562.71 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  18373. 562.71 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  18374. 562.71 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  18375. 562.71 s [algebraic-graphs] OK: x + empty == x
  18376. 562.71 s [algebraic-graphs] OK: empty + x == x
  18377. 562.71 s [algebraic-graphs] OK: x + x == x
  18378. 562.71 s [algebraic-graphs] OK: x * y + x + y == x * y
  18379. 562.71 s [algebraic-graphs] OK: x * x * x == x * x
  18380. 562.71 s [algebraic-graphs]
  18381. 562.71 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  18382. 562.71 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  18383. 562.71 s [algebraic-graphs]
  18384. 562.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  18385. 562.71 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  18386. 562.71 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  18387. 562.71 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  18388. 562.71 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  18389. 562.71 s [algebraic-graphs]
  18390. 562.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  18391. 562.71 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  18392. 562.71 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  18393. 562.71 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  18394. 562.71 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  18395. 562.71 s [algebraic-graphs]
  18396. 562.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  18397. 562.71 s [algebraic-graphs] OK: isEmpty empty == True
  18398. 562.71 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  18399. 562.71 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  18400. 562.71 s [algebraic-graphs] OK: hasVertex x empty == False
  18401. 562.71 s [algebraic-graphs]
  18402. 562.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  18403. 562.71 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  18404. 562.71 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  18405. 562.71 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  18406. 562.71 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  18407. 562.71 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  18408. 562.71 s [algebraic-graphs]
  18409. 562.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  18410. 562.71 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  18411. 562.71 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  18412. 562.71 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  18413. 562.71 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  18414. 562.71 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  18415. 562.71 s [algebraic-graphs]
  18416. 562.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  18417. 562.71 s [algebraic-graphs] OK: vertex . Left == leftVertex
  18418. 562.71 s [algebraic-graphs] OK: vertex . Right == rightVertex
  18419. 562.71 s [algebraic-graphs]
  18420. 562.71 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  18421. 562.71 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  18422. 562.71 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  18423. 562.71 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  18424. 562.71 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18425. 562.71 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  18426. 562.72 s [algebraic-graphs]
  18427. 562.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  18428. 562.72 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  18429. 562.72 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18430. 562.72 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18431. 562.72 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18432. 562.72 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18433. 562.72 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18434. 562.72 s [algebraic-graphs]
  18435. 562.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  18436. 562.72 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  18437. 562.72 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  18438. 562.72 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  18439. 562.72 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  18440. 562.72 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  18441. 562.72 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  18442. 562.72 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  18443. 562.72 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  18444. 562.72 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  18445. 562.72 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  18446. 562.72 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  18447. 562.72 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  18448. 562.72 s [algebraic-graphs]
  18449. 562.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  18450. 562.72 s [algebraic-graphs] OK: vertices [] [] == empty
  18451. 562.72 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  18452. 562.72 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  18453. 562.72 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  18454. 562.72 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  18455. 562.72 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  18456. 562.72 s [algebraic-graphs]
  18457. 562.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  18458. 562.72 s [algebraic-graphs] OK: edges [] == empty
  18459. 562.72 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  18460. 562.72 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  18461. 562.72 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  18462. 562.72 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18463. 562.72 s [algebraic-graphs]
  18464. 562.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  18465. 562.72 s [algebraic-graphs] OK: overlays [] == empty
  18466. 562.72 s [algebraic-graphs] OK: overlays [x] == x
  18467. 562.72 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  18468. 562.72 s [algebraic-graphs] OK: overlays == foldr overlay empty
  18469. 562.72 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  18470. 562.72 s [algebraic-graphs]
  18471. 562.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  18472. 562.72 s [algebraic-graphs] OK: connects [] == empty
  18473. 562.72 s [algebraic-graphs] OK: connects [x] == x
  18474. 562.72 s [algebraic-graphs] OK: connects [x,y] == connect x y
  18475. 562.72 s [algebraic-graphs] OK: connects == foldr connect empty
  18476. 562.72 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  18477. 562.72 s [algebraic-graphs]
  18478. 562.72 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  18479. 564.47 s [algebraic-graphs] OK: swap empty == empty
  18480. 564.47 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  18481. 564.47 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  18482. 564.47 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  18483. 564.47 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  18484. 564.47 s [algebraic-graphs] OK: swap . swap == id
  18485. 564.47 s [algebraic-graphs]
  18486. 564.47 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  18487. 564.47 s [algebraic-graphs] OK: toBipartite empty == empty
  18488. 564.47 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  18489. 564.47 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  18490. 564.47 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  18491. 564.47 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  18492. 564.47 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  18493. 564.47 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  18494. 564.47 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  18495. 564.47 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  18496. 564.47 s [algebraic-graphs]
  18497. 564.47 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  18498. 564.47 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  18499. 564.47 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  18500. 564.47 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  18501. 564.47 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  18502. 564.48 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  18503. 564.48 s [algebraic-graphs]
  18504. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  18505. 564.48 s [algebraic-graphs] OK: fromBipartite empty == empty
  18506. 564.48 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  18507. 564.48 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  18508. 564.48 s [algebraic-graphs]
  18509. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  18510. 564.48 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  18511. 564.48 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  18512. 564.48 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  18513. 564.48 s [algebraic-graphs]
  18514. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  18515. 564.48 s [algebraic-graphs] OK: isEmpty empty == True
  18516. 564.48 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  18517. 564.48 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18518. 564.48 s [algebraic-graphs] OK: isEmpty == (==) empty
  18519. 564.48 s [algebraic-graphs]
  18520. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  18521. 564.48 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  18522. 564.48 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  18523. 564.48 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  18524. 564.48 s [algebraic-graphs]
  18525. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  18526. 564.48 s [algebraic-graphs] OK: hasRightVertex x empty == False
  18527. 564.48 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  18528. 564.48 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  18529. 564.48 s [algebraic-graphs]
  18530. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  18531. 564.48 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  18532. 564.48 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  18533. 564.48 s [algebraic-graphs]
  18534. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  18535. 564.48 s [algebraic-graphs] OK: hasEdge x y empty == False
  18536. 564.48 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  18537. 564.48 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18538. 564.48 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  18539. 564.48 s [algebraic-graphs]
  18540. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  18541. 564.48 s [algebraic-graphs] OK: leftVertexCount empty == 0
  18542. 564.48 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  18543. 564.48 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  18544. 564.48 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  18545. 564.48 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  18546. 564.48 s [algebraic-graphs]
  18547. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  18548. 564.48 s [algebraic-graphs] OK: rightVertexCount empty == 0
  18549. 564.48 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  18550. 564.48 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  18551. 564.48 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  18552. 564.48 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  18553. 564.48 s [algebraic-graphs]
  18554. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  18555. 564.48 s [algebraic-graphs] OK: vertexCount empty == 0
  18556. 564.48 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18557. 564.48 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  18558. 564.48 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  18559. 564.48 s [algebraic-graphs]
  18560. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  18561. 564.48 s [algebraic-graphs] OK: edgeCount empty == 0
  18562. 564.48 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18563. 564.48 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18564. 564.48 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18565. 564.48 s [algebraic-graphs]
  18566. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  18567. 564.48 s [algebraic-graphs] OK: leftVertexList empty == []
  18568. 564.48 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  18569. 564.48 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  18570. 564.48 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  18571. 564.48 s [algebraic-graphs]
  18572. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  18573. 564.48 s [algebraic-graphs] OK: rightVertexList empty == []
  18574. 564.48 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  18575. 564.48 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  18576. 564.48 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  18577. 564.48 s [algebraic-graphs]
  18578. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  18579. 564.48 s [algebraic-graphs] OK: vertexList empty == []
  18580. 564.48 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  18581. 564.48 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  18582. 564.48 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  18583. 564.48 s [algebraic-graphs]
  18584. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  18585. 564.48 s [algebraic-graphs] OK: edgeList empty == []
  18586. 564.48 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18587. 564.48 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  18588. 564.48 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  18589. 564.48 s [algebraic-graphs]
  18590. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  18591. 564.48 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  18592. 564.48 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  18593. 564.48 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  18594. 564.48 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  18595. 564.48 s [algebraic-graphs]
  18596. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  18597. 564.48 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  18598. 564.48 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  18599. 564.48 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  18600. 564.48 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  18601. 564.48 s [algebraic-graphs]
  18602. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  18603. 564.48 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  18604. 564.48 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  18605. 564.48 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  18606. 564.48 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  18607. 564.48 s [algebraic-graphs]
  18608. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  18609. 564.48 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  18610. 564.48 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18611. 564.48 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  18612. 564.48 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  18613. 564.48 s [algebraic-graphs]
  18614. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  18615. 564.48 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  18616. 564.48 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  18617. 564.48 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  18618. 564.48 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  18619. 564.48 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  18620. 564.48 s [algebraic-graphs]
  18621. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  18622. 564.48 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  18623. 564.48 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  18624. 564.48 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  18625. 564.48 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  18626. 564.48 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  18627. 564.48 s [algebraic-graphs]
  18628. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  18629. 564.48 s [algebraic-graphs] OK: evenList [] == Nil
  18630. 564.48 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  18631. 564.48 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  18632. 564.48 s [algebraic-graphs]
  18633. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  18634. 564.48 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  18635. 564.48 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  18636. 564.48 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  18637. 564.48 s [algebraic-graphs]
  18638. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  18639. 564.48 s [algebraic-graphs] OK: path Nil == empty
  18640. 564.48 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  18641. 564.48 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  18642. 564.48 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  18643. 564.48 s [algebraic-graphs]
  18644. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  18645. 564.48 s [algebraic-graphs] OK: circuit [] == empty
  18646. 564.48 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  18647. 564.48 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  18648. 564.48 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  18649. 564.48 s [algebraic-graphs]
  18650. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  18651. 564.48 s [algebraic-graphs] OK: biclique [] [] == empty
  18652. 564.48 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  18653. 564.48 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  18654. 564.48 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  18655. 564.48 s [algebraic-graphs]
  18656. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  18657. 564.48 s [algebraic-graphs] OK: star x [] == leftVertex x
  18658. 564.48 s [algebraic-graphs] OK: star x [y] == edge x y
  18659. 564.48 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18660. 564.48 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  18661. 564.48 s [algebraic-graphs]
  18662. 564.48 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  18663. 564.48 s [algebraic-graphs] OK: stars [] == empty
  18664. 564.48 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  18665. 564.48 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  18666. 564.48 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  18667. 579.91 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18668. 579.95 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  18669. 579.95 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  18670. 579.95 s [algebraic-graphs]
  18671. 579.95 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  18672. 579.95 s [algebraic-graphs] OK: mesh xs [] == empty
  18673. 579.95 s [algebraic-graphs] OK: mesh [] ys == empty
  18674. 579.95 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  18675. 579.95 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  18676. 579.95 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  18677. 579.95 s [algebraic-graphs]
  18678. 579.95 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  18679. 579.95 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  18680. 579.95 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  18681. 579.95 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  18682. 579.95 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  18683. 579.95 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  18684. 579.95 s [algebraic-graphs]
  18685. 579.95 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  18686. 579.95 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  18687. 579.95 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  18688. 579.95 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  18689. 579.95 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  18690. 579.95 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  18691. 579.95 s [algebraic-graphs]
  18692. 579.95 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  18693. 579.95 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  18694. 579.95 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18695. 579.95 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  18696. 579.95 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  18697. 579.95 s [algebraic-graphs]
  18698. 579.95 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  18699. 579.95 s [algebraic-graphs] OK: bimap f g empty == empty
  18700. 579.95 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  18701. 579.95 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  18702. 579.95 s [algebraic-graphs] OK: bimap id id == id
  18703. 579.95 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  18704. 579.95 s [algebraic-graphs]
  18705. 579.95 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  18706. 579.95 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  18707. 579.96 s [algebraic-graphs]
  18708. 579.96 s [algebraic-graphs] OK: box x y ~~ box y x
  18709. 579.96 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18710. 579.96 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18711. 579.96 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  18712. 579.96 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  18713. 579.96 s [algebraic-graphs] OK: box x empty ~~ empty
  18714. 579.96 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  18715. 579.96 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  18716. 579.96 s [algebraic-graphs]
  18717. 579.96 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  18718. 579.96 s [algebraic-graphs]
  18719. 579.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  18720. 579.96 s [algebraic-graphs] OK: consistent empty == True
  18721. 579.96 s [algebraic-graphs] OK: consistent (vertex x) == True
  18722. 579.96 s [algebraic-graphs] OK: consistent (edge x y) == True
  18723. 579.96 s [algebraic-graphs] OK: consistent (edges x) == True
  18724. 579.96 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  18725. 579.96 s [algebraic-graphs] OK: consistent (swap x) == True
  18726. 579.96 s [algebraic-graphs] OK: consistent (circuit xs) == True
  18727. 579.96 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  18728. 579.96 s [algebraic-graphs]
  18729. 579.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  18730. 579.96 s [algebraic-graphs] OK: detectParts empty == Right empty
  18731. 579.96 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  18732. 579.96 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  18733. 579.96 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  18734. 579.96 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  18735. 579.96 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  18736. 579.96 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  18737. 579.96 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  18738. 579.96 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  18739. 579.96 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  18740. 579.96 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  18741. 579.96 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  18742. 579.96 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  18743. 579.96 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  18744. 579.96 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  18745. 579.96 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  18746. 579.96 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  18747. 579.96 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  18748. 579.96 s [algebraic-graphs]
  18749. 579.96 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  18750. 579.96 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  18751. 579.96 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  18752. 579.96 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  18753. 579.96 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  18754. 579.96 s [algebraic-graphs]
  18755. 579.96 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  18756. 579.96 s [algebraic-graphs] OK: show (matching []) == "matching []"
  18757. 579.96 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  18758. 579.96 s [algebraic-graphs]
  18759. 579.96 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  18760. 579.96 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  18761. 579.96 s [algebraic-graphs]
  18762. 579.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  18763. 579.96 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  18764. 579.96 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  18765. 579.96 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  18766. 579.96 s [algebraic-graphs]
  18767. 579.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  18768. 579.96 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  18769. 579.96 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  18770. 579.96 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  18771. 579.96 s [algebraic-graphs]
  18772. 579.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  18773. 579.96 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  18774. 579.96 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  18775. 579.96 s [algebraic-graphs]
  18776. 579.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  18777. 579.96 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  18778. 579.96 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  18779. 579.96 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  18780. 579.96 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  18781. 579.96 s [algebraic-graphs]
  18782. 579.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  18783. 579.96 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  18784. 579.96 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  18785. 579.96 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  18786. 579.96 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  18787. 579.96 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  18788. 579.96 s [algebraic-graphs]
  18789. 579.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  18790. 579.96 s [algebraic-graphs] OK: maxMatching empty == matching []
  18791. 579.96 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  18792. 579.96 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  18793. 579.96 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  18794. 579.96 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  18795. 579.96 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  18796. 579.96 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  18797. 579.96 s [algebraic-graphs]
  18798. 579.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  18799. 579.96 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  18800. 579.96 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  18801. 579.96 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  18802. 579.96 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  18803. 579.96 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  18804. 579.96 s [algebraic-graphs]
  18805. 579.96 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  18806. 579.96 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  18807. 582.21 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  18808. 582.21 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  18809. 582.21 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  18810. 582.21 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  18811. 582.21 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  18812. 582.21 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  18813. 582.21 s [algebraic-graphs]
  18814. 582.21 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  18815. 582.21 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  18816. 582.21 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  18817. 582.21 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  18818. 582.21 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  18819. 582.21 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  18820. 582.21 s [algebraic-graphs]
  18821. 582.21 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  18822. 582.21 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  18823. 582.21 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  18824. 582.21 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  18825. 582.21 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  18826. 582.21 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  18827. 582.21 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  18828. 582.21 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  18829. 582.21 s [algebraic-graphs]
  18830. 582.21 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  18831. 582.21 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  18832. 582.22 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  18833. 582.22 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  18834. 582.22 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  18835. 582.22 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  18836. 582.22 s [algebraic-graphs]
  18837. 582.22 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  18838. 582.22 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  18839. 582.22 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  18840. 582.22 s [algebraic-graphs]
  18841. 582.22 s [algebraic-graphs] ============ Export.Eq ============
  18842. 582.22 s [algebraic-graphs] OK: mempty /= literal ""
  18843. 582.22 s [algebraic-graphs]
  18844. 582.22 s [algebraic-graphs] ============ Export.Ord ============
  18845. 582.22 s [algebraic-graphs] OK: mempty < literal ""
  18846. 582.22 s [algebraic-graphs]
  18847. 582.22 s [algebraic-graphs] ============ Export.isEmpty ============
  18848. 582.22 s [algebraic-graphs] OK: isEmpty mempty == True
  18849. 582.22 s [algebraic-graphs] OK: isEmpty (literal "") == False
  18850. 582.22 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  18851. 582.22 s [algebraic-graphs]
  18852. 582.22 s [algebraic-graphs] ============ Export.literal ============
  18853. 582.22 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  18854. 582.22 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  18855. 582.22 s [algebraic-graphs] OK: render . literal == id
  18856. 582.22 s [algebraic-graphs]
  18857. 582.22 s [algebraic-graphs] ============ Export.render ============
  18858. 582.22 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  18859. 582.22 s [algebraic-graphs] OK: render mempty == mempty
  18860. 582.22 s [algebraic-graphs]
  18861. 582.22 s [algebraic-graphs] ============ Export.<+> ============
  18862. 582.22 s [algebraic-graphs] OK: x <+> mempty == x
  18863. 582.22 s [algebraic-graphs] OK: mempty <+> x == x
  18864. 582.22 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  18865. 582.22 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  18866. 582.22 s [algebraic-graphs]
  18867. 582.22 s [algebraic-graphs] ============ Export.brackets ============
  18868. 582.22 s [algebraic-graphs] OK: brackets "i" == "[i]"
  18869. 582.22 s [algebraic-graphs] OK: brackets mempty == "[]"
  18870. 582.22 s [algebraic-graphs]
  18871. 582.22 s [algebraic-graphs] ============ Export.doubleQuotes ============
  18872. 582.22 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  18873. 582.22 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  18874. 582.22 s [algebraic-graphs]
  18875. 582.22 s [algebraic-graphs] ============ Export.indent ============
  18876. 582.22 s [algebraic-graphs] OK: indent 0 == id
  18877. 582.22 s [algebraic-graphs] OK: indent 1 mempty == " "
  18878. 582.22 s [algebraic-graphs]
  18879. 582.22 s [algebraic-graphs] ============ Export.unlines ============
  18880. 582.22 s [algebraic-graphs] OK: unlines [] == mempty
  18881. 582.22 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  18882. 582.22 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  18883. 582.22 s [algebraic-graphs]
  18884. 582.22 s [algebraic-graphs] ============ Export.export ============
  18885. 582.22 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  18886. 582.22 s [algebraic-graphs]
  18887. 582.22 s [algebraic-graphs] ============ Export.Dot.export ============
  18888. 582.22 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  18889. 582.22 s [algebraic-graphs]
  18890. 582.22 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  18891. 582.22 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  18892. 582.22 s [algebraic-graphs]
  18893. 582.22 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  18894. 582.22 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  18895. 582.22 s [algebraic-graphs]
  18896. 582.22 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  18897. 582.22 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  18898. 582.22 s [algebraic-graphs]
  18899. 582.22 s [algebraic-graphs] ============ Graph ============
  18900. 582.22 s [algebraic-graphs] OK: Axioms of graphs
  18901. 582.22 s [algebraic-graphs] OK: Theorems of graphs
  18902. 582.22 s [algebraic-graphs]
  18903. 582.22 s [algebraic-graphs] ============ Graph.Ord ============
  18904. 582.22 s [algebraic-graphs] OK: vertex 1 < vertex 2
  18905. 582.22 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  18906. 582.22 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  18907. 582.22 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  18908. 582.22 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  18909. 582.22 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  18910. 582.22 s [algebraic-graphs] OK: x <= x + y
  18911. 582.22 s [algebraic-graphs] OK: x + y <= x * y
  18912. 582.22 s [algebraic-graphs]
  18913. 582.22 s [algebraic-graphs] ============ Graph.empty ============
  18914. 582.22 s [algebraic-graphs] OK: isEmpty empty == True
  18915. 582.22 s [algebraic-graphs] OK: hasVertex x empty == False
  18916. 582.22 s [algebraic-graphs] OK: vertexCount empty == 0
  18917. 582.22 s [algebraic-graphs] OK: edgeCount empty == 0
  18918. 582.22 s [algebraic-graphs]
  18919. 582.22 s [algebraic-graphs] ============ Graph.vertex ============
  18920. 582.22 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18921. 582.22 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18922. 582.22 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18923. 582.22 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18924. 582.22 s [algebraic-graphs]
  18925. 582.22 s [algebraic-graphs] ============ Graph.edge ============
  18926. 582.22 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  18927. 582.22 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18928. 582.22 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18929. 582.22 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  18930. 582.22 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  18931. 582.22 s [algebraic-graphs]
  18932. 582.22 s [algebraic-graphs] ============ Graph.overlay ============
  18933. 582.22 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  18934. 582.22 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18935. 582.22 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18936. 582.22 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18937. 582.22 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18938. 582.22 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18939. 582.22 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  18940. 582.22 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  18941. 582.22 s [algebraic-graphs]
  18942. 582.22 s [algebraic-graphs] ============ Graph.connect ============
  18943. 582.22 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  18944. 582.22 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  18945. 582.22 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  18946. 582.22 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  18947. 582.22 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  18948. 582.22 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  18949. 582.22 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  18950. 582.22 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  18951. 582.22 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  18952. 582.22 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  18953. 582.22 s [algebraic-graphs]
  18954. 582.22 s [algebraic-graphs] ============ Graph.vertices ============
  18955. 582.22 s [algebraic-graphs] OK: vertices [] == empty
  18956. 582.22 s [algebraic-graphs] OK: vertices [x] == vertex x
  18957. 582.22 s [algebraic-graphs] OK: vertices == overlays . map vertex
  18958. 582.22 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  18959. 582.22 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  18960. 582.22 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18961. 582.22 s [algebraic-graphs]
  18962. 582.22 s [algebraic-graphs] ============ Graph.edges ============
  18963. 582.22 s [algebraic-graphs] OK: edges [] == empty
  18964. 582.22 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  18965. 582.22 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  18966. 582.22 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18967. 582.22 s [algebraic-graphs]
  18968. 582.22 s [algebraic-graphs] ============ Graph.overlays ============
  18969. 582.22 s [algebraic-graphs] OK: overlays [] == empty
  18970. 582.22 s [algebraic-graphs] OK: overlays [x] == x
  18971. 582.22 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  18972. 582.22 s [algebraic-graphs] OK: overlays == foldr overlay empty
  18973. 582.22 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  18974. 582.22 s [algebraic-graphs]
  18975. 582.22 s [algebraic-graphs] ============ Graph.connects ============
  18976. 582.22 s [algebraic-graphs] OK: connects [] == empty
  18977. 582.22 s [algebraic-graphs] OK: connects [x] == x
  18978. 582.22 s [algebraic-graphs] OK: connects [x,y] == connect x y
  18979. 582.22 s [algebraic-graphs] OK: connects == foldr connect empty
  18980. 582.22 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  18981. 582.22 s [algebraic-graphs]
  18982. 582.22 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  18983. 582.22 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  18984. 582.22 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  18985. 582.22 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  18986. 582.22 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  18987. 582.22 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  18988. 582.22 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  18989. 582.22 s [algebraic-graphs]
  18990. 582.22 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  18991. 582.22 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  18992. 582.22 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  18993. 582.22 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  18994. 582.22 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  18995. 582.22 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  18996. 582.22 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  18997. 582.22 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  18998. 582.22 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  18999. 582.22 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  19000. 582.94 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  19001. 582.94 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  19002. 582.94 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  19003. 582.94 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  19004. 582.94 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  19005. 582.94 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  19006. 582.94 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  19007. 582.94 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  19008. 582.94 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  19009. 582.94 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  19010. 582.94 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  19011. 582.94 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  19012. 582.95 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  19013. 582.95 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  19014. 582.95 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  19015. 582.95 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  19016. 582.95 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  19017. 582.95 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  19018. 582.95 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  19019. 582.95 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19020. 582.95 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  19021. 582.95 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  19022. 582.95 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  19023. 582.95 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  19024. 582.95 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  19025. 582.95 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19026. 582.95 s [algebraic-graphs]
  19027. 582.95 s [algebraic-graphs] ============ Graph.foldg ============
  19028. 582.95 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  19029. 582.95 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  19030. 582.95 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  19031. 582.95 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  19032. 582.95 s [algebraic-graphs]
  19033. 582.95 s [algebraic-graphs] ============ Graph.isEmpty ============
  19034. 582.95 s [algebraic-graphs] OK: isEmpty empty == True
  19035. 582.95 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19036. 582.95 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19037. 582.95 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19038. 582.95 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  19039. 582.95 s [algebraic-graphs]
  19040. 582.95 s [algebraic-graphs] ============ Graph.hasVertex ============
  19041. 582.95 s [algebraic-graphs] OK: hasVertex x empty == False
  19042. 582.95 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19043. 582.95 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19044. 582.95 s [algebraic-graphs]
  19045. 582.95 s [algebraic-graphs] ============ Graph.hasEdge ============
  19046. 582.95 s [algebraic-graphs] OK: hasEdge x y empty == False
  19047. 582.95 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19048. 582.95 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19049. 582.95 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19050. 582.95 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19051. 582.95 s [algebraic-graphs]
  19052. 582.95 s [algebraic-graphs] ============ Graph.vertexCount ============
  19053. 582.95 s [algebraic-graphs] OK: vertexCount empty == 0
  19054. 582.95 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19055. 582.95 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19056. 582.95 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19057. 582.95 s [algebraic-graphs]
  19058. 582.95 s [algebraic-graphs] ============ Graph.edgeCount ============
  19059. 582.95 s [algebraic-graphs] OK: edgeCount empty == 0
  19060. 582.95 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19061. 582.95 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19062. 582.95 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19063. 582.95 s [algebraic-graphs]
  19064. 582.95 s [algebraic-graphs] ============ Graph.vertexList ============
  19065. 582.95 s [algebraic-graphs] OK: vertexList empty == []
  19066. 582.95 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19067. 582.95 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19068. 582.95 s [algebraic-graphs]
  19069. 582.95 s [algebraic-graphs] ============ Graph.vertexSet ============
  19070. 582.95 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19071. 582.95 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19072. 582.95 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19073. 582.95 s [algebraic-graphs]
  19074. 582.95 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  19075. 582.95 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  19076. 582.95 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  19077. 582.95 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  19078. 582.95 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  19079. 582.95 s [algebraic-graphs]
  19080. 582.95 s [algebraic-graphs] ============ Graph.edgeList ============
  19081. 582.95 s [algebraic-graphs] OK: edgeList empty == []
  19082. 582.95 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19083. 582.95 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  19084. 582.95 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  19085. 582.95 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  19086. 582.95 s [algebraic-graphs]
  19087. 582.95 s [algebraic-graphs] ============ Graph.edgeSet ============
  19088. 582.95 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19089. 582.95 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19090. 582.95 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  19091. 582.95 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  19092. 582.95 s [algebraic-graphs]
  19093. 582.95 s [algebraic-graphs] ============ Graph.adjacencyList ============
  19094. 582.95 s [algebraic-graphs] OK: adjacencyList empty == []
  19095. 582.95 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  19096. 582.95 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  19097. 582.95 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  19098. 582.95 s [algebraic-graphs]
  19099. 582.95 s [algebraic-graphs] ============ Graph.preSet ============
  19100. 582.95 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19101. 582.95 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19102. 582.95 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  19103. 582.95 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  19104. 582.95 s [algebraic-graphs]
  19105. 582.95 s [algebraic-graphs] ============ Graph.preIntSet ============
  19106. 582.95 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  19107. 582.95 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  19108. 582.95 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  19109. 582.95 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  19110. 582.95 s [algebraic-graphs]
  19111. 582.95 s [algebraic-graphs] ============ Graph.postSet ============
  19112. 582.95 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19113. 582.95 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19114. 582.95 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  19115. 582.95 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  19116. 582.95 s [algebraic-graphs]
  19117. 582.95 s [algebraic-graphs] ============ Graph.postIntSet ============
  19118. 582.95 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  19119. 582.95 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  19120. 582.95 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  19121. 582.95 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  19122. 582.95 s [algebraic-graphs]
  19123. 582.95 s [algebraic-graphs] ============ Graph.size ============
  19124. 582.95 s [algebraic-graphs] OK: size empty == 1
  19125. 582.95 s [algebraic-graphs] OK: size (vertex x) == 1
  19126. 582.95 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  19127. 582.95 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  19128. 582.95 s [algebraic-graphs] OK: size x >= 1
  19129. 582.95 s [algebraic-graphs] OK: size x >= vertexCount x
  19130. 582.95 s [algebraic-graphs]
  19131. 582.95 s [algebraic-graphs] ============ Graph.path ============
  19132. 582.95 s [algebraic-graphs] OK: path [] == empty
  19133. 582.95 s [algebraic-graphs] OK: path [x] == vertex x
  19134. 582.95 s [algebraic-graphs] OK: path [x,y] == edge x y
  19135. 582.95 s [algebraic-graphs]
  19136. 582.95 s [algebraic-graphs] ============ Graph.circuit ============
  19137. 582.95 s [algebraic-graphs] OK: circuit [] == empty
  19138. 582.95 s [algebraic-graphs] OK: circuit [x] == edge x x
  19139. 582.95 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  19140. 582.95 s [algebraic-graphs]
  19141. 582.95 s [algebraic-graphs] ============ Graph.clique ============
  19142. 582.95 s [algebraic-graphs] OK: clique [] == empty
  19143. 582.95 s [algebraic-graphs] OK: clique [x] == vertex x
  19144. 582.95 s [algebraic-graphs] OK: clique [x,y] == edge x y
  19145. 582.95 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  19146. 582.95 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  19147. 582.95 s [algebraic-graphs]
  19148. 582.95 s [algebraic-graphs] ============ Graph.biclique ============
  19149. 582.95 s [algebraic-graphs] OK: biclique [] [] == empty
  19150. 582.95 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  19151. 582.95 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  19152. 582.95 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  19153. 582.95 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  19154. 582.95 s [algebraic-graphs]
  19155. 582.95 s [algebraic-graphs] ============ Graph.star ============
  19156. 582.95 s [algebraic-graphs] OK: star x [] == vertex x
  19157. 582.95 s [algebraic-graphs] OK: star x [y] == edge x y
  19158. 582.95 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  19159. 582.95 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  19160. 582.95 s [algebraic-graphs]
  19161. 582.95 s [algebraic-graphs] ============ Graph.stars ============
  19162. 582.95 s [algebraic-graphs] OK: stars [] == empty
  19163. 582.95 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  19164. 582.95 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  19165. 582.95 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  19166. 582.95 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  19167. 582.95 s [algebraic-graphs] OK: stars . adjacencyList == id
  19168. 582.95 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  19169. 582.95 s [algebraic-graphs]
  19170. 582.95 s [algebraic-graphs] ============ Graph.tree ============
  19171. 582.95 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  19172. 582.95 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  19173. 582.95 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  19174. 582.95 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  19175. 582.95 s [algebraic-graphs]
  19176. 582.95 s [algebraic-graphs] ============ Graph.forest ============
  19177. 582.95 s [algebraic-graphs] OK: forest [] == empty
  19178. 582.95 s [algebraic-graphs] OK: forest [x] == tree x
  19179. 582.95 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  19180. 582.95 s [algebraic-graphs] OK: forest == overlays . map tree
  19181. 582.95 s [algebraic-graphs]
  19182. 582.95 s [algebraic-graphs] ============ Graph.removeVertex ============
  19183. 586.37 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19184. 586.37 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19185. 586.37 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  19186. 586.50 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  19187. 586.50 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19188. 586.50 s [algebraic-graphs]
  19189. 586.50 s [algebraic-graphs] ============ Graph.removeEdge ============
  19190. 586.50 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  19191. 586.50 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19192. 586.50 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19193. 586.50 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19194. 586.50 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19195. 586.50 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  19196. 586.50 s [algebraic-graphs]
  19197. 586.50 s [algebraic-graphs] ============ Graph.replaceVertex ============
  19198. 586.50 s [algebraic-graphs] OK: replaceVertex x x == id
  19199. 586.50 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19200. 586.50 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  19201. 586.50 s [algebraic-graphs]
  19202. 586.50 s [algebraic-graphs] ============ Graph.mergeVertices ============
  19203. 586.50 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  19204. 586.50 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  19205. 586.50 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  19206. 586.50 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  19207. 586.50 s [algebraic-graphs]
  19208. 586.50 s [algebraic-graphs] ============ Graph.transpose ============
  19209. 586.50 s [algebraic-graphs] OK: transpose empty == empty
  19210. 586.50 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19211. 586.50 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  19212. 586.50 s [algebraic-graphs] OK: transpose . transpose == id
  19213. 586.50 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19214. 586.50 s [algebraic-graphs]
  19215. 586.50 s [algebraic-graphs] ============ Graph.gmap ============
  19216. 586.50 s [algebraic-graphs] OK: gmap f empty == empty
  19217. 586.50 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  19218. 586.50 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  19219. 586.50 s [algebraic-graphs] OK: gmap id == id
  19220. 586.50 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  19221. 586.50 s [algebraic-graphs]
  19222. 586.50 s [algebraic-graphs] ============ Graph.induce ============
  19223. 586.50 s [algebraic-graphs] OK: induce (const True ) x == x
  19224. 586.50 s [algebraic-graphs] OK: induce (const False) x == empty
  19225. 586.50 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19226. 586.50 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19227. 586.50 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19228. 586.50 s [algebraic-graphs]
  19229. 586.50 s [algebraic-graphs] ============ Graph.induceJust ============
  19230. 586.50 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19231. 586.50 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19232. 586.51 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19233. 586.51 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19234. 586.51 s [algebraic-graphs]
  19235. 586.51 s [algebraic-graphs] ============ Graph.compose ============
  19236. 586.51 s [algebraic-graphs] OK: compose empty x == empty
  19237. 586.51 s [algebraic-graphs] OK: compose x empty == empty
  19238. 586.51 s [algebraic-graphs] OK: compose (vertex x) y == empty
  19239. 586.51 s [algebraic-graphs] OK: compose x (vertex y) == empty
  19240. 586.51 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  19241. 586.51 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  19242. 586.51 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  19243. 586.51 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  19244. 586.51 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  19245. 586.51 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  19246. 586.51 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  19247. 586.51 s [algebraic-graphs]
  19248. 586.51 s [algebraic-graphs] ============ Graph.(===) ============
  19249. 586.51 s [algebraic-graphs] OK: x === x == True
  19250. 586.51 s [algebraic-graphs] OK: x === x + empty == False
  19251. 586.51 s [algebraic-graphs] OK: x + y === x + y == True
  19252. 586.51 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  19253. 586.51 s [algebraic-graphs] OK: x + y === x * y == False
  19254. 586.51 s [algebraic-graphs]
  19255. 586.51 s [algebraic-graphs] ============ Graph.mesh ============
  19256. 586.51 s [algebraic-graphs] OK: mesh xs [] == empty
  19257. 586.51 s [algebraic-graphs] OK: mesh [] ys == empty
  19258. 586.51 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  19259. 586.51 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  19260. 586.51 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  19261. 586.51 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  19262. 586.51 s [algebraic-graphs]
  19263. 586.51 s [algebraic-graphs] ============ Graph.torus ============
  19264. 586.51 s [algebraic-graphs] OK: torus xs [] == empty
  19265. 586.51 s [algebraic-graphs] OK: torus [] ys == empty
  19266. 586.51 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  19267. 586.51 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  19268. 586.51 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  19269. 586.51 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  19270. 586.51 s [algebraic-graphs]
  19271. 586.51 s [algebraic-graphs] ============ Graph.deBruijn ============
  19272. 586.51 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  19273. 586.51 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  19274. 586.51 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  19275. 586.51 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  19276. 586.51 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  19277. 586.51 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  19278. 586.51 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  19279. 586.51 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  19280. 586.51 s [algebraic-graphs]
  19281. 586.51 s [algebraic-graphs] ============ Graph.splitVertex ============
  19282. 586.51 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  19283. 586.51 s [algebraic-graphs] OK: splitVertex x [x] == id
  19284. 586.51 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  19285. 586.51 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  19286. 586.51 s [algebraic-graphs]
  19287. 586.51 s [algebraic-graphs] ============ Graph.bind ============
  19288. 586.51 s [algebraic-graphs] OK: bind empty f == empty
  19289. 586.51 s [algebraic-graphs] OK: bind (vertex x) f == f x
  19290. 586.51 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  19291. 586.51 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  19292. 586.51 s [algebraic-graphs] OK: bind x (const empty) == empty
  19293. 586.51 s [algebraic-graphs] OK: bind x vertex == x
  19294. 586.51 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  19295. 586.51 s [algebraic-graphs]
  19296. 586.51 s [algebraic-graphs] ============ Graph.simplify ============
  19297. 586.51 s [algebraic-graphs] OK: simplify == id
  19298. 586.51 s [algebraic-graphs] OK: size (simplify x) <= size x
  19299. 586.51 s [algebraic-graphs]
  19300. 586.51 s [algebraic-graphs] ============ Graph.box ============
  19301. 586.51 s [algebraic-graphs] OK: box x y ~~ box y x
  19302. 586.51 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  19303. 586.51 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  19304. 586.51 s [algebraic-graphs] OK: box x empty ~~ empty
  19305. 586.51 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  19306. 586.51 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  19307. 586.51 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  19308. 586.51 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  19309. 586.51 s [algebraic-graphs]
  19310. 586.51 s [algebraic-graphs] ============ Graph.sparsify ============
  19311. 586.51 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  19312. 586.51 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  19313. 586.51 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  19314. 586.51 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  19315. 586.51 s [algebraic-graphs]
  19316. 586.51 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  19317. 586.51 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  19318. 586.51 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  19319. 586.51 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  19320. 586.51 s [algebraic-graphs]
  19321. 586.51 s [algebraic-graphs] ============ Graph.context ============
  19322. 586.51 s [algebraic-graphs] OK: context (const False) x == Nothing
  19323. 586.51 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  19324. 586.51 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  19325. 586.51 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  19326. 586.51 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  19327. 586.51 s [algebraic-graphs]
  19328. 586.51 s [algebraic-graphs] ============ Graph.buildg ============
  19329. 586.51 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  19330. 586.51 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  19331. 586.51 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
  19332. 586.51 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
  19333. 586.51 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  19334. 586.51 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  19335. 586.51 s [algebraic-graphs]
  19336. 586.51 s [algebraic-graphs] ============ Internal.List ============
  19337. 586.51 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  19338. 586.51 s [algebraic-graphs]
  19339. 586.51 s [algebraic-graphs] ============ Graph.Label ============
  19340. 586.51 s [algebraic-graphs]
  19341. 586.51 s [algebraic-graphs] ============ Any: instances ============
  19342. 586.51 s [algebraic-graphs] OK: Semiring
  19343. 586.51 s [algebraic-graphs] OK: StarSemiring
  19344. 586.51 s [algebraic-graphs] OK: Dioid
  19345. 586.51 s [algebraic-graphs]
  19346. 586.51 s [algebraic-graphs] ============ Distance Int: instances ============
  19347. 586.51 s [algebraic-graphs] OK: Semiring
  19348. 586.51 s [algebraic-graphs] OK: StarSemiring
  19349. 586.51 s [algebraic-graphs] OK: Dioid
  19350. 586.51 s [algebraic-graphs]
  19351. 586.51 s [algebraic-graphs] ============ Capacity Int: instances ============
  19352. 586.51 s [algebraic-graphs] OK: Semiring
  19353. 586.51 s [algebraic-graphs] OK: StarSemiring
  19354. 586.51 s [algebraic-graphs] OK: Dioid
  19355. 586.51 s [algebraic-graphs]
  19356. 586.51 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  19357. 586.51 s [algebraic-graphs] OK: LeftNearRing
  19358. 586.51 s [algebraic-graphs]
  19359. 586.51 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  19360. 586.51 s [algebraic-graphs] OK: Semiring
  19361. 586.51 s [algebraic-graphs] OK: Dioid
  19362. 586.51 s [algebraic-graphs]
  19363. 586.51 s [algebraic-graphs] ============ Count Int: instances ============
  19364. 586.51 s [algebraic-graphs] OK: Semiring
  19365. 586.51 s [algebraic-graphs] OK: StarSemiring
  19366. 586.51 s [algebraic-graphs]
  19367. 586.51 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  19368. 586.51 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  19369. 586.51 s [algebraic-graphs] OK: empty
  19370. 586.51 s [algebraic-graphs] OK: vertex
  19371. 586.51 s [algebraic-graphs] OK: edge
  19372. 586.51 s [algebraic-graphs] OK: overlay
  19373. 586.51 s [algebraic-graphs] OK: connect
  19374. 586.51 s [algebraic-graphs] OK: vertices
  19375. 586.51 s [algebraic-graphs] OK: edges
  19376. 586.51 s [algebraic-graphs] OK: overlays
  19377. 586.51 s [algebraic-graphs] OK: fromAdjacencyMaps
  19378. 586.51 s [algebraic-graphs] OK: removeVertex
  19379. 586.51 s [algebraic-graphs] OK: removeEdge
  19380. 586.51 s [algebraic-graphs] OK: replaceVertex
  19381. 586.51 s [algebraic-graphs] OK: replaceEdge
  19382. 586.51 s [algebraic-graphs] OK: transpose
  19383. 586.51 s [algebraic-graphs] OK: gmap
  19384. 586.51 s [algebraic-graphs] OK: emap
  19385. 586.51 s [algebraic-graphs] OK: induce
  19386. 586.51 s [algebraic-graphs] OK: closure
  19387. 586.51 s [algebraic-graphs] OK: reflexiveClosure
  19388. 586.51 s [algebraic-graphs] OK: symmetricClosure
  19389. 586.51 s [algebraic-graphs] OK: transitiveClosure
  19390. 586.51 s [algebraic-graphs]
  19391. 586.51 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  19392. 586.51 s [algebraic-graphs] OK: isEmpty empty == True
  19393. 586.51 s [algebraic-graphs] OK: hasVertex x empty == False
  19394. 586.51 s [algebraic-graphs] OK: vertexCount empty == 0
  19395. 586.51 s [algebraic-graphs] OK: edgeCount empty == 0
  19396. 586.51 s [algebraic-graphs]
  19397. 586.51 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  19398. 586.51 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19399. 586.51 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19400. 586.51 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19401. 586.51 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19402. 586.51 s [algebraic-graphs]
  19403. 589.02 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  19404. 589.02 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  19405. 589.02 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  19406. 589.02 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  19407. 589.02 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19408. 589.02 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  19409. 589.02 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  19410. 589.02 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  19411. 589.02 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  19412. 589.02 s [algebraic-graphs]
  19413. 589.02 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  19414. 589.02 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19415. 589.02 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19416. 589.02 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19417. 589.02 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19418. 589.02 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19419. 589.02 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19420. 589.02 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19421. 589.02 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19422. 589.03 s [algebraic-graphs]
  19423. 589.03 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  19424. 589.03 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  19425. 589.03 s [algebraic-graphs]
  19426. 589.03 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  19427. 589.03 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  19428. 589.03 s [algebraic-graphs]
  19429. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  19430. 589.03 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  19431. 589.03 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  19432. 589.03 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  19433. 589.03 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  19434. 589.03 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19435. 589.03 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  19436. 589.03 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  19437. 589.03 s [algebraic-graphs]
  19438. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  19439. 589.03 s [algebraic-graphs] OK: vertices [] == empty
  19440. 589.03 s [algebraic-graphs] OK: vertices [x] == vertex x
  19441. 589.03 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19442. 589.03 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19443. 589.03 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19444. 589.03 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19445. 589.03 s [algebraic-graphs]
  19446. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  19447. 589.03 s [algebraic-graphs] OK: edges [] == empty
  19448. 589.03 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  19449. 589.03 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  19450. 589.03 s [algebraic-graphs]
  19451. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  19452. 589.03 s [algebraic-graphs] OK: overlays [] == empty
  19453. 589.03 s [algebraic-graphs] OK: overlays [x] == x
  19454. 589.03 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19455. 589.03 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19456. 589.03 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19457. 589.03 s [algebraic-graphs]
  19458. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  19459. 589.03 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  19460. 589.03 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  19461. 589.03 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  19462. 589.03 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  19463. 589.03 s [algebraic-graphs]
  19464. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  19465. 589.03 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19466. 589.03 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19467. 589.03 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19468. 589.03 s [algebraic-graphs]
  19469. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  19470. 589.03 s [algebraic-graphs] OK: isEmpty empty == True
  19471. 589.03 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19472. 589.03 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19473. 589.03 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19474. 589.03 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  19475. 589.03 s [algebraic-graphs]
  19476. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  19477. 589.03 s [algebraic-graphs] OK: hasVertex x empty == False
  19478. 589.03 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19479. 589.03 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19480. 589.03 s [algebraic-graphs]
  19481. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  19482. 589.03 s [algebraic-graphs] OK: hasEdge x y empty == False
  19483. 589.03 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19484. 589.03 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  19485. 589.03 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19486. 589.03 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  19487. 589.03 s [algebraic-graphs]
  19488. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  19489. 589.03 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  19490. 589.03 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  19491. 589.03 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19492. 589.03 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  19493. 589.03 s [algebraic-graphs]
  19494. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  19495. 589.03 s [algebraic-graphs] OK: vertexCount empty == 0
  19496. 589.03 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19497. 589.03 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19498. 589.03 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19499. 589.03 s [algebraic-graphs]
  19500. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  19501. 589.03 s [algebraic-graphs] OK: edgeCount empty == 0
  19502. 589.03 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19503. 589.03 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  19504. 589.03 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19505. 589.03 s [algebraic-graphs]
  19506. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  19507. 589.03 s [algebraic-graphs] OK: vertexList empty == []
  19508. 589.03 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19509. 589.03 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19510. 589.03 s [algebraic-graphs]
  19511. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  19512. 589.03 s [algebraic-graphs] OK: edgeList empty == []
  19513. 589.03 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19514. 589.03 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  19515. 589.03 s [algebraic-graphs]
  19516. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  19517. 589.03 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19518. 589.03 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19519. 589.03 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19520. 589.03 s [algebraic-graphs]
  19521. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  19522. 589.03 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19523. 589.03 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19524. 589.03 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  19525. 589.03 s [algebraic-graphs]
  19526. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  19527. 589.03 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19528. 589.03 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19529. 589.03 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  19530. 589.03 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  19531. 589.03 s [algebraic-graphs]
  19532. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  19533. 589.03 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19534. 589.03 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19535. 589.03 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  19536. 589.03 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  19537. 589.03 s [algebraic-graphs]
  19538. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  19539. 589.03 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  19540. 589.03 s [algebraic-graphs]
  19541. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  19542. 589.03 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19543. 589.03 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19544. 589.03 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  19545. 589.03 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  19546. 589.03 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19547. 589.03 s [algebraic-graphs]
  19548. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  19549. 589.03 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  19550. 589.03 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19551. 589.03 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19552. 589.03 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19553. 589.03 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19554. 589.03 s [algebraic-graphs]
  19555. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  19556. 589.03 s [algebraic-graphs] OK: replaceVertex x x == id
  19557. 589.03 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19558. 589.03 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  19559. 589.03 s [algebraic-graphs]
  19560. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  19561. 589.03 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  19562. 589.03 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  19563. 589.03 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  19564. 589.03 s [algebraic-graphs]
  19565. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  19566. 589.03 s [algebraic-graphs] OK: transpose empty == empty
  19567. 589.03 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19568. 589.03 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  19569. 589.03 s [algebraic-graphs] OK: transpose . transpose == id
  19570. 589.03 s [algebraic-graphs]
  19571. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  19572. 589.03 s [algebraic-graphs] OK: gmap f empty == empty
  19573. 589.03 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  19574. 589.03 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  19575. 589.03 s [algebraic-graphs] OK: gmap id == id
  19576. 589.03 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  19577. 589.03 s [algebraic-graphs]
  19578. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  19579. 589.03 s [algebraic-graphs] OK: emap h empty == empty
  19580. 589.03 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  19581. 589.03 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  19582. 589.03 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  19583. 589.03 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  19584. 589.03 s [algebraic-graphs] OK: emap id == id
  19585. 589.03 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  19586. 589.03 s [algebraic-graphs]
  19587. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  19588. 589.03 s [algebraic-graphs] OK: induce (const True ) x == x
  19589. 589.03 s [algebraic-graphs] OK: induce (const False) x == empty
  19590. 589.03 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19591. 589.03 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19592. 589.03 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19593. 589.03 s [algebraic-graphs]
  19594. 589.03 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  19595. 590.31 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19596. 590.31 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19597. 590.31 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19598. 590.31 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19599. 590.31 s [algebraic-graphs]
  19600. 590.31 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  19601. 590.32 s [algebraic-graphs] OK: closure empty == empty
  19602. 590.32 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  19603. 590.32 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  19604. 590.32 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19605. 590.32 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  19606. 590.32 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  19607. 590.32 s [algebraic-graphs] OK: closure . closure == closure
  19608. 590.32 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  19609. 590.32 s [algebraic-graphs]
  19610. 590.32 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  19611. 590.32 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  19612. 590.32 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  19613. 590.32 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  19614. 590.32 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19615. 590.32 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  19616. 590.32 s [algebraic-graphs]
  19617. 590.32 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  19618. 590.32 s [algebraic-graphs] OK: symmetricClosure empty == empty
  19619. 590.32 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  19620. 590.32 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  19621. 590.32 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  19622. 590.32 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  19623. 590.32 s [algebraic-graphs]
  19624. 590.32 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  19625. 590.32 s [algebraic-graphs] OK: transitiveClosure empty == empty
  19626. 590.32 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19627. 590.32 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  19628. 590.32 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19629. 590.32 s [algebraic-graphs]
  19630. 590.32 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  19631. 590.32 s [algebraic-graphs] OK: isEmpty empty == True
  19632. 590.32 s [algebraic-graphs] OK: hasVertex x empty == False
  19633. 590.32 s [algebraic-graphs] OK: vertexCount empty == 0
  19634. 590.32 s [algebraic-graphs] OK: edgeCount empty == 0
  19635. 590.32 s [algebraic-graphs]
  19636. 590.32 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  19637. 590.32 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19638. 590.32 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19639. 590.32 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19640. 590.32 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19641. 590.32 s [algebraic-graphs]
  19642. 590.32 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  19643. 590.32 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  19644. 590.32 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  19645. 590.32 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  19646. 590.32 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19647. 590.32 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  19648. 590.32 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  19649. 590.32 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  19650. 590.32 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  19651. 590.32 s [algebraic-graphs]
  19652. 590.32 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  19653. 590.32 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19654. 590.32 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19655. 590.32 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19656. 590.32 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19657. 590.32 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19658. 590.32 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19659. 590.32 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19660. 590.32 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19661. 590.32 s [algebraic-graphs]
  19662. 590.32 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  19663. 590.32 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  19664. 590.32 s [algebraic-graphs]
  19665. 590.32 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  19666. 590.32 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  19667. 590.32 s [algebraic-graphs]
  19668. 590.32 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  19669. 590.32 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  19670. 590.32 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  19671. 590.32 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  19672. 590.32 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  19673. 590.32 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19674. 590.32 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  19675. 590.32 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  19676. 590.32 s [algebraic-graphs]
  19677. 590.32 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  19678. 590.32 s [algebraic-graphs] OK: vertices [] == empty
  19679. 590.32 s [algebraic-graphs] OK: vertices [x] == vertex x
  19680. 590.32 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19681. 590.32 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19682. 590.32 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19683. 590.32 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19684. 590.32 s [algebraic-graphs]
  19685. 590.32 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  19686. 590.32 s [algebraic-graphs] OK: edges [] == empty
  19687. 590.32 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  19688. 590.32 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  19689. 590.32 s [algebraic-graphs]
  19690. 590.32 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  19691. 590.32 s [algebraic-graphs] OK: overlays [] == empty
  19692. 590.32 s [algebraic-graphs] OK: overlays [x] == x
  19693. 590.32 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19694. 590.32 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19695. 590.32 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19696. 590.32 s [algebraic-graphs]
  19697. 590.32 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  19698. 590.32 s [algebraic-graphs] OK: foldg empty vertex connect == id
  19699. 590.32 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  19700. 590.32 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  19701. 590.32 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  19702. 590.32 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  19703. 590.32 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  19704. 590.32 s [algebraic-graphs]
  19705. 590.32 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  19706. 590.32 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  19707. 590.32 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  19708. 590.32 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  19709. 590.32 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  19710. 590.32 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  19711. 590.32 s [algebraic-graphs]
  19712. 590.32 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  19713. 590.32 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19714. 590.32 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19715. 590.32 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19716. 590.32 s [algebraic-graphs]
  19717. 590.32 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  19718. 590.32 s [algebraic-graphs] OK: isEmpty empty == True
  19719. 590.32 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19720. 590.32 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19721. 590.32 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19722. 590.32 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  19723. 590.32 s [algebraic-graphs]
  19724. 590.32 s [algebraic-graphs] ============ Labelled.Graph.size ============
  19725. 590.32 s [algebraic-graphs] OK: size empty == 1
  19726. 590.32 s [algebraic-graphs] OK: size (vertex x) == 1
  19727. 590.32 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  19728. 590.32 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  19729. 590.32 s [algebraic-graphs] OK: size x >= 1
  19730. 590.32 s [algebraic-graphs] OK: size x >= vertexCount x
  19731. 590.32 s [algebraic-graphs]
  19732. 590.32 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  19733. 590.32 s [algebraic-graphs] OK: hasVertex x empty == False
  19734. 590.32 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19735. 590.32 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19736. 590.32 s [algebraic-graphs]
  19737. 590.32 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  19738. 590.32 s [algebraic-graphs] OK: hasEdge x y empty == False
  19739. 590.32 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19740. 590.32 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  19741. 590.32 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19742. 590.32 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  19743. 590.32 s [algebraic-graphs]
  19744. 590.32 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  19745. 590.32 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  19746. 590.32 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  19747. 590.32 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19748. 590.32 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  19749. 590.32 s [algebraic-graphs]
  19750. 590.32 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  19751. 590.32 s [algebraic-graphs] OK: vertexCount empty == 0
  19752. 590.32 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19753. 590.32 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19754. 590.32 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19755. 590.32 s [algebraic-graphs]
  19756. 590.32 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  19757. 590.32 s [algebraic-graphs] OK: edgeCount empty == 0
  19758. 590.32 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19759. 590.32 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  19760. 590.32 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19761. 590.32 s [algebraic-graphs]
  19762. 590.32 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  19763. 590.32 s [algebraic-graphs] OK: vertexList empty == []
  19764. 590.32 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19765. 590.32 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19766. 590.32 s [algebraic-graphs]
  19767. 590.32 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  19768. 590.32 s [algebraic-graphs] OK: edgeList empty == []
  19769. 590.32 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19770. 590.32 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  19771. 590.32 s [algebraic-graphs]
  19772. 590.32 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  19773. 590.32 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19774. 590.32 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19775. 590.32 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19776. 590.32 s [algebraic-graphs]
  19777. 590.32 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  19778. 590.32 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19779. 590.32 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19780. 590.32 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  19781. 590.32 s [algebraic-graphs]
  19782. 590.32 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  19783. 590.32 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19784. 590.32 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19785. 593.01 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  19786. 593.14 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  19787. 593.14 s [algebraic-graphs]
  19788. 593.14 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  19789. 593.14 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19790. 593.14 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19791. 593.14 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  19792. 593.14 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  19793. 593.14 s [algebraic-graphs]
  19794. 593.14 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  19795. 593.14 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19796. 593.14 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19797. 593.14 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  19798. 593.14 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  19799. 593.14 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19800. 593.14 s [algebraic-graphs]
  19801. 593.14 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  19802. 593.14 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  19803. 593.14 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19804. 593.14 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19805. 593.14 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19806. 593.14 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19807. 593.14 s [algebraic-graphs]
  19808. 593.14 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  19809. 593.14 s [algebraic-graphs] OK: replaceVertex x x == id
  19810. 593.14 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19811. 593.14 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  19812. 593.14 s [algebraic-graphs]
  19813. 593.14 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  19814. 593.14 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  19815. 593.14 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  19816. 593.14 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  19817. 593.14 s [algebraic-graphs]
  19818. 593.14 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  19819. 593.14 s [algebraic-graphs] OK: transpose empty == empty
  19820. 593.14 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19821. 593.14 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  19822. 593.14 s [algebraic-graphs] OK: transpose . transpose == id
  19823. 593.14 s [algebraic-graphs]
  19824. 593.14 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  19825. 593.14 s [algebraic-graphs] OK: fmap f empty == empty
  19826. 593.14 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  19827. 593.14 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  19828. 593.14 s [algebraic-graphs] OK: fmap id == id
  19829. 593.14 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  19830. 593.14 s [algebraic-graphs]
  19831. 593.14 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  19832. 593.14 s [algebraic-graphs] OK: emap h empty == empty
  19833. 593.14 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  19834. 593.14 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  19835. 593.14 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  19836. 593.14 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  19837. 593.14 s [algebraic-graphs] OK: emap id == id
  19838. 593.14 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  19839. 593.14 s [algebraic-graphs]
  19840. 593.14 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  19841. 593.14 s [algebraic-graphs] OK: induce (const True ) x == x
  19842. 593.14 s [algebraic-graphs] OK: induce (const False) x == empty
  19843. 593.14 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19844. 593.14 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19845. 593.14 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19846. 593.14 s [algebraic-graphs]
  19847. 593.14 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  19848. 593.14 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19849. 593.14 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19850. 593.14 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19851. 593.14 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19852. 593.14 s [algebraic-graphs]
  19853. 593.14 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  19854. 593.14 s [algebraic-graphs] OK: closure empty == empty
  19855. 593.14 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  19856. 593.14 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  19857. 593.14 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19858. 593.14 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  19859. 593.14 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  19860. 593.14 s [algebraic-graphs] OK: closure . closure == closure
  19861. 593.14 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  19862. 593.14 s [algebraic-graphs]
  19863. 593.14 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  19864. 593.14 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  19865. 593.14 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  19866. 593.14 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  19867. 593.14 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19868. 593.14 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  19869. 593.14 s [algebraic-graphs]
  19870. 593.14 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  19871. 593.14 s [algebraic-graphs] OK: symmetricClosure empty == empty
  19872. 593.14 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  19873. 593.14 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  19874. 593.14 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  19875. 593.14 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  19876. 593.14 s [algebraic-graphs]
  19877. 593.14 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  19878. 593.14 s [algebraic-graphs] OK: transitiveClosure empty == empty
  19879. 593.14 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19880. 593.14 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  19881. 593.14 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19882. 593.14 s [algebraic-graphs]
  19883. 593.14 s [algebraic-graphs] ============ Labelled.Graph.context ============
  19884. 593.14 s [algebraic-graphs] OK: context (const False) x == Nothing
  19885. 593.14 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  19886. 593.14 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  19887. 593.14 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  19888. 593.14 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  19889. 593.14 s [algebraic-graphs]
  19890. 593.14 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  19891. 593.14 s [algebraic-graphs] OK: Axioms of non-empty graphs
  19892. 593.14 s [algebraic-graphs] OK: Theorems of non-empty graphs
  19893. 593.14 s [algebraic-graphs]
  19894. 593.14 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  19895. 593.14 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19896. 593.14 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19897. 593.14 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19898. 593.14 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19899. 593.14 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19900. 593.14 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  19901. 593.14 s [algebraic-graphs] OK: x <= x + y
  19902. 593.14 s [algebraic-graphs] OK: x + y <= x * y
  19903. 593.14 s [algebraic-graphs]
  19904. 593.14 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  19905. 593.14 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  19906. 593.14 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  19907. 593.14 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  19908. 593.14 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  19909. 593.14 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  19910. 593.14 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  19911. 593.14 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  19912. 593.14 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  19913. 593.14 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  19914. 593.14 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  19915. 593.14 s [algebraic-graphs]
  19916. 593.14 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  19917. 593.14 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  19918. 593.14 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  19919. 593.14 s [algebraic-graphs]
  19920. 593.14 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  19921. 593.14 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  19922. 593.14 s [algebraic-graphs]
  19923. 593.14 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  19924. 593.14 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19925. 593.14 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19926. 593.14 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19927. 593.14 s [algebraic-graphs]
  19928. 593.14 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  19929. 593.14 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  19930. 593.14 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19931. 593.14 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19932. 593.14 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  19933. 593.14 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  19934. 593.14 s [algebraic-graphs]
  19935. 593.14 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  19936. 593.14 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19937. 593.14 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19938. 593.14 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19939. 593.14 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19940. 593.14 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19941. 593.14 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19942. 593.14 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19943. 593.14 s [algebraic-graphs]
  19944. 593.14 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  19945. 593.14 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  19946. 593.14 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  19947. 593.14 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  19948. 593.14 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  19949. 593.14 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  19950. 593.14 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  19951. 593.14 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19952. 593.14 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  19953. 593.14 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  19954. 593.14 s [algebraic-graphs]
  19955. 593.14 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  19956. 593.14 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  19957. 593.14 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  19958. 593.14 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  19959. 593.14 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  19960. 593.14 s [algebraic-graphs]
  19961. 593.14 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  19962. 593.14 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  19963. 593.14 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  19964. 593.14 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  19965. 593.14 s [algebraic-graphs]
  19966. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  19967. 596.02 s [algebraic-graphs] OK: overlays1 [x] == x
  19968. 596.02 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  19969. 596.02 s [algebraic-graphs]
  19970. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  19971. 596.02 s [algebraic-graphs] OK: connects1 [x] == x
  19972. 596.02 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  19973. 596.02 s [algebraic-graphs]
  19974. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  19975. 596.02 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  19976. 596.02 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  19977. 596.02 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  19978. 596.02 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19979. 596.02 s [algebraic-graphs]
  19980. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  19981. 596.02 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19982. 596.02 s [algebraic-graphs]
  19983. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  19984. 596.02 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19985. 596.02 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19986. 596.02 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19987. 596.02 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19988. 596.02 s [algebraic-graphs]
  19989. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  19990. 596.02 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19991. 596.02 s [algebraic-graphs] OK: vertexCount x >= 1
  19992. 596.02 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  19993. 596.02 s [algebraic-graphs]
  19994. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  19995. 596.02 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19996. 596.02 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19997. 596.02 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19998. 596.02 s [algebraic-graphs]
  19999. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  20000. 596.02 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  20001. 596.02 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  20002. 596.02 s [algebraic-graphs]
  20003. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  20004. 596.02 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20005. 596.02 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20006. 596.02 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20007. 596.02 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  20008. 596.02 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20009. 596.02 s [algebraic-graphs]
  20010. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  20011. 596.02 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20012. 596.02 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  20013. 596.02 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  20014. 596.02 s [algebraic-graphs]
  20015. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  20016. 596.02 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20017. 596.02 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20018. 596.02 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  20019. 596.02 s [algebraic-graphs]
  20020. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  20021. 596.02 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20022. 596.02 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20023. 596.02 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20024. 596.02 s [algebraic-graphs]
  20025. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  20026. 596.02 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20027. 596.02 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20028. 596.02 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20029. 596.02 s [algebraic-graphs]
  20030. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  20031. 596.02 s [algebraic-graphs] OK: path1 [x] == vertex x
  20032. 596.02 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  20033. 596.02 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  20034. 596.02 s [algebraic-graphs]
  20035. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  20036. 596.02 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  20037. 596.02 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  20038. 596.02 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  20039. 596.02 s [algebraic-graphs]
  20040. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  20041. 596.02 s [algebraic-graphs] OK: clique1 [x] == vertex x
  20042. 596.02 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  20043. 596.02 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  20044. 596.02 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  20045. 596.02 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  20046. 596.02 s [algebraic-graphs]
  20047. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  20048. 596.02 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20049. 596.02 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  20050. 596.02 s [algebraic-graphs]
  20051. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  20052. 596.02 s [algebraic-graphs] OK: star x [] == vertex x
  20053. 596.02 s [algebraic-graphs] OK: star x [y] == edge x y
  20054. 596.02 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  20055. 596.02 s [algebraic-graphs]
  20056. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  20057. 596.02 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  20058. 596.02 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  20059. 596.02 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  20060. 596.02 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  20061. 596.02 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  20062. 596.02 s [algebraic-graphs]
  20063. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  20064. 596.02 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20065. 596.02 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  20066. 596.02 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20067. 596.02 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  20068. 596.02 s [algebraic-graphs]
  20069. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  20070. 596.02 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  20071. 596.02 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  20072. 596.02 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  20073. 596.02 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  20074. 596.02 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  20075. 596.02 s [algebraic-graphs]
  20076. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  20077. 596.02 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  20078. 596.02 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20079. 596.02 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20080. 596.02 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20081. 596.02 s [algebraic-graphs]
  20082. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  20083. 596.02 s [algebraic-graphs] OK: replaceVertex x x == id
  20084. 596.02 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20085. 596.02 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20086. 596.02 s [algebraic-graphs]
  20087. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  20088. 596.02 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20089. 596.02 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20090. 596.02 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20091. 596.02 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20092. 596.02 s [algebraic-graphs]
  20093. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  20094. 596.02 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20095. 596.02 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20096. 596.02 s [algebraic-graphs] OK: transpose . transpose == id
  20097. 596.02 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20098. 596.02 s [algebraic-graphs]
  20099. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  20100. 596.02 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20101. 596.02 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20102. 596.02 s [algebraic-graphs] OK: gmap id == id
  20103. 596.02 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20104. 596.02 s [algebraic-graphs]
  20105. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  20106. 596.02 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  20107. 596.02 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  20108. 596.02 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  20109. 596.02 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  20110. 596.02 s [algebraic-graphs]
  20111. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  20112. 596.02 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  20113. 596.02 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  20114. 596.02 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  20115. 596.02 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  20116. 596.02 s [algebraic-graphs]
  20117. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  20118. 596.02 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20119. 596.02 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20120. 596.02 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  20121. 596.02 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  20122. 596.02 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20123. 596.02 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20124. 596.02 s [algebraic-graphs] OK: closure . closure == closure
  20125. 596.02 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20126. 596.02 s [algebraic-graphs]
  20127. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  20128. 596.02 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20129. 596.02 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20130. 596.02 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  20131. 596.02 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20132. 596.02 s [algebraic-graphs]
  20133. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  20134. 596.02 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20135. 596.02 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  20136. 596.02 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20137. 596.02 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20138. 596.02 s [algebraic-graphs]
  20139. 596.02 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  20140. 596.02 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20141. 596.02 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20142. 596.02 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  20143. 596.02 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20144. 596.02 s [algebraic-graphs]
  20145. 596.02 s [algebraic-graphs] ============ NonEmpty.Graph.============
  20146. 596.02 s [algebraic-graphs] OK: Axioms of non-empty graphs
  20147. 596.02 s [algebraic-graphs] OK: Theorems of non-empty graphs
  20148. 596.02 s [algebraic-graphs]
  20149. 596.02 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  20150. 596.02 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20151. 596.02 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20152. 596.02 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20153. 596.02 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20154. 596.02 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20155. 596.02 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20156. 596.02 s [algebraic-graphs] OK: x <= x + y
  20157. 596.02 s [algebraic-graphs] OK: x + y <= x * y
  20158. 596.02 s [algebraic-graphs]
  20159. 596.02 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  20160. 596.02 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  20161. 596.02 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  20162. 596.02 s [algebraic-graphs] OK: fmap id == id
  20163. 596.02 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  20164. 596.02 s [algebraic-graphs]
  20165. 596.02 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  20166. 596.02 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  20167. 597.52 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  20168. 597.52 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  20169. 597.52 s [algebraic-graphs] OK: (x >>= vertex) == x
  20170. 597.52 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  20171. 597.52 s [algebraic-graphs]
  20172. 597.52 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  20173. 597.52 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  20174. 597.52 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  20175. 597.52 s [algebraic-graphs]
  20176. 597.52 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  20177. 597.52 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20178. 597.52 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20179. 597.52 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20180. 597.52 s [algebraic-graphs] OK: size (vertex x) == 1
  20181. 597.52 s [algebraic-graphs]
  20182. 597.52 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  20183. 597.52 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20184. 597.52 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20185. 597.52 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20186. 597.52 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20187. 597.52 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20188. 597.52 s [algebraic-graphs]
  20189. 597.52 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  20190. 597.52 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20191. 597.52 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20192. 597.52 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20193. 597.52 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20194. 597.53 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20195. 597.53 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  20196. 597.53 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20197. 597.53 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20198. 597.53 s [algebraic-graphs]
  20199. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  20200. 597.53 s [algebraic-graphs] OK: overlay1 empty x == x
  20201. 597.53 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  20202. 597.53 s [algebraic-graphs]
  20203. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  20204. 597.53 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20205. 597.53 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20206. 597.53 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20207. 597.53 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20208. 597.53 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20209. 597.53 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20210. 597.53 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20211. 597.53 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  20212. 597.53 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20213. 597.53 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20214. 597.53 s [algebraic-graphs]
  20215. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  20216. 597.53 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  20217. 597.53 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  20218. 597.53 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  20219. 597.53 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  20220. 597.53 s [algebraic-graphs]
  20221. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  20222. 597.53 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  20223. 597.53 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  20224. 597.53 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  20225. 597.53 s [algebraic-graphs]
  20226. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  20227. 597.53 s [algebraic-graphs] OK: overlays1 [x] == x
  20228. 597.53 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  20229. 597.53 s [algebraic-graphs]
  20230. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  20231. 597.53 s [algebraic-graphs] OK: connects1 [x] == x
  20232. 597.53 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  20233. 597.53 s [algebraic-graphs]
  20234. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  20235. 597.53 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  20236. 597.53 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  20237. 597.53 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  20238. 597.53 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  20239. 597.53 s [algebraic-graphs]
  20240. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  20241. 597.53 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20242. 597.53 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20243. 597.53 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  20244. 597.53 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20245. 597.53 s [algebraic-graphs]
  20246. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  20247. 597.53 s [algebraic-graphs] OK: x === x == True
  20248. 597.53 s [algebraic-graphs] OK: x + y === x + y == True
  20249. 597.53 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  20250. 597.53 s [algebraic-graphs] OK: x + y === x * y == False
  20251. 597.53 s [algebraic-graphs]
  20252. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  20253. 597.53 s [algebraic-graphs] OK: size (vertex x) == 1
  20254. 597.53 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  20255. 597.53 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  20256. 597.53 s [algebraic-graphs] OK: size x >= 1
  20257. 597.53 s [algebraic-graphs] OK: size x >= vertexCount x
  20258. 597.53 s [algebraic-graphs]
  20259. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  20260. 597.53 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20261. 597.53 s [algebraic-graphs]
  20262. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  20263. 597.53 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20264. 597.53 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20265. 597.53 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20266. 597.53 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20267. 597.53 s [algebraic-graphs]
  20268. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  20269. 597.53 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20270. 597.53 s [algebraic-graphs] OK: vertexCount x >= 1
  20271. 597.53 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  20272. 597.53 s [algebraic-graphs]
  20273. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  20274. 597.53 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20275. 597.53 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20276. 597.53 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20277. 597.53 s [algebraic-graphs]
  20278. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  20279. 597.53 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  20280. 597.53 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  20281. 597.53 s [algebraic-graphs]
  20282. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  20283. 597.53 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20284. 597.53 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20285. 597.53 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20286. 597.53 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  20287. 597.53 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20288. 597.53 s [algebraic-graphs]
  20289. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  20290. 597.53 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20291. 597.53 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  20292. 597.53 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  20293. 597.53 s [algebraic-graphs]
  20294. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  20295. 597.53 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20296. 597.53 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20297. 597.53 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  20298. 597.53 s [algebraic-graphs]
  20299. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  20300. 597.53 s [algebraic-graphs] OK: path1 [x] == vertex x
  20301. 597.53 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  20302. 597.53 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  20303. 597.53 s [algebraic-graphs]
  20304. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  20305. 597.53 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  20306. 597.53 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  20307. 597.53 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  20308. 597.53 s [algebraic-graphs]
  20309. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  20310. 597.53 s [algebraic-graphs] OK: clique1 [x] == vertex x
  20311. 597.53 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  20312. 597.53 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  20313. 597.53 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  20314. 597.53 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  20315. 597.53 s [algebraic-graphs]
  20316. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  20317. 597.53 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20318. 597.53 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  20319. 597.53 s [algebraic-graphs]
  20320. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  20321. 597.53 s [algebraic-graphs] OK: star x [] == vertex x
  20322. 597.53 s [algebraic-graphs] OK: star x [y] == edge x y
  20323. 597.53 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  20324. 597.53 s [algebraic-graphs]
  20325. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  20326. 597.53 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  20327. 597.53 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  20328. 597.53 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  20329. 597.53 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  20330. 597.53 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  20331. 597.53 s [algebraic-graphs]
  20332. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  20333. 597.53 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20334. 597.53 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  20335. 597.53 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20336. 597.53 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  20337. 597.53 s [algebraic-graphs]
  20338. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  20339. 597.53 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  20340. 597.53 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  20341. 597.53 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  20342. 597.53 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  20343. 597.53 s [algebraic-graphs]
  20344. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  20345. 597.53 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  20346. 597.53 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  20347. 597.53 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  20348. 597.53 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  20349. 597.53 s [algebraic-graphs]
  20350. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  20351. 597.53 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  20352. 597.53 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  20353. 597.53 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  20354. 597.53 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  20355. 597.53 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  20356. 597.53 s [algebraic-graphs]
  20357. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  20358. 597.53 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  20359. 597.53 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20360. 597.53 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20361. 597.53 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20362. 597.53 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  20363. 597.53 s [algebraic-graphs]
  20364. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  20365. 597.53 s [algebraic-graphs] OK: replaceVertex x x == id
  20366. 597.53 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20367. 597.53 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20368. 597.53 s [algebraic-graphs]
  20369. 597.53 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  20370. 597.53 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20371. 604.83 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20372. 604.83 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20373. 604.87 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20374. 604.87 s [algebraic-graphs]
  20375. 604.87 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  20376. 604.87 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  20377. 604.87 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  20378. 604.87 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  20379. 604.87 s [algebraic-graphs]
  20380. 604.87 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  20381. 604.87 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20382. 604.87 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20383. 604.87 s [algebraic-graphs] OK: transpose . transpose == id
  20384. 604.87 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20385. 604.87 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20386. 604.87 s [algebraic-graphs]
  20387. 604.87 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  20388. 604.87 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  20389. 604.87 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  20390. 604.87 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  20391. 604.87 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  20392. 604.87 s [algebraic-graphs]
  20393. 604.87 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  20394. 604.87 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  20395. 604.87 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  20396. 604.87 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  20397. 604.87 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  20398. 604.87 s [algebraic-graphs]
  20399. 604.87 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  20400. 604.87 s [algebraic-graphs] OK: simplify == id
  20401. 604.87 s [algebraic-graphs] OK: size (simplify x) <= size x
  20402. 604.87 s [algebraic-graphs] OK: simplify 1 === 1
  20403. 604.87 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  20404. 604.87 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  20405. 604.87 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  20406. 604.87 s [algebraic-graphs]
  20407. 604.87 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  20408. 604.87 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  20409. 604.87 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  20410. 604.87 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  20411. 604.87 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  20412. 604.87 s [algebraic-graphs]
  20413. 604.87 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  20414. 604.87 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  20415. 604.87 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  20416. 604.87 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  20417. 604.87 s [algebraic-graphs]
  20418. 604.87 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  20419. 604.87 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  20420. 604.87 s [algebraic-graphs] OK: box x y ~~ box y x
  20421. 604.87 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  20422. 604.87 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  20423. 604.87 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  20424. 604.87 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  20425. 604.87 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  20426. 604.87 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  20427. 604.87 s [algebraic-graphs]
  20428. 604.87 s [algebraic-graphs] ============ Relation ============
  20429. 604.87 s [algebraic-graphs] OK: Axioms of graphs
  20430. 604.87 s [algebraic-graphs]
  20431. 604.87 s [algebraic-graphs] ============ Relation.consistent ============
  20432. 604.87 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20433. 604.87 s [algebraic-graphs]
  20434. 604.87 s [algebraic-graphs] OK: consistent empty == True
  20435. 604.87 s [algebraic-graphs] OK: consistent (vertex x) == True
  20436. 604.87 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20437. 604.87 s [algebraic-graphs] OK: consistent (connect x y) == True
  20438. 604.87 s [algebraic-graphs] OK: consistent (edge x y) == True
  20439. 604.87 s [algebraic-graphs] OK: consistent (edges xs) == True
  20440. 604.87 s [algebraic-graphs] OK: consistent (stars xs) == True
  20441. 604.87 s [algebraic-graphs]
  20442. 604.87 s [algebraic-graphs] ============ Relation.Show ============
  20443. 604.87 s [algebraic-graphs] OK: show (empty ) == "empty"
  20444. 604.87 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20445. 604.87 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20446. 604.87 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20447. 604.87 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20448. 604.87 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20449. 604.87 s [algebraic-graphs]
  20450. 604.87 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20451. 604.87 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20452. 604.87 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20453. 604.87 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20454. 604.87 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20455. 604.87 s [algebraic-graphs]
  20456. 604.87 s [algebraic-graphs] ============ Relation.Ord ============
  20457. 604.87 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20458. 604.87 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20459. 604.87 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20460. 604.87 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20461. 604.87 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20462. 604.87 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  20463. 604.87 s [algebraic-graphs] OK: x <= x + y
  20464. 604.87 s [algebraic-graphs] OK: x + y <= x * y
  20465. 604.87 s [algebraic-graphs]
  20466. 604.87 s [algebraic-graphs] ============ Relation.empty ============
  20467. 604.87 s [algebraic-graphs] OK: isEmpty empty == True
  20468. 604.87 s [algebraic-graphs] OK: hasVertex x empty == False
  20469. 604.87 s [algebraic-graphs] OK: vertexCount empty == 0
  20470. 604.87 s [algebraic-graphs] OK: edgeCount empty == 0
  20471. 604.87 s [algebraic-graphs]
  20472. 604.87 s [algebraic-graphs] ============ Relation.vertex ============
  20473. 604.87 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20474. 604.87 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20475. 604.87 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20476. 604.87 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20477. 604.87 s [algebraic-graphs]
  20478. 604.87 s [algebraic-graphs] ============ Relation.edge ============
  20479. 604.87 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20480. 604.87 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20481. 604.87 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20482. 604.87 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20483. 604.87 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20484. 604.87 s [algebraic-graphs]
  20485. 604.87 s [algebraic-graphs] ============ Relation.overlay ============
  20486. 604.87 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20487. 604.87 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20488. 604.87 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20489. 604.87 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20490. 604.87 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20491. 604.87 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20492. 604.87 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20493. 604.87 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20494. 604.87 s [algebraic-graphs]
  20495. 604.87 s [algebraic-graphs] ============ Relation.connect ============
  20496. 604.87 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20497. 604.87 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20498. 604.87 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20499. 604.87 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20500. 604.87 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20501. 604.87 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20502. 604.87 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  20503. 604.87 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20504. 604.87 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20505. 604.87 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20506. 604.87 s [algebraic-graphs]
  20507. 604.87 s [algebraic-graphs] ============ Relation.vertices ============
  20508. 604.87 s [algebraic-graphs] OK: vertices [] == empty
  20509. 604.87 s [algebraic-graphs] OK: vertices [x] == vertex x
  20510. 604.87 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20511. 604.87 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20512. 604.87 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20513. 604.87 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20514. 604.87 s [algebraic-graphs]
  20515. 604.87 s [algebraic-graphs] ============ Relation.edges ============
  20516. 604.87 s [algebraic-graphs] OK: edges [] == empty
  20517. 604.87 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20518. 604.87 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  20519. 604.87 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  20520. 604.87 s [algebraic-graphs]
  20521. 604.87 s [algebraic-graphs] ============ Relation.overlays ============
  20522. 604.87 s [algebraic-graphs] OK: overlays [] == empty
  20523. 604.87 s [algebraic-graphs] OK: overlays [x] == x
  20524. 604.87 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20525. 604.87 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20526. 604.87 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20527. 604.87 s [algebraic-graphs]
  20528. 604.87 s [algebraic-graphs] ============ Relation.connects ============
  20529. 604.87 s [algebraic-graphs] OK: connects [] == empty
  20530. 604.87 s [algebraic-graphs] OK: connects [x] == x
  20531. 604.87 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20532. 604.87 s [algebraic-graphs] OK: connects == foldr connect empty
  20533. 604.87 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20534. 604.87 s [algebraic-graphs]
  20535. 604.87 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  20536. 604.87 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20537. 604.87 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20538. 604.87 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20539. 604.87 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20540. 604.87 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20541. 604.87 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20542. 604.87 s [algebraic-graphs]
  20543. 604.87 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  20544. 604.87 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20545. 604.87 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20546. 604.87 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20547. 604.87 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20548. 604.87 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20549. 604.87 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20550. 604.87 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20551. 604.87 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20552. 604.87 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20553. 604.87 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20554. 604.87 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20555. 604.87 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20556. 604.87 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  20557. 604.87 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  20558. 604.87 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  20559. 604.87 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  20560. 604.87 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  20561. 608.76 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20562. 608.76 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20563. 608.76 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20564. 608.76 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20565. 608.76 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20566. 608.76 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20567. 608.76 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20568. 608.76 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20569. 608.76 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20570. 608.76 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20571. 608.76 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20572. 608.76 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20573. 608.76 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20574. 608.76 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20575. 608.76 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20576. 608.76 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20577. 608.76 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20578. 608.76 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20579. 608.76 s [algebraic-graphs]
  20580. 608.76 s [algebraic-graphs] ============ Relation.foldg ============
  20581. 608.76 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  20582. 608.76 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  20583. 608.76 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  20584. 608.76 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  20585. 608.76 s [algebraic-graphs]
  20586. 608.76 s [algebraic-graphs] ============ Relation.isEmpty ============
  20587. 608.76 s [algebraic-graphs] OK: isEmpty empty == True
  20588. 608.76 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20589. 608.76 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20590. 608.76 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20591. 608.76 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20592. 608.76 s [algebraic-graphs]
  20593. 608.76 s [algebraic-graphs] ============ Relation.hasVertex ============
  20594. 608.76 s [algebraic-graphs] OK: hasVertex x empty == False
  20595. 608.76 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20596. 608.76 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20597. 608.76 s [algebraic-graphs]
  20598. 608.76 s [algebraic-graphs] ============ Relation.hasEdge ============
  20599. 608.76 s [algebraic-graphs] OK: hasEdge x y empty == False
  20600. 608.76 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20601. 608.76 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20602. 608.76 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20603. 608.76 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  20604. 608.76 s [algebraic-graphs]
  20605. 608.76 s [algebraic-graphs] ============ Relation.vertexCount ============
  20606. 608.76 s [algebraic-graphs] OK: vertexCount empty == 0
  20607. 608.76 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20608. 608.76 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20609. 608.76 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20610. 608.76 s [algebraic-graphs]
  20611. 608.76 s [algebraic-graphs] ============ Relation.edgeCount ============
  20612. 608.76 s [algebraic-graphs] OK: edgeCount empty == 0
  20613. 608.76 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20614. 608.76 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20615. 608.76 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20616. 608.76 s [algebraic-graphs]
  20617. 608.76 s [algebraic-graphs] ============ Relation.vertexList ============
  20618. 608.76 s [algebraic-graphs] OK: vertexList empty == []
  20619. 608.76 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20620. 608.76 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20621. 608.76 s [algebraic-graphs]
  20622. 608.76 s [algebraic-graphs] ============ Relation.vertexSet ============
  20623. 608.76 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20624. 608.76 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20625. 608.76 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20626. 608.76 s [algebraic-graphs]
  20627. 608.76 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  20628. 608.76 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20629. 608.76 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20630. 608.76 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20631. 608.76 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20632. 608.76 s [algebraic-graphs]
  20633. 608.76 s [algebraic-graphs] ============ Relation.edgeList ============
  20634. 608.76 s [algebraic-graphs] OK: edgeList empty == []
  20635. 608.76 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20636. 608.76 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  20637. 608.76 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  20638. 608.76 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  20639. 608.76 s [algebraic-graphs]
  20640. 608.76 s [algebraic-graphs] ============ Relation.edgeSet ============
  20641. 608.76 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20642. 608.76 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20643. 608.76 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  20644. 608.76 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  20645. 608.76 s [algebraic-graphs]
  20646. 608.76 s [algebraic-graphs] ============ Relation.adjacencyList ============
  20647. 608.76 s [algebraic-graphs] OK: adjacencyList empty == []
  20648. 608.76 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20649. 608.76 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  20650. 608.76 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  20651. 608.76 s [algebraic-graphs]
  20652. 608.76 s [algebraic-graphs] ============ Relation.preSet ============
  20653. 608.76 s [algebraic-graphs] OK: preSet x empty == Set.empty
  20654. 608.76 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  20655. 608.76 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  20656. 608.76 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  20657. 608.76 s [algebraic-graphs]
  20658. 608.76 s [algebraic-graphs] ============ Relation.preIntSet ============
  20659. 608.76 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  20660. 608.76 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  20661. 608.76 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  20662. 608.76 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  20663. 608.76 s [algebraic-graphs]
  20664. 608.76 s [algebraic-graphs] ============ Relation.postSet ============
  20665. 608.76 s [algebraic-graphs] OK: postSet x empty == Set.empty
  20666. 608.76 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  20667. 608.76 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  20668. 608.76 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  20669. 608.76 s [algebraic-graphs]
  20670. 608.76 s [algebraic-graphs] ============ Relation.postIntSet ============
  20671. 608.76 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  20672. 608.76 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  20673. 608.76 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  20674. 608.76 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  20675. 608.76 s [algebraic-graphs]
  20676. 608.76 s [algebraic-graphs] ============ Relation.path ============
  20677. 608.76 s [algebraic-graphs] OK: path [] == empty
  20678. 608.76 s [algebraic-graphs] OK: path [x] == vertex x
  20679. 608.76 s [algebraic-graphs] OK: path [x,y] == edge x y
  20680. 608.76 s [algebraic-graphs]
  20681. 608.76 s [algebraic-graphs] ============ Relation.circuit ============
  20682. 608.76 s [algebraic-graphs] OK: circuit [] == empty
  20683. 608.76 s [algebraic-graphs] OK: circuit [x] == edge x x
  20684. 608.76 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20685. 608.76 s [algebraic-graphs]
  20686. 608.76 s [algebraic-graphs] ============ Relation.clique ============
  20687. 608.76 s [algebraic-graphs] OK: clique [] == empty
  20688. 608.76 s [algebraic-graphs] OK: clique [x] == vertex x
  20689. 608.76 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20690. 608.76 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20691. 608.76 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20692. 608.76 s [algebraic-graphs]
  20693. 608.76 s [algebraic-graphs] ============ Relation.biclique ============
  20694. 608.76 s [algebraic-graphs] OK: biclique [] [] == empty
  20695. 608.76 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20696. 608.76 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20697. 608.76 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20698. 608.76 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20699. 608.76 s [algebraic-graphs]
  20700. 608.76 s [algebraic-graphs] ============ Relation.star ============
  20701. 608.76 s [algebraic-graphs] OK: star x [] == vertex x
  20702. 608.76 s [algebraic-graphs] OK: star x [y] == edge x y
  20703. 608.76 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20704. 608.76 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20705. 608.76 s [algebraic-graphs]
  20706. 608.76 s [algebraic-graphs] ============ Relation.stars ============
  20707. 608.76 s [algebraic-graphs] OK: stars [] == empty
  20708. 608.76 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20709. 608.76 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20710. 608.76 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20711. 608.76 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20712. 608.76 s [algebraic-graphs] OK: stars . adjacencyList == id
  20713. 608.76 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20714. 608.76 s [algebraic-graphs]
  20715. 608.76 s [algebraic-graphs] ============ Relation.tree ============
  20716. 608.76 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20717. 608.76 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20718. 608.76 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20719. 608.76 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20720. 608.76 s [algebraic-graphs]
  20721. 608.76 s [algebraic-graphs] ============ Relation.forest ============
  20722. 608.76 s [algebraic-graphs] OK: forest [] == empty
  20723. 608.76 s [algebraic-graphs] OK: forest [x] == tree x
  20724. 608.76 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20725. 608.76 s [algebraic-graphs] OK: forest == overlays . map tree
  20726. 608.76 s [algebraic-graphs]
  20727. 608.76 s [algebraic-graphs] ============ Relation.removeVertex ============
  20728. 608.76 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20729. 608.76 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20730. 608.76 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20731. 608.76 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20732. 608.76 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20733. 608.76 s [algebraic-graphs]
  20734. 608.76 s [algebraic-graphs] ============ Relation.removeEdge ============
  20735. 608.76 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20736. 608.76 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20737. 608.76 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20738. 608.76 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20739. 608.76 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20740. 608.76 s [algebraic-graphs]
  20741. 608.76 s [algebraic-graphs] ============ Relation.replaceVertex ============
  20742. 608.76 s [algebraic-graphs] OK: replaceVertex x x == id
  20743. 608.76 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20744. 608.76 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20745. 608.76 s [algebraic-graphs]
  20746. 608.76 s [algebraic-graphs] ============ Relation.mergeVertices ============
  20747. 608.76 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20748. 633.92 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20749. 633.92 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20750. 633.96 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20751. 633.96 s [algebraic-graphs]
  20752. 633.96 s [algebraic-graphs] ============ Relation.transpose ============
  20753. 633.96 s [algebraic-graphs] OK: transpose empty == empty
  20754. 633.96 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20755. 633.96 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20756. 633.96 s [algebraic-graphs] OK: transpose . transpose == id
  20757. 633.96 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20758. 633.96 s [algebraic-graphs]
  20759. 633.96 s [algebraic-graphs] ============ Relation.gmap ============
  20760. 633.96 s [algebraic-graphs] OK: gmap f empty == empty
  20761. 633.96 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20762. 633.96 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20763. 633.96 s [algebraic-graphs] OK: gmap id == id
  20764. 633.96 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20765. 633.96 s [algebraic-graphs]
  20766. 633.96 s [algebraic-graphs] ============ Relation.induce ============
  20767. 633.96 s [algebraic-graphs] OK: induce (const True ) x == x
  20768. 633.96 s [algebraic-graphs] OK: induce (const False) x == empty
  20769. 633.96 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20770. 633.96 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20771. 633.96 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20772. 633.96 s [algebraic-graphs]
  20773. 633.96 s [algebraic-graphs] ============ Relation.compose ============
  20774. 633.96 s [algebraic-graphs] OK: compose empty x == empty
  20775. 633.96 s [algebraic-graphs] OK: compose x empty == empty
  20776. 633.96 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20777. 633.96 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20778. 633.96 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20779. 633.96 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20780. 633.96 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20781. 633.96 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20782. 633.96 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20783. 633.96 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20784. 633.96 s [algebraic-graphs]
  20785. 633.96 s [algebraic-graphs] ============ Relation.closure ============
  20786. 633.96 s [algebraic-graphs] OK: closure empty == empty
  20787. 633.96 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20788. 633.96 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20789. 633.96 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20790. 633.96 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20791. 633.96 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20792. 633.96 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20793. 633.96 s [algebraic-graphs] OK: closure . closure == closure
  20794. 633.96 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20795. 633.96 s [algebraic-graphs]
  20796. 633.96 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  20797. 633.97 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20798. 633.97 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20799. 633.97 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20800. 633.97 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20801. 633.97 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20802. 633.97 s [algebraic-graphs]
  20803. 633.97 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  20804. 633.97 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20805. 633.97 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20806. 633.97 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20807. 633.97 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20808. 633.97 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20809. 633.97 s [algebraic-graphs]
  20810. 633.97 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  20811. 633.97 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20812. 633.97 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20813. 633.97 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20814. 633.97 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20815. 633.97 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20816. 633.97 s [algebraic-graphs]
  20817. 633.97 s [algebraic-graphs] ============ Relation.induceJust ============
  20818. 633.97 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20819. 633.97 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20820. 633.97 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20821. 633.97 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20822. 633.97 s [algebraic-graphs]
  20823. 633.97 s [algebraic-graphs] ============ ReflexiveRelation ============
  20824. 633.97 s [algebraic-graphs] OK: Axioms of reflexive graphs
  20825. 633.97 s [algebraic-graphs]
  20826. 633.97 s [algebraic-graphs] ============ TransitiveRelation ============
  20827. 633.97 s [algebraic-graphs] OK: Axioms of transitive graphs
  20828. 633.97 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  20829. 633.97 s [algebraic-graphs]
  20830. 633.97 s [algebraic-graphs] ============ PreorderRelation ============
  20831. 633.97 s [algebraic-graphs] OK: Axioms of preorder graphs
  20832. 633.97 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  20833. 633.97 s [algebraic-graphs]
  20834. 633.97 s [algebraic-graphs] ============ Symmetric.Relation ============
  20835. 633.97 s [algebraic-graphs] OK: Axioms of undirected graphs
  20836. 633.97 s [algebraic-graphs]
  20837. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  20838. 633.97 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20839. 633.97 s [algebraic-graphs]
  20840. 633.97 s [algebraic-graphs] OK: consistent empty == True
  20841. 633.97 s [algebraic-graphs] OK: consistent (vertex x) == True
  20842. 633.97 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20843. 633.97 s [algebraic-graphs] OK: consistent (connect x y) == True
  20844. 633.97 s [algebraic-graphs] OK: consistent (edge x y) == True
  20845. 633.97 s [algebraic-graphs] OK: consistent (edges xs) == True
  20846. 633.97 s [algebraic-graphs] OK: consistent (stars xs) == True
  20847. 633.97 s [algebraic-graphs]
  20848. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  20849. 633.97 s [algebraic-graphs] OK: show (empty ) == "empty"
  20850. 633.97 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20851. 633.97 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20852. 633.97 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20853. 633.97 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20854. 633.97 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20855. 633.97 s [algebraic-graphs]
  20856. 633.97 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20857. 633.97 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20858. 633.97 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20859. 633.97 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20860. 633.97 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20861. 633.97 s [algebraic-graphs]
  20862. 633.97 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  20863. 633.97 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  20864. 633.97 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  20865. 633.97 s [algebraic-graphs]
  20866. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  20867. 633.97 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  20868. 633.97 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  20869. 633.97 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  20870. 633.97 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  20871. 633.97 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  20872. 633.97 s [algebraic-graphs]
  20873. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  20874. 633.97 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  20875. 633.97 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  20876. 633.97 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  20877. 633.97 s [algebraic-graphs]
  20878. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  20879. 633.97 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20880. 633.97 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20881. 633.97 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20882. 633.97 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20883. 633.97 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20884. 633.97 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  20885. 633.97 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  20886. 633.97 s [algebraic-graphs] OK: x <= x + y
  20887. 633.97 s [algebraic-graphs] OK: x + y <= x * y
  20888. 633.97 s [algebraic-graphs]
  20889. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  20890. 633.97 s [algebraic-graphs] OK: isEmpty empty == True
  20891. 633.97 s [algebraic-graphs] OK: hasVertex x empty == False
  20892. 633.97 s [algebraic-graphs] OK: vertexCount empty == 0
  20893. 633.97 s [algebraic-graphs] OK: edgeCount empty == 0
  20894. 633.97 s [algebraic-graphs]
  20895. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  20896. 633.97 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20897. 633.97 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20898. 633.97 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20899. 633.97 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20900. 633.97 s [algebraic-graphs]
  20901. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  20902. 633.97 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20903. 633.97 s [algebraic-graphs] OK: edge x y == edge y x
  20904. 633.97 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  20905. 633.97 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20906. 633.97 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20907. 633.97 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20908. 633.97 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20909. 633.97 s [algebraic-graphs]
  20910. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  20911. 633.97 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20912. 633.97 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20913. 633.97 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20914. 633.97 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20915. 633.97 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20916. 633.97 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20917. 633.97 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20918. 633.97 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20919. 633.97 s [algebraic-graphs]
  20920. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  20921. 633.97 s [algebraic-graphs] OK: connect x y == connect y x
  20922. 633.97 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20923. 633.97 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20924. 633.97 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20925. 633.97 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20926. 633.97 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20927. 633.97 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20928. 633.97 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  20929. 633.97 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20930. 633.97 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20931. 633.97 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20932. 633.97 s [algebraic-graphs]
  20933. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  20934. 633.97 s [algebraic-graphs] OK: vertices [] == empty
  20935. 633.97 s [algebraic-graphs] OK: vertices [x] == vertex x
  20936. 633.97 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20937. 633.97 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20938. 633.97 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20939. 633.97 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20940. 633.97 s [algebraic-graphs]
  20941. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  20942. 633.97 s [algebraic-graphs] OK: edges [] == empty
  20943. 633.97 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20944. 633.97 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  20945. 633.97 s [algebraic-graphs]
  20946. 633.97 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  20947. 633.97 s [algebraic-graphs] OK: overlays [] == empty
  20948. 650.11 s [algebraic-graphs] OK: overlays [x] == x
  20949. 650.14 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20950. 650.14 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20951. 650.14 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20952. 650.14 s [algebraic-graphs]
  20953. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  20954. 650.14 s [algebraic-graphs] OK: connects [] == empty
  20955. 650.14 s [algebraic-graphs] OK: connects [x] == x
  20956. 650.14 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20957. 650.14 s [algebraic-graphs] OK: connects == foldr connect empty
  20958. 650.14 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20959. 650.14 s [algebraic-graphs] OK: connects == connects . reverse
  20960. 650.14 s [algebraic-graphs]
  20961. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  20962. 650.14 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20963. 650.14 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20964. 650.14 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20965. 650.14 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20966. 650.14 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20967. 650.14 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20968. 650.14 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  20969. 650.14 s [algebraic-graphs]
  20970. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  20971. 650.14 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20972. 650.14 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20973. 650.14 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20974. 650.14 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20975. 650.14 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20976. 650.14 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20977. 650.14 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20978. 650.14 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20979. 650.14 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20980. 650.14 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20981. 650.14 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20982. 650.14 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20983. 650.14 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20984. 650.14 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20985. 650.14 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20986. 650.14 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20987. 650.14 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20988. 650.14 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20989. 650.14 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20990. 650.14 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20991. 650.14 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20992. 650.14 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20993. 650.14 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20994. 650.14 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20995. 650.14 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20996. 650.14 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20997. 650.14 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20998. 650.14 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20999. 650.14 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  21000. 650.14 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  21001. 650.14 s [algebraic-graphs]
  21002. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  21003. 650.14 s [algebraic-graphs] OK: isEmpty empty == True
  21004. 650.14 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  21005. 650.14 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21006. 650.14 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  21007. 650.14 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  21008. 650.14 s [algebraic-graphs]
  21009. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  21010. 650.14 s [algebraic-graphs] OK: hasVertex x empty == False
  21011. 650.14 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21012. 650.14 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  21013. 650.14 s [algebraic-graphs]
  21014. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  21015. 650.14 s [algebraic-graphs] OK: hasEdge x y empty == False
  21016. 650.14 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  21017. 650.14 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21018. 650.14 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  21019. 650.14 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  21020. 650.14 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  21021. 650.14 s [algebraic-graphs]
  21022. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  21023. 650.14 s [algebraic-graphs] OK: vertexCount empty == 0
  21024. 650.14 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21025. 650.14 s [algebraic-graphs] OK: vertexCount == length . vertexList
  21026. 650.14 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  21027. 650.14 s [algebraic-graphs]
  21028. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  21029. 650.14 s [algebraic-graphs] OK: edgeCount empty == 0
  21030. 650.14 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21031. 650.14 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21032. 650.14 s [algebraic-graphs] OK: edgeCount == length . edgeList
  21033. 650.14 s [algebraic-graphs]
  21034. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  21035. 650.14 s [algebraic-graphs] OK: vertexList empty == []
  21036. 650.14 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  21037. 650.14 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  21038. 650.14 s [algebraic-graphs]
  21039. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  21040. 650.14 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  21041. 650.14 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  21042. 650.14 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21043. 650.14 s [algebraic-graphs]
  21044. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  21045. 650.14 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  21046. 650.14 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  21047. 650.14 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  21048. 650.14 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  21049. 650.14 s [algebraic-graphs]
  21050. 650.14 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  21051. 650.14 s [algebraic-graphs] OK: edgeList empty == []
  21052. 650.15 s [algebraic-graphs] OK: edgeList (vertex x) == []
  21053. 650.15 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  21054. 650.15 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  21055. 650.15 s [algebraic-graphs]
  21056. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  21057. 650.15 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  21058. 650.15 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  21059. 650.15 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  21060. 650.15 s [algebraic-graphs]
  21061. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  21062. 650.15 s [algebraic-graphs] OK: adjacencyList empty == []
  21063. 650.15 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  21064. 650.15 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  21065. 650.15 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  21066. 650.15 s [algebraic-graphs]
  21067. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  21068. 650.15 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  21069. 650.15 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  21070. 650.15 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  21071. 650.15 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  21072. 650.15 s [algebraic-graphs]
  21073. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  21074. 650.15 s [algebraic-graphs] OK: path [] == empty
  21075. 650.15 s [algebraic-graphs] OK: path [x] == vertex x
  21076. 650.15 s [algebraic-graphs] OK: path [x,y] == edge x y
  21077. 650.15 s [algebraic-graphs] OK: path == path . reverse
  21078. 650.15 s [algebraic-graphs]
  21079. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  21080. 650.15 s [algebraic-graphs] OK: circuit [] == empty
  21081. 650.15 s [algebraic-graphs] OK: circuit [x] == edge x x
  21082. 650.15 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21083. 650.15 s [algebraic-graphs] OK: circuit == circuit . reverse
  21084. 650.15 s [algebraic-graphs]
  21085. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  21086. 650.15 s [algebraic-graphs] OK: clique [] == empty
  21087. 650.15 s [algebraic-graphs] OK: clique [x] == vertex x
  21088. 650.15 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21089. 650.15 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21090. 650.15 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21091. 650.15 s [algebraic-graphs] OK: clique == clique . reverse
  21092. 650.15 s [algebraic-graphs]
  21093. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  21094. 650.15 s [algebraic-graphs] OK: biclique [] [] == empty
  21095. 650.15 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21096. 650.15 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21097. 650.15 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21098. 650.15 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21099. 650.15 s [algebraic-graphs]
  21100. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  21101. 650.15 s [algebraic-graphs] OK: star x [] == vertex x
  21102. 650.15 s [algebraic-graphs] OK: star x [y] == edge x y
  21103. 650.15 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21104. 650.15 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21105. 650.15 s [algebraic-graphs]
  21106. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  21107. 650.15 s [algebraic-graphs] OK: stars [] == empty
  21108. 650.15 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21109. 650.15 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21110. 650.15 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21111. 650.15 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21112. 650.15 s [algebraic-graphs] OK: stars . adjacencyList == id
  21113. 650.15 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21114. 650.15 s [algebraic-graphs]
  21115. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  21116. 650.15 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21117. 650.15 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21118. 650.15 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21119. 650.15 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21120. 650.15 s [algebraic-graphs]
  21121. 650.15 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  21122. 650.15 s [algebraic-graphs] OK: forest [] == empty
  21123. 659.67 s [algebraic-graphs] OK: forest [x] == tree x
  21124. 659.67 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21125. 659.70 s [algebraic-graphs] OK: forest == overlays . map tree
  21126. 659.70 s [algebraic-graphs]
  21127. 659.70 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  21128. 659.70 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21129. 659.70 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21130. 659.70 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21131. 659.70 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21132. 659.70 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21133. 659.70 s [algebraic-graphs]
  21134. 659.70 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  21135. 659.70 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21136. 659.70 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21137. 659.70 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21138. 659.70 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21139. 659.70 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21140. 659.70 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  21141. 659.70 s [algebraic-graphs]
  21142. 659.70 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  21143. 659.70 s [algebraic-graphs] OK: replaceVertex x x == id
  21144. 659.70 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21145. 659.70 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21146. 659.70 s [algebraic-graphs]
  21147. 659.70 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  21148. 659.70 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21149. 659.70 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21150. 659.70 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21151. 659.70 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21152. 659.70 s [algebraic-graphs]
  21153. 659.70 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  21154. 659.70 s [algebraic-graphs] OK: gmap f empty == empty
  21155. 659.70 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21156. 659.70 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21157. 659.70 s [algebraic-graphs] OK: gmap id == id
  21158. 659.70 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21159. 659.70 s [algebraic-graphs]
  21160. 659.70 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  21161. 659.70 s [algebraic-graphs] OK: induce (const True ) x == x
  21162. 659.70 s [algebraic-graphs] OK: induce (const False) x == empty
  21163. 659.70 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21164. 659.70 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21165. 659.70 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21166. 659.70 s [algebraic-graphs]
  21167. 659.70 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  21168. 659.70 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21169. 659.70 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21170. 659.70 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21171. 659.70 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21172. 659.70 s [algebraic-graphs]
  21173. 659.70 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  21174. 659.70 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  21175. 659.70 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  21176. 659.71 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  21177. 659.71 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  21178. 659.71 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  21179. 659.71 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  21180. 659.71 s [algebraic-graphs]
  21181. 659.71 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  21182. 659.71 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  21183. 659.71 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  21184. 659.71 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  21185. 659.71 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  21186. 659.71 s [algebraic-graphs]
  21187. 659.71 s [algebraic-graphs] ============ Typed ============
  21188. 659.71 s [algebraic-graphs]
  21189. 659.71 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  21190. 659.71 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  21191. 659.71 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  21192. 659.71 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  21193. 659.71 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  21194. 659.71 s [algebraic-graphs]
  21195. 659.71 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  21196. 659.71 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  21197. 659.71 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  21198. 659.71 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  21199. 659.71 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  21200. 659.71 s [algebraic-graphs]
  21201. 659.71 s [algebraic-graphs] ============ Typed.dfsForest ============
  21202. 659.71 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  21203. 659.71 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  21204. 659.71 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  21205. 659.71 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  21206. 659.71 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  21207. 659.71 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  21208. 659.71 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  21209. 659.71 s [algebraic-graphs]
  21210. 659.71 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  21211. 659.71 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  21212. 659.71 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  21213. 659.71 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  21214. 659.71 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  21215. 659.71 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  21216. 659.71 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  21217. 659.71 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  21218. 659.71 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  21219. 659.71 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  21220. 659.71 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  21221. 659.71 s [algebraic-graphs]
  21222. 659.71 s [algebraic-graphs] ============ Typed.dfs ============
  21223. 659.71 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  21224. 659.71 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  21225. 659.71 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  21226. 659.71 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  21227. 659.71 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  21228. 659.71 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  21229. 659.71 s [algebraic-graphs] OK: dfs % x $ [] == []
  21230. 659.71 s [algebraic-graphs]
  21231. 659.71 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  21232. 659.71 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  21233. 659.71 s [algebraic-graphs]
  21234. 659.71 s [algebraic-graphs] ============ Typed.topSort ============
  21235. 659.71 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  21236. 659.71 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  21237. 659.71 s [algebraic-graphs]
  21238. 659.71 s [algebraic-graphs] ============ Graph.Undirected ============
  21239. 659.71 s [algebraic-graphs] OK: Axioms of undirected graphs
  21240. 659.71 s [algebraic-graphs]
  21241. 659.71 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  21242. 659.71 s [algebraic-graphs] OK: show (empty ) == "empty"
  21243. 659.71 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  21244. 659.71 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  21245. 659.71 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  21246. 659.71 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  21247. 659.71 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  21248. 659.71 s [algebraic-graphs]
  21249. 659.71 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  21250. 659.71 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  21251. 659.71 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  21252. 659.71 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  21253. 659.71 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  21254. 659.71 s [algebraic-graphs]
  21255. 659.71 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  21256. 659.71 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  21257. 659.71 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  21258. 659.71 s [algebraic-graphs]
  21259. 659.71 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  21260. 659.71 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  21261. 659.71 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  21262. 659.71 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  21263. 659.71 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  21264. 659.71 s [algebraic-graphs]
  21265. 659.71 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  21266. 659.71 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  21267. 659.71 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  21268. 659.71 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  21269. 659.71 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  21270. 659.71 s [algebraic-graphs]
  21271. 659.71 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  21272. 659.71 s [algebraic-graphs] OK: complement empty == empty
  21273. 659.71 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  21274. 659.71 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  21275. 659.71 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  21276. 659.71 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  21277. 659.71 s [algebraic-graphs] OK: complement . complement == id
  21278. 659.71 s [algebraic-graphs]
  21279. 659.71 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  21280. 659.71 s [algebraic-graphs] OK: vertex 1 < vertex 2
  21281. 659.71 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  21282. 659.71 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  21283. 659.71 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  21284. 659.71 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  21285. 659.71 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  21286. 659.71 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  21287. 659.71 s [algebraic-graphs] OK: x <= x + y
  21288. 659.71 s [algebraic-graphs] OK: x + y <= x * y
  21289. 659.71 s [algebraic-graphs]
  21290. 659.71 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  21291. 659.71 s [algebraic-graphs] OK: isEmpty empty == True
  21292. 659.71 s [algebraic-graphs] OK: hasVertex x empty == False
  21293. 659.71 s [algebraic-graphs] OK: vertexCount empty == 0
  21294. 659.71 s [algebraic-graphs] OK: edgeCount empty == 0
  21295. 659.71 s [algebraic-graphs]
  21296. 659.71 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  21297. 659.71 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  21298. 659.71 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  21299. 659.71 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  21300. 659.71 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  21301. 659.71 s [algebraic-graphs]
  21302. 659.71 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  21303. 659.71 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  21304. 659.71 s [algebraic-graphs] OK: edge x y == edge y x
  21305. 671.69 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  21306. 671.69 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  21307. 671.69 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  21308. 671.72 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  21309. 671.72 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  21310. 671.72 s [algebraic-graphs]
  21311. 671.72 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  21312. 671.72 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  21313. 671.72 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  21314. 671.72 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  21315. 671.72 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  21316. 671.72 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  21317. 671.72 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  21318. 671.72 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  21319. 671.72 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  21320. 671.72 s [algebraic-graphs]
  21321. 671.72 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  21322. 671.72 s [algebraic-graphs] OK: connect x y == connect y x
  21323. 671.72 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  21324. 671.72 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  21325. 671.72 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  21326. 671.72 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  21327. 671.72 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  21328. 671.72 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  21329. 671.72 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  21330. 671.72 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  21331. 671.72 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  21332. 671.72 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  21333. 671.72 s [algebraic-graphs]
  21334. 671.72 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  21335. 671.72 s [algebraic-graphs] OK: vertices [] == empty
  21336. 671.72 s [algebraic-graphs] OK: vertices [x] == vertex x
  21337. 671.72 s [algebraic-graphs] OK: vertices == overlays . map vertex
  21338. 671.72 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  21339. 671.72 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  21340. 671.72 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  21341. 671.72 s [algebraic-graphs]
  21342. 671.72 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  21343. 671.72 s [algebraic-graphs] OK: edges [] == empty
  21344. 671.72 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  21345. 671.72 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  21346. 671.72 s [algebraic-graphs]
  21347. 671.73 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  21348. 671.73 s [algebraic-graphs] OK: overlays [] == empty
  21349. 671.73 s [algebraic-graphs] OK: overlays [x] == x
  21350. 671.73 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  21351. 671.73 s [algebraic-graphs] OK: overlays == foldr overlay empty
  21352. 671.73 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  21353. 671.73 s [algebraic-graphs]
  21354. 671.73 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  21355. 671.73 s [algebraic-graphs] OK: connects [] == empty
  21356. 671.73 s [algebraic-graphs] OK: connects [x] == x
  21357. 671.73 s [algebraic-graphs] OK: connects [x,y] == connect x y
  21358. 671.73 s [algebraic-graphs] OK: connects == foldr connect empty
  21359. 671.73 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  21360. 671.73 s [algebraic-graphs] OK: connects == connects . reverse
  21361. 671.73 s [algebraic-graphs]
  21362. 671.73 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  21363. 671.73 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  21364. 671.73 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  21365. 671.73 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  21366. 671.73 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  21367. 671.73 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  21368. 671.73 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  21369. 671.73 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  21370. 671.73 s [algebraic-graphs]
  21371. 671.73 s [algebraic-graphs] ============ Graph.Undirected.path ============
  21372. 671.73 s [algebraic-graphs] OK: path [] == empty
  21373. 671.73 s [algebraic-graphs] OK: path [x] == vertex x
  21374. 671.73 s [algebraic-graphs] OK: path [x,y] == edge x y
  21375. 671.73 s [algebraic-graphs] OK: path == path . reverse
  21376. 671.73 s [algebraic-graphs]
  21377. 671.73 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  21378. 671.73 s [algebraic-graphs] OK: circuit [] == empty
  21379. 671.73 s [algebraic-graphs] OK: circuit [x] == edge x x
  21380. 671.73 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  21381. 671.73 s [algebraic-graphs] OK: circuit == circuit . reverse
  21382. 671.73 s [algebraic-graphs]
  21383. 671.73 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  21384. 671.73 s [algebraic-graphs] OK: clique [] == empty
  21385. 671.73 s [algebraic-graphs] OK: clique [x] == vertex x
  21386. 671.73 s [algebraic-graphs] OK: clique [x,y] == edge x y
  21387. 671.73 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  21388. 671.73 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  21389. 671.73 s [algebraic-graphs] OK: clique == clique . reverse
  21390. 671.73 s [algebraic-graphs]
  21391. 671.73 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  21392. 671.73 s [algebraic-graphs] OK: biclique [] [] == empty
  21393. 671.73 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  21394. 671.73 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  21395. 671.73 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  21396. 671.73 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  21397. 671.73 s [algebraic-graphs]
  21398. 671.73 s [algebraic-graphs] ============ Graph.Undirected.star ============
  21399. 671.73 s [algebraic-graphs] OK: star x [] == vertex x
  21400. 671.73 s [algebraic-graphs] OK: star x [y] == edge x y
  21401. 671.73 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  21402. 671.73 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  21403. 671.73 s [algebraic-graphs]
  21404. 671.73 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  21405. 671.73 s [algebraic-graphs] OK: stars [] == empty
  21406. 671.73 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  21407. 671.73 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  21408. 671.73 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  21409. 671.73 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  21410. 671.73 s [algebraic-graphs] OK: stars . adjacencyList == id
  21411. 671.73 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  21412. 671.73 s [algebraic-graphs]
  21413. 671.73 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  21414. 671.73 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  21415. 671.73 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  21416. 671.73 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  21417. 671.73 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  21418. 671.73 s [algebraic-graphs]
  21419. 671.73 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  21420. 671.73 s [algebraic-graphs] OK: forest [] == empty
  21421. 671.73 s [algebraic-graphs] OK: forest [x] == tree x
  21422. 671.73 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  21423. 671.73 s [algebraic-graphs] OK: forest == overlays . map tree
  21424. 671.73 s [algebraic-graphs]
  21425. 671.73 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  21426. 671.73 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  21427. 671.73 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  21428. 671.73 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  21429. 671.73 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  21430. 671.73 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  21431. 671.73 s [algebraic-graphs]
  21432. 671.73 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  21433. 671.73 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  21434. 671.73 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  21435. 671.73 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  21436. 671.73 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  21437. 671.73 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  21438. 671.73 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  21439. 671.73 s [algebraic-graphs]
  21440. 671.73 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  21441. 671.73 s [algebraic-graphs] OK: replaceVertex x x == id
  21442. 671.73 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  21443. 671.73 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  21444. 671.73 s [algebraic-graphs]
  21445. 671.73 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  21446. 671.73 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  21447. 671.73 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  21448. 671.73 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  21449. 671.73 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  21450. 671.73 s [algebraic-graphs]
  21451. 671.73 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  21452. 671.73 s [algebraic-graphs] OK: gmap f empty == empty
  21453. 671.73 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  21454. 671.73 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  21455. 671.73 s [algebraic-graphs] OK: gmap id == id
  21456. 671.73 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  21457. 671.73 s [algebraic-graphs]
  21458. 671.73 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  21459. 671.73 s [algebraic-graphs] OK: induce (const True ) x == x
  21460. 671.73 s [algebraic-graphs] OK: induce (const False) x == empty
  21461. 671.73 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  21462. 671.73 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  21463. 671.73 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  21464. 671.73 s [algebraic-graphs]
  21465. 671.73 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  21466. 671.73 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  21467. 671.73 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  21468. 671.73 s [algebraic-graphs] OK: induceJust . gmap Just == id
  21469. 671.73 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  21470. 671.73 s [algebraic-graphs] Test suite main: PASS
  21471. 671.73 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  21472. 671.73 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  21473. 671.73 s [algebraic-graphs] checkPhase completed in 2 minutes 19 seconds
  21474. 671.73 s [algebraic-graphs] Phase: haddockPhase
  21475. 672.30 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  21476. 672.30 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7...
  21477. 672.54 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing ) [HIE file is missing]
  21478. 672.92 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing ) [HIE file is missing]
  21479. 673.03 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing ) [HIE file is missing]
  21480. 673.12 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing ) [HIE file is missing]
  21481. 673.27 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing ) [HIE file is missing]
  21482. 673.54 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing ) [HIE file is missing]
  21483. 673.59 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing ) [HIE file is missing]
  21484. 673.78 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing ) [HIE file is missing]
  21485. 674.01 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing ) [HIE file is missing]
  21486. 674.25 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing ) [HIE file is missing]
  21487. 674.39 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing ) [HIE file is missing]
  21488. 674.49 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  21489. 674.49 s [algebraic-graphs] In the use of ‘head’
  21490. 674.49 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  21491. 674.49 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  21492. 674.49 s [algebraic-graphs] |
  21493. 674.49 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  21494. 674.49 s [algebraic-graphs] | ^^^^
  21495. 674.49 s [algebraic-graphs]
  21496. 674.50 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  21497. 674.50 s [algebraic-graphs] In the use of ‘tail’
  21498. 674.50 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  21499. 674.50 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 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  21500. 674.50 s [algebraic-graphs] |
  21501. 674.50 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  21502. 674.50 s [algebraic-graphs] | ^^^^
  21503. 674.50 s [algebraic-graphs]
  21504. 674.50 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  21505. 674.50 s [algebraic-graphs] In the use of ‘head’
  21506. 674.50 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  21507. 674.50 s [algebraic-graphs] "This is a partial function, it throws an error on empty lists. Use pattern matching, 'Data.List.uncons' or 'Data.Maybe.listToMaybe' instead. Consider refactoring to use "Data.List.NonEmpty"."
  21508. 674.50 s [algebraic-graphs] |
  21509. 674.50 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  21510. 674.50 s [algebraic-graphs] | ^^^^
  21511. 674.50 s [algebraic-graphs]
  21512. 674.50 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  21513. 674.50 s [algebraic-graphs] In the use of ‘tail’
  21514. 674.50 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  21515. 674.50 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 'GHC.Internal.Data.List.uncons' instead. Consider refactoring to use "Data.List.NonEmpty"."
  21516. 674.50 s [algebraic-graphs] |
  21517. 674.50 s [algebraic-graphs] 397 | bnd' = tail bnd
  21518. 674.50 s [algebraic-graphs] | ^^^^
  21519. 674.50 s [algebraic-graphs]
  21520. 674.51 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing ) [HIE file is missing]
  21521. 674.56 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing ) [HIE file is missing]
  21522. 674.75 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21523. 674.75 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21524. 674.75 s [algebraic-graphs] will become an error in a future GHC release.
  21525. 674.75 s [algebraic-graphs] Suggested fix:
  21526. 674.75 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  21527. 674.75 s [algebraic-graphs] |
  21528. 674.75 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  21529. 674.75 s [algebraic-graphs] | ^
  21530. 674.75 s [algebraic-graphs]
  21531. 674.75 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21532. 674.75 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21533. 674.75 s [algebraic-graphs] will become an error in a future GHC release.
  21534. 674.75 s [algebraic-graphs] Suggested fix:
  21535. 674.75 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  21536. 674.75 s [algebraic-graphs] |
  21537. 674.75 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  21538. 674.75 s [algebraic-graphs] | ^
  21539. 674.75 s [algebraic-graphs]
  21540. 674.76 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21541. 674.76 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21542. 674.76 s [algebraic-graphs] will become an error in a future GHC release.
  21543. 674.76 s [algebraic-graphs] Suggested fix:
  21544. 674.76 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  21545. 674.76 s [algebraic-graphs] |
  21546. 674.76 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  21547. 674.76 s [algebraic-graphs] | ^
  21548. 674.76 s [algebraic-graphs]
  21549. 674.76 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21550. 674.76 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21551. 674.76 s [algebraic-graphs] will become an error in a future GHC release.
  21552. 674.76 s [algebraic-graphs] Suggested fix:
  21553. 674.76 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  21554. 674.76 s [algebraic-graphs] |
  21555. 674.76 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  21556. 674.76 s [algebraic-graphs] | ^
  21557. 674.76 s [algebraic-graphs]
  21558. 674.76 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21559. 674.76 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21560. 674.76 s [algebraic-graphs] will become an error in a future GHC release.
  21561. 674.76 s [algebraic-graphs] Suggested fix:
  21562. 674.76 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  21563. 674.76 s [algebraic-graphs] |
  21564. 674.76 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  21565. 674.76 s [algebraic-graphs] | ^
  21566. 674.76 s [algebraic-graphs]
  21567. 674.76 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21568. 674.76 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21569. 674.76 s [algebraic-graphs] will become an error in a future GHC release.
  21570. 674.76 s [algebraic-graphs] Suggested fix:
  21571. 674.76 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  21572. 674.76 s [algebraic-graphs] |
  21573. 674.76 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  21574. 674.76 s [algebraic-graphs] | ^
  21575. 674.76 s [algebraic-graphs]
  21576. 674.76 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21577. 674.76 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21578. 674.76 s [algebraic-graphs] will become an error in a future GHC release.
  21579. 674.76 s [algebraic-graphs] Suggested fix:
  21580. 674.76 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  21581. 674.76 s [algebraic-graphs] |
  21582. 674.76 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  21583. 674.77 s [algebraic-graphs] | ^
  21584. 674.77 s [algebraic-graphs]
  21585. 674.77 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing ) [HIE file is missing]
  21586. 674.93 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing ) [HIE file is missing]
  21587. 675.05 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing ) [HIE file is missing]
  21588. 675.35 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing ) [HIE file is missing]
  21589. 675.54 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing ) [HIE file is missing]
  21590. 675.77 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing ) [HIE file is missing]
  21591. 675.79 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing ) [HIE file is missing]
  21592. 675.81 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing ) [HIE file is missing]
  21593. 675.85 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21594. 675.85 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21595. 675.85 s [algebraic-graphs] will become an error in a future GHC release.
  21596. 675.85 s [algebraic-graphs] Suggested fix:
  21597. 675.85 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  21598. 675.85 s [algebraic-graphs] |
  21599. 675.85 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  21600. 675.85 s [algebraic-graphs] | ^
  21601. 675.85 s [algebraic-graphs]
  21602. 675.85 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing ) [HIE file is missing]
  21603. 675.88 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21604. 675.88 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21605. 675.88 s [algebraic-graphs] will become an error in a future GHC release.
  21606. 675.88 s [algebraic-graphs] Suggested fix:
  21607. 675.88 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  21608. 675.88 s [algebraic-graphs] |
  21609. 675.88 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  21610. 675.88 s [algebraic-graphs] | ^
  21611. 675.88 s [algebraic-graphs]
  21612. 675.88 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  21613. 675.88 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  21614. 675.88 s [algebraic-graphs] will become an error in a future GHC release.
  21615. 675.88 s [algebraic-graphs] Suggested fix:
  21616. 675.88 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  21617. 675.88 s [algebraic-graphs] |
  21618. 675.88 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  21619. 675.88 s [algebraic-graphs] | ^
  21620. 675.88 s [algebraic-graphs]
  21621. 675.89 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing ) [HIE file is missing]
  21622. 676.01 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing ) [HIE file is missing]
  21623. 676.18 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing ) [HIE file is missing]
  21624. 676.20 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing ) [HIE file is missing]
  21625. 676.22 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing ) [HIE file is missing]
  21626. 676.25 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing ) [HIE file is missing]
  21627. 676.28 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing ) [HIE file is missing]
  21628. 676.31 s [algebraic-graphs] Haddock coverage:
  21629. 676.32 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21630. 676.32 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21631. 676.32 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21632. 676.32 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21633. 676.32 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21634. 676.32 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  21635. 676.44 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  21636. 676.45 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21637. 676.45 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  21638. 676.45 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21639. 676.45 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21640. 676.45 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21641. 676.45 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  21642. 676.46 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  21643. 676.47 s [algebraic-graphs] Warning: 'nub' is out of scope.
  21644. 676.47 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21645. 676.48 s [algebraic-graphs] Warning: 'sort' is out of scope.
  21646. 676.48 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21647. 676.48 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  21648. 676.48 s [algebraic-graphs] Missing documentation for:
  21649. 676.48 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  21650. 676.48 s [algebraic-graphs] Warning: 'List' is ambiguous. It is defined
  21651. 676.48 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
  21652. 676.48 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
  21653. 676.48 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21654. 676.48 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21655. 676.48 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
  21656. 676.48 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  21657. 676.48 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21658. 676.48 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  21659. 676.49 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  21660. 676.49 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
  21661. 676.49 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
  21662. 676.49 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21663. 676.49 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21664. 676.49 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
  21665. 676.49 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21666. 676.49 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  21667. 676.49 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21668. 676.49 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21669. 676.49 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21670. 676.49 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
  21671. 676.63 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  21672. 676.63 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  21673. 676.63 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21674. 676.63 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  21675. 676.63 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21676. 676.63 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  21677. 676.63 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21678. 676.63 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  21679. 676.63 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21680. 676.64 s [algebraic-graphs] Warning: 'box' is out of scope.
  21681. 676.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21682. 676.64 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  21683. 676.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21684. 676.64 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  21685. 676.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21686. 676.64 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  21687. 676.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21688. 676.64 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  21689. 676.64 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21690. 676.64 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  21691. 676.65 s [algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
  21692. 676.65 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  21693. 676.65 s [algebraic-graphs] * in ‘GHC.Internal.Data.Tuple’
  21694. 676.65 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21695. 676.65 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21696. 676.65 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  21697. 676.65 s [algebraic-graphs] Warning: 'nub' is out of scope.
  21698. 676.65 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21699. 676.65 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21700. 676.65 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21701. 676.65 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21702. 676.65 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21703. 676.65 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21704. 676.65 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21705. 676.67 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  21706. 676.67 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21707. 676.67 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21708. 676.67 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21709. 676.67 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21710. 676.67 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21711. 676.67 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21712. 676.67 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  21713. 676.67 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21714. 676.67 s [algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
  21715. 676.67 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
  21716. 676.67 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  21717. 676.67 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21718. 676.67 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21719. 676.67 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  21720. 676.68 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  21721. 676.68 s [algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
  21722. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
  21723. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
  21724. 676.68 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21725. 676.68 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21726. 676.68 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
  21727. 676.68 s [algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
  21728. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
  21729. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
  21730. 676.68 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21731. 676.68 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21732. 676.68 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
  21733. 676.68 s [algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
  21734. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
  21735. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
  21736. 676.68 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21737. 676.68 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21738. 676.68 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
  21739. 676.68 s [algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
  21740. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
  21741. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
  21742. 676.68 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21743. 676.68 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21744. 676.68 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
  21745. 676.68 s [algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
  21746. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
  21747. 676.68 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
  21748. 676.68 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21749. 676.68 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21750. 676.68 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
  21751. 676.68 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  21752. 676.69 s [algebraic-graphs] Warning: 'empty' is out of scope.
  21753. 676.69 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21754. 676.94 s [algebraic-graphs] Warning: 'edges' is out of scope.
  21755. 676.94 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21756. 676.94 s [algebraic-graphs] Warning: 'stars' is out of scope.
  21757. 676.94 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21758. 676.94 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  21759. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  21760. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  21761. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21762. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21763. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  21764. 676.94 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  21765. 676.94 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21766. 676.94 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  21767. 676.94 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21768. 676.94 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  21769. 676.94 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21770. 676.94 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  21771. 676.94 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  21772. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21773. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  21774. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21775. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21776. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  21777. 676.94 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  21778. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  21779. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  21780. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21781. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21782. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  21783. 676.94 s [algebraic-graphs] Warning: 'nub' is out of scope.
  21784. 676.94 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21785. 676.94 s [algebraic-graphs] Warning: 'sort' is out of scope.
  21786. 676.94 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21787. 676.94 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  21788. 676.94 s [algebraic-graphs] Missing documentation for:
  21789. 676.94 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  21790. 676.94 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21791. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  21792. 676.94 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21793. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21794. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21795. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  21796. 676.94 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  21797. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
  21798. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21799. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21800. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21801. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21802. 676.94 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  21803. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
  21804. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  21805. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21806. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21807. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  21808. 676.94 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  21809. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
  21810. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  21811. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21812. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21813. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
  21814. 676.94 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  21815. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
  21816. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  21817. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21818. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21819. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
  21820. 676.94 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  21821. 676.94 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  21822. 676.94 s [algebraic-graphs] * at src/Algebra/Graph.hs:482:1
  21823. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  21824. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21825. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21826. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  21827. 676.94 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  21828. 676.94 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  21829. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
  21830. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  21831. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21832. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21833. 676.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
  21834. 676.94 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21835. 676.94 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  21836. 676.94 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21837. 676.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21838. 676.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21839. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  21840. 676.95 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  21841. 676.95 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21842. 676.95 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  21843. 676.95 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21844. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  21845. 676.95 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21846. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21847. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21848. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  21849. 676.95 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  21850. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  21851. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  21852. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21853. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21854. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  21855. 676.95 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  21856. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  21857. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  21858. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21859. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21860. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  21861. 676.95 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  21862. 676.95 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  21863. 676.95 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21864. 676.95 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  21865. 676.95 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21866. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  21867. 676.95 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21868. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21869. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21870. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  21871. 676.95 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  21872. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  21873. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  21874. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21875. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21876. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  21877. 676.95 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  21878. 676.95 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  21879. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
  21880. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
  21881. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21882. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21883. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
  21884. 676.95 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21885. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  21886. 676.95 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21887. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21888. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21889. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
  21890. 676.95 s [algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
  21891. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
  21892. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
  21893. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21894. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21895. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
  21896. 676.95 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  21897. 676.95 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  21898. 676.95 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  21899. 676.95 s [algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
  21900. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
  21901. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
  21902. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21903. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21904. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
  21905. 676.95 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  21906. 676.95 s [algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
  21907. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
  21908. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
  21909. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21910. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21911. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
  21912. 676.95 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  21913. 676.95 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21914. 676.95 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  21915. 676.95 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21916. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  21917. 676.95 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21918. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21919. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21920. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  21921. 676.95 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  21922. 676.95 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  21923. 676.95 s [algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
  21924. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
  21925. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
  21926. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21927. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21928. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
  21929. 676.95 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  21930. 676.95 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21931. 676.95 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  21932. 676.95 s [algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
  21933. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
  21934. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  21935. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21936. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21937. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  21938. 676.95 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  21939. 676.95 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21940. 676.95 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  21941. 676.95 s [algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
  21942. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
  21943. 676.95 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
  21944. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21945. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21946. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
  21947. 676.95 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  21948. 676.95 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21949. 676.95 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  21950. 676.95 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  21951. 676.95 s [algebraic-graphs] Missing documentation for:
  21952. 676.95 s [algebraic-graphs] Module header
  21953. 676.95 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  21954. 676.95 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
  21955. 676.95 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
  21956. 676.95 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
  21957. 676.95 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
  21958. 676.95 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
  21959. 676.95 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
  21960. 676.95 s [algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
  21961. 676.95 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
  21962. 676.95 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
  21963. 676.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21964. 676.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21965. 676.95 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
  21966. 676.95 s [algebraic-graphs] Warning: 'array' is out of scope.
  21967. 676.95 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21968. 676.95 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  21969. 676.95 s [algebraic-graphs] Missing documentation for:
  21970. 676.95 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
  21971. 677.23 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
  21972. 677.23 s [algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
  21973. 677.23 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  21974. 677.23 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  21975. 677.25 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
  21976. 677.25 s [algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
  21977. 677.25 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  21978. 677.25 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  21979. 677.26 s [algebraic-graphs] Warning: Algebra.Graph.Internal: could not find link destinations for:
  21980. 677.26 s [algebraic-graphs] - Algebra.Graph.Internal.D:R:ItemList
  21981. 677.28 s [algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
  21982. 677.28 s [algebraic-graphs] - Algebra.Graph.Rep_Graph
  21983. 677.28 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  21984. 677.28 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  21985. 677.30 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
  21986. 677.30 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
  21987. 677.30 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
  21988. 677.30 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
  21989. 677.31 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
  21990. 677.31 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
  21991. 677.31 s [algebraic-graphs] Warning: Algebra.Graph.Label: could not find link destinations for:
  21992. 677.31 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemLabel
  21993. 677.31 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemMinimum
  21994. 677.32 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
  21995. 677.32 s [algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
  21996. 677.32 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  21997. 677.34 s [algebraic-graphs] Warning: Algebra.Graph.ToGraph: could not find link destinations for:
  21998. 677.34 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  21999. 677.34 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  22000. 677.34 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  22001. 677.34 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  22002. 677.34 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  22003. 677.34 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  22004. 677.34 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  22005. 677.34 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  22006. 677.34 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  22007. 677.36 s [algebraic-graphs] Warning: Algebra.Graph.Relation: could not find link destinations for:
  22008. 677.36 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  22009. 677.36 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  22010. 677.37 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
  22011. 677.37 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  22012. 677.37 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  22013. 677.39 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
  22014. 677.39 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  22015. 677.40 s [algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
  22016. 677.40 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
  22017. 677.40 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  22018. 677.40 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  22019. 677.41 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  22020. 677.41 s [algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
  22021. 677.41 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  22022. 677.41 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  22023. 677.44 s [algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
  22024. 677.44 s [algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
  22025. 677.44 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  22026. 677.45 s [algebraic-graphs] Warning: Algebra.Graph.Class: could not find link destinations for:
  22027. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  22028. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  22029. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  22030. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexFUN
  22031. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  22032. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  22033. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  22034. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexMaybe
  22035. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  22036. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  22037. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple2
  22038. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple3
  22039. 677.45 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexUnit
  22040. 677.45 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  22041. 677.45 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  22042. 677.45 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  22043. 677.45 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  22044. 677.45 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
  22045. 677.45 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  22046. 677.45 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
  22047. 677.45 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  22048. 677.45 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
  22049. 677.45 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  22050. 677.45 s [algebraic-graphs] Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
  22051. 677.45 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  22052. 685.13 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs,
  22053. 685.17 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  22054. 685.82 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  22055. 685.94 s [algebraic-graphs] Phase: installPhase
  22056. 686.04 s [algebraic-graphs] Installing library in /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  22057. 686.87 s [algebraic-graphs] Phase: fixupPhase
  22058. 686.89 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7
  22059. 686.92 s [algebraic-graphs] shrinking /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSalgebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI-ghc9.12.1.so
  22060. 686.92 s [algebraic-graphs] checking for references to /build/ in /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7...
  22061. 686.96 s [algebraic-graphs] patching script interpreter paths in /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7
  22062. 686.97 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7/lib
  22063. 687.29 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/zwi1ml033xyrj6h60hxfvgwcsfkcz4sa-algebraic-graphs-0.7-doc
  22064. 687.31 s [algebraic-graphs] checking for references to /build/ in /nix/store/zwi1ml033xyrj6h60hxfvgwcsfkcz4sa-algebraic-graphs-0.7-doc...
  22065. 687.33 s [algebraic-graphs] patching script interpreter paths in /nix/store/zwi1ml033xyrj6h60hxfvgwcsfkcz4sa-algebraic-graphs-0.7-doc
  22066. 687.52 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/zwi1ml033xyrj6h60hxfvgwcsfkcz4sa-algebraic-graphs-0.7-doc /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7
  22067. 688.06 s [algebraic-graphs:post-build] Pushing 2 paths (66 are already present) using zstd to cache sellout ⏳
  22068. 688.06 s [algebraic-graphs:post-build]
  22069. 688.43 s [algebraic-graphs:post-build] Pushing /nix/store/zwi1ml033xyrj6h60hxfvgwcsfkcz4sa-algebraic-graphs-0.7-doc (10.41 MiB)
  22070. 688.50 s [algebraic-graphs:post-build] Pushing /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7 (25.82 MiB)
  22071. 689.78 s [algebraic-graphs:post-build]
  22072. 689.78 s [algebraic-graphs:post-build] All done.
  22073. 689.81 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/zwi1ml033xyrj6h60hxfvgwcsfkcz4sa-algebraic-graphs-0.7-doc /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7
  22074. 689.87 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22075. 690.11 s [algebraic-graphs:post-build] copying 2 paths...
  22076. 690.11 s [algebraic-graphs:post-build] copying path '/nix/store/zwi1ml033xyrj6h60hxfvgwcsfkcz4sa-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  22077. 691.86 s [algebraic-graphs:post-build] copying path '/nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  22078. 700.11 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22079. 700.38 s [algebraic-graphs:post-build] copying 1 paths...
  22080. 700.42 s [algebraic-graphs:post-build] copying path '/nix/store/kvcg0i6hscdsp3k91crm7j0b125q987x-algebraic-graphs-0.7.drv' to 'https://cache.nix-ci.com'...
  22081. 700.63 s Progress: 9 of 14 built, 145 of 145 downloaded from cache
  22082. 700.69 s Building /nix/store/6lsm2jsyhyd8z7j3a6i1zibq5mjbysbx-algebraic-graph-duoids-0.0.1.0.drv
  22083. 700.85 s [algebraic-graph-duoids] Phase: setupCompilerEnvironmentPhase
  22084. 700.86 s [algebraic-graph-duoids] Build with /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1.
  22085. 701.11 s [algebraic-graph-duoids] Phase: unpackPhase
  22086. 701.12 s [algebraic-graph-duoids] unpacking source archive /nix/store/2pi6cc3ispq29svgnm6ji6gvgnwcqkka-kaqf6a6zn2kfz70w33vsn1jsv1z5h2sp-source/./algebraic-graphs
  22087. 701.13 s [algebraic-graph-duoids] source root is algebraic-graphs
  22088. 701.13 s [algebraic-graph-duoids] Phase: patchPhase
  22089. 701.14 s [algebraic-graph-duoids] Phase: compileBuildDriverPhase
  22090. 701.15 s [algebraic-graph-duoids] setupCompileFlags: -package-db=/build/tmp.ldcV4kdzOo/setup-package.conf.d -threaded
  22091. 701.23 s [algebraic-graph-duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.ldcV4kdzOo/Main.o )
  22092. 701.30 s [algebraic-graph-duoids] [2 of 2] Linking Setup
  22093. 702.75 s [algebraic-graph-duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  22094. 702.76 s [algebraic-graph-duoids] Phase: configurePhase
  22095. 702.77 s [algebraic-graph-duoids] configureFlags: --verbose --prefix=/nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/3zqz1qc9lhkbnnr03dk68w1lz1pn21q9-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.ldcV4kdzOo/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/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/lib
  22096. 702.78 s [algebraic-graph-duoids] Using Parsec parser
  22097. 702.78 s [algebraic-graph-duoids] Configuring algebraic-graph-duoids-0.0.1.0...
  22098. 702.81 s [algebraic-graph-duoids] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  22099. 702.81 s [algebraic-graph-duoids] 'ghc' version < 9.12):
  22100. 702.81 s [algebraic-graph-duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc is version
  22101. 702.81 s [algebraic-graph-duoids] 9.12.1
  22102. 703.11 s [algebraic-graph-duoids] Flags chosen: noisy-deprecations=True, verify-no-recursion=False
  22103. 703.37 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  22104. 703.37 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  22105. 703.37 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.21.0.0
  22106. 703.37 s [algebraic-graph-duoids] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  22107. 703.37 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  22108. 703.37 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.6.1 && <0.8: using algebraic-graphs-0.7
  22109. 703.37 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  22110. 703.37 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.21.0.0
  22111. 703.37 s [algebraic-graph-duoids] Dependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
  22112. 703.37 s [algebraic-graph-duoids] Dependency hedgehog >=1.2 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  22113. 703.37 s [algebraic-graph-duoids] hedgehog-1.5
  22114. 703.37 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  22115. 703.37 s [algebraic-graph-duoids] Dependency base >=4.18.0 && <4.19 || >=4.19.0 && <4.20 || >=4.20.0 && <4.21 ||
  22116. 703.37 s [algebraic-graph-duoids] >=4.21.0 && <4.22: using base-4.21.0.0
  22117. 703.37 s [algebraic-graph-duoids] Dependency doctest >=0.21.1 && <0.22 || >=0.22.6 && <0.23 || >=0.24.0 &&
  22118. 703.37 s [algebraic-graph-duoids] <0.25: using doctest-0.24.0
  22119. 703.37 s [algebraic-graph-duoids] Source component graph:
  22120. 703.37 s [algebraic-graph-duoids] component lib
  22121. 703.37 s [algebraic-graph-duoids] component test:doctests dependency lib
  22122. 703.37 s [algebraic-graph-duoids] component test:laws dependency lib
  22123. 703.37 s [algebraic-graph-duoids] Configured component graph:
  22124. 703.37 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  22125. 703.37 s [algebraic-graph-duoids] include algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  22126. 703.37 s [algebraic-graph-duoids] include base-4.21.0.0-f068
  22127. 703.37 s [algebraic-graph-duoids] include duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  22128. 703.37 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-BsCVSspHDmhFjQRvObHyjh-doctests
  22129. 703.37 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  22130. 703.38 s [algebraic-graph-duoids] include base-4.21.0.0-f068
  22131. 703.38 s [algebraic-graph-duoids] include doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
  22132. 703.38 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-BLs4stF7Q617YqzZpZPtBo-laws
  22133. 703.38 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  22134. 703.38 s [algebraic-graph-duoids] include algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  22135. 703.38 s [algebraic-graph-duoids] include base-4.21.0.0-f068
  22136. 703.38 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf
  22137. 703.38 s [algebraic-graph-duoids] include hedgehog-1.5-LcsFpG0Er7ZGRzxTgWdRj1
  22138. 703.38 s [algebraic-graph-duoids] Linked component graph:
  22139. 703.38 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  22140. 703.38 s [algebraic-graph-duoids] include algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  22141. 703.38 s [algebraic-graph-duoids] include base-4.21.0.0-f068
  22142. 703.38 s [algebraic-graph-duoids] include duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  22143. 703.38 s [algebraic-graph-duoids] Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW:Algebra.Graph.Duoid.Orphans
  22144. 703.38 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-BsCVSspHDmhFjQRvObHyjh-doctests
  22145. 703.38 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  22146. 703.38 s [algebraic-graph-duoids] include base-4.21.0.0-f068
  22147. 703.38 s [algebraic-graph-duoids] include doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
  22148. 703.38 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-BLs4stF7Q617YqzZpZPtBo-laws
  22149. 703.38 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  22150. 703.38 s [algebraic-graph-duoids] include algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  22151. 703.38 s [algebraic-graph-duoids] include base-4.21.0.0-f068
  22152. 703.38 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf
  22153. 703.38 s [algebraic-graph-duoids] include hedgehog-1.5-LcsFpG0Er7ZGRzxTgWdRj1
  22154. 703.38 s [algebraic-graph-duoids] Ready component graph:
  22155. 703.38 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  22156. 703.38 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  22157. 703.38 s [algebraic-graph-duoids] depends base-4.21.0.0-f068
  22158. 703.38 s [algebraic-graph-duoids] depends duoids-0.0.1.0-6a5M5g8JcSoAjAKNcWOIrt
  22159. 703.38 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-BLs4stF7Q617YqzZpZPtBo-laws
  22160. 703.38 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  22161. 703.38 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-DzgFQFDnEHDFycYz4NqJEI
  22162. 703.38 s [algebraic-graph-duoids] depends base-4.21.0.0-f068
  22163. 703.38 s [algebraic-graph-duoids] depends duoids-hedgehog-0.0.1.0-E50BmRANDjIG6cOasHr5pf
  22164. 703.38 s [algebraic-graph-duoids] depends hedgehog-1.5-LcsFpG0Er7ZGRzxTgWdRj1
  22165. 703.38 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-BsCVSspHDmhFjQRvObHyjh-doctests
  22166. 703.38 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  22167. 703.38 s [algebraic-graph-duoids] depends base-4.21.0.0-f068
  22168. 703.38 s [algebraic-graph-duoids] depends doctest-0.24.0-GGpROyg9TSm1IGZyewuA6E
  22169. 703.38 s [algebraic-graph-duoids] Using Cabal-3.14.1.0 compiled by ghc-9.12
  22170. 703.38 s [algebraic-graph-duoids] Using compiler: ghc-9.12.1
  22171. 703.38 s [algebraic-graph-duoids] Using install prefix:
  22172. 703.38 s [algebraic-graph-duoids] /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0
  22173. 703.38 s [algebraic-graph-duoids] Executables installed in:
  22174. 703.38 s [algebraic-graph-duoids] /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/bin
  22175. 703.38 s [algebraic-graph-duoids] Libraries installed in:
  22176. 703.39 s [algebraic-graph-duoids] /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  22177. 703.39 s [algebraic-graph-duoids] Dynamic Libraries installed in:
  22178. 703.39 s [algebraic-graph-duoids] /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739
  22179. 703.39 s [algebraic-graph-duoids] Private executables installed in:
  22180. 703.39 s [algebraic-graph-duoids] /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.12.1-f739/algebraic-graph-duoids-0.0.1.0
  22181. 703.39 s [algebraic-graph-duoids] Data files installed in:
  22182. 703.39 s [algebraic-graph-duoids] /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.12.1-f739/algebraic-graph-duoids-0.0.1.0
  22183. 703.39 s [algebraic-graph-duoids] Documentation installed in:
  22184. 703.39 s [algebraic-graph-duoids] /nix/store/3zqz1qc9lhkbnnr03dk68w1lz1pn21q9-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
  22185. 703.39 s [algebraic-graph-duoids] Configuration files installed in:
  22186. 703.39 s [algebraic-graph-duoids] /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/etc
  22187. 703.39 s [algebraic-graph-duoids] No alex found
  22188. 703.39 s [algebraic-graph-duoids] Using ar found on system at:
  22189. 703.39 s [algebraic-graph-duoids] /nix/store/iga4lv0say4pbbbgkf1v79403n1ip7hf-binutils-wrapper-2.44/bin/ar
  22190. 703.39 s [algebraic-graph-duoids] No c2hs found
  22191. 703.39 s [algebraic-graph-duoids] No cpphs found
  22192. 703.39 s [algebraic-graph-duoids] Using doctest version 0.24.0 found on system at:
  22193. 703.39 s [algebraic-graph-duoids] /nix/store/x1z9pyd8hb27z4bhy7lsj2npgsq740xd-doctest-0.24.0/bin/doctest
  22194. 703.39 s [algebraic-graph-duoids] Using gcc version 14.3.0 given by user at:
  22195. 703.39 s [algebraic-graph-duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/gcc
  22196. 703.39 s [algebraic-graph-duoids] Using ghc version 9.12.1 found on system at:
  22197. 703.39 s [algebraic-graph-duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc
  22198. 703.39 s [algebraic-graph-duoids] Using ghc-pkg version 9.12.1 found on system at:
  22199. 703.39 s [algebraic-graph-duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/ghc-pkg-9.12.1
  22200. 703.39 s [algebraic-graph-duoids] No ghcjs found
  22201. 703.39 s [algebraic-graph-duoids] No ghcjs-pkg found
  22202. 703.39 s [algebraic-graph-duoids] No greencard found
  22203. 703.39 s [algebraic-graph-duoids] Using haddock version 2.30.0 found on system at:
  22204. 703.39 s [algebraic-graph-duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/haddock-ghc-9.12.1
  22205. 703.39 s [algebraic-graph-duoids] No happy found
  22206. 703.39 s [algebraic-graph-duoids] No haskell-suite found
  22207. 703.39 s [algebraic-graph-duoids] No haskell-suite-pkg found
  22208. 703.39 s [algebraic-graph-duoids] No hmake found
  22209. 703.39 s [algebraic-graph-duoids] Using hpc version 0.69 found on system at:
  22210. 703.39 s [algebraic-graph-duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hpc-ghc-9.12.1
  22211. 703.39 s [algebraic-graph-duoids] Using hsc2hs version 0.68.10 found on system at:
  22212. 703.39 s [algebraic-graph-duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/hsc2hs-ghc-9.12.1
  22213. 703.39 s [algebraic-graph-duoids] Using hscolour version 1.25 found on system at:
  22214. 703.39 s [algebraic-graph-duoids] /nix/store/q6qz2x3a08capyv98w52zizgxcnmv4hb-hscolour-1.25/bin/HsColour
  22215. 703.39 s [algebraic-graph-duoids] No jhc found
  22216. 703.39 s [algebraic-graph-duoids] Using ld found on system at:
  22217. 703.39 s [algebraic-graph-duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/ld
  22218. 703.39 s [algebraic-graph-duoids] No pkg-config found
  22219. 703.39 s [algebraic-graph-duoids] Using runghc version 9.12.1 found on system at:
  22220. 703.39 s [algebraic-graph-duoids] /nix/store/c0syprk795450qh1ladngkx87k7x00af-ghc-9.12.1/bin/runghc-9.12.1
  22221. 703.39 s [algebraic-graph-duoids] Using strip version 2.44 found on system at:
  22222. 703.39 s [algebraic-graph-duoids] /nix/store/kks0nbx2riwry5qsx0qr87qr0lswmhzi-gcc-wrapper-14.3.0/bin/strip
  22223. 703.39 s [algebraic-graph-duoids] Using tar found on system at:
  22224. 703.39 s [algebraic-graph-duoids] /nix/store/76df6j9sq1ar58id3y3v4rkijany1wxp-gnutar-1.35/bin/tar
  22225. 703.39 s [algebraic-graph-duoids] No uhc found
  22226. 703.53 s [algebraic-graph-duoids] Phase: buildPhase
  22227. 703.60 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  22228. 703.61 s [algebraic-graph-duoids] Building library for algebraic-graph-duoids-0.0.1.0...
  22229. 703.67 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 )
  22230. 703.73 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 )
  22231. 704.63 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
  22232. 704.77 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 )
  22233. 706.72 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  22234. 706.72 s [algebraic-graph-duoids] Building test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  22235. 706.83 s [algebraic-graph-duoids] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  22236. 707.17 s [algebraic-graph-duoids] [2 of 2] Linking dist/build/laws/laws
  22237. 708.13 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  22238. 708.13 s [algebraic-graph-duoids] Building test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  22239. 708.21 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 )
  22240. 708.40 s [algebraic-graph-duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  22241. 708.91 s [algebraic-graph-duoids] [3 of 3] Linking dist/build/doctests/doctests
  22242. 713.90 s [algebraic-graph-duoids] Phase: checkPhase
  22243. 714.23 s [algebraic-graph-duoids] Running 2 test suites...
  22244. 714.23 s [algebraic-graph-duoids] Test suite laws: RUNNING...
  22245. 714.27 s [algebraic-graph-duoids] ━━━ Duoid.Normal (Graph Word8) ━━━
  22246. 714.27 s [algebraic-graph-duoids] ✓ unswapUnit passed 100 tests.
  22247. 714.27 s [algebraic-graph-duoids] ✓ interchange passed 100 tests.
  22248. 714.27 s [algebraic-graph-duoids] ✓ splitUnit passed 100 tests.
  22249. 714.27 s [algebraic-graph-duoids] ✓ joinUnit passed 100 tests.
  22250. 714.27 s [algebraic-graph-duoids] ✓ swapUnit passed 100 tests.
  22251. 714.27 s [algebraic-graph-duoids] ✓ 5 succeeded.
  22252. 714.27 s [algebraic-graph-duoids] Test suite laws: PASS
  22253. 714.28 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
  22254. 714.28 s [algebraic-graph-duoids] Test suite doctests: RUNNING...
  22255. 714.77 s [algebraic-graph-duoids] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  22256. 714.81 s [algebraic-graph-duoids] Test suite doctests: PASS
  22257. 714.82 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
  22258. 714.82 s [algebraic-graph-duoids] 2 of 2 test suites (2 of 2 test cases) passed.
  22259. 714.83 s [algebraic-graph-duoids] Phase: haddockPhase
  22260. 715.48 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  22261. 715.48 s [algebraic-graph-duoids] Running Haddock on library for algebraic-graph-duoids-0.0.1.0...
  22262. 715.74 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, nothing ) [HIE file is missing]
  22263. 715.78 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, nothing ) [HIE file is missing]
  22264. 715.98 s [algebraic-graph-duoids] Haddock coverage:
  22265. 716.13 s [algebraic-graph-duoids] 20% ( 1 / 5) in 'Algebra.Graph.Duoid'
  22266. 716.13 s [algebraic-graph-duoids] Missing documentation for:
  22267. 716.13 s [algebraic-graph-duoids] parEmptyGraph (src/Algebra/Graph/Duoid.hs:24)
  22268. 716.13 s [algebraic-graph-duoids] seqEmptyGraph (src/Algebra/Graph/Duoid.hs:27)
  22269. 716.13 s [algebraic-graph-duoids] parGraph (src/Algebra/Graph/Duoid.hs:30)
  22270. 716.13 s [algebraic-graph-duoids] seqGraph (src/Algebra/Graph/Duoid.hs:33)
  22271. 716.13 s [algebraic-graph-duoids] 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans'
  22272. 720.46 s [algebraic-graph-duoids] Documentation created: dist/doc/html/algebraic-graph-duoids,
  22273. 720.50 s [algebraic-graph-duoids] dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
  22274. 721.11 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  22275. 721.83 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  22276. 721.91 s [algebraic-graph-duoids] Phase: installPhase
  22277. 722.01 s [algebraic-graph-duoids] Installing library in /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/algebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW
  22278. 722.82 s [algebraic-graph-duoids] Phase: fixupPhase
  22279. 722.93 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0
  22280. 722.94 s [algebraic-graph-duoids] shrinking /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.12.1/lib/x86_64-linux-ghc-9.12.1-f739/libHSalgebraic-graph-duoids-0.0.1.0-2qimKplQXtGICz5ybZbQVW-ghc9.12.1.so
  22281. 722.95 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0...
  22282. 722.98 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0
  22283. 722.99 s [algebraic-graph-duoids] stripping (with command strip and flags -S -p) in /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/lib
  22284. 723.18 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/3zqz1qc9lhkbnnr03dk68w1lz1pn21q9-algebraic-graph-duoids-0.0.1.0-doc
  22285. 723.19 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/3zqz1qc9lhkbnnr03dk68w1lz1pn21q9-algebraic-graph-duoids-0.0.1.0-doc...
  22286. 723.21 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/3zqz1qc9lhkbnnr03dk68w1lz1pn21q9-algebraic-graph-duoids-0.0.1.0-doc
  22287. 723.51 s [algebraic-graph-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0 /nix/store/3zqz1qc9lhkbnnr03dk68w1lz1pn21q9-algebraic-graph-duoids-0.0.1.0-doc
  22288. 724.79 s [algebraic-graph-duoids:post-build] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  22289. 724.79 s [algebraic-graph-duoids:post-build]
  22290. 725.16 s [algebraic-graph-duoids:post-build] Pushing /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0 (1.20 MiB)
  22291. 725.25 s [algebraic-graph-duoids:post-build] Pushing /nix/store/3zqz1qc9lhkbnnr03dk68w1lz1pn21q9-algebraic-graph-duoids-0.0.1.0-doc (523.55 KiB)
  22292. 726.26 s [algebraic-graph-duoids:post-build]
  22293. 726.26 s [algebraic-graph-duoids:post-build] All done.
  22294. 726.38 s [algebraic-graph-duoids:post-build] Uploading to the NixCI cache: /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0 /nix/store/3zqz1qc9lhkbnnr03dk68w1lz1pn21q9-algebraic-graph-duoids-0.0.1.0-doc
  22295. 726.86 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22296. 727.04 s [algebraic-graph-duoids:post-build] copying 2 paths...
  22297. 727.04 s [algebraic-graph-duoids:post-build] copying path '/nix/store/3zqz1qc9lhkbnnr03dk68w1lz1pn21q9-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  22298. 727.58 s [algebraic-graph-duoids:post-build] copying path '/nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  22299. 728.71 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22300. 729.08 s [algebraic-graph-duoids:post-build] copying 1 paths...
  22301. 729.08 s [algebraic-graph-duoids:post-build] copying path '/nix/store/6lsm2jsyhyd8z7j3a6i1zibq5mjbysbx-algebraic-graph-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  22302. 729.55 s Progress: 10 of 14 built, 145 of 145 downloaded from cache
  22303. 729.68 s Building /nix/store/c6x0ym1al3b7mw9nrjhzph7sc82bfrpc-ghc-9.12.1-with-packages.drv
  22304. 729.88 s [ghc-9.12.1-with-packages] /nix/store/hi7kl7zxmih74wc2zql0059galswpa2d-duoidal-transformers-0.0.1.0/nix-support:
  22305. 729.88 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22306. 729.94 s [ghc-9.12.1-with-packages] /nix/store/w2fimsw5ig7621j0879nm58pg5q0zxaa-duoids-hedgehog-0.0.1.0/nix-support:
  22307. 729.94 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22308. 729.95 s [ghc-9.12.1-with-packages] /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7/nix-support:
  22309. 729.95 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22310. 729.97 s [ghc-9.12.1-with-packages] /nix/store/zwxbk5mzaypwmzf2zxcd0brywj793w72-algebraic-graphs-0.7/nix-support:
  22311. 729.97 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22312. 729.98 s [ghc-9.12.1-with-packages] /nix/store/3rg1ihmrm8ka1zzq6vfqw94rg8gg8is3-hedgehog-1.5/nix-support:
  22313. 729.98 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22314. 730.05 s [ghc-9.12.1-with-packages] /nix/store/3rg1ihmrm8ka1zzq6vfqw94rg8gg8is3-hedgehog-1.5/nix-support:
  22315. 730.06 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22316. 730.07 s [ghc-9.12.1-with-packages] /nix/store/qsv9n4s59sa83q6va9k9jv5k8dmw0p92-ansi-terminal-1.1.2/nix-support:
  22317. 730.07 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22318. 730.08 s [ghc-9.12.1-with-packages] /nix/store/qsv9n4s59sa83q6va9k9jv5k8dmw0p92-ansi-terminal-1.1.2/nix-support:
  22319. 730.08 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22320. 730.09 s [ghc-9.12.1-with-packages] /nix/store/i7lyljfdjjbs28kf5lglymhqpzra03v4-async-2.2.5/nix-support:
  22321. 730.09 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22322. 730.10 s [ghc-9.12.1-with-packages] /nix/store/i7lyljfdjjbs28kf5lglymhqpzra03v4-async-2.2.5/nix-support:
  22323. 730.10 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22324. 730.11 s [ghc-9.12.1-with-packages] /nix/store/ybmpwvkpckiqyia3j9451j8bsm8an2s8-barbies-2.1.1.0/nix-support:
  22325. 730.11 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22326. 730.15 s [ghc-9.12.1-with-packages] /nix/store/ybmpwvkpckiqyia3j9451j8bsm8an2s8-barbies-2.1.1.0/nix-support:
  22327. 730.15 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22328. 730.15 s [ghc-9.12.1-with-packages] /nix/store/r9g9yx0pf4sb0bhg2bgxywlxi2gp7l88-concurrent-output-1.10.21/nix-support:
  22329. 730.15 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22330. 730.15 s [ghc-9.12.1-with-packages] /nix/store/r9g9yx0pf4sb0bhg2bgxywlxi2gp7l88-concurrent-output-1.10.21/nix-support:
  22331. 730.15 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22332. 730.16 s [ghc-9.12.1-with-packages] /nix/store/cf2n41y0xbrif1db9a6k14jplixlj6d0-lifted-async-0.10.2.7/nix-support:
  22333. 730.16 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22334. 730.16 s [ghc-9.12.1-with-packages] /nix/store/cf2n41y0xbrif1db9a6k14jplixlj6d0-lifted-async-0.10.2.7/nix-support:
  22335. 730.17 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22336. 730.18 s [ghc-9.12.1-with-packages] /nix/store/n5bvgmddj1a1vcq81s32i7ccbhx07qb9-mmorph-1.2.0/nix-support:
  22337. 730.18 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22338. 730.18 s [ghc-9.12.1-with-packages] /nix/store/n5bvgmddj1a1vcq81s32i7ccbhx07qb9-mmorph-1.2.0/nix-support:
  22339. 730.18 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22340. 730.18 s [ghc-9.12.1-with-packages] /nix/store/ad47csx7c715qbn695fklkmlm60qs2ii-monad-control-1.0.3.1/nix-support:
  22341. 730.18 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22342. 730.18 s [ghc-9.12.1-with-packages] /nix/store/ad47csx7c715qbn695fklkmlm60qs2ii-monad-control-1.0.3.1/nix-support:
  22343. 730.18 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22344. 730.19 s [ghc-9.12.1-with-packages] /nix/store/v3hgabkm1a7jvnn4ys4kvqwklwflnqis-pretty-show-1.10/nix-support:
  22345. 730.19 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22346. 730.19 s [ghc-9.12.1-with-packages] /nix/store/v3hgabkm1a7jvnn4ys4kvqwklwflnqis-pretty-show-1.10/nix-support:
  22347. 730.19 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22348. 730.19 s [ghc-9.12.1-with-packages] /nix/store/nz98l6467qac3f3l1jdcf3gmwjc659d3-primitive-0.9.1.0/nix-support:
  22349. 730.19 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22350. 730.21 s [ghc-9.12.1-with-packages] /nix/store/nz98l6467qac3f3l1jdcf3gmwjc659d3-primitive-0.9.1.0/nix-support:
  22351. 730.22 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22352. 730.23 s [ghc-9.12.1-with-packages] /nix/store/2c6rybf8m8jrly84dzbyhv9xxzc81pzs-random-1.2.1.3/nix-support:
  22353. 730.23 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22354. 730.23 s [ghc-9.12.1-with-packages] /nix/store/2c6rybf8m8jrly84dzbyhv9xxzc81pzs-random-1.2.1.3/nix-support:
  22355. 730.23 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22356. 730.25 s [ghc-9.12.1-with-packages] /nix/store/346qzqng2wkldyma6igal0i8w3clp0mw-resourcet-1.3.0/nix-support:
  22357. 730.25 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22358. 730.27 s [ghc-9.12.1-with-packages] /nix/store/346qzqng2wkldyma6igal0i8w3clp0mw-resourcet-1.3.0/nix-support:
  22359. 730.27 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22360. 730.27 s [ghc-9.12.1-with-packages] /nix/store/vqvlw9p3sh64qbc5wmqciiqpsdcacw2z-safe-exceptions-0.1.7.4/nix-support:
  22361. 730.27 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22362. 730.28 s [ghc-9.12.1-with-packages] /nix/store/vqvlw9p3sh64qbc5wmqciiqpsdcacw2z-safe-exceptions-0.1.7.4/nix-support:
  22363. 730.28 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22364. 730.29 s [ghc-9.12.1-with-packages] /nix/store/llbvsa4qwzkpdf064fkxckdymixlssa0-transformers-base-0.4.6/nix-support:
  22365. 730.29 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22366. 730.29 s [ghc-9.12.1-with-packages] /nix/store/llbvsa4qwzkpdf064fkxckdymixlssa0-transformers-base-0.4.6/nix-support:
  22367. 730.29 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22368. 730.29 s [ghc-9.12.1-with-packages] /nix/store/bnca7ki3sf219if16d403g91za6xbmb3-wl-pprint-annotated-0.1.0.1/nix-support:
  22369. 730.29 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22370. 730.30 s [ghc-9.12.1-with-packages] /nix/store/bnca7ki3sf219if16d403g91za6xbmb3-wl-pprint-annotated-0.1.0.1/nix-support:
  22371. 730.30 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22372. 730.31 s [ghc-9.12.1-with-packages] /nix/store/4ddn0biwyk9v185vyl40030qszsja32p-ansi-terminal-types-1.1/nix-support:
  22373. 730.31 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22374. 730.31 s [ghc-9.12.1-with-packages] /nix/store/4ddn0biwyk9v185vyl40030qszsja32p-ansi-terminal-types-1.1/nix-support:
  22375. 730.31 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22376. 730.35 s [ghc-9.12.1-with-packages] /nix/store/cwqwam6n53231bm299x6lmna5rjf1qjz-hashable-1.4.7.0/nix-support:
  22377. 730.35 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22378. 730.37 s [ghc-9.12.1-with-packages] /nix/store/cwqwam6n53231bm299x6lmna5rjf1qjz-hashable-1.4.7.0/nix-support:
  22379. 730.37 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22380. 730.39 s [ghc-9.12.1-with-packages] /nix/store/z3isz5mf07j2ipn8i8lpb1lzxagvarf9-distributive-0.6.2.1/nix-support:
  22381. 730.39 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22382. 730.44 s [ghc-9.12.1-with-packages] /nix/store/z3isz5mf07j2ipn8i8lpb1lzxagvarf9-distributive-0.6.2.1/nix-support:
  22383. 730.44 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22384. 730.48 s [ghc-9.12.1-with-packages] /nix/store/yl6jjm3jvhmgh228fwm119amj2pvywgl-constraints-0.14.2/nix-support:
  22385. 730.48 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22386. 730.48 s [ghc-9.12.1-with-packages] /nix/store/yl6jjm3jvhmgh228fwm119amj2pvywgl-constraints-0.14.2/nix-support:
  22387. 730.48 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22388. 730.50 s [ghc-9.12.1-with-packages] /nix/store/x7azizjy4c52ijqkjcg21bzf9kd2cmrd-lifted-base-0.2.3.12/nix-support:
  22389. 730.50 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22390. 730.54 s [ghc-9.12.1-with-packages] /nix/store/x7azizjy4c52ijqkjcg21bzf9kd2cmrd-lifted-base-0.2.3.12/nix-support:
  22391. 730.54 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22392. 730.57 s [ghc-9.12.1-with-packages] /nix/store/1bzzh814ank4w463vp6nis9hjcsmsv23-transformers-compat-0.7.2/nix-support:
  22393. 730.57 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22394. 730.57 s [ghc-9.12.1-with-packages] /nix/store/1bzzh814ank4w463vp6nis9hjcsmsv23-transformers-compat-0.7.2/nix-support:
  22395. 730.57 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22396. 730.59 s [ghc-9.12.1-with-packages] /nix/store/pdgkv5b35wwazg0rkiblywql74brrybn-splitmix-0.1.1/nix-support:
  22397. 730.59 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22398. 730.60 s [ghc-9.12.1-with-packages] /nix/store/pdgkv5b35wwazg0rkiblywql74brrybn-splitmix-0.1.1/nix-support:
  22399. 730.60 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22400. 730.60 s [ghc-9.12.1-with-packages] /nix/store/9vk33g3cma3g74298czk1gmaimikw3x2-unliftio-core-0.2.1.0/nix-support:
  22401. 730.60 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22402. 730.61 s [ghc-9.12.1-with-packages] /nix/store/9vk33g3cma3g74298czk1gmaimikw3x2-unliftio-core-0.2.1.0/nix-support:
  22403. 730.61 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22404. 730.61 s [ghc-9.12.1-with-packages] /nix/store/6fm6badzwhkjw490cv3n54c1zxpy125j-base-orphans-0.9.3/nix-support:
  22405. 730.61 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22406. 730.62 s [ghc-9.12.1-with-packages] /nix/store/6fm6badzwhkjw490cv3n54c1zxpy125j-base-orphans-0.9.3/nix-support:
  22407. 730.62 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22408. 730.62 s [ghc-9.12.1-with-packages] /nix/store/xaw9bx3il5rk6l5cg6m9rhpq0z4syjs8-tagged-0.8.9/nix-support:
  22409. 730.62 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22410. 730.63 s [ghc-9.12.1-with-packages] /nix/store/xaw9bx3il5rk6l5cg6m9rhpq0z4syjs8-tagged-0.8.9/nix-support:
  22411. 730.63 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22412. 730.64 s [ghc-9.12.1-with-packages] /nix/store/0h7l00ix0g1idvsxi9mvf27z05krln3r-boring-0.2.2/nix-support:
  22413. 730.64 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22414. 730.65 s [ghc-9.12.1-with-packages] /nix/store/0h7l00ix0g1idvsxi9mvf27z05krln3r-boring-0.2.2/nix-support:
  22415. 730.65 s [ghc-9.12.1-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/0qhvr8rayqbs2jwzpkfbjh4kxf4qigdh-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  22416. 734.04 s [ghc-9.12.1-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/mg3wjqs49b1pfjsdk3vyvw47gfds270n-ghc-9.12.1-with-packages
  22417. 735.25 s [ghc-9.12.1-with-packages:post-build] Pushing 1 paths (138 are already present) using zstd to cache sellout ⏳
  22418. 735.25 s [ghc-9.12.1-with-packages:post-build]
  22419. 735.63 s [ghc-9.12.1-with-packages:post-build] Pushing /nix/store/mg3wjqs49b1pfjsdk3vyvw47gfds270n-ghc-9.12.1-with-packages (6.02 MiB)
  22420. 737.67 s [ghc-9.12.1-with-packages:post-build]
  22421. 737.67 s [ghc-9.12.1-with-packages:post-build] All done.
  22422. 737.85 s [ghc-9.12.1-with-packages:post-build] Uploading to the NixCI cache: /nix/store/mg3wjqs49b1pfjsdk3vyvw47gfds270n-ghc-9.12.1-with-packages
  22423. 738.52 s [ghc-9.12.1-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22424. 738.86 s [ghc-9.12.1-with-packages:post-build] copying 1 paths...
  22425. 738.86 s [ghc-9.12.1-with-packages:post-build] copying path '/nix/store/mg3wjqs49b1pfjsdk3vyvw47gfds270n-ghc-9.12.1-with-packages' to 'https://cache.nix-ci.com'...
  22426. 741.26 s [ghc-9.12.1-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22427. 741.72 s [ghc-9.12.1-with-packages:post-build] copying 1 paths...
  22428. 741.72 s [ghc-9.12.1-with-packages:post-build] copying path '/nix/store/c6x0ym1al3b7mw9nrjhzph7sc82bfrpc-ghc-9.12.1-with-packages.drv' to 'https://cache.nix-ci.com'...
  22429. 742.10 s Progress: 11 of 13 built, 145 of 145 downloaded from cache
  22430. 742.20 s Building /nix/store/yc3zi8pgxawk7h50sk69794w5n8l6ylp-all-packages.drv
  22431. 742.32 s [all-packages] created 3 symlinks in user environment
  22432. 742.48 s [all-packages:post-build] Uploading to cachix cache "sellout": /nix/store/lldg7y7mr4wzxmmksag1kvsh8cv2h8r3-all-packages
  22433. 743.57 s [all-packages:post-build] Pushing 1 paths (139 are already present) using zstd to cache sellout ⏳
  22434. 743.57 s [all-packages:post-build]
  22435. 743.97 s [all-packages:post-build] Pushing /nix/store/lldg7y7mr4wzxmmksag1kvsh8cv2h8r3-all-packages (872.00 B)
  22436. 745.04 s [all-packages:post-build]
  22437. 745.05 s [all-packages:post-build] All done.
  22438. 745.27 s [all-packages:post-build] Uploading to the NixCI cache: /nix/store/lldg7y7mr4wzxmmksag1kvsh8cv2h8r3-all-packages
  22439. 745.72 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22440. 746.00 s [all-packages:post-build] copying 1 paths...
  22441. 746.00 s [all-packages:post-build] copying path '/nix/store/lldg7y7mr4wzxmmksag1kvsh8cv2h8r3-all-packages' to 'https://cache.nix-ci.com'...
  22442. 746.88 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  22443. 747.26 s [all-packages:post-build] copying 1 paths...
  22444. 747.26 s [all-packages:post-build] copying path '/nix/store/yc3zi8pgxawk7h50sk69794w5n8l6ylp-all-packages.drv' to 'https://cache.nix-ci.com'...
  22445. 747.73 s Progress: 12 of 13 built, 145 of 145 downloaded from cache
  22446. 747.73 s Progress: 13 of 13 built, 145 of 145 downloaded from cache
  22447. 747.73 s /nix/store/lldg7y7mr4wzxmmksag1kvsh8cv2h8r3-all-packages
  22448. 747.82 s Build succeeded.
Tail Raw Logs