1. 0.49 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=renovate%2Flock-file-maintenance&rev=aeca24e0ba147679323a49b0d71b1010da9c6629#packages.x86_64-linux.ghc9122_all --print-build-logs
  2. 0.54 s warning: ignoring untrusted flake configuration setting 'allow-import-from-derivation'.
  3. 0.54 s Pass '--accept-flake-config' to trust it
  4. 0.54 s warning: ignoring untrusted flake configuration setting 'extra-experimental-features'.
  5. 0.54 s Pass '--accept-flake-config' to trust it
  6. 0.54 s warning: ignoring untrusted flake configuration setting 'extra-substituters'.
  7. 0.54 s Pass '--accept-flake-config' to trust it
  8. 0.54 s warning: ignoring untrusted flake configuration setting 'extra-trusted-public-keys'.
  9. 0.54 s Pass '--accept-flake-config' to trust it
  10. 0.54 s warning: ignoring untrusted flake configuration setting 'sandbox'.
  11. 0.54 s Pass '--accept-flake-config' to trust it
  12. 0.54 s warning: ignoring untrusted flake configuration setting 'use-registries'.
  13. 0.54 s Pass '--accept-flake-config' to trust it
  14. 0.56 s
  15. 2.95 s Downloading cached pretty-show-1.10-data from https://cache.nix-ci.com
  16. 2.95 s Downloading cached barbies-2.1.1.0-doc from https://cache.nix-ci.com
  17. 2.95 s Downloading cached concurrent-output-1.10.21-doc from https://cache.nix-ci.com
  18. 2.95 s Downloading cached erf-2.0.0.0-doc from https://cache.nix-ci.com
  19. 2.95 s Downloading cached haskell-lexer-1.2.1-doc from https://cache.nix-ci.com
  20. 2.95 s Downloading cached lifted-base-0.2.3.12-doc from https://cache.nix-ci.com
  21. 2.95 s Downloading cached wl-pprint-annotated-0.1.0.1-doc from https://cache.nix-ci.com
  22. 2.96 s Downloading cached hscolour from https://cache.nix-ci.com
  23. 2.96 s Downloading cached Cabal-syntax-3.12.1.0-doc from https://cache.nix-ci.com
  24. 2.96 s Downloading cached cabal-doctest-1.0.12-doc from https://cache.nix-ci.com
  25. 2.96 s Downloading cached inspection-testing-0.6.2-doc from https://cache.nix-ci.com
  26. 2.96 s Downloading cached ghc-paths-0.1.0.12-doc from https://cache.nix-ci.com
  27. 2.97 s Downloading cached jailbreak-cabal from https://cache.nix-ci.com
  28. 2.97 s Downloading cached ChasingBottoms-1.3.1.17-doc from https://cache.nix-ci.com
  29. 2.97 s Downloading cached tasty-quickcheck-0.11.1-doc from https://cache.nix-ci.com
  30. 2.98 s Downloading cached wherefrom-compat-0.1.1.1-doc from https://cache.nix-ci.com
  31. 2.99 s Progress: 0 of 36 built, 1 of 43 downloaded from cache (15 downloading)
  32. 3.00 s Progress: 0 of 36 built, 2 of 43 downloaded from cache (14 downloading)
  33. 3.00 s Downloading cached wl-pprint-annotated from https://cache.nix-ci.com
  34. 3.01 s Progress: 0 of 36 built, 3 of 43 downloaded from cache (14 downloading)
  35. 3.01 s Downloading cached erf from https://cache.nix-ci.com
  36. 3.02 s Progress: 0 of 36 built, 4 of 43 downloaded from cache (14 downloading)
  37. 3.02 s Downloading cached lifted-async-0.10.2.7-doc from https://cache.nix-ci.com
  38. 3.02 s Downloading cached lifted-base from https://cache.nix-ci.com
  39. 3.03 s Progress: 0 of 36 built, 5 of 43 downloaded from cache (15 downloading)
  40. 3.03 s Downloading cached concurrent-output from https://cache.nix-ci.com
  41. 3.03 s Progress: 0 of 36 built, 6 of 43 downloaded from cache (15 downloading)
  42. 3.03 s Downloading cached doctest-0.24.2-doc from https://cache.nix-ci.com
  43. 3.04 s Progress: 0 of 36 built, 7 of 43 downloaded from cache (15 downloading)
  44. 3.04 s Downloading cached ghc-paths from https://cache.nix-ci.com
  45. 3.04 s Progress: 0 of 35 built, 8 of 43 downloaded from cache (15 downloading)
  46. 3.04 s Downloading cached haskell-lexer from https://cache.nix-ci.com
  47. 3.04 s Progress: 0 of 35 built, 9 of 43 downloaded from cache (15 downloading)
  48. 3.04 s Downloading cached pretty-show-1.10-doc from https://cache.nix-ci.com
  49. 3.05 s Progress: 0 of 35 built, 10 of 43 downloaded from cache (15 downloading)
  50. 3.05 s Downloading cached tasty-quickcheck from https://cache.nix-ci.com
  51. 3.06 s Progress: 0 of 35 built, 11 of 43 downloaded from cache (15 downloading)
  52. 3.06 s Downloading cached barbies from https://cache.nix-ci.com
  53. 3.13 s Progress: 0 of 35 built, 12 of 43 downloaded from cache (15 downloading)
  54. 3.13 s Downloading cached inspection-testing from https://cache.nix-ci.com
  55. 3.14 s Progress: 0 of 35 built, 13 of 43 downloaded from cache (15 downloading)
  56. 3.14 s Downloading cached tasty-inspection-testing-0.2.1-doc from https://cache.nix-ci.com
  57. 3.14 s Progress: 0 of 35 built, 14 of 43 downloaded from cache (15 downloading)
  58. 3.14 s Downloading cached wherefrom-compat from https://cache.nix-ci.com
  59. 3.15 s Progress: 0 of 35 built, 15 of 43 downloaded from cache (15 downloading)
  60. 3.15 s Downloading cached ChasingBottoms from https://cache.nix-ci.com
  61. 3.15 s Progress: 0 of 34 built, 16 of 43 downloaded from cache (15 downloading)
  62. 3.16 s Progress: 0 of 34 built, 17 of 43 downloaded from cache (14 downloading)
  63. 3.16 s Downloading cached lifted-async from https://cache.nix-ci.com
  64. 3.16 s Progress: 0 of 33 built, 18 of 43 downloaded from cache (14 downloading)
  65. 3.17 s Progress: 0 of 32 built, 19 of 43 downloaded from cache (13 downloading)
  66. 3.18 s Progress: 0 of 31 built, 20 of 43 downloaded from cache (12 downloading)
  67. 3.18 s Progress: 0 of 31 built, 21 of 43 downloaded from cache (11 downloading)
  68. 3.19 s Downloading cached doctest from https://sellout.cachix.org
  69. 3.20 s Progress: 0 of 31 built, 22 of 43 downloaded from cache (11 downloading)
  70. 3.21 s Progress: 0 of 30 built, 23 of 43 downloaded from cache (10 downloading)
  71. 3.21 s Downloading cached hedgehog-1.5-doc from https://cache.nix-ci.com
  72. 3.22 s Progress: 0 of 30 built, 24 of 43 downloaded from cache (10 downloading)
  73. 3.23 s Progress: 0 of 29 built, 25 of 43 downloaded from cache (9 downloading)
  74. 3.27 s Progress: 0 of 28 built, 26 of 43 downloaded from cache (8 downloading)
  75. 3.27 s Downloading cached pretty-show from https://cache.nix-ci.com
  76. 3.27 s Progress: 0 of 27 built, 27 of 43 downloaded from cache (8 downloading)
  77. 3.27 s Downloading cached Cabal-3.12.1.0-doc from https://cache.nix-ci.com
  78. 3.27 s Progress: 0 of 27 built, 28 of 43 downloaded from cache (9 downloading)
  79. 3.27 s Downloading cached Cabal-syntax from https://cache.nix-ci.com
  80. 3.28 s Progress: 0 of 26 built, 29 of 43 downloaded from cache (8 downloading)
  81. 3.30 s Progress: 0 of 25 built, 30 of 43 downloaded from cache (7 downloading)
  82. 3.30 s Downloading cached tasty-hedgehog-1.4.0.2-doc from https://cache.nix-ci.com
  83. 3.30 s Progress: 0 of 25 built, 31 of 43 downloaded from cache (7 downloading)
  84. 3.35 s Progress: 0 of 25 built, 32 of 43 downloaded from cache (6 downloading)
  85. 3.35 s Progress: 0 of 24 built, 33 of 43 downloaded from cache (5 downloading)
  86. 3.35 s Downloading cached tasty-inspection-testing from https://cache.nix-ci.com
  87. 3.37 s Progress: 0 of 23 built, 34 of 43 downloaded from cache (5 downloading)
  88. 3.37 s Downloading cached hedgehog from https://cache.nix-ci.com
  89. 3.44 s Progress: 0 of 22 built, 35 of 43 downloaded from cache (5 downloading)
  90. 3.47 s Progress: 0 of 22 built, 36 of 43 downloaded from cache (4 downloading)
  91. 3.52 s Progress: 0 of 22 built, 37 of 43 downloaded from cache (3 downloading)
  92. 3.56 s Progress: 0 of 21 built, 38 of 43 downloaded from cache (2 downloading)
  93. 3.56 s Downloading cached tasty-hedgehog from https://cache.nix-ci.com
  94. 3.74 s Progress: 0 of 20 built, 39 of 43 downloaded from cache (2 downloading)
  95. 4.02 s Progress: 0 of 19 built, 40 of 43 downloaded from cache (1 downloading)
  96. 4.02 s Downloading cached Cabal from https://cache.nix-ci.com
  97. 4.13 s Progress: 0 of 19 built, 41 of 43 downloaded from cache (1 downloading)
  98. 4.25 s Building /nix/store/ky0jn5rgd99f7m5053dqbc7ssfra3h61-vector-0.13.2.0.drv
  99. 4.38 s [vector] Phase: setupCompilerEnvironmentPhase
  100. 4.38 s [vector] Build with /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2.
  101. 4.65 s Progress: 0 of 18 built (1 building), 42 of 43 downloaded from cache
  102. 4.65 s Downloading cached cabal-doctest from https://cache.nix-ci.com
  103. 4.69 s Progress: 0 of 17 built (1 building), 43 of 43 downloaded from cache
  104. 4.72 s Building /nix/store/mcqv3lw617q3fa2bj5px52d67dl3if1c-duoids-0.0.1.0.drv
  105. 4.72 s [vector] Phase: unpackPhase
  106. 4.72 s [vector] unpacking source archive /nix/store/ysi2m95adzhn3nmggwppnxvmps3a93x3-vector-0.13.2.0.tar.gz
  107. 4.73 s [vector] source root is vector-0.13.2.0
  108. 4.74 s [vector] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "vector-0.13.2.0/vector.cabal"
  109. 4.74 s [vector] Phase: patchPhase
  110. 4.75 s [vector] Replace Cabal file with edited version from mirror://hackage/vector-0.13.2.0/revision/2.cabal.
  111. 4.75 s [vector] Run jailbreak-cabal to lift version restrictions on build inputs.
  112. 4.77 s [vector] Phase: compileBuildDriverPhase
  113. 4.77 s [vector] setupCompileFlags: -package-db=/build/tmp.mGNR15s5od/setup-package.conf.d -threaded
  114. 4.82 s [duoids] Phase: setupCompilerEnvironmentPhase
  115. 4.82 s [duoids] Build with /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2.
  116. 4.96 s [vector] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.mGNR15s5od/Main.o )
  117. 4.99 s [duoids] Phase: unpackPhase
  118. 4.99 s [duoids] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./core
  119. 5.00 s [duoids] source root is core
  120. 5.01 s [duoids] Phase: patchPhase
  121. 5.01 s [vector] [2 of 2] Linking Setup
  122. 5.02 s [duoids] Phase: compileBuildDriverPhase
  123. 5.02 s [duoids] setupCompileFlags: -package-db=/build/tmp.atY5Pg3FL4/setup-package.conf.d -threaded
  124. 5.07 s [duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.atY5Pg3FL4/Main.o )
  125. 5.12 s [duoids] [2 of 2] Linking Setup
  126. 6.61 s [duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  127. 6.62 s [duoids] Phase: configurePhase
  128. 6.70 s [vector] Phase: updateAutotoolsGnuConfigScriptsPhase
  129. 6.70 s [duoids] configureFlags: --verbose --prefix=/nix/store/dxchzkr03dgfn7fwrd25dnkc7dzwhcka-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/jlvngamji60zzgwx0d0rwhjnx02j7xgx-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.atY5Pg3FL4/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/lib
  130. 6.70 s [vector] Phase: configurePhase
  131. 6.70 s [duoids] Using Parsec parser
  132. 6.70 s [duoids] Configuring duoids-0.0.1.0...
  133. 6.70 s [vector] configureFlags: --verbose --prefix=/nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --with-gcc=gcc --package-db=/build/tmp.mGNR15s5od/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/lib
  134. 6.70 s [vector] Using Parsec parser
  135. 6.70 s [vector] Configuring vector-0.13.2.0...
  136. 6.70 s [duoids] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  137. 6.70 s [duoids] 'ghc' version < 9.12):
  138. 6.70 s [duoids] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc is version
  139. 6.70 s [duoids] 9.12.2
  140. 6.70 s [vector] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  141. 6.70 s [vector] 'ghc' version < 9.12):
  142. 6.70 s [vector] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc is version
  143. 6.70 s [vector] 9.12.2
  144. 6.93 s [duoids] Flags chosen: lint=False, noisy-deprecations=True
  145. 6.95 s [vector] Flags chosen: boundschecks=True, internalchecks=False, unsafechecks=False,
  146. 6.95 s [vector] wall=False
  147. 7.21 s [vector] Dependency base: using base-4.21.0.0
  148. 7.21 s [vector] Dependency deepseq: using deepseq-1.5.1.0
  149. 7.21 s [vector] Dependency primitive: using primitive-0.9.1.0
  150. 7.21 s [vector] Dependency vector-stream: using vector-stream-0.1.0.1
  151. 7.21 s [vector] Dependency base: using base-4.21.0.0
  152. 7.21 s [vector] Dependency random: using random-1.2.1.3
  153. 7.21 s [vector] Dependency tasty: using tasty-1.5.3
  154. 7.21 s [vector] Dependency vector: using vector-0.13.2.0
  155. 7.21 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  156. 7.21 s [vector] Dependency base: using base-4.21.0.0
  157. 7.21 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  158. 7.21 s [vector] Dependency primitive: using primitive-0.9.1.0
  159. 7.21 s [vector] Dependency random: using random-1.2.1.3
  160. 7.21 s [vector] Dependency tasty: using tasty-1.5.3
  161. 7.22 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  162. 7.22 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  163. 7.22 s [vector] Dependency template-haskell: using template-haskell-2.23.0.0
  164. 7.22 s [vector] Dependency transformers: using transformers-0.6.1.2
  165. 7.22 s [vector] Dependency vector: using vector-0.13.2.0
  166. 7.22 s [vector] Dependency QuickCheck: using QuickCheck-2.15.0.1
  167. 7.22 s [vector] Dependency base: using base-4.21.0.0
  168. 7.22 s [vector] Dependency base-orphans: using base-orphans-0.9.3
  169. 7.22 s [vector] Dependency primitive: using primitive-0.9.1.0
  170. 7.22 s [vector] Dependency random: using random-1.2.1.3
  171. 7.22 s [vector] Dependency tasty: using tasty-1.5.3
  172. 7.22 s [vector] Dependency tasty-hunit: using tasty-hunit-0.10.2
  173. 7.22 s [vector] Dependency tasty-quickcheck: using tasty-quickcheck-0.11.1
  174. 7.22 s [vector] Dependency template-haskell: using template-haskell-2.23.0.0
  175. 7.22 s [vector] Dependency transformers: using transformers-0.6.1.2
  176. 7.22 s [vector] Dependency vector: using vector-0.13.2.0
  177. 7.22 s [vector] Dependency base: using base-4.21.0.0
  178. 7.22 s [vector] Dependency doctest: using doctest-0.24.2
  179. 7.22 s [vector] Dependency primitive: using primitive-0.9.1.0
  180. 7.22 s [vector] Dependency vector: using vector-0.13.2.0
  181. 7.22 s [vector] Dependency base: using base-4.21.0.0
  182. 7.22 s [vector] Dependency primitive: using primitive-0.9.1.0
  183. 7.22 s [vector] Dependency tasty: using tasty-1.5.3
  184. 7.22 s [vector] Dependency tasty-inspection-testing: using tasty-inspection-testing-0.2.1
  185. 7.22 s [vector] Dependency vector: using vector-0.13.2.0
  186. 7.22 s [vector] Source component graph:
  187. 7.22 s [vector] component lib
  188. 7.22 s [vector] component lib:benchmarks-O2 dependency lib
  189. 7.22 s [vector] component test:vector-doctest dependency lib
  190. 7.22 s [vector] component test:vector-inspection dependency lib
  191. 7.22 s [vector] component test:vector-tests-O0 dependency lib
  192. 7.22 s [vector] component test:vector-tests-O2 dependency lib
  193. 7.22 s [vector] Configured component graph:
  194. 7.22 s [vector] component vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  195. 7.22 s [vector] include base-4.21.0.0-b334
  196. 7.22 s [vector] include deepseq-1.5.1.0-3c62
  197. 7.22 s [vector] include primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  198. 7.22 s [vector] include vector-stream-0.1.0.1-ChLtnSdgBTn6SMCUdrCJ9I
  199. 7.22 s [vector] component vector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2
  200. 7.22 s [vector] include base-4.21.0.0-b334
  201. 7.22 s [vector] include random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  202. 7.22 s [vector] include tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  203. 7.22 s [vector] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  204. 7.22 s [vector] component vector-0.13.2.0-9hnhm1pD0j88NVy1x16lJk-vector-doctest
  205. 7.22 s [vector] include base-4.21.0.0-b334
  206. 7.22 s [vector] include doctest-0.24.2-7dcRhyR7fwsJGtJTyCZo6u
  207. 7.22 s [vector] include primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  208. 7.22 s [vector] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  209. 7.22 s [vector] component vector-0.13.2.0-DbskmzUAIx21PcGJKbvD6R-vector-inspection
  210. 7.22 s [vector] include base-4.21.0.0-b334
  211. 7.22 s [vector] include primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  212. 7.22 s [vector] include tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  213. 7.22 s [vector] include tasty-inspection-testing-0.2.1-4BytlpkEFY7JoNGJ0ndPgt
  214. 7.22 s [vector] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  215. 7.22 s [vector] component vector-0.13.2.0-6MB9OaQQVEdLiug5Yrv4Qb-vector-tests-O0
  216. 7.22 s [vector] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  217. 7.22 s [vector] include base-4.21.0.0-b334
  218. 7.22 s [vector] include base-orphans-0.9.3-21QsAxVCjWHDf2LYb4emj
  219. 7.22 s [vector] include primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  220. 7.22 s [vector] include random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  221. 7.22 s [vector] include tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  222. 7.22 s [vector] include tasty-hunit-0.10.2-JRT4tyEuMHKBzpxUU6VUG8
  223. 7.22 s [vector] include tasty-quickcheck-0.11.1-Ca4DEyt784fFBsV7HOinsy
  224. 7.22 s [vector] include template-haskell-2.23.0.0-4ee9
  225. 7.22 s [vector] include transformers-0.6.1.2-2558
  226. 7.22 s [vector] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  227. 7.22 s [vector] component vector-0.13.2.0-AXOUAscy1QX2RfxcSXsPHR-vector-tests-O2
  228. 7.22 s [vector] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  229. 7.22 s [vector] include base-4.21.0.0-b334
  230. 7.22 s [vector] include base-orphans-0.9.3-21QsAxVCjWHDf2LYb4emj
  231. 7.22 s [vector] include primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  232. 7.22 s [vector] include random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  233. 7.22 s [vector] include tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  234. 7.22 s [vector] include tasty-hunit-0.10.2-JRT4tyEuMHKBzpxUU6VUG8
  235. 7.22 s [vector] include tasty-quickcheck-0.11.1-Ca4DEyt784fFBsV7HOinsy
  236. 7.22 s [vector] include template-haskell-2.23.0.0-4ee9
  237. 7.22 s [vector] include transformers-0.6.1.2-2558
  238. 7.22 s [vector] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  239. 7.22 s [vector] Linked component graph:
  240. 7.22 s [vector] unit vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  241. 7.22 s [vector] include base-4.21.0.0-b334
  242. 7.22 s [vector] include deepseq-1.5.1.0-3c62
  243. 7.22 s [vector] include primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  244. 7.22 s [vector] include vector-stream-0.1.0.1-ChLtnSdgBTn6SMCUdrCJ9I
  245. 7.22 s [vector] Data.Vector=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector,Data.Vector.Fusion.Bundle=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Fusion.Bundle,Data.Vector.Fusion.Bundle.Monadic=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Fusion.Bundle.Monadic,Data.Vector.Fusion.Bundle.Size=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Fusion.Bundle.Size,Data.Vector.Fusion.Stream.Monadic=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Fusion.Stream.Monadic,Data.Vector.Fusion.Util=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Fusion.Util,Data.Vector.Generic=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Generic,Data.Vector.Generic.Base=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Generic.Base,Data.Vector.Generic.Mutable=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Generic.Mutable,Data.Vector.Generic.Mutable.Base=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Generic.Mutable.Base,Data.Vector.Generic.New=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Generic.New,Data.Vector.Internal.Check=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Internal.Check,Data.Vector.Mutable=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Mutable,Data.Vector.Primitive=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Primitive,Data.Vector.Primitive.Mutable=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Primitive.Mutable,Data.Vector.Storable=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Storable,Data.Vector.Storable.Internal=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Storable.Internal,Data.Vector.Storable.Mutable=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Storable.Mutable,Data.Vector.Strict=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Strict,Data.Vector.Strict.Mutable=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Strict.Mutable,Data.Vector.Unboxed=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Unboxed,Data.Vector.Unboxed.Base=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Unboxed.Base,Data.Vector.Unboxed.Mutable=vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH:Data.Vector.Unboxed.Mutable
  246. 7.22 s [vector] unit vector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2
  247. 7.22 s [vector] include base-4.21.0.0-b334
  248. 7.22 s [vector] include random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  249. 7.22 s [vector] include tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  250. 7.22 s [vector] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  251. 7.23 s [duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  252. 7.23 s [duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  253. 7.23 s [duoids] <4.23: using base-4.21.0.0
  254. 7.23 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  255. 7.23 s [duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  256. 7.23 s [duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  257. 7.23 s [duoids] <4.23: using base-4.21.0.0
  258. 7.23 s [duoids] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  259. 7.23 s [duoids] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  260. 7.23 s [duoids] doctest-0.24.2
  261. 7.23 s [duoids] Dependency duoids: using duoids-0.0.1.0
  262. 7.23 s [duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  263. 7.23 s [duoids] Source component graph:
  264. 7.23 s [duoids] component lib
  265. 7.23 s [duoids] component test:doctests dependency lib
  266. 7.23 s [duoids] Configured component graph:
  267. 7.23 s [duoids] component duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm
  268. 7.23 s [duoids] include base-4.21.0.0-b334
  269. 7.23 s [duoids] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  270. 7.23 s [duoids] component duoids-0.0.1.0-Bq2SppO46459RsGnpgwAUJ-doctests
  271. 7.23 s [duoids] include base-4.21.0.0-b334
  272. 7.23 s [duoids] include doctest-0.24.2-7dcRhyR7fwsJGtJTyCZo6u
  273. 7.23 s [duoids] include duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm
  274. 7.23 s [duoids] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  275. 7.23 s [duoids] Linked component graph:
  276. 7.23 s [duoids] unit duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm
  277. 7.23 s [duoids] include base-4.21.0.0-b334
  278. 7.23 s [duoids] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  279. 7.23 s [duoids] Control.Duoidal=duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm:Control.Duoidal,Control.Duoidal.Either=duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm:Control.Duoidal.Either,Control.Duoidal.Laws=duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm:Control.Duoidal.Laws,Data.Duoid=duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm:Data.Duoid,Data.Duoid.Laws=duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm:Data.Duoid.Laws
  280. 7.23 s [duoids] unit duoids-0.0.1.0-Bq2SppO46459RsGnpgwAUJ-doctests
  281. 7.23 s [duoids] include base-4.21.0.0-b334
  282. 7.23 s [duoids] include doctest-0.24.2-7dcRhyR7fwsJGtJTyCZo6u
  283. 7.23 s [duoids] include duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm
  284. 7.23 s [duoids] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  285. 7.23 s [duoids] Ready component graph:
  286. 7.23 s [duoids] definite duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm
  287. 7.23 s [duoids] depends base-4.21.0.0-b334
  288. 7.23 s [duoids] depends ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  289. 7.23 s [duoids] definite duoids-0.0.1.0-Bq2SppO46459RsGnpgwAUJ-doctests
  290. 7.23 s [duoids] depends base-4.21.0.0-b334
  291. 7.23 s [duoids] depends doctest-0.24.2-7dcRhyR7fwsJGtJTyCZo6u
  292. 7.23 s [duoids] depends duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm
  293. 7.23 s [duoids] depends ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  294. 7.23 s [duoids] Using Cabal-3.14.1.0 compiled by ghc-9.12
  295. 7.23 s [duoids] Using compiler: ghc-9.12.2
  296. 7.23 s [duoids] Using install prefix:
  297. 7.23 s [duoids] /nix/store/dxchzkr03dgfn7fwrd25dnkc7dzwhcka-duoids-0.0.1.0
  298. 7.23 s [duoids] Executables installed in:
  299. 7.23 s [duoids] /nix/store/dxchzkr03dgfn7fwrd25dnkc7dzwhcka-duoids-0.0.1.0/bin
  300. 7.23 s [duoids] Libraries installed in:
  301. 7.23 s [duoids] /nix/store/dxchzkr03dgfn7fwrd25dnkc7dzwhcka-duoids-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm
  302. 7.23 s [duoids] Dynamic Libraries installed in:
  303. 7.23 s [duoids] /nix/store/dxchzkr03dgfn7fwrd25dnkc7dzwhcka-duoids-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3
  304. 7.23 s [duoids] Private executables installed in:
  305. 7.23 s [duoids] /nix/store/dxchzkr03dgfn7fwrd25dnkc7dzwhcka-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.12.2-82d3/duoids-0.0.1.0
  306. 7.23 s [duoids] Data files installed in:
  307. 7.23 s [duoids] /nix/store/dxchzkr03dgfn7fwrd25dnkc7dzwhcka-duoids-0.0.1.0/share/x86_64-linux-ghc-9.12.2-82d3/duoids-0.0.1.0
  308. 7.23 s [duoids] Documentation installed in:
  309. 7.23 s [duoids] /nix/store/jlvngamji60zzgwx0d0rwhjnx02j7xgx-duoids-0.0.1.0-doc/share/doc/duoids-0.0.1.0
  310. 7.23 s [duoids] Configuration files installed in:
  311. 7.23 s [duoids] /nix/store/dxchzkr03dgfn7fwrd25dnkc7dzwhcka-duoids-0.0.1.0/etc
  312. 7.23 s [duoids] No alex found
  313. 7.23 s [duoids] Using ar found on system at:
  314. 7.23 s [duoids] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  315. 7.23 s [duoids] No c2hs found
  316. 7.23 s [duoids] No cpphs found
  317. 7.23 s [duoids] Using doctest version 0.24.2 found on system at:
  318. 7.23 s [duoids] /nix/store/39gb85lds43f7spl5690pdk8d65fpr5l-doctest-0.24.2/bin/doctest
  319. 7.23 s [duoids] Using gcc version 14.3.0 given by user at:
  320. 7.23 s [duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  321. 7.23 s [duoids] Using ghc version 9.12.2 found on system at:
  322. 7.23 s [duoids] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc
  323. 7.23 s [duoids] Using ghc-pkg version 9.12.2 found on system at:
  324. 7.23 s [duoids] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc-pkg-9.12.2
  325. 7.23 s [duoids] No ghcjs found
  326. 7.23 s [duoids] No ghcjs-pkg found
  327. 7.23 s [duoids] No greencard found
  328. 7.23 s [duoids] Using haddock version 2.30.0 found on system at:
  329. 7.23 s [duoids] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/haddock-ghc-9.12.2
  330. 7.23 s [duoids] No happy found
  331. 7.23 s [duoids] No haskell-suite found
  332. 7.23 s [duoids] No haskell-suite-pkg found
  333. 7.23 s [duoids] No hmake found
  334. 7.23 s [duoids] Using hpc version 0.69 found on system at:
  335. 7.23 s [duoids] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hpc-ghc-9.12.2
  336. 7.23 s [duoids] Using hsc2hs version 0.68.10 found on system at:
  337. 7.23 s [duoids] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  338. 7.23 s [duoids] Using hscolour version 1.25 found on system at:
  339. 7.23 s [duoids] /nix/store/02s9rad0jn6nj8z96k357im73hkzqsnw-hscolour-1.25/bin/HsColour
  340. 7.23 s [duoids] No jhc found
  341. 7.23 s [duoids] Using ld found on system at:
  342. 7.23 s [duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  343. 7.23 s [duoids] No pkg-config found
  344. 7.23 s [duoids] Using runghc version 9.12.2 found on system at:
  345. 7.23 s [duoids] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/runghc-9.12.2
  346. 7.23 s [duoids] Using strip version 2.44 found on system at:
  347. 7.23 s [duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  348. 7.23 s [duoids] Using tar found on system at:
  349. 7.23 s [duoids] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  350. 7.23 s [duoids] No uhc found
  351. 7.24 s [vector] Bench.Vector.Algo.AwShCC=vector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2:Bench.Vector.Algo.AwShCC,Bench.Vector.Algo.FindIndexR=vector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2:Bench.Vector.Algo.FindIndexR,Bench.Vector.Algo.HybCC=vector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2:Bench.Vector.Algo.HybCC,Bench.Vector.Algo.Leaffix=vector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2:Bench.Vector.Algo.Leaffix,Bench.Vector.Algo.ListRank=vector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2:Bench.Vector.Algo.ListRank,Bench.Vector.Algo.MutableSet=vector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2:Bench.Vector.Algo.MutableSet,Bench.Vector.Algo.NextPermutation=vector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2:Bench.Vector.Algo.NextPermutation,Bench.Vector.Algo.Quickhull=vector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2:Bench.Vector.Algo.Quickhull,Bench.Vector.Algo.Rootfix=vector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2:Bench.Vector.Algo.Rootfix,Bench.Vector.Algo.Spectral=vector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2:Bench.Vector.Algo.Spectral,Bench.Vector.Algo.Tridiag=vector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2:Bench.Vector.Algo.Tridiag,Bench.Vector.Tasty=vector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2:Bench.Vector.Tasty,Bench.Vector.TestData.Graph=vector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2:Bench.Vector.TestData.Graph,Bench.Vector.TestData.ParenTree=vector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2:Bench.Vector.TestData.ParenTree
  352. 7.24 s [vector] unit vector-0.13.2.0-9hnhm1pD0j88NVy1x16lJk-vector-doctest
  353. 7.24 s [vector] include base-4.21.0.0-b334
  354. 7.24 s [vector] include doctest-0.24.2-7dcRhyR7fwsJGtJTyCZo6u
  355. 7.24 s [vector] include primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  356. 7.24 s [vector] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  357. 7.24 s [vector] unit vector-0.13.2.0-DbskmzUAIx21PcGJKbvD6R-vector-inspection
  358. 7.24 s [vector] include base-4.21.0.0-b334
  359. 7.24 s [vector] include primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  360. 7.24 s [vector] include tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  361. 7.24 s [vector] include tasty-inspection-testing-0.2.1-4BytlpkEFY7JoNGJ0ndPgt
  362. 7.24 s [vector] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  363. 7.24 s [vector] unit vector-0.13.2.0-6MB9OaQQVEdLiug5Yrv4Qb-vector-tests-O0
  364. 7.24 s [vector] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  365. 7.24 s [vector] include base-4.21.0.0-b334
  366. 7.24 s [vector] include base-orphans-0.9.3-21QsAxVCjWHDf2LYb4emj
  367. 7.24 s [vector] include primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  368. 7.24 s [vector] include random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  369. 7.24 s [vector] include tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  370. 7.24 s [vector] include tasty-hunit-0.10.2-JRT4tyEuMHKBzpxUU6VUG8
  371. 7.24 s [vector] include tasty-quickcheck-0.11.1-Ca4DEyt784fFBsV7HOinsy
  372. 7.24 s [vector] include template-haskell-2.23.0.0-4ee9
  373. 7.24 s [vector] include transformers-0.6.1.2-2558
  374. 7.24 s [vector] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  375. 7.24 s [vector] unit vector-0.13.2.0-AXOUAscy1QX2RfxcSXsPHR-vector-tests-O2
  376. 7.24 s [vector] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  377. 7.24 s [vector] include base-4.21.0.0-b334
  378. 7.24 s [vector] include base-orphans-0.9.3-21QsAxVCjWHDf2LYb4emj
  379. 7.24 s [vector] include primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  380. 7.24 s [vector] include random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  381. 7.24 s [vector] include tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  382. 7.24 s [vector] include tasty-hunit-0.10.2-JRT4tyEuMHKBzpxUU6VUG8
  383. 7.24 s [vector] include tasty-quickcheck-0.11.1-Ca4DEyt784fFBsV7HOinsy
  384. 7.24 s [vector] include template-haskell-2.23.0.0-4ee9
  385. 7.24 s [vector] include transformers-0.6.1.2-2558
  386. 7.24 s [vector] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  387. 7.24 s [vector] Ready component graph:
  388. 7.24 s [vector] definite vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  389. 7.24 s [vector] depends base-4.21.0.0-b334
  390. 7.24 s [vector] depends deepseq-1.5.1.0-3c62
  391. 7.24 s [vector] depends primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  392. 7.24 s [vector] depends vector-stream-0.1.0.1-ChLtnSdgBTn6SMCUdrCJ9I
  393. 7.24 s [vector] definite vector-0.13.2.0-6MB9OaQQVEdLiug5Yrv4Qb-vector-tests-O0
  394. 7.24 s [vector] depends QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  395. 7.24 s [vector] depends base-4.21.0.0-b334
  396. 7.24 s [vector] depends base-orphans-0.9.3-21QsAxVCjWHDf2LYb4emj
  397. 7.24 s [vector] depends primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  398. 7.24 s [vector] depends random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  399. 7.24 s [vector] depends tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  400. 7.24 s [vector] depends tasty-hunit-0.10.2-JRT4tyEuMHKBzpxUU6VUG8
  401. 7.24 s [vector] depends tasty-quickcheck-0.11.1-Ca4DEyt784fFBsV7HOinsy
  402. 7.24 s [vector] depends template-haskell-2.23.0.0-4ee9
  403. 7.24 s [vector] depends transformers-0.6.1.2-2558
  404. 7.24 s [vector] depends vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  405. 7.24 s [vector] definite vector-0.13.2.0-9hnhm1pD0j88NVy1x16lJk-vector-doctest
  406. 7.24 s [vector] depends base-4.21.0.0-b334
  407. 7.24 s [vector] depends doctest-0.24.2-7dcRhyR7fwsJGtJTyCZo6u
  408. 7.24 s [vector] depends primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  409. 7.24 s [vector] depends vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  410. 7.24 s [vector] definite vector-0.13.2.0-AXOUAscy1QX2RfxcSXsPHR-vector-tests-O2
  411. 7.24 s [vector] depends QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  412. 7.24 s [vector] depends base-4.21.0.0-b334
  413. 7.24 s [vector] depends base-orphans-0.9.3-21QsAxVCjWHDf2LYb4emj
  414. 7.24 s [vector] depends primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  415. 7.24 s [vector] depends random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  416. 7.24 s [vector] depends tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  417. 7.24 s [vector] depends tasty-hunit-0.10.2-JRT4tyEuMHKBzpxUU6VUG8
  418. 7.24 s [vector] depends tasty-quickcheck-0.11.1-Ca4DEyt784fFBsV7HOinsy
  419. 7.24 s [vector] depends template-haskell-2.23.0.0-4ee9
  420. 7.24 s [vector] depends transformers-0.6.1.2-2558
  421. 7.24 s [vector] depends vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  422. 7.24 s [vector] definite vector-0.13.2.0-DbskmzUAIx21PcGJKbvD6R-vector-inspection
  423. 7.24 s [vector] depends base-4.21.0.0-b334
  424. 7.24 s [vector] depends primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  425. 7.24 s [vector] depends tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  426. 7.24 s [vector] depends tasty-inspection-testing-0.2.1-4BytlpkEFY7JoNGJ0ndPgt
  427. 7.24 s [vector] depends vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  428. 7.24 s [vector] definite vector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2
  429. 7.24 s [vector] depends base-4.21.0.0-b334
  430. 7.24 s [vector] depends random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  431. 7.24 s [vector] depends tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  432. 7.24 s [vector] depends vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  433. 7.24 s [vector] Using Cabal-3.14.1.0 compiled by ghc-9.12
  434. 7.24 s [vector] Using compiler: ghc-9.12.2
  435. 7.24 s [vector] Using install prefix:
  436. 7.24 s [vector] /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0
  437. 7.24 s [vector] Executables installed in:
  438. 7.24 s [vector] /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0/bin
  439. 7.24 s [vector] Libraries installed in:
  440. 7.24 s [vector] /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  441. 7.24 s [vector] Dynamic Libraries installed in:
  442. 7.24 s [vector] /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3
  443. 7.24 s [vector] Private executables installed in:
  444. 7.24 s [vector] /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0/libexec/x86_64-linux-ghc-9.12.2-82d3/vector-0.13.2.0
  445. 7.24 s [vector] Data files installed in:
  446. 7.24 s [vector] /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0/share/x86_64-linux-ghc-9.12.2-82d3/vector-0.13.2.0
  447. 7.24 s [vector] Documentation installed in:
  448. 7.24 s [vector] /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0/share/doc/x86_64-linux-ghc-9.12.2-82d3/vector-0.13.2.0
  449. 7.24 s [vector] Configuration files installed in:
  450. 7.24 s [vector] /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0/etc
  451. 7.24 s [vector] No alex found
  452. 7.24 s [vector] Using ar found on system at:
  453. 7.24 s [vector] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  454. 7.24 s [vector] No c2hs found
  455. 7.24 s [vector] No cpphs found
  456. 7.24 s [vector] Using doctest version 0.24.2 found on system at:
  457. 7.24 s [vector] /nix/store/39gb85lds43f7spl5690pdk8d65fpr5l-doctest-0.24.2/bin/doctest
  458. 7.24 s [vector] Using gcc version 14.3.0 given by user at:
  459. 7.24 s [vector] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  460. 7.24 s [vector] Using ghc version 9.12.2 found on system at:
  461. 7.24 s [vector] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc
  462. 7.24 s [vector] Using ghc-pkg version 9.12.2 found on system at:
  463. 7.24 s [vector] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc-pkg-9.12.2
  464. 7.24 s [vector] No ghcjs found
  465. 7.24 s [vector] No ghcjs-pkg found
  466. 7.24 s [vector] No greencard found
  467. 7.24 s [vector] Using haddock version 2.30.0 found on system at:
  468. 7.24 s [vector] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/haddock-ghc-9.12.2
  469. 7.24 s [vector] No happy found
  470. 7.24 s [vector] No haskell-suite found
  471. 7.24 s [vector] No haskell-suite-pkg found
  472. 7.24 s [vector] No hmake found
  473. 7.24 s [vector] Using hpc version 0.69 found on system at:
  474. 7.24 s [vector] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hpc-ghc-9.12.2
  475. 7.24 s [vector] Using hsc2hs version 0.68.10 found on system at:
  476. 7.24 s [vector] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  477. 7.24 s [vector] Using hscolour version 1.25 found on system at:
  478. 7.24 s [vector] /nix/store/02s9rad0jn6nj8z96k357im73hkzqsnw-hscolour-1.25/bin/HsColour
  479. 7.24 s [vector] No jhc found
  480. 7.24 s [vector] Using ld found on system at:
  481. 7.24 s [vector] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  482. 7.24 s [vector] No pkg-config found
  483. 7.24 s [vector] Using runghc version 9.12.2 found on system at:
  484. 7.24 s [vector] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/runghc-9.12.2
  485. 7.24 s [vector] Using strip version 2.44 found on system at:
  486. 7.24 s [vector] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  487. 7.24 s [vector] Using tar found on system at:
  488. 7.24 s [vector] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  489. 7.24 s [vector] No uhc found
  490. 7.45 s [duoids] Phase: buildPhase
  491. 7.50 s [vector] Phase: buildPhase
  492. 7.78 s [duoids] Preprocessing library for duoids-0.0.1.0...
  493. 7.78 s [duoids] Building library for duoids-0.0.1.0...
  494. 7.82 s [vector] Preprocessing library for vector-0.13.2.0...
  495. 7.83 s [vector] Building library for vector-0.13.2.0...
  496. 7.91 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.o, dist/build/Control/Duoidal/Async.dyn_o )
  497. 8.34 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 )
  498. 8.39 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 )
  499. 8.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.o, dist/build/Data/Vector/Fusion/Bundle/Size.dyn_o )
  500. 8.53 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.o, dist/build/Data/Duoid.dyn_o )
  501. 8.63 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 )
  502. 8.63 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 )
  503. 8.63 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 )
  504. 8.63 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 )
  505. 10.09 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.o, dist/build/Control/Duoidal.dyn_o )
  506. 11.76 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.o, dist/build/Control/Duoidal/Either.dyn_o )
  507. 11.87 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.o, dist/build/Data/Duoid/Laws.dyn_o )
  508. 11.87 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.o, dist/build/Control/Duoidal/Laws.dyn_o )
  509. 12.07 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, dist/build/Control/Duoidal/Async.p_o )
  510. 12.81 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, dist/build/Data/Duoid.p_o )
  511. 13.96 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 )
  512. 14.30 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, dist/build/Control/Duoidal.p_o )
  513. 16.30 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, dist/build/Control/Duoidal/Either.p_o )
  514. 16.44 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, dist/build/Data/Duoid/Laws.p_o )
  515. 16.44 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, dist/build/Control/Duoidal/Laws.p_o )
  516. 16.86 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 )
  517. 19.38 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  518. 19.38 s [duoids] Building test suite 'doctests' for duoids-0.0.1.0...
  519. 19.49 s [duoids] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  520. 19.96 s [duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  521. 19.96 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 )
  522. 20.68 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 )
  523. 20.75 s [duoids] [3 of 3] Linking dist/build/doctests/doctests
  524. 24.86 s [duoids] Phase: checkPhase
  525. 25.07 s [duoids] Running 1 test suites...
  526. 25.07 s [duoids] Test suite doctests: RUNNING...
  527. 25.33 s [duoids] on the commandline: warning: [GHC-98887]
  528. 25.33 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  529. 25.33 s [duoids]
  530. 25.33 s [duoids] on the commandline: warning: [GHC-98887]
  531. 25.33 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  532. 25.33 s [duoids]
  533. 25.34 s [duoids] on the commandline: warning: [GHC-98887]
  534. 25.34 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  535. 25.34 s [duoids]
  536. 25.34 s [duoids] on the commandline: warning: [GHC-98887]
  537. 25.34 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  538. 25.34 s [duoids]
  539. 25.34 s [duoids] on the commandline: warning: [GHC-98887]
  540. 25.34 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  541. 25.34 s [duoids]
  542. 25.34 s [duoids] on the commandline: warning: [GHC-98887]
  543. 25.34 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  544. 25.34 s [duoids]
  545. 25.34 s [duoids] on the commandline: warning: [GHC-98887]
  546. 25.34 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  547. 25.34 s [duoids]
  548. 25.34 s [duoids] on the commandline: warning: [GHC-98887]
  549. 25.34 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  550. 25.34 s [duoids]
  551. 25.34 s [duoids] on the commandline: warning: [GHC-98887]
  552. 25.34 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  553. 25.34 s [duoids]
  554. 25.34 s [duoids] on the commandline: warning: [GHC-98887]
  555. 25.34 s [duoids] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  556. 25.34 s [duoids]
  557. 26.22 s [duoids] Examples: 5 Tried: 5 Errors: 0 Failures: 0
  558. 26.26 s [duoids] NameLib Nothing
  559. 26.26 s [duoids] ----------------------------------------
  560. 26.27 s [duoids] Test suite doctests: PASS
  561. 26.27 s [duoids] Test suite logged to: dist/test/duoids-0.0.1.0-doctests.log
  562. 26.27 s [duoids] 1 of 1 test suites (1 of 1 test cases) passed.
  563. 26.28 s [duoids] Phase: haddockPhase
  564. 27.62 s [duoids] Preprocessing library for duoids-0.0.1.0...
  565. 27.62 s [duoids] Running Haddock on library for duoids-0.0.1.0...
  566. 27.73 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.o, dist/build/Data/Vector/Mutable.dyn_o )
  567. 27.73 s [vector] src/Data/Vector/Mutable.hs:99:20: warning: [GHC-90584] [-Wderiving-typeable]
  568. 27.73 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  569. 27.73 s [vector] • In the data declaration for ‘MVector’
  570. 27.73 s [vector] |
  571. 27.73 s [vector] 99 | deriving ( Typeable )
  572. 27.73 s [vector] | ^^^^^^^^
  573. 27.73 s [vector]
  574. 27.73 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.o, dist/build/Data/Vector.dyn_o )
  575. 27.89 s [vector] src/Data/Vector.hs:222:20: warning: [GHC-90584] [-Wderiving-typeable]
  576. 27.89 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  577. 27.89 s [vector] • In the data declaration for ‘Vector’
  578. 27.89 s [vector] |
  579. 27.89 s [vector] 222 | deriving ( Typeable )
  580. 27.89 s [vector] | ^^^^^^^^
  581. 27.89 s [vector]
  582. 27.98 s [duoids] [1 of 6] Compiling Control.Duoidal.Async ( src/Control/Duoidal/Async.hs, nothing ) [HIE file is missing]
  583. 28.34 s [duoids] [2 of 6] Compiling Data.Duoid ( src/Data/Duoid.hs, nothing ) [HIE file is missing]
  584. 28.65 s [duoids] [3 of 6] Compiling Control.Duoidal ( src/Control/Duoidal.hs, nothing ) [HIE file is missing]
  585. 29.16 s [duoids] [4 of 6] Compiling Control.Duoidal.Either ( src/Control/Duoidal/Either.hs, nothing ) [HIE file is missing]
  586. 29.16 s [duoids] [5 of 6] Compiling Data.Duoid.Laws ( src/Data/Duoid/Laws.hs, nothing ) [HIE file is missing]
  587. 29.18 s [duoids] [6 of 6] Compiling Control.Duoidal.Laws ( src/Control/Duoidal/Laws.hs, nothing ) [HIE file is missing]
  588. 29.19 s [duoids] Haddock coverage:
  589. 29.19 s [duoids] Warning: 'Alternative' is out of scope.
  590. 29.19 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  591. 29.19 s [duoids] Warning: 'Applicative' is out of scope.
  592. 29.19 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  593. 29.19 s [duoids] Warning: 'cancel' is out of scope.
  594. 29.19 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  595. 29.47 s [duoids] Warning: 'Par' is ambiguous. It is defined
  596. 29.47 s [duoids] * at src/Data/Duoid.hs:62:5
  597. 29.47 s [duoids] * at src/Data/Duoid.hs:58:1
  598. 29.47 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  599. 29.47 s [duoids] by specifying the type/value namespace explicitly.
  600. 29.47 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:58:1
  601. 29.47 s [duoids] Warning: 'Seq' is ambiguous. It is defined
  602. 29.47 s [duoids] * at src/Data/Duoid.hs:118:5
  603. 29.47 s [duoids] * at src/Data/Duoid.hs:114:1
  604. 29.47 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  605. 29.47 s [duoids] by specifying the type/value namespace explicitly.
  606. 29.47 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:114:1
  607. 29.47 s [duoids] 100% ( 10 / 10) in 'Data.Duoid'
  608. 29.47 s [duoids] Warning: 'ExceptT' is out of scope.
  609. 29.47 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  610. 29.47 s [duoids] Warning: 'Parallel' is ambiguous. It is defined
  611. 29.48 s [duoids] * at src/Control/Duoidal.hs:238:5
  612. 29.48 s [duoids] * at src/Control/Duoidal.hs:234:1
  613. 29.48 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  614. 29.48 s [duoids] by specifying the type/value namespace explicitly.
  615. 29.48 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:234:1
  616. 29.48 s [duoids] Warning: 'Sequential' is ambiguous. It is defined
  617. 29.48 s [duoids] * at src/Control/Duoidal.hs:308:5
  618. 29.48 s [duoids] * at src/Control/Duoidal.hs:304:1
  619. 29.48 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  620. 29.48 s [duoids] by specifying the type/value namespace explicitly.
  621. 29.48 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:304:1
  622. 29.48 s [duoids] Warning: 'NoDefaultPrelude' is out of scope.
  623. 29.48 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  624. 29.48 s [duoids] Warning: 'Validation' is out of scope.
  625. 29.48 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  626. 29.48 s [duoids] Warning: 'fail' is out of scope.
  627. 29.48 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  628. 29.48 s [duoids] Warning: 'MonadFail' is out of scope.
  629. 29.48 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  630. 29.48 s [duoids] Warning: 'Commutative' is ambiguous. It is defined
  631. 29.48 s [duoids] * at src/Control/Duoidal.hs:774:5
  632. 29.48 s [duoids] * at src/Control/Duoidal.hs:770:1
  633. 29.48 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  634. 29.48 s [duoids] by specifying the type/value namespace explicitly.
  635. 29.48 s [duoids] Defaulting to the one defined at src/Control/Duoidal.hs:770:1
  636. 29.48 s [duoids] Warning: 'Writer' is out of scope.
  637. 29.48 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  638. 29.48 s [duoids] Warning: 'Set' is out of scope.
  639. 29.48 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  640. 29.48 s [duoids] Warning: 'Char' is out of scope.
  641. 29.48 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  642. 29.48 s [duoids] Warning: 'Const' is ambiguous. It is defined
  643. 29.48 s [duoids] * in ‘GHC.Internal.Data.Functor.Const’
  644. 29.48 s [duoids] * in ‘GHC.Internal.Data.Functor.Const’
  645. 29.48 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  646. 29.48 s [duoids] by specifying the type/value namespace explicitly.
  647. 29.48 s [duoids] Defaulting to the one defined in ‘GHC.Internal.Data.Functor.Const’
  648. 29.48 s [duoids] Warning: 'Normal' is ambiguous. It is defined
  649. 29.48 s [duoids] * at src/Control/Duoidal.hs:395:1
  650. 29.48 s [duoids] * at src/Data/Duoid.hs:183:1
  651. 29.48 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  652. 29.48 s [duoids] by specifying the type/value namespace explicitly.
  653. 29.48 s [duoids] Defaulting to the one defined at src/Data/Duoid.hs:183:1
  654. 29.48 s [duoids] 100% ( 60 / 60) in 'Control.Duoidal'
  655. 29.48 s [duoids] 100% ( 2 / 2) in 'Control.Duoidal.Either'
  656. 29.48 s [duoids] Warning: 'Normal' is out of scope.
  657. 29.48 s [duoids] If you qualify the identifier, haddock can try to link it anyway.
  658. 29.48 s [duoids] Warning: 'Law' is ambiguous. It is defined
  659. 29.48 s [duoids] * at src/Data/Duoid/Laws.hs:38:5
  660. 29.48 s [duoids] * at src/Data/Duoid/Laws.hs:34:1
  661. 29.48 s [duoids] You may be able to disambiguate the identifier by qualifying it or
  662. 29.48 s [duoids] by specifying the type/value namespace explicitly.
  663. 29.48 s [duoids] Defaulting to the one defined at src/Data/Duoid/Laws.hs:34:1
  664. 29.48 s [duoids] 100% ( 12 / 12) in 'Data.Duoid.Laws'
  665. 29.48 s [duoids] 100% ( 6 / 6) in 'Control.Duoidal.Laws'
  666. 29.70 s [duoids] Warning: Data.Duoid: could not find link destinations for:
  667. 29.70 s [duoids] - Data.Duoid.Rep1_Comm
  668. 29.70 s [duoids] - Data.Duoid.Rep1_Par
  669. 29.70 s [duoids] - Data.Duoid.Rep1_Seq
  670. 29.70 s [duoids] - Data.Duoid.Rep_Comm
  671. 29.70 s [duoids] - Data.Duoid.Rep_Par
  672. 29.70 s [duoids] - Data.Duoid.Rep_Seq
  673. 29.71 s [duoids] Warning: Control.Duoidal: could not find link destinations for:
  674. 29.71 s [duoids] - Control.Duoidal.Rep1_Commutative
  675. 29.71 s [duoids] - Control.Duoidal.Rep1_Parallel
  676. 29.71 s [duoids] - Control.Duoidal.Rep1_Sequential
  677. 29.71 s [duoids] - Control.Duoidal.Rep_Commutative
  678. 29.71 s [duoids] - Control.Duoidal.Rep_Parallel
  679. 29.71 s [duoids] - Control.Duoidal.Rep_Sequential
  680. 29.71 s [duoids] Warning: Data.Duoid.Laws: could not find link destinations for:
  681. 29.71 s [duoids] - Data.Duoid.Laws.Rep1_NormalLaws
  682. 29.71 s [duoids] - Data.Duoid.Laws.Rep_Law
  683. 29.71 s [duoids] - Data.Duoid.Laws.Rep_Laws
  684. 29.71 s [duoids] - Data.Duoid.Laws.Rep_NormalLaws
  685. 34.28 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 )
  686. 34.35 s [vector] src/Data/Vector/Primitive/Mutable.hs:115:20: warning: [GHC-90584] [-Wderiving-typeable]
  687. 34.35 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  688. 34.35 s [vector] • In the data declaration for ‘MVector’
  689. 34.35 s [vector] |
  690. 34.35 s [vector] 115 | deriving ( Typeable )
  691. 34.35 s [vector] | ^^^^^^^^
  692. 34.35 s [vector]
  693. 34.35 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 )
  694. 34.35 s [vector] src/Data/Vector/Primitive.hs:209:14: warning: [GHC-90584] [-Wderiving-typeable]
  695. 34.35 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  696. 34.35 s [vector] • In the data declaration for ‘Vector’
  697. 34.35 s [vector] |
  698. 34.35 s [vector] 209 | deriving ( Typeable )
  699. 34.35 s [vector] | ^^^^^^^^
  700. 34.35 s [vector]
  701. 34.35 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 )
  702. 34.35 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 )
  703. 34.35 s [vector] src/Data/Vector/Storable/Mutable.hs:134:20: warning: [GHC-90584] [-Wderiving-typeable]
  704. 34.35 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  705. 34.35 s [vector] • In the data declaration for ‘MVector’
  706. 34.35 s [vector] |
  707. 34.35 s [vector] 134 | deriving ( Typeable )
  708. 34.35 s [vector] | ^^^^^^^^
  709. 34.35 s [vector]
  710. 34.35 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 )
  711. 34.35 s [vector] src/Data/Vector/Storable.hs:219:20: warning: [GHC-90584] [-Wderiving-typeable]
  712. 34.35 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  713. 34.35 s [vector] • In the data declaration for ‘Vector’
  714. 34.35 s [vector] |
  715. 34.35 s [vector] 219 | deriving ( Typeable )
  716. 34.35 s [vector] | ^^^^^^^^
  717. 34.35 s [vector]
  718. 35.02 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 )
  719. 35.02 s [vector] src/Data/Vector/Strict/Mutable.hs:97:20: warning: [GHC-90584] [-Wderiving-typeable]
  720. 35.02 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  721. 35.02 s [vector] • In the newtype declaration for ‘MVector’
  722. 35.02 s [vector] |
  723. 35.02 s [vector] 97 | deriving ( Typeable )
  724. 35.02 s [vector] | ^^^^^^^^
  725. 35.02 s [vector]
  726. 35.02 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 )
  727. 35.02 s [vector] src/Data/Vector/Strict.hs:221:13: warning: [GHC-90584] [-Wderiving-typeable]
  728. 35.02 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  729. 35.02 s [vector] • In the newtype declaration for ‘Vector’
  730. 35.02 s [vector] |
  731. 35.02 s [vector] 221 | deriving (Typeable, Foldable.Foldable, Semigroup, Monoid)
  732. 35.02 s [vector] | ^^^^^^^^
  733. 35.02 s [vector]
  734. 38.57 s [duoids] Documentation created: dist/doc/html/duoids, dist/doc/html/duoids/duoids.txt
  735. 39.80 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 )
  736. 39.96 s [duoids] Preprocessing test suite 'doctests' for duoids-0.0.1.0...
  737. 40.04 s [vector] src/Data/Vector/Unboxed/Base.hs:97:1: warning: [GHC-90584] [-Wderiving-typeable]
  738. 40.04 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  739. 40.04 s [vector] • In the stand-alone deriving instance for ‘Typeable Vector’
  740. 40.04 s [vector] |
  741. 40.04 s [vector] 97 | deriving instance Typeable Vector
  742. 40.04 s [vector] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  743. 40.04 s [vector]
  744. 40.04 s [vector] src/Data/Vector/Unboxed/Base.hs:98:1: warning: [GHC-90584] [-Wderiving-typeable]
  745. 40.04 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  746. 40.04 s [vector] • In the stand-alone deriving instance for ‘Typeable MVector’
  747. 40.04 s [vector] |
  748. 40.04 s [vector] 98 | deriving instance Typeable MVector
  749. 40.04 s [vector] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  750. 40.04 s [vector]
  751. 40.11 s [duoids] Phase: installPhase
  752. 40.28 s [duoids] Installing library in /nix/store/dxchzkr03dgfn7fwrd25dnkc7dzwhcka-duoids-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm
  753. 40.60 s [duoids] Phase: fixupPhase
  754. 40.61 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/dxchzkr03dgfn7fwrd25dnkc7dzwhcka-duoids-0.0.1.0
  755. 40.62 s [duoids] shrinking /nix/store/dxchzkr03dgfn7fwrd25dnkc7dzwhcka-duoids-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHSduoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm-ghc9.12.2.so
  756. 40.62 s [duoids] checking for references to /build/ in /nix/store/dxchzkr03dgfn7fwrd25dnkc7dzwhcka-duoids-0.0.1.0...
  757. 40.65 s [duoids] patching script interpreter paths in /nix/store/dxchzkr03dgfn7fwrd25dnkc7dzwhcka-duoids-0.0.1.0
  758. 40.65 s [duoids] stripping (with command strip and flags -S -p) in /nix/store/dxchzkr03dgfn7fwrd25dnkc7dzwhcka-duoids-0.0.1.0/lib
  759. 40.93 s [duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/jlvngamji60zzgwx0d0rwhjnx02j7xgx-duoids-0.0.1.0-doc
  760. 40.94 s [duoids] checking for references to /build/ in /nix/store/jlvngamji60zzgwx0d0rwhjnx02j7xgx-duoids-0.0.1.0-doc...
  761. 40.95 s [duoids] patching script interpreter paths in /nix/store/jlvngamji60zzgwx0d0rwhjnx02j7xgx-duoids-0.0.1.0-doc
  762. 41.09 s [duoids:post-build] Uploading to cachix cache "sellout": /nix/store/dxchzkr03dgfn7fwrd25dnkc7dzwhcka-duoids-0.0.1.0 /nix/store/jlvngamji60zzgwx0d0rwhjnx02j7xgx-duoids-0.0.1.0-doc
  763. 41.64 s [duoids:post-build] Pushing 2 paths (72 are already present) using zstd to cache sellout ⏳
  764. 41.64 s [duoids:post-build]
  765. 41.99 s [duoids:post-build] Pushing /nix/store/dxchzkr03dgfn7fwrd25dnkc7dzwhcka-duoids-0.0.1.0 (8.03 MiB)
  766. 42.19 s [duoids:post-build] Pushing /nix/store/jlvngamji60zzgwx0d0rwhjnx02j7xgx-duoids-0.0.1.0-doc (2.26 MiB)
  767. 43.28 s [duoids:post-build]
  768. 43.28 s [duoids:post-build] All done.
  769. 43.30 s [duoids:post-build] Uploading to the NixCI cache: /nix/store/dxchzkr03dgfn7fwrd25dnkc7dzwhcka-duoids-0.0.1.0 /nix/store/jlvngamji60zzgwx0d0rwhjnx02j7xgx-duoids-0.0.1.0-doc
  770. 43.35 s [duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  771. 43.36 s [duoids:post-build] copying 2 paths...
  772. 43.36 s [duoids:post-build] copying path '/nix/store/jlvngamji60zzgwx0d0rwhjnx02j7xgx-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  773. 43.94 s [duoids:post-build] copying path '/nix/store/dxchzkr03dgfn7fwrd25dnkc7dzwhcka-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  774. 46.06 s [duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  775. 46.37 s [duoids:post-build] copying 2 paths...
  776. 46.41 s [duoids:post-build] copying path '/nix/store/vh5b14b2jiyz9ppb2nzbwzgh1yyr3x14-doctest-0.24.2.drv' to 'https://cache.nix-ci.com'...
  777. 46.59 s [duoids:post-build] copying path '/nix/store/mcqv3lw617q3fa2bj5px52d67dl3if1c-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  778. 46.82 s Progress: 1 of 17 built (1 building), 43 of 43 downloaded from cache
  779. 46.86 s Building /nix/store/r4qbh0nx4xdav1brmczrk08kh22icqzb-duoidal-transformers-0.0.1.0.drv
  780. 46.90 s Building /nix/store/7zdasvd6vyppkvgr76ry6yh3qy0k06zv-duoids-hedgehog-0.0.1.0.drv
  781. 46.90 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 )
  782. 46.95 s [duoidal-transformers] Phase: setupCompilerEnvironmentPhase
  783. 46.96 s [duoidal-transformers] Build with /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2.
  784. 47.05 s [duoids-hedgehog] Phase: setupCompilerEnvironmentPhase
  785. 47.06 s [duoids-hedgehog] Build with /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2.
  786. 47.11 s [duoidal-transformers] Phase: unpackPhase
  787. 47.12 s [duoidal-transformers] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./transformers
  788. 47.12 s [duoidal-transformers] source root is transformers
  789. 47.13 s [duoidal-transformers] Phase: patchPhase
  790. 47.14 s [duoidal-transformers] Phase: compileBuildDriverPhase
  791. 47.14 s [duoidal-transformers] setupCompileFlags: -package-db=/build/tmp.3i36JQBN9H/setup-package.conf.d -threaded
  792. 47.20 s [duoidal-transformers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.3i36JQBN9H/Main.o )
  793. 47.24 s [duoidal-transformers] [2 of 2] Linking Setup
  794. 47.27 s [duoids-hedgehog] Phase: unpackPhase
  795. 47.28 s [duoids-hedgehog] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./hedgehog
  796. 47.28 s [duoids-hedgehog] source root is hedgehog
  797. 47.29 s [duoids-hedgehog] Phase: patchPhase
  798. 47.30 s [duoids-hedgehog] Phase: compileBuildDriverPhase
  799. 47.30 s [duoids-hedgehog] setupCompileFlags: -package-db=/build/tmp.CNG6AtDHgd/setup-package.conf.d -threaded
  800. 47.35 s [duoids-hedgehog] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.CNG6AtDHgd/Main.o )
  801. 47.40 s [duoids-hedgehog] [2 of 2] Linking Setup
  802. 48.57 s [duoidal-transformers] Phase: updateAutotoolsGnuConfigScriptsPhase
  803. 48.58 s [duoidal-transformers] Phase: configurePhase
  804. 48.59 s [duoidal-transformers] configureFlags: --verbose --prefix=/nix/store/scmby30dka4njfxm1w6njdavhbdi3dv6-duoidal-transformers-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/v3mp985hqrlllakk3b2c2i0x5r8268dl-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.3i36JQBN9H/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/lib
  805. 48.60 s [duoidal-transformers] Using Parsec parser
  806. 48.60 s [duoidal-transformers] Configuring duoidal-transformers-0.0.1.0...
  807. 48.63 s [duoidal-transformers] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  808. 48.63 s [duoidal-transformers] 'ghc' version < 9.12):
  809. 48.63 s [duoidal-transformers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc is version
  810. 48.63 s [duoidal-transformers] 9.12.2
  811. 48.72 s [duoids-hedgehog] Phase: updateAutotoolsGnuConfigScriptsPhase
  812. 48.73 s [duoids-hedgehog] Phase: configurePhase
  813. 48.73 s [duoids-hedgehog] configureFlags: --verbose --prefix=/nix/store/b23lx4bcxv7k9d65q88921y71rbk250l-duoids-hedgehog-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/jd7djwacx5cr6lf90fi0c1d1r8dgg5nw-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.CNG6AtDHgd/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/lib
  814. 48.74 s [duoids-hedgehog] Using Parsec parser
  815. 48.74 s [duoids-hedgehog] Configuring duoids-hedgehog-0.0.1.0...
  816. 48.78 s [duoids-hedgehog] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  817. 48.78 s [duoids-hedgehog] 'ghc' version < 9.12):
  818. 48.78 s [duoids-hedgehog] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc is version
  819. 48.78 s [duoids-hedgehog] 9.12.2
  820. 48.87 s [duoidal-transformers] Flags chosen: lint=False, noisy-deprecations=True
  821. 49.05 s [duoids-hedgehog] Flags chosen: lint=False, noisy-deprecations=True
  822. 49.13 s [duoidal-transformers] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  823. 49.13 s [duoidal-transformers] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  824. 49.13 s [duoidal-transformers] <4.23: using base-4.21.0.0
  825. 49.13 s [duoidal-transformers] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  826. 49.13 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  827. 49.13 s [duoidal-transformers] Dependency transformers >=0.5.6 && <0.6 || >=0.6.1 && <0.7: using
  828. 49.13 s [duoidal-transformers] transformers-0.6.1.2
  829. 49.13 s [duoidal-transformers] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  830. 49.13 s [duoidal-transformers] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  831. 49.13 s [duoidal-transformers] <4.23: using base-4.21.0.0
  832. 49.13 s [duoidal-transformers] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  833. 49.13 s [duoidal-transformers] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  834. 49.13 s [duoidal-transformers] doctest-0.24.2
  835. 49.13 s [duoidal-transformers] Dependency duoidal-transformers: using duoidal-transformers-0.0.1.0
  836. 49.13 s [duoidal-transformers] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  837. 49.13 s [duoidal-transformers] Source component graph:
  838. 49.13 s [duoidal-transformers] component lib
  839. 49.13 s [duoidal-transformers] component test:doctests dependency lib
  840. 49.13 s [duoidal-transformers] Configured component graph:
  841. 49.13 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-Hk9hLhwJEJqLsmdo1mSY2N
  842. 49.13 s [duoidal-transformers] include base-4.21.0.0-b334
  843. 49.13 s [duoidal-transformers] include duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm
  844. 49.13 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  845. 49.13 s [duoidal-transformers] include transformers-0.6.1.2-2558
  846. 49.13 s [duoidal-transformers] component duoidal-transformers-0.0.1.0-AHERlYPmsY3HgBmv1v3ILb-doctests
  847. 49.13 s [duoidal-transformers] include base-4.21.0.0-b334
  848. 49.13 s [duoidal-transformers] include doctest-0.24.2-7dcRhyR7fwsJGtJTyCZo6u
  849. 49.13 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-Hk9hLhwJEJqLsmdo1mSY2N
  850. 49.13 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  851. 49.13 s [duoidal-transformers] Linked component graph:
  852. 49.13 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-Hk9hLhwJEJqLsmdo1mSY2N
  853. 49.13 s [duoidal-transformers] include base-4.21.0.0-b334
  854. 49.13 s [duoidal-transformers] include duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm
  855. 49.13 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  856. 49.13 s [duoidal-transformers] include transformers-0.6.1.2-2558
  857. 49.13 s [duoidal-transformers] Control.Duoidal.Trans.Class=duoidal-transformers-0.0.1.0-Hk9hLhwJEJqLsmdo1mSY2N:Control.Duoidal.Trans.Class,Control.Duoidal.Trans.Orphans=duoidal-transformers-0.0.1.0-Hk9hLhwJEJqLsmdo1mSY2N:Control.Duoidal.Trans.Orphans
  858. 49.13 s [duoidal-transformers] unit duoidal-transformers-0.0.1.0-AHERlYPmsY3HgBmv1v3ILb-doctests
  859. 49.13 s [duoidal-transformers] include base-4.21.0.0-b334
  860. 49.13 s [duoidal-transformers] include doctest-0.24.2-7dcRhyR7fwsJGtJTyCZo6u
  861. 49.13 s [duoidal-transformers] include duoidal-transformers-0.0.1.0-Hk9hLhwJEJqLsmdo1mSY2N
  862. 49.13 s [duoidal-transformers] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  863. 49.13 s [duoidal-transformers] Ready component graph:
  864. 49.13 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-Hk9hLhwJEJqLsmdo1mSY2N
  865. 49.13 s [duoidal-transformers] depends base-4.21.0.0-b334
  866. 49.13 s [duoidal-transformers] depends duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm
  867. 49.13 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  868. 49.13 s [duoidal-transformers] depends transformers-0.6.1.2-2558
  869. 49.13 s [duoidal-transformers] definite duoidal-transformers-0.0.1.0-AHERlYPmsY3HgBmv1v3ILb-doctests
  870. 49.13 s [duoidal-transformers] depends base-4.21.0.0-b334
  871. 49.13 s [duoidal-transformers] depends doctest-0.24.2-7dcRhyR7fwsJGtJTyCZo6u
  872. 49.13 s [duoidal-transformers] depends duoidal-transformers-0.0.1.0-Hk9hLhwJEJqLsmdo1mSY2N
  873. 49.13 s [duoidal-transformers] depends ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  874. 49.13 s [duoidal-transformers] Using Cabal-3.14.1.0 compiled by ghc-9.12
  875. 49.13 s [duoidal-transformers] Using compiler: ghc-9.12.2
  876. 49.13 s [duoidal-transformers] Using install prefix:
  877. 49.13 s [duoidal-transformers] /nix/store/scmby30dka4njfxm1w6njdavhbdi3dv6-duoidal-transformers-0.0.1.0
  878. 49.13 s [duoidal-transformers] Executables installed in:
  879. 49.13 s [duoidal-transformers] /nix/store/scmby30dka4njfxm1w6njdavhbdi3dv6-duoidal-transformers-0.0.1.0/bin
  880. 49.13 s [duoidal-transformers] Libraries installed in:
  881. 49.13 s [duoidal-transformers] /nix/store/scmby30dka4njfxm1w6njdavhbdi3dv6-duoidal-transformers-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/duoidal-transformers-0.0.1.0-Hk9hLhwJEJqLsmdo1mSY2N
  882. 49.13 s [duoidal-transformers] Dynamic Libraries installed in:
  883. 49.13 s [duoidal-transformers] /nix/store/scmby30dka4njfxm1w6njdavhbdi3dv6-duoidal-transformers-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3
  884. 49.13 s [duoidal-transformers] Private executables installed in:
  885. 49.13 s [duoidal-transformers] /nix/store/scmby30dka4njfxm1w6njdavhbdi3dv6-duoidal-transformers-0.0.1.0/libexec/x86_64-linux-ghc-9.12.2-82d3/duoidal-transformers-0.0.1.0
  886. 49.13 s [duoidal-transformers] Data files installed in:
  887. 49.13 s [duoidal-transformers] /nix/store/scmby30dka4njfxm1w6njdavhbdi3dv6-duoidal-transformers-0.0.1.0/share/x86_64-linux-ghc-9.12.2-82d3/duoidal-transformers-0.0.1.0
  888. 49.13 s [duoidal-transformers] Documentation installed in:
  889. 49.13 s [duoidal-transformers] /nix/store/v3mp985hqrlllakk3b2c2i0x5r8268dl-duoidal-transformers-0.0.1.0-doc/share/doc/duoidal-transformers-0.0.1.0
  890. 49.13 s [duoidal-transformers] Configuration files installed in:
  891. 49.13 s [duoidal-transformers] /nix/store/scmby30dka4njfxm1w6njdavhbdi3dv6-duoidal-transformers-0.0.1.0/etc
  892. 49.13 s [duoidal-transformers] No alex found
  893. 49.13 s [duoidal-transformers] Using ar found on system at:
  894. 49.13 s [duoidal-transformers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  895. 49.13 s [duoidal-transformers] No c2hs found
  896. 49.13 s [duoidal-transformers] No cpphs found
  897. 49.13 s [duoidal-transformers] Using doctest version 0.24.2 found on system at:
  898. 49.13 s [duoidal-transformers] /nix/store/39gb85lds43f7spl5690pdk8d65fpr5l-doctest-0.24.2/bin/doctest
  899. 49.13 s [duoidal-transformers] Using gcc version 14.3.0 given by user at:
  900. 49.13 s [duoidal-transformers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  901. 49.13 s [duoidal-transformers] Using ghc version 9.12.2 found on system at:
  902. 49.13 s [duoidal-transformers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc
  903. 49.13 s [duoidal-transformers] Using ghc-pkg version 9.12.2 found on system at:
  904. 49.13 s [duoidal-transformers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc-pkg-9.12.2
  905. 49.13 s [duoidal-transformers] No ghcjs found
  906. 49.13 s [duoidal-transformers] No ghcjs-pkg found
  907. 49.13 s [duoidal-transformers] No greencard found
  908. 49.13 s [duoidal-transformers] Using haddock version 2.30.0 found on system at:
  909. 49.13 s [duoidal-transformers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/haddock-ghc-9.12.2
  910. 49.13 s [duoidal-transformers] No happy found
  911. 49.13 s [duoidal-transformers] No haskell-suite found
  912. 49.13 s [duoidal-transformers] No haskell-suite-pkg found
  913. 49.13 s [duoidal-transformers] No hmake found
  914. 49.13 s [duoidal-transformers] Using hpc version 0.69 found on system at:
  915. 49.13 s [duoidal-transformers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hpc-ghc-9.12.2
  916. 49.13 s [duoidal-transformers] Using hsc2hs version 0.68.10 found on system at:
  917. 49.13 s [duoidal-transformers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  918. 49.13 s [duoidal-transformers] Using hscolour version 1.25 found on system at:
  919. 49.13 s [duoidal-transformers] /nix/store/02s9rad0jn6nj8z96k357im73hkzqsnw-hscolour-1.25/bin/HsColour
  920. 49.13 s [duoidal-transformers] No jhc found
  921. 49.13 s [duoidal-transformers] Using ld found on system at:
  922. 49.13 s [duoidal-transformers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  923. 49.13 s [duoidal-transformers] No pkg-config found
  924. 49.13 s [duoidal-transformers] Using runghc version 9.12.2 found on system at:
  925. 49.13 s [duoidal-transformers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/runghc-9.12.2
  926. 49.13 s [duoidal-transformers] Using strip version 2.44 found on system at:
  927. 49.13 s [duoidal-transformers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  928. 49.13 s [duoidal-transformers] Using tar found on system at:
  929. 49.13 s [duoidal-transformers] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  930. 49.13 s [duoidal-transformers] No uhc found
  931. 49.30 s [duoids-hedgehog] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  932. 49.30 s [duoids-hedgehog] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  933. 49.30 s [duoids-hedgehog] <4.23: using base-4.21.0.0
  934. 49.30 s [duoids-hedgehog] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  935. 49.30 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  936. 49.30 s [duoids-hedgehog] Dependency hedgehog >=1.1 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  937. 49.30 s [duoids-hedgehog] hedgehog-1.5
  938. 49.30 s [duoids-hedgehog] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  939. 49.30 s [duoids-hedgehog] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  940. 49.30 s [duoids-hedgehog] <4.23: using base-4.21.0.0
  941. 49.30 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  942. 49.30 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  943. 49.30 s [duoids-hedgehog] Dependency hedgehog >=1.1 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  944. 49.30 s [duoids-hedgehog] hedgehog-1.5
  945. 49.30 s [duoids-hedgehog] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  946. 49.30 s [duoids-hedgehog] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  947. 49.30 s [duoids-hedgehog] <4.23: using base-4.21.0.0
  948. 49.30 s [duoids-hedgehog] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  949. 49.30 s [duoids-hedgehog] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  950. 49.30 s [duoids-hedgehog] doctest-0.24.2
  951. 49.30 s [duoids-hedgehog] Dependency duoids-hedgehog: using duoids-hedgehog-0.0.1.0
  952. 49.30 s [duoids-hedgehog] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  953. 49.30 s [duoids-hedgehog] Source component graph:
  954. 49.30 s [duoids-hedgehog] component lib
  955. 49.30 s [duoids-hedgehog] component test:doctests dependency lib
  956. 49.30 s [duoids-hedgehog] component test:laws dependency lib
  957. 49.30 s [duoids-hedgehog] Configured component graph:
  958. 49.30 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-4PBiwjtwbFHLQ9OHdta2tZ
  959. 49.30 s [duoids-hedgehog] include base-4.21.0.0-b334
  960. 49.30 s [duoids-hedgehog] include duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm
  961. 49.30 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  962. 49.30 s [duoids-hedgehog] include hedgehog-1.5-3LP1um1Ps6qGX0qFDBaPPL
  963. 49.30 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-8OXb4LxNLUQAdkrZwh9F9Z-doctests
  964. 49.30 s [duoids-hedgehog] include base-4.21.0.0-b334
  965. 49.30 s [duoids-hedgehog] include doctest-0.24.2-7dcRhyR7fwsJGtJTyCZo6u
  966. 49.30 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-4PBiwjtwbFHLQ9OHdta2tZ
  967. 49.30 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  968. 49.30 s [duoids-hedgehog] component duoids-hedgehog-0.0.1.0-9cxzkk9jdOg27IslNUQkp5-laws
  969. 49.30 s [duoids-hedgehog] include base-4.21.0.0-b334
  970. 49.30 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-4PBiwjtwbFHLQ9OHdta2tZ
  971. 49.30 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  972. 49.30 s [duoids-hedgehog] include hedgehog-1.5-3LP1um1Ps6qGX0qFDBaPPL
  973. 49.30 s [duoids-hedgehog] Linked component graph:
  974. 49.30 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-4PBiwjtwbFHLQ9OHdta2tZ
  975. 49.30 s [duoids-hedgehog] include base-4.21.0.0-b334
  976. 49.30 s [duoids-hedgehog] include duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm
  977. 49.30 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  978. 49.30 s [duoids-hedgehog] include hedgehog-1.5-3LP1um1Ps6qGX0qFDBaPPL
  979. 49.30 s [duoids-hedgehog] Test.Duoid=duoids-hedgehog-0.0.1.0-4PBiwjtwbFHLQ9OHdta2tZ:Test.Duoid,Test.Duoidal=duoids-hedgehog-0.0.1.0-4PBiwjtwbFHLQ9OHdta2tZ:Test.Duoidal
  980. 49.30 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-8OXb4LxNLUQAdkrZwh9F9Z-doctests
  981. 49.30 s [duoids-hedgehog] include base-4.21.0.0-b334
  982. 49.30 s [duoids-hedgehog] include doctest-0.24.2-7dcRhyR7fwsJGtJTyCZo6u
  983. 49.30 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-4PBiwjtwbFHLQ9OHdta2tZ
  984. 49.30 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  985. 49.30 s [duoids-hedgehog] unit duoids-hedgehog-0.0.1.0-9cxzkk9jdOg27IslNUQkp5-laws
  986. 49.30 s [duoids-hedgehog] include base-4.21.0.0-b334
  987. 49.30 s [duoids-hedgehog] include duoids-hedgehog-0.0.1.0-4PBiwjtwbFHLQ9OHdta2tZ
  988. 49.30 s [duoids-hedgehog] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  989. 49.30 s [duoids-hedgehog] include hedgehog-1.5-3LP1um1Ps6qGX0qFDBaPPL
  990. 49.30 s [duoids-hedgehog] Ready component graph:
  991. 49.30 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-4PBiwjtwbFHLQ9OHdta2tZ
  992. 49.30 s [duoids-hedgehog] depends base-4.21.0.0-b334
  993. 49.30 s [duoids-hedgehog] depends duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm
  994. 49.30 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  995. 49.30 s [duoids-hedgehog] depends hedgehog-1.5-3LP1um1Ps6qGX0qFDBaPPL
  996. 49.30 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-8OXb4LxNLUQAdkrZwh9F9Z-doctests
  997. 49.30 s [duoids-hedgehog] depends base-4.21.0.0-b334
  998. 49.30 s [duoids-hedgehog] depends doctest-0.24.2-7dcRhyR7fwsJGtJTyCZo6u
  999. 49.30 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-4PBiwjtwbFHLQ9OHdta2tZ
  1000. 49.30 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  1001. 49.30 s [duoids-hedgehog] definite duoids-hedgehog-0.0.1.0-9cxzkk9jdOg27IslNUQkp5-laws
  1002. 49.30 s [duoids-hedgehog] depends base-4.21.0.0-b334
  1003. 49.30 s [duoids-hedgehog] depends duoids-hedgehog-0.0.1.0-4PBiwjtwbFHLQ9OHdta2tZ
  1004. 49.30 s [duoids-hedgehog] depends ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  1005. 49.30 s [duoids-hedgehog] depends hedgehog-1.5-3LP1um1Ps6qGX0qFDBaPPL
  1006. 49.30 s [duoids-hedgehog] Using Cabal-3.14.1.0 compiled by ghc-9.12
  1007. 49.30 s [duoids-hedgehog] Using compiler: ghc-9.12.2
  1008. 49.30 s [duoids-hedgehog] Using install prefix:
  1009. 49.30 s [duoids-hedgehog] /nix/store/b23lx4bcxv7k9d65q88921y71rbk250l-duoids-hedgehog-0.0.1.0
  1010. 49.30 s [duoids-hedgehog] Executables installed in:
  1011. 49.30 s [duoids-hedgehog] /nix/store/b23lx4bcxv7k9d65q88921y71rbk250l-duoids-hedgehog-0.0.1.0/bin
  1012. 49.30 s [duoids-hedgehog] Libraries installed in:
  1013. 49.30 s [duoids-hedgehog] /nix/store/b23lx4bcxv7k9d65q88921y71rbk250l-duoids-hedgehog-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/duoids-hedgehog-0.0.1.0-4PBiwjtwbFHLQ9OHdta2tZ
  1014. 49.30 s [duoids-hedgehog] Dynamic Libraries installed in:
  1015. 49.30 s [duoids-hedgehog] /nix/store/b23lx4bcxv7k9d65q88921y71rbk250l-duoids-hedgehog-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3
  1016. 49.30 s [duoids-hedgehog] Private executables installed in:
  1017. 49.30 s [duoids-hedgehog] /nix/store/b23lx4bcxv7k9d65q88921y71rbk250l-duoids-hedgehog-0.0.1.0/libexec/x86_64-linux-ghc-9.12.2-82d3/duoids-hedgehog-0.0.1.0
  1018. 49.30 s [duoids-hedgehog] Data files installed in:
  1019. 49.30 s [duoids-hedgehog] /nix/store/b23lx4bcxv7k9d65q88921y71rbk250l-duoids-hedgehog-0.0.1.0/share/x86_64-linux-ghc-9.12.2-82d3/duoids-hedgehog-0.0.1.0
  1020. 49.30 s [duoids-hedgehog] Documentation installed in:
  1021. 49.30 s [duoids-hedgehog] /nix/store/jd7djwacx5cr6lf90fi0c1d1r8dgg5nw-duoids-hedgehog-0.0.1.0-doc/share/doc/duoids-hedgehog-0.0.1.0
  1022. 49.30 s [duoids-hedgehog] Configuration files installed in:
  1023. 49.30 s [duoids-hedgehog] /nix/store/b23lx4bcxv7k9d65q88921y71rbk250l-duoids-hedgehog-0.0.1.0/etc
  1024. 49.30 s [duoids-hedgehog] No alex found
  1025. 49.30 s [duoids-hedgehog] Using ar found on system at:
  1026. 49.30 s [duoids-hedgehog] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  1027. 49.30 s [duoids-hedgehog] No c2hs found
  1028. 49.30 s [duoids-hedgehog] No cpphs found
  1029. 49.30 s [duoids-hedgehog] Using doctest version 0.24.2 found on system at:
  1030. 49.30 s [duoids-hedgehog] /nix/store/39gb85lds43f7spl5690pdk8d65fpr5l-doctest-0.24.2/bin/doctest
  1031. 49.30 s [duoids-hedgehog] Using gcc version 14.3.0 given by user at:
  1032. 49.30 s [duoids-hedgehog] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  1033. 49.30 s [duoids-hedgehog] Using ghc version 9.12.2 found on system at:
  1034. 49.30 s [duoids-hedgehog] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc
  1035. 49.30 s [duoids-hedgehog] Using ghc-pkg version 9.12.2 found on system at:
  1036. 49.30 s [duoids-hedgehog] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc-pkg-9.12.2
  1037. 49.30 s [duoids-hedgehog] No ghcjs found
  1038. 49.30 s [duoids-hedgehog] No ghcjs-pkg found
  1039. 49.30 s [duoids-hedgehog] No greencard found
  1040. 49.30 s [duoids-hedgehog] Using haddock version 2.30.0 found on system at:
  1041. 49.30 s [duoids-hedgehog] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/haddock-ghc-9.12.2
  1042. 49.30 s [duoids-hedgehog] No happy found
  1043. 49.30 s [duoids-hedgehog] No haskell-suite found
  1044. 49.30 s [duoids-hedgehog] No haskell-suite-pkg found
  1045. 49.30 s [duoids-hedgehog] No hmake found
  1046. 49.30 s [duoids-hedgehog] Using hpc version 0.69 found on system at:
  1047. 49.30 s [duoids-hedgehog] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hpc-ghc-9.12.2
  1048. 49.30 s [duoids-hedgehog] Using hsc2hs version 0.68.10 found on system at:
  1049. 49.30 s [duoids-hedgehog] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  1050. 49.30 s [duoids-hedgehog] Using hscolour version 1.25 found on system at:
  1051. 49.30 s [duoids-hedgehog] /nix/store/02s9rad0jn6nj8z96k357im73hkzqsnw-hscolour-1.25/bin/HsColour
  1052. 49.30 s [duoids-hedgehog] No jhc found
  1053. 49.30 s [duoids-hedgehog] Using ld found on system at:
  1054. 49.30 s [duoids-hedgehog] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  1055. 49.30 s [duoids-hedgehog] No pkg-config found
  1056. 49.30 s [duoids-hedgehog] Using runghc version 9.12.2 found on system at:
  1057. 49.30 s [duoids-hedgehog] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/runghc-9.12.2
  1058. 49.30 s [duoids-hedgehog] Using strip version 2.44 found on system at:
  1059. 49.30 s [duoids-hedgehog] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  1060. 49.30 s [duoids-hedgehog] Using tar found on system at:
  1061. 49.30 s [duoids-hedgehog] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  1062. 49.30 s [duoids-hedgehog] No uhc found
  1063. 49.31 s [duoidal-transformers] Phase: buildPhase
  1064. 49.36 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  1065. 49.36 s [duoidal-transformers] Building library for duoidal-transformers-0.0.1.0...
  1066. 49.45 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 )
  1067. 49.54 s [duoids-hedgehog] Phase: buildPhase
  1068. 49.60 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  1069. 49.60 s [duoids-hedgehog] Building library for duoids-hedgehog-0.0.1.0...
  1070. 49.73 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.o, dist/build/Test/Duoid.dyn_o )
  1071. 49.80 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 )
  1072. 49.85 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 )
  1073. 50.32 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 )
  1074. 50.41 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.o, dist/build/Test/Duoidal.dyn_o )
  1075. 50.49 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 )
  1076. 50.63 s [vector] [ 2 of 23] Compiling Data.Vector.Fusion.Util ( src/Data/Vector/Fusion/Util.hs, dist/build/Data/Vector/Fusion/Util.p_o )
  1077. 50.63 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, dist/build/Test/Duoid.p_o )
  1078. 50.65 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 )
  1079. 50.76 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 )
  1080. 50.91 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 )
  1081. 50.91 s [vector] [ 5 of 23] Compiling Data.Vector.Generic.Base ( src/Data/Vector/Generic/Base.hs, dist/build/Data/Vector/Generic/Base.p_o )
  1082. 50.91 s [vector] [ 6 of 23] Compiling Data.Vector.Internal.Check ( src/Data/Vector/Internal/Check.hs, dist/build/Data/Vector/Internal/Check.p_o )
  1083. 50.91 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 )
  1084. 51.36 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, dist/build/Test/Duoidal.p_o )
  1085. 53.93 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  1086. 54.02 s [duoidal-transformers] Building test suite 'doctests' for duoidal-transformers-0.0.1.0...
  1087. 54.04 s [duoidal-transformers] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  1088. 54.49 s [duoidal-transformers] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  1089. 54.61 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  1090. 54.61 s [duoids-hedgehog] Building test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  1091. 54.73 s [duoids-hedgehog] [1 of 2] Compiling Build_doctests ( dist/build/doctests/autogen/Build_doctests.hs, dist/build/doctests/doctests-tmp/Build_doctests.o )
  1092. 55.14 s [duoidal-transformers] [3 of 3] Linking dist/build/doctests/doctests
  1093. 55.18 s [duoids-hedgehog] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  1094. 55.42 s [vector] [ 8 of 23] Compiling Data.Vector.Fusion.Bundle ( src/Data/Vector/Fusion/Bundle.hs, dist/build/Data/Vector/Fusion/Bundle.p_o )
  1095. 55.85 s [duoids-hedgehog] [3 of 3] Linking dist/build/doctests/doctests
  1096. 58.45 s [vector] [ 9 of 23] Compiling Data.Vector.Generic.Mutable ( src/Data/Vector/Generic/Mutable.hs, dist/build/Data/Vector/Generic/Mutable.p_o )
  1097. 58.69 s [duoidal-transformers] Phase: checkPhase
  1098. 58.93 s [duoidal-transformers] Running 1 test suites...
  1099. 58.93 s [duoidal-transformers] Test suite doctests: RUNNING...
  1100. 59.12 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  1101. 59.16 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1102. 59.16 s [duoidal-transformers]
  1103. 59.16 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  1104. 59.16 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1105. 59.16 s [duoidal-transformers]
  1106. 59.16 s [duoidal-transformers] on the commandline: warning: [GHC-98887]
  1107. 59.16 s [duoidal-transformers] -XTemplateHaskell is not allowed in Safe Haskell; ignoring -XTemplateHaskell
  1108. 59.16 s [duoidal-transformers]
  1109. 59.27 s [duoidal-transformers] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  1110. 59.30 s [duoidal-transformers] NameLib Nothing
  1111. 59.30 s [duoidal-transformers] ----------------------------------------
  1112. 59.31 s [duoidal-transformers] Test suite doctests: PASS
  1113. 59.31 s [duoidal-transformers] Test suite logged to: dist/test/duoidal-transformers-0.0.1.0-doctests.log
  1114. 59.31 s [duoidal-transformers] 1 of 1 test suites (1 of 1 test cases) passed.
  1115. 59.31 s [duoidal-transformers] Phase: haddockPhase
  1116. 59.57 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  1117. 59.57 s [duoids-hedgehog] Building test suite 'laws' for duoids-hedgehog-0.0.1.0...
  1118. 59.68 s [duoids-hedgehog] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  1119. 60.57 s [duoidal-transformers] Preprocessing library for duoidal-transformers-0.0.1.0...
  1120. 60.57 s [duoidal-transformers] Running Haddock on library for duoidal-transformers-0.0.1.0...
  1121. 60.70 s [duoids-hedgehog] [2 of 2] Linking dist/build/laws/laws
  1122. 60.90 s [duoidal-transformers] [1 of 2] Compiling Control.Duoidal.Trans.Class ( src/Control/Duoidal/Trans/Class.hs, nothing ) [HIE file is missing]
  1123. 60.97 s [vector] [10 of 23] Compiling Data.Vector.Generic.New ( src/Data/Vector/Generic/New.hs, dist/build/Data/Vector/Generic/New.p_o )
  1124. 61.24 s [duoidal-transformers] [2 of 2] Compiling Control.Duoidal.Trans.Orphans ( src/Control/Duoidal/Trans/Orphans.hs, nothing ) [HIE file is missing]
  1125. 61.36 s [duoidal-transformers] Haddock coverage:
  1126. 61.36 s [duoidal-transformers] Warning: 'MonadTrans' is out of scope.
  1127. 61.36 s [duoidal-transformers] If you qualify the identifier, haddock can try to link it anyway.
  1128. 61.48 s [vector] [11 of 23] Compiling Data.Vector.Generic ( src/Data/Vector/Generic.hs, dist/build/Data/Vector/Generic.p_o )
  1129. 61.65 s [duoidal-transformers] 100% ( 3 / 3) in 'Control.Duoidal.Trans.Class'
  1130. 61.65 s [duoidal-transformers] 100% ( 1 / 1) in 'Control.Duoidal.Trans.Orphans'
  1131. 61.79 s [duoids-hedgehog] Phase: checkPhase
  1132. 62.10 s [duoids-hedgehog] Running 2 test suites...
  1133. 62.10 s [duoids-hedgehog] Test suite doctests: RUNNING...
  1134. 62.71 s [duoids-hedgehog] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  1135. 62.76 s [duoids-hedgehog] NameLib Nothing
  1136. 62.76 s [duoids-hedgehog] ----------------------------------------
  1137. 62.78 s [duoids-hedgehog] Test suite doctests: PASS
  1138. 62.78 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-doctests.log
  1139. 62.78 s [duoids-hedgehog] Test suite laws: RUNNING...
  1140. 62.78 s [duoids-hedgehog] ━━━ Duoid Int ━━━
  1141. 62.79 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1142. 62.79 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1143. 62.79 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1144. 62.79 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1145. 62.79 s [duoids-hedgehog] ✓ 4 succeeded.
  1146. 62.79 s [duoids-hedgehog] ━━━ Duoid Int16 ━━━
  1147. 62.79 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1148. 62.79 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1149. 62.79 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1150. 62.79 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1151. 62.79 s [duoids-hedgehog] ✓ 4 succeeded.
  1152. 62.79 s [duoids-hedgehog] ━━━ Duoid Int32 ━━━
  1153. 62.79 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1154. 62.79 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1155. 62.79 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1156. 62.79 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1157. 62.79 s [duoids-hedgehog] ✓ 4 succeeded.
  1158. 62.79 s [duoids-hedgehog] ━━━ Duoid Int64 ━━━
  1159. 62.79 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1160. 62.79 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1161. 62.79 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1162. 62.79 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1163. 62.79 s [duoids-hedgehog] ✓ 4 succeeded.
  1164. 62.79 s [duoids-hedgehog] ━━━ Duoid Int8 ━━━
  1165. 62.79 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1166. 62.80 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1167. 62.80 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1168. 62.80 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1169. 62.80 s [duoids-hedgehog] ✓ 4 succeeded.
  1170. 62.80 s [duoids-hedgehog] ━━━ Duoid.Normal Natural ━━━
  1171. 62.80 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1172. 62.80 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1173. 62.80 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1174. 62.80 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1175. 62.80 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1176. 62.80 s [duoids-hedgehog] ✓ 5 succeeded.
  1177. 62.80 s [duoids-hedgehog] ━━━ Duoid.Normal (Ratio Natural) ━━━
  1178. 62.80 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1179. 62.80 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1180. 62.80 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1181. 62.80 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1182. 62.80 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1183. 62.80 s [duoids-hedgehog] ✓ 5 succeeded.
  1184. 62.80 s [duoids-hedgehog] ━━━ Duoid (Ratio Integer) ━━━
  1185. 62.80 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1186. 62.80 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1187. 62.80 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1188. 62.80 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1189. 62.80 s [duoids-hedgehog] ✓ 4 succeeded.
  1190. 62.80 s [duoids-hedgehog] ━━━ Duoid.Normal Word ━━━
  1191. 62.81 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1192. 62.81 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1193. 62.81 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1194. 62.81 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1195. 62.81 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1196. 62.81 s [duoids-hedgehog] ✓ 5 succeeded.
  1197. 62.81 s [duoids-hedgehog] ━━━ Duoid.Normal Word16 ━━━
  1198. 62.81 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1199. 62.81 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1200. 62.81 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1201. 62.81 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1202. 62.81 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1203. 62.81 s [duoids-hedgehog] ✓ 5 succeeded.
  1204. 62.81 s [duoids-hedgehog] ━━━ Duoid.Normal Word32 ━━━
  1205. 62.81 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1206. 62.81 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1207. 62.81 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1208. 62.81 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1209. 62.81 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1210. 62.81 s [duoids-hedgehog] ✓ 5 succeeded.
  1211. 62.81 s [duoids-hedgehog] ━━━ Duoid.Normal Word64 ━━━
  1212. 62.81 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1213. 62.81 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1214. 62.81 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1215. 62.81 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1216. 62.81 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1217. 62.81 s [duoids-hedgehog] ✓ 5 succeeded.
  1218. 62.81 s [duoids-hedgehog] ━━━ Duoid.Normal Word8 ━━━
  1219. 62.81 s [duoids-hedgehog] ✓ unswapUnit passed 100 tests.
  1220. 62.81 s [duoids-hedgehog] ✓ interchange passed 100 tests.
  1221. 62.81 s [duoids-hedgehog] ✓ splitUnit passed 100 tests.
  1222. 62.81 s [duoids-hedgehog] ✓ joinUnit passed 100 tests.
  1223. 62.81 s [duoids-hedgehog] ✓ swapUnit passed 100 tests.
  1224. 62.81 s [duoids-hedgehog] ✓ 5 succeeded.
  1225. 62.81 s [duoids-hedgehog] Test suite laws: PASS
  1226. 62.81 s [duoids-hedgehog] Test suite logged to: dist/test/duoids-hedgehog-0.0.1.0-laws.log
  1227. 62.81 s [duoids-hedgehog] 2 of 2 test suites (2 of 2 test cases) passed.
  1228. 62.82 s [duoids-hedgehog] Phase: haddockPhase
  1229. 64.22 s [duoids-hedgehog] Preprocessing library for duoids-hedgehog-0.0.1.0...
  1230. 64.29 s [duoids-hedgehog] Running Haddock on library for duoids-hedgehog-0.0.1.0...
  1231. 64.58 s [duoids-hedgehog] [1 of 2] Compiling Test.Duoid ( src/Test/Duoid.hs, nothing ) [HIE file is missing]
  1232. 65.16 s [duoids-hedgehog] [2 of 2] Compiling Test.Duoidal ( src/Test/Duoidal.hs, nothing ) [HIE file is missing]
  1233. 65.19 s [duoids-hedgehog] Haddock coverage:
  1234. 65.50 s [duoids-hedgehog] 100% ( 3 / 3) in 'Test.Duoid'
  1235. 65.50 s [duoids-hedgehog] 100% ( 2 / 2) in 'Test.Duoidal'
  1236. 67.90 s [vector] [12 of 23] Compiling Data.Vector.Mutable ( src/Data/Vector/Mutable.hs, dist/build/Data/Vector/Mutable.p_o )
  1237. 67.90 s [vector] src/Data/Vector/Mutable.hs:99:20: warning: [GHC-90584] [-Wderiving-typeable]
  1238. 67.90 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1239. 67.90 s [vector] • In the data declaration for ‘MVector’
  1240. 67.90 s [vector] |
  1241. 67.90 s [vector] 99 | deriving ( Typeable )
  1242. 67.90 s [vector] | ^^^^^^^^
  1243. 67.90 s [vector]
  1244. 67.90 s [vector] [13 of 23] Compiling Data.Vector ( src/Data/Vector.hs, dist/build/Data/Vector.p_o )
  1245. 68.04 s [vector] src/Data/Vector.hs:222:20: warning: [GHC-90584] [-Wderiving-typeable]
  1246. 68.04 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1247. 68.04 s [vector] • In the data declaration for ‘Vector’
  1248. 68.04 s [vector] |
  1249. 68.04 s [vector] 222 | deriving ( Typeable )
  1250. 68.04 s [vector] | ^^^^^^^^
  1251. 68.04 s [vector]
  1252. 70.63 s [duoidal-transformers] Documentation created: dist/doc/html/duoidal-transformers,
  1253. 70.63 s [duoidal-transformers] dist/doc/html/duoidal-transformers/duoidal-transformers.txt
  1254. 72.05 s [duoidal-transformers] Preprocessing test suite 'doctests' for duoidal-transformers-0.0.1.0...
  1255. 72.22 s [duoidal-transformers] Phase: installPhase
  1256. 72.27 s [duoidal-transformers] Installing library in /nix/store/scmby30dka4njfxm1w6njdavhbdi3dv6-duoidal-transformers-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/duoidal-transformers-0.0.1.0-Hk9hLhwJEJqLsmdo1mSY2N
  1257. 72.50 s [duoidal-transformers] Phase: fixupPhase
  1258. 72.52 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/scmby30dka4njfxm1w6njdavhbdi3dv6-duoidal-transformers-0.0.1.0
  1259. 72.52 s [duoidal-transformers] shrinking /nix/store/scmby30dka4njfxm1w6njdavhbdi3dv6-duoidal-transformers-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHSduoidal-transformers-0.0.1.0-Hk9hLhwJEJqLsmdo1mSY2N-ghc9.12.2.so
  1260. 72.53 s [duoidal-transformers] checking for references to /build/ in /nix/store/scmby30dka4njfxm1w6njdavhbdi3dv6-duoidal-transformers-0.0.1.0...
  1261. 72.55 s [duoidal-transformers] patching script interpreter paths in /nix/store/scmby30dka4njfxm1w6njdavhbdi3dv6-duoidal-transformers-0.0.1.0
  1262. 72.55 s [duoidal-transformers] stripping (with command strip and flags -S -p) in /nix/store/scmby30dka4njfxm1w6njdavhbdi3dv6-duoidal-transformers-0.0.1.0/lib
  1263. 72.59 s [duoidal-transformers] shrinking RPATHs of ELF executables and libraries in /nix/store/v3mp985hqrlllakk3b2c2i0x5r8268dl-duoidal-transformers-0.0.1.0-doc
  1264. 72.60 s [duoidal-transformers] checking for references to /build/ in /nix/store/v3mp985hqrlllakk3b2c2i0x5r8268dl-duoidal-transformers-0.0.1.0-doc...
  1265. 72.61 s [duoidal-transformers] patching script interpreter paths in /nix/store/v3mp985hqrlllakk3b2c2i0x5r8268dl-duoidal-transformers-0.0.1.0-doc
  1266. 72.75 s [duoidal-transformers:post-build] Uploading to cachix cache "sellout": /nix/store/scmby30dka4njfxm1w6njdavhbdi3dv6-duoidal-transformers-0.0.1.0 /nix/store/v3mp985hqrlllakk3b2c2i0x5r8268dl-duoidal-transformers-0.0.1.0-doc
  1267. 73.23 s [duoidal-transformers:post-build] Pushing 2 paths (74 are already present) using zstd to cache sellout ⏳
  1268. 73.23 s [duoidal-transformers:post-build]
  1269. 73.60 s [duoidal-transformers:post-build] Pushing /nix/store/v3mp985hqrlllakk3b2c2i0x5r8268dl-duoidal-transformers-0.0.1.0-doc (347.18 KiB)
  1270. 73.69 s [duoidal-transformers:post-build] Pushing /nix/store/scmby30dka4njfxm1w6njdavhbdi3dv6-duoidal-transformers-0.0.1.0 (676.22 KiB)
  1271. 74.72 s [duoidal-transformers:post-build]
  1272. 74.72 s [duoidal-transformers:post-build] All done.
  1273. 74.74 s [duoidal-transformers:post-build] Uploading to the NixCI cache: /nix/store/scmby30dka4njfxm1w6njdavhbdi3dv6-duoidal-transformers-0.0.1.0 /nix/store/v3mp985hqrlllakk3b2c2i0x5r8268dl-duoidal-transformers-0.0.1.0-doc
  1274. 74.79 s [duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1275. 74.80 s [duoidal-transformers:post-build] copying 2 paths...
  1276. 74.81 s [duoidal-transformers:post-build] copying path '/nix/store/v3mp985hqrlllakk3b2c2i0x5r8268dl-duoidal-transformers-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  1277. 75.22 s [duoidal-transformers:post-build] copying path '/nix/store/scmby30dka4njfxm1w6njdavhbdi3dv6-duoidal-transformers-0.0.1.0' to 'https://cache.nix-ci.com'...
  1278. 75.66 s [duoidal-transformers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1279. 75.93 s [duoidal-transformers:post-build] copying 1 paths...
  1280. 75.97 s [duoidal-transformers:post-build] copying path '/nix/store/r4qbh0nx4xdav1brmczrk08kh22icqzb-duoidal-transformers-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  1281. 76.17 s Progress: 2 of 16 built (2 building), 43 of 43 downloaded from cache
  1282. 76.17 s [duoids-hedgehog] Documentation created: dist/doc/html/duoids-hedgehog,
  1283. 76.17 s [duoids-hedgehog] dist/doc/html/duoids-hedgehog/duoids-hedgehog.txt
  1284. 76.17 s [vector] [14 of 23] Compiling Data.Vector.Primitive.Mutable ( src/Data/Vector/Primitive/Mutable.hs, dist/build/Data/Vector/Primitive/Mutable.p_o )
  1285. 76.17 s [vector] src/Data/Vector/Primitive/Mutable.hs:115:20: warning: [GHC-90584] [-Wderiving-typeable]
  1286. 76.17 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1287. 76.17 s [vector] • In the data declaration for ‘MVector’
  1288. 76.17 s [vector] |
  1289. 76.17 s [vector] 115 | deriving ( Typeable )
  1290. 76.17 s [vector] | ^^^^^^^^
  1291. 76.17 s [vector]
  1292. 76.17 s [vector] [15 of 23] Compiling Data.Vector.Primitive ( src/Data/Vector/Primitive.hs, dist/build/Data/Vector/Primitive.p_o )
  1293. 76.17 s [vector] src/Data/Vector/Primitive.hs:209:14: warning: [GHC-90584] [-Wderiving-typeable]
  1294. 76.17 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1295. 76.17 s [vector] • In the data declaration for ‘Vector’
  1296. 76.18 s [vector] |
  1297. 76.18 s [vector] 209 | deriving ( Typeable )
  1298. 76.18 s [vector] | ^^^^^^^^
  1299. 76.18 s [vector]
  1300. 76.18 s [vector] [16 of 23] Compiling Data.Vector.Storable.Internal ( src/Data/Vector/Storable/Internal.hs, dist/build/Data/Vector/Storable/Internal.p_o )
  1301. 76.18 s [vector] [17 of 23] Compiling Data.Vector.Storable.Mutable ( src/Data/Vector/Storable/Mutable.hs, dist/build/Data/Vector/Storable/Mutable.p_o )
  1302. 76.18 s [vector] src/Data/Vector/Storable/Mutable.hs:134:20: warning: [GHC-90584] [-Wderiving-typeable]
  1303. 76.18 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1304. 76.18 s [vector] • In the data declaration for ‘MVector’
  1305. 76.18 s [vector] |
  1306. 76.18 s [vector] 134 | deriving ( Typeable )
  1307. 76.18 s [vector] | ^^^^^^^^
  1308. 76.18 s [vector]
  1309. 76.18 s [vector] [18 of 23] Compiling Data.Vector.Storable ( src/Data/Vector/Storable.hs, dist/build/Data/Vector/Storable.p_o )
  1310. 76.18 s [vector] src/Data/Vector/Storable.hs:219:20: warning: [GHC-90584] [-Wderiving-typeable]
  1311. 76.18 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1312. 76.18 s [vector] • In the data declaration for ‘Vector’
  1313. 76.18 s [vector] |
  1314. 76.18 s [vector] 219 | deriving ( Typeable )
  1315. 76.18 s [vector] | ^^^^^^^^
  1316. 76.18 s [vector]
  1317. 76.18 s [vector] [19 of 23] Compiling Data.Vector.Strict.Mutable ( src/Data/Vector/Strict/Mutable.hs, dist/build/Data/Vector/Strict/Mutable.p_o )
  1318. 76.18 s [vector] src/Data/Vector/Strict/Mutable.hs:97:20: warning: [GHC-90584] [-Wderiving-typeable]
  1319. 76.18 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1320. 76.18 s [vector] • In the newtype declaration for ‘MVector’
  1321. 76.18 s [vector] |
  1322. 76.18 s [vector] 97 | deriving ( Typeable )
  1323. 76.18 s [vector] | ^^^^^^^^
  1324. 76.18 s [vector]
  1325. 76.18 s [vector] [20 of 23] Compiling Data.Vector.Strict ( src/Data/Vector/Strict.hs, dist/build/Data/Vector/Strict.p_o )
  1326. 76.18 s [vector] src/Data/Vector/Strict.hs:221:13: warning: [GHC-90584] [-Wderiving-typeable]
  1327. 76.18 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1328. 76.18 s [vector] • In the newtype declaration for ‘Vector’
  1329. 76.18 s [vector] |
  1330. 76.18 s [vector] 221 | deriving (Typeable, Foldable.Foldable, Semigroup, Monoid)
  1331. 76.18 s [vector] | ^^^^^^^^
  1332. 76.18 s [vector]
  1333. 76.92 s [duoids-hedgehog] Preprocessing test suite 'doctests' for duoids-hedgehog-0.0.1.0...
  1334. 78.31 s [duoids-hedgehog] Preprocessing test suite 'laws' for duoids-hedgehog-0.0.1.0...
  1335. 78.47 s [duoids-hedgehog] Phase: installPhase
  1336. 78.53 s [duoids-hedgehog] Installing library in /nix/store/b23lx4bcxv7k9d65q88921y71rbk250l-duoids-hedgehog-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/duoids-hedgehog-0.0.1.0-4PBiwjtwbFHLQ9OHdta2tZ
  1337. 78.78 s [duoids-hedgehog] Phase: fixupPhase
  1338. 78.80 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/b23lx4bcxv7k9d65q88921y71rbk250l-duoids-hedgehog-0.0.1.0
  1339. 78.80 s [duoids-hedgehog] shrinking /nix/store/b23lx4bcxv7k9d65q88921y71rbk250l-duoids-hedgehog-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHSduoids-hedgehog-0.0.1.0-4PBiwjtwbFHLQ9OHdta2tZ-ghc9.12.2.so
  1340. 78.81 s [duoids-hedgehog] checking for references to /build/ in /nix/store/b23lx4bcxv7k9d65q88921y71rbk250l-duoids-hedgehog-0.0.1.0...
  1341. 78.83 s [duoids-hedgehog] patching script interpreter paths in /nix/store/b23lx4bcxv7k9d65q88921y71rbk250l-duoids-hedgehog-0.0.1.0
  1342. 78.83 s [duoids-hedgehog] stripping (with command strip and flags -S -p) in /nix/store/b23lx4bcxv7k9d65q88921y71rbk250l-duoids-hedgehog-0.0.1.0/lib
  1343. 78.86 s [duoids-hedgehog] shrinking RPATHs of ELF executables and libraries in /nix/store/jd7djwacx5cr6lf90fi0c1d1r8dgg5nw-duoids-hedgehog-0.0.1.0-doc
  1344. 78.87 s [duoids-hedgehog] checking for references to /build/ in /nix/store/jd7djwacx5cr6lf90fi0c1d1r8dgg5nw-duoids-hedgehog-0.0.1.0-doc...
  1345. 78.88 s [duoids-hedgehog] patching script interpreter paths in /nix/store/jd7djwacx5cr6lf90fi0c1d1r8dgg5nw-duoids-hedgehog-0.0.1.0-doc
  1346. 79.02 s [duoids-hedgehog:post-build] Uploading to cachix cache "sellout": /nix/store/b23lx4bcxv7k9d65q88921y71rbk250l-duoids-hedgehog-0.0.1.0 /nix/store/jd7djwacx5cr6lf90fi0c1d1r8dgg5nw-duoids-hedgehog-0.0.1.0-doc
  1347. 79.57 s [duoids-hedgehog:post-build] Pushing 2 paths (136 are already present) using zstd to cache sellout ⏳
  1348. 79.57 s [duoids-hedgehog:post-build]
  1349. 79.97 s [duoids-hedgehog:post-build] Pushing /nix/store/jd7djwacx5cr6lf90fi0c1d1r8dgg5nw-duoids-hedgehog-0.0.1.0-doc (306.13 KiB)
  1350. 80.00 s [duoids-hedgehog:post-build] Pushing /nix/store/b23lx4bcxv7k9d65q88921y71rbk250l-duoids-hedgehog-0.0.1.0 (607.55 KiB)
  1351. 80.99 s [duoids-hedgehog:post-build]
  1352. 80.99 s [duoids-hedgehog:post-build] All done.
  1353. 81.01 s [duoids-hedgehog:post-build] Uploading to the NixCI cache: /nix/store/b23lx4bcxv7k9d65q88921y71rbk250l-duoids-hedgehog-0.0.1.0 /nix/store/jd7djwacx5cr6lf90fi0c1d1r8dgg5nw-duoids-hedgehog-0.0.1.0-doc
  1354. 81.06 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1355. 81.09 s [duoids-hedgehog:post-build] copying 2 paths...
  1356. 81.09 s [duoids-hedgehog:post-build] copying path '/nix/store/jd7djwacx5cr6lf90fi0c1d1r8dgg5nw-duoids-hedgehog-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  1357. 81.46 s [duoids-hedgehog:post-build] copying path '/nix/store/b23lx4bcxv7k9d65q88921y71rbk250l-duoids-hedgehog-0.0.1.0' to 'https://cache.nix-ci.com'...
  1358. 81.89 s [duoids-hedgehog:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  1359. 82.13 s [duoids-hedgehog:post-build] copying 1 paths...
  1360. 82.14 s [duoids-hedgehog:post-build] copying path '/nix/store/7zdasvd6vyppkvgr76ry6yh3qy0k06zv-duoids-hedgehog-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  1361. 83.35 s Progress: 3 of 15 built (1 building), 43 of 43 downloaded from cache
  1362. 83.35 s [vector] [21 of 23] Compiling Data.Vector.Unboxed.Base ( src/Data/Vector/Unboxed/Base.hs, dist/build/Data/Vector/Unboxed/Base.p_o )
  1363. 83.35 s [vector] src/Data/Vector/Unboxed/Base.hs:97:1: warning: [GHC-90584] [-Wderiving-typeable]
  1364. 83.35 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1365. 83.35 s [vector] • In the stand-alone deriving instance for ‘Typeable Vector’
  1366. 83.35 s [vector] |
  1367. 83.35 s [vector] 97 | deriving instance Typeable Vector
  1368. 83.35 s [vector] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  1369. 83.35 s [vector]
  1370. 83.35 s [vector] src/Data/Vector/Unboxed/Base.hs:98:1: warning: [GHC-90584] [-Wderiving-typeable]
  1371. 83.35 s [vector] • Deriving ‘Typeable’ has no effect: all types now auto-derive Typeable
  1372. 83.35 s [vector] • In the stand-alone deriving instance for ‘Typeable MVector’
  1373. 83.35 s [vector] |
  1374. 83.35 s [vector] 98 | deriving instance Typeable MVector
  1375. 83.35 s [vector] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  1376. 83.35 s [vector]
  1377. 83.91 s [vector] [22 of 23] Compiling Data.Vector.Unboxed ( src/Data/Vector/Unboxed.hs, dist/build/Data/Vector/Unboxed.p_o )
  1378. 89.08 s [vector] [23 of 23] Compiling Data.Vector.Unboxed.Mutable ( src/Data/Vector/Unboxed/Mutable.hs, dist/build/Data/Vector/Unboxed/Mutable.p_o )
  1379. 90.35 s [vector] Preprocessing test suite 'vector-tests-O0' for vector-0.13.2.0...
  1380. 90.35 s [vector] Building test suite 'vector-tests-O0' for vector-0.13.2.0...
  1381. 90.44 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 )
  1382. 90.55 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 )
  1383. 91.77 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 )
  1384. 91.77 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  1385. 91.77 s [vector] In the use of ‘tail’
  1386. 91.77 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1387. 91.77 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"."
  1388. 91.77 s [vector] |
  1389. 91.77 s [vector] 244 | postscanl f z = tail . scanl f z
  1390. 91.77 s [vector] | ^^^^
  1391. 91.77 s [vector]
  1392. 91.77 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  1393. 91.77 s [vector] In the use of ‘tail’
  1394. 91.77 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1395. 91.77 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"."
  1396. 91.77 s [vector] |
  1397. 91.77 s [vector] 245 | prescanr f z = tail . scanr f z
  1398. 91.77 s [vector] | ^^^^
  1399. 91.77 s [vector]
  1400. 91.77 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 )
  1401. 91.77 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  1402. 91.77 s [vector] In the use of ‘head’
  1403. 91.77 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1404. 91.77 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"."
  1405. 91.77 s [vector] |
  1406. 91.77 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  1407. 91.77 s [vector] | ^^^^
  1408. 91.77 s [vector]
  1409. 91.77 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  1410. 91.77 s [vector] In the use of ‘head’
  1411. 91.77 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1412. 91.77 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"."
  1413. 91.77 s [vector] |
  1414. 91.77 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  1415. 91.77 s [vector] | ^^^^
  1416. 91.77 s [vector]
  1417. 91.77 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  1418. 91.77 s [vector] In the use of ‘tail’
  1419. 91.77 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1420. 91.77 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"."
  1421. 91.77 s [vector] |
  1422. 91.77 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  1423. 91.77 s [vector] | ^^^^
  1424. 91.77 s [vector]
  1425. 91.77 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  1426. 91.77 s [vector] In the use of ‘head’
  1427. 91.77 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1428. 91.77 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"."
  1429. 91.77 s [vector] |
  1430. 91.77 s [vector] 439 | = V.uniq `eq` (map head . group)
  1431. 91.77 s [vector] | ^^^^
  1432. 91.77 s [vector]
  1433. 92.61 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 )
  1434. 92.73 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 )
  1435. 92.73 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 )
  1436. 92.73 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 )
  1437. 92.73 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 )
  1438. 92.73 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 )
  1439. 92.73 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 )
  1440. 92.73 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  1441. 92.73 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  1442. 92.73 s [vector] |
  1443. 92.73 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  1444. 92.73 s [vector] | ^^^^^^
  1445. 92.73 s [vector]
  1446. 92.73 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  1447. 92.73 s [vector] In the use of ‘head’
  1448. 92.73 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1449. 92.73 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"."
  1450. 92.73 s [vector] |
  1451. 92.73 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  1452. 92.73 s [vector] | ^^^^
  1453. 92.73 s [vector]
  1454. 92.73 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  1455. 92.73 s [vector] In the use of ‘tail’
  1456. 92.73 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1457. 92.73 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"."
  1458. 92.73 s [vector] |
  1459. 92.73 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  1460. 92.73 s [vector] | ^^^^
  1461. 92.73 s [vector]
  1462. 92.73 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 )
  1463. 93.15 s [vector] [13 of 13] Linking dist/build/vector-tests-O0/vector-tests-O0
  1464. 94.10 s [vector] Preprocessing test suite 'vector-doctest' for vector-0.13.2.0...
  1465. 94.17 s [vector] Building test suite 'vector-doctest' for vector-0.13.2.0...
  1466. 94.17 s [vector] [1 of 1] Compiling Main ( tests/doctests.hs, dist/build/vector-doctest/vector-doctest-tmp/Main.o )
  1467. 94.44 s [vector] [2 of 2] Linking dist/build/vector-doctest/vector-doctest
  1468. 97.81 s [vector] Preprocessing test suite 'vector-tests-O2' for vector-0.13.2.0...
  1469. 97.81 s [vector] Building test suite 'vector-tests-O2' for vector-0.13.2.0...
  1470. 97.90 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 )
  1471. 98.03 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 )
  1472. 103.55 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 )
  1473. 103.59 s [vector] tests/Utilities.hs:244:17: warning: [GHC-63394] [-Wx-partial]
  1474. 103.59 s [vector] In the use of ‘tail’
  1475. 103.59 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1476. 103.59 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"."
  1477. 103.59 s [vector] |
  1478. 103.59 s [vector] 244 | postscanl f z = tail . scanl f z
  1479. 103.59 s [vector] | ^^^^
  1480. 103.59 s [vector]
  1481. 103.59 s [vector] tests/Utilities.hs:245:16: warning: [GHC-63394] [-Wx-partial]
  1482. 103.59 s [vector] In the use of ‘tail’
  1483. 103.59 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1484. 103.59 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"."
  1485. 103.59 s [vector] |
  1486. 103.59 s [vector] 245 | prescanr f z = tail . scanr f z
  1487. 103.59 s [vector] | ^^^^
  1488. 103.59 s [vector]
  1489. 103.59 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 )
  1490. 103.59 s [vector] tests/Tests/Vector/Property.hs:243:68: warning: [GHC-63394] [-Wx-partial]
  1491. 103.59 s [vector] In the use of ‘head’
  1492. 103.59 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1493. 103.59 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"."
  1494. 103.59 s [vector] |
  1495. 103.59 s [vector] 243 | prop_head :: P (v a -> a) = not . V.null ===> V.head `eq` head
  1496. 103.59 s [vector] | ^^^^
  1497. 103.59 s [vector]
  1498. 103.59 s [vector] tests/Tests/Vector/Property.hs:256:76: warning: [GHC-63394] [-Wx-partial]
  1499. 103.59 s [vector] In the use of ‘head’
  1500. 103.59 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1501. 103.59 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"."
  1502. 103.59 s [vector] |
  1503. 103.59 s [vector] 256 | prop_unsafeHead :: P (v a -> a) = not . V.null ===> V.unsafeHead `eq` head
  1504. 103.59 s [vector] | ^^^^
  1505. 103.59 s [vector]
  1506. 103.59 s [vector] tests/Tests/Vector/Property.hs:272:65: warning: [GHC-63394] [-Wx-partial]
  1507. 103.59 s [vector] In the use of ‘tail’
  1508. 103.59 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1509. 103.59 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"."
  1510. 103.59 s [vector] |
  1511. 103.59 s [vector] 272 | prop_tail :: P (v a -> v a) = not . V.null ===> V.tail `eq` tail
  1512. 103.59 s [vector] | ^^^^
  1513. 103.59 s [vector]
  1514. 103.59 s [vector] tests/Tests/Vector/Property.hs:439:26: warning: [GHC-63394] [-Wx-partial]
  1515. 103.59 s [vector] In the use of ‘head’
  1516. 103.59 s [vector] (imported from Data.List, but defined in GHC.Internal.List):
  1517. 103.59 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"."
  1518. 103.59 s [vector] |
  1519. 103.59 s [vector] 439 | = V.uniq `eq` (map head . group)
  1520. 103.59 s [vector] | ^^^^
  1521. 103.59 s [vector]
  1522. 109.84 s [vector] [ 5 of 12] Compiling Tests.Vector.Unboxed ( tests/Tests/Vector/Unboxed.hs, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Unboxed.o, dist/build/vector-tests-O2/vector-tests-O2-tmp/Tests/Vector/Unboxed.dyn_o )
  1523. 125.52 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 )
  1524. 125.56 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 )
  1525. 125.56 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 )
  1526. 125.56 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 )
  1527. 125.56 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 )
  1528. 125.56 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 )
  1529. 125.56 s [vector] tests/Tests/Bundle.hs:16:29: warning: [GHC-38856] [-Wunused-imports]
  1530. 125.56 s [vector] The import of ‘foldl'’ from module ‘Data.List’ is redundant
  1531. 125.56 s [vector] |
  1532. 125.56 s [vector] 16 | import Data.List (foldl', foldl1', unfoldr, find, findIndex)
  1533. 125.56 s [vector] | ^^^^^^
  1534. 125.56 s [vector]
  1535. 125.56 s [vector] tests/Tests/Bundle.hs:76:77: warning: [GHC-63394] [-Wx-partial]
  1536. 125.56 s [vector] In the use of ‘head’
  1537. 125.56 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1538. 125.56 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"."
  1539. 125.56 s [vector] |
  1540. 125.56 s [vector] 76 | prop_head :: P (S.Bundle v a -> a) = not . S.null ===> S.head `eq` head
  1541. 125.56 s [vector] | ^^^^
  1542. 125.56 s [vector]
  1543. 125.56 s [vector] tests/Tests/Bundle.hs:92:83: warning: [GHC-63394] [-Wx-partial]
  1544. 125.56 s [vector] In the use of ‘tail’
  1545. 125.56 s [vector] (imported from Prelude, but defined in GHC.Internal.List):
  1546. 125.56 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"."
  1547. 125.56 s [vector] |
  1548. 125.56 s [vector] 92 | prop_tail :: P (S.Bundle v a -> S.Bundle v a) = not . S.null ===> S.tail `eq` tail
  1549. 125.56 s [vector] | ^^^^
  1550. 125.56 s [vector]
  1551. 125.56 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 )
  1552. 126.02 s [vector] [13 of 13] Linking dist/build/vector-tests-O2/vector-tests-O2
  1553. 126.88 s [vector] Preprocessing test suite 'vector-inspection' for vector-0.13.2.0...
  1554. 126.88 s [vector] Building test suite 'vector-inspection' for vector-0.13.2.0...
  1555. 127.00 s [vector] [1 of 4] Compiling Inspect ( tests-inspect/Inspect.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect.o )
  1556. 127.60 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 )
  1557. 127.60 s [vector] [3 of 4] Compiling Inspect.DerivingVia ( tests-inspect/Inspect/DerivingVia.hs, dist/build/vector-inspection/vector-inspection-tmp/Inspect/DerivingVia.o )
  1558. 128.27 s [vector] [4 of 4] Compiling Main ( tests-inspect/main.hs, dist/build/vector-inspection/vector-inspection-tmp/Main.o )
  1559. 128.90 s [vector] [5 of 5] Linking dist/build/vector-inspection/vector-inspection
  1560. 129.67 s [vector] Preprocessing library 'benchmarks-O2' for vector-0.13.2.0...
  1561. 129.67 s [vector] Building library 'benchmarks-O2' for vector-0.13.2.0...
  1562. 129.73 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 )
  1563. 130.70 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 )
  1564. 130.75 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 )
  1565. 130.84 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 )
  1566. 130.84 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 )
  1567. 130.84 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 )
  1568. 130.84 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 )
  1569. 130.84 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 )
  1570. 130.84 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 )
  1571. 130.84 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 )
  1572. 130.84 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 )
  1573. 130.84 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 )
  1574. 130.84 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 )
  1575. 130.84 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 )
  1576. 131.04 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 )
  1577. 132.25 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 )
  1578. 132.26 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 )
  1579. 132.39 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 )
  1580. 132.39 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 )
  1581. 132.39 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 )
  1582. 132.39 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 )
  1583. 132.39 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 )
  1584. 132.39 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 )
  1585. 132.39 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 )
  1586. 132.39 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 )
  1587. 132.39 s [vector] [12 of 14] Compiling Bench.Vector.Tasty ( benchlib/Bench/Vector/Tasty.hs, dist/build/benchmarks-O2/Bench/Vector/Tasty.p_o )
  1588. 132.39 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 )
  1589. 132.39 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 )
  1590. 133.60 s [vector] buildPhase completed in 2 minutes 5 seconds
  1591. 133.60 s [vector] Phase: checkPhase
  1592. 133.82 s [vector] Running 2 test suites...
  1593. 133.82 s [vector] Test suite vector-tests-O0: RUNNING...
  1594. 134.01 s [vector] toplevel
  1595. 134.01 s [vector] Data.Vector.Fusion.Bundle
  1596. 134.01 s [vector] fromList.toList == id: OK
  1597. 134.01 s [vector] +++ OK, passed 100 tests.
  1598. 134.01 s [vector] toList.fromList == id: OK
  1599. 134.02 s [vector] +++ OK, passed 100 tests.
  1600. 134.02 s [vector] eq: OK
  1601. 134.02 s [vector] +++ OK, passed 100 tests.
  1602. 134.02 s [vector] length: OK
  1603. 134.02 s [vector] +++ OK, passed 100 tests.
  1604. 134.02 s [vector] null: OK
  1605. 134.02 s [vector] +++ OK, passed 100 tests.
  1606. 134.02 s [vector] empty: OK
  1607. 134.02 s [vector] +++ OK, passed 100 tests.
  1608. 134.02 s [vector] singleton: OK
  1609. 134.02 s [vector] +++ OK, passed 100 tests.
  1610. 134.02 s [vector] replicate: OK
  1611. 134.02 s [vector] +++ OK, passed 100 tests.
  1612. 134.02 s [vector] cons: OK
  1613. 134.02 s [vector] +++ OK, passed 100 tests.
  1614. 134.02 s [vector] snoc: OK
  1615. 134.02 s [vector] +++ OK, passed 100 tests.
  1616. 134.02 s [vector] append: OK
  1617. 134.02 s [vector] +++ OK, passed 100 tests.
  1618. 134.02 s [vector] head: OK
  1619. 134.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1620. 134.02 s [vector] last: OK
  1621. 134.03 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1622. 134.03 s [vector] index: OK
  1623. 134.03 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1624. 134.03 s [vector] extract: OK
  1625. 134.03 s [vector] +++ OK, passed 100 tests.
  1626. 134.03 s [vector] init: OK
  1627. 134.03 s [vector] +++ OK, passed 100 tests; 12 discarded.
  1628. 134.03 s [vector] tail: OK
  1629. 134.03 s [vector] +++ OK, passed 100 tests; 18 discarded.
  1630. 134.03 s [vector] take: OK
  1631. 134.03 s [vector] +++ OK, passed 100 tests.
  1632. 134.03 s [vector] drop: OK
  1633. 134.03 s [vector] +++ OK, passed 100 tests.
  1634. 134.03 s [vector] map: OK
  1635. 134.03 s [vector] +++ OK, passed 100 tests.
  1636. 134.03 s [vector] zipWith: OK
  1637. 134.03 s [vector] +++ OK, passed 100 tests.
  1638. 134.03 s [vector] zipWith3: OK
  1639. 134.03 s [vector] +++ OK, passed 100 tests.
  1640. 134.03 s [vector] filter: OK
  1641. 134.03 s [vector] +++ OK, passed 100 tests.
  1642. 134.04 s [vector] takeWhile: OK
  1643. 134.04 s [vector] +++ OK, passed 100 tests.
  1644. 134.04 s [vector] dropWhile: OK
  1645. 134.04 s [vector] +++ OK, passed 100 tests.
  1646. 134.04 s [vector] elem: OK
  1647. 134.04 s [vector] +++ OK, passed 100 tests.
  1648. 134.05 s [vector] notElem: OK
  1649. 134.05 s [vector] +++ OK, passed 100 tests.
  1650. 134.05 s [vector] find: OK
  1651. 134.05 s [vector] +++ OK, passed 100 tests.
  1652. 134.05 s [vector] findIndex: OK
  1653. 134.05 s [vector] +++ OK, passed 100 tests.
  1654. 134.05 s [vector] foldl: OK
  1655. 134.05 s [vector] +++ OK, passed 100 tests.
  1656. 134.05 s [vector] foldl1: OK
  1657. 134.05 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1658. 134.05 s [vector] foldl': OK
  1659. 134.05 s [vector] +++ OK, passed 100 tests.
  1660. 134.05 s [vector] foldl1': OK
  1661. 134.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1662. 134.05 s [vector] foldr: OK
  1663. 134.05 s [vector] +++ OK, passed 100 tests.
  1664. 134.05 s [vector] foldr1: OK
  1665. 134.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1666. 134.05 s [vector] prescanl: OK
  1667. 134.05 s [vector] +++ OK, passed 100 tests.
  1668. 134.05 s [vector] prescanl': OK
  1669. 134.05 s [vector] +++ OK, passed 100 tests.
  1670. 134.05 s [vector] postscanl: OK
  1671. 134.05 s [vector] +++ OK, passed 100 tests.
  1672. 134.05 s [vector] postscanl': OK
  1673. 134.05 s [vector] +++ OK, passed 100 tests.
  1674. 134.05 s [vector] scanl: OK
  1675. 134.05 s [vector] +++ OK, passed 100 tests.
  1676. 134.05 s [vector] scanl': OK
  1677. 134.05 s [vector] +++ OK, passed 100 tests.
  1678. 134.05 s [vector] scanl1: OK
  1679. 134.05 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1680. 134.06 s [vector] scanl1': OK
  1681. 134.06 s [vector] +++ OK, passed 100 tests; 19 discarded.
  1682. 134.06 s [vector] concatMap: OK
  1683. 134.06 s [vector] +++ OK, passed 100 tests.
  1684. 134.06 s [vector] unfoldr: OK
  1685. 134.06 s [vector] +++ OK, passed 100 tests.
  1686. 134.06 s [vector] and: OK
  1687. 134.06 s [vector] +++ OK, passed 100 tests.
  1688. 134.06 s [vector] or: OK
  1689. 134.06 s [vector] +++ OK, passed 100 tests.
  1690. 134.06 s [vector] Tests.Vector.Boxed
  1691. 134.06 s [vector] Bool
  1692. 134.06 s [vector] fromList.toList == id: OK
  1693. 134.06 s [vector] +++ OK, passed 100 tests.
  1694. 134.06 s [vector] toList.fromList == id: OK
  1695. 134.06 s [vector] +++ OK, passed 100 tests.
  1696. 134.06 s [vector] unstream.stream == id: OK
  1697. 134.06 s [vector] +++ OK, passed 100 tests.
  1698. 134.06 s [vector] stream.unstream == id: OK
  1699. 134.06 s [vector] +++ OK, passed 100 tests.
  1700. 134.06 s [vector] eq: OK
  1701. 134.06 s [vector] +++ OK, passed 100 tests.
  1702. 134.06 s [vector] length: OK
  1703. 134.06 s [vector] +++ OK, passed 100 tests.
  1704. 134.06 s [vector] null: OK
  1705. 134.06 s [vector] +++ OK, passed 100 tests.
  1706. 134.06 s [vector] index: OK
  1707. 134.06 s [vector] +++ OK, passed 100 tests; 19 discarded.
  1708. 134.06 s [vector] safeIndex: OK
  1709. 134.06 s [vector] +++ OK, passed 100 tests.
  1710. 134.06 s [vector] head: OK
  1711. 134.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  1712. 134.06 s [vector] last: OK
  1713. 134.06 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1714. 134.06 s [vector] unsafeIndex: OK
  1715. 134.06 s [vector] +++ OK, passed 100 tests; 15 discarded.
  1716. 134.06 s [vector] unsafeHead: OK
  1717. 134.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1718. 134.06 s [vector] unsafeLast: OK
  1719. 134.06 s [vector] +++ OK, passed 100 tests; 18 discarded.
  1720. 134.06 s [vector] slice: OK
  1721. 134.06 s [vector] +++ OK, passed 100 tests.
  1722. 134.06 s [vector] init: OK
  1723. 134.06 s [vector] +++ OK, passed 100 tests; 11 discarded.
  1724. 134.06 s [vector] tail: OK
  1725. 134.06 s [vector] +++ OK, passed 100 tests; 21 discarded.
  1726. 134.06 s [vector] take: OK
  1727. 134.06 s [vector] +++ OK, passed 100 tests.
  1728. 134.06 s [vector] drop: OK
  1729. 134.06 s [vector] +++ OK, passed 100 tests.
  1730. 134.06 s [vector] splitAt: OK
  1731. 134.06 s [vector] +++ OK, passed 100 tests.
  1732. 134.06 s [vector] empty: OK
  1733. 134.06 s [vector] +++ OK, passed 100 tests.
  1734. 134.06 s [vector] singleton: OK
  1735. 134.06 s [vector] +++ OK, passed 100 tests.
  1736. 134.06 s [vector] replicate: OK
  1737. 134.06 s [vector] +++ OK, passed 100 tests.
  1738. 134.06 s [vector] generate: OK
  1739. 134.06 s [vector] +++ OK, passed 100 tests.
  1740. 134.06 s [vector] iterateN: OK
  1741. 134.06 s [vector] +++ OK, passed 100 tests.
  1742. 134.06 s [vector] iterateNM: OK (0.04s)
  1743. 134.06 s [vector] +++ OK, passed 100 tests.
  1744. 134.06 s [vector] generateM: OK (0.02s)
  1745. 134.06 s [vector] +++ OK, passed 100 tests.
  1746. 134.06 s [vector] replicateM: OK
  1747. 134.06 s [vector] +++ OK, passed 100 tests.
  1748. 134.06 s [vector] create: OK
  1749. 134.06 s [vector] +++ OK, passed 100 tests.
  1750. 134.06 s [vector] createT: OK
  1751. 134.06 s [vector] +++ OK, passed 100 tests.
  1752. 134.06 s [vector] unfoldr: OK
  1753. 134.06 s [vector] +++ OK, passed 100 tests.
  1754. 134.06 s [vector] unfoldrN: OK
  1755. 134.06 s [vector] +++ OK, passed 100 tests.
  1756. 134.06 s [vector] unfoldrExactN: OK
  1757. 134.06 s [vector] +++ OK, passed 100 tests.
  1758. 134.06 s [vector] unfoldrM: OK
  1759. 134.06 s [vector] +++ OK, passed 100 tests.
  1760. 134.06 s [vector] unfoldrNM: OK
  1761. 134.06 s [vector] +++ OK, passed 100 tests.
  1762. 134.06 s [vector] unfoldrExactNM: OK (0.03s)
  1763. 134.06 s [vector] +++ OK, passed 100 tests.
  1764. 134.06 s [vector] constructN: OK
  1765. 134.06 s [vector] +++ OK, passed 100 tests.
  1766. 134.06 s [vector] constructrN: OK
  1767. 134.06 s [vector] +++ OK, passed 100 tests.
  1768. 134.06 s [vector] cons: OK
  1769. 134.06 s [vector] +++ OK, passed 100 tests.
  1770. 134.06 s [vector] snoc: OK
  1771. 134.06 s [vector] +++ OK, passed 100 tests.
  1772. 134.06 s [vector] append: OK
  1773. 134.06 s [vector] +++ OK, passed 100 tests.
  1774. 134.06 s [vector] concat: OK
  1775. 134.06 s [vector] +++ OK, passed 100 tests.
  1776. 134.06 s [vector] force: OK
  1777. 134.06 s [vector] +++ OK, passed 100 tests.
  1778. 134.06 s [vector] upd: OK
  1779. 134.06 s [vector] +++ OK, passed 100 tests.
  1780. 134.06 s [vector] accum: OK
  1781. 134.06 s [vector] +++ OK, passed 100 tests.
  1782. 134.06 s [vector] reverse: OK
  1783. 134.06 s [vector] +++ OK, passed 100 tests.
  1784. 134.06 s [vector] backpermute: OK
  1785. 134.06 s [vector] +++ OK, passed 100 tests.
  1786. 134.06 s [vector] map: OK
  1787. 134.06 s [vector] +++ OK, passed 100 tests.
  1788. 134.06 s [vector] imap: OK
  1789. 134.06 s [vector] +++ OK, passed 100 tests.
  1790. 134.06 s [vector] concatMap: OK
  1791. 134.06 s [vector] +++ OK, passed 100 tests.
  1792. 134.06 s [vector] mapM: OK
  1793. 134.06 s [vector] +++ OK, passed 100 tests.
  1794. 134.06 s [vector] mapM_: OK (0.01s)
  1795. 134.06 s [vector] +++ OK, passed 100 tests.
  1796. 134.06 s [vector] forM: OK
  1797. 134.06 s [vector] +++ OK, passed 100 tests.
  1798. 134.06 s [vector] forM_: OK
  1799. 134.06 s [vector] +++ OK, passed 100 tests.
  1800. 134.06 s [vector] imapM: OK
  1801. 134.06 s [vector] +++ OK, passed 100 tests.
  1802. 134.06 s [vector] imapM_: OK (0.02s)
  1803. 134.06 s [vector] +++ OK, passed 100 tests.
  1804. 134.06 s [vector] zipWith: OK
  1805. 134.06 s [vector] +++ OK, passed 100 tests.
  1806. 134.07 s [vector] zipWith3: OK
  1807. 134.07 s [vector] +++ OK, passed 100 tests.
  1808. 134.07 s [vector] izipWith: OK
  1809. 134.07 s [vector] +++ OK, passed 100 tests.
  1810. 134.07 s [vector] izipWith3: OK
  1811. 134.07 s [vector] +++ OK, passed 100 tests.
  1812. 134.07 s [vector] izipWithM: OK
  1813. 134.09 s [vector] +++ OK, passed 100 tests.
  1814. 134.09 s [vector] izipWithM_: OK (0.02s)
  1815. 134.09 s [vector] +++ OK, passed 100 tests.
  1816. 134.09 s [vector] zipWithM: OK
  1817. 134.09 s [vector] +++ OK, passed 100 tests.
  1818. 134.10 s [vector] zipWithM_: OK
  1819. 134.10 s [vector] +++ OK, passed 100 tests.
  1820. 134.10 s [vector] filter: OK
  1821. 134.10 s [vector] +++ OK, passed 100 tests.
  1822. 134.11 s [vector] ifilter: OK
  1823. 134.11 s [vector] +++ OK, passed 100 tests.
  1824. 134.12 s [vector] filterM: OK (0.02s)
  1825. 134.12 s [vector] +++ OK, passed 100 tests.
  1826. 134.12 s [vector] uniq: OK
  1827. 134.12 s [vector] +++ OK, passed 100 tests.
  1828. 134.12 s [vector] mapMaybe: OK
  1829. 134.12 s [vector] +++ OK, passed 100 tests.
  1830. 134.12 s [vector] imapMaybe: OK
  1831. 134.12 s [vector] +++ OK, passed 100 tests.
  1832. 134.12 s [vector] takeWhile: OK
  1833. 134.12 s [vector] +++ OK, passed 100 tests.
  1834. 134.13 s [vector] dropWhile: OK
  1835. 134.13 s [vector] +++ OK, passed 100 tests.
  1836. 134.13 s [vector] partition: OK
  1837. 134.13 s [vector] +++ OK, passed 100 tests.
  1838. 134.13 s [vector] partitionWith: OK
  1839. 134.13 s [vector] +++ OK, passed 100 tests.
  1840. 134.13 s [vector] span: OK
  1841. 134.13 s [vector] +++ OK, passed 100 tests.
  1842. 134.13 s [vector] break: OK
  1843. 134.13 s [vector] +++ OK, passed 100 tests.
  1844. 134.13 s [vector] spanR: OK
  1845. 134.13 s [vector] +++ OK, passed 100 tests.
  1846. 134.13 s [vector] breakR: OK
  1847. 134.13 s [vector] +++ OK, passed 100 tests.
  1848. 134.13 s [vector] groupBy: OK
  1849. 134.13 s [vector] +++ OK, passed 100 tests.
  1850. 134.13 s [vector] elem: OK
  1851. 134.13 s [vector] +++ OK, passed 100 tests.
  1852. 134.13 s [vector] notElem: OK
  1853. 134.13 s [vector] +++ OK, passed 100 tests.
  1854. 134.13 s [vector] find: OK
  1855. 134.13 s [vector] +++ OK, passed 100 tests.
  1856. 134.13 s [vector] findIndex: OK
  1857. 134.13 s [vector] +++ OK, passed 100 tests.
  1858. 134.13 s [vector] findIndexR: OK
  1859. 134.13 s [vector] +++ OK, passed 100 tests.
  1860. 134.13 s [vector] findIndices: OK
  1861. 134.13 s [vector] +++ OK, passed 100 tests.
  1862. 134.13 s [vector] elemIndex: OK
  1863. 134.13 s [vector] +++ OK, passed 100 tests.
  1864. 134.13 s [vector] elemIndices: OK
  1865. 134.14 s [vector] +++ OK, passed 100 tests.
  1866. 134.14 s [vector] foldl: OK
  1867. 134.14 s [vector] +++ OK, passed 100 tests.
  1868. 134.14 s [vector] foldl1: OK
  1869. 134.14 s [vector] +++ OK, passed 100 tests; 18 discarded.
  1870. 134.14 s [vector] foldl': OK
  1871. 134.14 s [vector] +++ OK, passed 100 tests.
  1872. 134.14 s [vector] foldl1': OK
  1873. 134.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1874. 134.14 s [vector] foldr: OK
  1875. 134.14 s [vector] +++ OK, passed 100 tests.
  1876. 134.14 s [vector] foldr1: OK
  1877. 134.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1878. 134.15 s [vector] foldr': OK
  1879. 134.15 s [vector] +++ OK, passed 100 tests.
  1880. 134.15 s [vector] foldr1': OK
  1881. 134.15 s [vector] +++ OK, passed 100 tests; 19 discarded.
  1882. 134.15 s [vector] ifoldl: OK
  1883. 134.15 s [vector] +++ OK, passed 100 tests.
  1884. 134.15 s [vector] ifoldl': OK
  1885. 134.15 s [vector] +++ OK, passed 100 tests.
  1886. 134.15 s [vector] ifoldr: OK
  1887. 134.15 s [vector] +++ OK, passed 100 tests.
  1888. 134.15 s [vector] ifoldr': OK
  1889. 134.16 s [vector] +++ OK, passed 100 tests.
  1890. 134.16 s [vector] ifoldM: OK
  1891. 134.17 s [vector] +++ OK, passed 100 tests.
  1892. 134.17 s [vector] ifoldM': OK
  1893. 134.17 s [vector] +++ OK, passed 100 tests.
  1894. 134.19 s [vector] ifoldM_: OK (0.01s)
  1895. 134.19 s [vector] +++ OK, passed 100 tests.
  1896. 134.19 s [vector] ifoldM'_: OK (0.01s)
  1897. 134.19 s [vector] +++ OK, passed 100 tests.
  1898. 134.19 s [vector] all: OK
  1899. 134.19 s [vector] +++ OK, passed 100 tests.
  1900. 134.19 s [vector] any: OK
  1901. 134.19 s [vector] +++ OK, passed 100 tests.
  1902. 134.19 s [vector] prescanl: OK
  1903. 134.19 s [vector] +++ OK, passed 100 tests.
  1904. 134.19 s [vector] prescanl': OK
  1905. 134.19 s [vector] +++ OK, passed 100 tests.
  1906. 134.19 s [vector] postscanl: OK
  1907. 134.19 s [vector] +++ OK, passed 100 tests.
  1908. 134.19 s [vector] postscanl': OK
  1909. 134.19 s [vector] +++ OK, passed 100 tests.
  1910. 134.19 s [vector] scanl: OK
  1911. 134.19 s [vector] +++ OK, passed 100 tests.
  1912. 134.20 s [vector] scanl': OK
  1913. 134.20 s [vector] +++ OK, passed 100 tests.
  1914. 134.20 s [vector] scanl1: OK
  1915. 134.20 s [vector] +++ OK, passed 100 tests.
  1916. 134.20 s [vector] scanl1': OK
  1917. 134.20 s [vector] +++ OK, passed 100 tests.
  1918. 134.20 s [vector] iscanl: OK
  1919. 134.20 s [vector] +++ OK, passed 100 tests.
  1920. 134.20 s [vector] iscanl': OK
  1921. 134.20 s [vector] +++ OK, passed 100 tests.
  1922. 134.20 s [vector] prescanr: OK
  1923. 134.21 s [vector] +++ OK, passed 100 tests.
  1924. 134.21 s [vector] prescanr': OK
  1925. 134.21 s [vector] +++ OK, passed 100 tests.
  1926. 134.21 s [vector] postscanr: OK
  1927. 134.21 s [vector] +++ OK, passed 100 tests.
  1928. 134.21 s [vector] postscanr': OK
  1929. 134.21 s [vector] +++ OK, passed 100 tests.
  1930. 134.21 s [vector] scanr: OK
  1931. 134.21 s [vector] +++ OK, passed 100 tests.
  1932. 134.21 s [vector] scanr': OK
  1933. 134.21 s [vector] +++ OK, passed 100 tests.
  1934. 134.21 s [vector] scanr1: OK
  1935. 134.21 s [vector] +++ OK, passed 100 tests.
  1936. 134.21 s [vector] scanr1': OK
  1937. 134.22 s [vector] +++ OK, passed 100 tests.
  1938. 134.22 s [vector] iscanr: OK
  1939. 134.22 s [vector] +++ OK, passed 100 tests.
  1940. 134.22 s [vector] iscanr': OK
  1941. 134.22 s [vector] +++ OK, passed 100 tests.
  1942. 134.22 s [vector] mut_read: OK
  1943. 134.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  1944. 134.22 s [vector] mut_write: OK
  1945. 134.22 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1946. 134.22 s [vector] mut_modify: OK
  1947. 134.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  1948. 134.22 s [vector] mut_generate: OK
  1949. 134.23 s [vector] +++ OK, passed 100 tests.
  1950. 134.23 s [vector] mut_generateM: OK
  1951. 134.23 s [vector] +++ OK, passed 100 tests.
  1952. 134.25 s [vector] mut_mapM_: OK (0.01s)
  1953. 134.25 s [vector] +++ OK, passed 100 tests.
  1954. 134.25 s [vector] mut_imapM_: OK (0.01s)
  1955. 134.25 s [vector] +++ OK, passed 100 tests.
  1956. 134.27 s [vector] mut_forM_: OK (0.01s)
  1957. 134.27 s [vector] +++ OK, passed 100 tests.
  1958. 134.27 s [vector] mut_iforM_: OK (0.01s)
  1959. 134.27 s [vector] +++ OK, passed 100 tests.
  1960. 134.28 s [vector] mut_foldr: OK
  1961. 134.28 s [vector] +++ OK, passed 100 tests.
  1962. 134.28 s [vector] mut_foldr': OK
  1963. 134.28 s [vector] +++ OK, passed 100 tests.
  1964. 134.28 s [vector] mut_foldl: OK
  1965. 134.28 s [vector] +++ OK, passed 100 tests.
  1966. 134.28 s [vector] mut_foldl': OK
  1967. 134.28 s [vector] +++ OK, passed 100 tests.
  1968. 134.28 s [vector] mut_ifoldr: OK
  1969. 134.28 s [vector] +++ OK, passed 100 tests.
  1970. 134.28 s [vector] mut_ifoldr': OK
  1971. 134.29 s [vector] +++ OK, passed 100 tests.
  1972. 134.29 s [vector] mut_ifoldl: OK
  1973. 134.29 s [vector] +++ OK, passed 100 tests.
  1974. 134.29 s [vector] mut_ifoldl': OK
  1975. 134.29 s [vector] +++ OK, passed 100 tests.
  1976. 134.29 s [vector] mut_foldM: OK
  1977. 134.29 s [vector] +++ OK, passed 100 tests.
  1978. 134.29 s [vector] mut_foldM': OK
  1979. 134.29 s [vector] +++ OK, passed 100 tests.
  1980. 134.29 s [vector] mut_foldrM: OK
  1981. 134.29 s [vector] +++ OK, passed 100 tests.
  1982. 134.29 s [vector] mut_foldrM': OK
  1983. 134.29 s [vector] +++ OK, passed 100 tests.
  1984. 134.30 s [vector] mut_ifoldM: OK
  1985. 134.30 s [vector] +++ OK, passed 100 tests.
  1986. 134.30 s [vector] mut_ifoldM': OK
  1987. 134.30 s [vector] +++ OK, passed 100 tests.
  1988. 134.30 s [vector] mut_ifoldrM: OK
  1989. 134.30 s [vector] +++ OK, passed 100 tests.
  1990. 134.30 s [vector] mut_ifoldrM': OK
  1991. 134.30 s [vector] +++ OK, passed 100 tests.
  1992. 134.30 s [vector] compare: OK
  1993. 134.30 s [vector] +++ OK, passed 100 tests.
  1994. 134.30 s [vector] maximum: OK
  1995. 134.31 s [vector] +++ OK, passed 100 tests; 13 discarded.
  1996. 134.31 s [vector] minimum: OK
  1997. 134.31 s [vector] +++ OK, passed 100 tests; 12 discarded.
  1998. 134.31 s [vector] minIndex: OK
  1999. 134.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2000. 134.31 s [vector] maxIndex: OK
  2001. 134.31 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2002. 134.31 s [vector] maximumBy: OK
  2003. 134.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2004. 134.31 s [vector] minimumBy: OK
  2005. 134.31 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2006. 134.31 s [vector] maximumOn: OK
  2007. 134.31 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2008. 134.31 s [vector] minimumOn: OK
  2009. 134.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2010. 134.31 s [vector] maxIndexBy: OK
  2011. 134.31 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2012. 134.31 s [vector] minIndexBy: OK
  2013. 134.31 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2014. 134.31 s [vector] ListFirstMaxIndexWins: OK
  2015. 134.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2016. 134.31 s [vector] FalseListFirstMaxIndexWins: OK
  2017. 134.31 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  2018. 134.31 s [vector] []
  2019. 134.31 s [vector] zip: OK
  2020. 134.31 s [vector] +++ OK, passed 100 tests.
  2021. 134.31 s [vector] zip3: OK
  2022. 134.31 s [vector] +++ OK, passed 100 tests.
  2023. 134.31 s [vector] unzip: OK
  2024. 134.31 s [vector] +++ OK, passed 100 tests.
  2025. 134.31 s [vector] unzip3: OK
  2026. 134.31 s [vector] +++ OK, passed 100 tests.
  2027. 134.32 s [vector] indexed: OK
  2028. 134.32 s [vector] +++ OK, passed 100 tests.
  2029. 134.32 s [vector] update: OK
  2030. 134.32 s [vector] +++ OK, passed 100 tests.
  2031. 134.32 s [vector] concat: OK
  2032. 134.32 s [vector] +++ OK, passed 100 tests.
  2033. 134.32 s [vector] mempty: OK
  2034. 134.32 s [vector] +++ OK, passed 100 tests.
  2035. 134.32 s [vector] mappend: OK
  2036. 134.33 s [vector] +++ OK, passed 100 tests.
  2037. 134.33 s [vector] mconcat: OK
  2038. 134.33 s [vector] +++ OK, passed 100 tests.
  2039. 134.33 s [vector] fmap: OK
  2040. 134.33 s [vector] +++ OK, passed 100 tests.
  2041. 134.34 s [vector] return: OK
  2042. 134.34 s [vector] +++ OK, passed 100 tests.
  2043. 134.34 s [vector] bind: OK (0.01s)
  2044. 134.34 s [vector] +++ OK, passed 100 tests.
  2045. 134.34 s [vector] mzip: OK
  2046. 134.34 s [vector] +++ OK, passed 100 tests.
  2047. 134.34 s [vector] munzip: OK
  2048. 134.34 s [vector] +++ OK, passed 100 tests.
  2049. 134.35 s [vector] applicative_pure: OK
  2050. 134.35 s [vector] +++ OK, passed 100 tests.
  2051. 134.36 s [vector] applicative_appl: OK (0.02s)
  2052. 134.36 s [vector] +++ OK, passed 100 tests.
  2053. 134.36 s [vector] alternative_empty: OK
  2054. 134.36 s [vector] +++ OK, passed 100 tests.
  2055. 134.37 s [vector] alternative_or: OK
  2056. 134.37 s [vector] +++ OK, passed 100 tests.
  2057. 134.40 s [vector] sequence: OK (0.03s)
  2058. 134.40 s [vector] +++ OK, passed 100 tests.
  2059. 134.40 s [vector] sequence_: OK
  2060. 134.40 s [vector] +++ OK, passed 100 tests.
  2061. 134.40 s [vector] glength: OK
  2062. 134.40 s [vector] +++ OK, passed 100 tests.
  2063. 134.40 s [vector] and: OK
  2064. 134.40 s [vector] +++ OK, passed 100 tests.
  2065. 134.40 s [vector] or: OK
  2066. 134.40 s [vector] +++ OK, passed 100 tests.
  2067. 134.40 s [vector] Int
  2068. 134.40 s [vector] fromList.toList == id: OK
  2069. 134.40 s [vector] +++ OK, passed 100 tests.
  2070. 134.40 s [vector] toList.fromList == id: OK
  2071. 134.40 s [vector] +++ OK, passed 100 tests.
  2072. 134.40 s [vector] unstream.stream == id: OK
  2073. 134.41 s [vector] +++ OK, passed 100 tests.
  2074. 134.41 s [vector] stream.unstream == id: OK
  2075. 134.41 s [vector] +++ OK, passed 100 tests.
  2076. 134.41 s [vector] eq: OK
  2077. 134.41 s [vector] +++ OK, passed 100 tests.
  2078. 134.41 s [vector] length: OK
  2079. 134.41 s [vector] +++ OK, passed 100 tests.
  2080. 134.41 s [vector] null: OK
  2081. 134.41 s [vector] +++ OK, passed 100 tests.
  2082. 134.41 s [vector] index: OK
  2083. 134.41 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2084. 134.41 s [vector] safeIndex: OK
  2085. 134.41 s [vector] +++ OK, passed 100 tests.
  2086. 134.41 s [vector] head: OK
  2087. 134.41 s [vector] +++ OK, passed 100 tests; 11 discarded.
  2088. 134.41 s [vector] last: OK
  2089. 134.41 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2090. 134.41 s [vector] unsafeIndex: OK
  2091. 134.41 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2092. 134.41 s [vector] unsafeHead: OK
  2093. 134.41 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2094. 134.41 s [vector] unsafeLast: OK
  2095. 134.41 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2096. 134.41 s [vector] slice: OK
  2097. 134.41 s [vector] +++ OK, passed 100 tests.
  2098. 134.41 s [vector] init: OK
  2099. 134.41 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2100. 134.41 s [vector] tail: OK
  2101. 134.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2102. 134.41 s [vector] take: OK
  2103. 134.41 s [vector] +++ OK, passed 100 tests.
  2104. 134.41 s [vector] drop: OK
  2105. 134.41 s [vector] +++ OK, passed 100 tests.
  2106. 134.41 s [vector] splitAt: OK
  2107. 134.41 s [vector] +++ OK, passed 100 tests.
  2108. 134.41 s [vector] empty: OK
  2109. 134.41 s [vector] +++ OK, passed 100 tests.
  2110. 134.41 s [vector] singleton: OK
  2111. 134.41 s [vector] +++ OK, passed 100 tests.
  2112. 134.41 s [vector] replicate: OK
  2113. 134.41 s [vector] +++ OK, passed 100 tests.
  2114. 134.41 s [vector] generate: OK
  2115. 134.41 s [vector] +++ OK, passed 100 tests.
  2116. 134.41 s [vector] iterateN: OK
  2117. 134.43 s [vector] +++ OK, passed 100 tests.
  2118. 134.45 s [vector] iterateNM: OK (0.03s)
  2119. 134.45 s [vector] +++ OK, passed 100 tests.
  2120. 134.47 s [vector] generateM: OK (0.01s)
  2121. 134.47 s [vector] +++ OK, passed 100 tests.
  2122. 134.47 s [vector] replicateM: OK
  2123. 134.47 s [vector] +++ OK, passed 100 tests.
  2124. 134.47 s [vector] create: OK
  2125. 134.47 s [vector] +++ OK, passed 100 tests.
  2126. 134.47 s [vector] createT: OK
  2127. 134.47 s [vector] +++ OK, passed 100 tests.
  2128. 134.47 s [vector] unfoldr: OK
  2129. 134.47 s [vector] +++ OK, passed 100 tests.
  2130. 134.47 s [vector] unfoldrN: OK
  2131. 134.47 s [vector] +++ OK, passed 100 tests.
  2132. 134.48 s [vector] unfoldrExactN: OK
  2133. 134.48 s [vector] +++ OK, passed 100 tests.
  2134. 134.48 s [vector] unfoldrM: OK
  2135. 134.48 s [vector] +++ OK, passed 100 tests.
  2136. 134.48 s [vector] unfoldrNM: OK
  2137. 134.49 s [vector] +++ OK, passed 100 tests.
  2138. 134.51 s [vector] unfoldrExactNM: OK (0.03s)
  2139. 134.51 s [vector] +++ OK, passed 100 tests.
  2140. 134.51 s [vector] constructN: OK
  2141. 134.51 s [vector] +++ OK, passed 100 tests.
  2142. 134.51 s [vector] constructrN: OK
  2143. 134.51 s [vector] +++ OK, passed 100 tests.
  2144. 134.51 s [vector] cons: OK
  2145. 134.51 s [vector] +++ OK, passed 100 tests.
  2146. 134.51 s [vector] snoc: OK
  2147. 134.51 s [vector] +++ OK, passed 100 tests.
  2148. 134.51 s [vector] append: OK
  2149. 134.52 s [vector] +++ OK, passed 100 tests.
  2150. 134.52 s [vector] concat: OK (0.01s)
  2151. 134.52 s [vector] +++ OK, passed 100 tests.
  2152. 134.52 s [vector] force: OK
  2153. 134.52 s [vector] +++ OK, passed 100 tests.
  2154. 134.53 s [vector] upd: OK
  2155. 134.53 s [vector] +++ OK, passed 100 tests.
  2156. 134.53 s [vector] accum: OK
  2157. 134.53 s [vector] +++ OK, passed 100 tests.
  2158. 134.53 s [vector] reverse: OK
  2159. 134.53 s [vector] +++ OK, passed 100 tests.
  2160. 134.53 s [vector] backpermute: OK
  2161. 134.53 s [vector] +++ OK, passed 100 tests.
  2162. 134.53 s [vector] map: OK
  2163. 134.53 s [vector] +++ OK, passed 100 tests.
  2164. 134.53 s [vector] imap: OK
  2165. 134.53 s [vector] +++ OK, passed 100 tests.
  2166. 134.53 s [vector] concatMap: OK
  2167. 134.53 s [vector] +++ OK, passed 100 tests.
  2168. 134.55 s [vector] mapM: OK
  2169. 134.55 s [vector] +++ OK, passed 100 tests.
  2170. 134.56 s [vector] mapM_: OK (0.02s)
  2171. 134.56 s [vector] +++ OK, passed 100 tests.
  2172. 134.57 s [vector] forM: OK
  2173. 134.57 s [vector] +++ OK, passed 100 tests.
  2174. 134.57 s [vector] forM_: OK (0.02s)
  2175. 134.59 s [vector] +++ OK, passed 100 tests.
  2176. 134.59 s [vector] imapM: OK
  2177. 134.59 s [vector] +++ OK, passed 100 tests.
  2178. 134.59 s [vector] imapM_: OK (0.02s)
  2179. 134.60 s [vector] +++ OK, passed 100 tests.
  2180. 134.60 s [vector] zipWith: OK
  2181. 134.60 s [vector] +++ OK, passed 100 tests.
  2182. 134.60 s [vector] zipWith3: OK
  2183. 134.60 s [vector] +++ OK, passed 100 tests.
  2184. 134.60 s [vector] izipWith: OK
  2185. 134.61 s [vector] +++ OK, passed 100 tests.
  2186. 134.61 s [vector] izipWith3: OK
  2187. 134.61 s [vector] +++ OK, passed 100 tests.
  2188. 134.61 s [vector] izipWithM: OK
  2189. 134.61 s [vector] +++ OK, passed 100 tests.
  2190. 134.62 s [vector] izipWithM_: OK (0.01s)
  2191. 134.62 s [vector] +++ OK, passed 100 tests.
  2192. 134.62 s [vector] zipWithM: OK
  2193. 134.63 s [vector] +++ OK, passed 100 tests.
  2194. 134.63 s [vector] zipWithM_: OK (0.01s)
  2195. 134.63 s [vector] +++ OK, passed 100 tests.
  2196. 134.63 s [vector] filter: OK
  2197. 134.63 s [vector] +++ OK, passed 100 tests.
  2198. 134.63 s [vector] ifilter: OK
  2199. 134.65 s [vector] +++ OK, passed 100 tests.
  2200. 134.66 s [vector] filterM: OK (0.02s)
  2201. 134.66 s [vector] +++ OK, passed 100 tests.
  2202. 134.66 s [vector] uniq: OK
  2203. 134.66 s [vector] +++ OK, passed 100 tests.
  2204. 134.66 s [vector] mapMaybe: OK
  2205. 134.66 s [vector] +++ OK, passed 100 tests.
  2206. 134.66 s [vector] imapMaybe: OK
  2207. 134.66 s [vector] +++ OK, passed 100 tests.
  2208. 134.66 s [vector] takeWhile: OK
  2209. 134.66 s [vector] +++ OK, passed 100 tests.
  2210. 134.67 s [vector] dropWhile: OK
  2211. 134.67 s [vector] +++ OK, passed 100 tests.
  2212. 134.67 s [vector] partition: OK
  2213. 134.67 s [vector] +++ OK, passed 100 tests.
  2214. 134.67 s [vector] partitionWith: OK
  2215. 134.67 s [vector] +++ OK, passed 100 tests.
  2216. 134.67 s [vector] span: OK
  2217. 134.67 s [vector] +++ OK, passed 100 tests.
  2218. 134.67 s [vector] break: OK
  2219. 134.67 s [vector] +++ OK, passed 100 tests.
  2220. 134.67 s [vector] spanR: OK
  2221. 134.67 s [vector] +++ OK, passed 100 tests.
  2222. 134.67 s [vector] breakR: OK
  2223. 134.67 s [vector] +++ OK, passed 100 tests.
  2224. 134.67 s [vector] groupBy: OK
  2225. 134.67 s [vector] +++ OK, passed 100 tests.
  2226. 134.67 s [vector] elem: OK
  2227. 134.67 s [vector] +++ OK, passed 100 tests.
  2228. 134.67 s [vector] notElem: OK
  2229. 134.67 s [vector] +++ OK, passed 100 tests.
  2230. 134.67 s [vector] find: OK
  2231. 134.67 s [vector] +++ OK, passed 100 tests.
  2232. 134.67 s [vector] findIndex: OK
  2233. 134.67 s [vector] +++ OK, passed 100 tests.
  2234. 134.67 s [vector] findIndexR: OK
  2235. 134.67 s [vector] +++ OK, passed 100 tests.
  2236. 134.67 s [vector] findIndices: OK
  2237. 134.67 s [vector] +++ OK, passed 100 tests.
  2238. 134.68 s [vector] elemIndex: OK
  2239. 134.68 s [vector] +++ OK, passed 100 tests.
  2240. 134.68 s [vector] elemIndices: OK
  2241. 134.68 s [vector] +++ OK, passed 100 tests.
  2242. 134.68 s [vector] foldl: OK
  2243. 134.68 s [vector] +++ OK, passed 100 tests.
  2244. 134.68 s [vector] foldl1: OK
  2245. 134.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2246. 134.68 s [vector] foldl': OK
  2247. 134.68 s [vector] +++ OK, passed 100 tests.
  2248. 134.69 s [vector] foldl1': OK
  2249. 134.69 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2250. 134.69 s [vector] foldr: OK
  2251. 134.69 s [vector] +++ OK, passed 100 tests.
  2252. 134.69 s [vector] foldr1: OK
  2253. 134.69 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2254. 134.69 s [vector] foldr': OK
  2255. 134.69 s [vector] +++ OK, passed 100 tests.
  2256. 134.70 s [vector] foldr1': OK
  2257. 134.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2258. 134.70 s [vector] ifoldl: OK
  2259. 134.70 s [vector] +++ OK, passed 100 tests.
  2260. 134.70 s [vector] ifoldl': OK
  2261. 134.70 s [vector] +++ OK, passed 100 tests.
  2262. 134.71 s [vector] ifoldr: OK
  2263. 134.71 s [vector] +++ OK, passed 100 tests.
  2264. 134.71 s [vector] ifoldr': OK
  2265. 134.71 s [vector] +++ OK, passed 100 tests.
  2266. 134.71 s [vector] ifoldM: OK
  2267. 134.71 s [vector] +++ OK, passed 100 tests.
  2268. 134.71 s [vector] ifoldM': OK
  2269. 134.71 s [vector] +++ OK, passed 100 tests.
  2270. 134.73 s [vector] ifoldM_: OK
  2271. 134.73 s [vector] +++ OK, passed 100 tests.
  2272. 134.75 s [vector] ifoldM'_: OK
  2273. 134.75 s [vector] +++ OK, passed 100 tests.
  2274. 134.75 s [vector] all: OK
  2275. 134.75 s [vector] +++ OK, passed 100 tests.
  2276. 134.75 s [vector] any: OK
  2277. 134.75 s [vector] +++ OK, passed 100 tests.
  2278. 134.75 s [vector] prescanl: OK
  2279. 134.75 s [vector] +++ OK, passed 100 tests.
  2280. 134.76 s [vector] prescanl': OK
  2281. 134.76 s [vector] +++ OK, passed 100 tests.
  2282. 134.76 s [vector] postscanl: OK
  2283. 134.76 s [vector] +++ OK, passed 100 tests.
  2284. 134.76 s [vector] postscanl': OK
  2285. 134.76 s [vector] +++ OK, passed 100 tests.
  2286. 134.76 s [vector] scanl: OK
  2287. 134.76 s [vector] +++ OK, passed 100 tests.
  2288. 134.76 s [vector] scanl': OK
  2289. 134.77 s [vector] +++ OK, passed 100 tests.
  2290. 134.77 s [vector] scanl1: OK
  2291. 134.77 s [vector] +++ OK, passed 100 tests.
  2292. 134.77 s [vector] scanl1': OK
  2293. 134.77 s [vector] +++ OK, passed 100 tests.
  2294. 134.77 s [vector] iscanl: OK
  2295. 134.77 s [vector] +++ OK, passed 100 tests.
  2296. 134.78 s [vector] iscanl': OK
  2297. 134.78 s [vector] +++ OK, passed 100 tests.
  2298. 134.78 s [vector] prescanr: OK
  2299. 134.78 s [vector] +++ OK, passed 100 tests.
  2300. 134.78 s [vector] prescanr': OK
  2301. 134.78 s [vector] +++ OK, passed 100 tests.
  2302. 134.78 s [vector] postscanr: OK
  2303. 134.79 s [vector] +++ OK, passed 100 tests.
  2304. 134.79 s [vector] postscanr': OK
  2305. 134.79 s [vector] +++ OK, passed 100 tests.
  2306. 134.79 s [vector] scanr: OK
  2307. 134.79 s [vector] +++ OK, passed 100 tests.
  2308. 134.79 s [vector] scanr': OK
  2309. 134.79 s [vector] +++ OK, passed 100 tests.
  2310. 134.79 s [vector] scanr1: OK
  2311. 134.80 s [vector] +++ OK, passed 100 tests.
  2312. 134.80 s [vector] scanr1': OK
  2313. 134.80 s [vector] +++ OK, passed 100 tests.
  2314. 134.80 s [vector] iscanr: OK
  2315. 134.80 s [vector] +++ OK, passed 100 tests.
  2316. 134.80 s [vector] iscanr': OK
  2317. 134.80 s [vector] +++ OK, passed 100 tests.
  2318. 134.80 s [vector] mut_read: OK
  2319. 134.80 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2320. 134.80 s [vector] mut_write: OK
  2321. 134.80 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2322. 134.80 s [vector] mut_modify: OK
  2323. 134.80 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2324. 134.81 s [vector] mut_generate: OK
  2325. 134.81 s [vector] +++ OK, passed 100 tests.
  2326. 134.83 s [vector] mut_generateM: OK (0.01s)
  2327. 134.83 s [vector] +++ OK, passed 100 tests.
  2328. 134.85 s [vector] mut_mapM_: OK (0.01s)
  2329. 134.85 s [vector] +++ OK, passed 100 tests.
  2330. 134.87 s [vector] mut_imapM_: OK (0.02s)
  2331. 134.87 s [vector] +++ OK, passed 100 tests.
  2332. 134.87 s [vector] mut_forM_: OK (0.02s)
  2333. 134.87 s [vector] +++ OK, passed 100 tests.
  2334. 134.89 s [vector] mut_iforM_: OK (0.02s)
  2335. 134.89 s [vector] +++ OK, passed 100 tests.
  2336. 134.89 s [vector] mut_foldr: OK
  2337. 134.89 s [vector] +++ OK, passed 100 tests.
  2338. 134.89 s [vector] mut_foldr': OK
  2339. 134.89 s [vector] +++ OK, passed 100 tests.
  2340. 134.89 s [vector] mut_foldl: OK
  2341. 134.89 s [vector] +++ OK, passed 100 tests.
  2342. 134.90 s [vector] mut_foldl': OK
  2343. 134.90 s [vector] +++ OK, passed 100 tests.
  2344. 134.90 s [vector] mut_ifoldr: OK
  2345. 134.90 s [vector] +++ OK, passed 100 tests.
  2346. 134.91 s [vector] mut_ifoldr': OK
  2347. 134.91 s [vector] +++ OK, passed 100 tests.
  2348. 134.91 s [vector] mut_ifoldl: OK
  2349. 134.91 s [vector] +++ OK, passed 100 tests.
  2350. 134.91 s [vector] mut_ifoldl': OK
  2351. 134.91 s [vector] +++ OK, passed 100 tests.
  2352. 134.91 s [vector] mut_foldM: OK
  2353. 134.91 s [vector] +++ OK, passed 100 tests.
  2354. 134.91 s [vector] mut_foldM': OK
  2355. 134.91 s [vector] +++ OK, passed 100 tests.
  2356. 134.92 s [vector] mut_foldrM: OK
  2357. 134.92 s [vector] +++ OK, passed 100 tests.
  2358. 134.92 s [vector] mut_foldrM': OK
  2359. 134.92 s [vector] +++ OK, passed 100 tests.
  2360. 134.92 s [vector] mut_ifoldM: OK
  2361. 134.93 s [vector] +++ OK, passed 100 tests.
  2362. 134.93 s [vector] mut_ifoldM': OK
  2363. 134.93 s [vector] +++ OK, passed 100 tests.
  2364. 134.93 s [vector] mut_ifoldrM: OK
  2365. 134.93 s [vector] +++ OK, passed 100 tests.
  2366. 134.93 s [vector] mut_ifoldrM': OK
  2367. 134.93 s [vector] +++ OK, passed 100 tests.
  2368. 134.93 s [vector] compare: OK
  2369. 134.93 s [vector] +++ OK, passed 100 tests.
  2370. 134.93 s [vector] maximum: OK
  2371. 134.93 s [vector] +++ OK, passed 100 tests; 19 discarded.
  2372. 134.94 s [vector] minimum: OK
  2373. 134.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2374. 134.94 s [vector] minIndex: OK
  2375. 134.94 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2376. 134.94 s [vector] maxIndex: OK
  2377. 134.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2378. 134.94 s [vector] maximumBy: OK
  2379. 134.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2380. 134.94 s [vector] minimumBy: OK
  2381. 134.94 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2382. 134.94 s [vector] maximumOn: OK
  2383. 134.94 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2384. 134.94 s [vector] minimumOn: OK
  2385. 134.94 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2386. 134.94 s [vector] maxIndexBy: OK
  2387. 134.94 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2388. 134.94 s [vector] minIndexBy: OK
  2389. 134.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2390. 134.94 s [vector] ListFirstMaxIndexWins: OK
  2391. 134.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2392. 134.94 s [vector] FalseListFirstMaxIndexWins: OK
  2393. 134.94 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  2394. 134.94 s [vector] []
  2395. 134.94 s [vector] zip: OK
  2396. 134.94 s [vector] +++ OK, passed 100 tests.
  2397. 134.94 s [vector] zip3: OK
  2398. 134.94 s [vector] +++ OK, passed 100 tests.
  2399. 134.94 s [vector] unzip: OK
  2400. 134.94 s [vector] +++ OK, passed 100 tests.
  2401. 134.95 s [vector] unzip3: OK
  2402. 134.95 s [vector] +++ OK, passed 100 tests.
  2403. 134.95 s [vector] indexed: OK
  2404. 134.95 s [vector] +++ OK, passed 100 tests.
  2405. 134.95 s [vector] update: OK
  2406. 134.95 s [vector] +++ OK, passed 100 tests.
  2407. 134.96 s [vector] concat: OK (0.01s)
  2408. 134.96 s [vector] +++ OK, passed 100 tests.
  2409. 134.96 s [vector] mempty: OK
  2410. 134.96 s [vector] +++ OK, passed 100 tests.
  2411. 134.96 s [vector] mappend: OK
  2412. 134.96 s [vector] +++ OK, passed 100 tests.
  2413. 134.97 s [vector] mconcat: OK (0.01s)
  2414. 134.97 s [vector] +++ OK, passed 100 tests.
  2415. 134.97 s [vector] fmap: OK
  2416. 134.97 s [vector] +++ OK, passed 100 tests.
  2417. 134.99 s [vector] return: OK
  2418. 134.99 s [vector] +++ OK, passed 100 tests.
  2419. 134.99 s [vector] bind: OK (0.02s)
  2420. 134.99 s [vector] +++ OK, passed 100 tests.
  2421. 134.99 s [vector] mzip: OK
  2422. 134.99 s [vector] +++ OK, passed 100 tests.
  2423. 134.99 s [vector] munzip: OK
  2424. 134.99 s [vector] +++ OK, passed 100 tests.
  2425. 134.99 s [vector] applicative_pure: OK
  2426. 134.99 s [vector] +++ OK, passed 100 tests.
  2427. 135.02 s [vector] applicative_appl: OK (0.03s)
  2428. 135.02 s [vector] +++ OK, passed 100 tests.
  2429. 135.03 s [vector] alternative_empty: OK
  2430. 135.03 s [vector] +++ OK, passed 100 tests.
  2431. 135.03 s [vector] alternative_or: OK
  2432. 135.03 s [vector] +++ OK, passed 100 tests.
  2433. 135.05 s [vector] sequence: OK (0.02s)
  2434. 135.05 s [vector] +++ OK, passed 100 tests.
  2435. 135.06 s [vector] sequence_: OK (0.01s)
  2436. 135.06 s [vector] +++ OK, passed 100 tests.
  2437. 135.06 s [vector] glength: OK
  2438. 135.06 s [vector] +++ OK, passed 100 tests.
  2439. 135.06 s [vector] sum: OK
  2440. 135.06 s [vector] +++ OK, passed 100 tests.
  2441. 135.06 s [vector] product: OK
  2442. 135.06 s [vector] +++ OK, passed 100 tests.
  2443. 135.06 s [vector] enumFromN: OK
  2444. 135.06 s [vector] +++ OK, passed 100 tests.
  2445. 135.06 s [vector] enumFromThenN: OK
  2446. 135.06 s [vector] +++ OK, passed 100 tests.
  2447. 135.06 s [vector] enumFromTo: OK
  2448. 135.06 s [vector] +++ OK, passed 100 tests.
  2449. 135.06 s [vector] enumFromThenTo: OK
  2450. 135.07 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2451. 135.07 s [vector] unstream
  2452. 135.07 s [vector] unstream == vunstream (exact): OK
  2453. 135.07 s [vector] +++ OK, passed 100 tests.
  2454. 135.07 s [vector] unstream == vunstream (unknown): OK
  2455. 135.07 s [vector] +++ OK, passed 100 tests.
  2456. 135.07 s [vector] unstreamR ~= vunstream (exact): OK
  2457. 135.07 s [vector] +++ OK, passed 100 tests.
  2458. 135.07 s [vector] unstreamR ~= vunstream (unknown): OK
  2459. 135.07 s [vector] +++ OK, passed 100 tests.
  2460. 135.07 s [vector] Tests.Vector.Primitive
  2461. 135.07 s [vector] Int
  2462. 135.07 s [vector] fromList.toList == id: OK
  2463. 135.07 s [vector] +++ OK, passed 100 tests.
  2464. 135.07 s [vector] toList.fromList == id: OK
  2465. 135.07 s [vector] +++ OK, passed 100 tests.
  2466. 135.07 s [vector] unstream.stream == id: OK
  2467. 135.07 s [vector] +++ OK, passed 100 tests.
  2468. 135.07 s [vector] stream.unstream == id: OK
  2469. 135.07 s [vector] +++ OK, passed 100 tests.
  2470. 135.07 s [vector] eq: OK
  2471. 135.07 s [vector] +++ OK, passed 100 tests.
  2472. 135.07 s [vector] length: OK
  2473. 135.07 s [vector] +++ OK, passed 100 tests.
  2474. 135.07 s [vector] null: OK
  2475. 135.07 s [vector] +++ OK, passed 100 tests.
  2476. 135.07 s [vector] index: OK
  2477. 135.07 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2478. 135.07 s [vector] safeIndex: OK
  2479. 135.07 s [vector] +++ OK, passed 100 tests.
  2480. 135.08 s [vector] head: OK
  2481. 135.08 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2482. 135.08 s [vector] last: OK
  2483. 135.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2484. 135.08 s [vector] unsafeIndex: OK
  2485. 135.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2486. 135.08 s [vector] unsafeHead: OK
  2487. 135.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2488. 135.08 s [vector] unsafeLast: OK
  2489. 135.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2490. 135.08 s [vector] slice: OK
  2491. 135.08 s [vector] +++ OK, passed 100 tests.
  2492. 135.08 s [vector] init: OK
  2493. 135.08 s [vector] +++ OK, passed 100 tests; 11 discarded.
  2494. 135.08 s [vector] tail: OK
  2495. 135.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2496. 135.08 s [vector] take: OK
  2497. 135.08 s [vector] +++ OK, passed 100 tests.
  2498. 135.08 s [vector] drop: OK
  2499. 135.08 s [vector] +++ OK, passed 100 tests.
  2500. 135.08 s [vector] splitAt: OK
  2501. 135.08 s [vector] +++ OK, passed 100 tests.
  2502. 135.08 s [vector] empty: OK
  2503. 135.08 s [vector] +++ OK, passed 100 tests.
  2504. 135.08 s [vector] singleton: OK
  2505. 135.08 s [vector] +++ OK, passed 100 tests.
  2506. 135.08 s [vector] replicate: OK
  2507. 135.08 s [vector] +++ OK, passed 100 tests.
  2508. 135.08 s [vector] generate: OK
  2509. 135.08 s [vector] +++ OK, passed 100 tests.
  2510. 135.09 s [vector] iterateN: OK
  2511. 135.09 s [vector] +++ OK, passed 100 tests.
  2512. 135.13 s [vector] iterateNM: OK (0.04s)
  2513. 135.13 s [vector] +++ OK, passed 100 tests.
  2514. 135.15 s [vector] generateM: OK (0.02s)
  2515. 135.15 s [vector] +++ OK, passed 100 tests.
  2516. 135.15 s [vector] replicateM: OK
  2517. 135.15 s [vector] +++ OK, passed 100 tests.
  2518. 135.15 s [vector] create: OK
  2519. 135.15 s [vector] +++ OK, passed 100 tests.
  2520. 135.15 s [vector] createT: OK
  2521. 135.15 s [vector] +++ OK, passed 100 tests.
  2522. 135.15 s [vector] unfoldr: OK
  2523. 135.15 s [vector] +++ OK, passed 100 tests.
  2524. 135.15 s [vector] unfoldrN: OK
  2525. 135.15 s [vector] +++ OK, passed 100 tests.
  2526. 135.15 s [vector] unfoldrExactN: OK
  2527. 135.16 s [vector] +++ OK, passed 100 tests.
  2528. 135.16 s [vector] unfoldrM: OK
  2529. 135.16 s [vector] +++ OK, passed 100 tests.
  2530. 135.17 s [vector] unfoldrNM: OK
  2531. 135.17 s [vector] +++ OK, passed 100 tests.
  2532. 135.20 s [vector] unfoldrExactNM: OK (0.03s)
  2533. 135.20 s [vector] +++ OK, passed 100 tests.
  2534. 135.20 s [vector] constructN: OK
  2535. 135.20 s [vector] +++ OK, passed 100 tests.
  2536. 135.20 s [vector] constructrN: OK
  2537. 135.20 s [vector] +++ OK, passed 100 tests.
  2538. 135.20 s [vector] cons: OK
  2539. 135.20 s [vector] +++ OK, passed 100 tests.
  2540. 135.21 s [vector] snoc: OK
  2541. 135.21 s [vector] +++ OK, passed 100 tests.
  2542. 135.21 s [vector] append: OK
  2543. 135.21 s [vector] +++ OK, passed 100 tests.
  2544. 135.22 s [vector] concat: OK (0.01s)
  2545. 135.22 s [vector] +++ OK, passed 100 tests.
  2546. 135.22 s [vector] force: OK
  2547. 135.22 s [vector] +++ OK, passed 100 tests.
  2548. 135.23 s [vector] upd: OK
  2549. 135.23 s [vector] +++ OK, passed 100 tests.
  2550. 135.23 s [vector] accum: OK
  2551. 135.23 s [vector] +++ OK, passed 100 tests.
  2552. 135.23 s [vector] reverse: OK
  2553. 135.23 s [vector] +++ OK, passed 100 tests.
  2554. 135.23 s [vector] backpermute: OK
  2555. 135.23 s [vector] +++ OK, passed 100 tests.
  2556. 135.23 s [vector] map: OK
  2557. 135.23 s [vector] +++ OK, passed 100 tests.
  2558. 135.24 s [vector] imap: OK
  2559. 135.24 s [vector] +++ OK, passed 100 tests.
  2560. 135.24 s [vector] concatMap: OK
  2561. 135.24 s [vector] +++ OK, passed 100 tests.
  2562. 135.24 s [vector] mapM: OK
  2563. 135.25 s [vector] +++ OK, passed 100 tests.
  2564. 135.26 s [vector] mapM_: OK (0.02s)
  2565. 135.27 s [vector] +++ OK, passed 100 tests.
  2566. 135.27 s [vector] forM: OK
  2567. 135.27 s [vector] +++ OK, passed 100 tests.
  2568. 135.27 s [vector] forM_: OK (0.01s)
  2569. 135.27 s [vector] +++ OK, passed 100 tests.
  2570. 135.27 s [vector] imapM: OK
  2571. 135.27 s [vector] +++ OK, passed 100 tests.
  2572. 135.30 s [vector] imapM_: OK
  2573. 135.30 s [vector] +++ OK, passed 100 tests.
  2574. 135.30 s [vector] zipWith: OK
  2575. 135.30 s [vector] +++ OK, passed 100 tests.
  2576. 135.30 s [vector] zipWith3: OK
  2577. 135.30 s [vector] +++ OK, passed 100 tests.
  2578. 135.30 s [vector] izipWith: OK
  2579. 135.30 s [vector] +++ OK, passed 100 tests.
  2580. 135.30 s [vector] izipWith3: OK
  2581. 135.30 s [vector] +++ OK, passed 100 tests.
  2582. 135.31 s [vector] izipWithM: OK
  2583. 135.31 s [vector] +++ OK, passed 100 tests.
  2584. 135.32 s [vector] izipWithM_: OK (0.01s)
  2585. 135.32 s [vector] +++ OK, passed 100 tests.
  2586. 135.33 s [vector] zipWithM: OK
  2587. 135.33 s [vector] +++ OK, passed 100 tests.
  2588. 135.34 s [vector] zipWithM_: OK (0.01s)
  2589. 135.34 s [vector] +++ OK, passed 100 tests.
  2590. 135.34 s [vector] filter: OK
  2591. 135.34 s [vector] +++ OK, passed 100 tests.
  2592. 135.35 s [vector] ifilter: OK
  2593. 135.35 s [vector] +++ OK, passed 100 tests.
  2594. 135.36 s [vector] filterM: OK (0.02s)
  2595. 135.36 s [vector] +++ OK, passed 100 tests.
  2596. 135.36 s [vector] uniq: OK
  2597. 135.37 s [vector] +++ OK, passed 100 tests.
  2598. 135.37 s [vector] mapMaybe: OK
  2599. 135.37 s [vector] +++ OK, passed 100 tests.
  2600. 135.37 s [vector] imapMaybe: OK
  2601. 135.37 s [vector] +++ OK, passed 100 tests.
  2602. 135.37 s [vector] takeWhile: OK
  2603. 135.37 s [vector] +++ OK, passed 100 tests.
  2604. 135.37 s [vector] dropWhile: OK
  2605. 135.37 s [vector] +++ OK, passed 100 tests.
  2606. 135.37 s [vector] partition: OK
  2607. 135.37 s [vector] +++ OK, passed 100 tests.
  2608. 135.37 s [vector] partitionWith: OK
  2609. 135.37 s [vector] +++ OK, passed 100 tests.
  2610. 135.37 s [vector] span: OK
  2611. 135.37 s [vector] +++ OK, passed 100 tests.
  2612. 135.37 s [vector] break: OK
  2613. 135.37 s [vector] +++ OK, passed 100 tests.
  2614. 135.37 s [vector] spanR: OK
  2615. 135.38 s [vector] +++ OK, passed 100 tests.
  2616. 135.38 s [vector] breakR: OK
  2617. 135.38 s [vector] +++ OK, passed 100 tests.
  2618. 135.38 s [vector] groupBy: OK
  2619. 135.38 s [vector] +++ OK, passed 100 tests.
  2620. 135.38 s [vector] elem: OK
  2621. 135.38 s [vector] +++ OK, passed 100 tests.
  2622. 135.38 s [vector] notElem: OK
  2623. 135.38 s [vector] +++ OK, passed 100 tests.
  2624. 135.38 s [vector] find: OK
  2625. 135.38 s [vector] +++ OK, passed 100 tests.
  2626. 135.38 s [vector] findIndex: OK
  2627. 135.38 s [vector] +++ OK, passed 100 tests.
  2628. 135.38 s [vector] findIndexR: OK
  2629. 135.38 s [vector] +++ OK, passed 100 tests.
  2630. 135.38 s [vector] findIndices: OK
  2631. 135.38 s [vector] +++ OK, passed 100 tests.
  2632. 135.38 s [vector] elemIndex: OK
  2633. 135.38 s [vector] +++ OK, passed 100 tests.
  2634. 135.38 s [vector] elemIndices: OK
  2635. 135.38 s [vector] +++ OK, passed 100 tests.
  2636. 135.39 s [vector] foldl: OK
  2637. 135.39 s [vector] +++ OK, passed 100 tests.
  2638. 135.39 s [vector] foldl1: OK
  2639. 135.39 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2640. 135.39 s [vector] foldl': OK
  2641. 135.39 s [vector] +++ OK, passed 100 tests.
  2642. 135.40 s [vector] foldl1': OK
  2643. 135.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2644. 135.40 s [vector] foldr: OK
  2645. 135.40 s [vector] +++ OK, passed 100 tests.
  2646. 135.40 s [vector] foldr1: OK
  2647. 135.40 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2648. 135.40 s [vector] foldr': OK
  2649. 135.40 s [vector] +++ OK, passed 100 tests.
  2650. 135.40 s [vector] foldr1': OK
  2651. 135.40 s [vector] +++ OK, passed 100 tests; 22 discarded.
  2652. 135.41 s [vector] ifoldl: OK
  2653. 135.41 s [vector] +++ OK, passed 100 tests.
  2654. 135.41 s [vector] ifoldl': OK
  2655. 135.41 s [vector] +++ OK, passed 100 tests.
  2656. 135.41 s [vector] ifoldr: OK
  2657. 135.41 s [vector] +++ OK, passed 100 tests.
  2658. 135.41 s [vector] ifoldr': OK
  2659. 135.41 s [vector] +++ OK, passed 100 tests.
  2660. 135.42 s [vector] ifoldM: OK
  2661. 135.42 s [vector] +++ OK, passed 100 tests.
  2662. 135.43 s [vector] ifoldM': OK
  2663. 135.43 s [vector] +++ OK, passed 100 tests.
  2664. 135.44 s [vector] ifoldM_: OK (0.02s)
  2665. 135.44 s [vector] +++ OK, passed 100 tests.
  2666. 135.46 s [vector] ifoldM'_: OK
  2667. 135.46 s [vector] +++ OK, passed 100 tests.
  2668. 135.46 s [vector] all: OK
  2669. 135.46 s [vector] +++ OK, passed 100 tests.
  2670. 135.46 s [vector] any: OK
  2671. 135.46 s [vector] +++ OK, passed 100 tests.
  2672. 135.46 s [vector] prescanl: OK
  2673. 135.46 s [vector] +++ OK, passed 100 tests.
  2674. 135.46 s [vector] prescanl': OK
  2675. 135.46 s [vector] +++ OK, passed 100 tests.
  2676. 135.47 s [vector] postscanl: OK
  2677. 135.47 s [vector] +++ OK, passed 100 tests.
  2678. 135.47 s [vector] postscanl': OK
  2679. 135.47 s [vector] +++ OK, passed 100 tests.
  2680. 135.47 s [vector] scanl: OK
  2681. 135.47 s [vector] +++ OK, passed 100 tests.
  2682. 135.47 s [vector] scanl': OK
  2683. 135.47 s [vector] +++ OK, passed 100 tests.
  2684. 135.47 s [vector] scanl1: OK
  2685. 135.48 s [vector] +++ OK, passed 100 tests.
  2686. 135.48 s [vector] scanl1': OK
  2687. 135.48 s [vector] +++ OK, passed 100 tests.
  2688. 135.48 s [vector] iscanl: OK
  2689. 135.48 s [vector] +++ OK, passed 100 tests.
  2690. 135.48 s [vector] iscanl': OK
  2691. 135.49 s [vector] +++ OK, passed 100 tests.
  2692. 135.49 s [vector] prescanr: OK
  2693. 135.49 s [vector] +++ OK, passed 100 tests.
  2694. 135.49 s [vector] prescanr': OK
  2695. 135.49 s [vector] +++ OK, passed 100 tests.
  2696. 135.49 s [vector] postscanr: OK
  2697. 135.49 s [vector] +++ OK, passed 100 tests.
  2698. 135.49 s [vector] postscanr': OK
  2699. 135.50 s [vector] +++ OK, passed 100 tests.
  2700. 135.50 s [vector] scanr: OK
  2701. 135.50 s [vector] +++ OK, passed 100 tests.
  2702. 135.50 s [vector] scanr': OK
  2703. 135.50 s [vector] +++ OK, passed 100 tests.
  2704. 135.51 s [vector] scanr1: OK
  2705. 135.51 s [vector] +++ OK, passed 100 tests.
  2706. 135.51 s [vector] scanr1': OK
  2707. 135.51 s [vector] +++ OK, passed 100 tests.
  2708. 135.51 s [vector] iscanr: OK
  2709. 135.51 s [vector] +++ OK, passed 100 tests.
  2710. 135.51 s [vector] iscanr': OK
  2711. 135.51 s [vector] +++ OK, passed 100 tests.
  2712. 135.51 s [vector] mut_read: OK
  2713. 135.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2714. 135.51 s [vector] mut_write: OK
  2715. 135.51 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2716. 135.52 s [vector] mut_modify: OK
  2717. 135.52 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2718. 135.52 s [vector] mut_generate: OK
  2719. 135.52 s [vector] +++ OK, passed 100 tests.
  2720. 135.52 s [vector] mut_generateM: OK
  2721. 135.53 s [vector] +++ OK, passed 100 tests.
  2722. 135.55 s [vector] mut_mapM_: OK (0.02s)
  2723. 135.55 s [vector] +++ OK, passed 100 tests.
  2724. 135.56 s [vector] mut_imapM_: OK (0.02s)
  2725. 135.56 s [vector] +++ OK, passed 100 tests.
  2726. 135.57 s [vector] mut_forM_: OK
  2727. 135.57 s [vector] +++ OK, passed 100 tests.
  2728. 135.59 s [vector] mut_iforM_: OK (0.02s)
  2729. 135.59 s [vector] +++ OK, passed 100 tests.
  2730. 135.59 s [vector] mut_foldr: OK
  2731. 135.59 s [vector] +++ OK, passed 100 tests.
  2732. 135.59 s [vector] mut_foldr': OK
  2733. 135.59 s [vector] +++ OK, passed 100 tests.
  2734. 135.60 s [vector] mut_foldl: OK
  2735. 135.60 s [vector] +++ OK, passed 100 tests.
  2736. 135.60 s [vector] mut_foldl': OK
  2737. 135.60 s [vector] +++ OK, passed 100 tests.
  2738. 135.60 s [vector] mut_ifoldr: OK
  2739. 135.60 s [vector] +++ OK, passed 100 tests.
  2740. 135.61 s [vector] mut_ifoldr': OK
  2741. 135.61 s [vector] +++ OK, passed 100 tests.
  2742. 135.61 s [vector] mut_ifoldl: OK
  2743. 135.61 s [vector] +++ OK, passed 100 tests.
  2744. 135.62 s [vector] mut_ifoldl': OK
  2745. 135.62 s [vector] +++ OK, passed 100 tests.
  2746. 135.62 s [vector] mut_foldM: OK
  2747. 135.62 s [vector] +++ OK, passed 100 tests.
  2748. 135.62 s [vector] mut_foldM': OK
  2749. 135.62 s [vector] +++ OK, passed 100 tests.
  2750. 135.62 s [vector] mut_foldrM: OK
  2751. 135.62 s [vector] +++ OK, passed 100 tests.
  2752. 135.63 s [vector] mut_foldrM': OK
  2753. 135.63 s [vector] +++ OK, passed 100 tests.
  2754. 135.63 s [vector] mut_ifoldM: OK
  2755. 135.63 s [vector] +++ OK, passed 100 tests.
  2756. 135.63 s [vector] mut_ifoldM': OK
  2757. 135.63 s [vector] +++ OK, passed 100 tests.
  2758. 135.64 s [vector] mut_ifoldrM: OK
  2759. 135.64 s [vector] +++ OK, passed 100 tests.
  2760. 135.64 s [vector] mut_ifoldrM': OK
  2761. 135.64 s [vector] +++ OK, passed 100 tests.
  2762. 135.64 s [vector] compare: OK
  2763. 135.64 s [vector] +++ OK, passed 100 tests.
  2764. 135.64 s [vector] maximum: OK
  2765. 135.64 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2766. 135.64 s [vector] minimum: OK
  2767. 135.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2768. 135.65 s [vector] minIndex: OK
  2769. 135.65 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2770. 135.65 s [vector] maxIndex: OK
  2771. 135.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2772. 135.65 s [vector] maximumBy: OK
  2773. 135.65 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2774. 135.65 s [vector] minimumBy: OK
  2775. 135.65 s [vector] +++ OK, passed 100 tests; 13 discarded.
  2776. 135.65 s [vector] maximumOn: OK
  2777. 135.65 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2778. 135.65 s [vector] minimumOn: OK
  2779. 135.65 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2780. 135.65 s [vector] maxIndexBy: OK
  2781. 135.65 s [vector] +++ OK, passed 100 tests; 21 discarded.
  2782. 135.65 s [vector] minIndexBy: OK
  2783. 135.65 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2784. 135.65 s [vector] ListFirstMaxIndexWins: OK
  2785. 135.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  2786. 135.65 s [vector] FalseListFirstMaxIndexWins: OK
  2787. 135.65 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  2788. 135.65 s [vector] []
  2789. 135.67 s [vector] mempty: OK
  2790. 135.67 s [vector] +++ OK, passed 100 tests.
  2791. 135.67 s [vector] mappend: OK
  2792. 135.67 s [vector] +++ OK, passed 100 tests.
  2793. 135.67 s [vector] mconcat: OK (0.01s)
  2794. 135.67 s [vector] +++ OK, passed 100 tests.
  2795. 135.67 s [vector] glength: OK
  2796. 135.67 s [vector] +++ OK, passed 100 tests.
  2797. 135.67 s [vector] sum: OK
  2798. 135.67 s [vector] +++ OK, passed 100 tests.
  2799. 135.67 s [vector] product: OK
  2800. 135.67 s [vector] +++ OK, passed 100 tests.
  2801. 135.67 s [vector] enumFromN: OK
  2802. 135.67 s [vector] +++ OK, passed 100 tests.
  2803. 135.67 s [vector] enumFromThenN: OK
  2804. 135.67 s [vector] +++ OK, passed 100 tests.
  2805. 135.67 s [vector] enumFromTo: OK
  2806. 135.67 s [vector] +++ OK, passed 100 tests.
  2807. 135.67 s [vector] enumFromThenTo: OK
  2808. 135.67 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2809. 135.67 s [vector] Double
  2810. 135.67 s [vector] fromList.toList == id: OK
  2811. 135.67 s [vector] +++ OK, passed 100 tests.
  2812. 135.67 s [vector] toList.fromList == id: OK
  2813. 135.67 s [vector] +++ OK, passed 100 tests.
  2814. 135.67 s [vector] unstream.stream == id: OK
  2815. 135.67 s [vector] +++ OK, passed 100 tests.
  2816. 135.68 s [vector] stream.unstream == id: OK
  2817. 135.68 s [vector] +++ OK, passed 100 tests.
  2818. 135.68 s [vector] eq: OK
  2819. 135.68 s [vector] +++ OK, passed 100 tests.
  2820. 135.68 s [vector] length: OK
  2821. 135.68 s [vector] +++ OK, passed 100 tests.
  2822. 135.68 s [vector] null: OK
  2823. 135.68 s [vector] +++ OK, passed 100 tests.
  2824. 135.68 s [vector] index: OK
  2825. 135.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2826. 135.68 s [vector] safeIndex: OK
  2827. 135.68 s [vector] +++ OK, passed 100 tests.
  2828. 135.68 s [vector] head: OK
  2829. 135.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2830. 135.68 s [vector] last: OK
  2831. 135.68 s [vector] +++ OK, passed 100 tests; 18 discarded.
  2832. 135.68 s [vector] unsafeIndex: OK
  2833. 135.68 s [vector] +++ OK, passed 100 tests; 21 discarded.
  2834. 135.68 s [vector] unsafeHead: OK
  2835. 135.68 s [vector] +++ OK, passed 100 tests; 12 discarded.
  2836. 135.68 s [vector] unsafeLast: OK
  2837. 135.68 s [vector] +++ OK, passed 100 tests; 11 discarded.
  2838. 135.68 s [vector] slice: OK
  2839. 135.68 s [vector] +++ OK, passed 100 tests.
  2840. 135.69 s [vector] init: OK
  2841. 135.69 s [vector] +++ OK, passed 100 tests; 14 discarded.
  2842. 135.69 s [vector] tail: OK
  2843. 135.69 s [vector] +++ OK, passed 100 tests; 20 discarded.
  2844. 135.69 s [vector] take: OK
  2845. 135.69 s [vector] +++ OK, passed 100 tests.
  2846. 135.69 s [vector] drop: OK
  2847. 135.69 s [vector] +++ OK, passed 100 tests.
  2848. 135.69 s [vector] splitAt: OK
  2849. 135.69 s [vector] +++ OK, passed 100 tests.
  2850. 135.69 s [vector] empty: OK
  2851. 135.69 s [vector] +++ OK, passed 100 tests.
  2852. 135.69 s [vector] singleton: OK
  2853. 135.69 s [vector] +++ OK, passed 100 tests.
  2854. 135.69 s [vector] replicate: OK
  2855. 135.69 s [vector] +++ OK, passed 100 tests.
  2856. 135.69 s [vector] generate: OK
  2857. 135.69 s [vector] +++ OK, passed 100 tests.
  2858. 135.69 s [vector] iterateN: OK
  2859. 135.71 s [vector] +++ OK, passed 100 tests.
  2860. 135.73 s [vector] iterateNM: OK (0.03s)
  2861. 136.02 s [vector] +++ OK, passed 100 tests.
  2862. 136.02 s [vector] generateM: OK (0.02s)
  2863. 136.02 s [vector] +++ OK, passed 100 tests.
  2864. 136.02 s [vector] replicateM: OK (0.01s)
  2865. 136.02 s [vector] +++ OK, passed 100 tests.
  2866. 136.02 s [vector] create: OK
  2867. 136.02 s [vector] +++ OK, passed 100 tests.
  2868. 136.02 s [vector] createT: OK
  2869. 136.02 s [vector] +++ OK, passed 100 tests.
  2870. 136.02 s [vector] unfoldr: OK
  2871. 136.02 s [vector] +++ OK, passed 100 tests.
  2872. 136.02 s [vector] unfoldrN: OK
  2873. 136.02 s [vector] +++ OK, passed 100 tests.
  2874. 136.02 s [vector] unfoldrExactN: OK
  2875. 136.02 s [vector] +++ OK, passed 100 tests.
  2876. 136.02 s [vector] unfoldrM: OK
  2877. 136.02 s [vector] +++ OK, passed 100 tests.
  2878. 136.02 s [vector] unfoldrNM: OK
  2879. 136.02 s [vector] +++ OK, passed 100 tests.
  2880. 136.02 s [vector] unfoldrExactNM: OK (0.03s)
  2881. 136.02 s [vector] +++ OK, passed 100 tests.
  2882. 136.02 s [vector] constructN: OK
  2883. 136.02 s [vector] +++ OK, passed 100 tests.
  2884. 136.02 s [vector] constructrN: OK (0.01s)
  2885. 136.02 s [vector] +++ OK, passed 100 tests.
  2886. 136.02 s [vector] cons: OK
  2887. 136.02 s [vector] +++ OK, passed 100 tests.
  2888. 136.02 s [vector] snoc: OK
  2889. 136.02 s [vector] +++ OK, passed 100 tests.
  2890. 136.02 s [vector] append: OK
  2891. 136.02 s [vector] +++ OK, passed 100 tests.
  2892. 136.02 s [vector] concat: OK (0.02s)
  2893. 136.02 s [vector] +++ OK, passed 100 tests.
  2894. 136.02 s [vector] force: OK
  2895. 136.02 s [vector] +++ OK, passed 100 tests.
  2896. 136.02 s [vector] upd: OK
  2897. 136.02 s [vector] +++ OK, passed 100 tests.
  2898. 136.02 s [vector] accum: OK (0.01s)
  2899. 136.02 s [vector] +++ OK, passed 100 tests.
  2900. 136.02 s [vector] reverse: OK
  2901. 136.02 s [vector] +++ OK, passed 100 tests.
  2902. 136.02 s [vector] backpermute: OK
  2903. 136.02 s [vector] +++ OK, passed 100 tests.
  2904. 136.02 s [vector] map: OK
  2905. 136.02 s [vector] +++ OK, passed 100 tests.
  2906. 136.02 s [vector] imap: OK
  2907. 136.02 s [vector] +++ OK, passed 100 tests.
  2908. 136.02 s [vector] concatMap: OK
  2909. 136.02 s [vector] +++ OK, passed 100 tests.
  2910. 136.02 s [vector] mapM: OK
  2911. 136.02 s [vector] +++ OK, passed 100 tests.
  2912. 136.02 s [vector] mapM_: OK (0.03s)
  2913. 136.02 s [vector] +++ OK, passed 100 tests.
  2914. 136.02 s [vector] forM: OK
  2915. 136.02 s [vector] +++ OK, passed 100 tests.
  2916. 136.02 s [vector] forM_: OK (0.03s)
  2917. 136.02 s [vector] +++ OK, passed 100 tests.
  2918. 136.02 s [vector] imapM: OK
  2919. 136.02 s [vector] +++ OK, passed 100 tests.
  2920. 136.02 s [vector] imapM_: OK (0.03s)
  2921. 136.02 s [vector] +++ OK, passed 100 tests.
  2922. 136.02 s [vector] zipWith: OK
  2923. 136.02 s [vector] +++ OK, passed 100 tests.
  2924. 136.02 s [vector] zipWith3: OK
  2925. 136.02 s [vector] +++ OK, passed 100 tests.
  2926. 136.02 s [vector] izipWith: OK
  2927. 136.02 s [vector] +++ OK, passed 100 tests.
  2928. 136.04 s [vector] izipWith3: OK
  2929. 136.04 s [vector] +++ OK, passed 100 tests.
  2930. 136.05 s [vector] izipWithM: OK
  2931. 136.05 s [vector] +++ OK, passed 100 tests.
  2932. 136.08 s [vector] izipWithM_: OK (0.03s)
  2933. 136.08 s [vector] +++ OK, passed 100 tests.
  2934. 136.08 s [vector] zipWithM: OK
  2935. 136.09 s [vector] +++ OK, passed 100 tests.
  2936. 136.11 s [vector] zipWithM_: OK (0.02s)
  2937. 136.11 s [vector] +++ OK, passed 100 tests.
  2938. 136.12 s [vector] filter: OK
  2939. 136.12 s [vector] +++ OK, passed 100 tests.
  2940. 136.12 s [vector] ifilter: OK
  2941. 136.13 s [vector] +++ OK, passed 100 tests.
  2942. 136.16 s [vector] filterM: OK (0.04s)
  2943. 136.16 s [vector] +++ OK, passed 100 tests.
  2944. 136.16 s [vector] uniq: OK
  2945. 136.16 s [vector] +++ OK, passed 100 tests.
  2946. 136.16 s [vector] mapMaybe: OK
  2947. 136.17 s [vector] +++ OK, passed 100 tests.
  2948. 136.17 s [vector] imapMaybe: OK
  2949. 136.17 s [vector] +++ OK, passed 100 tests.
  2950. 136.17 s [vector] takeWhile: OK
  2951. 136.17 s [vector] +++ OK, passed 100 tests.
  2952. 136.18 s [vector] dropWhile: OK
  2953. 136.18 s [vector] +++ OK, passed 100 tests.
  2954. 136.18 s [vector] partition: OK
  2955. 136.19 s [vector] +++ OK, passed 100 tests.
  2956. 136.19 s [vector] partitionWith: OK
  2957. 136.19 s [vector] +++ OK, passed 100 tests.
  2958. 136.19 s [vector] span: OK
  2959. 136.19 s [vector] +++ OK, passed 100 tests.
  2960. 136.19 s [vector] break: OK
  2961. 136.19 s [vector] +++ OK, passed 100 tests.
  2962. 136.19 s [vector] spanR: OK
  2963. 136.19 s [vector] +++ OK, passed 100 tests.
  2964. 136.20 s [vector] breakR: OK
  2965. 136.20 s [vector] +++ OK, passed 100 tests.
  2966. 136.20 s [vector] groupBy: OK
  2967. 136.20 s [vector] +++ OK, passed 100 tests.
  2968. 136.20 s [vector] elem: OK
  2969. 136.20 s [vector] +++ OK, passed 100 tests.
  2970. 136.20 s [vector] notElem: OK
  2971. 136.20 s [vector] +++ OK, passed 100 tests.
  2972. 136.20 s [vector] find: OK
  2973. 136.20 s [vector] +++ OK, passed 100 tests.
  2974. 136.20 s [vector] findIndex: OK
  2975. 136.20 s [vector] +++ OK, passed 100 tests.
  2976. 136.20 s [vector] findIndexR: OK
  2977. 136.20 s [vector] +++ OK, passed 100 tests.
  2978. 136.21 s [vector] findIndices: OK
  2979. 136.21 s [vector] +++ OK, passed 100 tests.
  2980. 136.21 s [vector] elemIndex: OK
  2981. 136.21 s [vector] +++ OK, passed 100 tests.
  2982. 136.21 s [vector] elemIndices: OK
  2983. 136.22 s [vector] +++ OK, passed 100 tests.
  2984. 136.23 s [vector] foldl: OK (0.01s)
  2985. 136.23 s [vector] +++ OK, passed 100 tests.
  2986. 136.24 s [vector] foldl1: OK (0.01s)
  2987. 136.25 s [vector] +++ OK, passed 100 tests; 15 discarded.
  2988. 136.25 s [vector] foldl': OK
  2989. 136.25 s [vector] +++ OK, passed 100 tests.
  2990. 136.26 s [vector] foldl1': OK (0.01s)
  2991. 136.26 s [vector] +++ OK, passed 100 tests; 17 discarded.
  2992. 136.27 s [vector] foldr: OK (0.01s)
  2993. 136.27 s [vector] +++ OK, passed 100 tests.
  2994. 136.29 s [vector] foldr1: OK (0.01s)
  2995. 136.29 s [vector] +++ OK, passed 100 tests; 11 discarded.
  2996. 136.29 s [vector] foldr': OK (0.01s)
  2997. 136.29 s [vector] +++ OK, passed 100 tests.
  2998. 136.31 s [vector] foldr1': OK (0.01s)
  2999. 136.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3000. 136.31 s [vector] ifoldl: OK (0.01s)
  3001. 136.31 s [vector] +++ OK, passed 100 tests.
  3002. 136.33 s [vector] ifoldl': OK (0.01s)
  3003. 136.33 s [vector] +++ OK, passed 100 tests.
  3004. 136.34 s [vector] ifoldr: OK (0.01s)
  3005. 136.34 s [vector] +++ OK, passed 100 tests.
  3006. 136.35 s [vector] ifoldr': OK (0.01s)
  3007. 136.35 s [vector] +++ OK, passed 100 tests.
  3008. 136.36 s [vector] ifoldM: OK (0.01s)
  3009. 136.37 s [vector] +++ OK, passed 100 tests.
  3010. 136.37 s [vector] ifoldM': OK (0.01s)
  3011. 136.37 s [vector] +++ OK, passed 100 tests.
  3012. 136.41 s [vector] ifoldM_: OK (0.04s)
  3013. 136.41 s [vector] +++ OK, passed 100 tests.
  3014. 136.44 s [vector] ifoldM'_: OK (0.03s)
  3015. 136.44 s [vector] +++ OK, passed 100 tests.
  3016. 136.44 s [vector] all: OK
  3017. 136.44 s [vector] +++ OK, passed 100 tests.
  3018. 136.44 s [vector] any: OK
  3019. 136.45 s [vector] +++ OK, passed 100 tests.
  3020. 136.45 s [vector] prescanl: OK (0.01s)
  3021. 136.45 s [vector] +++ OK, passed 100 tests.
  3022. 136.46 s [vector] prescanl': OK (0.01s)
  3023. 136.46 s [vector] +++ OK, passed 100 tests.
  3024. 136.47 s [vector] postscanl: OK
  3025. 136.47 s [vector] +++ OK, passed 100 tests.
  3026. 136.49 s [vector] postscanl': OK (0.01s)
  3027. 136.49 s [vector] +++ OK, passed 100 tests.
  3028. 136.49 s [vector] scanl: OK (0.01s)
  3029. 136.49 s [vector] +++ OK, passed 100 tests.
  3030. 136.51 s [vector] scanl': OK (0.01s)
  3031. 136.51 s [vector] +++ OK, passed 100 tests.
  3032. 136.52 s [vector] scanl1: OK (0.01s)
  3033. 136.52 s [vector] +++ OK, passed 100 tests.
  3034. 136.53 s [vector] scanl1': OK (0.01s)
  3035. 136.53 s [vector] +++ OK, passed 100 tests.
  3036. 136.55 s [vector] iscanl: OK (0.01s)
  3037. 136.55 s [vector] +++ OK, passed 100 tests.
  3038. 136.55 s [vector] iscanl': OK (0.01s)
  3039. 136.55 s [vector] +++ OK, passed 100 tests.
  3040. 136.57 s [vector] prescanr: OK (0.01s)
  3041. 136.57 s [vector] +++ OK, passed 100 tests.
  3042. 136.57 s [vector] prescanr': OK (0.01s)
  3043. 136.57 s [vector] +++ OK, passed 100 tests.
  3044. 136.59 s [vector] postscanr: OK (0.01s)
  3045. 136.59 s [vector] +++ OK, passed 100 tests.
  3046. 136.59 s [vector] postscanr': OK (0.01s)
  3047. 136.59 s [vector] +++ OK, passed 100 tests.
  3048. 136.61 s [vector] scanr: OK (0.01s)
  3049. 136.61 s [vector] +++ OK, passed 100 tests.
  3050. 136.62 s [vector] scanr': OK (0.01s)
  3051. 136.62 s [vector] +++ OK, passed 100 tests.
  3052. 136.62 s [vector] scanr1: OK
  3053. 136.62 s [vector] +++ OK, passed 100 tests.
  3054. 136.63 s [vector] scanr1': OK
  3055. 136.63 s [vector] +++ OK, passed 100 tests.
  3056. 136.64 s [vector] iscanr: OK
  3057. 136.65 s [vector] +++ OK, passed 100 tests.
  3058. 136.66 s [vector] iscanr': OK (0.01s)
  3059. 136.66 s [vector] +++ OK, passed 100 tests.
  3060. 136.66 s [vector] mut_read: OK
  3061. 136.66 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3062. 136.66 s [vector] mut_write: OK
  3063. 136.66 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3064. 136.66 s [vector] mut_modify: OK
  3065. 136.66 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3066. 136.66 s [vector] mut_generate: OK
  3067. 136.66 s [vector] +++ OK, passed 100 tests.
  3068. 136.67 s [vector] mut_generateM: OK
  3069. 136.69 s [vector] +++ OK, passed 100 tests.
  3070. 136.73 s [vector] mut_mapM_: OK (0.04s)
  3071. 136.73 s [vector] +++ OK, passed 100 tests.
  3072. 136.75 s [vector] mut_imapM_: OK (0.03s)
  3073. 136.75 s [vector] +++ OK, passed 100 tests.
  3074. 136.79 s [vector] mut_forM_: OK (0.03s)
  3075. 136.79 s [vector] +++ OK, passed 100 tests.
  3076. 136.81 s [vector] mut_iforM_: OK (0.03s)
  3077. 136.81 s [vector] +++ OK, passed 100 tests.
  3078. 136.83 s [vector] mut_foldr: OK (0.01s)
  3079. 136.83 s [vector] +++ OK, passed 100 tests.
  3080. 136.83 s [vector] mut_foldr': OK (0.01s)
  3081. 136.83 s [vector] +++ OK, passed 100 tests.
  3082. 136.84 s [vector] mut_foldl: OK (0.01s)
  3083. 136.84 s [vector] +++ OK, passed 100 tests.
  3084. 136.85 s [vector] mut_foldl': OK
  3085. 136.85 s [vector] +++ OK, passed 100 tests.
  3086. 136.87 s [vector] mut_ifoldr: OK (0.01s)
  3087. 136.87 s [vector] +++ OK, passed 100 tests.
  3088. 136.89 s [vector] mut_ifoldr': OK (0.01s)
  3089. 136.89 s [vector] +++ OK, passed 100 tests.
  3090. 136.89 s [vector] mut_ifoldl: OK (0.01s)
  3091. 136.89 s [vector] +++ OK, passed 100 tests.
  3092. 136.91 s [vector] mut_ifoldl': OK (0.01s)
  3093. 136.91 s [vector] +++ OK, passed 100 tests.
  3094. 136.91 s [vector] mut_foldM: OK (0.01s)
  3095. 136.91 s [vector] +++ OK, passed 100 tests.
  3096. 136.93 s [vector] mut_foldM': OK (0.01s)
  3097. 136.93 s [vector] +++ OK, passed 100 tests.
  3098. 136.94 s [vector] mut_foldrM: OK
  3099. 136.94 s [vector] +++ OK, passed 100 tests.
  3100. 136.95 s [vector] mut_foldrM': OK (0.01s)
  3101. 136.95 s [vector] +++ OK, passed 100 tests.
  3102. 136.96 s [vector] mut_ifoldM: OK (0.01s)
  3103. 136.96 s [vector] +++ OK, passed 100 tests.
  3104. 136.97 s [vector] mut_ifoldM': OK (0.01s)
  3105. 136.97 s [vector] +++ OK, passed 100 tests.
  3106. 136.99 s [vector] mut_ifoldrM: OK (0.01s)
  3107. 136.99 s [vector] +++ OK, passed 100 tests.
  3108. 136.99 s [vector] mut_ifoldrM': OK (0.01s)
  3109. 136.99 s [vector] +++ OK, passed 100 tests.
  3110. 136.99 s [vector] compare: OK
  3111. 136.99 s [vector] +++ OK, passed 100 tests.
  3112. 136.99 s [vector] maximum: OK
  3113. 136.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3114. 136.99 s [vector] minimum: OK
  3115. 136.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3116. 136.99 s [vector] minIndex: OK
  3117. 136.99 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3118. 136.99 s [vector] maxIndex: OK
  3119. 136.99 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3120. 136.99 s [vector] maximumBy: OK
  3121. 136.99 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3122. 137.00 s [vector] minimumBy: OK
  3123. 137.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3124. 137.00 s [vector] maximumOn: OK
  3125. 137.00 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3126. 137.00 s [vector] minimumOn: OK
  3127. 137.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3128. 137.00 s [vector] maxIndexBy: OK
  3129. 137.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3130. 137.00 s [vector] minIndexBy: OK
  3131. 137.00 s [vector] +++ OK, passed 100 tests; 24 discarded.
  3132. 137.00 s [vector] ListFirstMaxIndexWins: OK
  3133. 137.00 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3134. 137.00 s [vector] FalseListFirstMaxIndexWins: OK
  3135. 137.00 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  3136. 137.00 s [vector] []
  3137. 137.00 s [vector] mempty: OK
  3138. 137.00 s [vector] +++ OK, passed 100 tests.
  3139. 137.01 s [vector] mappend: OK
  3140. 137.01 s [vector] +++ OK, passed 100 tests.
  3141. 137.02 s [vector] mconcat: OK (0.02s)
  3142. 137.02 s [vector] +++ OK, passed 100 tests.
  3143. 137.02 s [vector] glength: OK
  3144. 137.02 s [vector] +++ OK, passed 100 tests.
  3145. 137.03 s [vector] sum: OK
  3146. 137.03 s [vector] +++ OK, passed 100 tests.
  3147. 137.03 s [vector] product: OK
  3148. 137.03 s [vector] +++ OK, passed 100 tests.
  3149. 137.03 s [vector] enumFromN: OK
  3150. 137.03 s [vector] +++ OK, passed 100 tests.
  3151. 137.03 s [vector] enumFromThenN: OK
  3152. 137.03 s [vector] +++ OK, passed 100 tests.
  3153. 137.03 s [vector] enumFromTo: OK
  3154. 137.03 s [vector] +++ OK, passed 100 tests.
  3155. 137.03 s [vector] enumFromThenTo: OK
  3156. 137.03 s [vector] +++ OK, passed 100 tests; 4 discarded.
  3157. 137.03 s [vector] unstream
  3158. 137.03 s [vector] unstream == vunstream (exact): OK
  3159. 137.03 s [vector] +++ OK, passed 100 tests.
  3160. 137.03 s [vector] unstream == vunstream (unknown): OK
  3161. 137.03 s [vector] +++ OK, passed 100 tests.
  3162. 137.04 s [vector] unstreamR ~= vunstream (exact): OK
  3163. 137.04 s [vector] +++ OK, passed 100 tests.
  3164. 137.04 s [vector] unstreamR ~= vunstream (unknown): OK
  3165. 137.04 s [vector] +++ OK, passed 100 tests.
  3166. 137.04 s [vector] Tests.Vector.Storable
  3167. 137.04 s [vector] Data.Vector.Storable.Vector (Int)
  3168. 137.04 s [vector] fromList.toList == id: OK
  3169. 137.04 s [vector] +++ OK, passed 100 tests.
  3170. 137.04 s [vector] toList.fromList == id: OK
  3171. 137.04 s [vector] +++ OK, passed 100 tests.
  3172. 137.04 s [vector] unstream.stream == id: OK
  3173. 137.04 s [vector] +++ OK, passed 100 tests.
  3174. 137.04 s [vector] stream.unstream == id: OK
  3175. 137.04 s [vector] +++ OK, passed 100 tests.
  3176. 137.04 s [vector] eq: OK
  3177. 137.04 s [vector] +++ OK, passed 100 tests.
  3178. 137.04 s [vector] length: OK
  3179. 137.04 s [vector] +++ OK, passed 100 tests.
  3180. 137.04 s [vector] null: OK
  3181. 137.04 s [vector] +++ OK, passed 100 tests.
  3182. 137.04 s [vector] index: OK
  3183. 137.04 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3184. 137.04 s [vector] safeIndex: OK
  3185. 137.04 s [vector] +++ OK, passed 100 tests.
  3186. 137.04 s [vector] head: OK
  3187. 137.04 s [vector] +++ OK, passed 100 tests; 22 discarded.
  3188. 137.04 s [vector] last: OK
  3189. 137.04 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3190. 137.04 s [vector] unsafeIndex: OK
  3191. 137.04 s [vector] +++ OK, passed 100 tests; 11 discarded.
  3192. 137.04 s [vector] unsafeHead: OK
  3193. 137.04 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3194. 137.04 s [vector] unsafeLast: OK
  3195. 137.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3196. 137.04 s [vector] slice: OK
  3197. 137.04 s [vector] +++ OK, passed 100 tests.
  3198. 137.04 s [vector] init: OK
  3199. 137.04 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3200. 137.04 s [vector] tail: OK
  3201. 137.04 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3202. 137.04 s [vector] take: OK
  3203. 137.04 s [vector] +++ OK, passed 100 tests.
  3204. 137.05 s [vector] drop: OK
  3205. 137.05 s [vector] +++ OK, passed 100 tests.
  3206. 137.05 s [vector] splitAt: OK
  3207. 137.05 s [vector] +++ OK, passed 100 tests.
  3208. 137.05 s [vector] empty: OK
  3209. 137.05 s [vector] +++ OK, passed 100 tests.
  3210. 137.05 s [vector] singleton: OK
  3211. 137.05 s [vector] +++ OK, passed 100 tests.
  3212. 137.05 s [vector] replicate: OK
  3213. 137.05 s [vector] +++ OK, passed 100 tests.
  3214. 137.05 s [vector] generate: OK
  3215. 137.05 s [vector] +++ OK, passed 100 tests.
  3216. 137.05 s [vector] iterateN: OK
  3217. 137.05 s [vector] +++ OK, passed 100 tests.
  3218. 137.07 s [vector] iterateNM: OK (0.02s)
  3219. 137.07 s [vector] +++ OK, passed 100 tests.
  3220. 137.09 s [vector] generateM: OK
  3221. 137.09 s [vector] +++ OK, passed 100 tests.
  3222. 137.09 s [vector] replicateM: OK
  3223. 137.09 s [vector] +++ OK, passed 100 tests.
  3224. 137.09 s [vector] create: OK
  3225. 137.09 s [vector] +++ OK, passed 100 tests.
  3226. 137.10 s [vector] createT: OK
  3227. 137.10 s [vector] +++ OK, passed 100 tests.
  3228. 137.10 s [vector] unfoldr: OK
  3229. 137.10 s [vector] +++ OK, passed 100 tests.
  3230. 137.10 s [vector] unfoldrN: OK
  3231. 137.10 s [vector] +++ OK, passed 100 tests.
  3232. 137.10 s [vector] unfoldrExactN: OK
  3233. 137.11 s [vector] +++ OK, passed 100 tests.
  3234. 137.11 s [vector] unfoldrM: OK
  3235. 137.11 s [vector] +++ OK, passed 100 tests.
  3236. 137.11 s [vector] unfoldrNM: OK
  3237. 137.11 s [vector] +++ OK, passed 100 tests.
  3238. 137.13 s [vector] unfoldrExactNM: OK (0.02s)
  3239. 137.13 s [vector] +++ OK, passed 100 tests.
  3240. 137.13 s [vector] constructN: OK
  3241. 137.13 s [vector] +++ OK, passed 100 tests.
  3242. 137.13 s [vector] constructrN: OK
  3243. 137.13 s [vector] +++ OK, passed 100 tests.
  3244. 137.13 s [vector] cons: OK
  3245. 137.13 s [vector] +++ OK, passed 100 tests.
  3246. 137.13 s [vector] snoc: OK
  3247. 137.13 s [vector] +++ OK, passed 100 tests.
  3248. 137.13 s [vector] append: OK
  3249. 137.15 s [vector] +++ OK, passed 100 tests.
  3250. 137.15 s [vector] concat: OK (0.01s)
  3251. 137.15 s [vector] +++ OK, passed 100 tests.
  3252. 137.15 s [vector] force: OK
  3253. 137.15 s [vector] +++ OK, passed 100 tests.
  3254. 137.15 s [vector] upd: OK
  3255. 137.15 s [vector] +++ OK, passed 100 tests.
  3256. 137.16 s [vector] accum: OK
  3257. 137.16 s [vector] +++ OK, passed 100 tests.
  3258. 137.16 s [vector] reverse: OK
  3259. 137.16 s [vector] +++ OK, passed 100 tests.
  3260. 137.16 s [vector] backpermute: OK
  3261. 137.16 s [vector] +++ OK, passed 100 tests.
  3262. 137.16 s [vector] map: OK
  3263. 137.16 s [vector] +++ OK, passed 100 tests.
  3264. 137.16 s [vector] imap: OK
  3265. 137.16 s [vector] +++ OK, passed 100 tests.
  3266. 137.17 s [vector] concatMap: OK
  3267. 137.17 s [vector] +++ OK, passed 100 tests.
  3268. 137.17 s [vector] mapM: OK
  3269. 137.17 s [vector] +++ OK, passed 100 tests.
  3270. 137.19 s [vector] mapM_: OK (0.02s)
  3271. 137.19 s [vector] +++ OK, passed 100 tests.
  3272. 137.19 s [vector] forM: OK
  3273. 137.19 s [vector] +++ OK, passed 100 tests.
  3274. 137.21 s [vector] forM_: OK (0.02s)
  3275. 137.21 s [vector] +++ OK, passed 100 tests.
  3276. 137.21 s [vector] imapM: OK
  3277. 137.21 s [vector] +++ OK, passed 100 tests.
  3278. 137.23 s [vector] imapM_: OK (0.02s)
  3279. 137.23 s [vector] +++ OK, passed 100 tests.
  3280. 137.23 s [vector] zipWith: OK
  3281. 137.23 s [vector] +++ OK, passed 100 tests.
  3282. 137.23 s [vector] zipWith3: OK
  3283. 137.23 s [vector] +++ OK, passed 100 tests.
  3284. 137.23 s [vector] izipWith: OK
  3285. 137.23 s [vector] +++ OK, passed 100 tests.
  3286. 137.23 s [vector] izipWith3: OK
  3287. 137.24 s [vector] +++ OK, passed 100 tests.
  3288. 137.24 s [vector] izipWithM: OK
  3289. 137.25 s [vector] +++ OK, passed 100 tests.
  3290. 137.25 s [vector] izipWithM_: OK (0.01s)
  3291. 137.25 s [vector] +++ OK, passed 100 tests.
  3292. 137.25 s [vector] zipWithM: OK
  3293. 137.27 s [vector] +++ OK, passed 100 tests.
  3294. 137.27 s [vector] zipWithM_: OK (0.01s)
  3295. 137.27 s [vector] +++ OK, passed 100 tests.
  3296. 137.27 s [vector] filter: OK
  3297. 137.27 s [vector] +++ OK, passed 100 tests.
  3298. 137.29 s [vector] ifilter: OK
  3299. 137.29 s [vector] +++ OK, passed 100 tests.
  3300. 137.30 s [vector] filterM: OK (0.02s)
  3301. 137.30 s [vector] +++ OK, passed 100 tests.
  3302. 137.30 s [vector] uniq: OK
  3303. 137.30 s [vector] +++ OK, passed 100 tests.
  3304. 137.30 s [vector] mapMaybe: OK
  3305. 137.30 s [vector] +++ OK, passed 100 tests.
  3306. 137.30 s [vector] imapMaybe: OK
  3307. 137.30 s [vector] +++ OK, passed 100 tests.
  3308. 137.30 s [vector] takeWhile: OK
  3309. 137.30 s [vector] +++ OK, passed 100 tests.
  3310. 137.31 s [vector] dropWhile: OK
  3311. 137.31 s [vector] +++ OK, passed 100 tests.
  3312. 137.31 s [vector] partition: OK
  3313. 137.31 s [vector] +++ OK, passed 100 tests.
  3314. 137.31 s [vector] partitionWith: OK
  3315. 137.31 s [vector] +++ OK, passed 100 tests.
  3316. 137.31 s [vector] span: OK
  3317. 137.31 s [vector] +++ OK, passed 100 tests.
  3318. 137.31 s [vector] break: OK
  3319. 137.31 s [vector] +++ OK, passed 100 tests.
  3320. 137.31 s [vector] spanR: OK
  3321. 137.31 s [vector] +++ OK, passed 100 tests.
  3322. 137.31 s [vector] breakR: OK
  3323. 137.31 s [vector] +++ OK, passed 100 tests.
  3324. 137.31 s [vector] groupBy: OK
  3325. 137.31 s [vector] +++ OK, passed 100 tests.
  3326. 137.31 s [vector] elem: OK
  3327. 137.31 s [vector] +++ OK, passed 100 tests.
  3328. 137.31 s [vector] notElem: OK
  3329. 137.31 s [vector] +++ OK, passed 100 tests.
  3330. 137.32 s [vector] find: OK
  3331. 137.32 s [vector] +++ OK, passed 100 tests.
  3332. 137.32 s [vector] findIndex: OK
  3333. 137.32 s [vector] +++ OK, passed 100 tests.
  3334. 137.32 s [vector] findIndexR: OK
  3335. 137.32 s [vector] +++ OK, passed 100 tests.
  3336. 137.32 s [vector] findIndices: OK
  3337. 137.32 s [vector] +++ OK, passed 100 tests.
  3338. 137.32 s [vector] elemIndex: OK
  3339. 137.32 s [vector] +++ OK, passed 100 tests.
  3340. 137.32 s [vector] elemIndices: OK
  3341. 137.32 s [vector] +++ OK, passed 100 tests.
  3342. 137.32 s [vector] foldl: OK
  3343. 137.32 s [vector] +++ OK, passed 100 tests.
  3344. 137.33 s [vector] foldl1: OK
  3345. 137.33 s [vector] +++ OK, passed 100 tests; 26 discarded.
  3346. 137.33 s [vector] foldl': OK
  3347. 137.33 s [vector] +++ OK, passed 100 tests.
  3348. 137.33 s [vector] foldl1': OK
  3349. 137.33 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3350. 137.33 s [vector] foldr: OK
  3351. 137.33 s [vector] +++ OK, passed 100 tests.
  3352. 137.34 s [vector] foldr1: OK
  3353. 137.34 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3354. 137.34 s [vector] foldr': OK
  3355. 137.34 s [vector] +++ OK, passed 100 tests.
  3356. 137.34 s [vector] foldr1': OK
  3357. 137.34 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3358. 137.34 s [vector] ifoldl: OK
  3359. 137.34 s [vector] +++ OK, passed 100 tests.
  3360. 137.34 s [vector] ifoldl': OK
  3361. 137.34 s [vector] +++ OK, passed 100 tests.
  3362. 137.35 s [vector] ifoldr: OK
  3363. 137.35 s [vector] +++ OK, passed 100 tests.
  3364. 137.35 s [vector] ifoldr': OK
  3365. 137.35 s [vector] +++ OK, passed 100 tests.
  3366. 137.35 s [vector] ifoldM: OK
  3367. 137.36 s [vector] +++ OK, passed 100 tests.
  3368. 137.37 s [vector] ifoldM': OK
  3369. 137.37 s [vector] +++ OK, passed 100 tests.
  3370. 137.39 s [vector] ifoldM_: OK (0.02s)
  3371. 137.39 s [vector] +++ OK, passed 100 tests.
  3372. 137.39 s [vector] ifoldM'_: OK (0.02s)
  3373. 137.39 s [vector] +++ OK, passed 100 tests.
  3374. 137.39 s [vector] all: OK
  3375. 137.40 s [vector] +++ OK, passed 100 tests.
  3376. 137.40 s [vector] any: OK
  3377. 137.40 s [vector] +++ OK, passed 100 tests.
  3378. 137.40 s [vector] prescanl: OK
  3379. 137.40 s [vector] +++ OK, passed 100 tests.
  3380. 137.40 s [vector] prescanl': OK
  3381. 137.40 s [vector] +++ OK, passed 100 tests.
  3382. 137.40 s [vector] postscanl: OK
  3383. 137.40 s [vector] +++ OK, passed 100 tests.
  3384. 137.41 s [vector] postscanl': OK
  3385. 137.41 s [vector] +++ OK, passed 100 tests.
  3386. 137.41 s [vector] scanl: OK
  3387. 137.41 s [vector] +++ OK, passed 100 tests.
  3388. 137.41 s [vector] scanl': OK
  3389. 137.41 s [vector] +++ OK, passed 100 tests.
  3390. 137.41 s [vector] scanl1: OK
  3391. 137.41 s [vector] +++ OK, passed 100 tests.
  3392. 137.41 s [vector] scanl1': OK
  3393. 137.41 s [vector] +++ OK, passed 100 tests.
  3394. 137.42 s [vector] iscanl: OK
  3395. 137.42 s [vector] +++ OK, passed 100 tests.
  3396. 137.42 s [vector] iscanl': OK
  3397. 137.42 s [vector] +++ OK, passed 100 tests.
  3398. 137.42 s [vector] prescanr: OK
  3399. 137.43 s [vector] +++ OK, passed 100 tests.
  3400. 137.43 s [vector] prescanr': OK
  3401. 137.43 s [vector] +++ OK, passed 100 tests.
  3402. 137.43 s [vector] postscanr: OK
  3403. 137.43 s [vector] +++ OK, passed 100 tests.
  3404. 137.43 s [vector] postscanr': OK
  3405. 137.44 s [vector] +++ OK, passed 100 tests.
  3406. 137.44 s [vector] scanr: OK
  3407. 137.44 s [vector] +++ OK, passed 100 tests.
  3408. 137.44 s [vector] scanr': OK
  3409. 137.44 s [vector] +++ OK, passed 100 tests.
  3410. 137.44 s [vector] scanr1: OK
  3411. 137.44 s [vector] +++ OK, passed 100 tests.
  3412. 137.44 s [vector] scanr1': OK
  3413. 137.44 s [vector] +++ OK, passed 100 tests.
  3414. 137.45 s [vector] iscanr: OK
  3415. 137.45 s [vector] +++ OK, passed 100 tests.
  3416. 137.45 s [vector] iscanr': OK
  3417. 137.45 s [vector] +++ OK, passed 100 tests.
  3418. 137.45 s [vector] mut_read: OK
  3419. 137.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3420. 137.45 s [vector] mut_write: OK
  3421. 137.45 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3422. 137.45 s [vector] mut_modify: OK
  3423. 137.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3424. 137.46 s [vector] mut_generate: OK
  3425. 137.46 s [vector] +++ OK, passed 100 tests.
  3426. 137.46 s [vector] mut_generateM: OK
  3427. 137.47 s [vector] +++ OK, passed 100 tests.
  3428. 137.48 s [vector] mut_mapM_: OK (0.02s)
  3429. 137.48 s [vector] +++ OK, passed 100 tests.
  3430. 137.51 s [vector] mut_imapM_: OK
  3431. 137.51 s [vector] +++ OK, passed 100 tests.
  3432. 137.51 s [vector] mut_forM_: OK (0.01s)
  3433. 137.51 s [vector] +++ OK, passed 100 tests.
  3434. 137.53 s [vector] mut_iforM_: OK (0.02s)
  3435. 137.53 s [vector] +++ OK, passed 100 tests.
  3436. 137.53 s [vector] mut_foldr: OK
  3437. 137.53 s [vector] +++ OK, passed 100 tests.
  3438. 137.53 s [vector] mut_foldr': OK
  3439. 137.53 s [vector] +++ OK, passed 100 tests.
  3440. 137.53 s [vector] mut_foldl: OK
  3441. 137.54 s [vector] +++ OK, passed 100 tests.
  3442. 137.54 s [vector] mut_foldl': OK
  3443. 137.54 s [vector] +++ OK, passed 100 tests.
  3444. 137.54 s [vector] mut_ifoldr: OK
  3445. 137.54 s [vector] +++ OK, passed 100 tests.
  3446. 137.55 s [vector] mut_ifoldr': OK
  3447. 137.55 s [vector] +++ OK, passed 100 tests.
  3448. 137.55 s [vector] mut_ifoldl: OK
  3449. 137.55 s [vector] +++ OK, passed 100 tests.
  3450. 137.55 s [vector] mut_ifoldl': OK
  3451. 137.55 s [vector] +++ OK, passed 100 tests.
  3452. 137.55 s [vector] mut_foldM: OK
  3453. 137.55 s [vector] +++ OK, passed 100 tests.
  3454. 137.56 s [vector] mut_foldM': OK
  3455. 137.56 s [vector] +++ OK, passed 100 tests.
  3456. 137.56 s [vector] mut_foldrM: OK
  3457. 137.56 s [vector] +++ OK, passed 100 tests.
  3458. 137.56 s [vector] mut_foldrM': OK
  3459. 137.56 s [vector] +++ OK, passed 100 tests.
  3460. 137.57 s [vector] mut_ifoldM: OK
  3461. 137.57 s [vector] +++ OK, passed 100 tests.
  3462. 137.57 s [vector] mut_ifoldM': OK
  3463. 137.57 s [vector] +++ OK, passed 100 tests.
  3464. 137.57 s [vector] mut_ifoldrM: OK
  3465. 137.57 s [vector] +++ OK, passed 100 tests.
  3466. 137.57 s [vector] mut_ifoldrM': OK
  3467. 137.57 s [vector] +++ OK, passed 100 tests.
  3468. 137.57 s [vector] compare: OK
  3469. 137.58 s [vector] +++ OK, passed 100 tests.
  3470. 137.58 s [vector] maximum: OK
  3471. 137.58 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3472. 137.58 s [vector] minimum: OK
  3473. 137.58 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3474. 137.58 s [vector] minIndex: OK
  3475. 137.58 s [vector] +++ OK, passed 100 tests; 23 discarded.
  3476. 137.58 s [vector] maxIndex: OK
  3477. 137.58 s [vector] +++ OK, passed 100 tests; 22 discarded.
  3478. 137.58 s [vector] maximumBy: OK
  3479. 137.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3480. 137.58 s [vector] minimumBy: OK
  3481. 137.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3482. 137.58 s [vector] maximumOn: OK
  3483. 137.58 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3484. 137.58 s [vector] minimumOn: OK
  3485. 137.58 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3486. 137.58 s [vector] maxIndexBy: OK
  3487. 137.58 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3488. 137.58 s [vector] minIndexBy: OK
  3489. 137.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3490. 137.58 s [vector] ListFirstMaxIndexWins: OK
  3491. 137.58 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3492. 137.59 s [vector] FalseListFirstMaxIndexWins: OK
  3493. 137.59 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  3494. 137.59 s [vector] []
  3495. 137.59 s [vector] mempty: OK
  3496. 137.59 s [vector] +++ OK, passed 100 tests.
  3497. 137.59 s [vector] mappend: OK
  3498. 137.59 s [vector] +++ OK, passed 100 tests.
  3499. 137.60 s [vector] mconcat: OK (0.01s)
  3500. 137.60 s [vector] +++ OK, passed 100 tests.
  3501. 137.60 s [vector] glength: OK
  3502. 137.60 s [vector] +++ OK, passed 100 tests.
  3503. 137.60 s [vector] sum: OK
  3504. 137.60 s [vector] +++ OK, passed 100 tests.
  3505. 137.60 s [vector] product: OK
  3506. 137.60 s [vector] +++ OK, passed 100 tests.
  3507. 137.60 s [vector] enumFromN: OK
  3508. 137.60 s [vector] +++ OK, passed 100 tests.
  3509. 137.60 s [vector] enumFromThenN: OK
  3510. 137.60 s [vector] +++ OK, passed 100 tests.
  3511. 137.60 s [vector] enumFromTo: OK
  3512. 137.60 s [vector] +++ OK, passed 100 tests.
  3513. 137.60 s [vector] enumFromThenTo: OK
  3514. 137.60 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3515. 137.60 s [vector] Data.Vector.Storable.Vector (Double)
  3516. 137.60 s [vector] fromList.toList == id: OK
  3517. 137.60 s [vector] +++ OK, passed 100 tests.
  3518. 137.60 s [vector] toList.fromList == id: OK
  3519. 137.60 s [vector] +++ OK, passed 100 tests.
  3520. 137.61 s [vector] unstream.stream == id: OK
  3521. 137.61 s [vector] +++ OK, passed 100 tests.
  3522. 137.61 s [vector] stream.unstream == id: OK
  3523. 137.61 s [vector] +++ OK, passed 100 tests.
  3524. 137.61 s [vector] eq: OK
  3525. 137.61 s [vector] +++ OK, passed 100 tests.
  3526. 137.61 s [vector] length: OK
  3527. 137.61 s [vector] +++ OK, passed 100 tests.
  3528. 137.61 s [vector] null: OK
  3529. 137.61 s [vector] +++ OK, passed 100 tests.
  3530. 137.61 s [vector] index: OK
  3531. 137.61 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3532. 137.61 s [vector] safeIndex: OK
  3533. 137.61 s [vector] +++ OK, passed 100 tests.
  3534. 137.61 s [vector] head: OK
  3535. 137.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3536. 137.61 s [vector] last: OK
  3537. 137.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3538. 137.61 s [vector] unsafeIndex: OK
  3539. 137.61 s [vector] +++ OK, passed 100 tests; 22 discarded.
  3540. 137.61 s [vector] unsafeHead: OK
  3541. 137.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3542. 137.61 s [vector] unsafeLast: OK
  3543. 137.61 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3544. 137.61 s [vector] slice: OK
  3545. 137.61 s [vector] +++ OK, passed 100 tests.
  3546. 137.61 s [vector] init: OK
  3547. 137.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3548. 137.62 s [vector] tail: OK
  3549. 137.62 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3550. 137.62 s [vector] take: OK
  3551. 137.62 s [vector] +++ OK, passed 100 tests.
  3552. 137.62 s [vector] drop: OK
  3553. 137.62 s [vector] +++ OK, passed 100 tests.
  3554. 137.62 s [vector] splitAt: OK
  3555. 137.62 s [vector] +++ OK, passed 100 tests.
  3556. 137.62 s [vector] empty: OK
  3557. 137.62 s [vector] +++ OK, passed 100 tests.
  3558. 137.62 s [vector] singleton: OK
  3559. 137.62 s [vector] +++ OK, passed 100 tests.
  3560. 137.62 s [vector] replicate: OK
  3561. 137.62 s [vector] +++ OK, passed 100 tests.
  3562. 137.62 s [vector] generate: OK
  3563. 137.62 s [vector] +++ OK, passed 100 tests.
  3564. 137.62 s [vector] iterateN: OK
  3565. 137.63 s [vector] +++ OK, passed 100 tests.
  3566. 137.67 s [vector] iterateNM: OK (0.04s)
  3567. 137.67 s [vector] +++ OK, passed 100 tests.
  3568. 137.69 s [vector] generateM: OK (0.03s)
  3569. 137.69 s [vector] +++ OK, passed 100 tests.
  3570. 137.70 s [vector] replicateM: OK
  3571. 137.70 s [vector] +++ OK, passed 100 tests.
  3572. 137.70 s [vector] create: OK
  3573. 137.70 s [vector] +++ OK, passed 100 tests.
  3574. 137.70 s [vector] createT: OK
  3575. 137.70 s [vector] +++ OK, passed 100 tests.
  3576. 137.70 s [vector] unfoldr: OK
  3577. 137.70 s [vector] +++ OK, passed 100 tests.
  3578. 137.70 s [vector] unfoldrN: OK
  3579. 137.71 s [vector] +++ OK, passed 100 tests.
  3580. 137.71 s [vector] unfoldrExactN: OK
  3581. 137.71 s [vector] +++ OK, passed 100 tests.
  3582. 137.71 s [vector] unfoldrM: OK
  3583. 137.71 s [vector] +++ OK, passed 100 tests.
  3584. 137.73 s [vector] unfoldrNM: OK (0.01s)
  3585. 137.73 s [vector] +++ OK, passed 100 tests.
  3586. 137.77 s [vector] unfoldrExactNM: OK (0.03s)
  3587. 137.77 s [vector] +++ OK, passed 100 tests.
  3588. 137.77 s [vector] constructN: OK (0.01s)
  3589. 137.77 s [vector] +++ OK, passed 100 tests.
  3590. 137.78 s [vector] constructrN: OK (0.01s)
  3591. 137.78 s [vector] +++ OK, passed 100 tests.
  3592. 137.78 s [vector] cons: OK
  3593. 137.78 s [vector] +++ OK, passed 100 tests.
  3594. 137.78 s [vector] snoc: OK
  3595. 137.78 s [vector] +++ OK, passed 100 tests.
  3596. 137.78 s [vector] append: OK
  3597. 137.78 s [vector] +++ OK, passed 100 tests.
  3598. 137.80 s [vector] concat: OK (0.02s)
  3599. 137.80 s [vector] +++ OK, passed 100 tests.
  3600. 137.80 s [vector] force: OK
  3601. 137.80 s [vector] +++ OK, passed 100 tests.
  3602. 137.81 s [vector] upd: OK
  3603. 137.81 s [vector] +++ OK, passed 100 tests.
  3604. 137.82 s [vector] accum: OK (0.01s)
  3605. 137.82 s [vector] +++ OK, passed 100 tests.
  3606. 137.82 s [vector] reverse: OK
  3607. 137.82 s [vector] +++ OK, passed 100 tests.
  3608. 137.82 s [vector] backpermute: OK
  3609. 137.82 s [vector] +++ OK, passed 100 tests.
  3610. 137.82 s [vector] map: OK
  3611. 137.83 s [vector] +++ OK, passed 100 tests.
  3612. 137.83 s [vector] imap: OK
  3613. 137.83 s [vector] +++ OK, passed 100 tests.
  3614. 137.84 s [vector] concatMap: OK
  3615. 137.84 s [vector] +++ OK, passed 100 tests.
  3616. 137.85 s [vector] mapM: OK
  3617. 137.85 s [vector] +++ OK, passed 100 tests.
  3618. 137.88 s [vector] mapM_: OK (0.03s)
  3619. 137.89 s [vector] +++ OK, passed 100 tests.
  3620. 137.89 s [vector] forM: OK
  3621. 137.89 s [vector] +++ OK, passed 100 tests.
  3622. 137.92 s [vector] forM_: OK (0.04s)
  3623. 137.92 s [vector] +++ OK, passed 100 tests.
  3624. 137.93 s [vector] imapM: OK
  3625. 137.93 s [vector] +++ OK, passed 100 tests.
  3626. 137.96 s [vector] imapM_: OK (0.03s)
  3627. 137.96 s [vector] +++ OK, passed 100 tests.
  3628. 137.97 s [vector] zipWith: OK
  3629. 137.97 s [vector] +++ OK, passed 100 tests.
  3630. 137.98 s [vector] zipWith3: OK
  3631. 137.98 s [vector] +++ OK, passed 100 tests.
  3632. 137.99 s [vector] izipWith: OK
  3633. 137.99 s [vector] +++ OK, passed 100 tests.
  3634. 137.99 s [vector] izipWith3: OK
  3635. 137.99 s [vector] +++ OK, passed 100 tests.
  3636. 138.00 s [vector] izipWithM: OK
  3637. 138.00 s [vector] +++ OK, passed 100 tests.
  3638. 138.03 s [vector] izipWithM_: OK (0.03s)
  3639. 138.03 s [vector] +++ OK, passed 100 tests.
  3640. 138.03 s [vector] zipWithM: OK
  3641. 138.03 s [vector] +++ OK, passed 100 tests.
  3642. 138.07 s [vector] zipWithM_: OK (0.03s)
  3643. 138.07 s [vector] +++ OK, passed 100 tests.
  3644. 138.07 s [vector] filter: OK
  3645. 138.07 s [vector] +++ OK, passed 100 tests.
  3646. 138.07 s [vector] ifilter: OK
  3647. 138.07 s [vector] +++ OK, passed 100 tests.
  3648. 138.11 s [vector] filterM: OK (0.02s)
  3649. 138.12 s [vector] +++ OK, passed 100 tests.
  3650. 138.12 s [vector] uniq: OK
  3651. 138.12 s [vector] +++ OK, passed 100 tests.
  3652. 138.13 s [vector] mapMaybe: OK
  3653. 138.13 s [vector] +++ OK, passed 100 tests.
  3654. 138.13 s [vector] imapMaybe: OK
  3655. 138.13 s [vector] +++ OK, passed 100 tests.
  3656. 138.13 s [vector] takeWhile: OK
  3657. 138.13 s [vector] +++ OK, passed 100 tests.
  3658. 138.13 s [vector] dropWhile: OK
  3659. 138.13 s [vector] +++ OK, passed 100 tests.
  3660. 138.15 s [vector] partition: OK (0.01s)
  3661. 138.15 s [vector] +++ OK, passed 100 tests.
  3662. 138.15 s [vector] partitionWith: OK
  3663. 138.15 s [vector] +++ OK, passed 100 tests.
  3664. 138.15 s [vector] span: OK
  3665. 138.15 s [vector] +++ OK, passed 100 tests.
  3666. 138.15 s [vector] break: OK
  3667. 138.15 s [vector] +++ OK, passed 100 tests.
  3668. 138.15 s [vector] spanR: OK
  3669. 138.15 s [vector] +++ OK, passed 100 tests.
  3670. 138.16 s [vector] breakR: OK
  3671. 138.16 s [vector] +++ OK, passed 100 tests.
  3672. 138.16 s [vector] groupBy: OK
  3673. 138.16 s [vector] +++ OK, passed 100 tests.
  3674. 138.16 s [vector] elem: OK
  3675. 138.16 s [vector] +++ OK, passed 100 tests.
  3676. 138.16 s [vector] notElem: OK
  3677. 138.16 s [vector] +++ OK, passed 100 tests.
  3678. 138.16 s [vector] find: OK
  3679. 138.16 s [vector] +++ OK, passed 100 tests.
  3680. 138.16 s [vector] findIndex: OK
  3681. 138.16 s [vector] +++ OK, passed 100 tests.
  3682. 138.17 s [vector] findIndexR: OK
  3683. 138.17 s [vector] +++ OK, passed 100 tests.
  3684. 138.17 s [vector] findIndices: OK
  3685. 138.17 s [vector] +++ OK, passed 100 tests.
  3686. 138.17 s [vector] elemIndex: OK
  3687. 138.17 s [vector] +++ OK, passed 100 tests.
  3688. 138.18 s [vector] elemIndices: OK
  3689. 138.18 s [vector] +++ OK, passed 100 tests.
  3690. 138.19 s [vector] foldl: OK (0.01s)
  3691. 138.19 s [vector] +++ OK, passed 100 tests.
  3692. 138.20 s [vector] foldl1: OK (0.01s)
  3693. 138.20 s [vector] +++ OK, passed 100 tests; 19 discarded.
  3694. 138.21 s [vector] foldl': OK (0.01s)
  3695. 138.21 s [vector] +++ OK, passed 100 tests.
  3696. 138.22 s [vector] foldl1': OK (0.01s)
  3697. 138.22 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3698. 138.23 s [vector] foldr: OK (0.01s)
  3699. 138.23 s [vector] +++ OK, passed 100 tests.
  3700. 138.25 s [vector] foldr1: OK
  3701. 138.25 s [vector] +++ OK, passed 100 tests; 16 discarded.
  3702. 138.25 s [vector] foldr': OK (0.01s)
  3703. 138.25 s [vector] +++ OK, passed 100 tests.
  3704. 138.27 s [vector] foldr1': OK (0.01s)
  3705. 138.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3706. 138.27 s [vector] ifoldl: OK (0.01s)
  3707. 138.27 s [vector] +++ OK, passed 100 tests.
  3708. 138.29 s [vector] ifoldl': OK (0.01s)
  3709. 138.29 s [vector] +++ OK, passed 100 tests.
  3710. 138.30 s [vector] ifoldr: OK (0.01s)
  3711. 138.31 s [vector] +++ OK, passed 100 tests.
  3712. 138.31 s [vector] ifoldr': OK (0.01s)
  3713. 138.31 s [vector] +++ OK, passed 100 tests.
  3714. 138.33 s [vector] ifoldM: OK (0.01s)
  3715. 138.33 s [vector] +++ OK, passed 100 tests.
  3716. 138.33 s [vector] ifoldM': OK (0.01s)
  3717. 138.33 s [vector] +++ OK, passed 100 tests.
  3718. 138.36 s [vector] ifoldM_: OK (0.04s)
  3719. 138.36 s [vector] +++ OK, passed 100 tests.
  3720. 138.40 s [vector] ifoldM'_: OK (0.02s)
  3721. 138.40 s [vector] +++ OK, passed 100 tests.
  3722. 138.40 s [vector] all: OK
  3723. 138.40 s [vector] +++ OK, passed 100 tests.
  3724. 138.40 s [vector] any: OK
  3725. 138.41 s [vector] +++ OK, passed 100 tests.
  3726. 138.41 s [vector] prescanl: OK (0.01s)
  3727. 138.41 s [vector] +++ OK, passed 100 tests.
  3728. 138.43 s [vector] prescanl': OK (0.01s)
  3729. 138.43 s [vector] +++ OK, passed 100 tests.
  3730. 138.43 s [vector] postscanl: OK (0.01s)
  3731. 138.43 s [vector] +++ OK, passed 100 tests.
  3732. 138.45 s [vector] postscanl': OK (0.01s)
  3733. 138.45 s [vector] +++ OK, passed 100 tests.
  3734. 138.46 s [vector] scanl: OK (0.01s)
  3735. 138.47 s [vector] +++ OK, passed 100 tests.
  3736. 138.47 s [vector] scanl': OK (0.01s)
  3737. 138.47 s [vector] +++ OK, passed 100 tests.
  3738. 138.48 s [vector] scanl1: OK (0.01s)
  3739. 138.49 s [vector] +++ OK, passed 100 tests.
  3740. 138.49 s [vector] scanl1': OK (0.01s)
  3741. 138.49 s [vector] +++ OK, passed 100 tests.
  3742. 138.51 s [vector] iscanl: OK (0.01s)
  3743. 138.51 s [vector] +++ OK, passed 100 tests.
  3744. 138.51 s [vector] iscanl': OK (0.01s)
  3745. 138.51 s [vector] +++ OK, passed 100 tests.
  3746. 138.53 s [vector] prescanr: OK (0.01s)
  3747. 138.53 s [vector] +++ OK, passed 100 tests.
  3748. 138.53 s [vector] prescanr': OK
  3749. 138.53 s [vector] +++ OK, passed 100 tests.
  3750. 138.55 s [vector] postscanr: OK (0.01s)
  3751. 138.55 s [vector] +++ OK, passed 100 tests.
  3752. 138.55 s [vector] postscanr': OK (0.01s)
  3753. 138.55 s [vector] +++ OK, passed 100 tests.
  3754. 138.57 s [vector] scanr: OK (0.01s)
  3755. 138.57 s [vector] +++ OK, passed 100 tests.
  3756. 138.57 s [vector] scanr': OK
  3757. 138.57 s [vector] +++ OK, passed 100 tests.
  3758. 138.59 s [vector] scanr1: OK (0.01s)
  3759. 138.59 s [vector] +++ OK, passed 100 tests.
  3760. 138.60 s [vector] scanr1': OK (0.01s)
  3761. 138.60 s [vector] +++ OK, passed 100 tests.
  3762. 138.61 s [vector] iscanr: OK (0.01s)
  3763. 138.61 s [vector] +++ OK, passed 100 tests.
  3764. 138.61 s [vector] iscanr': OK (0.01s)
  3765. 138.61 s [vector] +++ OK, passed 100 tests.
  3766. 138.61 s [vector] mut_read: OK
  3767. 138.61 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3768. 138.62 s [vector] mut_write: OK
  3769. 138.62 s [vector] +++ OK, passed 100 tests; 12 discarded.
  3770. 138.62 s [vector] mut_modify: OK
  3771. 138.62 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3772. 138.63 s [vector] mut_generate: OK
  3773. 138.63 s [vector] +++ OK, passed 100 tests.
  3774. 138.65 s [vector] mut_generateM: OK (0.02s)
  3775. 138.65 s [vector] +++ OK, passed 100 tests.
  3776. 138.69 s [vector] mut_mapM_: OK (0.03s)
  3777. 138.69 s [vector] +++ OK, passed 100 tests.
  3778. 138.71 s [vector] mut_imapM_: OK (0.03s)
  3779. 138.71 s [vector] +++ OK, passed 100 tests.
  3780. 138.75 s [vector] mut_forM_: OK (0.03s)
  3781. 138.75 s [vector] +++ OK, passed 100 tests.
  3782. 138.77 s [vector] mut_iforM_: OK (0.03s)
  3783. 138.77 s [vector] +++ OK, passed 100 tests.
  3784. 138.79 s [vector] mut_foldr: OK (0.01s)
  3785. 138.79 s [vector] +++ OK, passed 100 tests.
  3786. 138.79 s [vector] mut_foldr': OK (0.01s)
  3787. 138.79 s [vector] +++ OK, passed 100 tests.
  3788. 138.79 s [vector] mut_foldl: OK
  3789. 138.79 s [vector] +++ OK, passed 100 tests.
  3790. 138.81 s [vector] mut_foldl': OK (0.01s)
  3791. 138.81 s [vector] +++ OK, passed 100 tests.
  3792. 138.82 s [vector] mut_ifoldr: OK (0.01s)
  3793. 138.82 s [vector] +++ OK, passed 100 tests.
  3794. 138.83 s [vector] mut_ifoldr': OK
  3795. 138.83 s [vector] +++ OK, passed 100 tests.
  3796. 138.85 s [vector] mut_ifoldl: OK (0.01s)
  3797. 138.85 s [vector] +++ OK, passed 100 tests.
  3798. 138.85 s [vector] mut_ifoldl': OK (0.01s)
  3799. 138.85 s [vector] +++ OK, passed 100 tests.
  3800. 138.87 s [vector] mut_foldM: OK (0.01s)
  3801. 138.87 s [vector] +++ OK, passed 100 tests.
  3802. 138.88 s [vector] mut_foldM': OK (0.01s)
  3803. 138.88 s [vector] +++ OK, passed 100 tests.
  3804. 138.88 s [vector] mut_foldrM: OK (0.01s)
  3805. 138.88 s [vector] +++ OK, passed 100 tests.
  3806. 138.91 s [vector] mut_foldrM': OK (0.01s)
  3807. 138.91 s [vector] +++ OK, passed 100 tests.
  3808. 138.91 s [vector] mut_ifoldM: OK (0.01s)
  3809. 138.91 s [vector] +++ OK, passed 100 tests.
  3810. 138.93 s [vector] mut_ifoldM': OK (0.01s)
  3811. 138.93 s [vector] +++ OK, passed 100 tests.
  3812. 138.94 s [vector] mut_ifoldrM: OK (0.01s)
  3813. 138.94 s [vector] +++ OK, passed 100 tests.
  3814. 138.94 s [vector] mut_ifoldrM': OK (0.01s)
  3815. 138.94 s [vector] +++ OK, passed 100 tests.
  3816. 138.94 s [vector] compare: OK
  3817. 138.94 s [vector] +++ OK, passed 100 tests.
  3818. 138.94 s [vector] maximum: OK
  3819. 138.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3820. 138.95 s [vector] minimum: OK
  3821. 138.95 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3822. 138.95 s [vector] minIndex: OK
  3823. 138.95 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3824. 138.95 s [vector] maxIndex: OK
  3825. 138.95 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3826. 138.95 s [vector] maximumBy: OK
  3827. 138.95 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3828. 138.95 s [vector] minimumBy: OK
  3829. 138.95 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3830. 138.95 s [vector] maximumOn: OK
  3831. 138.95 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3832. 138.95 s [vector] minimumOn: OK
  3833. 138.95 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3834. 138.95 s [vector] maxIndexBy: OK
  3835. 138.95 s [vector] +++ OK, passed 100 tests; 13 discarded.
  3836. 138.95 s [vector] minIndexBy: OK
  3837. 138.95 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3838. 138.95 s [vector] ListFirstMaxIndexWins: OK
  3839. 138.96 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3840. 138.96 s [vector] FalseListFirstMaxIndexWins: OK
  3841. 138.96 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  3842. 138.96 s [vector] []
  3843. 138.97 s [vector] mempty: OK
  3844. 138.97 s [vector] +++ OK, passed 100 tests.
  3845. 138.97 s [vector] mappend: OK
  3846. 138.97 s [vector] +++ OK, passed 100 tests.
  3847. 138.98 s [vector] mconcat: OK (0.02s)
  3848. 138.98 s [vector] +++ OK, passed 100 tests.
  3849. 138.98 s [vector] glength: OK
  3850. 138.98 s [vector] +++ OK, passed 100 tests.
  3851. 138.98 s [vector] sum: OK
  3852. 138.98 s [vector] +++ OK, passed 100 tests.
  3853. 138.98 s [vector] product: OK
  3854. 138.98 s [vector] +++ OK, passed 100 tests.
  3855. 138.98 s [vector] enumFromN: OK
  3856. 138.98 s [vector] +++ OK, passed 100 tests.
  3857. 138.98 s [vector] enumFromThenN: OK
  3858. 138.98 s [vector] +++ OK, passed 100 tests.
  3859. 138.98 s [vector] enumFromTo: OK
  3860. 138.98 s [vector] +++ OK, passed 100 tests.
  3861. 138.98 s [vector] enumFromThenTo: OK
  3862. 138.98 s [vector] +++ OK, passed 100 tests; 10 discarded.
  3863. 138.98 s [vector] unstream
  3864. 138.98 s [vector] unstream == vunstream (exact): OK
  3865. 138.98 s [vector] +++ OK, passed 100 tests.
  3866. 138.98 s [vector] unstream == vunstream (unknown): OK
  3867. 138.99 s [vector] +++ OK, passed 100 tests.
  3868. 138.99 s [vector] unstreamR ~= vunstream (exact): OK
  3869. 138.99 s [vector] +++ OK, passed 100 tests.
  3870. 138.99 s [vector] unstreamR ~= vunstream (unknown): OK
  3871. 138.99 s [vector] +++ OK, passed 100 tests.
  3872. 138.99 s [vector] Tests.Vector.Strict
  3873. 138.99 s [vector] Bool
  3874. 138.99 s [vector] fromList.toList == id: OK
  3875. 138.99 s [vector] +++ OK, passed 100 tests.
  3876. 138.99 s [vector] toList.fromList == id: OK
  3877. 138.99 s [vector] +++ OK, passed 100 tests.
  3878. 138.99 s [vector] unstream.stream == id: OK
  3879. 138.99 s [vector] +++ OK, passed 100 tests.
  3880. 138.99 s [vector] stream.unstream == id: OK
  3881. 138.99 s [vector] +++ OK, passed 100 tests.
  3882. 138.99 s [vector] eq: OK
  3883. 138.99 s [vector] +++ OK, passed 100 tests.
  3884. 138.99 s [vector] length: OK
  3885. 138.99 s [vector] +++ OK, passed 100 tests.
  3886. 138.99 s [vector] null: OK
  3887. 138.99 s [vector] +++ OK, passed 100 tests.
  3888. 138.99 s [vector] index: OK
  3889. 138.99 s [vector] +++ OK, passed 100 tests; 18 discarded.
  3890. 138.99 s [vector] safeIndex: OK
  3891. 138.99 s [vector] +++ OK, passed 100 tests.
  3892. 138.99 s [vector] head: OK
  3893. 138.99 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3894. 138.99 s [vector] last: OK
  3895. 138.99 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3896. 138.99 s [vector] unsafeIndex: OK
  3897. 138.99 s [vector] +++ OK, passed 100 tests; 14 discarded.
  3898. 138.99 s [vector] unsafeHead: OK
  3899. 138.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  3900. 138.99 s [vector] unsafeLast: OK
  3901. 138.99 s [vector] +++ OK, passed 100 tests; 11 discarded.
  3902. 138.99 s [vector] slice: OK
  3903. 138.99 s [vector] +++ OK, passed 100 tests.
  3904. 138.99 s [vector] init: OK
  3905. 138.99 s [vector] +++ OK, passed 100 tests; 17 discarded.
  3906. 138.99 s [vector] tail: OK
  3907. 138.99 s [vector] +++ OK, passed 100 tests; 20 discarded.
  3908. 138.99 s [vector] take: OK
  3909. 138.99 s [vector] +++ OK, passed 100 tests.
  3910. 138.99 s [vector] drop: OK
  3911. 139.00 s [vector] +++ OK, passed 100 tests.
  3912. 139.00 s [vector] splitAt: OK
  3913. 139.00 s [vector] +++ OK, passed 100 tests.
  3914. 139.00 s [vector] empty: OK
  3915. 139.00 s [vector] +++ OK, passed 100 tests.
  3916. 139.00 s [vector] singleton: OK
  3917. 139.00 s [vector] +++ OK, passed 100 tests.
  3918. 139.00 s [vector] replicate: OK
  3919. 139.00 s [vector] +++ OK, passed 100 tests.
  3920. 139.00 s [vector] generate: OK
  3921. 139.00 s [vector] +++ OK, passed 100 tests.
  3922. 139.00 s [vector] iterateN: OK
  3923. 139.01 s [vector] +++ OK, passed 100 tests.
  3924. 139.03 s [vector] iterateNM: OK (0.03s)
  3925. 139.03 s [vector] +++ OK, passed 100 tests.
  3926. 139.05 s [vector] generateM: OK (0.02s)
  3927. 139.05 s [vector] +++ OK, passed 100 tests.
  3928. 139.05 s [vector] replicateM: OK
  3929. 139.05 s [vector] +++ OK, passed 100 tests.
  3930. 139.05 s [vector] create: OK
  3931. 139.05 s [vector] +++ OK, passed 100 tests.
  3932. 139.05 s [vector] createT: OK
  3933. 139.05 s [vector] +++ OK, passed 100 tests.
  3934. 139.05 s [vector] unfoldr: OK
  3935. 139.05 s [vector] +++ OK, passed 100 tests.
  3936. 139.05 s [vector] unfoldrN: OK
  3937. 139.05 s [vector] +++ OK, passed 100 tests.
  3938. 139.05 s [vector] unfoldrExactN: OK
  3939. 139.05 s [vector] +++ OK, passed 100 tests.
  3940. 139.06 s [vector] unfoldrM: OK
  3941. 139.06 s [vector] +++ OK, passed 100 tests.
  3942. 139.07 s [vector] unfoldrNM: OK
  3943. 139.07 s [vector] +++ OK, passed 100 tests.
  3944. 139.10 s [vector] unfoldrExactNM: OK (0.04s)
  3945. 139.10 s [vector] +++ OK, passed 100 tests.
  3946. 139.10 s [vector] constructN: OK
  3947. 139.10 s [vector] +++ OK, passed 100 tests.
  3948. 139.10 s [vector] constructrN: OK
  3949. 139.10 s [vector] +++ OK, passed 100 tests.
  3950. 139.10 s [vector] cons: OK
  3951. 139.10 s [vector] +++ OK, passed 100 tests.
  3952. 139.10 s [vector] snoc: OK
  3953. 139.10 s [vector] +++ OK, passed 100 tests.
  3954. 139.10 s [vector] append: OK
  3955. 139.11 s [vector] +++ OK, passed 100 tests.
  3956. 139.11 s [vector] concat: OK
  3957. 139.11 s [vector] +++ OK, passed 100 tests.
  3958. 139.11 s [vector] force: OK
  3959. 139.11 s [vector] +++ OK, passed 100 tests.
  3960. 139.11 s [vector] upd: OK
  3961. 139.11 s [vector] +++ OK, passed 100 tests.
  3962. 139.11 s [vector] accum: OK
  3963. 139.11 s [vector] +++ OK, passed 100 tests.
  3964. 139.11 s [vector] reverse: OK
  3965. 139.11 s [vector] +++ OK, passed 100 tests.
  3966. 139.12 s [vector] backpermute: OK
  3967. 139.12 s [vector] +++ OK, passed 100 tests.
  3968. 139.12 s [vector] map: OK
  3969. 139.12 s [vector] +++ OK, passed 100 tests.
  3970. 139.12 s [vector] imap: OK
  3971. 139.12 s [vector] +++ OK, passed 100 tests.
  3972. 139.12 s [vector] concatMap: OK
  3973. 139.12 s [vector] +++ OK, passed 100 tests.
  3974. 139.12 s [vector] mapM: OK
  3975. 139.12 s [vector] +++ OK, passed 100 tests.
  3976. 139.13 s [vector] mapM_: OK (0.01s)
  3977. 139.13 s [vector] +++ OK, passed 100 tests.
  3978. 139.13 s [vector] forM: OK
  3979. 139.14 s [vector] +++ OK, passed 100 tests.
  3980. 139.15 s [vector] forM_: OK (0.01s)
  3981. 139.15 s [vector] +++ OK, passed 100 tests.
  3982. 139.15 s [vector] imapM: OK
  3983. 139.15 s [vector] +++ OK, passed 100 tests.
  3984. 139.16 s [vector] imapM_: OK (0.01s)
  3985. 139.16 s [vector] +++ OK, passed 100 tests.
  3986. 139.16 s [vector] zipWith: OK
  3987. 139.16 s [vector] +++ OK, passed 100 tests.
  3988. 139.16 s [vector] zipWith3: OK
  3989. 139.16 s [vector] +++ OK, passed 100 tests.
  3990. 139.17 s [vector] izipWith: OK
  3991. 139.17 s [vector] +++ OK, passed 100 tests.
  3992. 139.17 s [vector] izipWith3: OK
  3993. 139.17 s [vector] +++ OK, passed 100 tests.
  3994. 139.17 s [vector] izipWithM: OK
  3995. 139.17 s [vector] +++ OK, passed 100 tests.
  3996. 139.18 s [vector] izipWithM_: OK
  3997. 139.18 s [vector] +++ OK, passed 100 tests.
  3998. 139.18 s [vector] zipWithM: OK
  3999. 139.19 s [vector] +++ OK, passed 100 tests.
  4000. 139.19 s [vector] zipWithM_: OK
  4001. 139.19 s [vector] +++ OK, passed 100 tests.
  4002. 139.19 s [vector] filter: OK
  4003. 139.19 s [vector] +++ OK, passed 100 tests.
  4004. 139.19 s [vector] ifilter: OK
  4005. 139.19 s [vector] +++ OK, passed 100 tests.
  4006. 139.21 s [vector] filterM: OK (0.02s)
  4007. 139.21 s [vector] +++ OK, passed 100 tests.
  4008. 139.21 s [vector] uniq: OK
  4009. 139.21 s [vector] +++ OK, passed 100 tests.
  4010. 139.21 s [vector] mapMaybe: OK
  4011. 139.21 s [vector] +++ OK, passed 100 tests.
  4012. 139.21 s [vector] imapMaybe: OK
  4013. 139.22 s [vector] +++ OK, passed 100 tests.
  4014. 139.22 s [vector] takeWhile: OK
  4015. 139.22 s [vector] +++ OK, passed 100 tests.
  4016. 139.22 s [vector] dropWhile: OK
  4017. 139.22 s [vector] +++ OK, passed 100 tests.
  4018. 139.22 s [vector] partition: OK
  4019. 139.22 s [vector] +++ OK, passed 100 tests.
  4020. 139.22 s [vector] partitionWith: OK
  4021. 139.22 s [vector] +++ OK, passed 100 tests.
  4022. 139.22 s [vector] span: OK
  4023. 139.22 s [vector] +++ OK, passed 100 tests.
  4024. 139.22 s [vector] break: OK
  4025. 139.22 s [vector] +++ OK, passed 100 tests.
  4026. 139.22 s [vector] spanR: OK
  4027. 139.22 s [vector] +++ OK, passed 100 tests.
  4028. 139.22 s [vector] breakR: OK
  4029. 139.22 s [vector] +++ OK, passed 100 tests.
  4030. 139.22 s [vector] groupBy: OK
  4031. 139.22 s [vector] +++ OK, passed 100 tests.
  4032. 139.22 s [vector] elem: OK
  4033. 139.22 s [vector] +++ OK, passed 100 tests.
  4034. 139.22 s [vector] notElem: OK
  4035. 139.22 s [vector] +++ OK, passed 100 tests.
  4036. 139.22 s [vector] find: OK
  4037. 139.22 s [vector] +++ OK, passed 100 tests.
  4038. 139.22 s [vector] findIndex: OK
  4039. 139.22 s [vector] +++ OK, passed 100 tests.
  4040. 139.22 s [vector] findIndexR: OK
  4041. 139.22 s [vector] +++ OK, passed 100 tests.
  4042. 139.22 s [vector] findIndices: OK
  4043. 139.22 s [vector] +++ OK, passed 100 tests.
  4044. 139.23 s [vector] elemIndex: OK
  4045. 139.23 s [vector] +++ OK, passed 100 tests.
  4046. 139.23 s [vector] elemIndices: OK
  4047. 139.23 s [vector] +++ OK, passed 100 tests.
  4048. 139.23 s [vector] foldl: OK
  4049. 139.23 s [vector] +++ OK, passed 100 tests.
  4050. 139.23 s [vector] foldl1: OK
  4051. 139.23 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4052. 139.23 s [vector] foldl': OK
  4053. 139.23 s [vector] +++ OK, passed 100 tests.
  4054. 139.23 s [vector] foldl1': OK
  4055. 139.23 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4056. 139.23 s [vector] foldr: OK
  4057. 139.23 s [vector] +++ OK, passed 100 tests.
  4058. 139.23 s [vector] foldr1: OK
  4059. 139.23 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4060. 139.23 s [vector] foldr': OK
  4061. 139.23 s [vector] +++ OK, passed 100 tests.
  4062. 139.24 s [vector] foldr1': OK
  4063. 139.24 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4064. 139.24 s [vector] ifoldl: OK
  4065. 139.24 s [vector] +++ OK, passed 100 tests.
  4066. 139.24 s [vector] ifoldl': OK
  4067. 139.24 s [vector] +++ OK, passed 100 tests.
  4068. 139.24 s [vector] ifoldr: OK
  4069. 139.24 s [vector] +++ OK, passed 100 tests.
  4070. 139.25 s [vector] ifoldr': OK
  4071. 139.25 s [vector] +++ OK, passed 100 tests.
  4072. 139.25 s [vector] ifoldM: OK
  4073. 139.25 s [vector] +++ OK, passed 100 tests.
  4074. 139.25 s [vector] ifoldM': OK
  4075. 139.25 s [vector] +++ OK, passed 100 tests.
  4076. 139.27 s [vector] ifoldM_: OK (0.01s)
  4077. 139.27 s [vector] +++ OK, passed 100 tests.
  4078. 139.27 s [vector] ifoldM'_: OK (0.01s)
  4079. 139.28 s [vector] +++ OK, passed 100 tests.
  4080. 139.28 s [vector] all: OK
  4081. 139.28 s [vector] +++ OK, passed 100 tests.
  4082. 139.28 s [vector] any: OK
  4083. 139.28 s [vector] +++ OK, passed 100 tests.
  4084. 139.28 s [vector] prescanl: OK
  4085. 139.28 s [vector] +++ OK, passed 100 tests.
  4086. 139.28 s [vector] prescanl': OK
  4087. 139.28 s [vector] +++ OK, passed 100 tests.
  4088. 139.28 s [vector] postscanl: OK
  4089. 139.28 s [vector] +++ OK, passed 100 tests.
  4090. 139.28 s [vector] postscanl': OK
  4091. 139.28 s [vector] +++ OK, passed 100 tests.
  4092. 139.28 s [vector] scanl: OK
  4093. 139.28 s [vector] +++ OK, passed 100 tests.
  4094. 139.28 s [vector] scanl': OK
  4095. 139.28 s [vector] +++ OK, passed 100 tests.
  4096. 139.29 s [vector] scanl1: OK
  4097. 139.29 s [vector] +++ OK, passed 100 tests.
  4098. 139.29 s [vector] scanl1': OK
  4099. 139.29 s [vector] +++ OK, passed 100 tests.
  4100. 139.29 s [vector] iscanl: OK
  4101. 139.29 s [vector] +++ OK, passed 100 tests.
  4102. 139.29 s [vector] iscanl': OK
  4103. 139.29 s [vector] +++ OK, passed 100 tests.
  4104. 139.29 s [vector] prescanr: OK
  4105. 139.30 s [vector] +++ OK, passed 100 tests.
  4106. 139.30 s [vector] prescanr': OK
  4107. 139.30 s [vector] +++ OK, passed 100 tests.
  4108. 139.30 s [vector] postscanr: OK
  4109. 139.30 s [vector] +++ OK, passed 100 tests.
  4110. 139.30 s [vector] postscanr': OK
  4111. 139.30 s [vector] +++ OK, passed 100 tests.
  4112. 139.30 s [vector] scanr: OK
  4113. 139.30 s [vector] +++ OK, passed 100 tests.
  4114. 139.30 s [vector] scanr': OK
  4115. 139.30 s [vector] +++ OK, passed 100 tests.
  4116. 139.30 s [vector] scanr1: OK
  4117. 139.30 s [vector] +++ OK, passed 100 tests.
  4118. 139.30 s [vector] scanr1': OK
  4119. 139.30 s [vector] +++ OK, passed 100 tests.
  4120. 139.31 s [vector] iscanr: OK
  4121. 139.31 s [vector] +++ OK, passed 100 tests.
  4122. 139.31 s [vector] iscanr': OK
  4123. 139.31 s [vector] +++ OK, passed 100 tests.
  4124. 139.31 s [vector] mut_read: OK
  4125. 139.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4126. 139.31 s [vector] mut_write: OK
  4127. 139.31 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4128. 139.31 s [vector] mut_modify: OK
  4129. 139.31 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4130. 139.31 s [vector] mut_generate: OK
  4131. 139.31 s [vector] +++ OK, passed 100 tests.
  4132. 139.33 s [vector] mut_generateM: OK
  4133. 139.33 s [vector] +++ OK, passed 100 tests.
  4134. 139.33 s [vector] mut_mapM_: OK (0.01s)
  4135. 139.33 s [vector] +++ OK, passed 100 tests.
  4136. 139.34 s [vector] mut_imapM_: OK
  4137. 139.34 s [vector] +++ OK, passed 100 tests.
  4138. 139.36 s [vector] mut_forM_: OK (0.01s)
  4139. 139.36 s [vector] +++ OK, passed 100 tests.
  4140. 139.36 s [vector] mut_iforM_: OK (0.01s)
  4141. 139.36 s [vector] +++ OK, passed 100 tests.
  4142. 139.36 s [vector] mut_foldr: OK
  4143. 139.37 s [vector] +++ OK, passed 100 tests.
  4144. 139.37 s [vector] mut_foldr': OK
  4145. 139.37 s [vector] +++ OK, passed 100 tests.
  4146. 139.37 s [vector] mut_foldl: OK
  4147. 139.37 s [vector] +++ OK, passed 100 tests.
  4148. 139.37 s [vector] mut_foldl': OK
  4149. 139.37 s [vector] +++ OK, passed 100 tests.
  4150. 139.37 s [vector] mut_ifoldr: OK
  4151. 139.37 s [vector] +++ OK, passed 100 tests.
  4152. 139.37 s [vector] mut_ifoldr': OK
  4153. 139.38 s [vector] +++ OK, passed 100 tests.
  4154. 139.38 s [vector] mut_ifoldl: OK
  4155. 139.38 s [vector] +++ OK, passed 100 tests.
  4156. 139.38 s [vector] mut_ifoldl': OK
  4157. 139.38 s [vector] +++ OK, passed 100 tests.
  4158. 139.38 s [vector] mut_foldM: OK
  4159. 139.38 s [vector] +++ OK, passed 100 tests.
  4160. 139.38 s [vector] mut_foldM': OK
  4161. 139.38 s [vector] +++ OK, passed 100 tests.
  4162. 139.38 s [vector] mut_foldrM: OK
  4163. 139.38 s [vector] +++ OK, passed 100 tests.
  4164. 139.38 s [vector] mut_foldrM': OK
  4165. 139.39 s [vector] +++ OK, passed 100 tests.
  4166. 139.39 s [vector] mut_ifoldM: OK
  4167. 139.39 s [vector] +++ OK, passed 100 tests.
  4168. 139.39 s [vector] mut_ifoldM': OK
  4169. 139.39 s [vector] +++ OK, passed 100 tests.
  4170. 139.39 s [vector] mut_ifoldrM: OK
  4171. 139.39 s [vector] +++ OK, passed 100 tests.
  4172. 139.39 s [vector] mut_ifoldrM': OK
  4173. 139.39 s [vector] +++ OK, passed 100 tests.
  4174. 139.39 s [vector] compare: OK
  4175. 139.39 s [vector] +++ OK, passed 100 tests.
  4176. 139.39 s [vector] maximum: OK
  4177. 139.40 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4178. 139.40 s [vector] minimum: OK
  4179. 139.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4180. 139.40 s [vector] minIndex: OK
  4181. 139.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4182. 139.40 s [vector] maxIndex: OK
  4183. 139.40 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4184. 139.40 s [vector] maximumBy: OK
  4185. 139.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4186. 139.40 s [vector] minimumBy: OK
  4187. 139.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4188. 139.40 s [vector] maximumOn: OK
  4189. 139.40 s [vector] +++ OK, passed 100 tests; 22 discarded.
  4190. 139.40 s [vector] minimumOn: OK
  4191. 139.40 s [vector] +++ OK, passed 100 tests; 23 discarded.
  4192. 139.40 s [vector] maxIndexBy: OK
  4193. 139.40 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4194. 139.40 s [vector] minIndexBy: OK
  4195. 139.40 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4196. 139.40 s [vector] ListFirstMaxIndexWins: OK
  4197. 139.40 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4198. 139.40 s [vector] FalseListFirstMaxIndexWins: OK
  4199. 139.40 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  4200. 139.40 s [vector] []
  4201. 139.40 s [vector] zip: OK
  4202. 139.40 s [vector] +++ OK, passed 100 tests.
  4203. 139.40 s [vector] zip3: OK
  4204. 139.40 s [vector] +++ OK, passed 100 tests.
  4205. 139.40 s [vector] unzip: OK
  4206. 139.40 s [vector] +++ OK, passed 100 tests.
  4207. 139.40 s [vector] unzip3: OK
  4208. 139.40 s [vector] +++ OK, passed 100 tests.
  4209. 139.40 s [vector] indexed: OK
  4210. 139.40 s [vector] +++ OK, passed 100 tests.
  4211. 139.41 s [vector] update: OK
  4212. 139.41 s [vector] +++ OK, passed 100 tests.
  4213. 139.41 s [vector] concat: OK
  4214. 139.41 s [vector] +++ OK, passed 100 tests.
  4215. 139.41 s [vector] mempty: OK
  4216. 139.42 s [vector] +++ OK, passed 100 tests.
  4217. 139.42 s [vector] mappend: OK
  4218. 139.42 s [vector] +++ OK, passed 100 tests.
  4219. 139.42 s [vector] mconcat: OK
  4220. 139.42 s [vector] +++ OK, passed 100 tests.
  4221. 139.42 s [vector] fmap: OK
  4222. 139.43 s [vector] +++ OK, passed 100 tests.
  4223. 139.43 s [vector] return: OK
  4224. 139.43 s [vector] +++ OK, passed 100 tests.
  4225. 139.43 s [vector] bind: OK (0.01s)
  4226. 139.43 s [vector] +++ OK, passed 100 tests.
  4227. 139.43 s [vector] mzip: OK
  4228. 139.43 s [vector] +++ OK, passed 100 tests.
  4229. 139.44 s [vector] munzip: OK
  4230. 139.44 s [vector] +++ OK, passed 100 tests.
  4231. 139.45 s [vector] applicative_pure: OK
  4232. 139.45 s [vector] +++ OK, passed 100 tests.
  4233. 139.45 s [vector] applicative_appl: OK (0.02s)
  4234. 139.45 s [vector] +++ OK, passed 100 tests.
  4235. 139.45 s [vector] alternative_empty: OK
  4236. 139.45 s [vector] +++ OK, passed 100 tests.
  4237. 139.45 s [vector] alternative_or: OK
  4238. 139.47 s [vector] +++ OK, passed 100 tests.
  4239. 139.48 s [vector] sequence: OK (0.03s)
  4240. 139.48 s [vector] +++ OK, passed 100 tests.
  4241. 139.49 s [vector] sequence_: OK
  4242. 139.49 s [vector] +++ OK, passed 100 tests.
  4243. 139.50 s [vector] glength: OK
  4244. 139.50 s [vector] +++ OK, passed 100 tests.
  4245. 139.50 s [vector] and: OK
  4246. 139.50 s [vector] +++ OK, passed 100 tests.
  4247. 139.50 s [vector] or: OK
  4248. 139.50 s [vector] +++ OK, passed 100 tests.
  4249. 139.50 s [vector] Int
  4250. 139.50 s [vector] fromList.toList == id: OK
  4251. 139.50 s [vector] +++ OK, passed 100 tests.
  4252. 139.50 s [vector] toList.fromList == id: OK
  4253. 139.50 s [vector] +++ OK, passed 100 tests.
  4254. 139.50 s [vector] unstream.stream == id: OK
  4255. 139.50 s [vector] +++ OK, passed 100 tests.
  4256. 139.50 s [vector] stream.unstream == id: OK
  4257. 139.50 s [vector] +++ OK, passed 100 tests.
  4258. 139.50 s [vector] eq: OK
  4259. 139.50 s [vector] +++ OK, passed 100 tests.
  4260. 139.50 s [vector] length: OK
  4261. 139.50 s [vector] +++ OK, passed 100 tests.
  4262. 139.50 s [vector] null: OK
  4263. 139.50 s [vector] +++ OK, passed 100 tests.
  4264. 139.50 s [vector] index: OK
  4265. 139.50 s [vector] +++ OK, passed 100 tests; 20 discarded.
  4266. 139.50 s [vector] safeIndex: OK
  4267. 139.50 s [vector] +++ OK, passed 100 tests.
  4268. 139.50 s [vector] head: OK
  4269. 139.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4270. 139.50 s [vector] last: OK
  4271. 139.50 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4272. 139.50 s [vector] unsafeIndex: OK
  4273. 139.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4274. 139.50 s [vector] unsafeHead: OK
  4275. 139.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4276. 139.50 s [vector] unsafeLast: OK
  4277. 139.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4278. 139.50 s [vector] slice: OK
  4279. 139.50 s [vector] +++ OK, passed 100 tests.
  4280. 139.50 s [vector] init: OK
  4281. 139.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4282. 139.50 s [vector] tail: OK
  4283. 139.50 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4284. 139.50 s [vector] take: OK
  4285. 139.50 s [vector] +++ OK, passed 100 tests.
  4286. 139.50 s [vector] drop: OK
  4287. 139.50 s [vector] +++ OK, passed 100 tests.
  4288. 139.50 s [vector] splitAt: OK
  4289. 139.50 s [vector] +++ OK, passed 100 tests.
  4290. 139.50 s [vector] empty: OK
  4291. 139.50 s [vector] +++ OK, passed 100 tests.
  4292. 139.50 s [vector] singleton: OK
  4293. 139.50 s [vector] +++ OK, passed 100 tests.
  4294. 139.51 s [vector] replicate: OK
  4295. 139.51 s [vector] +++ OK, passed 100 tests.
  4296. 139.51 s [vector] generate: OK
  4297. 139.51 s [vector] +++ OK, passed 100 tests.
  4298. 139.51 s [vector] iterateN: OK
  4299. 139.51 s [vector] +++ OK, passed 100 tests.
  4300. 139.55 s [vector] iterateNM: OK (0.03s)
  4301. 139.55 s [vector] +++ OK, passed 100 tests.
  4302. 139.56 s [vector] generateM: OK (0.01s)
  4303. 139.56 s [vector] +++ OK, passed 100 tests.
  4304. 139.56 s [vector] replicateM: OK
  4305. 139.56 s [vector] +++ OK, passed 100 tests.
  4306. 139.56 s [vector] create: OK
  4307. 139.56 s [vector] +++ OK, passed 100 tests.
  4308. 139.56 s [vector] createT: OK
  4309. 139.56 s [vector] +++ OK, passed 100 tests.
  4310. 139.56 s [vector] unfoldr: OK
  4311. 139.56 s [vector] +++ OK, passed 100 tests.
  4312. 139.56 s [vector] unfoldrN: OK
  4313. 139.56 s [vector] +++ OK, passed 100 tests.
  4314. 139.56 s [vector] unfoldrExactN: OK
  4315. 139.57 s [vector] +++ OK, passed 100 tests.
  4316. 139.57 s [vector] unfoldrM: OK
  4317. 139.57 s [vector] +++ OK, passed 100 tests.
  4318. 139.57 s [vector] unfoldrNM: OK
  4319. 139.57 s [vector] +++ OK, passed 100 tests.
  4320. 139.59 s [vector] unfoldrExactNM: OK
  4321. 139.59 s [vector] +++ OK, passed 100 tests.
  4322. 139.59 s [vector] constructN: OK
  4323. 139.59 s [vector] +++ OK, passed 100 tests.
  4324. 139.60 s [vector] constructrN: OK
  4325. 139.60 s [vector] +++ OK, passed 100 tests.
  4326. 139.60 s [vector] cons: OK
  4327. 139.60 s [vector] +++ OK, passed 100 tests.
  4328. 139.60 s [vector] snoc: OK
  4329. 139.60 s [vector] +++ OK, passed 100 tests.
  4330. 139.60 s [vector] append: OK
  4331. 139.60 s [vector] +++ OK, passed 100 tests.
  4332. 139.61 s [vector] concat: OK (0.01s)
  4333. 139.61 s [vector] +++ OK, passed 100 tests.
  4334. 139.61 s [vector] force: OK
  4335. 139.61 s [vector] +++ OK, passed 100 tests.
  4336. 139.61 s [vector] upd: OK
  4337. 139.62 s [vector] +++ OK, passed 100 tests.
  4338. 139.62 s [vector] accum: OK
  4339. 139.62 s [vector] +++ OK, passed 100 tests.
  4340. 139.62 s [vector] reverse: OK
  4341. 139.62 s [vector] +++ OK, passed 100 tests.
  4342. 139.62 s [vector] backpermute: OK
  4343. 139.62 s [vector] +++ OK, passed 100 tests.
  4344. 139.62 s [vector] map: OK
  4345. 139.62 s [vector] +++ OK, passed 100 tests.
  4346. 139.62 s [vector] imap: OK
  4347. 139.62 s [vector] +++ OK, passed 100 tests.
  4348. 139.63 s [vector] concatMap: OK
  4349. 139.63 s [vector] +++ OK, passed 100 tests.
  4350. 139.63 s [vector] mapM: OK
  4351. 139.63 s [vector] +++ OK, passed 100 tests.
  4352. 139.65 s [vector] mapM_: OK (0.02s)
  4353. 139.65 s [vector] +++ OK, passed 100 tests.
  4354. 139.65 s [vector] forM: OK
  4355. 139.65 s [vector] +++ OK, passed 100 tests.
  4356. 139.66 s [vector] forM_: OK (0.01s)
  4357. 139.67 s [vector] +++ OK, passed 100 tests.
  4358. 139.67 s [vector] imapM: OK
  4359. 139.67 s [vector] +++ OK, passed 100 tests.
  4360. 139.68 s [vector] imapM_: OK (0.02s)
  4361. 139.68 s [vector] +++ OK, passed 100 tests.
  4362. 139.68 s [vector] zipWith: OK
  4363. 139.68 s [vector] +++ OK, passed 100 tests.
  4364. 139.68 s [vector] zipWith3: OK
  4365. 139.68 s [vector] +++ OK, passed 100 tests.
  4366. 139.69 s [vector] izipWith: OK
  4367. 139.69 s [vector] +++ OK, passed 100 tests.
  4368. 139.69 s [vector] izipWith3: OK
  4369. 139.69 s [vector] +++ OK, passed 100 tests.
  4370. 139.71 s [vector] izipWithM: OK
  4371. 139.71 s [vector] +++ OK, passed 100 tests.
  4372. 139.71 s [vector] izipWithM_: OK (0.01s)
  4373. 139.71 s [vector] +++ OK, passed 100 tests.
  4374. 139.72 s [vector] zipWithM: OK
  4375. 139.72 s [vector] +++ OK, passed 100 tests.
  4376. 139.72 s [vector] zipWithM_: OK (0.01s)
  4377. 139.72 s [vector] +++ OK, passed 100 tests.
  4378. 139.73 s [vector] filter: OK
  4379. 139.73 s [vector] +++ OK, passed 100 tests.
  4380. 139.73 s [vector] ifilter: OK
  4381. 139.73 s [vector] +++ OK, passed 100 tests.
  4382. 139.75 s [vector] filterM: OK (0.02s)
  4383. 139.75 s [vector] +++ OK, passed 100 tests.
  4384. 139.75 s [vector] uniq: OK
  4385. 139.75 s [vector] +++ OK, passed 100 tests.
  4386. 139.75 s [vector] mapMaybe: OK
  4387. 139.75 s [vector] +++ OK, passed 100 tests.
  4388. 139.75 s [vector] imapMaybe: OK
  4389. 139.75 s [vector] +++ OK, passed 100 tests.
  4390. 139.75 s [vector] takeWhile: OK
  4391. 139.75 s [vector] +++ OK, passed 100 tests.
  4392. 139.76 s [vector] dropWhile: OK
  4393. 139.76 s [vector] +++ OK, passed 100 tests.
  4394. 139.76 s [vector] partition: OK
  4395. 139.76 s [vector] +++ OK, passed 100 tests.
  4396. 139.76 s [vector] partitionWith: OK
  4397. 139.76 s [vector] +++ OK, passed 100 tests.
  4398. 139.76 s [vector] span: OK
  4399. 139.76 s [vector] +++ OK, passed 100 tests.
  4400. 139.76 s [vector] break: OK
  4401. 139.76 s [vector] +++ OK, passed 100 tests.
  4402. 139.76 s [vector] spanR: OK
  4403. 139.76 s [vector] +++ OK, passed 100 tests.
  4404. 139.76 s [vector] breakR: OK
  4405. 139.76 s [vector] +++ OK, passed 100 tests.
  4406. 139.76 s [vector] groupBy: OK
  4407. 139.76 s [vector] +++ OK, passed 100 tests.
  4408. 139.76 s [vector] elem: OK
  4409. 139.76 s [vector] +++ OK, passed 100 tests.
  4410. 139.76 s [vector] notElem: OK
  4411. 139.76 s [vector] +++ OK, passed 100 tests.
  4412. 139.76 s [vector] find: OK
  4413. 139.76 s [vector] +++ OK, passed 100 tests.
  4414. 139.76 s [vector] findIndex: OK
  4415. 139.76 s [vector] +++ OK, passed 100 tests.
  4416. 139.76 s [vector] findIndexR: OK
  4417. 139.76 s [vector] +++ OK, passed 100 tests.
  4418. 139.77 s [vector] findIndices: OK
  4419. 139.77 s [vector] +++ OK, passed 100 tests.
  4420. 139.77 s [vector] elemIndex: OK
  4421. 139.77 s [vector] +++ OK, passed 100 tests.
  4422. 139.77 s [vector] elemIndices: OK
  4423. 139.77 s [vector] +++ OK, passed 100 tests.
  4424. 139.77 s [vector] foldl: OK
  4425. 139.77 s [vector] +++ OK, passed 100 tests.
  4426. 139.77 s [vector] foldl1: OK
  4427. 139.77 s [vector] +++ OK, passed 100 tests; 11 discarded.
  4428. 139.77 s [vector] foldl': OK
  4429. 139.77 s [vector] +++ OK, passed 100 tests.
  4430. 139.78 s [vector] foldl1': OK
  4431. 139.78 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4432. 139.78 s [vector] foldr: OK
  4433. 139.78 s [vector] +++ OK, passed 100 tests.
  4434. 139.78 s [vector] foldr1: OK
  4435. 139.78 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4436. 139.78 s [vector] foldr': OK
  4437. 139.78 s [vector] +++ OK, passed 100 tests.
  4438. 139.78 s [vector] foldr1': OK
  4439. 139.79 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4440. 139.79 s [vector] ifoldl: OK
  4441. 139.79 s [vector] +++ OK, passed 100 tests.
  4442. 139.79 s [vector] ifoldl': OK
  4443. 139.79 s [vector] +++ OK, passed 100 tests.
  4444. 139.79 s [vector] ifoldr: OK
  4445. 139.80 s [vector] +++ OK, passed 100 tests.
  4446. 139.80 s [vector] ifoldr': OK
  4447. 139.80 s [vector] +++ OK, passed 100 tests.
  4448. 139.80 s [vector] ifoldM: OK
  4449. 139.80 s [vector] +++ OK, passed 100 tests.
  4450. 139.81 s [vector] ifoldM': OK
  4451. 139.81 s [vector] +++ OK, passed 100 tests.
  4452. 139.83 s [vector] ifoldM_: OK (0.02s)
  4453. 139.83 s [vector] +++ OK, passed 100 tests.
  4454. 139.83 s [vector] ifoldM'_: OK (0.02s)
  4455. 139.83 s [vector] +++ OK, passed 100 tests.
  4456. 139.84 s [vector] all: OK
  4457. 139.84 s [vector] +++ OK, passed 100 tests.
  4458. 139.84 s [vector] any: OK
  4459. 139.84 s [vector] +++ OK, passed 100 tests.
  4460. 139.84 s [vector] prescanl: OK
  4461. 139.84 s [vector] +++ OK, passed 100 tests.
  4462. 139.84 s [vector] prescanl': OK
  4463. 139.84 s [vector] +++ OK, passed 100 tests.
  4464. 139.84 s [vector] postscanl: OK
  4465. 139.84 s [vector] +++ OK, passed 100 tests.
  4466. 139.85 s [vector] postscanl': OK
  4467. 139.85 s [vector] +++ OK, passed 100 tests.
  4468. 139.85 s [vector] scanl: OK
  4469. 139.85 s [vector] +++ OK, passed 100 tests.
  4470. 139.85 s [vector] scanl': OK
  4471. 139.85 s [vector] +++ OK, passed 100 tests.
  4472. 139.85 s [vector] scanl1: OK
  4473. 139.85 s [vector] +++ OK, passed 100 tests.
  4474. 139.86 s [vector] scanl1': OK
  4475. 139.86 s [vector] +++ OK, passed 100 tests.
  4476. 139.86 s [vector] iscanl: OK
  4477. 139.86 s [vector] +++ OK, passed 100 tests.
  4478. 139.86 s [vector] iscanl': OK
  4479. 139.86 s [vector] +++ OK, passed 100 tests.
  4480. 139.86 s [vector] prescanr: OK
  4481. 139.86 s [vector] +++ OK, passed 100 tests.
  4482. 139.87 s [vector] prescanr': OK
  4483. 139.87 s [vector] +++ OK, passed 100 tests.
  4484. 139.87 s [vector] postscanr: OK
  4485. 139.87 s [vector] +++ OK, passed 100 tests.
  4486. 139.87 s [vector] postscanr': OK
  4487. 139.87 s [vector] +++ OK, passed 100 tests.
  4488. 139.87 s [vector] scanr: OK
  4489. 139.87 s [vector] +++ OK, passed 100 tests.
  4490. 139.88 s [vector] scanr': OK
  4491. 139.88 s [vector] +++ OK, passed 100 tests.
  4492. 139.88 s [vector] scanr1: OK
  4493. 139.88 s [vector] +++ OK, passed 100 tests.
  4494. 139.88 s [vector] scanr1': OK
  4495. 139.88 s [vector] +++ OK, passed 100 tests.
  4496. 139.88 s [vector] iscanr: OK
  4497. 139.88 s [vector] +++ OK, passed 100 tests.
  4498. 139.89 s [vector] iscanr': OK
  4499. 139.89 s [vector] +++ OK, passed 100 tests.
  4500. 139.89 s [vector] mut_read: OK
  4501. 139.89 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4502. 139.89 s [vector] mut_write: OK
  4503. 139.89 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4504. 139.89 s [vector] mut_modify: OK
  4505. 139.89 s [vector] +++ OK, passed 100 tests; 23 discarded.
  4506. 139.89 s [vector] mut_generate: OK
  4507. 139.89 s [vector] +++ OK, passed 100 tests.
  4508. 139.89 s [vector] mut_generateM: OK
  4509. 139.89 s [vector] +++ OK, passed 100 tests.
  4510. 139.91 s [vector] mut_mapM_: OK (0.01s)
  4511. 139.91 s [vector] +++ OK, passed 100 tests.
  4512. 139.93 s [vector] mut_imapM_: OK (0.02s)
  4513. 139.93 s [vector] +++ OK, passed 100 tests.
  4514. 139.95 s [vector] mut_forM_: OK (0.02s)
  4515. 139.95 s [vector] +++ OK, passed 100 tests.
  4516. 139.96 s [vector] mut_iforM_: OK (0.02s)
  4517. 139.96 s [vector] +++ OK, passed 100 tests.
  4518. 139.96 s [vector] mut_foldr: OK
  4519. 139.96 s [vector] +++ OK, passed 100 tests.
  4520. 139.96 s [vector] mut_foldr': OK
  4521. 139.96 s [vector] +++ OK, passed 100 tests.
  4522. 139.96 s [vector] mut_foldl: OK
  4523. 139.97 s [vector] +++ OK, passed 100 tests.
  4524. 139.97 s [vector] mut_foldl': OK
  4525. 139.97 s [vector] +++ OK, passed 100 tests.
  4526. 139.97 s [vector] mut_ifoldr: OK
  4527. 139.97 s [vector] +++ OK, passed 100 tests.
  4528. 139.97 s [vector] mut_ifoldr': OK
  4529. 139.97 s [vector] +++ OK, passed 100 tests.
  4530. 139.98 s [vector] mut_ifoldl: OK
  4531. 139.98 s [vector] +++ OK, passed 100 tests.
  4532. 139.98 s [vector] mut_ifoldl': OK
  4533. 139.98 s [vector] +++ OK, passed 100 tests.
  4534. 139.98 s [vector] mut_foldM: OK
  4535. 139.98 s [vector] +++ OK, passed 100 tests.
  4536. 139.98 s [vector] mut_foldM': OK
  4537. 139.98 s [vector] +++ OK, passed 100 tests.
  4538. 139.99 s [vector] mut_foldrM: OK
  4539. 139.99 s [vector] +++ OK, passed 100 tests.
  4540. 139.99 s [vector] mut_foldrM': OK
  4541. 139.99 s [vector] +++ OK, passed 100 tests.
  4542. 139.99 s [vector] mut_ifoldM: OK
  4543. 139.99 s [vector] +++ OK, passed 100 tests.
  4544. 140.00 s [vector] mut_ifoldM': OK
  4545. 140.00 s [vector] +++ OK, passed 100 tests.
  4546. 140.00 s [vector] mut_ifoldrM: OK
  4547. 140.00 s [vector] +++ OK, passed 100 tests.
  4548. 140.00 s [vector] mut_ifoldrM': OK
  4549. 140.00 s [vector] +++ OK, passed 100 tests.
  4550. 140.00 s [vector] compare: OK
  4551. 140.00 s [vector] +++ OK, passed 100 tests.
  4552. 140.00 s [vector] maximum: OK
  4553. 140.00 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4554. 140.00 s [vector] minimum: OK
  4555. 140.00 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4556. 140.01 s [vector] minIndex: OK
  4557. 140.01 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4558. 140.01 s [vector] maxIndex: OK
  4559. 140.01 s [vector] +++ OK, passed 100 tests; 22 discarded.
  4560. 140.01 s [vector] maximumBy: OK
  4561. 140.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4562. 140.01 s [vector] minimumBy: OK
  4563. 140.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4564. 140.01 s [vector] maximumOn: OK
  4565. 140.01 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4566. 140.01 s [vector] minimumOn: OK
  4567. 140.01 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4568. 140.01 s [vector] maxIndexBy: OK
  4569. 140.01 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4570. 140.01 s [vector] minIndexBy: OK
  4571. 140.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4572. 140.01 s [vector] ListFirstMaxIndexWins: OK
  4573. 140.01 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4574. 140.01 s [vector] FalseListFirstMaxIndexWins: OK
  4575. 140.01 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  4576. 140.01 s [vector] []
  4577. 140.01 s [vector] zip: OK
  4578. 140.01 s [vector] +++ OK, passed 100 tests.
  4579. 140.01 s [vector] zip3: OK
  4580. 140.01 s [vector] +++ OK, passed 100 tests.
  4581. 140.01 s [vector] unzip: OK
  4582. 140.01 s [vector] +++ OK, passed 100 tests.
  4583. 140.01 s [vector] unzip3: OK
  4584. 140.01 s [vector] +++ OK, passed 100 tests.
  4585. 140.03 s [vector] indexed: OK
  4586. 140.03 s [vector] +++ OK, passed 100 tests.
  4587. 140.03 s [vector] update: OK
  4588. 140.03 s [vector] +++ OK, passed 100 tests.
  4589. 140.03 s [vector] concat: OK
  4590. 140.03 s [vector] +++ OK, passed 100 tests.
  4591. 140.03 s [vector] mempty: OK
  4592. 140.03 s [vector] +++ OK, passed 100 tests.
  4593. 140.03 s [vector] mappend: OK
  4594. 140.03 s [vector] +++ OK, passed 100 tests.
  4595. 140.04 s [vector] mconcat: OK
  4596. 140.04 s [vector] +++ OK, passed 100 tests.
  4597. 140.04 s [vector] fmap: OK
  4598. 140.04 s [vector] +++ OK, passed 100 tests.
  4599. 140.04 s [vector] return: OK
  4600. 140.04 s [vector] +++ OK, passed 100 tests.
  4601. 140.05 s [vector] bind: OK
  4602. 140.05 s [vector] +++ OK, passed 100 tests.
  4603. 140.05 s [vector] mzip: OK
  4604. 140.05 s [vector] +++ OK, passed 100 tests.
  4605. 140.05 s [vector] munzip: OK
  4606. 140.07 s [vector] +++ OK, passed 100 tests.
  4607. 140.07 s [vector] applicative_pure: OK
  4608. 140.07 s [vector] +++ OK, passed 100 tests.
  4609. 140.08 s [vector] applicative_appl: OK (0.03s)
  4610. 140.08 s [vector] +++ OK, passed 100 tests.
  4611. 140.08 s [vector] alternative_empty: OK
  4612. 140.08 s [vector] +++ OK, passed 100 tests.
  4613. 140.08 s [vector] alternative_or: OK
  4614. 140.09 s [vector] +++ OK, passed 100 tests.
  4615. 140.12 s [vector] sequence: OK (0.03s)
  4616. 140.12 s [vector] +++ OK, passed 100 tests.
  4617. 140.12 s [vector] sequence_: OK (0.01s)
  4618. 140.12 s [vector] +++ OK, passed 100 tests.
  4619. 140.12 s [vector] glength: OK
  4620. 140.12 s [vector] +++ OK, passed 100 tests.
  4621. 140.12 s [vector] sum: OK
  4622. 140.12 s [vector] +++ OK, passed 100 tests.
  4623. 140.13 s [vector] product: OK
  4624. 140.13 s [vector] +++ OK, passed 100 tests.
  4625. 140.13 s [vector] enumFromN: OK
  4626. 140.13 s [vector] +++ OK, passed 100 tests.
  4627. 140.13 s [vector] enumFromThenN: OK
  4628. 140.13 s [vector] +++ OK, passed 100 tests.
  4629. 140.13 s [vector] enumFromTo: OK
  4630. 140.13 s [vector] +++ OK, passed 100 tests.
  4631. 140.13 s [vector] enumFromThenTo: OK
  4632. 140.13 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4633. 140.13 s [vector] unstream
  4634. 140.13 s [vector] unstream == vunstream (exact): OK
  4635. 140.13 s [vector] +++ OK, passed 100 tests.
  4636. 140.13 s [vector] unstream == vunstream (unknown): OK
  4637. 140.13 s [vector] +++ OK, passed 100 tests.
  4638. 140.13 s [vector] unstreamR ~= vunstream (exact): OK
  4639. 140.13 s [vector] +++ OK, passed 100 tests.
  4640. 140.13 s [vector] unstreamR ~= vunstream (unknown): OK
  4641. 140.13 s [vector] +++ OK, passed 100 tests.
  4642. 140.13 s [vector] Tests.Vector.Unboxed
  4643. 140.13 s [vector] ()
  4644. 140.13 s [vector] fromList.toList == id: OK
  4645. 140.13 s [vector] +++ OK, passed 100 tests.
  4646. 140.13 s [vector] toList.fromList == id: OK
  4647. 140.13 s [vector] +++ OK, passed 100 tests.
  4648. 140.13 s [vector] unstream.stream == id: OK
  4649. 140.13 s [vector] +++ OK, passed 100 tests.
  4650. 140.13 s [vector] stream.unstream == id: OK
  4651. 140.13 s [vector] +++ OK, passed 100 tests.
  4652. 140.13 s [vector] eq: OK
  4653. 140.13 s [vector] +++ OK, passed 100 tests.
  4654. 140.13 s [vector] length: OK
  4655. 140.13 s [vector] +++ OK, passed 100 tests.
  4656. 140.13 s [vector] null: OK
  4657. 140.13 s [vector] +++ OK, passed 100 tests.
  4658. 140.13 s [vector] index: OK
  4659. 140.13 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4660. 140.13 s [vector] safeIndex: OK
  4661. 140.13 s [vector] +++ OK, passed 100 tests.
  4662. 140.13 s [vector] head: OK
  4663. 140.13 s [vector] +++ OK, passed 100 tests; 19 discarded.
  4664. 140.14 s [vector] last: OK
  4665. 140.14 s [vector] +++ OK, passed 100 tests; 25 discarded.
  4666. 140.14 s [vector] unsafeIndex: OK
  4667. 140.14 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4668. 140.14 s [vector] unsafeHead: OK
  4669. 140.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4670. 140.14 s [vector] unsafeLast: OK
  4671. 140.14 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4672. 140.14 s [vector] slice: OK
  4673. 140.14 s [vector] +++ OK, passed 100 tests.
  4674. 140.14 s [vector] init: OK
  4675. 140.14 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4676. 140.14 s [vector] tail: OK
  4677. 140.14 s [vector] +++ OK, passed 100 tests; 15 discarded.
  4678. 140.14 s [vector] take: OK
  4679. 140.14 s [vector] +++ OK, passed 100 tests.
  4680. 140.14 s [vector] drop: OK
  4681. 140.14 s [vector] +++ OK, passed 100 tests.
  4682. 140.14 s [vector] splitAt: OK
  4683. 140.14 s [vector] +++ OK, passed 100 tests.
  4684. 140.14 s [vector] empty: OK
  4685. 140.14 s [vector] +++ OK, passed 100 tests.
  4686. 140.14 s [vector] singleton: OK
  4687. 140.14 s [vector] +++ OK, passed 100 tests.
  4688. 140.14 s [vector] replicate: OK
  4689. 140.14 s [vector] +++ OK, passed 100 tests.
  4690. 140.14 s [vector] generate: OK
  4691. 140.14 s [vector] +++ OK, passed 100 tests.
  4692. 140.15 s [vector] iterateN: OK
  4693. 140.15 s [vector] +++ OK, passed 100 tests.
  4694. 140.18 s [vector] iterateNM: OK (0.03s)
  4695. 140.19 s [vector] +++ OK, passed 100 tests.
  4696. 140.19 s [vector] generateM: OK
  4697. 140.19 s [vector] +++ OK, passed 100 tests.
  4698. 140.19 s [vector] replicateM: OK
  4699. 140.19 s [vector] +++ OK, passed 100 tests.
  4700. 140.19 s [vector] create: OK
  4701. 140.19 s [vector] +++ OK, passed 100 tests.
  4702. 140.19 s [vector] createT: OK
  4703. 140.19 s [vector] +++ OK, passed 100 tests.
  4704. 140.19 s [vector] unfoldr: OK
  4705. 140.19 s [vector] +++ OK, passed 100 tests.
  4706. 140.19 s [vector] unfoldrN: OK
  4707. 140.19 s [vector] +++ OK, passed 100 tests.
  4708. 140.20 s [vector] unfoldrExactN: OK
  4709. 140.20 s [vector] +++ OK, passed 100 tests.
  4710. 140.20 s [vector] unfoldrM: OK
  4711. 140.20 s [vector] +++ OK, passed 100 tests.
  4712. 140.20 s [vector] unfoldrNM: OK
  4713. 140.21 s [vector] +++ OK, passed 100 tests.
  4714. 140.22 s [vector] unfoldrExactNM: OK (0.02s)
  4715. 140.22 s [vector] +++ OK, passed 100 tests.
  4716. 140.22 s [vector] constructN: OK
  4717. 140.22 s [vector] +++ OK, passed 100 tests.
  4718. 140.22 s [vector] constructrN: OK
  4719. 140.22 s [vector] +++ OK, passed 100 tests.
  4720. 140.22 s [vector] cons: OK
  4721. 140.22 s [vector] +++ OK, passed 100 tests.
  4722. 140.23 s [vector] snoc: OK
  4723. 140.23 s [vector] +++ OK, passed 100 tests.
  4724. 140.23 s [vector] append: OK
  4725. 140.23 s [vector] +++ OK, passed 100 tests.
  4726. 140.23 s [vector] concat: OK
  4727. 140.23 s [vector] +++ OK, passed 100 tests.
  4728. 140.24 s [vector] force: OK
  4729. 140.24 s [vector] +++ OK, passed 100 tests.
  4730. 140.24 s [vector] upd: OK
  4731. 140.24 s [vector] +++ OK, passed 100 tests.
  4732. 140.24 s [vector] accum: OK
  4733. 140.24 s [vector] +++ OK, passed 100 tests.
  4734. 140.24 s [vector] reverse: OK
  4735. 140.24 s [vector] +++ OK, passed 100 tests.
  4736. 140.24 s [vector] backpermute: OK
  4737. 140.24 s [vector] +++ OK, passed 100 tests.
  4738. 140.24 s [vector] map: OK
  4739. 140.24 s [vector] +++ OK, passed 100 tests.
  4740. 140.24 s [vector] imap: OK
  4741. 140.24 s [vector] +++ OK, passed 100 tests.
  4742. 140.24 s [vector] concatMap: OK
  4743. 140.24 s [vector] +++ OK, passed 100 tests.
  4744. 140.25 s [vector] mapM: OK
  4745. 140.25 s [vector] +++ OK, passed 100 tests.
  4746. 140.25 s [vector] mapM_: OK
  4747. 140.26 s [vector] +++ OK, passed 100 tests.
  4748. 140.26 s [vector] forM: OK
  4749. 140.26 s [vector] +++ OK, passed 100 tests.
  4750. 140.26 s [vector] forM_: OK
  4751. 140.26 s [vector] +++ OK, passed 100 tests.
  4752. 140.27 s [vector] imapM: OK
  4753. 140.27 s [vector] +++ OK, passed 100 tests.
  4754. 140.27 s [vector] imapM_: OK
  4755. 140.27 s [vector] +++ OK, passed 100 tests.
  4756. 140.28 s [vector] zipWith: OK
  4757. 140.28 s [vector] +++ OK, passed 100 tests.
  4758. 140.28 s [vector] zipWith3: OK
  4759. 140.28 s [vector] +++ OK, passed 100 tests.
  4760. 140.28 s [vector] izipWith: OK
  4761. 140.28 s [vector] +++ OK, passed 100 tests.
  4762. 140.28 s [vector] izipWith3: OK
  4763. 140.28 s [vector] +++ OK, passed 100 tests.
  4764. 140.29 s [vector] izipWithM: OK
  4765. 140.29 s [vector] +++ OK, passed 100 tests.
  4766. 140.29 s [vector] izipWithM_: OK
  4767. 140.29 s [vector] +++ OK, passed 100 tests.
  4768. 140.29 s [vector] zipWithM: OK
  4769. 140.29 s [vector] +++ OK, passed 100 tests.
  4770. 140.30 s [vector] zipWithM_: OK
  4771. 140.30 s [vector] +++ OK, passed 100 tests.
  4772. 140.30 s [vector] filter: OK
  4773. 140.30 s [vector] +++ OK, passed 100 tests.
  4774. 140.30 s [vector] ifilter: OK
  4775. 140.30 s [vector] +++ OK, passed 100 tests.
  4776. 140.32 s [vector] filterM: OK (0.02s)
  4777. 140.32 s [vector] +++ OK, passed 100 tests.
  4778. 140.32 s [vector] uniq: OK
  4779. 140.32 s [vector] +++ OK, passed 100 tests.
  4780. 140.32 s [vector] mapMaybe: OK
  4781. 140.32 s [vector] +++ OK, passed 100 tests.
  4782. 140.32 s [vector] imapMaybe: OK
  4783. 140.32 s [vector] +++ OK, passed 100 tests.
  4784. 140.32 s [vector] takeWhile: OK
  4785. 140.32 s [vector] +++ OK, passed 100 tests.
  4786. 140.33 s [vector] dropWhile: OK
  4787. 140.33 s [vector] +++ OK, passed 100 tests.
  4788. 140.33 s [vector] partition: OK
  4789. 140.33 s [vector] +++ OK, passed 100 tests.
  4790. 140.33 s [vector] partitionWith: OK
  4791. 140.33 s [vector] +++ OK, passed 100 tests.
  4792. 140.33 s [vector] span: OK
  4793. 140.33 s [vector] +++ OK, passed 100 tests.
  4794. 140.33 s [vector] break: OK
  4795. 140.33 s [vector] +++ OK, passed 100 tests.
  4796. 140.33 s [vector] spanR: OK
  4797. 140.33 s [vector] +++ OK, passed 100 tests.
  4798. 140.33 s [vector] breakR: OK
  4799. 140.33 s [vector] +++ OK, passed 100 tests.
  4800. 140.33 s [vector] groupBy: OK
  4801. 140.33 s [vector] +++ OK, passed 100 tests.
  4802. 140.33 s [vector] elem: OK
  4803. 140.33 s [vector] +++ OK, passed 100 tests.
  4804. 140.33 s [vector] notElem: OK
  4805. 140.33 s [vector] +++ OK, passed 100 tests.
  4806. 140.33 s [vector] find: OK
  4807. 140.33 s [vector] +++ OK, passed 100 tests.
  4808. 140.33 s [vector] findIndex: OK
  4809. 140.33 s [vector] +++ OK, passed 100 tests.
  4810. 140.33 s [vector] findIndexR: OK
  4811. 140.33 s [vector] +++ OK, passed 100 tests.
  4812. 140.33 s [vector] findIndices: OK
  4813. 140.33 s [vector] +++ OK, passed 100 tests.
  4814. 140.33 s [vector] elemIndex: OK
  4815. 140.33 s [vector] +++ OK, passed 100 tests.
  4816. 140.33 s [vector] elemIndices: OK
  4817. 140.33 s [vector] +++ OK, passed 100 tests.
  4818. 140.33 s [vector] foldl: OK
  4819. 140.33 s [vector] +++ OK, passed 100 tests.
  4820. 140.33 s [vector] foldl1: OK
  4821. 140.33 s [vector] +++ OK, passed 100 tests; 18 discarded.
  4822. 140.33 s [vector] foldl': OK
  4823. 140.33 s [vector] +++ OK, passed 100 tests.
  4824. 140.33 s [vector] foldl1': OK
  4825. 140.34 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4826. 140.34 s [vector] foldr: OK
  4827. 140.34 s [vector] +++ OK, passed 100 tests.
  4828. 140.34 s [vector] foldr1: OK
  4829. 140.34 s [vector] +++ OK, passed 100 tests; 17 discarded.
  4830. 140.34 s [vector] foldr': OK
  4831. 140.34 s [vector] +++ OK, passed 100 tests.
  4832. 140.34 s [vector] foldr1': OK
  4833. 140.34 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4834. 140.34 s [vector] ifoldl: OK
  4835. 140.34 s [vector] +++ OK, passed 100 tests.
  4836. 140.34 s [vector] ifoldl': OK
  4837. 140.34 s [vector] +++ OK, passed 100 tests.
  4838. 140.34 s [vector] ifoldr: OK
  4839. 140.34 s [vector] +++ OK, passed 100 tests.
  4840. 140.34 s [vector] ifoldr': OK
  4841. 140.34 s [vector] +++ OK, passed 100 tests.
  4842. 140.34 s [vector] ifoldM: OK
  4843. 140.34 s [vector] +++ OK, passed 100 tests.
  4844. 140.34 s [vector] ifoldM': OK
  4845. 140.35 s [vector] +++ OK, passed 100 tests.
  4846. 140.35 s [vector] ifoldM_: OK
  4847. 140.35 s [vector] +++ OK, passed 100 tests.
  4848. 140.36 s [vector] ifoldM'_: OK
  4849. 140.36 s [vector] +++ OK, passed 100 tests.
  4850. 140.36 s [vector] all: OK
  4851. 140.36 s [vector] +++ OK, passed 100 tests.
  4852. 140.36 s [vector] any: OK
  4853. 140.36 s [vector] +++ OK, passed 100 tests.
  4854. 140.36 s [vector] prescanl: OK
  4855. 140.36 s [vector] +++ OK, passed 100 tests.
  4856. 140.36 s [vector] prescanl': OK
  4857. 140.36 s [vector] +++ OK, passed 100 tests.
  4858. 140.36 s [vector] postscanl: OK
  4859. 140.36 s [vector] +++ OK, passed 100 tests.
  4860. 140.36 s [vector] postscanl': OK
  4861. 140.36 s [vector] +++ OK, passed 100 tests.
  4862. 140.36 s [vector] scanl: OK
  4863. 140.36 s [vector] +++ OK, passed 100 tests.
  4864. 140.36 s [vector] scanl': OK
  4865. 140.37 s [vector] +++ OK, passed 100 tests.
  4866. 140.37 s [vector] scanl1: OK
  4867. 140.37 s [vector] +++ OK, passed 100 tests.
  4868. 140.37 s [vector] scanl1': OK
  4869. 140.37 s [vector] +++ OK, passed 100 tests.
  4870. 140.37 s [vector] iscanl: OK
  4871. 140.37 s [vector] +++ OK, passed 100 tests.
  4872. 140.37 s [vector] iscanl': OK
  4873. 140.37 s [vector] +++ OK, passed 100 tests.
  4874. 140.37 s [vector] prescanr: OK
  4875. 140.37 s [vector] +++ OK, passed 100 tests.
  4876. 140.37 s [vector] prescanr': OK
  4877. 140.37 s [vector] +++ OK, passed 100 tests.
  4878. 140.37 s [vector] postscanr: OK
  4879. 140.37 s [vector] +++ OK, passed 100 tests.
  4880. 140.37 s [vector] postscanr': OK
  4881. 140.37 s [vector] +++ OK, passed 100 tests.
  4882. 140.37 s [vector] scanr: OK
  4883. 140.38 s [vector] +++ OK, passed 100 tests.
  4884. 140.38 s [vector] scanr': OK
  4885. 140.38 s [vector] +++ OK, passed 100 tests.
  4886. 140.38 s [vector] scanr1: OK
  4887. 140.38 s [vector] +++ OK, passed 100 tests.
  4888. 140.38 s [vector] scanr1': OK
  4889. 140.38 s [vector] +++ OK, passed 100 tests.
  4890. 140.38 s [vector] iscanr: OK
  4891. 140.38 s [vector] +++ OK, passed 100 tests.
  4892. 140.38 s [vector] iscanr': OK
  4893. 140.38 s [vector] +++ OK, passed 100 tests.
  4894. 140.38 s [vector] mut_read: OK
  4895. 140.38 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4896. 140.38 s [vector] mut_write: OK
  4897. 140.38 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4898. 140.38 s [vector] mut_modify: OK
  4899. 140.38 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4900. 140.39 s [vector] mut_generate: OK
  4901. 140.39 s [vector] +++ OK, passed 100 tests.
  4902. 140.39 s [vector] mut_generateM: OK
  4903. 140.39 s [vector] +++ OK, passed 100 tests.
  4904. 140.40 s [vector] mut_mapM_: OK
  4905. 140.40 s [vector] +++ OK, passed 100 tests.
  4906. 140.41 s [vector] mut_imapM_: OK
  4907. 140.41 s [vector] +++ OK, passed 100 tests.
  4908. 140.42 s [vector] mut_forM_: OK
  4909. 140.42 s [vector] +++ OK, passed 100 tests.
  4910. 140.43 s [vector] mut_iforM_: OK (0.01s)
  4911. 140.43 s [vector] +++ OK, passed 100 tests.
  4912. 140.43 s [vector] mut_foldr: OK
  4913. 140.43 s [vector] +++ OK, passed 100 tests.
  4914. 140.43 s [vector] mut_foldr': OK
  4915. 140.43 s [vector] +++ OK, passed 100 tests.
  4916. 140.43 s [vector] mut_foldl: OK
  4917. 140.43 s [vector] +++ OK, passed 100 tests.
  4918. 140.43 s [vector] mut_foldl': OK
  4919. 140.43 s [vector] +++ OK, passed 100 tests.
  4920. 140.43 s [vector] mut_ifoldr: OK
  4921. 140.43 s [vector] +++ OK, passed 100 tests.
  4922. 140.43 s [vector] mut_ifoldr': OK
  4923. 140.43 s [vector] +++ OK, passed 100 tests.
  4924. 140.43 s [vector] mut_ifoldl: OK
  4925. 140.43 s [vector] +++ OK, passed 100 tests.
  4926. 140.43 s [vector] mut_ifoldl': OK
  4927. 140.43 s [vector] +++ OK, passed 100 tests.
  4928. 140.43 s [vector] mut_foldM: OK
  4929. 140.43 s [vector] +++ OK, passed 100 tests.
  4930. 140.43 s [vector] mut_foldM': OK
  4931. 140.43 s [vector] +++ OK, passed 100 tests.
  4932. 140.43 s [vector] mut_foldrM: OK
  4933. 140.43 s [vector] +++ OK, passed 100 tests.
  4934. 140.43 s [vector] mut_foldrM': OK
  4935. 140.43 s [vector] +++ OK, passed 100 tests.
  4936. 140.43 s [vector] mut_ifoldM: OK
  4937. 140.44 s [vector] +++ OK, passed 100 tests.
  4938. 140.44 s [vector] mut_ifoldM': OK
  4939. 140.44 s [vector] +++ OK, passed 100 tests.
  4940. 140.44 s [vector] mut_ifoldrM: OK
  4941. 140.44 s [vector] +++ OK, passed 100 tests.
  4942. 140.44 s [vector] mut_ifoldrM': OK
  4943. 140.44 s [vector] +++ OK, passed 100 tests.
  4944. 140.44 s [vector] compare: OK
  4945. 140.44 s [vector] +++ OK, passed 100 tests.
  4946. 140.44 s [vector] maximum: OK
  4947. 140.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4948. 140.44 s [vector] minimum: OK
  4949. 140.44 s [vector] +++ OK, passed 100 tests; 16 discarded.
  4950. 140.44 s [vector] minIndex: OK
  4951. 140.44 s [vector] +++ OK, passed 100 tests; 21 discarded.
  4952. 140.44 s [vector] maxIndex: OK
  4953. 140.44 s [vector] +++ OK, passed 100 tests; 12 discarded.
  4954. 140.44 s [vector] maximumBy: OK
  4955. 140.44 s [vector] +++ OK, passed 100 tests; 23 discarded.
  4956. 140.44 s [vector] minimumBy: OK
  4957. 140.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4958. 140.44 s [vector] maximumOn: OK
  4959. 140.44 s [vector] +++ OK, passed 100 tests; 22 discarded.
  4960. 140.44 s [vector] minimumOn: OK
  4961. 140.44 s [vector] +++ OK, passed 100 tests; 13 discarded.
  4962. 140.44 s [vector] maxIndexBy: OK
  4963. 140.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4964. 140.44 s [vector] minIndexBy: OK
  4965. 140.44 s [vector] +++ OK, passed 100 tests; 29 discarded.
  4966. 140.44 s [vector] ListFirstMaxIndexWins: OK
  4967. 140.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  4968. 140.44 s [vector] FalseListFirstMaxIndexWins: OK
  4969. 140.44 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  4970. 140.44 s [vector] []
  4971. 140.45 s [vector] zip: OK
  4972. 140.45 s [vector] +++ OK, passed 100 tests.
  4973. 140.45 s [vector] zip3: OK
  4974. 140.45 s [vector] +++ OK, passed 100 tests.
  4975. 140.45 s [vector] unzip: OK
  4976. 140.45 s [vector] +++ OK, passed 100 tests.
  4977. 140.45 s [vector] unzip3: OK
  4978. 140.45 s [vector] +++ OK, passed 100 tests.
  4979. 140.45 s [vector] indexed: OK
  4980. 140.45 s [vector] +++ OK, passed 100 tests.
  4981. 140.45 s [vector] update: OK
  4982. 140.45 s [vector] +++ OK, passed 100 tests.
  4983. 140.45 s [vector] mempty: OK
  4984. 140.45 s [vector] +++ OK, passed 100 tests.
  4985. 140.46 s [vector] mappend: OK
  4986. 140.46 s [vector] +++ OK, passed 100 tests.
  4987. 140.46 s [vector] mconcat: OK
  4988. 140.46 s [vector] +++ OK, passed 100 tests.
  4989. 140.46 s [vector] glength: OK
  4990. 140.46 s [vector] +++ OK, passed 100 tests.
  4991. 140.46 s [vector] (Bool)
  4992. 140.46 s [vector] fromList.toList == id: OK
  4993. 140.46 s [vector] +++ OK, passed 100 tests.
  4994. 140.46 s [vector] toList.fromList == id: OK
  4995. 140.46 s [vector] +++ OK, passed 100 tests.
  4996. 140.46 s [vector] unstream.stream == id: OK
  4997. 140.46 s [vector] +++ OK, passed 100 tests.
  4998. 140.46 s [vector] stream.unstream == id: OK
  4999. 140.46 s [vector] +++ OK, passed 100 tests.
  5000. 140.47 s [vector] eq: OK
  5001. 140.47 s [vector] +++ OK, passed 100 tests.
  5002. 140.47 s [vector] length: OK
  5003. 140.47 s [vector] +++ OK, passed 100 tests.
  5004. 140.47 s [vector] null: OK
  5005. 140.47 s [vector] +++ OK, passed 100 tests.
  5006. 140.47 s [vector] index: OK
  5007. 140.47 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5008. 140.47 s [vector] safeIndex: OK
  5009. 140.47 s [vector] +++ OK, passed 100 tests.
  5010. 140.47 s [vector] head: OK
  5011. 140.47 s [vector] +++ OK, passed 100 tests; 24 discarded.
  5012. 140.47 s [vector] last: OK
  5013. 140.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5014. 140.47 s [vector] unsafeIndex: OK
  5015. 140.47 s [vector] +++ OK, passed 100 tests; 10 discarded.
  5016. 140.47 s [vector] unsafeHead: OK
  5017. 140.47 s [vector] +++ OK, passed 100 tests; 27 discarded.
  5018. 140.47 s [vector] unsafeLast: OK
  5019. 140.47 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5020. 140.47 s [vector] slice: OK
  5021. 140.47 s [vector] +++ OK, passed 100 tests.
  5022. 140.47 s [vector] init: OK
  5023. 140.47 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5024. 140.47 s [vector] tail: OK
  5025. 140.47 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5026. 140.47 s [vector] take: OK
  5027. 140.47 s [vector] +++ OK, passed 100 tests.
  5028. 140.47 s [vector] drop: OK
  5029. 140.47 s [vector] +++ OK, passed 100 tests.
  5030. 140.47 s [vector] splitAt: OK
  5031. 140.47 s [vector] +++ OK, passed 100 tests.
  5032. 140.47 s [vector] empty: OK
  5033. 140.47 s [vector] +++ OK, passed 100 tests.
  5034. 140.47 s [vector] singleton: OK
  5035. 140.47 s [vector] +++ OK, passed 100 tests.
  5036. 140.47 s [vector] replicate: OK
  5037. 140.49 s [vector] +++ OK, passed 100 tests.
  5038. 140.49 s [vector] generate: OK
  5039. 140.49 s [vector] +++ OK, passed 100 tests.
  5040. 140.49 s [vector] iterateN: OK
  5041. 140.49 s [vector] +++ OK, passed 100 tests.
  5042. 140.50 s [vector] iterateNM: OK (0.02s)
  5043. 140.50 s [vector] +++ OK, passed 100 tests.
  5044. 140.51 s [vector] generateM: OK (0.01s)
  5045. 140.51 s [vector] +++ OK, passed 100 tests.
  5046. 140.52 s [vector] replicateM: OK (0.02s)
  5047. 140.52 s [vector] +++ OK, passed 100 tests.
  5048. 140.52 s [vector] create: OK
  5049. 140.52 s [vector] +++ OK, passed 100 tests.
  5050. 140.52 s [vector] createT: OK
  5051. 140.52 s [vector] +++ OK, passed 100 tests.
  5052. 140.52 s [vector] unfoldr: OK
  5053. 140.52 s [vector] +++ OK, passed 100 tests.
  5054. 140.52 s [vector] unfoldrN: OK
  5055. 140.52 s [vector] +++ OK, passed 100 tests.
  5056. 140.52 s [vector] unfoldrExactN: OK
  5057. 140.52 s [vector] +++ OK, passed 100 tests.
  5058. 140.52 s [vector] unfoldrM: OK
  5059. 140.53 s [vector] +++ OK, passed 100 tests.
  5060. 140.53 s [vector] unfoldrNM: OK
  5061. 140.53 s [vector] +++ OK, passed 100 tests.
  5062. 140.56 s [vector] unfoldrExactNM: OK (0.03s)
  5063. 140.56 s [vector] +++ OK, passed 100 tests.
  5064. 140.56 s [vector] constructN: OK
  5065. 140.56 s [vector] +++ OK, passed 100 tests.
  5066. 140.56 s [vector] constructrN: OK
  5067. 140.56 s [vector] +++ OK, passed 100 tests.
  5068. 140.56 s [vector] cons: OK
  5069. 140.56 s [vector] +++ OK, passed 100 tests.
  5070. 140.56 s [vector] snoc: OK
  5071. 140.56 s [vector] +++ OK, passed 100 tests.
  5072. 140.56 s [vector] append: OK
  5073. 140.56 s [vector] +++ OK, passed 100 tests.
  5074. 140.58 s [vector] concat: OK
  5075. 140.58 s [vector] +++ OK, passed 100 tests.
  5076. 140.58 s [vector] force: OK
  5077. 140.58 s [vector] +++ OK, passed 100 tests.
  5078. 140.58 s [vector] upd: OK
  5079. 140.58 s [vector] +++ OK, passed 100 tests.
  5080. 140.58 s [vector] accum: OK
  5081. 140.58 s [vector] +++ OK, passed 100 tests.
  5082. 140.58 s [vector] reverse: OK
  5083. 140.58 s [vector] +++ OK, passed 100 tests.
  5084. 140.58 s [vector] backpermute: OK
  5085. 140.58 s [vector] +++ OK, passed 100 tests.
  5086. 140.58 s [vector] map: OK
  5087. 140.58 s [vector] +++ OK, passed 100 tests.
  5088. 140.59 s [vector] imap: OK
  5089. 140.59 s [vector] +++ OK, passed 100 tests.
  5090. 140.59 s [vector] concatMap: OK
  5091. 140.59 s [vector] +++ OK, passed 100 tests.
  5092. 140.59 s [vector] mapM: OK
  5093. 140.59 s [vector] +++ OK, passed 100 tests.
  5094. 140.60 s [vector] mapM_: OK
  5095. 140.60 s [vector] +++ OK, passed 100 tests.
  5096. 140.60 s [vector] forM: OK
  5097. 140.61 s [vector] +++ OK, passed 100 tests.
  5098. 140.62 s [vector] forM_: OK (0.01s)
  5099. 140.63 s [vector] +++ OK, passed 100 tests.
  5100. 140.63 s [vector] imapM: OK
  5101. 140.63 s [vector] +++ OK, passed 100 tests.
  5102. 140.63 s [vector] imapM_: OK (0.01s)
  5103. 140.63 s [vector] +++ OK, passed 100 tests.
  5104. 140.63 s [vector] zipWith: OK
  5105. 140.63 s [vector] +++ OK, passed 100 tests.
  5106. 140.63 s [vector] zipWith3: OK
  5107. 140.63 s [vector] +++ OK, passed 100 tests.
  5108. 140.64 s [vector] izipWith: OK
  5109. 140.64 s [vector] +++ OK, passed 100 tests.
  5110. 140.64 s [vector] izipWith3: OK
  5111. 140.64 s [vector] +++ OK, passed 100 tests.
  5112. 140.65 s [vector] izipWithM: OK
  5113. 140.65 s [vector] +++ OK, passed 100 tests.
  5114. 140.65 s [vector] izipWithM_: OK
  5115. 140.65 s [vector] +++ OK, passed 100 tests.
  5116. 140.65 s [vector] zipWithM: OK
  5117. 140.65 s [vector] +++ OK, passed 100 tests.
  5118. 140.66 s [vector] zipWithM_: OK
  5119. 140.66 s [vector] +++ OK, passed 100 tests.
  5120. 140.66 s [vector] filter: OK
  5121. 140.66 s [vector] +++ OK, passed 100 tests.
  5122. 140.66 s [vector] ifilter: OK
  5123. 140.67 s [vector] +++ OK, passed 100 tests.
  5124. 140.68 s [vector] filterM: OK (0.02s)
  5125. 140.68 s [vector] +++ OK, passed 100 tests.
  5126. 140.68 s [vector] uniq: OK
  5127. 140.68 s [vector] +++ OK, passed 100 tests.
  5128. 140.68 s [vector] mapMaybe: OK
  5129. 140.69 s [vector] +++ OK, passed 100 tests.
  5130. 140.69 s [vector] imapMaybe: OK
  5131. 140.69 s [vector] +++ OK, passed 100 tests.
  5132. 140.69 s [vector] takeWhile: OK
  5133. 140.69 s [vector] +++ OK, passed 100 tests.
  5134. 140.69 s [vector] dropWhile: OK
  5135. 140.69 s [vector] +++ OK, passed 100 tests.
  5136. 140.69 s [vector] partition: OK
  5137. 140.69 s [vector] +++ OK, passed 100 tests.
  5138. 140.69 s [vector] partitionWith: OK
  5139. 140.69 s [vector] +++ OK, passed 100 tests.
  5140. 140.69 s [vector] span: OK
  5141. 140.69 s [vector] +++ OK, passed 100 tests.
  5142. 140.69 s [vector] break: OK
  5143. 140.69 s [vector] +++ OK, passed 100 tests.
  5144. 140.69 s [vector] spanR: OK
  5145. 140.69 s [vector] +++ OK, passed 100 tests.
  5146. 140.69 s [vector] breakR: OK
  5147. 140.69 s [vector] +++ OK, passed 100 tests.
  5148. 140.69 s [vector] groupBy: OK
  5149. 140.69 s [vector] +++ OK, passed 100 tests.
  5150. 140.69 s [vector] elem: OK
  5151. 140.69 s [vector] +++ OK, passed 100 tests.
  5152. 140.70 s [vector] notElem: OK
  5153. 140.70 s [vector] +++ OK, passed 100 tests.
  5154. 140.70 s [vector] find: OK
  5155. 140.70 s [vector] +++ OK, passed 100 tests.
  5156. 140.70 s [vector] findIndex: OK
  5157. 140.70 s [vector] +++ OK, passed 100 tests.
  5158. 140.70 s [vector] findIndexR: OK
  5159. 140.70 s [vector] +++ OK, passed 100 tests.
  5160. 140.70 s [vector] findIndices: OK
  5161. 140.70 s [vector] +++ OK, passed 100 tests.
  5162. 140.70 s [vector] elemIndex: OK
  5163. 140.70 s [vector] +++ OK, passed 100 tests.
  5164. 140.70 s [vector] elemIndices: OK
  5165. 140.70 s [vector] +++ OK, passed 100 tests.
  5166. 140.70 s [vector] foldl: OK
  5167. 140.70 s [vector] +++ OK, passed 100 tests.
  5168. 140.70 s [vector] foldl1: OK
  5169. 140.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5170. 140.71 s [vector] foldl': OK
  5171. 140.71 s [vector] +++ OK, passed 100 tests.
  5172. 140.71 s [vector] foldl1': OK
  5173. 140.71 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5174. 140.71 s [vector] foldr: OK
  5175. 140.71 s [vector] +++ OK, passed 100 tests.
  5176. 140.71 s [vector] foldr1: OK
  5177. 140.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5178. 140.71 s [vector] foldr': OK
  5179. 140.71 s [vector] +++ OK, passed 100 tests.
  5180. 140.71 s [vector] foldr1': OK
  5181. 140.71 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5182. 140.71 s [vector] ifoldl: OK
  5183. 140.71 s [vector] +++ OK, passed 100 tests.
  5184. 140.71 s [vector] ifoldl': OK
  5185. 140.72 s [vector] +++ OK, passed 100 tests.
  5186. 140.72 s [vector] ifoldr: OK
  5187. 140.72 s [vector] +++ OK, passed 100 tests.
  5188. 140.72 s [vector] ifoldr': OK
  5189. 140.72 s [vector] +++ OK, passed 100 tests.
  5190. 140.72 s [vector] ifoldM: OK
  5191. 140.72 s [vector] +++ OK, passed 100 tests.
  5192. 140.73 s [vector] ifoldM': OK
  5193. 140.73 s [vector] +++ OK, passed 100 tests.
  5194. 140.75 s [vector] ifoldM_: OK (0.01s)
  5195. 141.15 s [vector] +++ OK, passed 100 tests.
  5196. 141.15 s [vector] ifoldM'_: OK (0.01s)
  5197. 141.15 s [vector] +++ OK, passed 100 tests.
  5198. 141.15 s [vector] all: OK
  5199. 141.15 s [vector] +++ OK, passed 100 tests.
  5200. 141.15 s [vector] any: OK
  5201. 141.15 s [vector] +++ OK, passed 100 tests.
  5202. 141.15 s [vector] prescanl: OK
  5203. 141.15 s [vector] +++ OK, passed 100 tests.
  5204. 141.15 s [vector] prescanl': OK
  5205. 141.15 s [vector] +++ OK, passed 100 tests.
  5206. 141.15 s [vector] postscanl: OK
  5207. 141.15 s [vector] +++ OK, passed 100 tests.
  5208. 141.15 s [vector] postscanl': OK
  5209. 141.15 s [vector] +++ OK, passed 100 tests.
  5210. 141.15 s [vector] scanl: OK
  5211. 141.15 s [vector] +++ OK, passed 100 tests.
  5212. 141.15 s [vector] scanl': OK
  5213. 141.15 s [vector] +++ OK, passed 100 tests.
  5214. 141.15 s [vector] scanl1: OK
  5215. 141.15 s [vector] +++ OK, passed 100 tests.
  5216. 141.15 s [vector] scanl1': OK
  5217. 141.15 s [vector] +++ OK, passed 100 tests.
  5218. 141.15 s [vector] iscanl: OK
  5219. 141.15 s [vector] +++ OK, passed 100 tests.
  5220. 141.15 s [vector] iscanl': OK
  5221. 141.15 s [vector] +++ OK, passed 100 tests.
  5222. 141.15 s [vector] prescanr: OK
  5223. 141.15 s [vector] +++ OK, passed 100 tests.
  5224. 141.15 s [vector] prescanr': OK
  5225. 141.15 s [vector] +++ OK, passed 100 tests.
  5226. 141.15 s [vector] postscanr: OK
  5227. 141.15 s [vector] +++ OK, passed 100 tests.
  5228. 141.15 s [vector] postscanr': OK
  5229. 141.15 s [vector] +++ OK, passed 100 tests.
  5230. 141.15 s [vector] scanr: OK
  5231. 141.16 s [vector] +++ OK, passed 100 tests.
  5232. 141.16 s [vector] scanr': OK
  5233. 141.16 s [vector] +++ OK, passed 100 tests.
  5234. 141.16 s [vector] scanr1: OK
  5235. 141.16 s [vector] +++ OK, passed 100 tests.
  5236. 141.16 s [vector] scanr1': OK
  5237. 141.16 s [vector] +++ OK, passed 100 tests.
  5238. 141.16 s [vector] iscanr: OK
  5239. 141.16 s [vector] +++ OK, passed 100 tests.
  5240. 141.16 s [vector] iscanr': OK
  5241. 141.16 s [vector] +++ OK, passed 100 tests.
  5242. 141.16 s [vector] mut_read: OK
  5243. 141.16 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5244. 141.16 s [vector] mut_write: OK
  5245. 141.16 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5246. 141.16 s [vector] mut_modify: OK
  5247. 141.16 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5248. 141.16 s [vector] mut_generate: OK
  5249. 141.16 s [vector] +++ OK, passed 100 tests.
  5250. 141.16 s [vector] mut_generateM: OK
  5251. 141.16 s [vector] +++ OK, passed 100 tests.
  5252. 141.16 s [vector] mut_mapM_: OK
  5253. 141.16 s [vector] +++ OK, passed 100 tests.
  5254. 141.16 s [vector] mut_imapM_: OK (0.01s)
  5255. 141.16 s [vector] +++ OK, passed 100 tests.
  5256. 141.16 s [vector] mut_forM_: OK (0.01s)
  5257. 141.16 s [vector] +++ OK, passed 100 tests.
  5258. 141.16 s [vector] mut_iforM_: OK (0.01s)
  5259. 141.16 s [vector] +++ OK, passed 100 tests.
  5260. 141.16 s [vector] mut_foldr: OK
  5261. 141.16 s [vector] +++ OK, passed 100 tests.
  5262. 141.16 s [vector] mut_foldr': OK
  5263. 141.16 s [vector] +++ OK, passed 100 tests.
  5264. 141.16 s [vector] mut_foldl: OK
  5265. 141.16 s [vector] +++ OK, passed 100 tests.
  5266. 141.16 s [vector] mut_foldl': OK
  5267. 141.16 s [vector] +++ OK, passed 100 tests.
  5268. 141.16 s [vector] mut_ifoldr: OK
  5269. 141.16 s [vector] +++ OK, passed 100 tests.
  5270. 141.16 s [vector] mut_ifoldr': OK
  5271. 141.16 s [vector] +++ OK, passed 100 tests.
  5272. 141.16 s [vector] mut_ifoldl: OK
  5273. 141.16 s [vector] +++ OK, passed 100 tests.
  5274. 141.16 s [vector] mut_ifoldl': OK
  5275. 141.16 s [vector] +++ OK, passed 100 tests.
  5276. 141.16 s [vector] mut_foldM: OK
  5277. 141.16 s [vector] +++ OK, passed 100 tests.
  5278. 141.16 s [vector] mut_foldM': OK
  5279. 141.16 s [vector] +++ OK, passed 100 tests.
  5280. 141.16 s [vector] mut_foldrM: OK
  5281. 141.16 s [vector] +++ OK, passed 100 tests.
  5282. 141.16 s [vector] mut_foldrM': OK
  5283. 141.16 s [vector] +++ OK, passed 100 tests.
  5284. 141.16 s [vector] mut_ifoldM: OK
  5285. 141.16 s [vector] +++ OK, passed 100 tests.
  5286. 141.16 s [vector] mut_ifoldM': OK
  5287. 141.16 s [vector] +++ OK, passed 100 tests.
  5288. 141.16 s [vector] mut_ifoldrM: OK
  5289. 141.16 s [vector] +++ OK, passed 100 tests.
  5290. 141.16 s [vector] mut_ifoldrM': OK
  5291. 141.16 s [vector] +++ OK, passed 100 tests.
  5292. 141.16 s [vector] compare: OK
  5293. 141.16 s [vector] +++ OK, passed 100 tests.
  5294. 141.16 s [vector] maximum: OK
  5295. 141.16 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5296. 141.16 s [vector] minimum: OK
  5297. 141.16 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5298. 141.16 s [vector] minIndex: OK
  5299. 141.16 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5300. 141.16 s [vector] maxIndex: OK
  5301. 141.16 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5302. 141.16 s [vector] maximumBy: OK
  5303. 141.16 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5304. 141.16 s [vector] minimumBy: OK
  5305. 141.16 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5306. 141.16 s [vector] maximumOn: OK
  5307. 141.16 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5308. 141.16 s [vector] minimumOn: OK
  5309. 141.16 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5310. 141.16 s [vector] maxIndexBy: OK
  5311. 141.16 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5312. 141.16 s [vector] minIndexBy: OK
  5313. 141.16 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5314. 141.16 s [vector] ListFirstMaxIndexWins: OK
  5315. 141.16 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5316. 141.16 s [vector] FalseListFirstMaxIndexWins: OK
  5317. 141.16 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  5318. 141.16 s [vector] []
  5319. 141.16 s [vector] zip: OK
  5320. 141.16 s [vector] +++ OK, passed 100 tests.
  5321. 141.16 s [vector] zip3: OK
  5322. 141.16 s [vector] +++ OK, passed 100 tests.
  5323. 141.16 s [vector] unzip: OK
  5324. 141.16 s [vector] +++ OK, passed 100 tests.
  5325. 141.16 s [vector] unzip3: OK
  5326. 141.16 s [vector] +++ OK, passed 100 tests.
  5327. 141.16 s [vector] indexed: OK
  5328. 141.16 s [vector] +++ OK, passed 100 tests.
  5329. 141.16 s [vector] update: OK
  5330. 141.16 s [vector] +++ OK, passed 100 tests.
  5331. 141.16 s [vector] mempty: OK
  5332. 141.16 s [vector] +++ OK, passed 100 tests.
  5333. 141.16 s [vector] mappend: OK
  5334. 141.16 s [vector] +++ OK, passed 100 tests.
  5335. 141.16 s [vector] mconcat: OK (0.02s)
  5336. 141.16 s [vector] +++ OK, passed 100 tests.
  5337. 141.16 s [vector] glength: OK
  5338. 141.16 s [vector] +++ OK, passed 100 tests.
  5339. 141.16 s [vector] and: OK
  5340. 141.16 s [vector] +++ OK, passed 100 tests.
  5341. 141.16 s [vector] or: OK
  5342. 141.16 s [vector] +++ OK, passed 100 tests.
  5343. 141.16 s [vector] (Int)
  5344. 141.16 s [vector] fromList.toList == id: OK
  5345. 141.16 s [vector] +++ OK, passed 100 tests.
  5346. 141.16 s [vector] toList.fromList == id: OK
  5347. 141.16 s [vector] +++ OK, passed 100 tests.
  5348. 141.16 s [vector] unstream.stream == id: OK
  5349. 141.16 s [vector] +++ OK, passed 100 tests.
  5350. 141.16 s [vector] stream.unstream == id: OK
  5351. 141.16 s [vector] +++ OK, passed 100 tests.
  5352. 141.16 s [vector] eq: OK
  5353. 141.16 s [vector] +++ OK, passed 100 tests.
  5354. 141.16 s [vector] length: OK
  5355. 141.16 s [vector] +++ OK, passed 100 tests.
  5356. 141.16 s [vector] null: OK
  5357. 141.16 s [vector] +++ OK, passed 100 tests.
  5358. 141.16 s [vector] index: OK
  5359. 141.16 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5360. 141.16 s [vector] safeIndex: OK
  5361. 141.16 s [vector] +++ OK, passed 100 tests.
  5362. 141.16 s [vector] head: OK
  5363. 141.16 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5364. 141.16 s [vector] last: OK
  5365. 141.16 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5366. 141.16 s [vector] unsafeIndex: OK
  5367. 141.16 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5368. 141.16 s [vector] unsafeHead: OK
  5369. 141.16 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5370. 141.16 s [vector] unsafeLast: OK
  5371. 141.16 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5372. 141.16 s [vector] slice: OK
  5373. 141.16 s [vector] +++ OK, passed 100 tests.
  5374. 141.16 s [vector] init: OK
  5375. 141.16 s [vector] +++ OK, passed 100 tests; 11 discarded.
  5376. 141.16 s [vector] tail: OK
  5377. 141.16 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5378. 141.16 s [vector] take: OK
  5379. 141.16 s [vector] +++ OK, passed 100 tests.
  5380. 141.16 s [vector] drop: OK
  5381. 141.16 s [vector] +++ OK, passed 100 tests.
  5382. 141.16 s [vector] splitAt: OK
  5383. 141.16 s [vector] +++ OK, passed 100 tests.
  5384. 141.16 s [vector] empty: OK
  5385. 141.16 s [vector] +++ OK, passed 100 tests.
  5386. 141.16 s [vector] singleton: OK
  5387. 141.16 s [vector] +++ OK, passed 100 tests.
  5388. 141.16 s [vector] replicate: OK
  5389. 141.16 s [vector] +++ OK, passed 100 tests.
  5390. 141.16 s [vector] generate: OK
  5391. 141.16 s [vector] +++ OK, passed 100 tests.
  5392. 141.16 s [vector] iterateN: OK
  5393. 141.16 s [vector] +++ OK, passed 100 tests.
  5394. 141.16 s [vector] iterateNM: OK (0.03s)
  5395. 141.16 s [vector] +++ OK, passed 100 tests.
  5396. 141.16 s [vector] generateM: OK
  5397. 141.16 s [vector] +++ OK, passed 100 tests.
  5398. 141.16 s [vector] replicateM: OK (0.01s)
  5399. 141.16 s [vector] +++ OK, passed 100 tests.
  5400. 141.16 s [vector] create: OK
  5401. 141.16 s [vector] +++ OK, passed 100 tests.
  5402. 141.16 s [vector] createT: OK
  5403. 141.16 s [vector] +++ OK, passed 100 tests.
  5404. 141.16 s [vector] unfoldr: OK
  5405. 141.16 s [vector] +++ OK, passed 100 tests.
  5406. 141.16 s [vector] unfoldrN: OK
  5407. 141.16 s [vector] +++ OK, passed 100 tests.
  5408. 141.16 s [vector] unfoldrExactN: OK
  5409. 141.16 s [vector] +++ OK, passed 100 tests.
  5410. 141.16 s [vector] unfoldrM: OK
  5411. 141.16 s [vector] +++ OK, passed 100 tests.
  5412. 141.16 s [vector] unfoldrNM: OK
  5413. 141.16 s [vector] +++ OK, passed 100 tests.
  5414. 141.16 s [vector] unfoldrExactNM: OK (0.03s)
  5415. 141.16 s [vector] +++ OK, passed 100 tests.
  5416. 141.16 s [vector] constructN: OK
  5417. 141.16 s [vector] +++ OK, passed 100 tests.
  5418. 141.16 s [vector] constructrN: OK
  5419. 141.16 s [vector] +++ OK, passed 100 tests.
  5420. 141.16 s [vector] cons: OK
  5421. 141.16 s [vector] +++ OK, passed 100 tests.
  5422. 141.16 s [vector] snoc: OK
  5423. 141.16 s [vector] +++ OK, passed 100 tests.
  5424. 141.16 s [vector] append: OK
  5425. 141.16 s [vector] +++ OK, passed 100 tests.
  5426. 141.16 s [vector] concat: OK (0.01s)
  5427. 141.16 s [vector] +++ OK, passed 100 tests.
  5428. 141.16 s [vector] force: OK
  5429. 141.16 s [vector] +++ OK, passed 100 tests.
  5430. 141.16 s [vector] upd: OK
  5431. 141.16 s [vector] +++ OK, passed 100 tests.
  5432. 141.16 s [vector] accum: OK
  5433. 141.16 s [vector] +++ OK, passed 100 tests.
  5434. 141.16 s [vector] reverse: OK
  5435. 141.16 s [vector] +++ OK, passed 100 tests.
  5436. 141.16 s [vector] backpermute: OK
  5437. 141.16 s [vector] +++ OK, passed 100 tests.
  5438. 141.16 s [vector] map: OK
  5439. 141.16 s [vector] +++ OK, passed 100 tests.
  5440. 141.16 s [vector] imap: OK
  5441. 141.16 s [vector] +++ OK, passed 100 tests.
  5442. 141.16 s [vector] concatMap: OK
  5443. 141.16 s [vector] +++ OK, passed 100 tests.
  5444. 141.16 s [vector] mapM: OK
  5445. 141.16 s [vector] +++ OK, passed 100 tests.
  5446. 141.16 s [vector] mapM_: OK (0.01s)
  5447. 141.16 s [vector] +++ OK, passed 100 tests.
  5448. 141.16 s [vector] forM: OK
  5449. 141.16 s [vector] +++ OK, passed 100 tests.
  5450. 141.16 s [vector] forM_: OK (0.01s)
  5451. 141.16 s [vector] +++ OK, passed 100 tests.
  5452. 141.16 s [vector] imapM: OK
  5453. 141.16 s [vector] +++ OK, passed 100 tests.
  5454. 141.16 s [vector] imapM_: OK
  5455. 141.16 s [vector] +++ OK, passed 100 tests.
  5456. 141.16 s [vector] zipWith: OK
  5457. 141.16 s [vector] +++ OK, passed 100 tests.
  5458. 141.16 s [vector] zipWith3: OK
  5459. 141.16 s [vector] +++ OK, passed 100 tests.
  5460. 141.16 s [vector] izipWith: OK
  5461. 141.16 s [vector] +++ OK, passed 100 tests.
  5462. 141.16 s [vector] izipWith3: OK
  5463. 141.16 s [vector] +++ OK, passed 100 tests.
  5464. 141.16 s [vector] izipWithM: OK
  5465. 141.16 s [vector] +++ OK, passed 100 tests.
  5466. 141.16 s [vector] izipWithM_: OK (0.01s)
  5467. 141.16 s [vector] +++ OK, passed 100 tests.
  5468. 141.16 s [vector] zipWithM: OK
  5469. 141.16 s [vector] +++ OK, passed 100 tests.
  5470. 141.16 s [vector] zipWithM_: OK (0.01s)
  5471. 141.16 s [vector] +++ OK, passed 100 tests.
  5472. 141.16 s [vector] filter: OK
  5473. 141.16 s [vector] +++ OK, passed 100 tests.
  5474. 141.16 s [vector] ifilter: OK
  5475. 141.16 s [vector] +++ OK, passed 100 tests.
  5476. 141.18 s [vector] filterM: OK (0.03s)
  5477. 141.18 s [vector] +++ OK, passed 100 tests.
  5478. 141.18 s [vector] uniq: OK
  5479. 141.18 s [vector] +++ OK, passed 100 tests.
  5480. 141.18 s [vector] mapMaybe: OK
  5481. 141.18 s [vector] +++ OK, passed 100 tests.
  5482. 141.18 s [vector] imapMaybe: OK
  5483. 141.18 s [vector] +++ OK, passed 100 tests.
  5484. 141.19 s [vector] takeWhile: OK
  5485. 141.19 s [vector] +++ OK, passed 100 tests.
  5486. 141.19 s [vector] dropWhile: OK
  5487. 141.19 s [vector] +++ OK, passed 100 tests.
  5488. 141.19 s [vector] partition: OK
  5489. 141.19 s [vector] +++ OK, passed 100 tests.
  5490. 141.19 s [vector] partitionWith: OK
  5491. 141.19 s [vector] +++ OK, passed 100 tests.
  5492. 141.19 s [vector] span: OK
  5493. 141.19 s [vector] +++ OK, passed 100 tests.
  5494. 141.19 s [vector] break: OK
  5495. 141.19 s [vector] +++ OK, passed 100 tests.
  5496. 141.19 s [vector] spanR: OK
  5497. 141.19 s [vector] +++ OK, passed 100 tests.
  5498. 141.19 s [vector] breakR: OK
  5499. 141.19 s [vector] +++ OK, passed 100 tests.
  5500. 141.19 s [vector] groupBy: OK
  5501. 141.20 s [vector] +++ OK, passed 100 tests.
  5502. 141.20 s [vector] elem: OK
  5503. 141.20 s [vector] +++ OK, passed 100 tests.
  5504. 141.20 s [vector] notElem: OK
  5505. 141.20 s [vector] +++ OK, passed 100 tests.
  5506. 141.20 s [vector] find: OK
  5507. 141.20 s [vector] +++ OK, passed 100 tests.
  5508. 141.20 s [vector] findIndex: OK
  5509. 141.20 s [vector] +++ OK, passed 100 tests.
  5510. 141.20 s [vector] findIndexR: OK
  5511. 141.20 s [vector] +++ OK, passed 100 tests.
  5512. 141.20 s [vector] findIndices: OK
  5513. 141.20 s [vector] +++ OK, passed 100 tests.
  5514. 141.20 s [vector] elemIndex: OK
  5515. 141.20 s [vector] +++ OK, passed 100 tests.
  5516. 141.20 s [vector] elemIndices: OK
  5517. 141.20 s [vector] +++ OK, passed 100 tests.
  5518. 141.20 s [vector] foldl: OK
  5519. 141.20 s [vector] +++ OK, passed 100 tests.
  5520. 141.20 s [vector] foldl1: OK
  5521. 141.21 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5522. 141.21 s [vector] foldl': OK
  5523. 141.21 s [vector] +++ OK, passed 100 tests.
  5524. 141.21 s [vector] foldl1': OK
  5525. 141.21 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5526. 141.21 s [vector] foldr: OK
  5527. 141.21 s [vector] +++ OK, passed 100 tests.
  5528. 141.21 s [vector] foldr1: OK
  5529. 141.22 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5530. 141.22 s [vector] foldr': OK
  5531. 141.22 s [vector] +++ OK, passed 100 tests.
  5532. 141.22 s [vector] foldr1': OK
  5533. 141.22 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5534. 141.23 s [vector] ifoldl: OK
  5535. 141.23 s [vector] +++ OK, passed 100 tests.
  5536. 141.23 s [vector] ifoldl': OK
  5537. 141.23 s [vector] +++ OK, passed 100 tests.
  5538. 141.23 s [vector] ifoldr: OK
  5539. 141.23 s [vector] +++ OK, passed 100 tests.
  5540. 141.23 s [vector] ifoldr': OK
  5541. 141.23 s [vector] +++ OK, passed 100 tests.
  5542. 141.23 s [vector] ifoldM: OK
  5543. 141.24 s [vector] +++ OK, passed 100 tests.
  5544. 141.25 s [vector] ifoldM': OK
  5545. 141.25 s [vector] +++ OK, passed 100 tests.
  5546. 141.27 s [vector] ifoldM_: OK (0.02s)
  5547. 141.27 s [vector] +++ OK, passed 100 tests.
  5548. 141.27 s [vector] ifoldM'_: OK (0.02s)
  5549. 141.27 s [vector] +++ OK, passed 100 tests.
  5550. 141.27 s [vector] all: OK
  5551. 141.27 s [vector] +++ OK, passed 100 tests.
  5552. 141.27 s [vector] any: OK
  5553. 141.27 s [vector] +++ OK, passed 100 tests.
  5554. 141.27 s [vector] prescanl: OK
  5555. 141.27 s [vector] +++ OK, passed 100 tests.
  5556. 141.28 s [vector] prescanl': OK
  5557. 141.28 s [vector] +++ OK, passed 100 tests.
  5558. 141.28 s [vector] postscanl: OK
  5559. 141.28 s [vector] +++ OK, passed 100 tests.
  5560. 141.28 s [vector] postscanl': OK
  5561. 141.28 s [vector] +++ OK, passed 100 tests.
  5562. 141.29 s [vector] scanl: OK
  5563. 141.29 s [vector] +++ OK, passed 100 tests.
  5564. 141.30 s [vector] scanl': OK
  5565. 141.30 s [vector] +++ OK, passed 100 tests.
  5566. 141.30 s [vector] scanl1: OK
  5567. 141.30 s [vector] +++ OK, passed 100 tests.
  5568. 141.30 s [vector] scanl1': OK
  5569. 141.30 s [vector] +++ OK, passed 100 tests.
  5570. 141.30 s [vector] iscanl: OK
  5571. 141.30 s [vector] +++ OK, passed 100 tests.
  5572. 141.31 s [vector] iscanl': OK
  5573. 141.31 s [vector] +++ OK, passed 100 tests.
  5574. 141.31 s [vector] prescanr: OK
  5575. 141.31 s [vector] +++ OK, passed 100 tests.
  5576. 141.31 s [vector] prescanr': OK
  5577. 141.31 s [vector] +++ OK, passed 100 tests.
  5578. 141.31 s [vector] postscanr: OK
  5579. 141.31 s [vector] +++ OK, passed 100 tests.
  5580. 141.31 s [vector] postscanr': OK
  5581. 141.31 s [vector] +++ OK, passed 100 tests.
  5582. 141.31 s [vector] scanr: OK
  5583. 141.32 s [vector] +++ OK, passed 100 tests.
  5584. 141.32 s [vector] scanr': OK
  5585. 141.32 s [vector] +++ OK, passed 100 tests.
  5586. 141.32 s [vector] scanr1: OK
  5587. 141.32 s [vector] +++ OK, passed 100 tests.
  5588. 141.32 s [vector] scanr1': OK
  5589. 141.32 s [vector] +++ OK, passed 100 tests.
  5590. 141.33 s [vector] iscanr: OK
  5591. 141.33 s [vector] +++ OK, passed 100 tests.
  5592. 141.33 s [vector] iscanr': OK
  5593. 141.33 s [vector] +++ OK, passed 100 tests.
  5594. 141.33 s [vector] mut_read: OK
  5595. 141.33 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5596. 141.33 s [vector] mut_write: OK
  5597. 141.33 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5598. 141.33 s [vector] mut_modify: OK
  5599. 141.33 s [vector] +++ OK, passed 100 tests; 12 discarded.
  5600. 141.33 s [vector] mut_generate: OK
  5601. 141.33 s [vector] +++ OK, passed 100 tests.
  5602. 141.35 s [vector] mut_generateM: OK
  5603. 141.35 s [vector] +++ OK, passed 100 tests.
  5604. 141.37 s [vector] mut_mapM_: OK (0.02s)
  5605. 141.37 s [vector] +++ OK, passed 100 tests.
  5606. 141.37 s [vector] mut_imapM_: OK (0.02s)
  5607. 141.37 s [vector] +++ OK, passed 100 tests.
  5608. 141.39 s [vector] mut_forM_: OK (0.01s)
  5609. 141.39 s [vector] +++ OK, passed 100 tests.
  5610. 141.40 s [vector] mut_iforM_: OK (0.01s)
  5611. 141.40 s [vector] +++ OK, passed 100 tests.
  5612. 141.40 s [vector] mut_foldr: OK
  5613. 141.40 s [vector] +++ OK, passed 100 tests.
  5614. 141.41 s [vector] mut_foldr': OK
  5615. 141.41 s [vector] +++ OK, passed 100 tests.
  5616. 141.41 s [vector] mut_foldl: OK
  5617. 141.41 s [vector] +++ OK, passed 100 tests.
  5618. 141.41 s [vector] mut_foldl': OK
  5619. 141.41 s [vector] +++ OK, passed 100 tests.
  5620. 141.41 s [vector] mut_ifoldr: OK
  5621. 141.41 s [vector] +++ OK, passed 100 tests.
  5622. 141.42 s [vector] mut_ifoldr': OK
  5623. 141.42 s [vector] +++ OK, passed 100 tests.
  5624. 141.42 s [vector] mut_ifoldl: OK
  5625. 141.42 s [vector] +++ OK, passed 100 tests.
  5626. 141.42 s [vector] mut_ifoldl': OK
  5627. 141.42 s [vector] +++ OK, passed 100 tests.
  5628. 141.43 s [vector] mut_foldM: OK
  5629. 141.43 s [vector] +++ OK, passed 100 tests.
  5630. 141.43 s [vector] mut_foldM': OK
  5631. 141.43 s [vector] +++ OK, passed 100 tests.
  5632. 141.43 s [vector] mut_foldrM: OK
  5633. 141.43 s [vector] +++ OK, passed 100 tests.
  5634. 141.43 s [vector] mut_foldrM': OK
  5635. 141.43 s [vector] +++ OK, passed 100 tests.
  5636. 141.44 s [vector] mut_ifoldM: OK
  5637. 141.44 s [vector] +++ OK, passed 100 tests.
  5638. 141.44 s [vector] mut_ifoldM': OK
  5639. 141.44 s [vector] +++ OK, passed 100 tests.
  5640. 141.45 s [vector] mut_ifoldrM: OK
  5641. 141.45 s [vector] +++ OK, passed 100 tests.
  5642. 141.45 s [vector] mut_ifoldrM': OK
  5643. 141.45 s [vector] +++ OK, passed 100 tests.
  5644. 141.45 s [vector] compare: OK
  5645. 141.45 s [vector] +++ OK, passed 100 tests.
  5646. 141.45 s [vector] maximum: OK
  5647. 141.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5648. 141.45 s [vector] minimum: OK
  5649. 141.45 s [vector] +++ OK, passed 100 tests; 23 discarded.
  5650. 141.45 s [vector] minIndex: OK
  5651. 141.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5652. 141.45 s [vector] maxIndex: OK
  5653. 141.45 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5654. 141.45 s [vector] maximumBy: OK
  5655. 141.45 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5656. 141.45 s [vector] minimumBy: OK
  5657. 141.45 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5658. 141.45 s [vector] maximumOn: OK
  5659. 141.45 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5660. 141.45 s [vector] minimumOn: OK
  5661. 141.45 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5662. 141.45 s [vector] maxIndexBy: OK
  5663. 141.45 s [vector] +++ OK, passed 100 tests; 18 discarded.
  5664. 141.45 s [vector] minIndexBy: OK
  5665. 141.45 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5666. 141.45 s [vector] ListFirstMaxIndexWins: OK
  5667. 141.45 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5668. 141.45 s [vector] FalseListFirstMaxIndexWins: OK
  5669. 141.45 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  5670. 141.45 s [vector] []
  5671. 141.46 s [vector] zip: OK
  5672. 141.46 s [vector] +++ OK, passed 100 tests.
  5673. 141.46 s [vector] zip3: OK
  5674. 141.46 s [vector] +++ OK, passed 100 tests.
  5675. 141.46 s [vector] unzip: OK
  5676. 141.46 s [vector] +++ OK, passed 100 tests.
  5677. 141.46 s [vector] unzip3: OK
  5678. 141.46 s [vector] +++ OK, passed 100 tests.
  5679. 141.46 s [vector] indexed: OK
  5680. 141.46 s [vector] +++ OK, passed 100 tests.
  5681. 141.46 s [vector] update: OK
  5682. 141.46 s [vector] +++ OK, passed 100 tests.
  5683. 141.47 s [vector] mempty: OK
  5684. 141.47 s [vector] +++ OK, passed 100 tests.
  5685. 141.47 s [vector] mappend: OK
  5686. 141.47 s [vector] +++ OK, passed 100 tests.
  5687. 141.48 s [vector] mconcat: OK (0.02s)
  5688. 141.48 s [vector] +++ OK, passed 100 tests.
  5689. 141.48 s [vector] glength: OK
  5690. 141.48 s [vector] +++ OK, passed 100 tests.
  5691. 141.48 s [vector] sum: OK
  5692. 141.48 s [vector] +++ OK, passed 100 tests.
  5693. 141.48 s [vector] product: OK
  5694. 141.48 s [vector] +++ OK, passed 100 tests.
  5695. 141.48 s [vector] enumFromN: OK
  5696. 141.48 s [vector] +++ OK, passed 100 tests.
  5697. 141.49 s [vector] enumFromThenN: OK
  5698. 141.49 s [vector] +++ OK, passed 100 tests.
  5699. 141.49 s [vector] enumFromTo: OK
  5700. 141.49 s [vector] +++ OK, passed 100 tests.
  5701. 141.49 s [vector] enumFromThenTo: OK
  5702. 141.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5703. 141.49 s [vector] (Float)
  5704. 141.49 s [vector] fromList.toList == id: OK
  5705. 141.49 s [vector] +++ OK, passed 100 tests.
  5706. 141.49 s [vector] toList.fromList == id: OK
  5707. 141.49 s [vector] +++ OK, passed 100 tests.
  5708. 141.49 s [vector] unstream.stream == id: OK
  5709. 141.49 s [vector] +++ OK, passed 100 tests.
  5710. 141.49 s [vector] stream.unstream == id: OK
  5711. 141.49 s [vector] +++ OK, passed 100 tests.
  5712. 141.49 s [vector] eq: OK
  5713. 141.49 s [vector] +++ OK, passed 100 tests.
  5714. 141.49 s [vector] length: OK
  5715. 141.49 s [vector] +++ OK, passed 100 tests.
  5716. 141.49 s [vector] null: OK
  5717. 141.49 s [vector] +++ OK, passed 100 tests.
  5718. 141.49 s [vector] index: OK
  5719. 141.49 s [vector] +++ OK, passed 100 tests; 20 discarded.
  5720. 141.49 s [vector] safeIndex: OK
  5721. 141.49 s [vector] +++ OK, passed 100 tests.
  5722. 141.49 s [vector] head: OK
  5723. 141.49 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5724. 141.49 s [vector] last: OK
  5725. 141.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5726. 141.50 s [vector] unsafeIndex: OK
  5727. 141.50 s [vector] +++ OK, passed 100 tests; 19 discarded.
  5728. 141.50 s [vector] unsafeHead: OK
  5729. 141.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5730. 141.50 s [vector] unsafeLast: OK
  5731. 141.50 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5732. 141.50 s [vector] slice: OK
  5733. 141.50 s [vector] +++ OK, passed 100 tests.
  5734. 141.50 s [vector] init: OK
  5735. 141.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5736. 141.50 s [vector] tail: OK
  5737. 141.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  5738. 141.50 s [vector] take: OK
  5739. 141.50 s [vector] +++ OK, passed 100 tests.
  5740. 141.50 s [vector] drop: OK
  5741. 141.50 s [vector] +++ OK, passed 100 tests.
  5742. 141.50 s [vector] splitAt: OK
  5743. 141.50 s [vector] +++ OK, passed 100 tests.
  5744. 141.50 s [vector] empty: OK
  5745. 141.50 s [vector] +++ OK, passed 100 tests.
  5746. 141.50 s [vector] singleton: OK
  5747. 141.50 s [vector] +++ OK, passed 100 tests.
  5748. 141.51 s [vector] replicate: OK
  5749. 141.51 s [vector] +++ OK, passed 100 tests.
  5750. 141.51 s [vector] generate: OK
  5751. 141.51 s [vector] +++ OK, passed 100 tests.
  5752. 141.51 s [vector] iterateN: OK
  5753. 141.51 s [vector] +++ OK, passed 100 tests.
  5754. 141.53 s [vector] iterateNM: OK (0.02s)
  5755. 141.53 s [vector] +++ OK, passed 100 tests.
  5756. 141.56 s [vector] generateM: OK (0.02s)
  5757. 141.56 s [vector] +++ OK, passed 100 tests.
  5758. 141.56 s [vector] replicateM: OK
  5759. 141.56 s [vector] +++ OK, passed 100 tests.
  5760. 141.56 s [vector] create: OK
  5761. 141.56 s [vector] +++ OK, passed 100 tests.
  5762. 141.56 s [vector] createT: OK
  5763. 141.56 s [vector] +++ OK, passed 100 tests.
  5764. 141.56 s [vector] unfoldr: OK
  5765. 141.56 s [vector] +++ OK, passed 100 tests.
  5766. 141.56 s [vector] unfoldrN: OK
  5767. 141.56 s [vector] +++ OK, passed 100 tests.
  5768. 141.56 s [vector] unfoldrExactN: OK
  5769. 141.57 s [vector] +++ OK, passed 100 tests.
  5770. 141.58 s [vector] unfoldrM: OK (0.01s)
  5771. 141.59 s [vector] +++ OK, passed 100 tests.
  5772. 141.59 s [vector] unfoldrNM: OK
  5773. 141.59 s [vector] +++ OK, passed 100 tests.
  5774. 141.61 s [vector] unfoldrExactNM: OK (0.02s)
  5775. 141.61 s [vector] +++ OK, passed 100 tests.
  5776. 141.61 s [vector] constructN: OK (0.01s)
  5777. 141.61 s [vector] +++ OK, passed 100 tests.
  5778. 141.62 s [vector] constructrN: OK
  5779. 141.62 s [vector] +++ OK, passed 100 tests.
  5780. 141.63 s [vector] cons: OK
  5781. 141.63 s [vector] +++ OK, passed 100 tests.
  5782. 141.63 s [vector] snoc: OK
  5783. 141.63 s [vector] +++ OK, passed 100 tests.
  5784. 141.63 s [vector] append: OK
  5785. 141.63 s [vector] +++ OK, passed 100 tests.
  5786. 141.64 s [vector] concat: OK (0.02s)
  5787. 141.64 s [vector] +++ OK, passed 100 tests.
  5788. 141.65 s [vector] force: OK
  5789. 141.65 s [vector] +++ OK, passed 100 tests.
  5790. 141.65 s [vector] upd: OK
  5791. 141.65 s [vector] +++ OK, passed 100 tests.
  5792. 141.65 s [vector] accum: OK
  5793. 141.65 s [vector] +++ OK, passed 100 tests.
  5794. 141.65 s [vector] reverse: OK
  5795. 141.66 s [vector] +++ OK, passed 100 tests.
  5796. 141.67 s [vector] backpermute: OK
  5797. 141.67 s [vector] +++ OK, passed 100 tests.
  5798. 141.67 s [vector] map: OK
  5799. 141.67 s [vector] +++ OK, passed 100 tests.
  5800. 141.69 s [vector] imap: OK
  5801. 141.69 s [vector] +++ OK, passed 100 tests.
  5802. 141.69 s [vector] concatMap: OK
  5803. 141.69 s [vector] +++ OK, passed 100 tests.
  5804. 141.69 s [vector] mapM: OK
  5805. 141.69 s [vector] +++ OK, passed 100 tests.
  5806. 141.70 s [vector] mapM_: OK (0.03s)
  5807. 141.71 s [vector] +++ OK, passed 100 tests.
  5808. 141.71 s [vector] forM: OK
  5809. 141.71 s [vector] +++ OK, passed 100 tests.
  5810. 141.74 s [vector] forM_: OK (0.03s)
  5811. 141.75 s [vector] +++ OK, passed 100 tests.
  5812. 141.75 s [vector] imapM: OK
  5813. 141.75 s [vector] +++ OK, passed 100 tests.
  5814. 141.78 s [vector] imapM_: OK (0.03s)
  5815. 141.78 s [vector] +++ OK, passed 100 tests.
  5816. 141.78 s [vector] zipWith: OK
  5817. 141.78 s [vector] +++ OK, passed 100 tests.
  5818. 141.79 s [vector] zipWith3: OK
  5819. 141.79 s [vector] +++ OK, passed 100 tests.
  5820. 141.79 s [vector] izipWith: OK
  5821. 141.80 s [vector] +++ OK, passed 100 tests.
  5822. 141.81 s [vector] izipWith3: OK
  5823. 141.81 s [vector] +++ OK, passed 100 tests.
  5824. 141.81 s [vector] izipWithM: OK
  5825. 141.81 s [vector] +++ OK, passed 100 tests.
  5826. 141.84 s [vector] izipWithM_: OK (0.03s)
  5827. 141.85 s [vector] +++ OK, passed 100 tests.
  5828. 141.85 s [vector] zipWithM: OK
  5829. 141.85 s [vector] +++ OK, passed 100 tests.
  5830. 141.87 s [vector] zipWithM_: OK (0.03s)
  5831. 141.89 s [vector] +++ OK, passed 100 tests.
  5832. 141.89 s [vector] filter: OK
  5833. 141.89 s [vector] +++ OK, passed 100 tests.
  5834. 141.89 s [vector] ifilter: OK
  5835. 141.89 s [vector] +++ OK, passed 100 tests.
  5836. 141.91 s [vector] filterM: OK (0.04s)
  5837. 141.91 s [vector] +++ OK, passed 100 tests.
  5838. 141.91 s [vector] uniq: OK
  5839. 141.91 s [vector] +++ OK, passed 100 tests.
  5840. 141.92 s [vector] mapMaybe: OK
  5841. 141.92 s [vector] +++ OK, passed 100 tests.
  5842. 141.92 s [vector] imapMaybe: OK
  5843. 141.92 s [vector] +++ OK, passed 100 tests.
  5844. 141.92 s [vector] takeWhile: OK
  5845. 141.92 s [vector] +++ OK, passed 100 tests.
  5846. 141.93 s [vector] dropWhile: OK
  5847. 141.93 s [vector] +++ OK, passed 100 tests.
  5848. 141.93 s [vector] partition: OK
  5849. 141.93 s [vector] +++ OK, passed 100 tests.
  5850. 141.93 s [vector] partitionWith: OK
  5851. 141.93 s [vector] +++ OK, passed 100 tests.
  5852. 141.94 s [vector] span: OK
  5853. 141.94 s [vector] +++ OK, passed 100 tests.
  5854. 141.94 s [vector] break: OK
  5855. 141.94 s [vector] +++ OK, passed 100 tests.
  5856. 141.94 s [vector] spanR: OK
  5857. 141.94 s [vector] +++ OK, passed 100 tests.
  5858. 141.94 s [vector] breakR: OK
  5859. 141.94 s [vector] +++ OK, passed 100 tests.
  5860. 141.94 s [vector] groupBy: OK
  5861. 141.94 s [vector] +++ OK, passed 100 tests.
  5862. 141.94 s [vector] elem: OK
  5863. 141.94 s [vector] +++ OK, passed 100 tests.
  5864. 141.94 s [vector] notElem: OK
  5865. 141.94 s [vector] +++ OK, passed 100 tests.
  5866. 141.94 s [vector] find: OK
  5867. 141.94 s [vector] +++ OK, passed 100 tests.
  5868. 141.94 s [vector] findIndex: OK
  5869. 141.94 s [vector] +++ OK, passed 100 tests.
  5870. 141.94 s [vector] findIndexR: OK
  5871. 141.95 s [vector] +++ OK, passed 100 tests.
  5872. 141.95 s [vector] findIndices: OK
  5873. 141.95 s [vector] +++ OK, passed 100 tests.
  5874. 141.95 s [vector] elemIndex: OK
  5875. 141.95 s [vector] +++ OK, passed 100 tests.
  5876. 141.95 s [vector] elemIndices: OK
  5877. 141.95 s [vector] +++ OK, passed 100 tests.
  5878. 141.96 s [vector] foldl: OK
  5879. 141.96 s [vector] +++ OK, passed 100 tests.
  5880. 141.97 s [vector] foldl1: OK
  5881. 141.97 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5882. 141.97 s [vector] foldl': OK
  5883. 141.97 s [vector] +++ OK, passed 100 tests.
  5884. 141.99 s [vector] foldl1': OK
  5885. 141.99 s [vector] +++ OK, passed 100 tests; 15 discarded.
  5886. 141.99 s [vector] foldr: OK
  5887. 142.00 s [vector] +++ OK, passed 100 tests.
  5888. 142.01 s [vector] foldr1: OK
  5889. 142.01 s [vector] +++ OK, passed 100 tests; 14 discarded.
  5890. 142.01 s [vector] foldr': OK
  5891. 142.01 s [vector] +++ OK, passed 100 tests.
  5892. 142.01 s [vector] foldr1': OK
  5893. 142.01 s [vector] +++ OK, passed 100 tests; 21 discarded.
  5894. 142.01 s [vector] ifoldl: OK
  5895. 142.01 s [vector] +++ OK, passed 100 tests.
  5896. 142.01 s [vector] ifoldl': OK
  5897. 142.02 s [vector] +++ OK, passed 100 tests.
  5898. 142.03 s [vector] ifoldr: OK
  5899. 142.03 s [vector] +++ OK, passed 100 tests.
  5900. 142.03 s [vector] ifoldr': OK
  5901. 142.03 s [vector] +++ OK, passed 100 tests.
  5902. 142.04 s [vector] ifoldM: OK
  5903. 142.04 s [vector] +++ OK, passed 100 tests.
  5904. 142.04 s [vector] ifoldM': OK
  5905. 142.05 s [vector] +++ OK, passed 100 tests.
  5906. 142.09 s [vector] ifoldM_: OK (0.03s)
  5907. 142.09 s [vector] +++ OK, passed 100 tests.
  5908. 142.11 s [vector] ifoldM'_: OK (0.03s)
  5909. 142.11 s [vector] +++ OK, passed 100 tests.
  5910. 142.11 s [vector] all: OK
  5911. 142.11 s [vector] +++ OK, passed 100 tests.
  5912. 142.11 s [vector] any: OK
  5913. 142.11 s [vector] +++ OK, passed 100 tests.
  5914. 142.12 s [vector] prescanl: OK
  5915. 142.12 s [vector] +++ OK, passed 100 tests.
  5916. 142.13 s [vector] prescanl': OK
  5917. 142.13 s [vector] +++ OK, passed 100 tests.
  5918. 142.13 s [vector] postscanl: OK
  5919. 142.13 s [vector] +++ OK, passed 100 tests.
  5920. 142.14 s [vector] postscanl': OK
  5921. 142.14 s [vector] +++ OK, passed 100 tests.
  5922. 142.15 s [vector] scanl: OK
  5923. 142.15 s [vector] +++ OK, passed 100 tests.
  5924. 142.16 s [vector] scanl': OK
  5925. 142.16 s [vector] +++ OK, passed 100 tests.
  5926. 142.17 s [vector] scanl1: OK
  5927. 142.17 s [vector] +++ OK, passed 100 tests.
  5928. 142.17 s [vector] scanl1': OK
  5929. 142.17 s [vector] +++ OK, passed 100 tests.
  5930. 142.17 s [vector] iscanl: OK
  5931. 142.17 s [vector] +++ OK, passed 100 tests.
  5932. 142.19 s [vector] iscanl': OK
  5933. 142.19 s [vector] +++ OK, passed 100 tests.
  5934. 142.19 s [vector] prescanr: OK
  5935. 142.19 s [vector] +++ OK, passed 100 tests.
  5936. 142.19 s [vector] prescanr': OK
  5937. 142.19 s [vector] +++ OK, passed 100 tests.
  5938. 142.20 s [vector] postscanr: OK
  5939. 142.21 s [vector] +++ OK, passed 100 tests.
  5940. 142.21 s [vector] postscanr': OK
  5941. 142.22 s [vector] +++ OK, passed 100 tests.
  5942. 142.22 s [vector] scanr: OK
  5943. 142.23 s [vector] +++ OK, passed 100 tests.
  5944. 142.23 s [vector] scanr': OK
  5945. 142.24 s [vector] +++ OK, passed 100 tests.
  5946. 142.25 s [vector] scanr1: OK
  5947. 142.25 s [vector] +++ OK, passed 100 tests.
  5948. 142.25 s [vector] scanr1': OK
  5949. 142.25 s [vector] +++ OK, passed 100 tests.
  5950. 142.25 s [vector] iscanr: OK
  5951. 142.25 s [vector] +++ OK, passed 100 tests.
  5952. 142.25 s [vector] iscanr': OK
  5953. 142.25 s [vector] +++ OK, passed 100 tests.
  5954. 142.25 s [vector] mut_read: OK
  5955. 142.25 s [vector] +++ OK, passed 100 tests; 10 discarded.
  5956. 142.25 s [vector] mut_write: OK
  5957. 142.25 s [vector] +++ OK, passed 100 tests; 17 discarded.
  5958. 142.25 s [vector] mut_modify: OK
  5959. 142.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  5960. 142.27 s [vector] mut_generate: OK
  5961. 142.27 s [vector] +++ OK, passed 100 tests.
  5962. 142.29 s [vector] mut_generateM: OK (0.02s)
  5963. 142.29 s [vector] +++ OK, passed 100 tests.
  5964. 142.30 s [vector] mut_mapM_: OK (0.03s)
  5965. 142.30 s [vector] +++ OK, passed 100 tests.
  5966. 142.33 s [vector] mut_imapM_: OK (0.02s)
  5967. 142.33 s [vector] +++ OK, passed 100 tests.
  5968. 142.37 s [vector] mut_forM_: OK (0.03s)
  5969. 142.37 s [vector] +++ OK, passed 100 tests.
  5970. 142.40 s [vector] mut_iforM_: OK (0.03s)
  5971. 142.40 s [vector] +++ OK, passed 100 tests.
  5972. 142.40 s [vector] mut_foldr: OK
  5973. 142.40 s [vector] +++ OK, passed 100 tests.
  5974. 142.40 s [vector] mut_foldr': OK
  5975. 142.40 s [vector] +++ OK, passed 100 tests.
  5976. 142.42 s [vector] mut_foldl: OK
  5977. 142.42 s [vector] +++ OK, passed 100 tests.
  5978. 142.43 s [vector] mut_foldl': OK
  5979. 142.43 s [vector] +++ OK, passed 100 tests.
  5980. 142.45 s [vector] mut_ifoldr: OK
  5981. 142.45 s [vector] +++ OK, passed 100 tests.
  5982. 142.45 s [vector] mut_ifoldr': OK
  5983. 142.45 s [vector] +++ OK, passed 100 tests.
  5984. 142.46 s [vector] mut_ifoldl: OK
  5985. 142.47 s [vector] +++ OK, passed 100 tests.
  5986. 142.47 s [vector] mut_ifoldl': OK
  5987. 142.47 s [vector] +++ OK, passed 100 tests.
  5988. 142.47 s [vector] mut_foldM: OK
  5989. 142.47 s [vector] +++ OK, passed 100 tests.
  5990. 142.47 s [vector] mut_foldM': OK
  5991. 142.47 s [vector] +++ OK, passed 100 tests.
  5992. 142.47 s [vector] mut_foldrM: OK
  5993. 142.47 s [vector] +++ OK, passed 100 tests.
  5994. 142.48 s [vector] mut_foldrM': OK
  5995. 142.48 s [vector] +++ OK, passed 100 tests.
  5996. 142.48 s [vector] mut_ifoldM: OK
  5997. 142.49 s [vector] +++ OK, passed 100 tests.
  5998. 142.49 s [vector] mut_ifoldM': OK
  5999. 142.49 s [vector] +++ OK, passed 100 tests.
  6000. 142.50 s [vector] mut_ifoldrM: OK
  6001. 142.50 s [vector] +++ OK, passed 100 tests.
  6002. 142.51 s [vector] mut_ifoldrM': OK
  6003. 142.51 s [vector] +++ OK, passed 100 tests.
  6004. 142.51 s [vector] compare: OK
  6005. 142.51 s [vector] +++ OK, passed 100 tests.
  6006. 142.51 s [vector] maximum: OK
  6007. 142.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6008. 142.51 s [vector] minimum: OK
  6009. 142.51 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6010. 142.51 s [vector] minIndex: OK
  6011. 142.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6012. 142.51 s [vector] maxIndex: OK
  6013. 142.51 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6014. 142.51 s [vector] maximumBy: OK
  6015. 142.51 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6016. 142.51 s [vector] minimumBy: OK
  6017. 142.51 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6018. 142.51 s [vector] maximumOn: OK
  6019. 142.51 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6020. 142.51 s [vector] minimumOn: OK
  6021. 142.51 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6022. 142.51 s [vector] maxIndexBy: OK
  6023. 142.51 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6024. 142.51 s [vector] minIndexBy: OK
  6025. 142.52 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6026. 142.52 s [vector] ListFirstMaxIndexWins: OK
  6027. 142.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6028. 142.52 s [vector] FalseListFirstMaxIndexWins: OK
  6029. 142.52 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  6030. 142.53 s [vector] []
  6031. 142.53 s [vector] zip: OK
  6032. 142.53 s [vector] +++ OK, passed 100 tests.
  6033. 142.53 s [vector] zip3: OK
  6034. 142.53 s [vector] +++ OK, passed 100 tests.
  6035. 142.53 s [vector] unzip: OK
  6036. 142.53 s [vector] +++ OK, passed 100 tests.
  6037. 142.53 s [vector] unzip3: OK
  6038. 142.53 s [vector] +++ OK, passed 100 tests.
  6039. 142.53 s [vector] indexed: OK
  6040. 142.53 s [vector] +++ OK, passed 100 tests.
  6041. 142.53 s [vector] update: OK
  6042. 142.53 s [vector] +++ OK, passed 100 tests.
  6043. 142.53 s [vector] mempty: OK
  6044. 142.53 s [vector] +++ OK, passed 100 tests.
  6045. 142.55 s [vector] mappend: OK
  6046. 142.55 s [vector] +++ OK, passed 100 tests.
  6047. 142.55 s [vector] mconcat: OK (0.02s)
  6048. 142.55 s [vector] +++ OK, passed 100 tests.
  6049. 142.55 s [vector] glength: OK
  6050. 142.55 s [vector] +++ OK, passed 100 tests.
  6051. 142.55 s [vector] sum: OK
  6052. 142.55 s [vector] +++ OK, passed 100 tests.
  6053. 142.55 s [vector] product: OK
  6054. 142.55 s [vector] +++ OK, passed 100 tests.
  6055. 142.55 s [vector] enumFromN: OK
  6056. 142.55 s [vector] +++ OK, passed 100 tests.
  6057. 142.56 s [vector] enumFromThenN: OK
  6058. 142.56 s [vector] +++ OK, passed 100 tests.
  6059. 142.56 s [vector] enumFromTo: OK
  6060. 142.56 s [vector] +++ OK, passed 100 tests.
  6061. 142.56 s [vector] enumFromThenTo: OK
  6062. 142.56 s [vector] +++ OK, passed 100 tests; 8 discarded.
  6063. 142.56 s [vector] (Double)
  6064. 142.56 s [vector] fromList.toList == id: OK
  6065. 142.56 s [vector] +++ OK, passed 100 tests.
  6066. 142.56 s [vector] toList.fromList == id: OK
  6067. 142.56 s [vector] +++ OK, passed 100 tests.
  6068. 142.56 s [vector] unstream.stream == id: OK
  6069. 142.56 s [vector] +++ OK, passed 100 tests.
  6070. 142.56 s [vector] stream.unstream == id: OK
  6071. 142.56 s [vector] +++ OK, passed 100 tests.
  6072. 142.56 s [vector] eq: OK
  6073. 142.56 s [vector] +++ OK, passed 100 tests.
  6074. 142.56 s [vector] length: OK
  6075. 142.56 s [vector] +++ OK, passed 100 tests.
  6076. 142.56 s [vector] null: OK
  6077. 142.56 s [vector] +++ OK, passed 100 tests.
  6078. 142.56 s [vector] index: OK
  6079. 142.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6080. 142.56 s [vector] safeIndex: OK
  6081. 142.56 s [vector] +++ OK, passed 100 tests.
  6082. 142.56 s [vector] head: OK
  6083. 142.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6084. 142.57 s [vector] last: OK
  6085. 142.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6086. 142.57 s [vector] unsafeIndex: OK
  6087. 142.57 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6088. 142.57 s [vector] unsafeHead: OK
  6089. 142.57 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6090. 142.57 s [vector] unsafeLast: OK
  6091. 142.57 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6092. 142.57 s [vector] slice: OK
  6093. 142.57 s [vector] +++ OK, passed 100 tests.
  6094. 142.57 s [vector] init: OK
  6095. 142.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6096. 142.57 s [vector] tail: OK
  6097. 142.57 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6098. 142.57 s [vector] take: OK
  6099. 142.57 s [vector] +++ OK, passed 100 tests.
  6100. 142.57 s [vector] drop: OK
  6101. 142.57 s [vector] +++ OK, passed 100 tests.
  6102. 142.57 s [vector] splitAt: OK
  6103. 142.57 s [vector] +++ OK, passed 100 tests.
  6104. 142.57 s [vector] empty: OK
  6105. 142.57 s [vector] +++ OK, passed 100 tests.
  6106. 142.57 s [vector] singleton: OK
  6107. 142.57 s [vector] +++ OK, passed 100 tests.
  6108. 142.57 s [vector] replicate: OK
  6109. 142.57 s [vector] +++ OK, passed 100 tests.
  6110. 142.58 s [vector] generate: OK
  6111. 142.58 s [vector] +++ OK, passed 100 tests.
  6112. 142.58 s [vector] iterateN: OK
  6113. 142.59 s [vector] +++ OK, passed 100 tests.
  6114. 142.63 s [vector] iterateNM: OK (0.05s)
  6115. 142.63 s [vector] +++ OK, passed 100 tests.
  6116. 142.65 s [vector] generateM: OK (0.02s)
  6117. 142.65 s [vector] +++ OK, passed 100 tests.
  6118. 142.65 s [vector] replicateM: OK
  6119. 142.65 s [vector] +++ OK, passed 100 tests.
  6120. 142.65 s [vector] create: OK
  6121. 142.65 s [vector] +++ OK, passed 100 tests.
  6122. 142.66 s [vector] createT: OK
  6123. 142.66 s [vector] +++ OK, passed 100 tests.
  6124. 142.66 s [vector] unfoldr: OK
  6125. 142.66 s [vector] +++ OK, passed 100 tests.
  6126. 142.66 s [vector] unfoldrN: OK
  6127. 142.66 s [vector] +++ OK, passed 100 tests.
  6128. 142.66 s [vector] unfoldrExactN: OK
  6129. 142.66 s [vector] +++ OK, passed 100 tests.
  6130. 142.66 s [vector] unfoldrM: OK
  6131. 142.67 s [vector] +++ OK, passed 100 tests.
  6132. 142.69 s [vector] unfoldrNM: OK (0.01s)
  6133. 142.69 s [vector] +++ OK, passed 100 tests.
  6134. 142.71 s [vector] unfoldrExactNM: OK (0.03s)
  6135. 142.71 s [vector] +++ OK, passed 100 tests.
  6136. 142.73 s [vector] constructN: OK (0.01s)
  6137. 142.73 s [vector] +++ OK, passed 100 tests.
  6138. 142.73 s [vector] constructrN: OK (0.01s)
  6139. 142.73 s [vector] +++ OK, passed 100 tests.
  6140. 142.73 s [vector] cons: OK
  6141. 142.73 s [vector] +++ OK, passed 100 tests.
  6142. 142.73 s [vector] snoc: OK
  6143. 142.73 s [vector] +++ OK, passed 100 tests.
  6144. 142.73 s [vector] append: OK
  6145. 142.75 s [vector] +++ OK, passed 100 tests.
  6146. 142.75 s [vector] concat: OK (0.02s)
  6147. 142.75 s [vector] +++ OK, passed 100 tests.
  6148. 142.75 s [vector] force: OK
  6149. 142.75 s [vector] +++ OK, passed 100 tests.
  6150. 142.75 s [vector] upd: OK
  6151. 142.77 s [vector] +++ OK, passed 100 tests.
  6152. 142.77 s [vector] accum: OK (0.01s)
  6153. 142.77 s [vector] +++ OK, passed 100 tests.
  6154. 142.77 s [vector] reverse: OK
  6155. 142.77 s [vector] +++ OK, passed 100 tests.
  6156. 142.78 s [vector] backpermute: OK
  6157. 142.78 s [vector] +++ OK, passed 100 tests.
  6158. 142.78 s [vector] map: OK
  6159. 142.78 s [vector] +++ OK, passed 100 tests.
  6160. 142.78 s [vector] imap: OK
  6161. 142.79 s [vector] +++ OK, passed 100 tests.
  6162. 142.79 s [vector] concatMap: OK
  6163. 142.79 s [vector] +++ OK, passed 100 tests.
  6164. 142.80 s [vector] mapM: OK
  6165. 142.80 s [vector] +++ OK, passed 100 tests.
  6166. 142.83 s [vector] mapM_: OK (0.03s)
  6167. 142.83 s [vector] +++ OK, passed 100 tests.
  6168. 142.83 s [vector] forM: OK
  6169. 142.83 s [vector] +++ OK, passed 100 tests.
  6170. 142.87 s [vector] forM_: OK (0.03s)
  6171. 142.87 s [vector] +++ OK, passed 100 tests.
  6172. 142.89 s [vector] imapM: OK
  6173. 142.89 s [vector] +++ OK, passed 100 tests.
  6174. 142.91 s [vector] imapM_: OK (0.03s)
  6175. 142.91 s [vector] +++ OK, passed 100 tests.
  6176. 142.91 s [vector] zipWith: OK
  6177. 142.92 s [vector] +++ OK, passed 100 tests.
  6178. 142.93 s [vector] zipWith3: OK
  6179. 142.93 s [vector] +++ OK, passed 100 tests.
  6180. 142.93 s [vector] izipWith: OK
  6181. 142.93 s [vector] +++ OK, passed 100 tests.
  6182. 142.95 s [vector] izipWith3: OK
  6183. 142.95 s [vector] +++ OK, passed 100 tests.
  6184. 142.95 s [vector] izipWithM: OK
  6185. 142.95 s [vector] +++ OK, passed 100 tests.
  6186. 142.98 s [vector] izipWithM_: OK (0.03s)
  6187. 142.98 s [vector] +++ OK, passed 100 tests.
  6188. 142.99 s [vector] zipWithM: OK
  6189. 142.99 s [vector] +++ OK, passed 100 tests.
  6190. 143.01 s [vector] zipWithM_: OK (0.02s)
  6191. 143.01 s [vector] +++ OK, passed 100 tests.
  6192. 143.02 s [vector] filter: OK
  6193. 143.03 s [vector] +++ OK, passed 100 tests.
  6194. 143.03 s [vector] ifilter: OK
  6195. 143.03 s [vector] +++ OK, passed 100 tests.
  6196. 143.05 s [vector] filterM: OK (0.04s)
  6197. 143.06 s [vector] +++ OK, passed 100 tests.
  6198. 143.06 s [vector] uniq: OK
  6199. 143.06 s [vector] +++ OK, passed 100 tests.
  6200. 143.07 s [vector] mapMaybe: OK
  6201. 143.07 s [vector] +++ OK, passed 100 tests.
  6202. 143.07 s [vector] imapMaybe: OK
  6203. 143.07 s [vector] +++ OK, passed 100 tests.
  6204. 143.07 s [vector] takeWhile: OK
  6205. 143.07 s [vector] +++ OK, passed 100 tests.
  6206. 143.07 s [vector] dropWhile: OK
  6207. 143.07 s [vector] +++ OK, passed 100 tests.
  6208. 143.08 s [vector] partition: OK
  6209. 143.08 s [vector] +++ OK, passed 100 tests.
  6210. 143.08 s [vector] partitionWith: OK
  6211. 143.08 s [vector] +++ OK, passed 100 tests.
  6212. 143.08 s [vector] span: OK
  6213. 143.08 s [vector] +++ OK, passed 100 tests.
  6214. 143.08 s [vector] break: OK
  6215. 143.09 s [vector] +++ OK, passed 100 tests.
  6216. 143.09 s [vector] spanR: OK
  6217. 143.09 s [vector] +++ OK, passed 100 tests.
  6218. 143.09 s [vector] breakR: OK
  6219. 143.09 s [vector] +++ OK, passed 100 tests.
  6220. 143.10 s [vector] groupBy: OK
  6221. 143.10 s [vector] +++ OK, passed 100 tests.
  6222. 143.10 s [vector] elem: OK
  6223. 143.10 s [vector] +++ OK, passed 100 tests.
  6224. 143.10 s [vector] notElem: OK
  6225. 143.10 s [vector] +++ OK, passed 100 tests.
  6226. 143.10 s [vector] find: OK
  6227. 143.10 s [vector] +++ OK, passed 100 tests.
  6228. 143.10 s [vector] findIndex: OK
  6229. 143.10 s [vector] +++ OK, passed 100 tests.
  6230. 143.10 s [vector] findIndexR: OK
  6231. 143.10 s [vector] +++ OK, passed 100 tests.
  6232. 143.10 s [vector] findIndices: OK
  6233. 143.11 s [vector] +++ OK, passed 100 tests.
  6234. 143.11 s [vector] elemIndex: OK
  6235. 143.11 s [vector] +++ OK, passed 100 tests.
  6236. 143.11 s [vector] elemIndices: OK
  6237. 143.11 s [vector] +++ OK, passed 100 tests.
  6238. 143.12 s [vector] foldl: OK
  6239. 143.12 s [vector] +++ OK, passed 100 tests.
  6240. 143.12 s [vector] foldl1: OK
  6241. 143.13 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6242. 143.15 s [vector] foldl': OK (0.01s)
  6243. 143.15 s [vector] +++ OK, passed 100 tests.
  6244. 143.15 s [vector] foldl1': OK (0.01s)
  6245. 143.15 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6246. 143.17 s [vector] foldr: OK (0.01s)
  6247. 143.17 s [vector] +++ OK, passed 100 tests.
  6248. 143.17 s [vector] foldr1: OK
  6249. 143.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6250. 143.19 s [vector] foldr': OK (0.01s)
  6251. 143.19 s [vector] +++ OK, passed 100 tests.
  6252. 143.19 s [vector] foldr1': OK
  6253. 143.19 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6254. 143.21 s [vector] ifoldl: OK (0.01s)
  6255. 143.21 s [vector] +++ OK, passed 100 tests.
  6256. 143.21 s [vector] ifoldl': OK (0.01s)
  6257. 143.21 s [vector] +++ OK, passed 100 tests.
  6258. 143.23 s [vector] ifoldr: OK (0.01s)
  6259. 143.23 s [vector] +++ OK, passed 100 tests.
  6260. 143.23 s [vector] ifoldr': OK
  6261. 143.23 s [vector] +++ OK, passed 100 tests.
  6262. 143.25 s [vector] ifoldM: OK (0.01s)
  6263. 143.25 s [vector] +++ OK, passed 100 tests.
  6264. 143.25 s [vector] ifoldM': OK (0.01s)
  6265. 143.25 s [vector] +++ OK, passed 100 tests.
  6266. 143.29 s [vector] ifoldM_: OK (0.02s)
  6267. 143.29 s [vector] +++ OK, passed 100 tests.
  6268. 143.32 s [vector] ifoldM'_: OK (0.03s)
  6269. 143.32 s [vector] +++ OK, passed 100 tests.
  6270. 143.32 s [vector] all: OK
  6271. 143.32 s [vector] +++ OK, passed 100 tests.
  6272. 143.32 s [vector] any: OK
  6273. 143.32 s [vector] +++ OK, passed 100 tests.
  6274. 143.33 s [vector] prescanl: OK (0.01s)
  6275. 143.33 s [vector] +++ OK, passed 100 tests.
  6276. 143.35 s [vector] prescanl': OK (0.01s)
  6277. 143.35 s [vector] +++ OK, passed 100 tests.
  6278. 143.36 s [vector] postscanl: OK (0.01s)
  6279. 143.37 s [vector] +++ OK, passed 100 tests.
  6280. 143.37 s [vector] postscanl': OK (0.01s)
  6281. 143.38 s [vector] +++ OK, passed 100 tests.
  6282. 143.38 s [vector] scanl: OK
  6283. 143.38 s [vector] +++ OK, passed 100 tests.
  6284. 143.39 s [vector] scanl': OK (0.01s)
  6285. 143.39 s [vector] +++ OK, passed 100 tests.
  6286. 143.39 s [vector] scanl1: OK (0.01s)
  6287. 143.39 s [vector] +++ OK, passed 100 tests.
  6288. 143.41 s [vector] scanl1': OK (0.01s)
  6289. 143.41 s [vector] +++ OK, passed 100 tests.
  6290. 143.42 s [vector] iscanl: OK (0.01s)
  6291. 143.43 s [vector] +++ OK, passed 100 tests.
  6292. 143.43 s [vector] iscanl': OK (0.01s)
  6293. 143.43 s [vector] +++ OK, passed 100 tests.
  6294. 143.45 s [vector] prescanr: OK (0.01s)
  6295. 143.45 s [vector] +++ OK, passed 100 tests.
  6296. 143.45 s [vector] prescanr': OK (0.01s)
  6297. 143.45 s [vector] +++ OK, passed 100 tests.
  6298. 143.46 s [vector] postscanr: OK
  6299. 143.46 s [vector] +++ OK, passed 100 tests.
  6300. 143.47 s [vector] postscanr': OK
  6301. 143.47 s [vector] +++ OK, passed 100 tests.
  6302. 143.49 s [vector] scanr: OK (0.01s)
  6303. 143.49 s [vector] +++ OK, passed 100 tests.
  6304. 143.49 s [vector] scanr': OK (0.01s)
  6305. 143.49 s [vector] +++ OK, passed 100 tests.
  6306. 143.50 s [vector] scanr1: OK
  6307. 143.50 s [vector] +++ OK, passed 100 tests.
  6308. 143.51 s [vector] scanr1': OK
  6309. 143.51 s [vector] +++ OK, passed 100 tests.
  6310. 143.53 s [vector] iscanr: OK (0.01s)
  6311. 143.53 s [vector] +++ OK, passed 100 tests.
  6312. 143.53 s [vector] iscanr': OK (0.01s)
  6313. 143.53 s [vector] +++ OK, passed 100 tests.
  6314. 143.53 s [vector] mut_read: OK
  6315. 143.53 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6316. 143.53 s [vector] mut_write: OK
  6317. 143.53 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6318. 143.53 s [vector] mut_modify: OK
  6319. 143.53 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6320. 143.53 s [vector] mut_generate: OK
  6321. 143.55 s [vector] +++ OK, passed 100 tests.
  6322. 143.55 s [vector] mut_generateM: OK (0.01s)
  6323. 143.55 s [vector] +++ OK, passed 100 tests.
  6324. 143.58 s [vector] mut_mapM_: OK (0.03s)
  6325. 143.58 s [vector] +++ OK, passed 100 tests.
  6326. 143.63 s [vector] mut_imapM_: OK (0.02s)
  6327. 143.63 s [vector] +++ OK, passed 100 tests.
  6328. 143.65 s [vector] mut_forM_: OK (0.03s)
  6329. 143.65 s [vector] +++ OK, passed 100 tests.
  6330. 143.69 s [vector] mut_iforM_: OK (0.03s)
  6331. 143.69 s [vector] +++ OK, passed 100 tests.
  6332. 143.69 s [vector] mut_foldr: OK (0.01s)
  6333. 143.70 s [vector] +++ OK, passed 100 tests.
  6334. 143.70 s [vector] mut_foldr': OK
  6335. 143.70 s [vector] +++ OK, passed 100 tests.
  6336. 143.71 s [vector] mut_foldl: OK
  6337. 143.71 s [vector] +++ OK, passed 100 tests.
  6338. 143.73 s [vector] mut_foldl': OK (0.01s)
  6339. 143.73 s [vector] +++ OK, passed 100 tests.
  6340. 143.74 s [vector] mut_ifoldr: OK (0.01s)
  6341. 143.74 s [vector] +++ OK, passed 100 tests.
  6342. 143.74 s [vector] mut_ifoldr': OK (0.01s)
  6343. 143.74 s [vector] +++ OK, passed 100 tests.
  6344. 143.75 s [vector] mut_ifoldl: OK
  6345. 143.75 s [vector] +++ OK, passed 100 tests.
  6346. 143.76 s [vector] mut_ifoldl': OK (0.01s)
  6347. 143.76 s [vector] +++ OK, passed 100 tests.
  6348. 143.79 s [vector] mut_foldM: OK
  6349. 143.79 s [vector] +++ OK, passed 100 tests.
  6350. 143.79 s [vector] mut_foldM': OK (0.01s)
  6351. 143.79 s [vector] +++ OK, passed 100 tests.
  6352. 143.81 s [vector] mut_foldrM: OK (0.01s)
  6353. 143.81 s [vector] +++ OK, passed 100 tests.
  6354. 143.81 s [vector] mut_foldrM': OK
  6355. 143.81 s [vector] +++ OK, passed 100 tests.
  6356. 143.83 s [vector] mut_ifoldM: OK (0.01s)
  6357. 143.83 s [vector] +++ OK, passed 100 tests.
  6358. 143.84 s [vector] mut_ifoldM': OK (0.01s)
  6359. 143.84 s [vector] +++ OK, passed 100 tests.
  6360. 143.85 s [vector] mut_ifoldrM: OK (0.01s)
  6361. 143.85 s [vector] +++ OK, passed 100 tests.
  6362. 143.85 s [vector] mut_ifoldrM': OK (0.01s)
  6363. 143.85 s [vector] +++ OK, passed 100 tests.
  6364. 143.86 s [vector] compare: OK
  6365. 143.86 s [vector] +++ OK, passed 100 tests.
  6366. 143.86 s [vector] maximum: OK
  6367. 143.86 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6368. 143.86 s [vector] minimum: OK
  6369. 143.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6370. 143.86 s [vector] minIndex: OK
  6371. 143.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6372. 143.86 s [vector] maxIndex: OK
  6373. 143.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6374. 143.86 s [vector] maximumBy: OK
  6375. 143.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6376. 143.86 s [vector] minimumBy: OK
  6377. 143.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6378. 143.86 s [vector] maximumOn: OK
  6379. 143.86 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6380. 143.86 s [vector] minimumOn: OK
  6381. 143.86 s [vector] +++ OK, passed 100 tests; 11 discarded.
  6382. 143.86 s [vector] maxIndexBy: OK
  6383. 143.86 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6384. 143.86 s [vector] minIndexBy: OK
  6385. 143.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6386. 143.86 s [vector] ListFirstMaxIndexWins: OK
  6387. 143.86 s [vector] +++ OK, passed 100 tests; 22 discarded.
  6388. 143.87 s [vector] FalseListFirstMaxIndexWins: OK
  6389. 143.87 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  6390. 143.87 s [vector] []
  6391. 143.87 s [vector] zip: OK
  6392. 143.87 s [vector] +++ OK, passed 100 tests.
  6393. 143.87 s [vector] zip3: OK
  6394. 143.87 s [vector] +++ OK, passed 100 tests.
  6395. 143.87 s [vector] unzip: OK
  6396. 143.87 s [vector] +++ OK, passed 100 tests.
  6397. 143.88 s [vector] unzip3: OK
  6398. 143.88 s [vector] +++ OK, passed 100 tests.
  6399. 143.88 s [vector] indexed: OK
  6400. 143.88 s [vector] +++ OK, passed 100 tests.
  6401. 143.88 s [vector] update: OK
  6402. 143.89 s [vector] +++ OK, passed 100 tests.
  6403. 143.89 s [vector] mempty: OK
  6404. 143.89 s [vector] +++ OK, passed 100 tests.
  6405. 143.89 s [vector] mappend: OK
  6406. 143.89 s [vector] +++ OK, passed 100 tests.
  6407. 143.90 s [vector] mconcat: OK (0.02s)
  6408. 143.90 s [vector] +++ OK, passed 100 tests.
  6409. 143.91 s [vector] glength: OK
  6410. 143.91 s [vector] +++ OK, passed 100 tests.
  6411. 143.91 s [vector] sum: OK
  6412. 143.91 s [vector] +++ OK, passed 100 tests.
  6413. 143.91 s [vector] product: OK
  6414. 143.91 s [vector] +++ OK, passed 100 tests.
  6415. 143.91 s [vector] enumFromN: OK
  6416. 143.91 s [vector] +++ OK, passed 100 tests.
  6417. 143.91 s [vector] enumFromThenN: OK
  6418. 143.91 s [vector] +++ OK, passed 100 tests.
  6419. 143.91 s [vector] enumFromTo: OK
  6420. 143.91 s [vector] +++ OK, passed 100 tests.
  6421. 143.91 s [vector] enumFromThenTo: OK
  6422. 143.91 s [vector] +++ OK, passed 100 tests; 3 discarded.
  6423. 143.91 s [vector] (Int,Bool)
  6424. 143.91 s [vector] fromList.toList == id: OK
  6425. 143.91 s [vector] +++ OK, passed 100 tests.
  6426. 143.91 s [vector] toList.fromList == id: OK
  6427. 143.91 s [vector] +++ OK, passed 100 tests.
  6428. 143.91 s [vector] unstream.stream == id: OK
  6429. 143.91 s [vector] +++ OK, passed 100 tests.
  6430. 143.91 s [vector] stream.unstream == id: OK
  6431. 143.91 s [vector] +++ OK, passed 100 tests.
  6432. 143.91 s [vector] eq: OK
  6433. 143.92 s [vector] +++ OK, passed 100 tests.
  6434. 143.92 s [vector] length: OK
  6435. 143.92 s [vector] +++ OK, passed 100 tests.
  6436. 143.92 s [vector] null: OK
  6437. 143.92 s [vector] +++ OK, passed 100 tests.
  6438. 143.92 s [vector] index: OK
  6439. 143.92 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6440. 143.92 s [vector] safeIndex: OK
  6441. 143.92 s [vector] +++ OK, passed 100 tests.
  6442. 143.92 s [vector] head: OK
  6443. 143.92 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6444. 143.92 s [vector] last: OK
  6445. 143.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6446. 143.92 s [vector] unsafeIndex: OK
  6447. 143.92 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6448. 143.92 s [vector] unsafeHead: OK
  6449. 143.92 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6450. 143.92 s [vector] unsafeLast: OK
  6451. 143.92 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6452. 143.92 s [vector] slice: OK
  6453. 143.92 s [vector] +++ OK, passed 100 tests.
  6454. 143.92 s [vector] init: OK
  6455. 143.93 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6456. 143.93 s [vector] tail: OK
  6457. 143.93 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6458. 143.93 s [vector] take: OK
  6459. 143.93 s [vector] +++ OK, passed 100 tests.
  6460. 143.93 s [vector] drop: OK
  6461. 143.93 s [vector] +++ OK, passed 100 tests.
  6462. 143.93 s [vector] splitAt: OK
  6463. 143.93 s [vector] +++ OK, passed 100 tests.
  6464. 143.93 s [vector] empty: OK
  6465. 143.93 s [vector] +++ OK, passed 100 tests.
  6466. 143.93 s [vector] singleton: OK
  6467. 143.93 s [vector] +++ OK, passed 100 tests.
  6468. 143.93 s [vector] replicate: OK
  6469. 143.93 s [vector] +++ OK, passed 100 tests.
  6470. 143.93 s [vector] generate: OK
  6471. 143.93 s [vector] +++ OK, passed 100 tests.
  6472. 143.95 s [vector] iterateN: OK
  6473. 143.95 s [vector] +++ OK, passed 100 tests.
  6474. 143.97 s [vector] iterateNM: OK (0.02s)
  6475. 143.97 s [vector] +++ OK, passed 100 tests.
  6476. 144.00 s [vector] generateM: OK (0.04s)
  6477. 144.00 s [vector] +++ OK, passed 100 tests.
  6478. 144.00 s [vector] replicateM: OK
  6479. 144.00 s [vector] +++ OK, passed 100 tests.
  6480. 144.00 s [vector] create: OK
  6481. 144.00 s [vector] +++ OK, passed 100 tests.
  6482. 144.00 s [vector] createT: OK
  6483. 144.00 s [vector] +++ OK, passed 100 tests.
  6484. 144.01 s [vector] unfoldr: OK
  6485. 144.01 s [vector] +++ OK, passed 100 tests.
  6486. 144.01 s [vector] unfoldrN: OK
  6487. 144.01 s [vector] +++ OK, passed 100 tests.
  6488. 144.01 s [vector] unfoldrExactN: OK
  6489. 144.01 s [vector] +++ OK, passed 100 tests.
  6490. 144.01 s [vector] unfoldrM: OK
  6491. 144.01 s [vector] +++ OK, passed 100 tests.
  6492. 144.03 s [vector] unfoldrNM: OK
  6493. 144.03 s [vector] +++ OK, passed 100 tests.
  6494. 144.06 s [vector] unfoldrExactNM: OK (0.04s)
  6495. 144.06 s [vector] +++ OK, passed 100 tests.
  6496. 144.06 s [vector] constructN: OK
  6497. 144.06 s [vector] +++ OK, passed 100 tests.
  6498. 144.06 s [vector] constructrN: OK
  6499. 144.06 s [vector] +++ OK, passed 100 tests.
  6500. 144.06 s [vector] cons: OK
  6501. 144.06 s [vector] +++ OK, passed 100 tests.
  6502. 144.06 s [vector] snoc: OK
  6503. 144.07 s [vector] +++ OK, passed 100 tests.
  6504. 144.07 s [vector] append: OK
  6505. 144.07 s [vector] +++ OK, passed 100 tests.
  6506. 144.11 s [vector] concat: OK (0.04s)
  6507. 144.11 s [vector] +++ OK, passed 100 tests.
  6508. 144.11 s [vector] force: OK
  6509. 144.11 s [vector] +++ OK, passed 100 tests.
  6510. 144.12 s [vector] upd: OK
  6511. 144.12 s [vector] +++ OK, passed 100 tests.
  6512. 144.12 s [vector] accum: OK
  6513. 144.12 s [vector] +++ OK, passed 100 tests.
  6514. 144.12 s [vector] reverse: OK
  6515. 144.12 s [vector] +++ OK, passed 100 tests.
  6516. 144.13 s [vector] backpermute: OK
  6517. 144.13 s [vector] +++ OK, passed 100 tests.
  6518. 144.13 s [vector] map: OK
  6519. 144.13 s [vector] +++ OK, passed 100 tests.
  6520. 144.13 s [vector] imap: OK
  6521. 144.13 s [vector] +++ OK, passed 100 tests.
  6522. 144.14 s [vector] concatMap: OK
  6523. 144.14 s [vector] +++ OK, passed 100 tests.
  6524. 144.15 s [vector] mapM: OK
  6525. 144.15 s [vector] +++ OK, passed 100 tests.
  6526. 144.17 s [vector] mapM_: OK (0.03s)
  6527. 144.17 s [vector] +++ OK, passed 100 tests.
  6528. 144.19 s [vector] forM: OK
  6529. 144.19 s [vector] +++ OK, passed 100 tests.
  6530. 144.21 s [vector] forM_: OK (0.03s)
  6531. 144.21 s [vector] +++ OK, passed 100 tests.
  6532. 144.23 s [vector] imapM: OK
  6533. 144.23 s [vector] +++ OK, passed 100 tests.
  6534. 144.25 s [vector] imapM_: OK (0.03s)
  6535. 144.25 s [vector] +++ OK, passed 100 tests.
  6536. 144.25 s [vector] zipWith: OK
  6537. 144.25 s [vector] +++ OK, passed 100 tests.
  6538. 144.26 s [vector] zipWith3: OK
  6539. 144.26 s [vector] +++ OK, passed 100 tests.
  6540. 144.26 s [vector] izipWith: OK
  6541. 144.26 s [vector] +++ OK, passed 100 tests.
  6542. 144.27 s [vector] izipWith3: OK
  6543. 144.27 s [vector] +++ OK, passed 100 tests.
  6544. 144.27 s [vector] izipWithM: OK
  6545. 144.27 s [vector] +++ OK, passed 100 tests.
  6546. 144.30 s [vector] izipWithM_: OK (0.02s)
  6547. 144.31 s [vector] +++ OK, passed 100 tests.
  6548. 144.31 s [vector] zipWithM: OK
  6549. 144.31 s [vector] +++ OK, passed 100 tests.
  6550. 144.32 s [vector] zipWithM_: OK (0.02s)
  6551. 144.32 s [vector] +++ OK, passed 100 tests.
  6552. 144.32 s [vector] filter: OK
  6553. 144.32 s [vector] +++ OK, passed 100 tests.
  6554. 144.32 s [vector] ifilter: OK
  6555. 144.33 s [vector] +++ OK, passed 100 tests.
  6556. 144.37 s [vector] filterM: OK (0.04s)
  6557. 144.37 s [vector] +++ OK, passed 100 tests.
  6558. 144.37 s [vector] uniq: OK
  6559. 144.37 s [vector] +++ OK, passed 100 tests.
  6560. 144.37 s [vector] mapMaybe: OK
  6561. 144.37 s [vector] +++ OK, passed 100 tests.
  6562. 144.37 s [vector] imapMaybe: OK
  6563. 144.38 s [vector] +++ OK, passed 100 tests.
  6564. 144.38 s [vector] takeWhile: OK
  6565. 144.38 s [vector] +++ OK, passed 100 tests.
  6566. 144.38 s [vector] dropWhile: OK
  6567. 144.38 s [vector] +++ OK, passed 100 tests.
  6568. 144.38 s [vector] partition: OK
  6569. 144.38 s [vector] +++ OK, passed 100 tests.
  6570. 144.38 s [vector] partitionWith: OK
  6571. 144.38 s [vector] +++ OK, passed 100 tests.
  6572. 144.39 s [vector] span: OK
  6573. 144.39 s [vector] +++ OK, passed 100 tests.
  6574. 144.39 s [vector] break: OK
  6575. 144.39 s [vector] +++ OK, passed 100 tests.
  6576. 144.39 s [vector] spanR: OK
  6577. 144.39 s [vector] +++ OK, passed 100 tests.
  6578. 144.39 s [vector] breakR: OK
  6579. 144.39 s [vector] +++ OK, passed 100 tests.
  6580. 144.40 s [vector] groupBy: OK
  6581. 144.40 s [vector] +++ OK, passed 100 tests.
  6582. 144.40 s [vector] elem: OK
  6583. 144.40 s [vector] +++ OK, passed 100 tests.
  6584. 144.40 s [vector] notElem: OK
  6585. 144.40 s [vector] +++ OK, passed 100 tests.
  6586. 144.40 s [vector] find: OK
  6587. 144.40 s [vector] +++ OK, passed 100 tests.
  6588. 144.40 s [vector] findIndex: OK
  6589. 144.40 s [vector] +++ OK, passed 100 tests.
  6590. 144.40 s [vector] findIndexR: OK
  6591. 144.40 s [vector] +++ OK, passed 100 tests.
  6592. 144.40 s [vector] findIndices: OK
  6593. 144.40 s [vector] +++ OK, passed 100 tests.
  6594. 144.40 s [vector] elemIndex: OK
  6595. 144.40 s [vector] +++ OK, passed 100 tests.
  6596. 144.41 s [vector] elemIndices: OK
  6597. 144.41 s [vector] +++ OK, passed 100 tests.
  6598. 144.41 s [vector] foldl: OK
  6599. 144.41 s [vector] +++ OK, passed 100 tests.
  6600. 144.41 s [vector] foldl1: OK
  6601. 144.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6602. 144.42 s [vector] foldl': OK
  6603. 144.42 s [vector] +++ OK, passed 100 tests.
  6604. 144.42 s [vector] foldl1': OK
  6605. 144.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6606. 144.43 s [vector] foldr: OK
  6607. 144.43 s [vector] +++ OK, passed 100 tests.
  6608. 144.43 s [vector] foldr1: OK
  6609. 144.43 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6610. 144.43 s [vector] foldr': OK
  6611. 144.43 s [vector] +++ OK, passed 100 tests.
  6612. 144.44 s [vector] foldr1': OK
  6613. 144.44 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6614. 144.45 s [vector] ifoldl: OK
  6615. 144.45 s [vector] +++ OK, passed 100 tests.
  6616. 144.45 s [vector] ifoldl': OK
  6617. 144.45 s [vector] +++ OK, passed 100 tests.
  6618. 144.45 s [vector] ifoldr: OK
  6619. 144.45 s [vector] +++ OK, passed 100 tests.
  6620. 144.46 s [vector] ifoldr': OK
  6621. 144.46 s [vector] +++ OK, passed 100 tests.
  6622. 144.46 s [vector] ifoldM: OK
  6623. 144.46 s [vector] +++ OK, passed 100 tests.
  6624. 144.47 s [vector] ifoldM': OK
  6625. 144.47 s [vector] +++ OK, passed 100 tests.
  6626. 144.51 s [vector] ifoldM_: OK (0.03s)
  6627. 144.51 s [vector] +++ OK, passed 100 tests.
  6628. 144.53 s [vector] ifoldM'_: OK (0.03s)
  6629. 144.53 s [vector] +++ OK, passed 100 tests.
  6630. 144.53 s [vector] all: OK
  6631. 144.53 s [vector] +++ OK, passed 100 tests.
  6632. 144.53 s [vector] any: OK
  6633. 144.53 s [vector] +++ OK, passed 100 tests.
  6634. 144.53 s [vector] prescanl: OK
  6635. 144.53 s [vector] +++ OK, passed 100 tests.
  6636. 144.54 s [vector] prescanl': OK
  6637. 144.54 s [vector] +++ OK, passed 100 tests.
  6638. 144.54 s [vector] postscanl: OK
  6639. 144.55 s [vector] +++ OK, passed 100 tests.
  6640. 144.56 s [vector] postscanl': OK
  6641. 144.56 s [vector] +++ OK, passed 100 tests.
  6642. 144.56 s [vector] scanl: OK
  6643. 144.56 s [vector] +++ OK, passed 100 tests.
  6644. 144.57 s [vector] scanl': OK
  6645. 144.57 s [vector] +++ OK, passed 100 tests.
  6646. 144.57 s [vector] scanl1: OK
  6647. 144.57 s [vector] +++ OK, passed 100 tests.
  6648. 144.57 s [vector] scanl1': OK
  6649. 144.57 s [vector] +++ OK, passed 100 tests.
  6650. 144.58 s [vector] iscanl: OK
  6651. 144.58 s [vector] +++ OK, passed 100 tests.
  6652. 144.58 s [vector] iscanl': OK
  6653. 144.59 s [vector] +++ OK, passed 100 tests.
  6654. 144.59 s [vector] prescanr: OK
  6655. 144.59 s [vector] +++ OK, passed 100 tests.
  6656. 144.60 s [vector] prescanr': OK
  6657. 144.60 s [vector] +++ OK, passed 100 tests.
  6658. 144.60 s [vector] postscanr: OK
  6659. 144.60 s [vector] +++ OK, passed 100 tests.
  6660. 144.60 s [vector] postscanr': OK
  6661. 144.61 s [vector] +++ OK, passed 100 tests.
  6662. 144.61 s [vector] scanr: OK
  6663. 144.61 s [vector] +++ OK, passed 100 tests.
  6664. 144.62 s [vector] scanr': OK
  6665. 144.62 s [vector] +++ OK, passed 100 tests.
  6666. 144.62 s [vector] scanr1: OK
  6667. 144.62 s [vector] +++ OK, passed 100 tests.
  6668. 144.62 s [vector] scanr1': OK
  6669. 144.63 s [vector] +++ OK, passed 100 tests.
  6670. 144.63 s [vector] iscanr: OK
  6671. 144.63 s [vector] +++ OK, passed 100 tests.
  6672. 144.64 s [vector] iscanr': OK
  6673. 144.64 s [vector] +++ OK, passed 100 tests.
  6674. 144.64 s [vector] mut_read: OK
  6675. 144.64 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6676. 144.64 s [vector] mut_write: OK
  6677. 144.64 s [vector] +++ OK, passed 100 tests; 13 discarded.
  6678. 144.64 s [vector] mut_modify: OK
  6679. 144.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6680. 144.65 s [vector] mut_generate: OK
  6681. 144.65 s [vector] +++ OK, passed 100 tests.
  6682. 144.67 s [vector] mut_generateM: OK (0.02s)
  6683. 144.67 s [vector] +++ OK, passed 100 tests.
  6684. 144.69 s [vector] mut_mapM_: OK (0.03s)
  6685. 144.69 s [vector] +++ OK, passed 100 tests.
  6686. 144.73 s [vector] mut_imapM_: OK (0.03s)
  6687. 144.73 s [vector] +++ OK, passed 100 tests.
  6688. 144.75 s [vector] mut_forM_: OK (0.03s)
  6689. 144.75 s [vector] +++ OK, passed 100 tests.
  6690. 144.78 s [vector] mut_iforM_: OK (0.03s)
  6691. 144.78 s [vector] +++ OK, passed 100 tests.
  6692. 144.79 s [vector] mut_foldr: OK
  6693. 144.79 s [vector] +++ OK, passed 100 tests.
  6694. 144.79 s [vector] mut_foldr': OK
  6695. 144.79 s [vector] +++ OK, passed 100 tests.
  6696. 144.79 s [vector] mut_foldl: OK
  6697. 144.79 s [vector] +++ OK, passed 100 tests.
  6698. 144.79 s [vector] mut_foldl': OK
  6699. 144.79 s [vector] +++ OK, passed 100 tests.
  6700. 144.80 s [vector] mut_ifoldr: OK
  6701. 144.80 s [vector] +++ OK, passed 100 tests.
  6702. 144.80 s [vector] mut_ifoldr': OK
  6703. 144.81 s [vector] +++ OK, passed 100 tests.
  6704. 144.81 s [vector] mut_ifoldl: OK
  6705. 144.81 s [vector] +++ OK, passed 100 tests.
  6706. 144.82 s [vector] mut_ifoldl': OK
  6707. 144.82 s [vector] +++ OK, passed 100 tests.
  6708. 144.82 s [vector] mut_foldM: OK
  6709. 144.82 s [vector] +++ OK, passed 100 tests.
  6710. 144.82 s [vector] mut_foldM': OK
  6711. 144.83 s [vector] +++ OK, passed 100 tests.
  6712. 144.83 s [vector] mut_foldrM: OK
  6713. 144.83 s [vector] +++ OK, passed 100 tests.
  6714. 144.84 s [vector] mut_foldrM': OK
  6715. 144.84 s [vector] +++ OK, passed 100 tests.
  6716. 144.85 s [vector] mut_ifoldM: OK
  6717. 144.85 s [vector] +++ OK, passed 100 tests.
  6718. 144.85 s [vector] mut_ifoldM': OK
  6719. 144.85 s [vector] +++ OK, passed 100 tests.
  6720. 144.85 s [vector] mut_ifoldrM: OK
  6721. 144.85 s [vector] +++ OK, passed 100 tests.
  6722. 144.85 s [vector] mut_ifoldrM': OK
  6723. 144.85 s [vector] +++ OK, passed 100 tests.
  6724. 144.85 s [vector] compare: OK
  6725. 144.85 s [vector] +++ OK, passed 100 tests.
  6726. 144.85 s [vector] maximum: OK
  6727. 144.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6728. 144.86 s [vector] minimum: OK
  6729. 144.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6730. 144.86 s [vector] minIndex: OK
  6731. 144.86 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6732. 144.86 s [vector] maxIndex: OK
  6733. 144.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6734. 144.86 s [vector] maximumBy: OK
  6735. 144.86 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6736. 144.86 s [vector] minimumBy: OK
  6737. 144.86 s [vector] +++ OK, passed 100 tests; 15 discarded.
  6738. 144.86 s [vector] maximumOn: OK
  6739. 144.86 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6740. 144.86 s [vector] minimumOn: OK
  6741. 144.86 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6742. 144.86 s [vector] maxIndexBy: OK
  6743. 144.86 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6744. 144.86 s [vector] minIndexBy: OK
  6745. 144.87 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6746. 144.87 s [vector] ListFirstMaxIndexWins: OK
  6747. 144.87 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6748. 144.87 s [vector] FalseListFirstMaxIndexWins: OK
  6749. 144.87 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  6750. 144.87 s [vector] []
  6751. 144.87 s [vector] zip: OK
  6752. 144.87 s [vector] +++ OK, passed 100 tests.
  6753. 144.88 s [vector] zip3: OK
  6754. 144.88 s [vector] +++ OK, passed 100 tests.
  6755. 144.88 s [vector] unzip: OK
  6756. 144.88 s [vector] +++ OK, passed 100 tests.
  6757. 144.88 s [vector] unzip3: OK
  6758. 144.88 s [vector] +++ OK, passed 100 tests.
  6759. 144.88 s [vector] indexed: OK
  6760. 144.89 s [vector] +++ OK, passed 100 tests.
  6761. 144.89 s [vector] update: OK
  6762. 144.90 s [vector] +++ OK, passed 100 tests.
  6763. 144.90 s [vector] mempty: OK
  6764. 144.90 s [vector] +++ OK, passed 100 tests.
  6765. 144.90 s [vector] mappend: OK
  6766. 144.91 s [vector] +++ OK, passed 100 tests.
  6767. 144.93 s [vector] mconcat: OK (0.03s)
  6768. 144.93 s [vector] +++ OK, passed 100 tests.
  6769. 144.93 s [vector] glength: OK
  6770. 144.93 s [vector] +++ OK, passed 100 tests.
  6771. 144.93 s [vector] (Int,Bool,Int)
  6772. 144.93 s [vector] fromList.toList == id: OK
  6773. 144.93 s [vector] +++ OK, passed 100 tests.
  6774. 144.93 s [vector] toList.fromList == id: OK
  6775. 144.93 s [vector] +++ OK, passed 100 tests.
  6776. 144.94 s [vector] unstream.stream == id: OK
  6777. 144.94 s [vector] +++ OK, passed 100 tests.
  6778. 144.94 s [vector] stream.unstream == id: OK
  6779. 144.94 s [vector] +++ OK, passed 100 tests.
  6780. 144.94 s [vector] eq: OK
  6781. 144.94 s [vector] +++ OK, passed 100 tests.
  6782. 144.94 s [vector] length: OK
  6783. 144.94 s [vector] +++ OK, passed 100 tests.
  6784. 144.94 s [vector] null: OK
  6785. 144.94 s [vector] +++ OK, passed 100 tests.
  6786. 144.94 s [vector] index: OK
  6787. 144.94 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6788. 144.94 s [vector] safeIndex: OK
  6789. 144.94 s [vector] +++ OK, passed 100 tests.
  6790. 144.94 s [vector] head: OK
  6791. 144.94 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6792. 144.94 s [vector] last: OK
  6793. 144.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6794. 144.95 s [vector] unsafeIndex: OK
  6795. 144.95 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6796. 144.95 s [vector] unsafeHead: OK
  6797. 144.95 s [vector] +++ OK, passed 100 tests; 19 discarded.
  6798. 144.95 s [vector] unsafeLast: OK
  6799. 144.95 s [vector] +++ OK, passed 100 tests; 12 discarded.
  6800. 144.95 s [vector] slice: OK
  6801. 144.95 s [vector] +++ OK, passed 100 tests.
  6802. 144.95 s [vector] init: OK
  6803. 144.95 s [vector] +++ OK, passed 100 tests; 14 discarded.
  6804. 144.95 s [vector] tail: OK
  6805. 144.95 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6806. 144.96 s [vector] take: OK
  6807. 144.96 s [vector] +++ OK, passed 100 tests.
  6808. 144.96 s [vector] drop: OK
  6809. 144.96 s [vector] +++ OK, passed 100 tests.
  6810. 144.96 s [vector] splitAt: OK
  6811. 144.96 s [vector] +++ OK, passed 100 tests.
  6812. 144.96 s [vector] empty: OK
  6813. 144.96 s [vector] +++ OK, passed 100 tests.
  6814. 144.96 s [vector] singleton: OK
  6815. 144.96 s [vector] +++ OK, passed 100 tests.
  6816. 144.96 s [vector] replicate: OK
  6817. 144.96 s [vector] +++ OK, passed 100 tests.
  6818. 144.97 s [vector] generate: OK
  6819. 144.97 s [vector] +++ OK, passed 100 tests.
  6820. 144.97 s [vector] iterateN: OK
  6821. 144.97 s [vector] +++ OK, passed 100 tests.
  6822. 144.99 s [vector] iterateNM: OK (0.02s)
  6823. 144.99 s [vector] +++ OK, passed 100 tests.
  6824. 145.03 s [vector] generateM: OK (0.04s)
  6825. 145.03 s [vector] +++ OK, passed 100 tests.
  6826. 145.05 s [vector] replicateM: OK (0.01s)
  6827. 145.05 s [vector] +++ OK, passed 100 tests.
  6828. 145.05 s [vector] create: OK
  6829. 145.05 s [vector] +++ OK, passed 100 tests.
  6830. 145.05 s [vector] createT: OK
  6831. 145.05 s [vector] +++ OK, passed 100 tests.
  6832. 145.05 s [vector] unfoldr: OK
  6833. 145.05 s [vector] +++ OK, passed 100 tests.
  6834. 145.05 s [vector] unfoldrN: OK
  6835. 145.05 s [vector] +++ OK, passed 100 tests.
  6836. 145.06 s [vector] unfoldrExactN: OK
  6837. 145.06 s [vector] +++ OK, passed 100 tests.
  6838. 145.06 s [vector] unfoldrM: OK
  6839. 145.06 s [vector] +++ OK, passed 100 tests.
  6840. 145.06 s [vector] unfoldrNM: OK
  6841. 145.07 s [vector] +++ OK, passed 100 tests.
  6842. 145.10 s [vector] unfoldrExactNM: OK (0.04s)
  6843. 145.11 s [vector] +++ OK, passed 100 tests.
  6844. 145.11 s [vector] constructN: OK
  6845. 145.11 s [vector] +++ OK, passed 100 tests.
  6846. 145.11 s [vector] constructrN: OK
  6847. 145.11 s [vector] +++ OK, passed 100 tests.
  6848. 145.12 s [vector] cons: OK
  6849. 145.12 s [vector] +++ OK, passed 100 tests.
  6850. 145.12 s [vector] snoc: OK
  6851. 145.12 s [vector] +++ OK, passed 100 tests.
  6852. 145.12 s [vector] append: OK
  6853. 145.12 s [vector] +++ OK, passed 100 tests.
  6854. 145.18 s [vector] concat: OK (0.06s)
  6855. 145.18 s [vector] +++ OK, passed 100 tests.
  6856. 145.19 s [vector] force: OK
  6857. 145.19 s [vector] +++ OK, passed 100 tests.
  6858. 145.19 s [vector] upd: OK
  6859. 145.20 s [vector] +++ OK, passed 100 tests.
  6860. 145.20 s [vector] accum: OK (0.01s)
  6861. 145.20 s [vector] +++ OK, passed 100 tests.
  6862. 145.20 s [vector] reverse: OK
  6863. 145.20 s [vector] +++ OK, passed 100 tests.
  6864. 145.20 s [vector] backpermute: OK
  6865. 145.20 s [vector] +++ OK, passed 100 tests.
  6866. 145.21 s [vector] map: OK
  6867. 145.21 s [vector] +++ OK, passed 100 tests.
  6868. 145.21 s [vector] imap: OK
  6869. 145.21 s [vector] +++ OK, passed 100 tests.
  6870. 145.22 s [vector] concatMap: OK
  6871. 145.22 s [vector] +++ OK, passed 100 tests.
  6872. 145.22 s [vector] mapM: OK
  6873. 145.22 s [vector] +++ OK, passed 100 tests.
  6874. 145.27 s [vector] mapM_: OK (0.04s)
  6875. 145.27 s [vector] +++ OK, passed 100 tests.
  6876. 145.27 s [vector] forM: OK
  6877. 145.27 s [vector] +++ OK, passed 100 tests.
  6878. 145.32 s [vector] forM_: OK (0.05s)
  6879. 145.33 s [vector] +++ OK, passed 100 tests.
  6880. 145.33 s [vector] imapM: OK
  6881. 145.33 s [vector] +++ OK, passed 100 tests.
  6882. 145.37 s [vector] imapM_: OK (0.05s)
  6883. 145.37 s [vector] +++ OK, passed 100 tests.
  6884. 145.38 s [vector] zipWith: OK
  6885. 145.38 s [vector] +++ OK, passed 100 tests.
  6886. 145.38 s [vector] zipWith3: OK
  6887. 145.39 s [vector] +++ OK, passed 100 tests.
  6888. 145.40 s [vector] izipWith: OK
  6889. 145.41 s [vector] +++ OK, passed 100 tests.
  6890. 145.41 s [vector] izipWith3: OK
  6891. 145.41 s [vector] +++ OK, passed 100 tests.
  6892. 145.41 s [vector] izipWithM: OK
  6893. 145.41 s [vector] +++ OK, passed 100 tests.
  6894. 145.45 s [vector] izipWithM_: OK (0.03s)
  6895. 145.45 s [vector] +++ OK, passed 100 tests.
  6896. 145.45 s [vector] zipWithM: OK
  6897. 145.45 s [vector] +++ OK, passed 100 tests.
  6898. 145.48 s [vector] zipWithM_: OK (0.03s)
  6899. 145.48 s [vector] +++ OK, passed 100 tests.
  6900. 145.49 s [vector] filter: OK
  6901. 145.49 s [vector] +++ OK, passed 100 tests.
  6902. 145.49 s [vector] ifilter: OK
  6903. 145.49 s [vector] +++ OK, passed 100 tests.
  6904. 145.55 s [vector] filterM: OK (0.06s)
  6905. 145.55 s [vector] +++ OK, passed 100 tests.
  6906. 145.56 s [vector] uniq: OK
  6907. 145.56 s [vector] +++ OK, passed 100 tests.
  6908. 145.56 s [vector] mapMaybe: OK
  6909. 145.56 s [vector] +++ OK, passed 100 tests.
  6910. 145.56 s [vector] imapMaybe: OK
  6911. 145.56 s [vector] +++ OK, passed 100 tests.
  6912. 145.57 s [vector] takeWhile: OK
  6913. 145.57 s [vector] +++ OK, passed 100 tests.
  6914. 145.57 s [vector] dropWhile: OK
  6915. 145.57 s [vector] +++ OK, passed 100 tests.
  6916. 145.57 s [vector] partition: OK
  6917. 145.57 s [vector] +++ OK, passed 100 tests.
  6918. 145.58 s [vector] partitionWith: OK
  6919. 145.58 s [vector] +++ OK, passed 100 tests.
  6920. 145.58 s [vector] span: OK
  6921. 145.58 s [vector] +++ OK, passed 100 tests.
  6922. 145.58 s [vector] break: OK
  6923. 145.58 s [vector] +++ OK, passed 100 tests.
  6924. 145.58 s [vector] spanR: OK
  6925. 145.58 s [vector] +++ OK, passed 100 tests.
  6926. 145.59 s [vector] breakR: OK
  6927. 145.59 s [vector] +++ OK, passed 100 tests.
  6928. 145.59 s [vector] groupBy: OK
  6929. 145.59 s [vector] +++ OK, passed 100 tests.
  6930. 145.59 s [vector] elem: OK
  6931. 145.60 s [vector] +++ OK, passed 100 tests.
  6932. 145.60 s [vector] notElem: OK
  6933. 145.60 s [vector] +++ OK, passed 100 tests.
  6934. 145.60 s [vector] find: OK
  6935. 145.60 s [vector] +++ OK, passed 100 tests.
  6936. 145.60 s [vector] findIndex: OK
  6937. 145.60 s [vector] +++ OK, passed 100 tests.
  6938. 145.60 s [vector] findIndexR: OK
  6939. 145.60 s [vector] +++ OK, passed 100 tests.
  6940. 145.60 s [vector] findIndices: OK
  6941. 145.60 s [vector] +++ OK, passed 100 tests.
  6942. 145.60 s [vector] elemIndex: OK
  6943. 145.61 s [vector] +++ OK, passed 100 tests.
  6944. 145.61 s [vector] elemIndices: OK
  6945. 145.61 s [vector] +++ OK, passed 100 tests.
  6946. 145.62 s [vector] foldl: OK
  6947. 145.62 s [vector] +++ OK, passed 100 tests.
  6948. 145.62 s [vector] foldl1: OK
  6949. 145.62 s [vector] +++ OK, passed 100 tests; 18 discarded.
  6950. 145.62 s [vector] foldl': OK
  6951. 145.63 s [vector] +++ OK, passed 100 tests.
  6952. 145.64 s [vector] foldl1': OK
  6953. 145.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  6954. 145.64 s [vector] foldr: OK
  6955. 145.64 s [vector] +++ OK, passed 100 tests.
  6956. 145.65 s [vector] foldr1: OK
  6957. 145.65 s [vector] +++ OK, passed 100 tests; 16 discarded.
  6958. 145.65 s [vector] foldr': OK
  6959. 145.65 s [vector] +++ OK, passed 100 tests.
  6960. 145.66 s [vector] foldr1': OK
  6961. 145.66 s [vector] +++ OK, passed 100 tests; 21 discarded.
  6962. 145.67 s [vector] ifoldl: OK
  6963. 145.67 s [vector] +++ OK, passed 100 tests.
  6964. 145.68 s [vector] ifoldl': OK
  6965. 145.68 s [vector] +++ OK, passed 100 tests.
  6966. 145.68 s [vector] ifoldr: OK
  6967. 145.69 s [vector] +++ OK, passed 100 tests.
  6968. 145.69 s [vector] ifoldr': OK
  6969. 145.69 s [vector] +++ OK, passed 100 tests.
  6970. 145.69 s [vector] ifoldM: OK
  6971. 145.69 s [vector] +++ OK, passed 100 tests.
  6972. 145.70 s [vector] ifoldM': OK
  6973. 145.71 s [vector] +++ OK, passed 100 tests.
  6974. 145.75 s [vector] ifoldM_: OK (0.05s)
  6975. 146.05 s [vector] +++ OK, passed 100 tests.
  6976. 146.05 s [vector] ifoldM'_: OK (0.05s)
  6977. 146.05 s [vector] +++ OK, passed 100 tests.
  6978. 146.05 s [vector] all: OK
  6979. 146.05 s [vector] +++ OK, passed 100 tests.
  6980. 146.05 s [vector] any: OK
  6981. 146.05 s [vector] +++ OK, passed 100 tests.
  6982. 146.05 s [vector] prescanl: OK
  6983. 146.05 s [vector] +++ OK, passed 100 tests.
  6984. 146.05 s [vector] prescanl': OK
  6985. 146.05 s [vector] +++ OK, passed 100 tests.
  6986. 146.05 s [vector] postscanl: OK
  6987. 146.05 s [vector] +++ OK, passed 100 tests.
  6988. 146.05 s [vector] postscanl': OK
  6989. 146.05 s [vector] +++ OK, passed 100 tests.
  6990. 146.05 s [vector] scanl: OK
  6991. 146.05 s [vector] +++ OK, passed 100 tests.
  6992. 146.05 s [vector] scanl': OK
  6993. 146.05 s [vector] +++ OK, passed 100 tests.
  6994. 146.05 s [vector] scanl1: OK
  6995. 146.05 s [vector] +++ OK, passed 100 tests.
  6996. 146.05 s [vector] scanl1': OK
  6997. 146.05 s [vector] +++ OK, passed 100 tests.
  6998. 146.05 s [vector] iscanl: OK
  6999. 146.05 s [vector] +++ OK, passed 100 tests.
  7000. 146.05 s [vector] iscanl': OK
  7001. 146.05 s [vector] +++ OK, passed 100 tests.
  7002. 146.05 s [vector] prescanr: OK
  7003. 146.05 s [vector] +++ OK, passed 100 tests.
  7004. 146.05 s [vector] prescanr': OK
  7005. 146.05 s [vector] +++ OK, passed 100 tests.
  7006. 146.05 s [vector] postscanr: OK
  7007. 146.05 s [vector] +++ OK, passed 100 tests.
  7008. 146.05 s [vector] postscanr': OK
  7009. 146.05 s [vector] +++ OK, passed 100 tests.
  7010. 146.05 s [vector] scanr: OK
  7011. 146.05 s [vector] +++ OK, passed 100 tests.
  7012. 146.05 s [vector] scanr': OK
  7013. 146.05 s [vector] +++ OK, passed 100 tests.
  7014. 146.05 s [vector] scanr1: OK
  7015. 146.05 s [vector] +++ OK, passed 100 tests.
  7016. 146.05 s [vector] scanr1': OK
  7017. 146.05 s [vector] +++ OK, passed 100 tests.
  7018. 146.05 s [vector] iscanr: OK
  7019. 146.05 s [vector] +++ OK, passed 100 tests.
  7020. 146.05 s [vector] iscanr': OK
  7021. 146.05 s [vector] +++ OK, passed 100 tests.
  7022. 146.05 s [vector] mut_read: OK
  7023. 146.05 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7024. 146.05 s [vector] mut_write: OK
  7025. 146.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7026. 146.05 s [vector] mut_modify: OK
  7027. 146.05 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7028. 146.05 s [vector] mut_generate: OK
  7029. 146.05 s [vector] +++ OK, passed 100 tests.
  7030. 146.05 s [vector] mut_generateM: OK (0.02s)
  7031. 146.05 s [vector] +++ OK, passed 100 tests.
  7032. 146.05 s [vector] mut_mapM_: OK (0.04s)
  7033. 146.05 s [vector] +++ OK, passed 100 tests.
  7034. 146.07 s [vector] mut_imapM_: OK (0.04s)
  7035. 146.07 s [vector] +++ OK, passed 100 tests.
  7036. 146.11 s [vector] mut_forM_: OK (0.04s)
  7037. 146.11 s [vector] +++ OK, passed 100 tests.
  7038. 146.16 s [vector] mut_iforM_: OK (0.04s)
  7039. 146.16 s [vector] +++ OK, passed 100 tests.
  7040. 146.16 s [vector] mut_foldr: OK
  7041. 146.16 s [vector] +++ OK, passed 100 tests.
  7042. 146.16 s [vector] mut_foldr': OK
  7043. 146.17 s [vector] +++ OK, passed 100 tests.
  7044. 146.17 s [vector] mut_foldl: OK
  7045. 146.17 s [vector] +++ OK, passed 100 tests.
  7046. 146.18 s [vector] mut_foldl': OK
  7047. 146.18 s [vector] +++ OK, passed 100 tests.
  7048. 146.18 s [vector] mut_ifoldr: OK
  7049. 146.18 s [vector] +++ OK, passed 100 tests.
  7050. 146.20 s [vector] mut_ifoldr': OK
  7051. 146.21 s [vector] +++ OK, passed 100 tests.
  7052. 146.21 s [vector] mut_ifoldl: OK
  7053. 146.21 s [vector] +++ OK, passed 100 tests.
  7054. 146.21 s [vector] mut_ifoldl': OK
  7055. 146.21 s [vector] +++ OK, passed 100 tests.
  7056. 146.22 s [vector] mut_foldM: OK
  7057. 146.22 s [vector] +++ OK, passed 100 tests.
  7058. 146.23 s [vector] mut_foldM': OK
  7059. 146.23 s [vector] +++ OK, passed 100 tests.
  7060. 146.23 s [vector] mut_foldrM: OK
  7061. 146.23 s [vector] +++ OK, passed 100 tests.
  7062. 146.23 s [vector] mut_foldrM': OK
  7063. 146.24 s [vector] +++ OK, passed 100 tests.
  7064. 146.24 s [vector] mut_ifoldM: OK
  7065. 146.25 s [vector] +++ OK, passed 100 tests.
  7066. 146.25 s [vector] mut_ifoldM': OK
  7067. 146.25 s [vector] +++ OK, passed 100 tests.
  7068. 146.26 s [vector] mut_ifoldrM: OK
  7069. 146.26 s [vector] +++ OK, passed 100 tests.
  7070. 146.26 s [vector] mut_ifoldrM': OK
  7071. 146.27 s [vector] +++ OK, passed 100 tests.
  7072. 146.27 s [vector] compare: OK
  7073. 146.27 s [vector] +++ OK, passed 100 tests.
  7074. 146.27 s [vector] maximum: OK
  7075. 146.27 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7076. 146.27 s [vector] minimum: OK
  7077. 146.27 s [vector] +++ OK, passed 100 tests; 25 discarded.
  7078. 146.27 s [vector] minIndex: OK
  7079. 146.27 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7080. 146.27 s [vector] maxIndex: OK
  7081. 146.27 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7082. 146.27 s [vector] maximumBy: OK
  7083. 146.27 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7084. 146.27 s [vector] minimumBy: OK
  7085. 146.28 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7086. 146.28 s [vector] maximumOn: OK
  7087. 146.28 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7088. 146.28 s [vector] minimumOn: OK
  7089. 146.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7090. 146.28 s [vector] maxIndexBy: OK
  7091. 146.28 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7092. 146.28 s [vector] minIndexBy: OK
  7093. 146.28 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7094. 146.28 s [vector] ListFirstMaxIndexWins: OK
  7095. 146.28 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7096. 146.28 s [vector] FalseListFirstMaxIndexWins: OK
  7097. 146.28 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  7098. 146.28 s [vector] []
  7099. 146.28 s [vector] zip: OK
  7100. 146.28 s [vector] +++ OK, passed 100 tests.
  7101. 146.29 s [vector] zip3: OK
  7102. 146.29 s [vector] +++ OK, passed 100 tests.
  7103. 146.31 s [vector] unzip: OK
  7104. 146.31 s [vector] +++ OK, passed 100 tests.
  7105. 146.31 s [vector] unzip3: OK
  7106. 146.31 s [vector] +++ OK, passed 100 tests.
  7107. 146.31 s [vector] indexed: OK
  7108. 146.31 s [vector] +++ OK, passed 100 tests.
  7109. 146.31 s [vector] update: OK
  7110. 146.32 s [vector] +++ OK, passed 100 tests.
  7111. 146.32 s [vector] mempty: OK
  7112. 146.32 s [vector] +++ OK, passed 100 tests.
  7113. 146.32 s [vector] mappend: OK
  7114. 146.32 s [vector] +++ OK, passed 100 tests.
  7115. 146.37 s [vector] mconcat: OK (0.05s)
  7116. 146.37 s [vector] +++ OK, passed 100 tests.
  7117. 146.37 s [vector] glength: OK
  7118. 146.37 s [vector] +++ OK, passed 100 tests.
  7119. 146.37 s [vector] unstream
  7120. 146.37 s [vector] unstream == vunstream (exact): OK
  7121. 146.37 s [vector] +++ OK, passed 100 tests.
  7122. 146.38 s [vector] unstream == vunstream (unknown): OK
  7123. 146.38 s [vector] +++ OK, passed 100 tests.
  7124. 146.38 s [vector] unstreamR ~= vunstream (exact): OK
  7125. 146.38 s [vector] +++ OK, passed 100 tests.
  7126. 146.38 s [vector] unstreamR ~= vunstream (unknown): OK
  7127. 146.38 s [vector] +++ OK, passed 100 tests.
  7128. 146.38 s [vector] Data.Vector.Storable.Vector Alignment
  7129. 146.38 s [vector] Aligned Double: OK
  7130. 146.38 s [vector] Aligned Int: OK
  7131. 146.38 s [vector] Regression tests
  7132. 146.38 s [vector] enumFromTo crash #188
  7133. 146.38 s [vector] Word8: OK
  7134. 146.38 s [vector] Word16: OK
  7135. 146.38 s [vector] Word32: OK
  7136. 146.38 s [vector] Word64: OK
  7137. 146.38 s [vector] Word: OK
  7138. 146.38 s [vector] Int8: OK
  7139. 146.38 s [vector] Int16: OK
  7140. 146.38 s [vector] Int32: OK
  7141. 146.38 s [vector] Int64: OK
  7142. 146.38 s [vector] Int: OK
  7143. 146.38 s [vector] Char: OK
  7144. 146.38 s [vector] Negative tests
  7145. 146.38 s [vector] slice out of bounds #257
  7146. 146.38 s [vector] Boxed
  7147. 146.38 s [vector] Negative ix: OK
  7148. 146.38 s [vector] Negative size: OK
  7149. 146.38 s [vector] Negative ix and size: OK
  7150. 146.38 s [vector] Too large ix: OK
  7151. 146.38 s [vector] Too large size: OK
  7152. 146.38 s [vector] Too large ix and size: OK
  7153. 146.38 s [vector] Overflow: OK
  7154. 146.38 s [vector] OutOfMemory: OK
  7155. 146.38 s [vector] Primitive
  7156. 146.38 s [vector] Negative ix: OK
  7157. 146.38 s [vector] Negative size: OK
  7158. 146.38 s [vector] Negative ix and size: OK
  7159. 146.38 s [vector] Too large ix: OK
  7160. 146.38 s [vector] Too large size: OK
  7161. 146.38 s [vector] Too large ix and size: OK
  7162. 146.38 s [vector] Overflow: OK
  7163. 146.38 s [vector] OutOfMemory: OK
  7164. 146.38 s [vector] Storable
  7165. 146.38 s [vector] Negative ix: OK
  7166. 146.38 s [vector] Negative size: OK
  7167. 146.38 s [vector] Negative ix and size: OK
  7168. 146.38 s [vector] Too large ix: OK
  7169. 146.38 s [vector] Too large size: OK
  7170. 146.38 s [vector] Too large ix and size: OK
  7171. 146.38 s [vector] Overflow: OK
  7172. 146.38 s [vector] OutOfMemory: OK
  7173. 146.38 s [vector] Unboxed
  7174. 146.38 s [vector] Negative ix: OK
  7175. 146.38 s [vector] Negative size: OK
  7176. 146.38 s [vector] Negative ix and size: OK
  7177. 146.38 s [vector] Too large ix: OK
  7178. 146.38 s [vector] Too large size: OK
  7179. 146.38 s [vector] Too large ix and size: OK
  7180. 146.38 s [vector] Overflow: OK
  7181. 146.38 s [vector] OutOfMemory: OK
  7182. 146.38 s [vector] take #282
  7183. 146.38 s [vector] Boxed: OK
  7184. 146.38 s [vector] Primitive: OK
  7185. 146.38 s [vector] Storable: OK
  7186. 146.38 s [vector] Unboxed: OK
  7187. 146.38 s [vector] Data.Vector
  7188. 146.38 s [vector] MonadFix: OK
  7189. 146.38 s [vector] toFromArray: OK
  7190. 146.38 s [vector] toFromArraySlice: OK
  7191. 146.38 s [vector] toFromArraySliceUnsafe: OK
  7192. 146.38 s [vector] toFromMutableArray: OK
  7193. 146.38 s [vector] Data.Vector.Mutable (Move): OK
  7194. 146.38 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7195. 146.38 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  7196. 146.38 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7197. 146.38 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  7198. 146.38 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7199. 146.38 s [vector] Data.Vector.Storable.Mutable (Move): OK
  7200. 146.38 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7201. 146.39 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  7202. 146.39 s [vector] +++ OK, passed 100 tests.
  7203. 146.40 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK
  7204. 146.40 s [vector] +++ OK, passed 100 tests.
  7205. 146.40 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  7206. 146.40 s [vector] +++ OK, passed 100 tests.
  7207. 146.40 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  7208. 146.40 s [vector] +++ OK, passed 100 tests.
  7209. 146.40 s [vector]
  7210. 146.40 s [vector] All 2808 tests passed (12.57s)
  7211. 146.40 s [vector] Test suite vector-tests-O0: PASS
  7212. 146.40 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O0.log
  7213. 146.40 s [vector] Test suite vector-tests-O2: RUNNING...
  7214. 146.59 s [vector] toplevel
  7215. 146.59 s [vector] Data.Vector.Fusion.Bundle
  7216. 146.60 s [vector] fromList.toList == id: OK
  7217. 146.60 s [vector] +++ OK, passed 100 tests.
  7218. 146.60 s [vector] toList.fromList == id: OK
  7219. 146.60 s [vector] +++ OK, passed 100 tests.
  7220. 146.60 s [vector] eq: OK
  7221. 146.60 s [vector] +++ OK, passed 100 tests.
  7222. 146.60 s [vector] length: OK
  7223. 146.60 s [vector] +++ OK, passed 100 tests.
  7224. 146.60 s [vector] null: OK
  7225. 146.60 s [vector] +++ OK, passed 100 tests.
  7226. 146.60 s [vector] empty: OK
  7227. 146.60 s [vector] +++ OK, passed 100 tests.
  7228. 146.60 s [vector] singleton: OK
  7229. 146.60 s [vector] +++ OK, passed 100 tests.
  7230. 146.60 s [vector] replicate: OK
  7231. 146.60 s [vector] +++ OK, passed 100 tests.
  7232. 146.60 s [vector] cons: OK
  7233. 146.60 s [vector] +++ OK, passed 100 tests.
  7234. 146.60 s [vector] snoc: OK
  7235. 146.60 s [vector] +++ OK, passed 100 tests.
  7236. 146.60 s [vector] append: OK
  7237. 146.60 s [vector] +++ OK, passed 100 tests.
  7238. 146.60 s [vector] head: OK
  7239. 146.60 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7240. 146.60 s [vector] last: OK
  7241. 146.60 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7242. 146.60 s [vector] index: OK
  7243. 146.61 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7244. 146.61 s [vector] extract: OK
  7245. 146.61 s [vector] +++ OK, passed 100 tests.
  7246. 146.61 s [vector] init: OK
  7247. 146.61 s [vector] +++ OK, passed 100 tests; 26 discarded.
  7248. 146.61 s [vector] tail: OK
  7249. 146.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7250. 146.61 s [vector] take: OK
  7251. 146.61 s [vector] +++ OK, passed 100 tests.
  7252. 146.61 s [vector] drop: OK
  7253. 146.61 s [vector] +++ OK, passed 100 tests.
  7254. 146.61 s [vector] map: OK
  7255. 146.61 s [vector] +++ OK, passed 100 tests.
  7256. 146.61 s [vector] zipWith: OK
  7257. 146.61 s [vector] +++ OK, passed 100 tests.
  7258. 146.61 s [vector] zipWith3: OK
  7259. 146.62 s [vector] +++ OK, passed 100 tests.
  7260. 146.62 s [vector] filter: OK
  7261. 146.62 s [vector] +++ OK, passed 100 tests.
  7262. 146.62 s [vector] takeWhile: OK
  7263. 146.62 s [vector] +++ OK, passed 100 tests.
  7264. 146.62 s [vector] dropWhile: OK
  7265. 146.62 s [vector] +++ OK, passed 100 tests.
  7266. 146.62 s [vector] elem: OK
  7267. 146.62 s [vector] +++ OK, passed 100 tests.
  7268. 146.62 s [vector] notElem: OK
  7269. 146.62 s [vector] +++ OK, passed 100 tests.
  7270. 146.62 s [vector] find: OK
  7271. 146.62 s [vector] +++ OK, passed 100 tests.
  7272. 146.62 s [vector] findIndex: OK
  7273. 146.62 s [vector] +++ OK, passed 100 tests.
  7274. 146.62 s [vector] foldl: OK
  7275. 146.62 s [vector] +++ OK, passed 100 tests.
  7276. 146.62 s [vector] foldl1: OK
  7277. 146.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7278. 146.62 s [vector] foldl': OK
  7279. 146.62 s [vector] +++ OK, passed 100 tests.
  7280. 146.62 s [vector] foldl1': OK
  7281. 146.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7282. 146.62 s [vector] foldr: OK
  7283. 146.62 s [vector] +++ OK, passed 100 tests.
  7284. 146.63 s [vector] foldr1: OK
  7285. 146.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7286. 146.63 s [vector] prescanl: OK
  7287. 146.63 s [vector] +++ OK, passed 100 tests.
  7288. 146.63 s [vector] prescanl': OK
  7289. 146.63 s [vector] +++ OK, passed 100 tests.
  7290. 146.63 s [vector] postscanl: OK
  7291. 146.63 s [vector] +++ OK, passed 100 tests.
  7292. 146.63 s [vector] postscanl': OK
  7293. 146.63 s [vector] +++ OK, passed 100 tests.
  7294. 146.63 s [vector] scanl: OK
  7295. 146.63 s [vector] +++ OK, passed 100 tests.
  7296. 146.63 s [vector] scanl': OK
  7297. 146.63 s [vector] +++ OK, passed 100 tests.
  7298. 146.63 s [vector] scanl1: OK
  7299. 146.63 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7300. 146.63 s [vector] scanl1': OK
  7301. 146.63 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7302. 146.63 s [vector] concatMap: OK
  7303. 146.63 s [vector] +++ OK, passed 100 tests.
  7304. 146.63 s [vector] unfoldr: OK
  7305. 146.63 s [vector] +++ OK, passed 100 tests.
  7306. 146.63 s [vector] and: OK
  7307. 146.63 s [vector] +++ OK, passed 100 tests.
  7308. 146.63 s [vector] or: OK
  7309. 146.63 s [vector] +++ OK, passed 100 tests.
  7310. 146.63 s [vector] Tests.Vector.Boxed
  7311. 146.63 s [vector] Bool
  7312. 146.63 s [vector] fromList.toList == id: OK
  7313. 146.63 s [vector] +++ OK, passed 100 tests.
  7314. 146.63 s [vector] toList.fromList == id: OK
  7315. 146.63 s [vector] +++ OK, passed 100 tests.
  7316. 146.63 s [vector] unstream.stream == id: OK
  7317. 146.63 s [vector] +++ OK, passed 100 tests.
  7318. 146.63 s [vector] stream.unstream == id: OK
  7319. 146.63 s [vector] +++ OK, passed 100 tests.
  7320. 146.63 s [vector] eq: OK
  7321. 146.63 s [vector] +++ OK, passed 100 tests.
  7322. 146.63 s [vector] length: OK
  7323. 146.63 s [vector] +++ OK, passed 100 tests.
  7324. 146.63 s [vector] null: OK
  7325. 146.63 s [vector] +++ OK, passed 100 tests.
  7326. 146.63 s [vector] index: OK
  7327. 146.63 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7328. 146.63 s [vector] safeIndex: OK
  7329. 146.63 s [vector] +++ OK, passed 100 tests.
  7330. 146.64 s [vector] head: OK
  7331. 146.64 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7332. 146.64 s [vector] last: OK
  7333. 146.64 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7334. 146.64 s [vector] unsafeIndex: OK
  7335. 146.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7336. 146.64 s [vector] unsafeHead: OK
  7337. 146.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7338. 146.64 s [vector] unsafeLast: OK
  7339. 146.64 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7340. 146.64 s [vector] slice: OK
  7341. 146.64 s [vector] +++ OK, passed 100 tests.
  7342. 146.64 s [vector] init: OK
  7343. 146.64 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7344. 146.64 s [vector] tail: OK
  7345. 146.64 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7346. 146.64 s [vector] take: OK
  7347. 146.64 s [vector] +++ OK, passed 100 tests.
  7348. 146.64 s [vector] drop: OK
  7349. 146.64 s [vector] +++ OK, passed 100 tests.
  7350. 146.64 s [vector] splitAt: OK
  7351. 146.64 s [vector] +++ OK, passed 100 tests.
  7352. 146.64 s [vector] empty: OK
  7353. 146.64 s [vector] +++ OK, passed 100 tests.
  7354. 146.64 s [vector] singleton: OK
  7355. 146.64 s [vector] +++ OK, passed 100 tests.
  7356. 146.64 s [vector] replicate: OK
  7357. 146.64 s [vector] +++ OK, passed 100 tests.
  7358. 146.64 s [vector] generate: OK
  7359. 146.64 s [vector] +++ OK, passed 100 tests.
  7360. 146.64 s [vector] iterateN: OK
  7361. 146.64 s [vector] +++ OK, passed 100 tests.
  7362. 146.64 s [vector] iterateNM: OK (0.02s)
  7363. 146.64 s [vector] +++ OK, passed 100 tests.
  7364. 146.64 s [vector] generateM: OK (0.01s)
  7365. 146.64 s [vector] +++ OK, passed 100 tests.
  7366. 146.64 s [vector] replicateM: OK (0.01s)
  7367. 146.64 s [vector] +++ OK, passed 100 tests.
  7368. 146.64 s [vector] create: OK
  7369. 146.64 s [vector] +++ OK, passed 100 tests.
  7370. 146.64 s [vector] createT: OK
  7371. 146.64 s [vector] +++ OK, passed 100 tests.
  7372. 146.64 s [vector] unfoldr: OK
  7373. 146.64 s [vector] +++ OK, passed 100 tests.
  7374. 146.64 s [vector] unfoldrN: OK
  7375. 146.64 s [vector] +++ OK, passed 100 tests.
  7376. 146.64 s [vector] unfoldrExactN: OK
  7377. 146.65 s [vector] +++ OK, passed 100 tests.
  7378. 146.65 s [vector] unfoldrM: OK
  7379. 146.65 s [vector] +++ OK, passed 100 tests.
  7380. 146.65 s [vector] unfoldrNM: OK
  7381. 146.65 s [vector] +++ OK, passed 100 tests.
  7382. 146.65 s [vector] unfoldrExactNM: OK (0.02s)
  7383. 146.65 s [vector] +++ OK, passed 100 tests.
  7384. 146.65 s [vector] constructN: OK
  7385. 146.65 s [vector] +++ OK, passed 100 tests.
  7386. 146.65 s [vector] constructrN: OK
  7387. 146.65 s [vector] +++ OK, passed 100 tests.
  7388. 146.65 s [vector] cons: OK
  7389. 146.65 s [vector] +++ OK, passed 100 tests.
  7390. 146.65 s [vector] snoc: OK
  7391. 146.65 s [vector] +++ OK, passed 100 tests.
  7392. 146.65 s [vector] append: OK
  7393. 146.65 s [vector] +++ OK, passed 100 tests.
  7394. 146.65 s [vector] concat: OK
  7395. 146.65 s [vector] +++ OK, passed 100 tests.
  7396. 146.65 s [vector] force: OK
  7397. 146.65 s [vector] +++ OK, passed 100 tests.
  7398. 146.66 s [vector] upd: OK
  7399. 146.66 s [vector] +++ OK, passed 100 tests.
  7400. 146.66 s [vector] accum: OK
  7401. 146.66 s [vector] +++ OK, passed 100 tests.
  7402. 146.66 s [vector] reverse: OK
  7403. 146.66 s [vector] +++ OK, passed 100 tests.
  7404. 146.66 s [vector] backpermute: OK
  7405. 146.66 s [vector] +++ OK, passed 100 tests.
  7406. 146.66 s [vector] map: OK
  7407. 146.66 s [vector] +++ OK, passed 100 tests.
  7408. 146.66 s [vector] imap: OK
  7409. 146.66 s [vector] +++ OK, passed 100 tests.
  7410. 146.66 s [vector] concatMap: OK
  7411. 146.66 s [vector] +++ OK, passed 100 tests.
  7412. 146.66 s [vector] mapM: OK
  7413. 146.66 s [vector] +++ OK, passed 100 tests.
  7414. 146.66 s [vector] mapM_: OK
  7415. 146.66 s [vector] +++ OK, passed 100 tests.
  7416. 146.66 s [vector] forM: OK
  7417. 146.66 s [vector] +++ OK, passed 100 tests.
  7418. 146.66 s [vector] forM_: OK
  7419. 146.66 s [vector] +++ OK, passed 100 tests.
  7420. 146.66 s [vector] imapM: OK
  7421. 146.66 s [vector] +++ OK, passed 100 tests.
  7422. 146.66 s [vector] imapM_: OK
  7423. 146.67 s [vector] +++ OK, passed 100 tests.
  7424. 146.67 s [vector] zipWith: OK
  7425. 146.67 s [vector] +++ OK, passed 100 tests.
  7426. 146.67 s [vector] zipWith3: OK
  7427. 146.67 s [vector] +++ OK, passed 100 tests.
  7428. 146.67 s [vector] izipWith: OK
  7429. 146.67 s [vector] +++ OK, passed 100 tests.
  7430. 146.67 s [vector] izipWith3: OK
  7431. 146.67 s [vector] +++ OK, passed 100 tests.
  7432. 146.67 s [vector] izipWithM: OK
  7433. 146.67 s [vector] +++ OK, passed 100 tests.
  7434. 146.67 s [vector] izipWithM_: OK
  7435. 146.67 s [vector] +++ OK, passed 100 tests.
  7436. 146.67 s [vector] zipWithM: OK
  7437. 146.67 s [vector] +++ OK, passed 100 tests.
  7438. 146.67 s [vector] zipWithM_: OK (0.01s)
  7439. 146.67 s [vector] +++ OK, passed 100 tests.
  7440. 146.67 s [vector] filter: OK
  7441. 146.67 s [vector] +++ OK, passed 100 tests.
  7442. 146.67 s [vector] ifilter: OK
  7443. 146.67 s [vector] +++ OK, passed 100 tests.
  7444. 146.68 s [vector] filterM: OK (0.02s)
  7445. 146.68 s [vector] +++ OK, passed 100 tests.
  7446. 146.68 s [vector] uniq: OK
  7447. 146.68 s [vector] +++ OK, passed 100 tests.
  7448. 146.68 s [vector] mapMaybe: OK
  7449. 146.68 s [vector] +++ OK, passed 100 tests.
  7450. 146.68 s [vector] imapMaybe: OK
  7451. 146.68 s [vector] +++ OK, passed 100 tests.
  7452. 146.68 s [vector] takeWhile: OK
  7453. 146.68 s [vector] +++ OK, passed 100 tests.
  7454. 146.68 s [vector] dropWhile: OK
  7455. 146.68 s [vector] +++ OK, passed 100 tests.
  7456. 146.68 s [vector] partition: OK
  7457. 146.68 s [vector] +++ OK, passed 100 tests.
  7458. 146.68 s [vector] partitionWith: OK
  7459. 146.68 s [vector] +++ OK, passed 100 tests.
  7460. 146.68 s [vector] span: OK
  7461. 146.68 s [vector] +++ OK, passed 100 tests.
  7462. 146.68 s [vector] break: OK
  7463. 146.68 s [vector] +++ OK, passed 100 tests.
  7464. 146.68 s [vector] spanR: OK
  7465. 146.68 s [vector] +++ OK, passed 100 tests.
  7466. 146.68 s [vector] breakR: OK
  7467. 146.68 s [vector] +++ OK, passed 100 tests.
  7468. 146.68 s [vector] groupBy: OK
  7469. 146.68 s [vector] +++ OK, passed 100 tests.
  7470. 146.68 s [vector] elem: OK
  7471. 146.68 s [vector] +++ OK, passed 100 tests.
  7472. 146.68 s [vector] notElem: OK
  7473. 146.68 s [vector] +++ OK, passed 100 tests.
  7474. 146.68 s [vector] find: OK
  7475. 146.68 s [vector] +++ OK, passed 100 tests.
  7476. 146.69 s [vector] findIndex: OK
  7477. 146.69 s [vector] +++ OK, passed 100 tests.
  7478. 146.69 s [vector] findIndexR: OK
  7479. 146.69 s [vector] +++ OK, passed 100 tests.
  7480. 146.69 s [vector] findIndices: OK
  7481. 146.69 s [vector] +++ OK, passed 100 tests.
  7482. 146.69 s [vector] elemIndex: OK
  7483. 146.69 s [vector] +++ OK, passed 100 tests.
  7484. 146.69 s [vector] elemIndices: OK
  7485. 146.69 s [vector] +++ OK, passed 100 tests.
  7486. 146.69 s [vector] foldl: OK
  7487. 146.69 s [vector] +++ OK, passed 100 tests.
  7488. 146.69 s [vector] foldl1: OK
  7489. 146.69 s [vector] +++ OK, passed 100 tests; 21 discarded.
  7490. 146.69 s [vector] foldl': OK
  7491. 146.69 s [vector] +++ OK, passed 100 tests.
  7492. 146.69 s [vector] foldl1': OK
  7493. 146.69 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7494. 146.69 s [vector] foldr: OK
  7495. 146.69 s [vector] +++ OK, passed 100 tests.
  7496. 146.69 s [vector] foldr1: OK
  7497. 146.69 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7498. 146.69 s [vector] foldr': OK
  7499. 146.69 s [vector] +++ OK, passed 100 tests.
  7500. 146.69 s [vector] foldr1': OK
  7501. 146.69 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7502. 146.69 s [vector] ifoldl: OK
  7503. 146.69 s [vector] +++ OK, passed 100 tests.
  7504. 146.69 s [vector] ifoldl': OK
  7505. 146.69 s [vector] +++ OK, passed 100 tests.
  7506. 146.69 s [vector] ifoldr: OK
  7507. 146.69 s [vector] +++ OK, passed 100 tests.
  7508. 146.70 s [vector] ifoldr': OK
  7509. 146.70 s [vector] +++ OK, passed 100 tests.
  7510. 146.70 s [vector] ifoldM: OK
  7511. 146.70 s [vector] +++ OK, passed 100 tests.
  7512. 146.70 s [vector] ifoldM': OK
  7513. 146.70 s [vector] +++ OK, passed 100 tests.
  7514. 146.70 s [vector] ifoldM_: OK
  7515. 146.70 s [vector] +++ OK, passed 100 tests.
  7516. 146.70 s [vector] ifoldM'_: OK
  7517. 146.70 s [vector] +++ OK, passed 100 tests.
  7518. 146.70 s [vector] all: OK
  7519. 146.70 s [vector] +++ OK, passed 100 tests.
  7520. 146.70 s [vector] any: OK
  7521. 146.70 s [vector] +++ OK, passed 100 tests.
  7522. 146.70 s [vector] prescanl: OK
  7523. 146.70 s [vector] +++ OK, passed 100 tests.
  7524. 146.70 s [vector] prescanl': OK
  7525. 146.70 s [vector] +++ OK, passed 100 tests.
  7526. 146.70 s [vector] postscanl: OK
  7527. 146.70 s [vector] +++ OK, passed 100 tests.
  7528. 146.71 s [vector] postscanl': OK
  7529. 146.71 s [vector] +++ OK, passed 100 tests.
  7530. 146.71 s [vector] scanl: OK
  7531. 146.71 s [vector] +++ OK, passed 100 tests.
  7532. 146.71 s [vector] scanl': OK
  7533. 146.72 s [vector] +++ OK, passed 100 tests.
  7534. 146.72 s [vector] scanl1: OK
  7535. 146.72 s [vector] +++ OK, passed 100 tests.
  7536. 146.72 s [vector] scanl1': OK
  7537. 146.72 s [vector] +++ OK, passed 100 tests.
  7538. 146.72 s [vector] iscanl: OK
  7539. 146.72 s [vector] +++ OK, passed 100 tests.
  7540. 146.72 s [vector] iscanl': OK
  7541. 146.72 s [vector] +++ OK, passed 100 tests.
  7542. 146.72 s [vector] prescanr: OK
  7543. 146.72 s [vector] +++ OK, passed 100 tests.
  7544. 146.72 s [vector] prescanr': OK
  7545. 146.72 s [vector] +++ OK, passed 100 tests.
  7546. 146.72 s [vector] postscanr: OK
  7547. 146.72 s [vector] +++ OK, passed 100 tests.
  7548. 146.72 s [vector] postscanr': OK
  7549. 146.72 s [vector] +++ OK, passed 100 tests.
  7550. 146.72 s [vector] scanr: OK
  7551. 146.72 s [vector] +++ OK, passed 100 tests.
  7552. 146.73 s [vector] scanr': OK
  7553. 146.73 s [vector] +++ OK, passed 100 tests.
  7554. 146.73 s [vector] scanr1: OK
  7555. 146.73 s [vector] +++ OK, passed 100 tests.
  7556. 146.73 s [vector] scanr1': OK
  7557. 146.73 s [vector] +++ OK, passed 100 tests.
  7558. 146.73 s [vector] iscanr: OK
  7559. 146.74 s [vector] +++ OK, passed 100 tests.
  7560. 146.74 s [vector] iscanr': OK
  7561. 146.74 s [vector] +++ OK, passed 100 tests.
  7562. 146.74 s [vector] mut_read: OK
  7563. 146.74 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7564. 146.74 s [vector] mut_write: OK
  7565. 146.74 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7566. 146.74 s [vector] mut_modify: OK
  7567. 146.74 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7568. 146.74 s [vector] mut_generate: OK
  7569. 146.74 s [vector] +++ OK, passed 100 tests.
  7570. 146.74 s [vector] mut_generateM: OK
  7571. 146.74 s [vector] +++ OK, passed 100 tests.
  7572. 146.74 s [vector] mut_mapM_: OK
  7573. 146.74 s [vector] +++ OK, passed 100 tests.
  7574. 146.74 s [vector] mut_imapM_: OK
  7575. 146.74 s [vector] +++ OK, passed 100 tests.
  7576. 146.74 s [vector] mut_forM_: OK
  7577. 146.74 s [vector] +++ OK, passed 100 tests.
  7578. 146.74 s [vector] mut_iforM_: OK (0.01s)
  7579. 146.74 s [vector] +++ OK, passed 100 tests.
  7580. 146.75 s [vector] mut_foldr: OK
  7581. 146.75 s [vector] +++ OK, passed 100 tests.
  7582. 146.75 s [vector] mut_foldr': OK
  7583. 146.75 s [vector] +++ OK, passed 100 tests.
  7584. 146.75 s [vector] mut_foldl: OK
  7585. 146.75 s [vector] +++ OK, passed 100 tests.
  7586. 146.75 s [vector] mut_foldl': OK
  7587. 146.75 s [vector] +++ OK, passed 100 tests.
  7588. 146.75 s [vector] mut_ifoldr: OK
  7589. 146.75 s [vector] +++ OK, passed 100 tests.
  7590. 146.75 s [vector] mut_ifoldr': OK
  7591. 146.75 s [vector] +++ OK, passed 100 tests.
  7592. 146.75 s [vector] mut_ifoldl: OK
  7593. 146.75 s [vector] +++ OK, passed 100 tests.
  7594. 146.75 s [vector] mut_ifoldl': OK
  7595. 146.75 s [vector] +++ OK, passed 100 tests.
  7596. 146.76 s [vector] mut_foldM: OK
  7597. 146.76 s [vector] +++ OK, passed 100 tests.
  7598. 146.76 s [vector] mut_foldM': OK
  7599. 146.76 s [vector] +++ OK, passed 100 tests.
  7600. 146.76 s [vector] mut_foldrM: OK
  7601. 146.76 s [vector] +++ OK, passed 100 tests.
  7602. 146.76 s [vector] mut_foldrM': OK
  7603. 146.76 s [vector] +++ OK, passed 100 tests.
  7604. 146.76 s [vector] mut_ifoldM: OK
  7605. 146.76 s [vector] +++ OK, passed 100 tests.
  7606. 146.76 s [vector] mut_ifoldM': OK
  7607. 146.76 s [vector] +++ OK, passed 100 tests.
  7608. 146.76 s [vector] mut_ifoldrM: OK
  7609. 146.76 s [vector] +++ OK, passed 100 tests.
  7610. 146.76 s [vector] mut_ifoldrM': OK
  7611. 146.76 s [vector] +++ OK, passed 100 tests.
  7612. 146.76 s [vector] compare: OK
  7613. 146.76 s [vector] +++ OK, passed 100 tests.
  7614. 146.76 s [vector] maximum: OK
  7615. 146.76 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7616. 146.76 s [vector] minimum: OK
  7617. 146.76 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7618. 146.76 s [vector] minIndex: OK
  7619. 146.76 s [vector] +++ OK, passed 100 tests; 23 discarded.
  7620. 146.76 s [vector] maxIndex: OK
  7621. 146.76 s [vector] +++ OK, passed 100 tests; 19 discarded.
  7622. 146.76 s [vector] maximumBy: OK
  7623. 146.76 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7624. 146.76 s [vector] minimumBy: OK
  7625. 146.76 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7626. 146.76 s [vector] maximumOn: OK
  7627. 146.76 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7628. 146.76 s [vector] minimumOn: OK
  7629. 146.76 s [vector] +++ OK, passed 100 tests; 16 discarded.
  7630. 146.76 s [vector] maxIndexBy: OK
  7631. 146.76 s [vector] +++ OK, passed 100 tests; 24 discarded.
  7632. 146.76 s [vector] minIndexBy: OK
  7633. 146.76 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7634. 146.76 s [vector] ListFirstMaxIndexWins: OK
  7635. 146.76 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7636. 146.76 s [vector] FalseListFirstMaxIndexWins: OK
  7637. 146.76 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  7638. 146.76 s [vector] []
  7639. 146.77 s [vector] zip: OK
  7640. 146.77 s [vector] +++ OK, passed 100 tests.
  7641. 146.77 s [vector] zip3: OK
  7642. 146.77 s [vector] +++ OK, passed 100 tests.
  7643. 146.77 s [vector] unzip: OK
  7644. 146.77 s [vector] +++ OK, passed 100 tests.
  7645. 146.77 s [vector] unzip3: OK
  7646. 146.77 s [vector] +++ OK, passed 100 tests.
  7647. 146.77 s [vector] indexed: OK
  7648. 146.77 s [vector] +++ OK, passed 100 tests.
  7649. 146.77 s [vector] update: OK
  7650. 146.77 s [vector] +++ OK, passed 100 tests.
  7651. 146.77 s [vector] concat: OK
  7652. 146.77 s [vector] +++ OK, passed 100 tests.
  7653. 146.77 s [vector] mempty: OK
  7654. 146.78 s [vector] +++ OK, passed 100 tests.
  7655. 146.78 s [vector] mappend: OK
  7656. 146.78 s [vector] +++ OK, passed 100 tests.
  7657. 146.78 s [vector] mconcat: OK
  7658. 146.78 s [vector] +++ OK, passed 100 tests.
  7659. 146.78 s [vector] fmap: OK
  7660. 146.79 s [vector] +++ OK, passed 100 tests.
  7661. 146.79 s [vector] return: OK
  7662. 146.79 s [vector] +++ OK, passed 100 tests.
  7663. 146.79 s [vector] bind: OK
  7664. 146.79 s [vector] +++ OK, passed 100 tests.
  7665. 146.79 s [vector] mzip: OK
  7666. 146.79 s [vector] +++ OK, passed 100 tests.
  7667. 146.79 s [vector] munzip: OK
  7668. 146.80 s [vector] +++ OK, passed 100 tests.
  7669. 146.80 s [vector] applicative_pure: OK
  7670. 146.80 s [vector] +++ OK, passed 100 tests.
  7671. 146.80 s [vector] applicative_appl: OK (0.01s)
  7672. 146.80 s [vector] +++ OK, passed 100 tests.
  7673. 146.82 s [vector] alternative_empty: OK
  7674. 146.82 s [vector] +++ OK, passed 100 tests.
  7675. 146.82 s [vector] alternative_or: OK
  7676. 146.82 s [vector] +++ OK, passed 100 tests.
  7677. 146.83 s [vector] sequence: OK (0.02s)
  7678. 146.83 s [vector] +++ OK, passed 100 tests.
  7679. 146.83 s [vector] sequence_: OK
  7680. 146.83 s [vector] +++ OK, passed 100 tests.
  7681. 146.83 s [vector] glength: OK
  7682. 146.83 s [vector] +++ OK, passed 100 tests.
  7683. 146.83 s [vector] and: OK
  7684. 146.83 s [vector] +++ OK, passed 100 tests.
  7685. 146.84 s [vector] or: OK
  7686. 146.84 s [vector] +++ OK, passed 100 tests.
  7687. 146.84 s [vector] Int
  7688. 146.84 s [vector] fromList.toList == id: OK
  7689. 146.84 s [vector] +++ OK, passed 100 tests.
  7690. 146.84 s [vector] toList.fromList == id: OK
  7691. 146.84 s [vector] +++ OK, passed 100 tests.
  7692. 146.84 s [vector] unstream.stream == id: OK
  7693. 146.84 s [vector] +++ OK, passed 100 tests.
  7694. 146.84 s [vector] stream.unstream == id: OK
  7695. 146.84 s [vector] +++ OK, passed 100 tests.
  7696. 146.84 s [vector] eq: OK
  7697. 146.84 s [vector] +++ OK, passed 100 tests.
  7698. 146.84 s [vector] length: OK
  7699. 146.84 s [vector] +++ OK, passed 100 tests.
  7700. 146.84 s [vector] null: OK
  7701. 146.84 s [vector] +++ OK, passed 100 tests.
  7702. 146.84 s [vector] index: OK
  7703. 146.84 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7704. 146.84 s [vector] safeIndex: OK
  7705. 146.84 s [vector] +++ OK, passed 100 tests.
  7706. 146.84 s [vector] head: OK
  7707. 146.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  7708. 146.84 s [vector] last: OK
  7709. 146.84 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7710. 146.84 s [vector] unsafeIndex: OK
  7711. 146.84 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7712. 146.84 s [vector] unsafeHead: OK
  7713. 146.84 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7714. 146.84 s [vector] unsafeLast: OK
  7715. 146.84 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7716. 146.84 s [vector] slice: OK
  7717. 146.84 s [vector] +++ OK, passed 100 tests.
  7718. 146.84 s [vector] init: OK
  7719. 146.84 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7720. 146.84 s [vector] tail: OK
  7721. 146.84 s [vector] +++ OK, passed 100 tests; 20 discarded.
  7722. 146.84 s [vector] take: OK
  7723. 146.84 s [vector] +++ OK, passed 100 tests.
  7724. 146.84 s [vector] drop: OK
  7725. 146.84 s [vector] +++ OK, passed 100 tests.
  7726. 146.84 s [vector] splitAt: OK
  7727. 146.84 s [vector] +++ OK, passed 100 tests.
  7728. 146.84 s [vector] empty: OK
  7729. 146.84 s [vector] +++ OK, passed 100 tests.
  7730. 146.84 s [vector] singleton: OK
  7731. 146.84 s [vector] +++ OK, passed 100 tests.
  7732. 146.84 s [vector] replicate: OK
  7733. 146.84 s [vector] +++ OK, passed 100 tests.
  7734. 146.84 s [vector] generate: OK
  7735. 146.84 s [vector] +++ OK, passed 100 tests.
  7736. 146.84 s [vector] iterateN: OK
  7737. 146.86 s [vector] +++ OK, passed 100 tests.
  7738. 146.88 s [vector] iterateNM: OK (0.02s)
  7739. 146.88 s [vector] +++ OK, passed 100 tests.
  7740. 146.88 s [vector] generateM: OK (0.02s)
  7741. 146.88 s [vector] +++ OK, passed 100 tests.
  7742. 146.89 s [vector] replicateM: OK
  7743. 146.89 s [vector] +++ OK, passed 100 tests.
  7744. 146.89 s [vector] create: OK
  7745. 146.89 s [vector] +++ OK, passed 100 tests.
  7746. 146.89 s [vector] createT: OK
  7747. 146.89 s [vector] +++ OK, passed 100 tests.
  7748. 146.89 s [vector] unfoldr: OK
  7749. 146.89 s [vector] +++ OK, passed 100 tests.
  7750. 146.89 s [vector] unfoldrN: OK
  7751. 146.89 s [vector] +++ OK, passed 100 tests.
  7752. 146.89 s [vector] unfoldrExactN: OK
  7753. 146.89 s [vector] +++ OK, passed 100 tests.
  7754. 146.90 s [vector] unfoldrM: OK
  7755. 146.90 s [vector] +++ OK, passed 100 tests.
  7756. 146.90 s [vector] unfoldrNM: OK
  7757. 146.90 s [vector] +++ OK, passed 100 tests.
  7758. 146.91 s [vector] unfoldrExactNM: OK
  7759. 146.91 s [vector] +++ OK, passed 100 tests.
  7760. 146.91 s [vector] constructN: OK
  7761. 146.91 s [vector] +++ OK, passed 100 tests.
  7762. 146.91 s [vector] constructrN: OK
  7763. 146.91 s [vector] +++ OK, passed 100 tests.
  7764. 146.91 s [vector] cons: OK
  7765. 146.91 s [vector] +++ OK, passed 100 tests.
  7766. 146.91 s [vector] snoc: OK
  7767. 146.91 s [vector] +++ OK, passed 100 tests.
  7768. 146.91 s [vector] append: OK
  7769. 146.92 s [vector] +++ OK, passed 100 tests.
  7770. 146.92 s [vector] concat: OK
  7771. 146.92 s [vector] +++ OK, passed 100 tests.
  7772. 146.92 s [vector] force: OK
  7773. 146.92 s [vector] +++ OK, passed 100 tests.
  7774. 146.93 s [vector] upd: OK
  7775. 146.93 s [vector] +++ OK, passed 100 tests.
  7776. 146.93 s [vector] accum: OK
  7777. 146.93 s [vector] +++ OK, passed 100 tests.
  7778. 146.93 s [vector] reverse: OK
  7779. 146.93 s [vector] +++ OK, passed 100 tests.
  7780. 146.93 s [vector] backpermute: OK
  7781. 146.93 s [vector] +++ OK, passed 100 tests.
  7782. 146.93 s [vector] map: OK
  7783. 146.93 s [vector] +++ OK, passed 100 tests.
  7784. 146.93 s [vector] imap: OK
  7785. 146.93 s [vector] +++ OK, passed 100 tests.
  7786. 146.94 s [vector] concatMap: OK
  7787. 146.94 s [vector] +++ OK, passed 100 tests.
  7788. 146.94 s [vector] mapM: OK
  7789. 146.94 s [vector] +++ OK, passed 100 tests.
  7790. 146.95 s [vector] mapM_: OK (0.01s)
  7791. 146.96 s [vector] +++ OK, passed 100 tests.
  7792. 146.96 s [vector] forM: OK
  7793. 146.96 s [vector] +++ OK, passed 100 tests.
  7794. 146.97 s [vector] forM_: OK (0.01s)
  7795. 146.98 s [vector] +++ OK, passed 100 tests.
  7796. 146.98 s [vector] imapM: OK
  7797. 146.98 s [vector] +++ OK, passed 100 tests.
  7798. 146.98 s [vector] imapM_: OK (0.01s)
  7799. 146.98 s [vector] +++ OK, passed 100 tests.
  7800. 146.98 s [vector] zipWith: OK
  7801. 146.98 s [vector] +++ OK, passed 100 tests.
  7802. 146.99 s [vector] zipWith3: OK
  7803. 146.99 s [vector] +++ OK, passed 100 tests.
  7804. 146.99 s [vector] izipWith: OK
  7805. 146.99 s [vector] +++ OK, passed 100 tests.
  7806. 146.99 s [vector] izipWith3: OK
  7807. 146.99 s [vector] +++ OK, passed 100 tests.
  7808. 147.00 s [vector] izipWithM: OK
  7809. 147.00 s [vector] +++ OK, passed 100 tests.
  7810. 147.00 s [vector] izipWithM_: OK (0.01s)
  7811. 147.01 s [vector] +++ OK, passed 100 tests.
  7812. 147.01 s [vector] zipWithM: OK
  7813. 147.01 s [vector] +++ OK, passed 100 tests.
  7814. 147.01 s [vector] zipWithM_: OK
  7815. 147.01 s [vector] +++ OK, passed 100 tests.
  7816. 147.01 s [vector] filter: OK
  7817. 147.02 s [vector] +++ OK, passed 100 tests.
  7818. 147.02 s [vector] ifilter: OK
  7819. 147.02 s [vector] +++ OK, passed 100 tests.
  7820. 147.04 s [vector] filterM: OK (0.02s)
  7821. 147.04 s [vector] +++ OK, passed 100 tests.
  7822. 147.04 s [vector] uniq: OK
  7823. 147.04 s [vector] +++ OK, passed 100 tests.
  7824. 147.04 s [vector] mapMaybe: OK
  7825. 147.04 s [vector] +++ OK, passed 100 tests.
  7826. 147.04 s [vector] imapMaybe: OK
  7827. 147.04 s [vector] +++ OK, passed 100 tests.
  7828. 147.04 s [vector] takeWhile: OK
  7829. 147.04 s [vector] +++ OK, passed 100 tests.
  7830. 147.04 s [vector] dropWhile: OK
  7831. 147.04 s [vector] +++ OK, passed 100 tests.
  7832. 147.04 s [vector] partition: OK
  7833. 147.04 s [vector] +++ OK, passed 100 tests.
  7834. 147.04 s [vector] partitionWith: OK
  7835. 147.04 s [vector] +++ OK, passed 100 tests.
  7836. 147.04 s [vector] span: OK
  7837. 147.05 s [vector] +++ OK, passed 100 tests.
  7838. 147.05 s [vector] break: OK
  7839. 147.05 s [vector] +++ OK, passed 100 tests.
  7840. 147.05 s [vector] spanR: OK
  7841. 147.05 s [vector] +++ OK, passed 100 tests.
  7842. 147.05 s [vector] breakR: OK
  7843. 147.05 s [vector] +++ OK, passed 100 tests.
  7844. 147.05 s [vector] groupBy: OK
  7845. 147.05 s [vector] +++ OK, passed 100 tests.
  7846. 147.05 s [vector] elem: OK
  7847. 147.05 s [vector] +++ OK, passed 100 tests.
  7848. 147.05 s [vector] notElem: OK
  7849. 147.05 s [vector] +++ OK, passed 100 tests.
  7850. 147.05 s [vector] find: OK
  7851. 147.05 s [vector] +++ OK, passed 100 tests.
  7852. 147.05 s [vector] findIndex: OK
  7853. 147.05 s [vector] +++ OK, passed 100 tests.
  7854. 147.05 s [vector] findIndexR: OK
  7855. 147.05 s [vector] +++ OK, passed 100 tests.
  7856. 147.05 s [vector] findIndices: OK
  7857. 147.05 s [vector] +++ OK, passed 100 tests.
  7858. 147.05 s [vector] elemIndex: OK
  7859. 147.05 s [vector] +++ OK, passed 100 tests.
  7860. 147.05 s [vector] elemIndices: OK
  7861. 147.05 s [vector] +++ OK, passed 100 tests.
  7862. 147.05 s [vector] foldl: OK
  7863. 147.05 s [vector] +++ OK, passed 100 tests.
  7864. 147.06 s [vector] foldl1: OK
  7865. 147.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7866. 147.06 s [vector] foldl': OK
  7867. 147.06 s [vector] +++ OK, passed 100 tests.
  7868. 147.06 s [vector] foldl1': OK
  7869. 147.06 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7870. 147.06 s [vector] foldr: OK
  7871. 147.06 s [vector] +++ OK, passed 100 tests.
  7872. 147.06 s [vector] foldr1: OK
  7873. 147.06 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7874. 147.07 s [vector] foldr': OK
  7875. 147.07 s [vector] +++ OK, passed 100 tests.
  7876. 147.07 s [vector] foldr1': OK
  7877. 147.07 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7878. 147.07 s [vector] ifoldl: OK
  7879. 147.07 s [vector] +++ OK, passed 100 tests.
  7880. 147.07 s [vector] ifoldl': OK
  7881. 147.08 s [vector] +++ OK, passed 100 tests.
  7882. 147.08 s [vector] ifoldr: OK
  7883. 147.08 s [vector] +++ OK, passed 100 tests.
  7884. 147.08 s [vector] ifoldr': OK
  7885. 147.08 s [vector] +++ OK, passed 100 tests.
  7886. 147.08 s [vector] ifoldM: OK
  7887. 147.08 s [vector] +++ OK, passed 100 tests.
  7888. 147.08 s [vector] ifoldM': OK
  7889. 147.08 s [vector] +++ OK, passed 100 tests.
  7890. 147.09 s [vector] ifoldM_: OK (0.01s)
  7891. 147.09 s [vector] +++ OK, passed 100 tests.
  7892. 147.11 s [vector] ifoldM'_: OK
  7893. 147.11 s [vector] +++ OK, passed 100 tests.
  7894. 147.11 s [vector] all: OK
  7895. 147.11 s [vector] +++ OK, passed 100 tests.
  7896. 147.11 s [vector] any: OK
  7897. 147.11 s [vector] +++ OK, passed 100 tests.
  7898. 147.11 s [vector] prescanl: OK
  7899. 147.11 s [vector] +++ OK, passed 100 tests.
  7900. 147.11 s [vector] prescanl': OK
  7901. 147.11 s [vector] +++ OK, passed 100 tests.
  7902. 147.12 s [vector] postscanl: OK
  7903. 147.12 s [vector] +++ OK, passed 100 tests.
  7904. 147.12 s [vector] postscanl': OK
  7905. 147.12 s [vector] +++ OK, passed 100 tests.
  7906. 147.12 s [vector] scanl: OK
  7907. 147.12 s [vector] +++ OK, passed 100 tests.
  7908. 147.12 s [vector] scanl': OK
  7909. 147.12 s [vector] +++ OK, passed 100 tests.
  7910. 147.12 s [vector] scanl1: OK
  7911. 147.13 s [vector] +++ OK, passed 100 tests.
  7912. 147.13 s [vector] scanl1': OK
  7913. 147.13 s [vector] +++ OK, passed 100 tests.
  7914. 147.13 s [vector] iscanl: OK
  7915. 147.13 s [vector] +++ OK, passed 100 tests.
  7916. 147.13 s [vector] iscanl': OK
  7917. 147.13 s [vector] +++ OK, passed 100 tests.
  7918. 147.13 s [vector] prescanr: OK
  7919. 147.13 s [vector] +++ OK, passed 100 tests.
  7920. 147.14 s [vector] prescanr': OK
  7921. 147.14 s [vector] +++ OK, passed 100 tests.
  7922. 147.14 s [vector] postscanr: OK
  7923. 147.14 s [vector] +++ OK, passed 100 tests.
  7924. 147.14 s [vector] postscanr': OK
  7925. 147.14 s [vector] +++ OK, passed 100 tests.
  7926. 147.14 s [vector] scanr: OK
  7927. 147.15 s [vector] +++ OK, passed 100 tests.
  7928. 147.15 s [vector] scanr': OK
  7929. 147.15 s [vector] +++ OK, passed 100 tests.
  7930. 147.15 s [vector] scanr1: OK
  7931. 147.15 s [vector] +++ OK, passed 100 tests.
  7932. 147.15 s [vector] scanr1': OK
  7933. 147.15 s [vector] +++ OK, passed 100 tests.
  7934. 147.15 s [vector] iscanr: OK
  7935. 147.15 s [vector] +++ OK, passed 100 tests.
  7936. 147.15 s [vector] iscanr': OK
  7937. 147.15 s [vector] +++ OK, passed 100 tests.
  7938. 147.15 s [vector] mut_read: OK
  7939. 147.15 s [vector] +++ OK, passed 100 tests; 17 discarded.
  7940. 147.15 s [vector] mut_write: OK
  7941. 147.15 s [vector] +++ OK, passed 100 tests; 15 discarded.
  7942. 147.15 s [vector] mut_modify: OK
  7943. 147.15 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7944. 147.16 s [vector] mut_generate: OK
  7945. 147.16 s [vector] +++ OK, passed 100 tests.
  7946. 147.16 s [vector] mut_generateM: OK
  7947. 147.16 s [vector] +++ OK, passed 100 tests.
  7948. 147.18 s [vector] mut_mapM_: OK (0.01s)
  7949. 147.18 s [vector] +++ OK, passed 100 tests.
  7950. 147.20 s [vector] mut_imapM_: OK (0.01s)
  7951. 147.20 s [vector] +++ OK, passed 100 tests.
  7952. 147.21 s [vector] mut_forM_: OK (0.01s)
  7953. 147.22 s [vector] +++ OK, passed 100 tests.
  7954. 147.22 s [vector] mut_iforM_: OK (0.01s)
  7955. 147.22 s [vector] +++ OK, passed 100 tests.
  7956. 147.22 s [vector] mut_foldr: OK
  7957. 147.22 s [vector] +++ OK, passed 100 tests.
  7958. 147.22 s [vector] mut_foldr': OK
  7959. 147.22 s [vector] +++ OK, passed 100 tests.
  7960. 147.22 s [vector] mut_foldl: OK
  7961. 147.22 s [vector] +++ OK, passed 100 tests.
  7962. 147.22 s [vector] mut_foldl': OK
  7963. 147.22 s [vector] +++ OK, passed 100 tests.
  7964. 147.23 s [vector] mut_ifoldr: OK
  7965. 147.23 s [vector] +++ OK, passed 100 tests.
  7966. 147.23 s [vector] mut_ifoldr': OK
  7967. 147.23 s [vector] +++ OK, passed 100 tests.
  7968. 147.23 s [vector] mut_ifoldl: OK
  7969. 147.23 s [vector] +++ OK, passed 100 tests.
  7970. 147.23 s [vector] mut_ifoldl': OK
  7971. 147.24 s [vector] +++ OK, passed 100 tests.
  7972. 147.24 s [vector] mut_foldM: OK
  7973. 147.24 s [vector] +++ OK, passed 100 tests.
  7974. 147.24 s [vector] mut_foldM': OK
  7975. 147.24 s [vector] +++ OK, passed 100 tests.
  7976. 147.24 s [vector] mut_foldrM: OK
  7977. 147.24 s [vector] +++ OK, passed 100 tests.
  7978. 147.24 s [vector] mut_foldrM': OK
  7979. 147.24 s [vector] +++ OK, passed 100 tests.
  7980. 147.24 s [vector] mut_ifoldM: OK
  7981. 147.25 s [vector] +++ OK, passed 100 tests.
  7982. 147.25 s [vector] mut_ifoldM': OK
  7983. 147.25 s [vector] +++ OK, passed 100 tests.
  7984. 147.25 s [vector] mut_ifoldrM: OK
  7985. 147.25 s [vector] +++ OK, passed 100 tests.
  7986. 147.25 s [vector] mut_ifoldrM': OK
  7987. 147.25 s [vector] +++ OK, passed 100 tests.
  7988. 147.25 s [vector] compare: OK
  7989. 147.25 s [vector] +++ OK, passed 100 tests.
  7990. 147.25 s [vector] maximum: OK
  7991. 147.25 s [vector] +++ OK, passed 100 tests; 18 discarded.
  7992. 147.25 s [vector] minimum: OK
  7993. 147.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  7994. 147.25 s [vector] minIndex: OK
  7995. 147.25 s [vector] +++ OK, passed 100 tests; 12 discarded.
  7996. 147.25 s [vector] maxIndex: OK
  7997. 147.25 s [vector] +++ OK, passed 100 tests; 22 discarded.
  7998. 147.25 s [vector] maximumBy: OK
  7999. 147.25 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8000. 147.25 s [vector] minimumBy: OK
  8001. 147.25 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8002. 147.25 s [vector] maximumOn: OK
  8003. 147.25 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8004. 147.26 s [vector] minimumOn: OK
  8005. 147.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8006. 147.26 s [vector] maxIndexBy: OK
  8007. 147.26 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8008. 147.26 s [vector] minIndexBy: OK
  8009. 147.26 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8010. 147.26 s [vector] ListFirstMaxIndexWins: OK
  8011. 147.26 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8012. 147.26 s [vector] FalseListFirstMaxIndexWins: OK
  8013. 147.26 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  8014. 147.26 s [vector] []
  8015. 147.26 s [vector] zip: OK
  8016. 147.26 s [vector] +++ OK, passed 100 tests.
  8017. 147.26 s [vector] zip3: OK
  8018. 147.26 s [vector] +++ OK, passed 100 tests.
  8019. 147.26 s [vector] unzip: OK
  8020. 147.26 s [vector] +++ OK, passed 100 tests.
  8021. 147.26 s [vector] unzip3: OK
  8022. 147.26 s [vector] +++ OK, passed 100 tests.
  8023. 147.27 s [vector] indexed: OK
  8024. 147.27 s [vector] +++ OK, passed 100 tests.
  8025. 147.27 s [vector] update: OK
  8026. 147.27 s [vector] +++ OK, passed 100 tests.
  8027. 147.27 s [vector] concat: OK
  8028. 147.27 s [vector] +++ OK, passed 100 tests.
  8029. 147.27 s [vector] mempty: OK
  8030. 147.27 s [vector] +++ OK, passed 100 tests.
  8031. 147.27 s [vector] mappend: OK
  8032. 147.27 s [vector] +++ OK, passed 100 tests.
  8033. 147.28 s [vector] mconcat: OK
  8034. 147.28 s [vector] +++ OK, passed 100 tests.
  8035. 147.28 s [vector] fmap: OK
  8036. 147.28 s [vector] +++ OK, passed 100 tests.
  8037. 147.28 s [vector] return: OK
  8038. 147.28 s [vector] +++ OK, passed 100 tests.
  8039. 147.29 s [vector] bind: OK (0.01s)
  8040. 147.29 s [vector] +++ OK, passed 100 tests.
  8041. 147.29 s [vector] mzip: OK
  8042. 147.29 s [vector] +++ OK, passed 100 tests.
  8043. 147.29 s [vector] munzip: OK
  8044. 147.29 s [vector] +++ OK, passed 100 tests.
  8045. 147.30 s [vector] applicative_pure: OK
  8046. 147.30 s [vector] +++ OK, passed 100 tests.
  8047. 147.32 s [vector] applicative_appl: OK (0.03s)
  8048. 147.32 s [vector] +++ OK, passed 100 tests.
  8049. 147.32 s [vector] alternative_empty: OK
  8050. 147.32 s [vector] +++ OK, passed 100 tests.
  8051. 147.34 s [vector] alternative_or: OK
  8052. 147.34 s [vector] +++ OK, passed 100 tests.
  8053. 147.36 s [vector] sequence: OK (0.03s)
  8054. 147.36 s [vector] +++ OK, passed 100 tests.
  8055. 147.36 s [vector] sequence_: OK (0.01s)
  8056. 147.36 s [vector] +++ OK, passed 100 tests.
  8057. 147.36 s [vector] glength: OK
  8058. 147.36 s [vector] +++ OK, passed 100 tests.
  8059. 147.37 s [vector] sum: OK
  8060. 147.37 s [vector] +++ OK, passed 100 tests.
  8061. 147.37 s [vector] product: OK
  8062. 147.37 s [vector] +++ OK, passed 100 tests.
  8063. 147.37 s [vector] enumFromN: OK
  8064. 147.37 s [vector] +++ OK, passed 100 tests.
  8065. 147.37 s [vector] enumFromThenN: OK
  8066. 147.37 s [vector] +++ OK, passed 100 tests.
  8067. 147.37 s [vector] enumFromTo: OK
  8068. 147.37 s [vector] +++ OK, passed 100 tests.
  8069. 147.37 s [vector] enumFromThenTo: OK
  8070. 147.37 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8071. 147.37 s [vector] unstream
  8072. 147.37 s [vector] unstream == vunstream (exact): OK
  8073. 147.37 s [vector] +++ OK, passed 100 tests.
  8074. 147.37 s [vector] unstream == vunstream (unknown): OK
  8075. 147.37 s [vector] +++ OK, passed 100 tests.
  8076. 147.37 s [vector] unstreamR ~= vunstream (exact): OK
  8077. 147.37 s [vector] +++ OK, passed 100 tests.
  8078. 147.37 s [vector] unstreamR ~= vunstream (unknown): OK
  8079. 147.37 s [vector] +++ OK, passed 100 tests.
  8080. 147.37 s [vector] Tests.Vector.Primitive
  8081. 147.37 s [vector] Int
  8082. 147.37 s [vector] fromList.toList == id: OK
  8083. 147.37 s [vector] +++ OK, passed 100 tests.
  8084. 147.37 s [vector] toList.fromList == id: OK
  8085. 147.37 s [vector] +++ OK, passed 100 tests.
  8086. 147.37 s [vector] unstream.stream == id: OK
  8087. 147.37 s [vector] +++ OK, passed 100 tests.
  8088. 147.37 s [vector] stream.unstream == id: OK
  8089. 147.37 s [vector] +++ OK, passed 100 tests.
  8090. 147.37 s [vector] eq: OK
  8091. 147.37 s [vector] +++ OK, passed 100 tests.
  8092. 147.37 s [vector] length: OK
  8093. 147.37 s [vector] +++ OK, passed 100 tests.
  8094. 147.37 s [vector] null: OK
  8095. 147.37 s [vector] +++ OK, passed 100 tests.
  8096. 147.37 s [vector] index: OK
  8097. 147.37 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8098. 147.37 s [vector] safeIndex: OK
  8099. 147.37 s [vector] +++ OK, passed 100 tests.
  8100. 147.37 s [vector] head: OK
  8101. 147.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8102. 147.37 s [vector] last: OK
  8103. 147.37 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8104. 147.37 s [vector] unsafeIndex: OK
  8105. 147.37 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8106. 147.37 s [vector] unsafeHead: OK
  8107. 147.37 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8108. 147.37 s [vector] unsafeLast: OK
  8109. 147.37 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8110. 147.37 s [vector] slice: OK
  8111. 147.37 s [vector] +++ OK, passed 100 tests.
  8112. 147.37 s [vector] init: OK
  8113. 147.37 s [vector] +++ OK, passed 100 tests; 23 discarded.
  8114. 147.37 s [vector] tail: OK
  8115. 147.37 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8116. 147.37 s [vector] take: OK
  8117. 147.37 s [vector] +++ OK, passed 100 tests.
  8118. 147.37 s [vector] drop: OK
  8119. 147.37 s [vector] +++ OK, passed 100 tests.
  8120. 147.37 s [vector] splitAt: OK
  8121. 147.38 s [vector] +++ OK, passed 100 tests.
  8122. 147.38 s [vector] empty: OK
  8123. 147.38 s [vector] +++ OK, passed 100 tests.
  8124. 147.38 s [vector] singleton: OK
  8125. 147.38 s [vector] +++ OK, passed 100 tests.
  8126. 147.38 s [vector] replicate: OK
  8127. 147.38 s [vector] +++ OK, passed 100 tests.
  8128. 147.38 s [vector] generate: OK
  8129. 147.38 s [vector] +++ OK, passed 100 tests.
  8130. 147.38 s [vector] iterateN: OK
  8131. 147.38 s [vector] +++ OK, passed 100 tests.
  8132. 147.40 s [vector] iterateNM: OK (0.01s)
  8133. 147.40 s [vector] +++ OK, passed 100 tests.
  8134. 147.42 s [vector] generateM: OK (0.02s)
  8135. 147.42 s [vector] +++ OK, passed 100 tests.
  8136. 147.42 s [vector] replicateM: OK (0.01s)
  8137. 147.42 s [vector] +++ OK, passed 100 tests.
  8138. 147.42 s [vector] create: OK
  8139. 147.42 s [vector] +++ OK, passed 100 tests.
  8140. 147.42 s [vector] createT: OK
  8141. 147.42 s [vector] +++ OK, passed 100 tests.
  8142. 147.42 s [vector] unfoldr: OK
  8143. 147.42 s [vector] +++ OK, passed 100 tests.
  8144. 147.42 s [vector] unfoldrN: OK
  8145. 147.42 s [vector] +++ OK, passed 100 tests.
  8146. 147.43 s [vector] unfoldrExactN: OK
  8147. 147.43 s [vector] +++ OK, passed 100 tests.
  8148. 147.43 s [vector] unfoldrM: OK
  8149. 147.43 s [vector] +++ OK, passed 100 tests.
  8150. 147.43 s [vector] unfoldrNM: OK
  8151. 147.44 s [vector] +++ OK, passed 100 tests.
  8152. 147.45 s [vector] unfoldrExactNM: OK (0.02s)
  8153. 147.45 s [vector] +++ OK, passed 100 tests.
  8154. 147.45 s [vector] constructN: OK
  8155. 147.45 s [vector] +++ OK, passed 100 tests.
  8156. 147.45 s [vector] constructrN: OK
  8157. 147.45 s [vector] +++ OK, passed 100 tests.
  8158. 147.45 s [vector] cons: OK
  8159. 147.45 s [vector] +++ OK, passed 100 tests.
  8160. 147.45 s [vector] snoc: OK
  8161. 147.45 s [vector] +++ OK, passed 100 tests.
  8162. 147.46 s [vector] append: OK
  8163. 147.46 s [vector] +++ OK, passed 100 tests.
  8164. 147.47 s [vector] concat: OK (0.01s)
  8165. 147.47 s [vector] +++ OK, passed 100 tests.
  8166. 147.47 s [vector] force: OK
  8167. 147.47 s [vector] +++ OK, passed 100 tests.
  8168. 147.47 s [vector] upd: OK
  8169. 147.47 s [vector] +++ OK, passed 100 tests.
  8170. 147.47 s [vector] accum: OK
  8171. 147.47 s [vector] +++ OK, passed 100 tests.
  8172. 147.47 s [vector] reverse: OK
  8173. 147.47 s [vector] +++ OK, passed 100 tests.
  8174. 147.47 s [vector] backpermute: OK
  8175. 147.47 s [vector] +++ OK, passed 100 tests.
  8176. 147.47 s [vector] map: OK
  8177. 147.48 s [vector] +++ OK, passed 100 tests.
  8178. 147.48 s [vector] imap: OK
  8179. 147.48 s [vector] +++ OK, passed 100 tests.
  8180. 147.48 s [vector] concatMap: OK
  8181. 147.48 s [vector] +++ OK, passed 100 tests.
  8182. 147.48 s [vector] mapM: OK
  8183. 147.50 s [vector] +++ OK, passed 100 tests.
  8184. 147.50 s [vector] mapM_: OK (0.01s)
  8185. 147.50 s [vector] +++ OK, passed 100 tests.
  8186. 147.50 s [vector] forM: OK
  8187. 147.50 s [vector] +++ OK, passed 100 tests.
  8188. 147.51 s [vector] forM_: OK (0.01s)
  8189. 147.51 s [vector] +++ OK, passed 100 tests.
  8190. 147.52 s [vector] imapM: OK
  8191. 147.52 s [vector] +++ OK, passed 100 tests.
  8192. 147.53 s [vector] imapM_: OK (0.01s)
  8193. 147.53 s [vector] +++ OK, passed 100 tests.
  8194. 147.53 s [vector] zipWith: OK
  8195. 147.53 s [vector] +++ OK, passed 100 tests.
  8196. 147.53 s [vector] zipWith3: OK
  8197. 147.53 s [vector] +++ OK, passed 100 tests.
  8198. 147.53 s [vector] izipWith: OK
  8199. 147.54 s [vector] +++ OK, passed 100 tests.
  8200. 147.54 s [vector] izipWith3: OK
  8201. 147.54 s [vector] +++ OK, passed 100 tests.
  8202. 147.54 s [vector] izipWithM: OK
  8203. 147.54 s [vector] +++ OK, passed 100 tests.
  8204. 147.55 s [vector] izipWithM_: OK (0.01s)
  8205. 147.55 s [vector] +++ OK, passed 100 tests.
  8206. 147.56 s [vector] zipWithM: OK
  8207. 147.56 s [vector] +++ OK, passed 100 tests.
  8208. 147.56 s [vector] zipWithM_: OK
  8209. 147.56 s [vector] +++ OK, passed 100 tests.
  8210. 147.56 s [vector] filter: OK
  8211. 147.56 s [vector] +++ OK, passed 100 tests.
  8212. 147.58 s [vector] ifilter: OK
  8213. 147.58 s [vector] +++ OK, passed 100 tests.
  8214. 147.58 s [vector] filterM: OK (0.02s)
  8215. 147.58 s [vector] +++ OK, passed 100 tests.
  8216. 147.59 s [vector] uniq: OK
  8217. 147.59 s [vector] +++ OK, passed 100 tests.
  8218. 147.59 s [vector] mapMaybe: OK
  8219. 147.59 s [vector] +++ OK, passed 100 tests.
  8220. 147.59 s [vector] imapMaybe: OK
  8221. 147.59 s [vector] +++ OK, passed 100 tests.
  8222. 147.59 s [vector] takeWhile: OK
  8223. 147.59 s [vector] +++ OK, passed 100 tests.
  8224. 147.59 s [vector] dropWhile: OK
  8225. 147.59 s [vector] +++ OK, passed 100 tests.
  8226. 147.59 s [vector] partition: OK
  8227. 147.59 s [vector] +++ OK, passed 100 tests.
  8228. 147.59 s [vector] partitionWith: OK
  8229. 147.59 s [vector] +++ OK, passed 100 tests.
  8230. 147.59 s [vector] span: OK
  8231. 147.59 s [vector] +++ OK, passed 100 tests.
  8232. 147.59 s [vector] break: OK
  8233. 147.60 s [vector] +++ OK, passed 100 tests.
  8234. 147.60 s [vector] spanR: OK
  8235. 147.60 s [vector] +++ OK, passed 100 tests.
  8236. 147.60 s [vector] breakR: OK
  8237. 147.60 s [vector] +++ OK, passed 100 tests.
  8238. 147.60 s [vector] groupBy: OK
  8239. 147.60 s [vector] +++ OK, passed 100 tests.
  8240. 147.60 s [vector] elem: OK
  8241. 147.60 s [vector] +++ OK, passed 100 tests.
  8242. 147.60 s [vector] notElem: OK
  8243. 147.60 s [vector] +++ OK, passed 100 tests.
  8244. 147.60 s [vector] find: OK
  8245. 147.60 s [vector] +++ OK, passed 100 tests.
  8246. 147.60 s [vector] findIndex: OK
  8247. 147.60 s [vector] +++ OK, passed 100 tests.
  8248. 147.60 s [vector] findIndexR: OK
  8249. 147.60 s [vector] +++ OK, passed 100 tests.
  8250. 147.60 s [vector] findIndices: OK
  8251. 147.60 s [vector] +++ OK, passed 100 tests.
  8252. 147.60 s [vector] elemIndex: OK
  8253. 147.60 s [vector] +++ OK, passed 100 tests.
  8254. 147.60 s [vector] elemIndices: OK
  8255. 147.60 s [vector] +++ OK, passed 100 tests.
  8256. 147.61 s [vector] foldl: OK
  8257. 147.61 s [vector] +++ OK, passed 100 tests.
  8258. 147.61 s [vector] foldl1: OK
  8259. 147.61 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8260. 147.61 s [vector] foldl': OK
  8261. 147.61 s [vector] +++ OK, passed 100 tests.
  8262. 147.61 s [vector] foldl1': OK
  8263. 147.61 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8264. 147.61 s [vector] foldr: OK
  8265. 147.61 s [vector] +++ OK, passed 100 tests.
  8266. 147.62 s [vector] foldr1: OK
  8267. 147.62 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8268. 147.62 s [vector] foldr': OK
  8269. 147.62 s [vector] +++ OK, passed 100 tests.
  8270. 147.62 s [vector] foldr1': OK
  8271. 147.62 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8272. 147.62 s [vector] ifoldl: OK
  8273. 147.62 s [vector] +++ OK, passed 100 tests.
  8274. 147.62 s [vector] ifoldl': OK
  8275. 147.63 s [vector] +++ OK, passed 100 tests.
  8276. 147.63 s [vector] ifoldr: OK
  8277. 147.63 s [vector] +++ OK, passed 100 tests.
  8278. 147.63 s [vector] ifoldr': OK
  8279. 147.63 s [vector] +++ OK, passed 100 tests.
  8280. 147.63 s [vector] ifoldM: OK
  8281. 147.63 s [vector] +++ OK, passed 100 tests.
  8282. 147.64 s [vector] ifoldM': OK
  8283. 147.64 s [vector] +++ OK, passed 100 tests.
  8284. 147.66 s [vector] ifoldM_: OK (0.01s)
  8285. 147.66 s [vector] +++ OK, passed 100 tests.
  8286. 147.66 s [vector] ifoldM'_: OK (0.01s)
  8287. 147.66 s [vector] +++ OK, passed 100 tests.
  8288. 147.66 s [vector] all: OK
  8289. 147.66 s [vector] +++ OK, passed 100 tests.
  8290. 147.66 s [vector] any: OK
  8291. 147.66 s [vector] +++ OK, passed 100 tests.
  8292. 147.66 s [vector] prescanl: OK
  8293. 147.66 s [vector] +++ OK, passed 100 tests.
  8294. 147.66 s [vector] prescanl': OK
  8295. 147.66 s [vector] +++ OK, passed 100 tests.
  8296. 147.66 s [vector] postscanl: OK
  8297. 147.67 s [vector] +++ OK, passed 100 tests.
  8298. 147.67 s [vector] postscanl': OK
  8299. 147.67 s [vector] +++ OK, passed 100 tests.
  8300. 147.67 s [vector] scanl: OK
  8301. 147.67 s [vector] +++ OK, passed 100 tests.
  8302. 147.67 s [vector] scanl': OK
  8303. 147.67 s [vector] +++ OK, passed 100 tests.
  8304. 147.67 s [vector] scanl1: OK
  8305. 147.67 s [vector] +++ OK, passed 100 tests.
  8306. 147.68 s [vector] scanl1': OK
  8307. 147.68 s [vector] +++ OK, passed 100 tests.
  8308. 147.68 s [vector] iscanl: OK
  8309. 147.68 s [vector] +++ OK, passed 100 tests.
  8310. 147.68 s [vector] iscanl': OK
  8311. 147.68 s [vector] +++ OK, passed 100 tests.
  8312. 147.68 s [vector] prescanr: OK
  8313. 147.68 s [vector] +++ OK, passed 100 tests.
  8314. 147.69 s [vector] prescanr': OK
  8315. 147.69 s [vector] +++ OK, passed 100 tests.
  8316. 147.69 s [vector] postscanr: OK
  8317. 147.69 s [vector] +++ OK, passed 100 tests.
  8318. 147.69 s [vector] postscanr': OK
  8319. 147.69 s [vector] +++ OK, passed 100 tests.
  8320. 147.69 s [vector] scanr: OK
  8321. 147.69 s [vector] +++ OK, passed 100 tests.
  8322. 147.70 s [vector] scanr': OK
  8323. 147.70 s [vector] +++ OK, passed 100 tests.
  8324. 147.70 s [vector] scanr1: OK
  8325. 147.70 s [vector] +++ OK, passed 100 tests.
  8326. 147.70 s [vector] scanr1': OK
  8327. 147.70 s [vector] +++ OK, passed 100 tests.
  8328. 147.70 s [vector] iscanr: OK
  8329. 147.71 s [vector] +++ OK, passed 100 tests.
  8330. 147.71 s [vector] iscanr': OK
  8331. 147.71 s [vector] +++ OK, passed 100 tests.
  8332. 147.71 s [vector] mut_read: OK
  8333. 147.71 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8334. 147.71 s [vector] mut_write: OK
  8335. 147.71 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8336. 147.71 s [vector] mut_modify: OK
  8337. 147.71 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8338. 147.71 s [vector] mut_generate: OK
  8339. 147.72 s [vector] +++ OK, passed 100 tests.
  8340. 147.73 s [vector] mut_generateM: OK (0.01s)
  8341. 147.73 s [vector] +++ OK, passed 100 tests.
  8342. 147.74 s [vector] mut_mapM_: OK (0.01s)
  8343. 147.74 s [vector] +++ OK, passed 100 tests.
  8344. 147.76 s [vector] mut_imapM_: OK (0.01s)
  8345. 147.76 s [vector] +++ OK, passed 100 tests.
  8346. 147.77 s [vector] mut_forM_: OK (0.02s)
  8347. 147.78 s [vector] +++ OK, passed 100 tests.
  8348. 147.78 s [vector] mut_iforM_: OK (0.02s)
  8349. 147.78 s [vector] +++ OK, passed 100 tests.
  8350. 147.78 s [vector] mut_foldr: OK
  8351. 147.78 s [vector] +++ OK, passed 100 tests.
  8352. 147.78 s [vector] mut_foldr': OK
  8353. 147.78 s [vector] +++ OK, passed 100 tests.
  8354. 147.78 s [vector] mut_foldl: OK
  8355. 147.78 s [vector] +++ OK, passed 100 tests.
  8356. 147.78 s [vector] mut_foldl': OK
  8357. 147.78 s [vector] +++ OK, passed 100 tests.
  8358. 147.79 s [vector] mut_ifoldr: OK
  8359. 147.79 s [vector] +++ OK, passed 100 tests.
  8360. 147.79 s [vector] mut_ifoldr': OK
  8361. 147.79 s [vector] +++ OK, passed 100 tests.
  8362. 147.79 s [vector] mut_ifoldl: OK
  8363. 147.79 s [vector] +++ OK, passed 100 tests.
  8364. 147.79 s [vector] mut_ifoldl': OK
  8365. 147.79 s [vector] +++ OK, passed 100 tests.
  8366. 147.80 s [vector] mut_foldM: OK
  8367. 147.80 s [vector] +++ OK, passed 100 tests.
  8368. 147.80 s [vector] mut_foldM': OK
  8369. 147.80 s [vector] +++ OK, passed 100 tests.
  8370. 147.80 s [vector] mut_foldrM: OK
  8371. 147.80 s [vector] +++ OK, passed 100 tests.
  8372. 147.80 s [vector] mut_foldrM': OK
  8373. 147.80 s [vector] +++ OK, passed 100 tests.
  8374. 147.80 s [vector] mut_ifoldM: OK
  8375. 147.80 s [vector] +++ OK, passed 100 tests.
  8376. 147.81 s [vector] mut_ifoldM': OK
  8377. 147.81 s [vector] +++ OK, passed 100 tests.
  8378. 147.81 s [vector] mut_ifoldrM: OK
  8379. 147.81 s [vector] +++ OK, passed 100 tests.
  8380. 147.81 s [vector] mut_ifoldrM': OK
  8381. 147.81 s [vector] +++ OK, passed 100 tests.
  8382. 147.81 s [vector] compare: OK
  8383. 147.81 s [vector] +++ OK, passed 100 tests.
  8384. 147.81 s [vector] maximum: OK
  8385. 147.81 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8386. 147.81 s [vector] minimum: OK
  8387. 147.81 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8388. 147.81 s [vector] minIndex: OK
  8389. 147.81 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8390. 147.81 s [vector] maxIndex: OK
  8391. 147.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8392. 147.81 s [vector] maximumBy: OK
  8393. 147.81 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8394. 147.81 s [vector] minimumBy: OK
  8395. 147.81 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8396. 147.81 s [vector] maximumOn: OK
  8397. 147.81 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8398. 147.81 s [vector] minimumOn: OK
  8399. 147.81 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8400. 147.81 s [vector] maxIndexBy: OK
  8401. 147.81 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8402. 147.81 s [vector] minIndexBy: OK
  8403. 147.81 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8404. 147.81 s [vector] ListFirstMaxIndexWins: OK
  8405. 147.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8406. 147.81 s [vector] FalseListFirstMaxIndexWins: OK
  8407. 147.81 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  8408. 147.82 s [vector] []
  8409. 147.82 s [vector] mempty: OK
  8410. 147.82 s [vector] +++ OK, passed 100 tests.
  8411. 147.82 s [vector] mappend: OK
  8412. 147.82 s [vector] +++ OK, passed 100 tests.
  8413. 147.83 s [vector] mconcat: OK (0.01s)
  8414. 147.83 s [vector] +++ OK, passed 100 tests.
  8415. 147.83 s [vector] glength: OK
  8416. 147.83 s [vector] +++ OK, passed 100 tests.
  8417. 147.83 s [vector] sum: OK
  8418. 147.83 s [vector] +++ OK, passed 100 tests.
  8419. 147.83 s [vector] product: OK
  8420. 147.83 s [vector] +++ OK, passed 100 tests.
  8421. 147.83 s [vector] enumFromN: OK
  8422. 147.83 s [vector] +++ OK, passed 100 tests.
  8423. 147.83 s [vector] enumFromThenN: OK
  8424. 147.83 s [vector] +++ OK, passed 100 tests.
  8425. 147.83 s [vector] enumFromTo: OK
  8426. 147.83 s [vector] +++ OK, passed 100 tests.
  8427. 147.83 s [vector] enumFromThenTo: OK
  8428. 147.83 s [vector] +++ OK, passed 100 tests; 11 discarded.
  8429. 147.83 s [vector] Double
  8430. 147.83 s [vector] fromList.toList == id: OK
  8431. 147.83 s [vector] +++ OK, passed 100 tests.
  8432. 147.83 s [vector] toList.fromList == id: OK
  8433. 147.83 s [vector] +++ OK, passed 100 tests.
  8434. 147.83 s [vector] unstream.stream == id: OK
  8435. 147.83 s [vector] +++ OK, passed 100 tests.
  8436. 147.84 s [vector] stream.unstream == id: OK
  8437. 147.84 s [vector] +++ OK, passed 100 tests.
  8438. 147.84 s [vector] eq: OK
  8439. 147.84 s [vector] +++ OK, passed 100 tests.
  8440. 147.84 s [vector] length: OK
  8441. 147.84 s [vector] +++ OK, passed 100 tests.
  8442. 147.84 s [vector] null: OK
  8443. 147.84 s [vector] +++ OK, passed 100 tests.
  8444. 147.84 s [vector] index: OK
  8445. 147.84 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8446. 147.84 s [vector] safeIndex: OK
  8447. 147.84 s [vector] +++ OK, passed 100 tests.
  8448. 147.84 s [vector] head: OK
  8449. 147.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8450. 147.84 s [vector] last: OK
  8451. 147.84 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8452. 147.84 s [vector] unsafeIndex: OK
  8453. 147.84 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8454. 147.84 s [vector] unsafeHead: OK
  8455. 147.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8456. 147.84 s [vector] unsafeLast: OK
  8457. 147.84 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8458. 147.84 s [vector] slice: OK
  8459. 147.84 s [vector] +++ OK, passed 100 tests.
  8460. 147.84 s [vector] init: OK
  8461. 147.84 s [vector] +++ OK, passed 100 tests; 22 discarded.
  8462. 147.84 s [vector] tail: OK
  8463. 147.84 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8464. 147.84 s [vector] take: OK
  8465. 147.84 s [vector] +++ OK, passed 100 tests.
  8466. 147.84 s [vector] drop: OK
  8467. 147.84 s [vector] +++ OK, passed 100 tests.
  8468. 147.85 s [vector] splitAt: OK
  8469. 147.85 s [vector] +++ OK, passed 100 tests.
  8470. 147.85 s [vector] empty: OK
  8471. 147.85 s [vector] +++ OK, passed 100 tests.
  8472. 147.85 s [vector] singleton: OK
  8473. 147.85 s [vector] +++ OK, passed 100 tests.
  8474. 147.85 s [vector] replicate: OK
  8475. 147.85 s [vector] +++ OK, passed 100 tests.
  8476. 147.85 s [vector] generate: OK
  8477. 147.85 s [vector] +++ OK, passed 100 tests.
  8478. 147.86 s [vector] iterateN: OK
  8479. 147.86 s [vector] +++ OK, passed 100 tests.
  8480. 147.88 s [vector] iterateNM: OK (0.02s)
  8481. 147.88 s [vector] +++ OK, passed 100 tests.
  8482. 147.90 s [vector] generateM: OK (0.02s)
  8483. 147.90 s [vector] +++ OK, passed 100 tests.
  8484. 147.90 s [vector] replicateM: OK
  8485. 147.90 s [vector] +++ OK, passed 100 tests.
  8486. 147.90 s [vector] create: OK
  8487. 147.90 s [vector] +++ OK, passed 100 tests.
  8488. 147.90 s [vector] createT: OK
  8489. 147.90 s [vector] +++ OK, passed 100 tests.
  8490. 147.90 s [vector] unfoldr: OK
  8491. 147.90 s [vector] +++ OK, passed 100 tests.
  8492. 147.90 s [vector] unfoldrN: OK
  8493. 147.90 s [vector] +++ OK, passed 100 tests.
  8494. 147.90 s [vector] unfoldrExactN: OK
  8495. 147.90 s [vector] +++ OK, passed 100 tests.
  8496. 147.90 s [vector] unfoldrM: OK
  8497. 147.90 s [vector] +++ OK, passed 100 tests.
  8498. 147.92 s [vector] unfoldrNM: OK
  8499. 147.92 s [vector] +++ OK, passed 100 tests.
  8500. 147.94 s [vector] unfoldrExactNM: OK (0.02s)
  8501. 147.94 s [vector] +++ OK, passed 100 tests.
  8502. 147.94 s [vector] constructN: OK (0.01s)
  8503. 147.94 s [vector] +++ OK, passed 100 tests.
  8504. 147.94 s [vector] constructrN: OK (0.01s)
  8505. 147.94 s [vector] +++ OK, passed 100 tests.
  8506. 147.94 s [vector] cons: OK
  8507. 147.94 s [vector] +++ OK, passed 100 tests.
  8508. 147.94 s [vector] snoc: OK
  8509. 147.94 s [vector] +++ OK, passed 100 tests.
  8510. 147.96 s [vector] append: OK
  8511. 147.96 s [vector] +++ OK, passed 100 tests.
  8512. 147.97 s [vector] concat: OK (0.02s)
  8513. 147.97 s [vector] +++ OK, passed 100 tests.
  8514. 147.97 s [vector] force: OK
  8515. 147.98 s [vector] +++ OK, passed 100 tests.
  8516. 147.98 s [vector] upd: OK
  8517. 147.98 s [vector] +++ OK, passed 100 tests.
  8518. 147.98 s [vector] accum: OK (0.01s)
  8519. 147.98 s [vector] +++ OK, passed 100 tests.
  8520. 147.99 s [vector] reverse: OK
  8521. 147.99 s [vector] +++ OK, passed 100 tests.
  8522. 147.99 s [vector] backpermute: OK
  8523. 147.99 s [vector] +++ OK, passed 100 tests.
  8524. 147.99 s [vector] map: OK
  8525. 147.99 s [vector] +++ OK, passed 100 tests.
  8526. 147.99 s [vector] imap: OK
  8527. 147.99 s [vector] +++ OK, passed 100 tests.
  8528. 148.00 s [vector] concatMap: OK
  8529. 148.00 s [vector] +++ OK, passed 100 tests.
  8530. 148.02 s [vector] mapM: OK
  8531. 148.02 s [vector] +++ OK, passed 100 tests.
  8532. 148.04 s [vector] mapM_: OK (0.03s)
  8533. 148.04 s [vector] +++ OK, passed 100 tests.
  8534. 148.04 s [vector] forM: OK
  8535. 148.04 s [vector] +++ OK, passed 100 tests.
  8536. 148.07 s [vector] forM_: OK (0.03s)
  8537. 148.08 s [vector] +++ OK, passed 100 tests.
  8538. 148.08 s [vector] imapM: OK
  8539. 148.08 s [vector] +++ OK, passed 100 tests.
  8540. 148.11 s [vector] imapM_: OK (0.03s)
  8541. 148.12 s [vector] +++ OK, passed 100 tests.
  8542. 148.12 s [vector] zipWith: OK
  8543. 148.12 s [vector] +++ OK, passed 100 tests.
  8544. 148.13 s [vector] zipWith3: OK
  8545. 148.13 s [vector] +++ OK, passed 100 tests.
  8546. 148.14 s [vector] izipWith: OK
  8547. 148.14 s [vector] +++ OK, passed 100 tests.
  8548. 148.14 s [vector] izipWith3: OK
  8549. 148.14 s [vector] +++ OK, passed 100 tests.
  8550. 148.15 s [vector] izipWithM: OK
  8551. 148.15 s [vector] +++ OK, passed 100 tests.
  8552. 148.17 s [vector] izipWithM_: OK
  8553. 148.17 s [vector] +++ OK, passed 100 tests.
  8554. 148.17 s [vector] zipWithM: OK
  8555. 148.17 s [vector] +++ OK, passed 100 tests.
  8556. 148.20 s [vector] zipWithM_: OK (0.02s)
  8557. 148.20 s [vector] +++ OK, passed 100 tests.
  8558. 148.20 s [vector] filter: OK
  8559. 148.20 s [vector] +++ OK, passed 100 tests.
  8560. 148.21 s [vector] ifilter: OK
  8561. 148.21 s [vector] +++ OK, passed 100 tests.
  8562. 148.25 s [vector] filterM: OK (0.04s)
  8563. 148.25 s [vector] +++ OK, passed 100 tests.
  8564. 148.26 s [vector] uniq: OK
  8565. 148.26 s [vector] +++ OK, passed 100 tests.
  8566. 148.26 s [vector] mapMaybe: OK
  8567. 148.26 s [vector] +++ OK, passed 100 tests.
  8568. 148.26 s [vector] imapMaybe: OK
  8569. 148.26 s [vector] +++ OK, passed 100 tests.
  8570. 148.26 s [vector] takeWhile: OK
  8571. 148.27 s [vector] +++ OK, passed 100 tests.
  8572. 148.27 s [vector] dropWhile: OK
  8573. 148.27 s [vector] +++ OK, passed 100 tests.
  8574. 148.27 s [vector] partition: OK
  8575. 148.27 s [vector] +++ OK, passed 100 tests.
  8576. 148.27 s [vector] partitionWith: OK
  8577. 148.27 s [vector] +++ OK, passed 100 tests.
  8578. 148.27 s [vector] span: OK
  8579. 148.28 s [vector] +++ OK, passed 100 tests.
  8580. 148.28 s [vector] break: OK
  8581. 148.28 s [vector] +++ OK, passed 100 tests.
  8582. 148.28 s [vector] spanR: OK
  8583. 148.28 s [vector] +++ OK, passed 100 tests.
  8584. 148.29 s [vector] breakR: OK
  8585. 148.29 s [vector] +++ OK, passed 100 tests.
  8586. 148.29 s [vector] groupBy: OK
  8587. 148.29 s [vector] +++ OK, passed 100 tests.
  8588. 148.29 s [vector] elem: OK
  8589. 148.29 s [vector] +++ OK, passed 100 tests.
  8590. 148.29 s [vector] notElem: OK
  8591. 148.29 s [vector] +++ OK, passed 100 tests.
  8592. 148.29 s [vector] find: OK
  8593. 148.29 s [vector] +++ OK, passed 100 tests.
  8594. 148.29 s [vector] findIndex: OK
  8595. 148.30 s [vector] +++ OK, passed 100 tests.
  8596. 148.30 s [vector] findIndexR: OK
  8597. 148.30 s [vector] +++ OK, passed 100 tests.
  8598. 148.30 s [vector] findIndices: OK
  8599. 148.30 s [vector] +++ OK, passed 100 tests.
  8600. 148.30 s [vector] elemIndex: OK
  8601. 148.30 s [vector] +++ OK, passed 100 tests.
  8602. 148.30 s [vector] elemIndices: OK
  8603. 148.30 s [vector] +++ OK, passed 100 tests.
  8604. 148.31 s [vector] foldl: OK
  8605. 148.31 s [vector] +++ OK, passed 100 tests.
  8606. 148.32 s [vector] foldl1: OK
  8607. 148.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8608. 148.34 s [vector] foldl': OK (0.01s)
  8609. 148.34 s [vector] +++ OK, passed 100 tests.
  8610. 148.34 s [vector] foldl1': OK
  8611. 148.34 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8612. 148.35 s [vector] foldr: OK
  8613. 148.35 s [vector] +++ OK, passed 100 tests.
  8614. 148.36 s [vector] foldr1: OK (0.01s)
  8615. 148.36 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8616. 148.38 s [vector] foldr': OK (0.01s)
  8617. 148.38 s [vector] +++ OK, passed 100 tests.
  8618. 148.38 s [vector] foldr1': OK (0.01s)
  8619. 148.38 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8620. 148.40 s [vector] ifoldl: OK (0.01s)
  8621. 148.40 s [vector] +++ OK, passed 100 tests.
  8622. 148.42 s [vector] ifoldl': OK (0.01s)
  8623. 148.42 s [vector] +++ OK, passed 100 tests.
  8624. 148.42 s [vector] ifoldr: OK (0.01s)
  8625. 148.43 s [vector] +++ OK, passed 100 tests.
  8626. 148.43 s [vector] ifoldr': OK (0.01s)
  8627. 148.43 s [vector] +++ OK, passed 100 tests.
  8628. 148.43 s [vector] ifoldM: OK
  8629. 148.44 s [vector] +++ OK, passed 100 tests.
  8630. 148.46 s [vector] ifoldM': OK (0.01s)
  8631. 148.46 s [vector] +++ OK, passed 100 tests.
  8632. 148.48 s [vector] ifoldM_: OK (0.03s)
  8633. 148.48 s [vector] +++ OK, passed 100 tests.
  8634. 148.51 s [vector] ifoldM'_: OK (0.03s)
  8635. 148.51 s [vector] +++ OK, passed 100 tests.
  8636. 148.51 s [vector] all: OK
  8637. 148.51 s [vector] +++ OK, passed 100 tests.
  8638. 148.51 s [vector] any: OK
  8639. 148.51 s [vector] +++ OK, passed 100 tests.
  8640. 148.52 s [vector] prescanl: OK
  8641. 148.52 s [vector] +++ OK, passed 100 tests.
  8642. 148.54 s [vector] prescanl': OK (0.01s)
  8643. 148.54 s [vector] +++ OK, passed 100 tests.
  8644. 148.55 s [vector] postscanl: OK (0.01s)
  8645. 148.55 s [vector] +++ OK, passed 100 tests.
  8646. 148.55 s [vector] postscanl': OK
  8647. 148.56 s [vector] +++ OK, passed 100 tests.
  8648. 148.57 s [vector] scanl: OK (0.01s)
  8649. 148.57 s [vector] +++ OK, passed 100 tests.
  8650. 148.57 s [vector] scanl': OK
  8651. 148.58 s [vector] +++ OK, passed 100 tests.
  8652. 148.59 s [vector] scanl1: OK (0.01s)
  8653. 148.59 s [vector] +++ OK, passed 100 tests.
  8654. 148.60 s [vector] scanl1': OK (0.01s)
  8655. 148.60 s [vector] +++ OK, passed 100 tests.
  8656. 148.61 s [vector] iscanl: OK (0.01s)
  8657. 148.61 s [vector] +++ OK, passed 100 tests.
  8658. 148.62 s [vector] iscanl': OK (0.01s)
  8659. 148.62 s [vector] +++ OK, passed 100 tests.
  8660. 148.62 s [vector] prescanr: OK
  8661. 148.62 s [vector] +++ OK, passed 100 tests.
  8662. 148.63 s [vector] prescanr': OK
  8663. 148.63 s [vector] +++ OK, passed 100 tests.
  8664. 148.65 s [vector] postscanr: OK
  8665. 148.66 s [vector] +++ OK, passed 100 tests.
  8666. 148.66 s [vector] postscanr': OK
  8667. 148.66 s [vector] +++ OK, passed 100 tests.
  8668. 148.67 s [vector] scanr: OK (0.01s)
  8669. 148.67 s [vector] +++ OK, passed 100 tests.
  8670. 148.68 s [vector] scanr': OK (0.01s)
  8671. 148.68 s [vector] +++ OK, passed 100 tests.
  8672. 148.70 s [vector] scanr1: OK
  8673. 148.70 s [vector] +++ OK, passed 100 tests.
  8674. 148.70 s [vector] scanr1': OK (0.01s)
  8675. 148.70 s [vector] +++ OK, passed 100 tests.
  8676. 148.72 s [vector] iscanr: OK (0.01s)
  8677. 148.72 s [vector] +++ OK, passed 100 tests.
  8678. 148.72 s [vector] iscanr': OK (0.01s)
  8679. 148.72 s [vector] +++ OK, passed 100 tests.
  8680. 148.72 s [vector] mut_read: OK
  8681. 148.72 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8682. 148.72 s [vector] mut_write: OK
  8683. 148.72 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8684. 148.72 s [vector] mut_modify: OK
  8685. 148.72 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8686. 148.72 s [vector] mut_generate: OK
  8687. 148.72 s [vector] +++ OK, passed 100 tests.
  8688. 148.74 s [vector] mut_generateM: OK (0.02s)
  8689. 148.74 s [vector] +++ OK, passed 100 tests.
  8690. 148.78 s [vector] mut_mapM_: OK (0.03s)
  8691. 148.78 s [vector] +++ OK, passed 100 tests.
  8692. 148.80 s [vector] mut_imapM_: OK (0.02s)
  8693. 148.80 s [vector] +++ OK, passed 100 tests.
  8694. 148.82 s [vector] mut_forM_: OK (0.02s)
  8695. 148.82 s [vector] +++ OK, passed 100 tests.
  8696. 148.86 s [vector] mut_iforM_: OK (0.03s)
  8697. 148.86 s [vector] +++ OK, passed 100 tests.
  8698. 148.87 s [vector] mut_foldr: OK (0.01s)
  8699. 148.88 s [vector] +++ OK, passed 100 tests.
  8700. 148.88 s [vector] mut_foldr': OK (0.01s)
  8701. 148.89 s [vector] +++ OK, passed 100 tests.
  8702. 148.90 s [vector] mut_foldl: OK (0.01s)
  8703. 148.90 s [vector] +++ OK, passed 100 tests.
  8704. 148.90 s [vector] mut_foldl': OK
  8705. 148.91 s [vector] +++ OK, passed 100 tests.
  8706. 148.91 s [vector] mut_ifoldr: OK (0.01s)
  8707. 148.91 s [vector] +++ OK, passed 100 tests.
  8708. 148.91 s [vector] mut_ifoldr': OK
  8709. 148.91 s [vector] +++ OK, passed 100 tests.
  8710. 148.94 s [vector] mut_ifoldl: OK (0.01s)
  8711. 148.94 s [vector] +++ OK, passed 100 tests.
  8712. 148.94 s [vector] mut_ifoldl': OK (0.01s)
  8713. 148.94 s [vector] +++ OK, passed 100 tests.
  8714. 148.94 s [vector] mut_foldM: OK
  8715. 148.94 s [vector] +++ OK, passed 100 tests.
  8716. 148.96 s [vector] mut_foldM': OK
  8717. 148.96 s [vector] +++ OK, passed 100 tests.
  8718. 148.98 s [vector] mut_foldrM: OK (0.01s)
  8719. 148.98 s [vector] +++ OK, passed 100 tests.
  8720. 148.98 s [vector] mut_foldrM': OK (0.01s)
  8721. 148.99 s [vector] +++ OK, passed 100 tests.
  8722. 149.00 s [vector] mut_ifoldM: OK (0.01s)
  8723. 149.00 s [vector] +++ OK, passed 100 tests.
  8724. 149.00 s [vector] mut_ifoldM': OK
  8725. 149.00 s [vector] +++ OK, passed 100 tests.
  8726. 149.02 s [vector] mut_ifoldrM: OK (0.01s)
  8727. 149.02 s [vector] +++ OK, passed 100 tests.
  8728. 149.02 s [vector] mut_ifoldrM': OK (0.01s)
  8729. 149.02 s [vector] +++ OK, passed 100 tests.
  8730. 149.02 s [vector] compare: OK
  8731. 149.02 s [vector] +++ OK, passed 100 tests.
  8732. 149.02 s [vector] maximum: OK
  8733. 149.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8734. 149.02 s [vector] minimum: OK
  8735. 149.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8736. 149.02 s [vector] minIndex: OK
  8737. 149.02 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8738. 149.02 s [vector] maxIndex: OK
  8739. 149.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8740. 149.02 s [vector] maximumBy: OK
  8741. 149.02 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8742. 149.02 s [vector] minimumBy: OK
  8743. 149.02 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8744. 149.02 s [vector] maximumOn: OK
  8745. 149.02 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8746. 149.02 s [vector] minimumOn: OK
  8747. 149.02 s [vector] +++ OK, passed 100 tests; 10 discarded.
  8748. 149.02 s [vector] maxIndexBy: OK
  8749. 149.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  8750. 149.02 s [vector] minIndexBy: OK
  8751. 149.02 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8752. 149.02 s [vector] ListFirstMaxIndexWins: OK
  8753. 149.02 s [vector] +++ OK, passed 100 tests; 14 discarded.
  8754. 149.03 s [vector] FalseListFirstMaxIndexWins: OK
  8755. 149.03 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  8756. 149.03 s [vector] []
  8757. 149.03 s [vector] mempty: OK
  8758. 149.03 s [vector] +++ OK, passed 100 tests.
  8759. 149.03 s [vector] mappend: OK
  8760. 149.03 s [vector] +++ OK, passed 100 tests.
  8761. 149.05 s [vector] mconcat: OK
  8762. 149.05 s [vector] +++ OK, passed 100 tests.
  8763. 149.05 s [vector] glength: OK
  8764. 149.05 s [vector] +++ OK, passed 100 tests.
  8765. 149.05 s [vector] sum: OK
  8766. 149.05 s [vector] +++ OK, passed 100 tests.
  8767. 149.05 s [vector] product: OK
  8768. 149.05 s [vector] +++ OK, passed 100 tests.
  8769. 149.05 s [vector] enumFromN: OK
  8770. 149.05 s [vector] +++ OK, passed 100 tests.
  8771. 149.05 s [vector] enumFromThenN: OK
  8772. 149.05 s [vector] +++ OK, passed 100 tests.
  8773. 149.05 s [vector] enumFromTo: OK
  8774. 149.05 s [vector] +++ OK, passed 100 tests.
  8775. 149.05 s [vector] enumFromThenTo: OK
  8776. 149.05 s [vector] +++ OK, passed 100 tests; 1 discarded.
  8777. 149.05 s [vector] unstream
  8778. 149.05 s [vector] unstream == vunstream (exact): OK
  8779. 149.05 s [vector] +++ OK, passed 100 tests.
  8780. 149.05 s [vector] unstream == vunstream (unknown): OK
  8781. 149.05 s [vector] +++ OK, passed 100 tests.
  8782. 149.05 s [vector] unstreamR ~= vunstream (exact): OK
  8783. 149.05 s [vector] +++ OK, passed 100 tests.
  8784. 149.05 s [vector] unstreamR ~= vunstream (unknown): OK
  8785. 149.05 s [vector] +++ OK, passed 100 tests.
  8786. 149.05 s [vector] Tests.Vector.Storable
  8787. 149.05 s [vector] Data.Vector.Storable.Vector (Int)
  8788. 149.05 s [vector] fromList.toList == id: OK
  8789. 149.05 s [vector] +++ OK, passed 100 tests.
  8790. 149.05 s [vector] toList.fromList == id: OK
  8791. 149.06 s [vector] +++ OK, passed 100 tests.
  8792. 149.06 s [vector] unstream.stream == id: OK
  8793. 149.06 s [vector] +++ OK, passed 100 tests.
  8794. 149.06 s [vector] stream.unstream == id: OK
  8795. 149.06 s [vector] +++ OK, passed 100 tests.
  8796. 149.06 s [vector] eq: OK
  8797. 149.06 s [vector] +++ OK, passed 100 tests.
  8798. 149.06 s [vector] length: OK
  8799. 149.06 s [vector] +++ OK, passed 100 tests.
  8800. 149.06 s [vector] null: OK
  8801. 149.06 s [vector] +++ OK, passed 100 tests.
  8802. 149.06 s [vector] index: OK
  8803. 149.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8804. 149.06 s [vector] safeIndex: OK
  8805. 149.06 s [vector] +++ OK, passed 100 tests.
  8806. 149.06 s [vector] head: OK
  8807. 149.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8808. 149.06 s [vector] last: OK
  8809. 149.06 s [vector] +++ OK, passed 100 tests; 21 discarded.
  8810. 149.06 s [vector] unsafeIndex: OK
  8811. 149.06 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8812. 149.06 s [vector] unsafeHead: OK
  8813. 149.06 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8814. 149.06 s [vector] unsafeLast: OK
  8815. 149.06 s [vector] +++ OK, passed 100 tests; 12 discarded.
  8816. 149.06 s [vector] slice: OK
  8817. 149.06 s [vector] +++ OK, passed 100 tests.
  8818. 149.06 s [vector] init: OK
  8819. 149.06 s [vector] +++ OK, passed 100 tests; 13 discarded.
  8820. 149.06 s [vector] tail: OK
  8821. 149.06 s [vector] +++ OK, passed 100 tests; 20 discarded.
  8822. 149.06 s [vector] take: OK
  8823. 149.06 s [vector] +++ OK, passed 100 tests.
  8824. 149.06 s [vector] drop: OK
  8825. 149.06 s [vector] +++ OK, passed 100 tests.
  8826. 149.06 s [vector] splitAt: OK
  8827. 149.06 s [vector] +++ OK, passed 100 tests.
  8828. 149.06 s [vector] empty: OK
  8829. 149.06 s [vector] +++ OK, passed 100 tests.
  8830. 149.06 s [vector] singleton: OK
  8831. 149.06 s [vector] +++ OK, passed 100 tests.
  8832. 149.06 s [vector] replicate: OK
  8833. 149.06 s [vector] +++ OK, passed 100 tests.
  8834. 149.06 s [vector] generate: OK
  8835. 149.06 s [vector] +++ OK, passed 100 tests.
  8836. 149.08 s [vector] iterateN: OK
  8837. 149.08 s [vector] +++ OK, passed 100 tests.
  8838. 149.10 s [vector] iterateNM: OK (0.02s)
  8839. 149.10 s [vector] +++ OK, passed 100 tests.
  8840. 149.11 s [vector] generateM: OK (0.02s)
  8841. 149.11 s [vector] +++ OK, passed 100 tests.
  8842. 149.11 s [vector] replicateM: OK
  8843. 149.11 s [vector] +++ OK, passed 100 tests.
  8844. 149.11 s [vector] create: OK
  8845. 149.11 s [vector] +++ OK, passed 100 tests.
  8846. 149.11 s [vector] createT: OK
  8847. 149.11 s [vector] +++ OK, passed 100 tests.
  8848. 149.11 s [vector] unfoldr: OK
  8849. 149.11 s [vector] +++ OK, passed 100 tests.
  8850. 149.11 s [vector] unfoldrN: OK
  8851. 149.11 s [vector] +++ OK, passed 100 tests.
  8852. 149.11 s [vector] unfoldrExactN: OK
  8853. 149.12 s [vector] +++ OK, passed 100 tests.
  8854. 149.12 s [vector] unfoldrM: OK
  8855. 149.12 s [vector] +++ OK, passed 100 tests.
  8856. 149.14 s [vector] unfoldrNM: OK
  8857. 149.14 s [vector] +++ OK, passed 100 tests.
  8858. 149.14 s [vector] unfoldrExactNM: OK (0.02s)
  8859. 149.14 s [vector] +++ OK, passed 100 tests.
  8860. 149.14 s [vector] constructN: OK
  8861. 149.14 s [vector] +++ OK, passed 100 tests.
  8862. 149.14 s [vector] constructrN: OK
  8863. 149.14 s [vector] +++ OK, passed 100 tests.
  8864. 149.14 s [vector] cons: OK
  8865. 149.15 s [vector] +++ OK, passed 100 tests.
  8866. 149.15 s [vector] snoc: OK
  8867. 149.15 s [vector] +++ OK, passed 100 tests.
  8868. 149.16 s [vector] append: OK
  8869. 149.16 s [vector] +++ OK, passed 100 tests.
  8870. 149.16 s [vector] concat: OK (0.01s)
  8871. 149.16 s [vector] +++ OK, passed 100 tests.
  8872. 149.16 s [vector] force: OK
  8873. 149.16 s [vector] +++ OK, passed 100 tests.
  8874. 149.16 s [vector] upd: OK
  8875. 149.16 s [vector] +++ OK, passed 100 tests.
  8876. 149.16 s [vector] accum: OK
  8877. 149.16 s [vector] +++ OK, passed 100 tests.
  8878. 149.17 s [vector] reverse: OK
  8879. 149.17 s [vector] +++ OK, passed 100 tests.
  8880. 149.17 s [vector] backpermute: OK
  8881. 149.17 s [vector] +++ OK, passed 100 tests.
  8882. 149.17 s [vector] map: OK
  8883. 149.17 s [vector] +++ OK, passed 100 tests.
  8884. 149.17 s [vector] imap: OK
  8885. 149.17 s [vector] +++ OK, passed 100 tests.
  8886. 149.18 s [vector] concatMap: OK
  8887. 149.18 s [vector] +++ OK, passed 100 tests.
  8888. 149.18 s [vector] mapM: OK
  8889. 149.18 s [vector] +++ OK, passed 100 tests.
  8890. 149.19 s [vector] mapM_: OK (0.01s)
  8891. 149.20 s [vector] +++ OK, passed 100 tests.
  8892. 149.20 s [vector] forM: OK
  8893. 149.20 s [vector] +++ OK, passed 100 tests.
  8894. 149.21 s [vector] forM_: OK (0.02s)
  8895. 149.22 s [vector] +++ OK, passed 100 tests.
  8896. 149.22 s [vector] imapM: OK
  8897. 149.22 s [vector] +++ OK, passed 100 tests.
  8898. 149.22 s [vector] imapM_: OK (0.02s)
  8899. 149.22 s [vector] +++ OK, passed 100 tests.
  8900. 149.22 s [vector] zipWith: OK
  8901. 149.22 s [vector] +++ OK, passed 100 tests.
  8902. 149.23 s [vector] zipWith3: OK
  8903. 149.23 s [vector] +++ OK, passed 100 tests.
  8904. 149.23 s [vector] izipWith: OK
  8905. 149.23 s [vector] +++ OK, passed 100 tests.
  8906. 149.23 s [vector] izipWith3: OK
  8907. 149.23 s [vector] +++ OK, passed 100 tests.
  8908. 149.24 s [vector] izipWithM: OK
  8909. 149.24 s [vector] +++ OK, passed 100 tests.
  8910. 149.25 s [vector] izipWithM_: OK (0.01s)
  8911. 149.25 s [vector] +++ OK, passed 100 tests.
  8912. 149.25 s [vector] zipWithM: OK
  8913. 149.26 s [vector] +++ OK, passed 100 tests.
  8914. 149.26 s [vector] zipWithM_: OK
  8915. 149.26 s [vector] +++ OK, passed 100 tests.
  8916. 149.26 s [vector] filter: OK
  8917. 149.26 s [vector] +++ OK, passed 100 tests.
  8918. 149.26 s [vector] ifilter: OK
  8919. 149.26 s [vector] +++ OK, passed 100 tests.
  8920. 149.28 s [vector] filterM: OK (0.03s)
  8921. 149.29 s [vector] +++ OK, passed 100 tests.
  8922. 149.29 s [vector] uniq: OK
  8923. 149.29 s [vector] +++ OK, passed 100 tests.
  8924. 149.29 s [vector] mapMaybe: OK
  8925. 149.29 s [vector] +++ OK, passed 100 tests.
  8926. 149.29 s [vector] imapMaybe: OK
  8927. 149.29 s [vector] +++ OK, passed 100 tests.
  8928. 149.29 s [vector] takeWhile: OK
  8929. 149.29 s [vector] +++ OK, passed 100 tests.
  8930. 149.29 s [vector] dropWhile: OK
  8931. 149.29 s [vector] +++ OK, passed 100 tests.
  8932. 149.29 s [vector] partition: OK
  8933. 149.29 s [vector] +++ OK, passed 100 tests.
  8934. 149.29 s [vector] partitionWith: OK
  8935. 149.29 s [vector] +++ OK, passed 100 tests.
  8936. 149.29 s [vector] span: OK
  8937. 149.29 s [vector] +++ OK, passed 100 tests.
  8938. 149.29 s [vector] break: OK
  8939. 149.29 s [vector] +++ OK, passed 100 tests.
  8940. 149.29 s [vector] spanR: OK
  8941. 149.29 s [vector] +++ OK, passed 100 tests.
  8942. 149.30 s [vector] breakR: OK
  8943. 149.30 s [vector] +++ OK, passed 100 tests.
  8944. 149.30 s [vector] groupBy: OK
  8945. 149.30 s [vector] +++ OK, passed 100 tests.
  8946. 149.30 s [vector] elem: OK
  8947. 149.30 s [vector] +++ OK, passed 100 tests.
  8948. 149.30 s [vector] notElem: OK
  8949. 149.30 s [vector] +++ OK, passed 100 tests.
  8950. 149.30 s [vector] find: OK
  8951. 149.30 s [vector] +++ OK, passed 100 tests.
  8952. 149.30 s [vector] findIndex: OK
  8953. 149.30 s [vector] +++ OK, passed 100 tests.
  8954. 149.30 s [vector] findIndexR: OK
  8955. 149.30 s [vector] +++ OK, passed 100 tests.
  8956. 149.30 s [vector] findIndices: OK
  8957. 149.30 s [vector] +++ OK, passed 100 tests.
  8958. 149.30 s [vector] elemIndex: OK
  8959. 149.30 s [vector] +++ OK, passed 100 tests.
  8960. 149.30 s [vector] elemIndices: OK
  8961. 149.30 s [vector] +++ OK, passed 100 tests.
  8962. 149.30 s [vector] foldl: OK
  8963. 149.31 s [vector] +++ OK, passed 100 tests.
  8964. 149.31 s [vector] foldl1: OK
  8965. 149.31 s [vector] +++ OK, passed 100 tests; 16 discarded.
  8966. 149.31 s [vector] foldl': OK
  8967. 149.31 s [vector] +++ OK, passed 100 tests.
  8968. 149.31 s [vector] foldl1': OK
  8969. 149.31 s [vector] +++ OK, passed 100 tests; 17 discarded.
  8970. 149.31 s [vector] foldr: OK
  8971. 149.31 s [vector] +++ OK, passed 100 tests.
  8972. 149.31 s [vector] foldr1: OK
  8973. 149.31 s [vector] +++ OK, passed 100 tests; 19 discarded.
  8974. 149.32 s [vector] foldr': OK
  8975. 149.32 s [vector] +++ OK, passed 100 tests.
  8976. 149.32 s [vector] foldr1': OK
  8977. 149.32 s [vector] +++ OK, passed 100 tests; 18 discarded.
  8978. 149.32 s [vector] ifoldl: OK
  8979. 149.32 s [vector] +++ OK, passed 100 tests.
  8980. 149.32 s [vector] ifoldl': OK
  8981. 149.32 s [vector] +++ OK, passed 100 tests.
  8982. 149.33 s [vector] ifoldr: OK
  8983. 149.33 s [vector] +++ OK, passed 100 tests.
  8984. 149.33 s [vector] ifoldr': OK
  8985. 149.33 s [vector] +++ OK, passed 100 tests.
  8986. 149.33 s [vector] ifoldM: OK
  8987. 149.33 s [vector] +++ OK, passed 100 tests.
  8988. 149.34 s [vector] ifoldM': OK
  8989. 149.34 s [vector] +++ OK, passed 100 tests.
  8990. 149.36 s [vector] ifoldM_: OK (0.01s)
  8991. 149.36 s [vector] +++ OK, passed 100 tests.
  8992. 149.36 s [vector] ifoldM'_: OK (0.01s)
  8993. 149.36 s [vector] +++ OK, passed 100 tests.
  8994. 149.36 s [vector] all: OK
  8995. 149.36 s [vector] +++ OK, passed 100 tests.
  8996. 149.36 s [vector] any: OK
  8997. 149.36 s [vector] +++ OK, passed 100 tests.
  8998. 149.36 s [vector] prescanl: OK
  8999. 149.36 s [vector] +++ OK, passed 100 tests.
  9000. 149.36 s [vector] prescanl': OK
  9001. 149.37 s [vector] +++ OK, passed 100 tests.
  9002. 149.37 s [vector] postscanl: OK
  9003. 149.37 s [vector] +++ OK, passed 100 tests.
  9004. 149.37 s [vector] postscanl': OK
  9005. 149.37 s [vector] +++ OK, passed 100 tests.
  9006. 149.37 s [vector] scanl: OK
  9007. 149.37 s [vector] +++ OK, passed 100 tests.
  9008. 149.37 s [vector] scanl': OK
  9009. 149.37 s [vector] +++ OK, passed 100 tests.
  9010. 149.38 s [vector] scanl1: OK
  9011. 149.38 s [vector] +++ OK, passed 100 tests.
  9012. 149.38 s [vector] scanl1': OK
  9013. 149.38 s [vector] +++ OK, passed 100 tests.
  9014. 149.38 s [vector] iscanl: OK
  9015. 149.38 s [vector] +++ OK, passed 100 tests.
  9016. 149.38 s [vector] iscanl': OK
  9017. 149.38 s [vector] +++ OK, passed 100 tests.
  9018. 149.38 s [vector] prescanr: OK
  9019. 149.38 s [vector] +++ OK, passed 100 tests.
  9020. 149.39 s [vector] prescanr': OK
  9021. 149.39 s [vector] +++ OK, passed 100 tests.
  9022. 149.39 s [vector] postscanr: OK
  9023. 149.39 s [vector] +++ OK, passed 100 tests.
  9024. 149.39 s [vector] postscanr': OK
  9025. 149.39 s [vector] +++ OK, passed 100 tests.
  9026. 149.39 s [vector] scanr: OK
  9027. 149.39 s [vector] +++ OK, passed 100 tests.
  9028. 149.39 s [vector] scanr': OK
  9029. 149.40 s [vector] +++ OK, passed 100 tests.
  9030. 149.40 s [vector] scanr1: OK
  9031. 149.40 s [vector] +++ OK, passed 100 tests.
  9032. 149.40 s [vector] scanr1': OK
  9033. 149.40 s [vector] +++ OK, passed 100 tests.
  9034. 149.40 s [vector] iscanr: OK
  9035. 149.40 s [vector] +++ OK, passed 100 tests.
  9036. 149.40 s [vector] iscanr': OK
  9037. 149.40 s [vector] +++ OK, passed 100 tests.
  9038. 149.40 s [vector] mut_read: OK
  9039. 149.40 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9040. 149.41 s [vector] mut_write: OK
  9041. 149.41 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9042. 149.41 s [vector] mut_modify: OK
  9043. 149.41 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9044. 149.41 s [vector] mut_generate: OK
  9045. 149.42 s [vector] +++ OK, passed 100 tests.
  9046. 149.42 s [vector] mut_generateM: OK
  9047. 149.42 s [vector] +++ OK, passed 100 tests.
  9048. 149.44 s [vector] mut_mapM_: OK (0.01s)
  9049. 149.44 s [vector] +++ OK, passed 100 tests.
  9050. 149.44 s [vector] mut_imapM_: OK (0.01s)
  9051. 149.44 s [vector] +++ OK, passed 100 tests.
  9052. 149.46 s [vector] mut_forM_: OK (0.01s)
  9053. 149.46 s [vector] +++ OK, passed 100 tests.
  9054. 149.47 s [vector] mut_iforM_: OK (0.01s)
  9055. 149.47 s [vector] +++ OK, passed 100 tests.
  9056. 149.47 s [vector] mut_foldr: OK
  9057. 149.47 s [vector] +++ OK, passed 100 tests.
  9058. 149.47 s [vector] mut_foldr': OK
  9059. 149.47 s [vector] +++ OK, passed 100 tests.
  9060. 149.47 s [vector] mut_foldl: OK
  9061. 149.47 s [vector] +++ OK, passed 100 tests.
  9062. 149.48 s [vector] mut_foldl': OK
  9063. 149.48 s [vector] +++ OK, passed 100 tests.
  9064. 149.48 s [vector] mut_ifoldr: OK
  9065. 149.48 s [vector] +++ OK, passed 100 tests.
  9066. 149.48 s [vector] mut_ifoldr': OK
  9067. 149.48 s [vector] +++ OK, passed 100 tests.
  9068. 149.48 s [vector] mut_ifoldl: OK
  9069. 149.48 s [vector] +++ OK, passed 100 tests.
  9070. 149.48 s [vector] mut_ifoldl': OK
  9071. 149.48 s [vector] +++ OK, passed 100 tests.
  9072. 149.49 s [vector] mut_foldM: OK
  9073. 149.49 s [vector] +++ OK, passed 100 tests.
  9074. 149.49 s [vector] mut_foldM': OK
  9075. 149.49 s [vector] +++ OK, passed 100 tests.
  9076. 149.49 s [vector] mut_foldrM: OK
  9077. 149.49 s [vector] +++ OK, passed 100 tests.
  9078. 149.49 s [vector] mut_foldrM': OK
  9079. 149.49 s [vector] +++ OK, passed 100 tests.
  9080. 149.49 s [vector] mut_ifoldM: OK
  9081. 149.50 s [vector] +++ OK, passed 100 tests.
  9082. 149.50 s [vector] mut_ifoldM': OK
  9083. 149.50 s [vector] +++ OK, passed 100 tests.
  9084. 149.50 s [vector] mut_ifoldrM: OK
  9085. 149.50 s [vector] +++ OK, passed 100 tests.
  9086. 149.50 s [vector] mut_ifoldrM': OK
  9087. 149.50 s [vector] +++ OK, passed 100 tests.
  9088. 149.50 s [vector] compare: OK
  9089. 149.50 s [vector] +++ OK, passed 100 tests.
  9090. 149.50 s [vector] maximum: OK
  9091. 149.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9092. 149.50 s [vector] minimum: OK
  9093. 149.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9094. 149.50 s [vector] minIndex: OK
  9095. 149.50 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9096. 149.50 s [vector] maxIndex: OK
  9097. 149.50 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9098. 149.50 s [vector] maximumBy: OK
  9099. 149.50 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9100. 149.50 s [vector] minimumBy: OK
  9101. 149.50 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9102. 149.51 s [vector] maximumOn: OK
  9103. 149.51 s [vector] +++ OK, passed 100 tests; 21 discarded.
  9104. 149.51 s [vector] minimumOn: OK
  9105. 149.51 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9106. 149.51 s [vector] maxIndexBy: OK
  9107. 149.51 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9108. 149.51 s [vector] minIndexBy: OK
  9109. 149.51 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9110. 149.51 s [vector] ListFirstMaxIndexWins: OK
  9111. 149.51 s [vector] +++ OK, passed 100 tests; 11 discarded.
  9112. 149.51 s [vector] FalseListFirstMaxIndexWins: OK
  9113. 149.51 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  9114. 149.51 s [vector] []
  9115. 149.51 s [vector] mempty: OK
  9116. 149.51 s [vector] +++ OK, passed 100 tests.
  9117. 149.52 s [vector] mappend: OK
  9118. 149.52 s [vector] +++ OK, passed 100 tests.
  9119. 149.52 s [vector] mconcat: OK
  9120. 149.52 s [vector] +++ OK, passed 100 tests.
  9121. 149.52 s [vector] glength: OK
  9122. 149.52 s [vector] +++ OK, passed 100 tests.
  9123. 149.52 s [vector] sum: OK
  9124. 149.52 s [vector] +++ OK, passed 100 tests.
  9125. 149.52 s [vector] product: OK
  9126. 149.52 s [vector] +++ OK, passed 100 tests.
  9127. 149.52 s [vector] enumFromN: OK
  9128. 149.52 s [vector] +++ OK, passed 100 tests.
  9129. 149.52 s [vector] enumFromThenN: OK
  9130. 149.52 s [vector] +++ OK, passed 100 tests.
  9131. 149.52 s [vector] enumFromTo: OK
  9132. 149.52 s [vector] +++ OK, passed 100 tests.
  9133. 149.52 s [vector] enumFromThenTo: OK
  9134. 149.52 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9135. 149.52 s [vector] Data.Vector.Storable.Vector (Double)
  9136. 149.52 s [vector] fromList.toList == id: OK
  9137. 149.52 s [vector] +++ OK, passed 100 tests.
  9138. 149.52 s [vector] toList.fromList == id: OK
  9139. 149.52 s [vector] +++ OK, passed 100 tests.
  9140. 149.52 s [vector] unstream.stream == id: OK
  9141. 149.52 s [vector] +++ OK, passed 100 tests.
  9142. 149.52 s [vector] stream.unstream == id: OK
  9143. 149.52 s [vector] +++ OK, passed 100 tests.
  9144. 149.52 s [vector] eq: OK
  9145. 149.52 s [vector] +++ OK, passed 100 tests.
  9146. 149.53 s [vector] length: OK
  9147. 149.53 s [vector] +++ OK, passed 100 tests.
  9148. 149.53 s [vector] null: OK
  9149. 149.53 s [vector] +++ OK, passed 100 tests.
  9150. 149.53 s [vector] index: OK
  9151. 149.53 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9152. 149.53 s [vector] safeIndex: OK
  9153. 149.53 s [vector] +++ OK, passed 100 tests.
  9154. 149.53 s [vector] head: OK
  9155. 149.53 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9156. 149.53 s [vector] last: OK
  9157. 149.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9158. 149.53 s [vector] unsafeIndex: OK
  9159. 149.53 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9160. 149.53 s [vector] unsafeHead: OK
  9161. 149.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9162. 149.53 s [vector] unsafeLast: OK
  9163. 149.53 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9164. 149.53 s [vector] slice: OK
  9165. 149.53 s [vector] +++ OK, passed 100 tests.
  9166. 149.53 s [vector] init: OK
  9167. 149.53 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9168. 149.53 s [vector] tail: OK
  9169. 149.53 s [vector] +++ OK, passed 100 tests; 24 discarded.
  9170. 149.53 s [vector] take: OK
  9171. 149.53 s [vector] +++ OK, passed 100 tests.
  9172. 149.53 s [vector] drop: OK
  9173. 149.53 s [vector] +++ OK, passed 100 tests.
  9174. 149.53 s [vector] splitAt: OK
  9175. 149.53 s [vector] +++ OK, passed 100 tests.
  9176. 149.53 s [vector] empty: OK
  9177. 149.53 s [vector] +++ OK, passed 100 tests.
  9178. 149.53 s [vector] singleton: OK
  9179. 149.53 s [vector] +++ OK, passed 100 tests.
  9180. 149.53 s [vector] replicate: OK
  9181. 149.53 s [vector] +++ OK, passed 100 tests.
  9182. 149.54 s [vector] generate: OK
  9183. 149.54 s [vector] +++ OK, passed 100 tests.
  9184. 149.54 s [vector] iterateN: OK
  9185. 149.54 s [vector] +++ OK, passed 100 tests.
  9186. 149.56 s [vector] iterateNM: OK (0.01s)
  9187. 149.56 s [vector] +++ OK, passed 100 tests.
  9188. 149.58 s [vector] generateM: OK (0.02s)
  9189. 149.58 s [vector] +++ OK, passed 100 tests.
  9190. 149.58 s [vector] replicateM: OK
  9191. 149.58 s [vector] +++ OK, passed 100 tests.
  9192. 149.58 s [vector] create: OK
  9193. 149.58 s [vector] +++ OK, passed 100 tests.
  9194. 149.58 s [vector] createT: OK
  9195. 149.58 s [vector] +++ OK, passed 100 tests.
  9196. 149.58 s [vector] unfoldr: OK
  9197. 149.58 s [vector] +++ OK, passed 100 tests.
  9198. 149.58 s [vector] unfoldrN: OK
  9199. 149.58 s [vector] +++ OK, passed 100 tests.
  9200. 149.59 s [vector] unfoldrExactN: OK
  9201. 149.59 s [vector] +++ OK, passed 100 tests.
  9202. 149.59 s [vector] unfoldrM: OK
  9203. 149.59 s [vector] +++ OK, passed 100 tests.
  9204. 149.60 s [vector] unfoldrNM: OK
  9205. 149.60 s [vector] +++ OK, passed 100 tests.
  9206. 149.62 s [vector] unfoldrExactNM: OK (0.02s)
  9207. 149.62 s [vector] +++ OK, passed 100 tests.
  9208. 149.62 s [vector] constructN: OK (0.01s)
  9209. 149.62 s [vector] +++ OK, passed 100 tests.
  9210. 149.63 s [vector] constructrN: OK (0.01s)
  9211. 149.63 s [vector] +++ OK, passed 100 tests.
  9212. 149.63 s [vector] cons: OK
  9213. 149.63 s [vector] +++ OK, passed 100 tests.
  9214. 149.63 s [vector] snoc: OK
  9215. 149.63 s [vector] +++ OK, passed 100 tests.
  9216. 149.63 s [vector] append: OK
  9217. 149.64 s [vector] +++ OK, passed 100 tests.
  9218. 149.65 s [vector] concat: OK (0.02s)
  9219. 149.65 s [vector] +++ OK, passed 100 tests.
  9220. 149.65 s [vector] force: OK
  9221. 149.65 s [vector] +++ OK, passed 100 tests.
  9222. 149.66 s [vector] upd: OK
  9223. 149.66 s [vector] +++ OK, passed 100 tests.
  9224. 149.66 s [vector] accum: OK (0.01s)
  9225. 149.66 s [vector] +++ OK, passed 100 tests.
  9226. 149.66 s [vector] reverse: OK
  9227. 149.66 s [vector] +++ OK, passed 100 tests.
  9228. 149.67 s [vector] backpermute: OK
  9229. 149.67 s [vector] +++ OK, passed 100 tests.
  9230. 149.67 s [vector] map: OK
  9231. 149.67 s [vector] +++ OK, passed 100 tests.
  9232. 149.68 s [vector] imap: OK
  9233. 149.68 s [vector] +++ OK, passed 100 tests.
  9234. 149.69 s [vector] concatMap: OK
  9235. 149.69 s [vector] +++ OK, passed 100 tests.
  9236. 149.70 s [vector] mapM: OK
  9237. 149.70 s [vector] +++ OK, passed 100 tests.
  9238. 149.72 s [vector] mapM_: OK (0.03s)
  9239. 149.72 s [vector] +++ OK, passed 100 tests.
  9240. 149.72 s [vector] forM: OK
  9241. 149.72 s [vector] +++ OK, passed 100 tests.
  9242. 149.76 s [vector] forM_: OK (0.03s)
  9243. 149.76 s [vector] +++ OK, passed 100 tests.
  9244. 149.78 s [vector] imapM: OK
  9245. 149.78 s [vector] +++ OK, passed 100 tests.
  9246. 149.80 s [vector] imapM_: OK (0.03s)
  9247. 149.80 s [vector] +++ OK, passed 100 tests.
  9248. 149.80 s [vector] zipWith: OK
  9249. 149.80 s [vector] +++ OK, passed 100 tests.
  9250. 149.82 s [vector] zipWith3: OK
  9251. 149.82 s [vector] +++ OK, passed 100 tests.
  9252. 149.82 s [vector] izipWith: OK
  9253. 149.82 s [vector] +++ OK, passed 100 tests.
  9254. 149.82 s [vector] izipWith3: OK
  9255. 149.82 s [vector] +++ OK, passed 100 tests.
  9256. 149.84 s [vector] izipWithM: OK
  9257. 149.84 s [vector] +++ OK, passed 100 tests.
  9258. 149.86 s [vector] izipWithM_: OK (0.02s)
  9259. 149.86 s [vector] +++ OK, passed 100 tests.
  9260. 149.87 s [vector] zipWithM: OK
  9261. 149.87 s [vector] +++ OK, passed 100 tests.
  9262. 149.90 s [vector] zipWithM_: OK (0.03s)
  9263. 149.90 s [vector] +++ OK, passed 100 tests.
  9264. 149.90 s [vector] filter: OK
  9265. 149.90 s [vector] +++ OK, passed 100 tests.
  9266. 149.90 s [vector] ifilter: OK
  9267. 149.90 s [vector] +++ OK, passed 100 tests.
  9268. 149.95 s [vector] filterM: OK (0.05s)
  9269. 149.95 s [vector] +++ OK, passed 100 tests.
  9270. 149.95 s [vector] uniq: OK
  9271. 149.95 s [vector] +++ OK, passed 100 tests.
  9272. 149.95 s [vector] mapMaybe: OK
  9273. 149.96 s [vector] +++ OK, passed 100 tests.
  9274. 149.96 s [vector] imapMaybe: OK
  9275. 149.96 s [vector] +++ OK, passed 100 tests.
  9276. 149.96 s [vector] takeWhile: OK
  9277. 149.96 s [vector] +++ OK, passed 100 tests.
  9278. 149.96 s [vector] dropWhile: OK
  9279. 149.97 s [vector] +++ OK, passed 100 tests.
  9280. 149.97 s [vector] partition: OK
  9281. 149.97 s [vector] +++ OK, passed 100 tests.
  9282. 149.97 s [vector] partitionWith: OK
  9283. 149.98 s [vector] +++ OK, passed 100 tests.
  9284. 149.98 s [vector] span: OK
  9285. 149.98 s [vector] +++ OK, passed 100 tests.
  9286. 149.98 s [vector] break: OK
  9287. 149.98 s [vector] +++ OK, passed 100 tests.
  9288. 149.98 s [vector] spanR: OK
  9289. 149.98 s [vector] +++ OK, passed 100 tests.
  9290. 149.98 s [vector] breakR: OK
  9291. 149.98 s [vector] +++ OK, passed 100 tests.
  9292. 149.99 s [vector] groupBy: OK
  9293. 149.99 s [vector] +++ OK, passed 100 tests.
  9294. 149.99 s [vector] elem: OK
  9295. 149.99 s [vector] +++ OK, passed 100 tests.
  9296. 149.99 s [vector] notElem: OK
  9297. 149.99 s [vector] +++ OK, passed 100 tests.
  9298. 149.99 s [vector] find: OK
  9299. 149.99 s [vector] +++ OK, passed 100 tests.
  9300. 149.99 s [vector] findIndex: OK
  9301. 149.99 s [vector] +++ OK, passed 100 tests.
  9302. 150.00 s [vector] findIndexR: OK
  9303. 150.00 s [vector] +++ OK, passed 100 tests.
  9304. 150.00 s [vector] findIndices: OK
  9305. 150.00 s [vector] +++ OK, passed 100 tests.
  9306. 150.00 s [vector] elemIndex: OK
  9307. 150.00 s [vector] +++ OK, passed 100 tests.
  9308. 150.00 s [vector] elemIndices: OK
  9309. 150.00 s [vector] +++ OK, passed 100 tests.
  9310. 150.02 s [vector] foldl: OK
  9311. 150.02 s [vector] +++ OK, passed 100 tests.
  9312. 150.02 s [vector] foldl1: OK
  9313. 150.02 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9314. 150.03 s [vector] foldl': OK
  9315. 150.03 s [vector] +++ OK, passed 100 tests.
  9316. 150.04 s [vector] foldl1': OK (0.01s)
  9317. 150.04 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9318. 150.05 s [vector] foldr: OK
  9319. 150.05 s [vector] +++ OK, passed 100 tests.
  9320. 150.05 s [vector] foldr1: OK
  9321. 150.05 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9322. 150.07 s [vector] foldr': OK (0.01s)
  9323. 150.07 s [vector] +++ OK, passed 100 tests.
  9324. 150.07 s [vector] foldr1': OK
  9325. 150.08 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9326. 150.09 s [vector] ifoldl: OK (0.01s)
  9327. 150.09 s [vector] +++ OK, passed 100 tests.
  9328. 150.09 s [vector] ifoldl': OK
  9329. 150.10 s [vector] +++ OK, passed 100 tests.
  9330. 150.11 s [vector] ifoldr: OK (0.01s)
  9331. 150.12 s [vector] +++ OK, passed 100 tests.
  9332. 150.12 s [vector] ifoldr': OK (0.01s)
  9333. 150.12 s [vector] +++ OK, passed 100 tests.
  9334. 150.14 s [vector] ifoldM: OK
  9335. 150.14 s [vector] +++ OK, passed 100 tests.
  9336. 150.14 s [vector] ifoldM': OK (0.01s)
  9337. 150.14 s [vector] +++ OK, passed 100 tests.
  9338. 150.18 s [vector] ifoldM_: OK (0.03s)
  9339. 150.18 s [vector] +++ OK, passed 100 tests.
  9340. 150.20 s [vector] ifoldM'_: OK (0.03s)
  9341. 150.20 s [vector] +++ OK, passed 100 tests.
  9342. 150.20 s [vector] all: OK
  9343. 150.20 s [vector] +++ OK, passed 100 tests.
  9344. 150.20 s [vector] any: OK
  9345. 150.20 s [vector] +++ OK, passed 100 tests.
  9346. 150.22 s [vector] prescanl: OK
  9347. 150.22 s [vector] +++ OK, passed 100 tests.
  9348. 150.22 s [vector] prescanl': OK (0.01s)
  9349. 150.22 s [vector] +++ OK, passed 100 tests.
  9350. 150.24 s [vector] postscanl: OK (0.01s)
  9351. 150.24 s [vector] +++ OK, passed 100 tests.
  9352. 150.24 s [vector] postscanl': OK (0.01s)
  9353. 150.24 s [vector] +++ OK, passed 100 tests.
  9354. 150.26 s [vector] scanl: OK (0.01s)
  9355. 150.26 s [vector] +++ OK, passed 100 tests.
  9356. 150.26 s [vector] scanl': OK
  9357. 150.26 s [vector] +++ OK, passed 100 tests.
  9358. 150.27 s [vector] scanl1: OK
  9359. 150.27 s [vector] +++ OK, passed 100 tests.
  9360. 150.28 s [vector] scanl1': OK (0.01s)
  9361. 150.28 s [vector] +++ OK, passed 100 tests.
  9362. 150.30 s [vector] iscanl: OK (0.01s)
  9363. 150.30 s [vector] +++ OK, passed 100 tests.
  9364. 150.31 s [vector] iscanl': OK (0.01s)
  9365. 150.31 s [vector] +++ OK, passed 100 tests.
  9366. 150.31 s [vector] prescanr: OK
  9367. 150.31 s [vector] +++ OK, passed 100 tests.
  9368. 150.32 s [vector] prescanr': OK
  9369. 150.32 s [vector] +++ OK, passed 100 tests.
  9370. 150.34 s [vector] postscanr: OK
  9371. 150.34 s [vector] +++ OK, passed 100 tests.
  9372. 150.35 s [vector] postscanr': OK (0.01s)
  9373. 150.35 s [vector] +++ OK, passed 100 tests.
  9374. 150.36 s [vector] scanr: OK (0.01s)
  9375. 150.36 s [vector] +++ OK, passed 100 tests.
  9376. 150.37 s [vector] scanr': OK (0.01s)
  9377. 150.38 s [vector] +++ OK, passed 100 tests.
  9378. 150.38 s [vector] scanr1: OK (0.01s)
  9379. 150.38 s [vector] +++ OK, passed 100 tests.
  9380. 150.39 s [vector] scanr1': OK (0.01s)
  9381. 150.39 s [vector] +++ OK, passed 100 tests.
  9382. 150.40 s [vector] iscanr: OK (0.01s)
  9383. 150.40 s [vector] +++ OK, passed 100 tests.
  9384. 150.40 s [vector] iscanr': OK (0.01s)
  9385. 150.40 s [vector] +++ OK, passed 100 tests.
  9386. 150.41 s [vector] mut_read: OK
  9387. 150.41 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9388. 150.41 s [vector] mut_write: OK
  9389. 150.41 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9390. 150.41 s [vector] mut_modify: OK
  9391. 150.41 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9392. 150.42 s [vector] mut_generate: OK
  9393. 150.42 s [vector] +++ OK, passed 100 tests.
  9394. 150.44 s [vector] mut_generateM: OK (0.01s)
  9395. 150.44 s [vector] +++ OK, passed 100 tests.
  9396. 150.46 s [vector] mut_mapM_: OK (0.03s)
  9397. 150.46 s [vector] +++ OK, passed 100 tests.
  9398. 150.48 s [vector] mut_imapM_: OK (0.03s)
  9399. 150.48 s [vector] +++ OK, passed 100 tests.
  9400. 150.52 s [vector] mut_forM_: OK (0.03s)
  9401. 150.52 s [vector] +++ OK, passed 100 tests.
  9402. 150.54 s [vector] mut_iforM_: OK (0.03s)
  9403. 150.54 s [vector] +++ OK, passed 100 tests.
  9404. 150.56 s [vector] mut_foldr: OK (0.01s)
  9405. 150.56 s [vector] +++ OK, passed 100 tests.
  9406. 150.56 s [vector] mut_foldr': OK
  9407. 150.56 s [vector] +++ OK, passed 100 tests.
  9408. 150.58 s [vector] mut_foldl: OK (0.01s)
  9409. 150.58 s [vector] +++ OK, passed 100 tests.
  9410. 150.58 s [vector] mut_foldl': OK
  9411. 150.58 s [vector] +++ OK, passed 100 tests.
  9412. 150.60 s [vector] mut_ifoldr: OK (0.01s)
  9413. 150.60 s [vector] +++ OK, passed 100 tests.
  9414. 150.61 s [vector] mut_ifoldr': OK (0.01s)
  9415. 150.61 s [vector] +++ OK, passed 100 tests.
  9416. 150.61 s [vector] mut_ifoldl: OK (0.01s)
  9417. 150.61 s [vector] +++ OK, passed 100 tests.
  9418. 150.62 s [vector] mut_ifoldl': OK
  9419. 150.62 s [vector] +++ OK, passed 100 tests.
  9420. 150.63 s [vector] mut_foldM: OK
  9421. 150.63 s [vector] +++ OK, passed 100 tests.
  9422. 150.64 s [vector] mut_foldM': OK
  9423. 150.64 s [vector] +++ OK, passed 100 tests.
  9424. 150.65 s [vector] mut_foldrM: OK
  9425. 150.65 s [vector] +++ OK, passed 100 tests.
  9426. 150.66 s [vector] mut_foldrM': OK
  9427. 150.66 s [vector] +++ OK, passed 100 tests.
  9428. 150.67 s [vector] mut_ifoldM: OK
  9429. 150.67 s [vector] +++ OK, passed 100 tests.
  9430. 150.68 s [vector] mut_ifoldM': OK
  9431. 150.68 s [vector] +++ OK, passed 100 tests.
  9432. 150.70 s [vector] mut_ifoldrM: OK (0.01s)
  9433. 150.70 s [vector] +++ OK, passed 100 tests.
  9434. 150.70 s [vector] mut_ifoldrM': OK
  9435. 150.70 s [vector] +++ OK, passed 100 tests.
  9436. 150.70 s [vector] compare: OK
  9437. 150.70 s [vector] +++ OK, passed 100 tests.
  9438. 150.70 s [vector] maximum: OK
  9439. 150.70 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9440. 150.70 s [vector] minimum: OK
  9441. 150.70 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9442. 150.70 s [vector] minIndex: OK
  9443. 150.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9444. 150.70 s [vector] maxIndex: OK
  9445. 150.70 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9446. 150.70 s [vector] maximumBy: OK
  9447. 150.70 s [vector] +++ OK, passed 100 tests; 26 discarded.
  9448. 150.70 s [vector] minimumBy: OK
  9449. 150.70 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9450. 150.70 s [vector] maximumOn: OK
  9451. 150.70 s [vector] +++ OK, passed 100 tests; 24 discarded.
  9452. 150.70 s [vector] minimumOn: OK
  9453. 150.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9454. 150.70 s [vector] maxIndexBy: OK
  9455. 150.70 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9456. 150.71 s [vector] minIndexBy: OK
  9457. 150.71 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9458. 150.71 s [vector] ListFirstMaxIndexWins: OK
  9459. 150.71 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9460. 150.71 s [vector] FalseListFirstMaxIndexWins: OK
  9461. 150.71 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  9462. 150.71 s [vector] []
  9463. 150.71 s [vector] mempty: OK
  9464. 150.71 s [vector] +++ OK, passed 100 tests.
  9465. 150.71 s [vector] mappend: OK
  9466. 150.72 s [vector] +++ OK, passed 100 tests.
  9467. 150.72 s [vector] mconcat: OK (0.01s)
  9468. 150.72 s [vector] +++ OK, passed 100 tests.
  9469. 150.72 s [vector] glength: OK
  9470. 150.72 s [vector] +++ OK, passed 100 tests.
  9471. 150.72 s [vector] sum: OK
  9472. 150.72 s [vector] +++ OK, passed 100 tests.
  9473. 150.73 s [vector] product: OK
  9474. 150.73 s [vector] +++ OK, passed 100 tests.
  9475. 150.73 s [vector] enumFromN: OK
  9476. 150.73 s [vector] +++ OK, passed 100 tests.
  9477. 150.73 s [vector] enumFromThenN: OK
  9478. 150.73 s [vector] +++ OK, passed 100 tests.
  9479. 150.73 s [vector] enumFromTo: OK
  9480. 150.73 s [vector] +++ OK, passed 100 tests.
  9481. 150.73 s [vector] enumFromThenTo: OK
  9482. 150.73 s [vector] +++ OK, passed 100 tests; 3 discarded.
  9483. 150.73 s [vector] unstream
  9484. 150.73 s [vector] unstream == vunstream (exact): OK
  9485. 150.73 s [vector] +++ OK, passed 100 tests.
  9486. 150.73 s [vector] unstream == vunstream (unknown): OK
  9487. 150.73 s [vector] +++ OK, passed 100 tests.
  9488. 150.73 s [vector] unstreamR ~= vunstream (exact): OK
  9489. 150.73 s [vector] +++ OK, passed 100 tests.
  9490. 150.73 s [vector] unstreamR ~= vunstream (unknown): OK
  9491. 150.73 s [vector] +++ OK, passed 100 tests.
  9492. 150.73 s [vector] Tests.Vector.Strict
  9493. 150.73 s [vector] Bool
  9494. 150.73 s [vector] fromList.toList == id: OK
  9495. 150.73 s [vector] +++ OK, passed 100 tests.
  9496. 150.73 s [vector] toList.fromList == id: OK
  9497. 150.73 s [vector] +++ OK, passed 100 tests.
  9498. 150.73 s [vector] unstream.stream == id: OK
  9499. 150.73 s [vector] +++ OK, passed 100 tests.
  9500. 150.73 s [vector] stream.unstream == id: OK
  9501. 150.73 s [vector] +++ OK, passed 100 tests.
  9502. 150.73 s [vector] eq: OK
  9503. 150.73 s [vector] +++ OK, passed 100 tests.
  9504. 150.73 s [vector] length: OK
  9505. 150.73 s [vector] +++ OK, passed 100 tests.
  9506. 150.73 s [vector] null: OK
  9507. 150.73 s [vector] +++ OK, passed 100 tests.
  9508. 150.73 s [vector] index: OK
  9509. 150.73 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9510. 150.73 s [vector] safeIndex: OK
  9511. 150.73 s [vector] +++ OK, passed 100 tests.
  9512. 150.73 s [vector] head: OK
  9513. 150.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9514. 150.73 s [vector] last: OK
  9515. 150.73 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9516. 150.73 s [vector] unsafeIndex: OK
  9517. 150.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9518. 150.73 s [vector] unsafeHead: OK
  9519. 150.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9520. 150.73 s [vector] unsafeLast: OK
  9521. 150.73 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9522. 150.73 s [vector] slice: OK
  9523. 150.73 s [vector] +++ OK, passed 100 tests.
  9524. 150.73 s [vector] init: OK
  9525. 150.73 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9526. 150.73 s [vector] tail: OK
  9527. 150.73 s [vector] +++ OK, passed 100 tests; 12 discarded.
  9528. 150.73 s [vector] take: OK
  9529. 150.73 s [vector] +++ OK, passed 100 tests.
  9530. 150.73 s [vector] drop: OK
  9531. 150.73 s [vector] +++ OK, passed 100 tests.
  9532. 150.73 s [vector] splitAt: OK
  9533. 150.73 s [vector] +++ OK, passed 100 tests.
  9534. 150.73 s [vector] empty: OK
  9535. 150.73 s [vector] +++ OK, passed 100 tests.
  9536. 150.73 s [vector] singleton: OK
  9537. 150.73 s [vector] +++ OK, passed 100 tests.
  9538. 150.73 s [vector] replicate: OK
  9539. 150.73 s [vector] +++ OK, passed 100 tests.
  9540. 150.73 s [vector] generate: OK
  9541. 150.73 s [vector] +++ OK, passed 100 tests.
  9542. 150.74 s [vector] iterateN: OK
  9543. 150.74 s [vector] +++ OK, passed 100 tests.
  9544. 150.76 s [vector] iterateNM: OK (0.01s)
  9545. 151.16 s [vector] +++ OK, passed 100 tests.
  9546. 151.16 s [vector] generateM: OK (0.02s)
  9547. 151.16 s [vector] +++ OK, passed 100 tests.
  9548. 151.16 s [vector] replicateM: OK
  9549. 151.16 s [vector] +++ OK, passed 100 tests.
  9550. 151.16 s [vector] create: OK
  9551. 151.16 s [vector] +++ OK, passed 100 tests.
  9552. 151.16 s [vector] createT: OK
  9553. 151.16 s [vector] +++ OK, passed 100 tests.
  9554. 151.16 s [vector] unfoldr: OK
  9555. 151.16 s [vector] +++ OK, passed 100 tests.
  9556. 151.16 s [vector] unfoldrN: OK
  9557. 151.16 s [vector] +++ OK, passed 100 tests.
  9558. 151.16 s [vector] unfoldrExactN: OK
  9559. 151.16 s [vector] +++ OK, passed 100 tests.
  9560. 151.16 s [vector] unfoldrM: OK
  9561. 151.17 s [vector] +++ OK, passed 100 tests.
  9562. 151.17 s [vector] unfoldrNM: OK
  9563. 151.17 s [vector] +++ OK, passed 100 tests.
  9564. 151.17 s [vector] unfoldrExactNM: OK (0.02s)
  9565. 151.17 s [vector] +++ OK, passed 100 tests.
  9566. 151.17 s [vector] constructN: OK
  9567. 151.17 s [vector] +++ OK, passed 100 tests.
  9568. 151.17 s [vector] constructrN: OK
  9569. 151.17 s [vector] +++ OK, passed 100 tests.
  9570. 151.17 s [vector] cons: OK
  9571. 151.17 s [vector] +++ OK, passed 100 tests.
  9572. 151.17 s [vector] snoc: OK
  9573. 151.17 s [vector] +++ OK, passed 100 tests.
  9574. 151.17 s [vector] append: OK
  9575. 151.17 s [vector] +++ OK, passed 100 tests.
  9576. 151.17 s [vector] concat: OK
  9577. 151.17 s [vector] +++ OK, passed 100 tests.
  9578. 151.17 s [vector] force: OK
  9579. 151.17 s [vector] +++ OK, passed 100 tests.
  9580. 151.17 s [vector] upd: OK
  9581. 151.17 s [vector] +++ OK, passed 100 tests.
  9582. 151.17 s [vector] accum: OK
  9583. 151.17 s [vector] +++ OK, passed 100 tests.
  9584. 151.17 s [vector] reverse: OK
  9585. 151.17 s [vector] +++ OK, passed 100 tests.
  9586. 151.17 s [vector] backpermute: OK
  9587. 151.17 s [vector] +++ OK, passed 100 tests.
  9588. 151.17 s [vector] map: OK
  9589. 151.17 s [vector] +++ OK, passed 100 tests.
  9590. 151.17 s [vector] imap: OK
  9591. 151.17 s [vector] +++ OK, passed 100 tests.
  9592. 151.17 s [vector] concatMap: OK
  9593. 151.17 s [vector] +++ OK, passed 100 tests.
  9594. 151.17 s [vector] mapM: OK
  9595. 151.17 s [vector] +++ OK, passed 100 tests.
  9596. 151.17 s [vector] mapM_: OK
  9597. 151.17 s [vector] +++ OK, passed 100 tests.
  9598. 151.17 s [vector] forM: OK
  9599. 151.17 s [vector] +++ OK, passed 100 tests.
  9600. 151.17 s [vector] forM_: OK (0.01s)
  9601. 151.17 s [vector] +++ OK, passed 100 tests.
  9602. 151.17 s [vector] imapM: OK
  9603. 151.17 s [vector] +++ OK, passed 100 tests.
  9604. 151.17 s [vector] imapM_: OK (0.01s)
  9605. 151.17 s [vector] +++ OK, passed 100 tests.
  9606. 151.17 s [vector] zipWith: OK
  9607. 151.17 s [vector] +++ OK, passed 100 tests.
  9608. 151.17 s [vector] zipWith3: OK
  9609. 151.17 s [vector] +++ OK, passed 100 tests.
  9610. 151.17 s [vector] izipWith: OK
  9611. 151.17 s [vector] +++ OK, passed 100 tests.
  9612. 151.17 s [vector] izipWith3: OK
  9613. 151.17 s [vector] +++ OK, passed 100 tests.
  9614. 151.17 s [vector] izipWithM: OK
  9615. 151.17 s [vector] +++ OK, passed 100 tests.
  9616. 151.17 s [vector] izipWithM_: OK
  9617. 151.17 s [vector] +++ OK, passed 100 tests.
  9618. 151.17 s [vector] zipWithM: OK
  9619. 151.17 s [vector] +++ OK, passed 100 tests.
  9620. 151.17 s [vector] zipWithM_: OK
  9621. 151.17 s [vector] +++ OK, passed 100 tests.
  9622. 151.17 s [vector] filter: OK
  9623. 151.17 s [vector] +++ OK, passed 100 tests.
  9624. 151.17 s [vector] ifilter: OK
  9625. 151.17 s [vector] +++ OK, passed 100 tests.
  9626. 151.17 s [vector] filterM: OK (0.02s)
  9627. 151.17 s [vector] +++ OK, passed 100 tests.
  9628. 151.17 s [vector] uniq: OK
  9629. 151.17 s [vector] +++ OK, passed 100 tests.
  9630. 151.17 s [vector] mapMaybe: OK
  9631. 151.17 s [vector] +++ OK, passed 100 tests.
  9632. 151.17 s [vector] imapMaybe: OK
  9633. 151.17 s [vector] +++ OK, passed 100 tests.
  9634. 151.17 s [vector] takeWhile: OK
  9635. 151.17 s [vector] +++ OK, passed 100 tests.
  9636. 151.17 s [vector] dropWhile: OK
  9637. 151.17 s [vector] +++ OK, passed 100 tests.
  9638. 151.17 s [vector] partition: OK
  9639. 151.17 s [vector] +++ OK, passed 100 tests.
  9640. 151.17 s [vector] partitionWith: OK
  9641. 151.17 s [vector] +++ OK, passed 100 tests.
  9642. 151.17 s [vector] span: OK
  9643. 151.17 s [vector] +++ OK, passed 100 tests.
  9644. 151.17 s [vector] break: OK
  9645. 151.17 s [vector] +++ OK, passed 100 tests.
  9646. 151.17 s [vector] spanR: OK
  9647. 151.17 s [vector] +++ OK, passed 100 tests.
  9648. 151.17 s [vector] breakR: OK
  9649. 151.17 s [vector] +++ OK, passed 100 tests.
  9650. 151.17 s [vector] groupBy: OK
  9651. 151.17 s [vector] +++ OK, passed 100 tests.
  9652. 151.17 s [vector] elem: OK
  9653. 151.17 s [vector] +++ OK, passed 100 tests.
  9654. 151.17 s [vector] notElem: OK
  9655. 151.17 s [vector] +++ OK, passed 100 tests.
  9656. 151.17 s [vector] find: OK
  9657. 151.17 s [vector] +++ OK, passed 100 tests.
  9658. 151.17 s [vector] findIndex: OK
  9659. 151.17 s [vector] +++ OK, passed 100 tests.
  9660. 151.17 s [vector] findIndexR: OK
  9661. 151.17 s [vector] +++ OK, passed 100 tests.
  9662. 151.17 s [vector] findIndices: OK
  9663. 151.17 s [vector] +++ OK, passed 100 tests.
  9664. 151.17 s [vector] elemIndex: OK
  9665. 151.17 s [vector] +++ OK, passed 100 tests.
  9666. 151.17 s [vector] elemIndices: OK
  9667. 151.17 s [vector] +++ OK, passed 100 tests.
  9668. 151.17 s [vector] foldl: OK
  9669. 151.17 s [vector] +++ OK, passed 100 tests.
  9670. 151.17 s [vector] foldl1: OK
  9671. 151.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9672. 151.17 s [vector] foldl': OK
  9673. 151.17 s [vector] +++ OK, passed 100 tests.
  9674. 151.17 s [vector] foldl1': OK
  9675. 151.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9676. 151.17 s [vector] foldr: OK
  9677. 151.17 s [vector] +++ OK, passed 100 tests.
  9678. 151.17 s [vector] foldr1: OK
  9679. 151.17 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9680. 151.17 s [vector] foldr': OK
  9681. 151.17 s [vector] +++ OK, passed 100 tests.
  9682. 151.17 s [vector] foldr1': OK
  9683. 151.17 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9684. 151.17 s [vector] ifoldl: OK
  9685. 151.17 s [vector] +++ OK, passed 100 tests.
  9686. 151.17 s [vector] ifoldl': OK
  9687. 151.17 s [vector] +++ OK, passed 100 tests.
  9688. 151.17 s [vector] ifoldr: OK
  9689. 151.17 s [vector] +++ OK, passed 100 tests.
  9690. 151.17 s [vector] ifoldr': OK
  9691. 151.17 s [vector] +++ OK, passed 100 tests.
  9692. 151.17 s [vector] ifoldM: OK
  9693. 151.17 s [vector] +++ OK, passed 100 tests.
  9694. 151.17 s [vector] ifoldM': OK
  9695. 151.17 s [vector] +++ OK, passed 100 tests.
  9696. 151.17 s [vector] ifoldM_: OK
  9697. 151.17 s [vector] +++ OK, passed 100 tests.
  9698. 151.17 s [vector] ifoldM'_: OK (0.01s)
  9699. 151.17 s [vector] +++ OK, passed 100 tests.
  9700. 151.17 s [vector] all: OK
  9701. 151.17 s [vector] +++ OK, passed 100 tests.
  9702. 151.17 s [vector] any: OK
  9703. 151.17 s [vector] +++ OK, passed 100 tests.
  9704. 151.17 s [vector] prescanl: OK
  9705. 151.17 s [vector] +++ OK, passed 100 tests.
  9706. 151.17 s [vector] prescanl': OK
  9707. 151.17 s [vector] +++ OK, passed 100 tests.
  9708. 151.17 s [vector] postscanl: OK
  9709. 151.17 s [vector] +++ OK, passed 100 tests.
  9710. 151.17 s [vector] postscanl': OK
  9711. 151.17 s [vector] +++ OK, passed 100 tests.
  9712. 151.17 s [vector] scanl: OK
  9713. 151.17 s [vector] +++ OK, passed 100 tests.
  9714. 151.17 s [vector] scanl': OK
  9715. 151.17 s [vector] +++ OK, passed 100 tests.
  9716. 151.17 s [vector] scanl1: OK
  9717. 151.17 s [vector] +++ OK, passed 100 tests.
  9718. 151.17 s [vector] scanl1': OK
  9719. 151.17 s [vector] +++ OK, passed 100 tests.
  9720. 151.17 s [vector] iscanl: OK
  9721. 151.17 s [vector] +++ OK, passed 100 tests.
  9722. 151.17 s [vector] iscanl': OK
  9723. 151.17 s [vector] +++ OK, passed 100 tests.
  9724. 151.17 s [vector] prescanr: OK
  9725. 151.17 s [vector] +++ OK, passed 100 tests.
  9726. 151.17 s [vector] prescanr': OK
  9727. 151.17 s [vector] +++ OK, passed 100 tests.
  9728. 151.17 s [vector] postscanr: OK
  9729. 151.17 s [vector] +++ OK, passed 100 tests.
  9730. 151.17 s [vector] postscanr': OK
  9731. 151.17 s [vector] +++ OK, passed 100 tests.
  9732. 151.17 s [vector] scanr: OK
  9733. 151.17 s [vector] +++ OK, passed 100 tests.
  9734. 151.17 s [vector] scanr': OK
  9735. 151.17 s [vector] +++ OK, passed 100 tests.
  9736. 151.17 s [vector] scanr1: OK
  9737. 151.17 s [vector] +++ OK, passed 100 tests.
  9738. 151.17 s [vector] scanr1': OK
  9739. 151.17 s [vector] +++ OK, passed 100 tests.
  9740. 151.17 s [vector] iscanr: OK
  9741. 151.17 s [vector] +++ OK, passed 100 tests.
  9742. 151.17 s [vector] iscanr': OK
  9743. 151.17 s [vector] +++ OK, passed 100 tests.
  9744. 151.17 s [vector] mut_read: OK
  9745. 151.17 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9746. 151.17 s [vector] mut_write: OK
  9747. 151.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9748. 151.17 s [vector] mut_modify: OK
  9749. 151.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9750. 151.17 s [vector] mut_generate: OK
  9751. 151.17 s [vector] +++ OK, passed 100 tests.
  9752. 151.17 s [vector] mut_generateM: OK
  9753. 151.17 s [vector] +++ OK, passed 100 tests.
  9754. 151.17 s [vector] mut_mapM_: OK
  9755. 151.17 s [vector] +++ OK, passed 100 tests.
  9756. 151.17 s [vector] mut_imapM_: OK
  9757. 151.17 s [vector] +++ OK, passed 100 tests.
  9758. 151.17 s [vector] mut_forM_: OK (0.01s)
  9759. 151.17 s [vector] +++ OK, passed 100 tests.
  9760. 151.17 s [vector] mut_iforM_: OK
  9761. 151.17 s [vector] +++ OK, passed 100 tests.
  9762. 151.17 s [vector] mut_foldr: OK
  9763. 151.17 s [vector] +++ OK, passed 100 tests.
  9764. 151.17 s [vector] mut_foldr': OK
  9765. 151.17 s [vector] +++ OK, passed 100 tests.
  9766. 151.17 s [vector] mut_foldl: OK
  9767. 151.17 s [vector] +++ OK, passed 100 tests.
  9768. 151.17 s [vector] mut_foldl': OK
  9769. 151.17 s [vector] +++ OK, passed 100 tests.
  9770. 151.17 s [vector] mut_ifoldr: OK
  9771. 151.17 s [vector] +++ OK, passed 100 tests.
  9772. 151.17 s [vector] mut_ifoldr': OK
  9773. 151.17 s [vector] +++ OK, passed 100 tests.
  9774. 151.17 s [vector] mut_ifoldl: OK
  9775. 151.17 s [vector] +++ OK, passed 100 tests.
  9776. 151.17 s [vector] mut_ifoldl': OK
  9777. 151.17 s [vector] +++ OK, passed 100 tests.
  9778. 151.17 s [vector] mut_foldM: OK
  9779. 151.17 s [vector] +++ OK, passed 100 tests.
  9780. 151.17 s [vector] mut_foldM': OK
  9781. 151.17 s [vector] +++ OK, passed 100 tests.
  9782. 151.17 s [vector] mut_foldrM: OK
  9783. 151.17 s [vector] +++ OK, passed 100 tests.
  9784. 151.17 s [vector] mut_foldrM': OK
  9785. 151.17 s [vector] +++ OK, passed 100 tests.
  9786. 151.17 s [vector] mut_ifoldM: OK
  9787. 151.17 s [vector] +++ OK, passed 100 tests.
  9788. 151.17 s [vector] mut_ifoldM': OK
  9789. 151.17 s [vector] +++ OK, passed 100 tests.
  9790. 151.17 s [vector] mut_ifoldrM: OK
  9791. 151.17 s [vector] +++ OK, passed 100 tests.
  9792. 151.17 s [vector] mut_ifoldrM': OK
  9793. 151.17 s [vector] +++ OK, passed 100 tests.
  9794. 151.17 s [vector] compare: OK
  9795. 151.17 s [vector] +++ OK, passed 100 tests.
  9796. 151.17 s [vector] maximum: OK
  9797. 151.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9798. 151.17 s [vector] minimum: OK
  9799. 151.17 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9800. 151.17 s [vector] minIndex: OK
  9801. 151.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9802. 151.17 s [vector] maxIndex: OK
  9803. 151.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9804. 151.17 s [vector] maximumBy: OK
  9805. 151.17 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9806. 151.17 s [vector] minimumBy: OK
  9807. 151.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9808. 151.17 s [vector] maximumOn: OK
  9809. 151.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9810. 151.17 s [vector] minimumOn: OK
  9811. 151.17 s [vector] +++ OK, passed 100 tests; 17 discarded.
  9812. 151.17 s [vector] maxIndexBy: OK
  9813. 151.17 s [vector] +++ OK, passed 100 tests; 16 discarded.
  9814. 151.17 s [vector] minIndexBy: OK
  9815. 151.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9816. 151.17 s [vector] ListFirstMaxIndexWins: OK
  9817. 151.17 s [vector] +++ OK, passed 100 tests; 14 discarded.
  9818. 151.17 s [vector] FalseListFirstMaxIndexWins: OK
  9819. 151.17 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  9820. 151.17 s [vector] []
  9821. 151.17 s [vector] zip: OK
  9822. 151.17 s [vector] +++ OK, passed 100 tests.
  9823. 151.17 s [vector] zip3: OK
  9824. 151.17 s [vector] +++ OK, passed 100 tests.
  9825. 151.17 s [vector] unzip: OK
  9826. 151.17 s [vector] +++ OK, passed 100 tests.
  9827. 151.17 s [vector] unzip3: OK
  9828. 151.17 s [vector] +++ OK, passed 100 tests.
  9829. 151.17 s [vector] indexed: OK
  9830. 151.17 s [vector] +++ OK, passed 100 tests.
  9831. 151.17 s [vector] update: OK
  9832. 151.17 s [vector] +++ OK, passed 100 tests.
  9833. 151.17 s [vector] concat: OK
  9834. 151.17 s [vector] +++ OK, passed 100 tests.
  9835. 151.17 s [vector] mempty: OK
  9836. 151.17 s [vector] +++ OK, passed 100 tests.
  9837. 151.17 s [vector] mappend: OK
  9838. 151.17 s [vector] +++ OK, passed 100 tests.
  9839. 151.17 s [vector] mconcat: OK
  9840. 151.17 s [vector] +++ OK, passed 100 tests.
  9841. 151.17 s [vector] fmap: OK
  9842. 151.17 s [vector] +++ OK, passed 100 tests.
  9843. 151.17 s [vector] return: OK
  9844. 151.17 s [vector] +++ OK, passed 100 tests.
  9845. 151.17 s [vector] bind: OK
  9846. 151.17 s [vector] +++ OK, passed 100 tests.
  9847. 151.17 s [vector] mzip: OK
  9848. 151.17 s [vector] +++ OK, passed 100 tests.
  9849. 151.17 s [vector] munzip: OK
  9850. 151.17 s [vector] +++ OK, passed 100 tests.
  9851. 151.17 s [vector] applicative_pure: OK
  9852. 151.17 s [vector] +++ OK, passed 100 tests.
  9853. 151.17 s [vector] applicative_appl: OK (0.01s)
  9854. 151.17 s [vector] +++ OK, passed 100 tests.
  9855. 151.17 s [vector] alternative_empty: OK
  9856. 151.17 s [vector] +++ OK, passed 100 tests.
  9857. 151.17 s [vector] alternative_or: OK
  9858. 151.17 s [vector] +++ OK, passed 100 tests.
  9859. 151.17 s [vector] sequence: OK (0.03s)
  9860. 151.17 s [vector] +++ OK, passed 100 tests.
  9861. 151.17 s [vector] sequence_: OK
  9862. 151.17 s [vector] +++ OK, passed 100 tests.
  9863. 151.17 s [vector] glength: OK
  9864. 151.17 s [vector] +++ OK, passed 100 tests.
  9865. 151.17 s [vector] and: OK
  9866. 151.17 s [vector] +++ OK, passed 100 tests.
  9867. 151.17 s [vector] or: OK
  9868. 151.17 s [vector] +++ OK, passed 100 tests.
  9869. 151.17 s [vector] Int
  9870. 151.17 s [vector] fromList.toList == id: OK
  9871. 151.17 s [vector] +++ OK, passed 100 tests.
  9872. 151.17 s [vector] toList.fromList == id: OK
  9873. 151.17 s [vector] +++ OK, passed 100 tests.
  9874. 151.17 s [vector] unstream.stream == id: OK
  9875. 151.17 s [vector] +++ OK, passed 100 tests.
  9876. 151.17 s [vector] stream.unstream == id: OK
  9877. 151.17 s [vector] +++ OK, passed 100 tests.
  9878. 151.17 s [vector] eq: OK
  9879. 151.17 s [vector] +++ OK, passed 100 tests.
  9880. 151.17 s [vector] length: OK
  9881. 151.17 s [vector] +++ OK, passed 100 tests.
  9882. 151.17 s [vector] null: OK
  9883. 151.17 s [vector] +++ OK, passed 100 tests.
  9884. 151.17 s [vector] index: OK
  9885. 151.17 s [vector] +++ OK, passed 100 tests; 20 discarded.
  9886. 151.17 s [vector] safeIndex: OK
  9887. 151.17 s [vector] +++ OK, passed 100 tests.
  9888. 151.17 s [vector] head: OK
  9889. 151.17 s [vector] +++ OK, passed 100 tests; 18 discarded.
  9890. 151.17 s [vector] last: OK
  9891. 151.17 s [vector] +++ OK, passed 100 tests; 19 discarded.
  9892. 151.17 s [vector] unsafeIndex: OK
  9893. 151.17 s [vector] +++ OK, passed 100 tests; 22 discarded.
  9894. 151.17 s [vector] unsafeHead: OK
  9895. 151.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9896. 151.17 s [vector] unsafeLast: OK
  9897. 151.17 s [vector] +++ OK, passed 100 tests; 15 discarded.
  9898. 151.17 s [vector] slice: OK
  9899. 151.17 s [vector] +++ OK, passed 100 tests.
  9900. 151.17 s [vector] init: OK
  9901. 151.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9902. 151.17 s [vector] tail: OK
  9903. 151.17 s [vector] +++ OK, passed 100 tests; 13 discarded.
  9904. 151.17 s [vector] take: OK
  9905. 151.17 s [vector] +++ OK, passed 100 tests.
  9906. 151.17 s [vector] drop: OK
  9907. 151.17 s [vector] +++ OK, passed 100 tests.
  9908. 151.17 s [vector] splitAt: OK
  9909. 151.17 s [vector] +++ OK, passed 100 tests.
  9910. 151.17 s [vector] empty: OK
  9911. 151.17 s [vector] +++ OK, passed 100 tests.
  9912. 151.17 s [vector] singleton: OK
  9913. 151.17 s [vector] +++ OK, passed 100 tests.
  9914. 151.17 s [vector] replicate: OK
  9915. 151.17 s [vector] +++ OK, passed 100 tests.
  9916. 151.17 s [vector] generate: OK
  9917. 151.17 s [vector] +++ OK, passed 100 tests.
  9918. 151.17 s [vector] iterateN: OK
  9919. 151.17 s [vector] +++ OK, passed 100 tests.
  9920. 151.17 s [vector] iterateNM: OK (0.02s)
  9921. 151.17 s [vector] +++ OK, passed 100 tests.
  9922. 151.17 s [vector] generateM: OK (0.02s)
  9923. 151.17 s [vector] +++ OK, passed 100 tests.
  9924. 151.17 s [vector] replicateM: OK
  9925. 151.17 s [vector] +++ OK, passed 100 tests.
  9926. 151.17 s [vector] create: OK
  9927. 151.17 s [vector] +++ OK, passed 100 tests.
  9928. 151.17 s [vector] createT: OK
  9929. 151.17 s [vector] +++ OK, passed 100 tests.
  9930. 151.17 s [vector] unfoldr: OK
  9931. 151.17 s [vector] +++ OK, passed 100 tests.
  9932. 151.17 s [vector] unfoldrN: OK
  9933. 151.17 s [vector] +++ OK, passed 100 tests.
  9934. 151.17 s [vector] unfoldrExactN: OK
  9935. 151.17 s [vector] +++ OK, passed 100 tests.
  9936. 151.17 s [vector] unfoldrM: OK
  9937. 151.17 s [vector] +++ OK, passed 100 tests.
  9938. 151.17 s [vector] unfoldrNM: OK
  9939. 151.17 s [vector] +++ OK, passed 100 tests.
  9940. 151.18 s [vector] unfoldrExactNM: OK (0.01s)
  9941. 151.18 s [vector] +++ OK, passed 100 tests.
  9942. 151.18 s [vector] constructN: OK
  9943. 151.18 s [vector] +++ OK, passed 100 tests.
  9944. 151.18 s [vector] constructrN: OK
  9945. 151.18 s [vector] +++ OK, passed 100 tests.
  9946. 151.18 s [vector] cons: OK
  9947. 151.18 s [vector] +++ OK, passed 100 tests.
  9948. 151.18 s [vector] snoc: OK
  9949. 151.19 s [vector] +++ OK, passed 100 tests.
  9950. 151.19 s [vector] append: OK
  9951. 151.19 s [vector] +++ OK, passed 100 tests.
  9952. 151.19 s [vector] concat: OK
  9953. 151.19 s [vector] +++ OK, passed 100 tests.
  9954. 151.19 s [vector] force: OK
  9955. 151.19 s [vector] +++ OK, passed 100 tests.
  9956. 151.19 s [vector] upd: OK
  9957. 151.19 s [vector] +++ OK, passed 100 tests.
  9958. 151.19 s [vector] accum: OK
  9959. 151.19 s [vector] +++ OK, passed 100 tests.
  9960. 151.19 s [vector] reverse: OK
  9961. 151.19 s [vector] +++ OK, passed 100 tests.
  9962. 151.19 s [vector] backpermute: OK
  9963. 151.19 s [vector] +++ OK, passed 100 tests.
  9964. 151.19 s [vector] map: OK
  9965. 151.20 s [vector] +++ OK, passed 100 tests.
  9966. 151.20 s [vector] imap: OK
  9967. 151.20 s [vector] +++ OK, passed 100 tests.
  9968. 151.20 s [vector] concatMap: OK
  9969. 151.20 s [vector] +++ OK, passed 100 tests.
  9970. 151.21 s [vector] mapM: OK
  9971. 151.21 s [vector] +++ OK, passed 100 tests.
  9972. 151.21 s [vector] mapM_: OK (0.01s)
  9973. 151.22 s [vector] +++ OK, passed 100 tests.
  9974. 151.22 s [vector] forM: OK
  9975. 151.22 s [vector] +++ OK, passed 100 tests.
  9976. 151.23 s [vector] forM_: OK (0.01s)
  9977. 151.23 s [vector] +++ OK, passed 100 tests.
  9978. 151.24 s [vector] imapM: OK
  9979. 151.24 s [vector] +++ OK, passed 100 tests.
  9980. 151.24 s [vector] imapM_: OK (0.01s)
  9981. 151.24 s [vector] +++ OK, passed 100 tests.
  9982. 151.24 s [vector] zipWith: OK
  9983. 151.24 s [vector] +++ OK, passed 100 tests.
  9984. 151.25 s [vector] zipWith3: OK
  9985. 151.25 s [vector] +++ OK, passed 100 tests.
  9986. 151.25 s [vector] izipWith: OK
  9987. 151.25 s [vector] +++ OK, passed 100 tests.
  9988. 151.25 s [vector] izipWith3: OK
  9989. 151.25 s [vector] +++ OK, passed 100 tests.
  9990. 151.25 s [vector] izipWithM: OK
  9991. 151.26 s [vector] +++ OK, passed 100 tests.
  9992. 151.26 s [vector] izipWithM_: OK (0.01s)
  9993. 151.26 s [vector] +++ OK, passed 100 tests.
  9994. 151.27 s [vector] zipWithM: OK
  9995. 151.27 s [vector] +++ OK, passed 100 tests.
  9996. 151.28 s [vector] zipWithM_: OK
  9997. 151.28 s [vector] +++ OK, passed 100 tests.
  9998. 151.28 s [vector] filter: OK
  9999. 151.28 s [vector] +++ OK, passed 100 tests.
  10000. 151.28 s [vector] ifilter: OK
  10001. 151.28 s [vector] +++ OK, passed 100 tests.
  10002. 151.30 s [vector] filterM: OK (0.03s)
  10003. 151.31 s [vector] +++ OK, passed 100 tests.
  10004. 151.31 s [vector] uniq: OK
  10005. 151.31 s [vector] +++ OK, passed 100 tests.
  10006. 151.31 s [vector] mapMaybe: OK
  10007. 151.31 s [vector] +++ OK, passed 100 tests.
  10008. 151.31 s [vector] imapMaybe: OK
  10009. 151.31 s [vector] +++ OK, passed 100 tests.
  10010. 151.31 s [vector] takeWhile: OK
  10011. 151.31 s [vector] +++ OK, passed 100 tests.
  10012. 151.31 s [vector] dropWhile: OK
  10013. 151.31 s [vector] +++ OK, passed 100 tests.
  10014. 151.31 s [vector] partition: OK
  10015. 151.31 s [vector] +++ OK, passed 100 tests.
  10016. 151.31 s [vector] partitionWith: OK
  10017. 151.31 s [vector] +++ OK, passed 100 tests.
  10018. 151.31 s [vector] span: OK
  10019. 151.31 s [vector] +++ OK, passed 100 tests.
  10020. 151.31 s [vector] break: OK
  10021. 151.31 s [vector] +++ OK, passed 100 tests.
  10022. 151.31 s [vector] spanR: OK
  10023. 151.31 s [vector] +++ OK, passed 100 tests.
  10024. 151.31 s [vector] breakR: OK
  10025. 151.31 s [vector] +++ OK, passed 100 tests.
  10026. 151.32 s [vector] groupBy: OK
  10027. 151.32 s [vector] +++ OK, passed 100 tests.
  10028. 151.32 s [vector] elem: OK
  10029. 151.32 s [vector] +++ OK, passed 100 tests.
  10030. 151.32 s [vector] notElem: OK
  10031. 151.32 s [vector] +++ OK, passed 100 tests.
  10032. 151.32 s [vector] find: OK
  10033. 151.32 s [vector] +++ OK, passed 100 tests.
  10034. 151.32 s [vector] findIndex: OK
  10035. 151.32 s [vector] +++ OK, passed 100 tests.
  10036. 151.32 s [vector] findIndexR: OK
  10037. 151.32 s [vector] +++ OK, passed 100 tests.
  10038. 151.32 s [vector] findIndices: OK
  10039. 151.32 s [vector] +++ OK, passed 100 tests.
  10040. 151.32 s [vector] elemIndex: OK
  10041. 151.32 s [vector] +++ OK, passed 100 tests.
  10042. 151.32 s [vector] elemIndices: OK
  10043. 151.32 s [vector] +++ OK, passed 100 tests.
  10044. 151.32 s [vector] foldl: OK
  10045. 151.32 s [vector] +++ OK, passed 100 tests.
  10046. 151.32 s [vector] foldl1: OK
  10047. 151.32 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10048. 151.33 s [vector] foldl': OK
  10049. 151.33 s [vector] +++ OK, passed 100 tests.
  10050. 151.33 s [vector] foldl1': OK
  10051. 151.33 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10052. 151.33 s [vector] foldr: OK
  10053. 151.33 s [vector] +++ OK, passed 100 tests.
  10054. 151.33 s [vector] foldr1: OK
  10055. 151.33 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10056. 151.33 s [vector] foldr': OK
  10057. 151.33 s [vector] +++ OK, passed 100 tests.
  10058. 151.33 s [vector] foldr1': OK
  10059. 151.34 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10060. 151.34 s [vector] ifoldl: OK
  10061. 151.34 s [vector] +++ OK, passed 100 tests.
  10062. 151.34 s [vector] ifoldl': OK
  10063. 151.34 s [vector] +++ OK, passed 100 tests.
  10064. 151.34 s [vector] ifoldr: OK
  10065. 151.34 s [vector] +++ OK, passed 100 tests.
  10066. 151.34 s [vector] ifoldr': OK
  10067. 151.34 s [vector] +++ OK, passed 100 tests.
  10068. 151.35 s [vector] ifoldM: OK
  10069. 151.35 s [vector] +++ OK, passed 100 tests.
  10070. 151.35 s [vector] ifoldM': OK
  10071. 151.36 s [vector] +++ OK, passed 100 tests.
  10072. 151.36 s [vector] ifoldM_: OK (0.01s)
  10073. 151.36 s [vector] +++ OK, passed 100 tests.
  10074. 151.37 s [vector] ifoldM'_: OK
  10075. 151.38 s [vector] +++ OK, passed 100 tests.
  10076. 151.38 s [vector] all: OK
  10077. 151.38 s [vector] +++ OK, passed 100 tests.
  10078. 151.38 s [vector] any: OK
  10079. 151.38 s [vector] +++ OK, passed 100 tests.
  10080. 151.38 s [vector] prescanl: OK
  10081. 151.38 s [vector] +++ OK, passed 100 tests.
  10082. 151.38 s [vector] prescanl': OK
  10083. 151.38 s [vector] +++ OK, passed 100 tests.
  10084. 151.38 s [vector] postscanl: OK
  10085. 151.38 s [vector] +++ OK, passed 100 tests.
  10086. 151.38 s [vector] postscanl': OK
  10087. 151.39 s [vector] +++ OK, passed 100 tests.
  10088. 151.39 s [vector] scanl: OK
  10089. 151.39 s [vector] +++ OK, passed 100 tests.
  10090. 151.39 s [vector] scanl': OK
  10091. 151.39 s [vector] +++ OK, passed 100 tests.
  10092. 151.39 s [vector] scanl1: OK
  10093. 151.39 s [vector] +++ OK, passed 100 tests.
  10094. 151.39 s [vector] scanl1': OK
  10095. 151.39 s [vector] +++ OK, passed 100 tests.
  10096. 151.40 s [vector] iscanl: OK
  10097. 151.40 s [vector] +++ OK, passed 100 tests.
  10098. 151.40 s [vector] iscanl': OK
  10099. 151.40 s [vector] +++ OK, passed 100 tests.
  10100. 151.40 s [vector] prescanr: OK
  10101. 151.40 s [vector] +++ OK, passed 100 tests.
  10102. 151.40 s [vector] prescanr': OK
  10103. 151.40 s [vector] +++ OK, passed 100 tests.
  10104. 151.40 s [vector] postscanr: OK
  10105. 151.40 s [vector] +++ OK, passed 100 tests.
  10106. 151.41 s [vector] postscanr': OK
  10107. 151.41 s [vector] +++ OK, passed 100 tests.
  10108. 151.41 s [vector] scanr: OK
  10109. 151.41 s [vector] +++ OK, passed 100 tests.
  10110. 151.41 s [vector] scanr': OK
  10111. 151.42 s [vector] +++ OK, passed 100 tests.
  10112. 151.42 s [vector] scanr1: OK
  10113. 151.42 s [vector] +++ OK, passed 100 tests.
  10114. 151.42 s [vector] scanr1': OK
  10115. 151.42 s [vector] +++ OK, passed 100 tests.
  10116. 151.42 s [vector] iscanr: OK
  10117. 151.42 s [vector] +++ OK, passed 100 tests.
  10118. 151.42 s [vector] iscanr': OK
  10119. 151.43 s [vector] +++ OK, passed 100 tests.
  10120. 151.44 s [vector] mut_read: OK
  10121. 151.44 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10122. 151.44 s [vector] mut_write: OK
  10123. 151.44 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10124. 151.44 s [vector] mut_modify: OK
  10125. 151.44 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10126. 151.44 s [vector] mut_generate: OK
  10127. 151.44 s [vector] +++ OK, passed 100 tests.
  10128. 151.44 s [vector] mut_generateM: OK
  10129. 151.44 s [vector] +++ OK, passed 100 tests.
  10130. 151.44 s [vector] mut_mapM_: OK (0.01s)
  10131. 151.44 s [vector] +++ OK, passed 100 tests.
  10132. 151.45 s [vector] mut_imapM_: OK
  10133. 151.45 s [vector] +++ OK, passed 100 tests.
  10134. 151.48 s [vector] mut_forM_: OK (0.01s)
  10135. 151.48 s [vector] +++ OK, passed 100 tests.
  10136. 151.48 s [vector] mut_iforM_: OK (0.01s)
  10137. 151.48 s [vector] +++ OK, passed 100 tests.
  10138. 151.48 s [vector] mut_foldr: OK
  10139. 151.49 s [vector] +++ OK, passed 100 tests.
  10140. 151.49 s [vector] mut_foldr': OK
  10141. 151.49 s [vector] +++ OK, passed 100 tests.
  10142. 151.49 s [vector] mut_foldl: OK
  10143. 151.49 s [vector] +++ OK, passed 100 tests.
  10144. 151.49 s [vector] mut_foldl': OK
  10145. 151.49 s [vector] +++ OK, passed 100 tests.
  10146. 151.49 s [vector] mut_ifoldr: OK
  10147. 151.49 s [vector] +++ OK, passed 100 tests.
  10148. 151.50 s [vector] mut_ifoldr': OK
  10149. 151.50 s [vector] +++ OK, passed 100 tests.
  10150. 151.50 s [vector] mut_ifoldl: OK
  10151. 151.50 s [vector] +++ OK, passed 100 tests.
  10152. 151.50 s [vector] mut_ifoldl': OK
  10153. 151.50 s [vector] +++ OK, passed 100 tests.
  10154. 151.50 s [vector] mut_foldM: OK
  10155. 151.50 s [vector] +++ OK, passed 100 tests.
  10156. 151.50 s [vector] mut_foldM': OK
  10157. 151.50 s [vector] +++ OK, passed 100 tests.
  10158. 151.50 s [vector] mut_foldrM: OK
  10159. 151.50 s [vector] +++ OK, passed 100 tests.
  10160. 151.51 s [vector] mut_foldrM': OK
  10161. 151.51 s [vector] +++ OK, passed 100 tests.
  10162. 151.51 s [vector] mut_ifoldM: OK
  10163. 151.51 s [vector] +++ OK, passed 100 tests.
  10164. 151.51 s [vector] mut_ifoldM': OK
  10165. 151.51 s [vector] +++ OK, passed 100 tests.
  10166. 151.52 s [vector] mut_ifoldrM: OK
  10167. 151.52 s [vector] +++ OK, passed 100 tests.
  10168. 151.52 s [vector] mut_ifoldrM': OK
  10169. 151.52 s [vector] +++ OK, passed 100 tests.
  10170. 151.52 s [vector] compare: OK
  10171. 151.52 s [vector] +++ OK, passed 100 tests.
  10172. 151.52 s [vector] maximum: OK
  10173. 151.52 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10174. 151.52 s [vector] minimum: OK
  10175. 151.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10176. 151.52 s [vector] minIndex: OK
  10177. 151.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10178. 151.52 s [vector] maxIndex: OK
  10179. 151.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10180. 151.52 s [vector] maximumBy: OK
  10181. 151.52 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10182. 151.52 s [vector] minimumBy: OK
  10183. 151.52 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10184. 151.52 s [vector] maximumOn: OK
  10185. 151.52 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10186. 151.52 s [vector] minimumOn: OK
  10187. 151.52 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10188. 151.52 s [vector] maxIndexBy: OK
  10189. 151.52 s [vector] +++ OK, passed 100 tests; 25 discarded.
  10190. 151.52 s [vector] minIndexBy: OK
  10191. 151.52 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10192. 151.52 s [vector] ListFirstMaxIndexWins: OK
  10193. 151.52 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10194. 151.52 s [vector] FalseListFirstMaxIndexWins: OK
  10195. 151.52 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  10196. 151.52 s [vector] []
  10197. 151.52 s [vector] zip: OK
  10198. 151.52 s [vector] +++ OK, passed 100 tests.
  10199. 151.52 s [vector] zip3: OK
  10200. 151.52 s [vector] +++ OK, passed 100 tests.
  10201. 151.52 s [vector] unzip: OK
  10202. 151.52 s [vector] +++ OK, passed 100 tests.
  10203. 151.52 s [vector] unzip3: OK
  10204. 151.52 s [vector] +++ OK, passed 100 tests.
  10205. 151.53 s [vector] indexed: OK
  10206. 151.53 s [vector] +++ OK, passed 100 tests.
  10207. 151.53 s [vector] update: OK
  10208. 151.53 s [vector] +++ OK, passed 100 tests.
  10209. 151.53 s [vector] concat: OK
  10210. 151.53 s [vector] +++ OK, passed 100 tests.
  10211. 151.53 s [vector] mempty: OK
  10212. 151.53 s [vector] +++ OK, passed 100 tests.
  10213. 151.54 s [vector] mappend: OK
  10214. 151.54 s [vector] +++ OK, passed 100 tests.
  10215. 151.54 s [vector] mconcat: OK
  10216. 151.54 s [vector] +++ OK, passed 100 tests.
  10217. 151.54 s [vector] fmap: OK
  10218. 151.54 s [vector] +++ OK, passed 100 tests.
  10219. 151.56 s [vector] return: OK
  10220. 151.56 s [vector] +++ OK, passed 100 tests.
  10221. 151.56 s [vector] bind: OK (0.02s)
  10222. 151.56 s [vector] +++ OK, passed 100 tests.
  10223. 151.56 s [vector] mzip: OK
  10224. 151.56 s [vector] +++ OK, passed 100 tests.
  10225. 151.56 s [vector] munzip: OK
  10226. 151.56 s [vector] +++ OK, passed 100 tests.
  10227. 151.56 s [vector] applicative_pure: OK
  10228. 151.56 s [vector] +++ OK, passed 100 tests.
  10229. 151.59 s [vector] applicative_appl: OK (0.03s)
  10230. 151.59 s [vector] +++ OK, passed 100 tests.
  10231. 151.59 s [vector] alternative_empty: OK
  10232. 151.59 s [vector] +++ OK, passed 100 tests.
  10233. 151.60 s [vector] alternative_or: OK
  10234. 151.60 s [vector] +++ OK, passed 100 tests.
  10235. 151.62 s [vector] sequence: OK (0.02s)
  10236. 151.62 s [vector] +++ OK, passed 100 tests.
  10237. 151.62 s [vector] sequence_: OK (0.01s)
  10238. 151.62 s [vector] +++ OK, passed 100 tests.
  10239. 151.62 s [vector] glength: OK
  10240. 151.62 s [vector] +++ OK, passed 100 tests.
  10241. 151.62 s [vector] sum: OK
  10242. 151.62 s [vector] +++ OK, passed 100 tests.
  10243. 151.62 s [vector] product: OK
  10244. 151.62 s [vector] +++ OK, passed 100 tests.
  10245. 151.62 s [vector] enumFromN: OK
  10246. 151.62 s [vector] +++ OK, passed 100 tests.
  10247. 151.62 s [vector] enumFromThenN: OK
  10248. 151.62 s [vector] +++ OK, passed 100 tests.
  10249. 151.62 s [vector] enumFromTo: OK
  10250. 151.62 s [vector] +++ OK, passed 100 tests.
  10251. 151.62 s [vector] enumFromThenTo: OK
  10252. 151.62 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10253. 151.62 s [vector] unstream
  10254. 151.62 s [vector] unstream == vunstream (exact): OK
  10255. 151.62 s [vector] +++ OK, passed 100 tests.
  10256. 151.62 s [vector] unstream == vunstream (unknown): OK
  10257. 151.62 s [vector] +++ OK, passed 100 tests.
  10258. 151.62 s [vector] unstreamR ~= vunstream (exact): OK
  10259. 151.62 s [vector] +++ OK, passed 100 tests.
  10260. 151.62 s [vector] unstreamR ~= vunstream (unknown): OK
  10261. 151.62 s [vector] +++ OK, passed 100 tests.
  10262. 151.62 s [vector] Tests.Vector.Unboxed
  10263. 151.62 s [vector] ()
  10264. 151.62 s [vector] fromList.toList == id: OK
  10265. 151.62 s [vector] +++ OK, passed 100 tests.
  10266. 151.62 s [vector] toList.fromList == id: OK
  10267. 151.62 s [vector] +++ OK, passed 100 tests.
  10268. 151.62 s [vector] unstream.stream == id: OK
  10269. 151.62 s [vector] +++ OK, passed 100 tests.
  10270. 151.62 s [vector] stream.unstream == id: OK
  10271. 151.62 s [vector] +++ OK, passed 100 tests.
  10272. 151.62 s [vector] eq: OK
  10273. 151.62 s [vector] +++ OK, passed 100 tests.
  10274. 151.62 s [vector] length: OK
  10275. 151.62 s [vector] +++ OK, passed 100 tests.
  10276. 151.62 s [vector] null: OK
  10277. 151.62 s [vector] +++ OK, passed 100 tests.
  10278. 151.62 s [vector] index: OK
  10279. 151.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10280. 151.62 s [vector] safeIndex: OK
  10281. 151.62 s [vector] +++ OK, passed 100 tests.
  10282. 151.62 s [vector] head: OK
  10283. 151.62 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10284. 151.62 s [vector] last: OK
  10285. 151.62 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10286. 151.62 s [vector] unsafeIndex: OK
  10287. 151.62 s [vector] +++ OK, passed 100 tests; 22 discarded.
  10288. 151.62 s [vector] unsafeHead: OK
  10289. 151.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10290. 151.62 s [vector] unsafeLast: OK
  10291. 151.62 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10292. 151.62 s [vector] slice: OK
  10293. 151.62 s [vector] +++ OK, passed 100 tests.
  10294. 151.62 s [vector] init: OK
  10295. 151.63 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10296. 151.63 s [vector] tail: OK
  10297. 151.63 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10298. 151.63 s [vector] take: OK
  10299. 151.63 s [vector] +++ OK, passed 100 tests.
  10300. 151.63 s [vector] drop: OK
  10301. 151.63 s [vector] +++ OK, passed 100 tests.
  10302. 151.63 s [vector] splitAt: OK
  10303. 151.63 s [vector] +++ OK, passed 100 tests.
  10304. 151.63 s [vector] empty: OK
  10305. 151.63 s [vector] +++ OK, passed 100 tests.
  10306. 151.63 s [vector] singleton: OK
  10307. 151.63 s [vector] +++ OK, passed 100 tests.
  10308. 151.63 s [vector] replicate: OK
  10309. 151.63 s [vector] +++ OK, passed 100 tests.
  10310. 151.63 s [vector] generate: OK
  10311. 151.63 s [vector] +++ OK, passed 100 tests.
  10312. 151.63 s [vector] iterateN: OK
  10313. 151.63 s [vector] +++ OK, passed 100 tests.
  10314. 151.66 s [vector] iterateNM: OK
  10315. 151.66 s [vector] +++ OK, passed 100 tests.
  10316. 151.66 s [vector] generateM: OK (0.02s)
  10317. 151.66 s [vector] +++ OK, passed 100 tests.
  10318. 151.67 s [vector] replicateM: OK
  10319. 151.67 s [vector] +++ OK, passed 100 tests.
  10320. 151.67 s [vector] create: OK
  10321. 151.67 s [vector] +++ OK, passed 100 tests.
  10322. 151.67 s [vector] createT: OK
  10323. 151.67 s [vector] +++ OK, passed 100 tests.
  10324. 151.67 s [vector] unfoldr: OK
  10325. 151.67 s [vector] +++ OK, passed 100 tests.
  10326. 151.67 s [vector] unfoldrN: OK
  10327. 151.67 s [vector] +++ OK, passed 100 tests.
  10328. 151.67 s [vector] unfoldrExactN: OK
  10329. 151.67 s [vector] +++ OK, passed 100 tests.
  10330. 151.67 s [vector] unfoldrM: OK
  10331. 151.67 s [vector] +++ OK, passed 100 tests.
  10332. 151.67 s [vector] unfoldrNM: OK
  10333. 151.67 s [vector] +++ OK, passed 100 tests.
  10334. 151.69 s [vector] unfoldrExactNM: OK (0.01s)
  10335. 151.69 s [vector] +++ OK, passed 100 tests.
  10336. 151.69 s [vector] constructN: OK
  10337. 151.69 s [vector] +++ OK, passed 100 tests.
  10338. 151.69 s [vector] constructrN: OK
  10339. 151.69 s [vector] +++ OK, passed 100 tests.
  10340. 151.69 s [vector] cons: OK
  10341. 151.70 s [vector] +++ OK, passed 100 tests.
  10342. 151.70 s [vector] snoc: OK
  10343. 151.70 s [vector] +++ OK, passed 100 tests.
  10344. 151.70 s [vector] append: OK
  10345. 151.70 s [vector] +++ OK, passed 100 tests.
  10346. 151.70 s [vector] concat: OK
  10347. 151.70 s [vector] +++ OK, passed 100 tests.
  10348. 151.70 s [vector] force: OK
  10349. 151.70 s [vector] +++ OK, passed 100 tests.
  10350. 151.71 s [vector] upd: OK
  10351. 151.71 s [vector] +++ OK, passed 100 tests.
  10352. 151.71 s [vector] accum: OK
  10353. 151.71 s [vector] +++ OK, passed 100 tests.
  10354. 151.71 s [vector] reverse: OK
  10355. 151.71 s [vector] +++ OK, passed 100 tests.
  10356. 151.71 s [vector] backpermute: OK
  10357. 151.71 s [vector] +++ OK, passed 100 tests.
  10358. 151.71 s [vector] map: OK
  10359. 151.71 s [vector] +++ OK, passed 100 tests.
  10360. 151.71 s [vector] imap: OK
  10361. 151.71 s [vector] +++ OK, passed 100 tests.
  10362. 151.71 s [vector] concatMap: OK
  10363. 151.71 s [vector] +++ OK, passed 100 tests.
  10364. 151.72 s [vector] mapM: OK
  10365. 151.72 s [vector] +++ OK, passed 100 tests.
  10366. 151.72 s [vector] mapM_: OK
  10367. 151.72 s [vector] +++ OK, passed 100 tests.
  10368. 151.72 s [vector] forM: OK
  10369. 151.72 s [vector] +++ OK, passed 100 tests.
  10370. 151.72 s [vector] forM_: OK
  10371. 151.72 s [vector] +++ OK, passed 100 tests.
  10372. 151.73 s [vector] imapM: OK
  10373. 151.73 s [vector] +++ OK, passed 100 tests.
  10374. 151.73 s [vector] imapM_: OK
  10375. 151.73 s [vector] +++ OK, passed 100 tests.
  10376. 151.73 s [vector] zipWith: OK
  10377. 151.73 s [vector] +++ OK, passed 100 tests.
  10378. 151.73 s [vector] zipWith3: OK
  10379. 151.73 s [vector] +++ OK, passed 100 tests.
  10380. 151.74 s [vector] izipWith: OK
  10381. 151.74 s [vector] +++ OK, passed 100 tests.
  10382. 151.74 s [vector] izipWith3: OK
  10383. 151.74 s [vector] +++ OK, passed 100 tests.
  10384. 151.74 s [vector] izipWithM: OK
  10385. 151.74 s [vector] +++ OK, passed 100 tests.
  10386. 151.74 s [vector] izipWithM_: OK
  10387. 151.74 s [vector] +++ OK, passed 100 tests.
  10388. 151.75 s [vector] zipWithM: OK
  10389. 151.75 s [vector] +++ OK, passed 100 tests.
  10390. 151.75 s [vector] zipWithM_: OK
  10391. 151.75 s [vector] +++ OK, passed 100 tests.
  10392. 151.75 s [vector] filter: OK
  10393. 151.75 s [vector] +++ OK, passed 100 tests.
  10394. 151.76 s [vector] ifilter: OK
  10395. 151.76 s [vector] +++ OK, passed 100 tests.
  10396. 151.77 s [vector] filterM: OK (0.02s)
  10397. 151.77 s [vector] +++ OK, passed 100 tests.
  10398. 151.77 s [vector] uniq: OK
  10399. 151.77 s [vector] +++ OK, passed 100 tests.
  10400. 151.77 s [vector] mapMaybe: OK
  10401. 151.77 s [vector] +++ OK, passed 100 tests.
  10402. 151.77 s [vector] imapMaybe: OK
  10403. 151.77 s [vector] +++ OK, passed 100 tests.
  10404. 151.77 s [vector] takeWhile: OK
  10405. 151.77 s [vector] +++ OK, passed 100 tests.
  10406. 151.77 s [vector] dropWhile: OK
  10407. 151.77 s [vector] +++ OK, passed 100 tests.
  10408. 151.77 s [vector] partition: OK
  10409. 151.77 s [vector] +++ OK, passed 100 tests.
  10410. 151.77 s [vector] partitionWith: OK
  10411. 151.77 s [vector] +++ OK, passed 100 tests.
  10412. 151.77 s [vector] span: OK
  10413. 151.77 s [vector] +++ OK, passed 100 tests.
  10414. 151.77 s [vector] break: OK
  10415. 151.77 s [vector] +++ OK, passed 100 tests.
  10416. 151.77 s [vector] spanR: OK
  10417. 151.77 s [vector] +++ OK, passed 100 tests.
  10418. 151.77 s [vector] breakR: OK
  10419. 151.77 s [vector] +++ OK, passed 100 tests.
  10420. 151.77 s [vector] groupBy: OK
  10421. 151.77 s [vector] +++ OK, passed 100 tests.
  10422. 151.77 s [vector] elem: OK
  10423. 151.77 s [vector] +++ OK, passed 100 tests.
  10424. 151.77 s [vector] notElem: OK
  10425. 151.77 s [vector] +++ OK, passed 100 tests.
  10426. 151.77 s [vector] find: OK
  10427. 151.77 s [vector] +++ OK, passed 100 tests.
  10428. 151.78 s [vector] findIndex: OK
  10429. 151.78 s [vector] +++ OK, passed 100 tests.
  10430. 151.78 s [vector] findIndexR: OK
  10431. 151.78 s [vector] +++ OK, passed 100 tests.
  10432. 151.78 s [vector] findIndices: OK
  10433. 151.78 s [vector] +++ OK, passed 100 tests.
  10434. 151.78 s [vector] elemIndex: OK
  10435. 151.78 s [vector] +++ OK, passed 100 tests.
  10436. 151.78 s [vector] elemIndices: OK
  10437. 151.78 s [vector] +++ OK, passed 100 tests.
  10438. 151.78 s [vector] foldl: OK
  10439. 151.78 s [vector] +++ OK, passed 100 tests.
  10440. 151.78 s [vector] foldl1: OK
  10441. 151.78 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10442. 151.78 s [vector] foldl': OK
  10443. 151.78 s [vector] +++ OK, passed 100 tests.
  10444. 151.78 s [vector] foldl1': OK
  10445. 151.78 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10446. 151.78 s [vector] foldr: OK
  10447. 151.78 s [vector] +++ OK, passed 100 tests.
  10448. 151.78 s [vector] foldr1: OK
  10449. 151.78 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10450. 151.78 s [vector] foldr': OK
  10451. 151.78 s [vector] +++ OK, passed 100 tests.
  10452. 151.78 s [vector] foldr1': OK
  10453. 151.78 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10454. 151.78 s [vector] ifoldl: OK
  10455. 151.78 s [vector] +++ OK, passed 100 tests.
  10456. 151.78 s [vector] ifoldl': OK
  10457. 151.78 s [vector] +++ OK, passed 100 tests.
  10458. 151.78 s [vector] ifoldr: OK
  10459. 151.78 s [vector] +++ OK, passed 100 tests.
  10460. 151.78 s [vector] ifoldr': OK
  10461. 151.78 s [vector] +++ OK, passed 100 tests.
  10462. 151.78 s [vector] ifoldM: OK
  10463. 151.78 s [vector] +++ OK, passed 100 tests.
  10464. 151.78 s [vector] ifoldM': OK
  10465. 151.79 s [vector] +++ OK, passed 100 tests.
  10466. 151.80 s [vector] ifoldM_: OK
  10467. 151.80 s [vector] +++ OK, passed 100 tests.
  10468. 151.80 s [vector] ifoldM'_: OK
  10469. 151.80 s [vector] +++ OK, passed 100 tests.
  10470. 151.80 s [vector] all: OK
  10471. 151.80 s [vector] +++ OK, passed 100 tests.
  10472. 151.80 s [vector] any: OK
  10473. 151.80 s [vector] +++ OK, passed 100 tests.
  10474. 151.80 s [vector] prescanl: OK
  10475. 151.80 s [vector] +++ OK, passed 100 tests.
  10476. 151.80 s [vector] prescanl': OK
  10477. 151.80 s [vector] +++ OK, passed 100 tests.
  10478. 151.80 s [vector] postscanl: OK
  10479. 151.80 s [vector] +++ OK, passed 100 tests.
  10480. 151.80 s [vector] postscanl': OK
  10481. 151.80 s [vector] +++ OK, passed 100 tests.
  10482. 151.80 s [vector] scanl: OK
  10483. 151.80 s [vector] +++ OK, passed 100 tests.
  10484. 151.80 s [vector] scanl': OK
  10485. 151.80 s [vector] +++ OK, passed 100 tests.
  10486. 151.80 s [vector] scanl1: OK
  10487. 151.80 s [vector] +++ OK, passed 100 tests.
  10488. 151.80 s [vector] scanl1': OK
  10489. 151.80 s [vector] +++ OK, passed 100 tests.
  10490. 151.81 s [vector] iscanl: OK
  10491. 151.81 s [vector] +++ OK, passed 100 tests.
  10492. 151.81 s [vector] iscanl': OK
  10493. 151.81 s [vector] +++ OK, passed 100 tests.
  10494. 151.81 s [vector] prescanr: OK
  10495. 151.81 s [vector] +++ OK, passed 100 tests.
  10496. 151.81 s [vector] prescanr': OK
  10497. 151.81 s [vector] +++ OK, passed 100 tests.
  10498. 151.81 s [vector] postscanr: OK
  10499. 151.81 s [vector] +++ OK, passed 100 tests.
  10500. 151.81 s [vector] postscanr': OK
  10501. 151.81 s [vector] +++ OK, passed 100 tests.
  10502. 151.81 s [vector] scanr: OK
  10503. 151.81 s [vector] +++ OK, passed 100 tests.
  10504. 151.81 s [vector] scanr': OK
  10505. 151.81 s [vector] +++ OK, passed 100 tests.
  10506. 151.81 s [vector] scanr1: OK
  10507. 151.81 s [vector] +++ OK, passed 100 tests.
  10508. 151.81 s [vector] scanr1': OK
  10509. 151.81 s [vector] +++ OK, passed 100 tests.
  10510. 151.81 s [vector] iscanr: OK
  10511. 151.81 s [vector] +++ OK, passed 100 tests.
  10512. 151.81 s [vector] iscanr': OK
  10513. 151.81 s [vector] +++ OK, passed 100 tests.
  10514. 151.81 s [vector] mut_read: OK
  10515. 151.81 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10516. 151.81 s [vector] mut_write: OK
  10517. 151.81 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10518. 151.81 s [vector] mut_modify: OK
  10519. 151.81 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10520. 151.82 s [vector] mut_generate: OK
  10521. 151.83 s [vector] +++ OK, passed 100 tests.
  10522. 151.84 s [vector] mut_generateM: OK
  10523. 151.84 s [vector] +++ OK, passed 100 tests.
  10524. 151.84 s [vector] mut_mapM_: OK
  10525. 151.84 s [vector] +++ OK, passed 100 tests.
  10526. 151.84 s [vector] mut_imapM_: OK
  10527. 151.84 s [vector] +++ OK, passed 100 tests.
  10528. 151.84 s [vector] mut_forM_: OK
  10529. 151.84 s [vector] +++ OK, passed 100 tests.
  10530. 151.84 s [vector] mut_iforM_: OK
  10531. 151.84 s [vector] +++ OK, passed 100 tests.
  10532. 151.85 s [vector] mut_foldr: OK
  10533. 151.85 s [vector] +++ OK, passed 100 tests.
  10534. 151.85 s [vector] mut_foldr': OK
  10535. 151.85 s [vector] +++ OK, passed 100 tests.
  10536. 151.85 s [vector] mut_foldl: OK
  10537. 151.85 s [vector] +++ OK, passed 100 tests.
  10538. 151.85 s [vector] mut_foldl': OK
  10539. 151.85 s [vector] +++ OK, passed 100 tests.
  10540. 151.85 s [vector] mut_ifoldr: OK
  10541. 151.85 s [vector] +++ OK, passed 100 tests.
  10542. 151.85 s [vector] mut_ifoldr': OK
  10543. 151.85 s [vector] +++ OK, passed 100 tests.
  10544. 151.85 s [vector] mut_ifoldl: OK
  10545. 151.85 s [vector] +++ OK, passed 100 tests.
  10546. 151.85 s [vector] mut_ifoldl': OK
  10547. 151.85 s [vector] +++ OK, passed 100 tests.
  10548. 151.85 s [vector] mut_foldM: OK
  10549. 151.85 s [vector] +++ OK, passed 100 tests.
  10550. 151.85 s [vector] mut_foldM': OK
  10551. 151.85 s [vector] +++ OK, passed 100 tests.
  10552. 151.85 s [vector] mut_foldrM: OK
  10553. 151.85 s [vector] +++ OK, passed 100 tests.
  10554. 151.85 s [vector] mut_foldrM': OK
  10555. 151.85 s [vector] +++ OK, passed 100 tests.
  10556. 151.85 s [vector] mut_ifoldM: OK
  10557. 151.85 s [vector] +++ OK, passed 100 tests.
  10558. 151.85 s [vector] mut_ifoldM': OK
  10559. 151.85 s [vector] +++ OK, passed 100 tests.
  10560. 151.85 s [vector] mut_ifoldrM: OK
  10561. 151.85 s [vector] +++ OK, passed 100 tests.
  10562. 151.85 s [vector] mut_ifoldrM': OK
  10563. 151.85 s [vector] +++ OK, passed 100 tests.
  10564. 151.85 s [vector] compare: OK
  10565. 151.85 s [vector] +++ OK, passed 100 tests.
  10566. 151.85 s [vector] maximum: OK
  10567. 151.85 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10568. 151.85 s [vector] minimum: OK
  10569. 151.85 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10570. 151.85 s [vector] minIndex: OK
  10571. 151.85 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10572. 151.85 s [vector] maxIndex: OK
  10573. 151.85 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10574. 151.85 s [vector] maximumBy: OK
  10575. 151.85 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10576. 151.85 s [vector] minimumBy: OK
  10577. 151.85 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10578. 151.85 s [vector] maximumOn: OK
  10579. 151.85 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10580. 151.85 s [vector] minimumOn: OK
  10581. 151.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10582. 151.86 s [vector] maxIndexBy: OK
  10583. 151.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10584. 151.86 s [vector] minIndexBy: OK
  10585. 151.86 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10586. 151.86 s [vector] ListFirstMaxIndexWins: OK
  10587. 151.86 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10588. 151.86 s [vector] FalseListFirstMaxIndexWins: OK
  10589. 151.86 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  10590. 151.86 s [vector] []
  10591. 151.86 s [vector] zip: OK
  10592. 151.86 s [vector] +++ OK, passed 100 tests.
  10593. 151.86 s [vector] zip3: OK
  10594. 151.86 s [vector] +++ OK, passed 100 tests.
  10595. 151.86 s [vector] unzip: OK
  10596. 151.86 s [vector] +++ OK, passed 100 tests.
  10597. 151.86 s [vector] unzip3: OK
  10598. 151.86 s [vector] +++ OK, passed 100 tests.
  10599. 151.86 s [vector] indexed: OK
  10600. 151.86 s [vector] +++ OK, passed 100 tests.
  10601. 151.86 s [vector] update: OK
  10602. 151.86 s [vector] +++ OK, passed 100 tests.
  10603. 151.86 s [vector] mempty: OK
  10604. 151.86 s [vector] +++ OK, passed 100 tests.
  10605. 151.87 s [vector] mappend: OK
  10606. 151.87 s [vector] +++ OK, passed 100 tests.
  10607. 151.87 s [vector] mconcat: OK
  10608. 151.87 s [vector] +++ OK, passed 100 tests.
  10609. 151.87 s [vector] glength: OK
  10610. 151.87 s [vector] +++ OK, passed 100 tests.
  10611. 151.87 s [vector] (Bool)
  10612. 151.87 s [vector] fromList.toList == id: OK
  10613. 151.87 s [vector] +++ OK, passed 100 tests.
  10614. 151.87 s [vector] toList.fromList == id: OK
  10615. 151.87 s [vector] +++ OK, passed 100 tests.
  10616. 151.87 s [vector] unstream.stream == id: OK
  10617. 151.87 s [vector] +++ OK, passed 100 tests.
  10618. 151.87 s [vector] stream.unstream == id: OK
  10619. 151.87 s [vector] +++ OK, passed 100 tests.
  10620. 151.87 s [vector] eq: OK
  10621. 151.87 s [vector] +++ OK, passed 100 tests.
  10622. 151.87 s [vector] length: OK
  10623. 151.87 s [vector] +++ OK, passed 100 tests.
  10624. 151.87 s [vector] null: OK
  10625. 151.87 s [vector] +++ OK, passed 100 tests.
  10626. 151.87 s [vector] index: OK
  10627. 151.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10628. 151.88 s [vector] safeIndex: OK
  10629. 151.88 s [vector] +++ OK, passed 100 tests.
  10630. 151.88 s [vector] head: OK
  10631. 151.88 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10632. 151.88 s [vector] last: OK
  10633. 151.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10634. 151.88 s [vector] unsafeIndex: OK
  10635. 151.88 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10636. 151.88 s [vector] unsafeHead: OK
  10637. 151.88 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10638. 151.88 s [vector] unsafeLast: OK
  10639. 151.88 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10640. 151.88 s [vector] slice: OK
  10641. 151.88 s [vector] +++ OK, passed 100 tests.
  10642. 151.88 s [vector] init: OK
  10643. 151.88 s [vector] +++ OK, passed 100 tests; 11 discarded.
  10644. 151.88 s [vector] tail: OK
  10645. 151.88 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10646. 151.88 s [vector] take: OK
  10647. 151.88 s [vector] +++ OK, passed 100 tests.
  10648. 151.88 s [vector] drop: OK
  10649. 151.88 s [vector] +++ OK, passed 100 tests.
  10650. 151.88 s [vector] splitAt: OK
  10651. 151.88 s [vector] +++ OK, passed 100 tests.
  10652. 151.88 s [vector] empty: OK
  10653. 151.88 s [vector] +++ OK, passed 100 tests.
  10654. 151.88 s [vector] singleton: OK
  10655. 151.88 s [vector] +++ OK, passed 100 tests.
  10656. 151.88 s [vector] replicate: OK
  10657. 151.88 s [vector] +++ OK, passed 100 tests.
  10658. 151.88 s [vector] generate: OK
  10659. 151.88 s [vector] +++ OK, passed 100 tests.
  10660. 151.90 s [vector] iterateN: OK
  10661. 151.90 s [vector] +++ OK, passed 100 tests.
  10662. 151.90 s [vector] iterateNM: OK (0.01s)
  10663. 151.90 s [vector] +++ OK, passed 100 tests.
  10664. 151.91 s [vector] generateM: OK (0.01s)
  10665. 151.91 s [vector] +++ OK, passed 100 tests.
  10666. 151.92 s [vector] replicateM: OK
  10667. 151.92 s [vector] +++ OK, passed 100 tests.
  10668. 151.92 s [vector] create: OK
  10669. 151.92 s [vector] +++ OK, passed 100 tests.
  10670. 151.92 s [vector] createT: OK
  10671. 151.92 s [vector] +++ OK, passed 100 tests.
  10672. 151.92 s [vector] unfoldr: OK
  10673. 151.92 s [vector] +++ OK, passed 100 tests.
  10674. 151.92 s [vector] unfoldrN: OK
  10675. 151.92 s [vector] +++ OK, passed 100 tests.
  10676. 151.92 s [vector] unfoldrExactN: OK
  10677. 151.92 s [vector] +++ OK, passed 100 tests.
  10678. 151.93 s [vector] unfoldrM: OK
  10679. 151.93 s [vector] +++ OK, passed 100 tests.
  10680. 151.94 s [vector] unfoldrNM: OK
  10681. 151.94 s [vector] +++ OK, passed 100 tests.
  10682. 151.95 s [vector] unfoldrExactNM: OK (0.02s)
  10683. 151.95 s [vector] +++ OK, passed 100 tests.
  10684. 151.95 s [vector] constructN: OK
  10685. 151.95 s [vector] +++ OK, passed 100 tests.
  10686. 151.95 s [vector] constructrN: OK
  10687. 151.95 s [vector] +++ OK, passed 100 tests.
  10688. 151.95 s [vector] cons: OK
  10689. 151.95 s [vector] +++ OK, passed 100 tests.
  10690. 151.95 s [vector] snoc: OK
  10691. 151.95 s [vector] +++ OK, passed 100 tests.
  10692. 151.95 s [vector] append: OK
  10693. 151.96 s [vector] +++ OK, passed 100 tests.
  10694. 151.97 s [vector] concat: OK (0.01s)
  10695. 151.97 s [vector] +++ OK, passed 100 tests.
  10696. 151.97 s [vector] force: OK
  10697. 151.97 s [vector] +++ OK, passed 100 tests.
  10698. 151.97 s [vector] upd: OK
  10699. 151.97 s [vector] +++ OK, passed 100 tests.
  10700. 151.97 s [vector] accum: OK
  10701. 151.97 s [vector] +++ OK, passed 100 tests.
  10702. 151.97 s [vector] reverse: OK
  10703. 151.97 s [vector] +++ OK, passed 100 tests.
  10704. 151.97 s [vector] backpermute: OK
  10705. 151.97 s [vector] +++ OK, passed 100 tests.
  10706. 151.97 s [vector] map: OK
  10707. 151.97 s [vector] +++ OK, passed 100 tests.
  10708. 151.97 s [vector] imap: OK
  10709. 151.97 s [vector] +++ OK, passed 100 tests.
  10710. 151.98 s [vector] concatMap: OK
  10711. 151.98 s [vector] +++ OK, passed 100 tests.
  10712. 151.98 s [vector] mapM: OK
  10713. 151.98 s [vector] +++ OK, passed 100 tests.
  10714. 151.99 s [vector] mapM_: OK (0.01s)
  10715. 152.00 s [vector] +++ OK, passed 100 tests.
  10716. 152.00 s [vector] forM: OK
  10717. 152.00 s [vector] +++ OK, passed 100 tests.
  10718. 152.00 s [vector] forM_: OK
  10719. 152.00 s [vector] +++ OK, passed 100 tests.
  10720. 152.00 s [vector] imapM: OK
  10721. 152.00 s [vector] +++ OK, passed 100 tests.
  10722. 152.01 s [vector] imapM_: OK
  10723. 152.01 s [vector] +++ OK, passed 100 tests.
  10724. 152.01 s [vector] zipWith: OK
  10725. 152.01 s [vector] +++ OK, passed 100 tests.
  10726. 152.01 s [vector] zipWith3: OK
  10727. 152.01 s [vector] +++ OK, passed 100 tests.
  10728. 152.01 s [vector] izipWith: OK
  10729. 152.02 s [vector] +++ OK, passed 100 tests.
  10730. 152.02 s [vector] izipWith3: OK
  10731. 152.02 s [vector] +++ OK, passed 100 tests.
  10732. 152.02 s [vector] izipWithM: OK
  10733. 152.02 s [vector] +++ OK, passed 100 tests.
  10734. 152.02 s [vector] izipWithM_: OK
  10735. 152.02 s [vector] +++ OK, passed 100 tests.
  10736. 152.03 s [vector] zipWithM: OK
  10737. 152.03 s [vector] +++ OK, passed 100 tests.
  10738. 152.03 s [vector] zipWithM_: OK
  10739. 152.03 s [vector] +++ OK, passed 100 tests.
  10740. 152.03 s [vector] filter: OK
  10741. 152.03 s [vector] +++ OK, passed 100 tests.
  10742. 152.04 s [vector] ifilter: OK
  10743. 152.04 s [vector] +++ OK, passed 100 tests.
  10744. 152.06 s [vector] filterM: OK (0.02s)
  10745. 152.06 s [vector] +++ OK, passed 100 tests.
  10746. 152.06 s [vector] uniq: OK
  10747. 152.06 s [vector] +++ OK, passed 100 tests.
  10748. 152.06 s [vector] mapMaybe: OK
  10749. 152.06 s [vector] +++ OK, passed 100 tests.
  10750. 152.06 s [vector] imapMaybe: OK
  10751. 152.06 s [vector] +++ OK, passed 100 tests.
  10752. 152.06 s [vector] takeWhile: OK
  10753. 152.06 s [vector] +++ OK, passed 100 tests.
  10754. 152.06 s [vector] dropWhile: OK
  10755. 152.06 s [vector] +++ OK, passed 100 tests.
  10756. 152.06 s [vector] partition: OK
  10757. 152.06 s [vector] +++ OK, passed 100 tests.
  10758. 152.06 s [vector] partitionWith: OK
  10759. 152.07 s [vector] +++ OK, passed 100 tests.
  10760. 152.07 s [vector] span: OK
  10761. 152.07 s [vector] +++ OK, passed 100 tests.
  10762. 152.07 s [vector] break: OK
  10763. 152.07 s [vector] +++ OK, passed 100 tests.
  10764. 152.07 s [vector] spanR: OK
  10765. 152.07 s [vector] +++ OK, passed 100 tests.
  10766. 152.07 s [vector] breakR: OK
  10767. 152.07 s [vector] +++ OK, passed 100 tests.
  10768. 152.07 s [vector] groupBy: OK
  10769. 152.07 s [vector] +++ OK, passed 100 tests.
  10770. 152.07 s [vector] elem: OK
  10771. 152.07 s [vector] +++ OK, passed 100 tests.
  10772. 152.07 s [vector] notElem: OK
  10773. 152.07 s [vector] +++ OK, passed 100 tests.
  10774. 152.07 s [vector] find: OK
  10775. 152.07 s [vector] +++ OK, passed 100 tests.
  10776. 152.07 s [vector] findIndex: OK
  10777. 152.07 s [vector] +++ OK, passed 100 tests.
  10778. 152.07 s [vector] findIndexR: OK
  10779. 152.07 s [vector] +++ OK, passed 100 tests.
  10780. 152.07 s [vector] findIndices: OK
  10781. 152.07 s [vector] +++ OK, passed 100 tests.
  10782. 152.07 s [vector] elemIndex: OK
  10783. 152.07 s [vector] +++ OK, passed 100 tests.
  10784. 152.07 s [vector] elemIndices: OK
  10785. 152.07 s [vector] +++ OK, passed 100 tests.
  10786. 152.07 s [vector] foldl: OK
  10787. 152.07 s [vector] +++ OK, passed 100 tests.
  10788. 152.07 s [vector] foldl1: OK
  10789. 152.07 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10790. 152.08 s [vector] foldl': OK
  10791. 152.08 s [vector] +++ OK, passed 100 tests.
  10792. 152.08 s [vector] foldl1': OK
  10793. 152.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10794. 152.08 s [vector] foldr: OK
  10795. 152.08 s [vector] +++ OK, passed 100 tests.
  10796. 152.08 s [vector] foldr1: OK
  10797. 152.08 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10798. 152.08 s [vector] foldr': OK
  10799. 152.08 s [vector] +++ OK, passed 100 tests.
  10800. 152.08 s [vector] foldr1': OK
  10801. 152.08 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10802. 152.08 s [vector] ifoldl: OK
  10803. 152.08 s [vector] +++ OK, passed 100 tests.
  10804. 152.08 s [vector] ifoldl': OK
  10805. 152.08 s [vector] +++ OK, passed 100 tests.
  10806. 152.09 s [vector] ifoldr: OK
  10807. 152.09 s [vector] +++ OK, passed 100 tests.
  10808. 152.09 s [vector] ifoldr': OK
  10809. 152.09 s [vector] +++ OK, passed 100 tests.
  10810. 152.09 s [vector] ifoldM: OK
  10811. 152.09 s [vector] +++ OK, passed 100 tests.
  10812. 152.10 s [vector] ifoldM': OK
  10813. 152.10 s [vector] +++ OK, passed 100 tests.
  10814. 152.10 s [vector] ifoldM_: OK
  10815. 152.10 s [vector] +++ OK, passed 100 tests.
  10816. 152.11 s [vector] ifoldM'_: OK
  10817. 152.11 s [vector] +++ OK, passed 100 tests.
  10818. 152.11 s [vector] all: OK
  10819. 152.11 s [vector] +++ OK, passed 100 tests.
  10820. 152.11 s [vector] any: OK
  10821. 152.11 s [vector] +++ OK, passed 100 tests.
  10822. 152.11 s [vector] prescanl: OK
  10823. 152.11 s [vector] +++ OK, passed 100 tests.
  10824. 152.11 s [vector] prescanl': OK
  10825. 152.11 s [vector] +++ OK, passed 100 tests.
  10826. 152.11 s [vector] postscanl: OK
  10827. 152.11 s [vector] +++ OK, passed 100 tests.
  10828. 152.11 s [vector] postscanl': OK
  10829. 152.12 s [vector] +++ OK, passed 100 tests.
  10830. 152.12 s [vector] scanl: OK
  10831. 152.12 s [vector] +++ OK, passed 100 tests.
  10832. 152.12 s [vector] scanl': OK
  10833. 152.12 s [vector] +++ OK, passed 100 tests.
  10834. 152.12 s [vector] scanl1: OK
  10835. 152.12 s [vector] +++ OK, passed 100 tests.
  10836. 152.12 s [vector] scanl1': OK
  10837. 152.12 s [vector] +++ OK, passed 100 tests.
  10838. 152.12 s [vector] iscanl: OK
  10839. 152.12 s [vector] +++ OK, passed 100 tests.
  10840. 152.12 s [vector] iscanl': OK
  10841. 152.12 s [vector] +++ OK, passed 100 tests.
  10842. 152.12 s [vector] prescanr: OK
  10843. 152.12 s [vector] +++ OK, passed 100 tests.
  10844. 152.13 s [vector] prescanr': OK
  10845. 152.13 s [vector] +++ OK, passed 100 tests.
  10846. 152.13 s [vector] postscanr: OK
  10847. 152.13 s [vector] +++ OK, passed 100 tests.
  10848. 152.13 s [vector] postscanr': OK
  10849. 152.13 s [vector] +++ OK, passed 100 tests.
  10850. 152.13 s [vector] scanr: OK
  10851. 152.13 s [vector] +++ OK, passed 100 tests.
  10852. 152.13 s [vector] scanr': OK
  10853. 152.13 s [vector] +++ OK, passed 100 tests.
  10854. 152.13 s [vector] scanr1: OK
  10855. 152.13 s [vector] +++ OK, passed 100 tests.
  10856. 152.13 s [vector] scanr1': OK
  10857. 152.13 s [vector] +++ OK, passed 100 tests.
  10858. 152.14 s [vector] iscanr: OK
  10859. 152.14 s [vector] +++ OK, passed 100 tests.
  10860. 152.14 s [vector] iscanr': OK
  10861. 152.14 s [vector] +++ OK, passed 100 tests.
  10862. 152.14 s [vector] mut_read: OK
  10863. 152.14 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10864. 152.14 s [vector] mut_write: OK
  10865. 152.14 s [vector] +++ OK, passed 100 tests; 21 discarded.
  10866. 152.14 s [vector] mut_modify: OK
  10867. 152.14 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10868. 152.14 s [vector] mut_generate: OK
  10869. 152.14 s [vector] +++ OK, passed 100 tests.
  10870. 152.15 s [vector] mut_generateM: OK
  10871. 152.15 s [vector] +++ OK, passed 100 tests.
  10872. 152.16 s [vector] mut_mapM_: OK
  10873. 152.16 s [vector] +++ OK, passed 100 tests.
  10874. 152.16 s [vector] mut_imapM_: OK
  10875. 152.16 s [vector] +++ OK, passed 100 tests.
  10876. 152.18 s [vector] mut_forM_: OK
  10877. 152.18 s [vector] +++ OK, passed 100 tests.
  10878. 152.18 s [vector] mut_iforM_: OK (0.01s)
  10879. 152.18 s [vector] +++ OK, passed 100 tests.
  10880. 152.18 s [vector] mut_foldr: OK
  10881. 152.18 s [vector] +++ OK, passed 100 tests.
  10882. 152.18 s [vector] mut_foldr': OK
  10883. 152.18 s [vector] +++ OK, passed 100 tests.
  10884. 152.18 s [vector] mut_foldl: OK
  10885. 152.18 s [vector] +++ OK, passed 100 tests.
  10886. 152.18 s [vector] mut_foldl': OK
  10887. 152.18 s [vector] +++ OK, passed 100 tests.
  10888. 152.18 s [vector] mut_ifoldr: OK
  10889. 152.19 s [vector] +++ OK, passed 100 tests.
  10890. 152.19 s [vector] mut_ifoldr': OK
  10891. 152.19 s [vector] +++ OK, passed 100 tests.
  10892. 152.19 s [vector] mut_ifoldl: OK
  10893. 152.19 s [vector] +++ OK, passed 100 tests.
  10894. 152.19 s [vector] mut_ifoldl': OK
  10895. 152.19 s [vector] +++ OK, passed 100 tests.
  10896. 152.19 s [vector] mut_foldM: OK
  10897. 152.19 s [vector] +++ OK, passed 100 tests.
  10898. 152.19 s [vector] mut_foldM': OK
  10899. 152.19 s [vector] +++ OK, passed 100 tests.
  10900. 152.19 s [vector] mut_foldrM: OK
  10901. 152.19 s [vector] +++ OK, passed 100 tests.
  10902. 152.19 s [vector] mut_foldrM': OK
  10903. 152.19 s [vector] +++ OK, passed 100 tests.
  10904. 152.19 s [vector] mut_ifoldM: OK
  10905. 152.20 s [vector] +++ OK, passed 100 tests.
  10906. 152.20 s [vector] mut_ifoldM': OK
  10907. 152.20 s [vector] +++ OK, passed 100 tests.
  10908. 152.20 s [vector] mut_ifoldrM: OK
  10909. 152.20 s [vector] +++ OK, passed 100 tests.
  10910. 152.20 s [vector] mut_ifoldrM': OK
  10911. 152.20 s [vector] +++ OK, passed 100 tests.
  10912. 152.20 s [vector] compare: OK
  10913. 152.20 s [vector] +++ OK, passed 100 tests.
  10914. 152.20 s [vector] maximum: OK
  10915. 152.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10916. 152.20 s [vector] minimum: OK
  10917. 152.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10918. 152.20 s [vector] minIndex: OK
  10919. 152.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10920. 152.20 s [vector] maxIndex: OK
  10921. 152.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10922. 152.20 s [vector] maximumBy: OK
  10923. 152.20 s [vector] +++ OK, passed 100 tests; 20 discarded.
  10924. 152.20 s [vector] minimumBy: OK
  10925. 152.20 s [vector] +++ OK, passed 100 tests; 16 discarded.
  10926. 152.20 s [vector] maximumOn: OK
  10927. 152.20 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10928. 152.20 s [vector] minimumOn: OK
  10929. 152.20 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10930. 152.20 s [vector] maxIndexBy: OK
  10931. 152.20 s [vector] +++ OK, passed 100 tests; 14 discarded.
  10932. 152.20 s [vector] minIndexBy: OK
  10933. 152.20 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10934. 152.20 s [vector] ListFirstMaxIndexWins: OK
  10935. 152.20 s [vector] +++ OK, passed 100 tests; 18 discarded.
  10936. 152.20 s [vector] FalseListFirstMaxIndexWins: OK
  10937. 152.21 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  10938. 152.21 s [vector] []
  10939. 152.21 s [vector] zip: OK
  10940. 152.21 s [vector] +++ OK, passed 100 tests.
  10941. 152.21 s [vector] zip3: OK
  10942. 152.21 s [vector] +++ OK, passed 100 tests.
  10943. 152.21 s [vector] unzip: OK
  10944. 152.21 s [vector] +++ OK, passed 100 tests.
  10945. 152.21 s [vector] unzip3: OK
  10946. 152.21 s [vector] +++ OK, passed 100 tests.
  10947. 152.21 s [vector] indexed: OK
  10948. 152.21 s [vector] +++ OK, passed 100 tests.
  10949. 152.21 s [vector] update: OK
  10950. 152.21 s [vector] +++ OK, passed 100 tests.
  10951. 152.22 s [vector] mempty: OK
  10952. 152.22 s [vector] +++ OK, passed 100 tests.
  10953. 152.22 s [vector] mappend: OK
  10954. 152.22 s [vector] +++ OK, passed 100 tests.
  10955. 152.22 s [vector] mconcat: OK (0.01s)
  10956. 152.22 s [vector] +++ OK, passed 100 tests.
  10957. 152.23 s [vector] glength: OK
  10958. 152.23 s [vector] +++ OK, passed 100 tests.
  10959. 152.23 s [vector] and: OK
  10960. 152.23 s [vector] +++ OK, passed 100 tests.
  10961. 152.23 s [vector] or: OK
  10962. 152.23 s [vector] +++ OK, passed 100 tests.
  10963. 152.23 s [vector] (Int)
  10964. 152.23 s [vector] fromList.toList == id: OK
  10965. 152.23 s [vector] +++ OK, passed 100 tests.
  10966. 152.23 s [vector] toList.fromList == id: OK
  10967. 152.23 s [vector] +++ OK, passed 100 tests.
  10968. 152.23 s [vector] unstream.stream == id: OK
  10969. 152.23 s [vector] +++ OK, passed 100 tests.
  10970. 152.23 s [vector] stream.unstream == id: OK
  10971. 152.23 s [vector] +++ OK, passed 100 tests.
  10972. 152.23 s [vector] eq: OK
  10973. 152.23 s [vector] +++ OK, passed 100 tests.
  10974. 152.23 s [vector] length: OK
  10975. 152.23 s [vector] +++ OK, passed 100 tests.
  10976. 152.23 s [vector] null: OK
  10977. 152.23 s [vector] +++ OK, passed 100 tests.
  10978. 152.23 s [vector] index: OK
  10979. 152.23 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10980. 152.23 s [vector] safeIndex: OK
  10981. 152.23 s [vector] +++ OK, passed 100 tests.
  10982. 152.23 s [vector] head: OK
  10983. 152.23 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10984. 152.23 s [vector] last: OK
  10985. 152.23 s [vector] +++ OK, passed 100 tests; 13 discarded.
  10986. 152.23 s [vector] unsafeIndex: OK
  10987. 152.23 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10988. 152.23 s [vector] unsafeHead: OK
  10989. 152.23 s [vector] +++ OK, passed 100 tests; 12 discarded.
  10990. 152.23 s [vector] unsafeLast: OK
  10991. 152.23 s [vector] +++ OK, passed 100 tests; 19 discarded.
  10992. 152.23 s [vector] slice: OK
  10993. 152.23 s [vector] +++ OK, passed 100 tests.
  10994. 152.23 s [vector] init: OK
  10995. 152.23 s [vector] +++ OK, passed 100 tests; 15 discarded.
  10996. 152.23 s [vector] tail: OK
  10997. 152.23 s [vector] +++ OK, passed 100 tests; 17 discarded.
  10998. 152.23 s [vector] take: OK
  10999. 152.24 s [vector] +++ OK, passed 100 tests.
  11000. 152.24 s [vector] drop: OK
  11001. 152.24 s [vector] +++ OK, passed 100 tests.
  11002. 152.24 s [vector] splitAt: OK
  11003. 152.24 s [vector] +++ OK, passed 100 tests.
  11004. 152.24 s [vector] empty: OK
  11005. 152.24 s [vector] +++ OK, passed 100 tests.
  11006. 152.24 s [vector] singleton: OK
  11007. 152.24 s [vector] +++ OK, passed 100 tests.
  11008. 152.24 s [vector] replicate: OK
  11009. 152.24 s [vector] +++ OK, passed 100 tests.
  11010. 152.24 s [vector] generate: OK
  11011. 152.24 s [vector] +++ OK, passed 100 tests.
  11012. 152.24 s [vector] iterateN: OK
  11013. 152.24 s [vector] +++ OK, passed 100 tests.
  11014. 152.24 s [vector] iterateNM: OK
  11015. 152.24 s [vector] +++ OK, passed 100 tests.
  11016. 152.27 s [vector] generateM: OK
  11017. 152.27 s [vector] +++ OK, passed 100 tests.
  11018. 152.27 s [vector] replicateM: OK (0.01s)
  11019. 152.27 s [vector] +++ OK, passed 100 tests.
  11020. 152.27 s [vector] create: OK
  11021. 152.27 s [vector] +++ OK, passed 100 tests.
  11022. 152.27 s [vector] createT: OK
  11023. 152.27 s [vector] +++ OK, passed 100 tests.
  11024. 152.27 s [vector] unfoldr: OK
  11025. 152.27 s [vector] +++ OK, passed 100 tests.
  11026. 152.27 s [vector] unfoldrN: OK
  11027. 152.28 s [vector] +++ OK, passed 100 tests.
  11028. 152.28 s [vector] unfoldrExactN: OK
  11029. 152.28 s [vector] +++ OK, passed 100 tests.
  11030. 152.28 s [vector] unfoldrM: OK
  11031. 152.28 s [vector] +++ OK, passed 100 tests.
  11032. 152.28 s [vector] unfoldrNM: OK
  11033. 152.28 s [vector] +++ OK, passed 100 tests.
  11034. 152.30 s [vector] unfoldrExactNM: OK (0.01s)
  11035. 152.30 s [vector] +++ OK, passed 100 tests.
  11036. 152.30 s [vector] constructN: OK
  11037. 152.30 s [vector] +++ OK, passed 100 tests.
  11038. 152.30 s [vector] constructrN: OK
  11039. 152.30 s [vector] +++ OK, passed 100 tests.
  11040. 152.30 s [vector] cons: OK
  11041. 152.30 s [vector] +++ OK, passed 100 tests.
  11042. 152.30 s [vector] snoc: OK
  11043. 152.31 s [vector] +++ OK, passed 100 tests.
  11044. 152.32 s [vector] append: OK
  11045. 152.32 s [vector] +++ OK, passed 100 tests.
  11046. 152.32 s [vector] concat: OK (0.01s)
  11047. 152.32 s [vector] +++ OK, passed 100 tests.
  11048. 152.32 s [vector] force: OK
  11049. 152.32 s [vector] +++ OK, passed 100 tests.
  11050. 152.32 s [vector] upd: OK
  11051. 152.32 s [vector] +++ OK, passed 100 tests.
  11052. 152.32 s [vector] accum: OK
  11053. 152.32 s [vector] +++ OK, passed 100 tests.
  11054. 152.32 s [vector] reverse: OK
  11055. 152.32 s [vector] +++ OK, passed 100 tests.
  11056. 152.32 s [vector] backpermute: OK
  11057. 152.32 s [vector] +++ OK, passed 100 tests.
  11058. 152.32 s [vector] map: OK
  11059. 152.32 s [vector] +++ OK, passed 100 tests.
  11060. 152.33 s [vector] imap: OK
  11061. 152.33 s [vector] +++ OK, passed 100 tests.
  11062. 152.33 s [vector] concatMap: OK
  11063. 152.33 s [vector] +++ OK, passed 100 tests.
  11064. 152.33 s [vector] mapM: OK
  11065. 152.34 s [vector] +++ OK, passed 100 tests.
  11066. 152.34 s [vector] mapM_: OK (0.01s)
  11067. 152.36 s [vector] +++ OK, passed 100 tests.
  11068. 152.36 s [vector] forM: OK
  11069. 152.36 s [vector] +++ OK, passed 100 tests.
  11070. 152.38 s [vector] forM_: OK (0.02s)
  11071. 152.38 s [vector] +++ OK, passed 100 tests.
  11072. 152.38 s [vector] imapM: OK
  11073. 152.38 s [vector] +++ OK, passed 100 tests.
  11074. 152.38 s [vector] imapM_: OK (0.01s)
  11075. 152.38 s [vector] +++ OK, passed 100 tests.
  11076. 152.38 s [vector] zipWith: OK
  11077. 152.38 s [vector] +++ OK, passed 100 tests.
  11078. 152.38 s [vector] zipWith3: OK
  11079. 152.38 s [vector] +++ OK, passed 100 tests.
  11080. 152.38 s [vector] izipWith: OK
  11081. 152.38 s [vector] +++ OK, passed 100 tests.
  11082. 152.38 s [vector] izipWith3: OK
  11083. 152.39 s [vector] +++ OK, passed 100 tests.
  11084. 152.40 s [vector] izipWithM: OK
  11085. 152.40 s [vector] +++ OK, passed 100 tests.
  11086. 152.40 s [vector] izipWithM_: OK (0.01s)
  11087. 152.40 s [vector] +++ OK, passed 100 tests.
  11088. 152.40 s [vector] zipWithM: OK
  11089. 152.40 s [vector] +++ OK, passed 100 tests.
  11090. 152.41 s [vector] zipWithM_: OK
  11091. 152.41 s [vector] +++ OK, passed 100 tests.
  11092. 152.41 s [vector] filter: OK
  11093. 152.41 s [vector] +++ OK, passed 100 tests.
  11094. 152.42 s [vector] ifilter: OK
  11095. 152.42 s [vector] +++ OK, passed 100 tests.
  11096. 152.43 s [vector] filterM: OK (0.02s)
  11097. 152.44 s [vector] +++ OK, passed 100 tests.
  11098. 152.44 s [vector] uniq: OK
  11099. 152.44 s [vector] +++ OK, passed 100 tests.
  11100. 152.44 s [vector] mapMaybe: OK
  11101. 152.44 s [vector] +++ OK, passed 100 tests.
  11102. 152.44 s [vector] imapMaybe: OK
  11103. 152.44 s [vector] +++ OK, passed 100 tests.
  11104. 152.44 s [vector] takeWhile: OK
  11105. 152.44 s [vector] +++ OK, passed 100 tests.
  11106. 152.44 s [vector] dropWhile: OK
  11107. 152.44 s [vector] +++ OK, passed 100 tests.
  11108. 152.44 s [vector] partition: OK
  11109. 152.44 s [vector] +++ OK, passed 100 tests.
  11110. 152.44 s [vector] partitionWith: OK
  11111. 152.44 s [vector] +++ OK, passed 100 tests.
  11112. 152.44 s [vector] span: OK
  11113. 152.44 s [vector] +++ OK, passed 100 tests.
  11114. 152.44 s [vector] break: OK
  11115. 152.45 s [vector] +++ OK, passed 100 tests.
  11116. 152.45 s [vector] spanR: OK
  11117. 152.45 s [vector] +++ OK, passed 100 tests.
  11118. 152.45 s [vector] breakR: OK
  11119. 152.45 s [vector] +++ OK, passed 100 tests.
  11120. 152.45 s [vector] groupBy: OK
  11121. 152.45 s [vector] +++ OK, passed 100 tests.
  11122. 152.45 s [vector] elem: OK
  11123. 152.45 s [vector] +++ OK, passed 100 tests.
  11124. 152.45 s [vector] notElem: OK
  11125. 152.45 s [vector] +++ OK, passed 100 tests.
  11126. 152.45 s [vector] find: OK
  11127. 152.45 s [vector] +++ OK, passed 100 tests.
  11128. 152.45 s [vector] findIndex: OK
  11129. 152.45 s [vector] +++ OK, passed 100 tests.
  11130. 152.45 s [vector] findIndexR: OK
  11131. 152.45 s [vector] +++ OK, passed 100 tests.
  11132. 152.45 s [vector] findIndices: OK
  11133. 152.45 s [vector] +++ OK, passed 100 tests.
  11134. 152.45 s [vector] elemIndex: OK
  11135. 152.45 s [vector] +++ OK, passed 100 tests.
  11136. 152.45 s [vector] elemIndices: OK
  11137. 152.45 s [vector] +++ OK, passed 100 tests.
  11138. 152.46 s [vector] foldl: OK
  11139. 152.46 s [vector] +++ OK, passed 100 tests.
  11140. 152.46 s [vector] foldl1: OK
  11141. 152.46 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11142. 152.46 s [vector] foldl': OK
  11143. 152.46 s [vector] +++ OK, passed 100 tests.
  11144. 152.46 s [vector] foldl1': OK
  11145. 152.46 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11146. 152.46 s [vector] foldr: OK
  11147. 152.46 s [vector] +++ OK, passed 100 tests.
  11148. 152.46 s [vector] foldr1: OK
  11149. 152.47 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11150. 152.47 s [vector] foldr': OK
  11151. 152.47 s [vector] +++ OK, passed 100 tests.
  11152. 152.47 s [vector] foldr1': OK
  11153. 152.47 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11154. 152.47 s [vector] ifoldl: OK
  11155. 152.48 s [vector] +++ OK, passed 100 tests.
  11156. 152.48 s [vector] ifoldl': OK
  11157. 152.48 s [vector] +++ OK, passed 100 tests.
  11158. 152.48 s [vector] ifoldr: OK
  11159. 152.48 s [vector] +++ OK, passed 100 tests.
  11160. 152.48 s [vector] ifoldr': OK
  11161. 152.48 s [vector] +++ OK, passed 100 tests.
  11162. 152.48 s [vector] ifoldM: OK
  11163. 152.50 s [vector] +++ OK, passed 100 tests.
  11164. 152.50 s [vector] ifoldM': OK
  11165. 152.50 s [vector] +++ OK, passed 100 tests.
  11166. 152.50 s [vector] ifoldM_: OK (0.01s)
  11167. 152.50 s [vector] +++ OK, passed 100 tests.
  11168. 152.51 s [vector] ifoldM'_: OK (0.01s)
  11169. 152.51 s [vector] +++ OK, passed 100 tests.
  11170. 152.51 s [vector] all: OK
  11171. 152.51 s [vector] +++ OK, passed 100 tests.
  11172. 152.51 s [vector] any: OK
  11173. 152.51 s [vector] +++ OK, passed 100 tests.
  11174. 152.52 s [vector] prescanl: OK
  11175. 152.52 s [vector] +++ OK, passed 100 tests.
  11176. 152.52 s [vector] prescanl': OK
  11177. 152.52 s [vector] +++ OK, passed 100 tests.
  11178. 152.52 s [vector] postscanl: OK
  11179. 152.52 s [vector] +++ OK, passed 100 tests.
  11180. 152.52 s [vector] postscanl': OK
  11181. 152.52 s [vector] +++ OK, passed 100 tests.
  11182. 152.53 s [vector] scanl: OK
  11183. 152.53 s [vector] +++ OK, passed 100 tests.
  11184. 152.53 s [vector] scanl': OK
  11185. 152.53 s [vector] +++ OK, passed 100 tests.
  11186. 152.53 s [vector] scanl1: OK
  11187. 152.53 s [vector] +++ OK, passed 100 tests.
  11188. 152.53 s [vector] scanl1': OK
  11189. 152.53 s [vector] +++ OK, passed 100 tests.
  11190. 152.53 s [vector] iscanl: OK
  11191. 152.54 s [vector] +++ OK, passed 100 tests.
  11192. 152.54 s [vector] iscanl': OK
  11193. 152.54 s [vector] +++ OK, passed 100 tests.
  11194. 152.54 s [vector] prescanr: OK
  11195. 152.54 s [vector] +++ OK, passed 100 tests.
  11196. 152.54 s [vector] prescanr': OK
  11197. 152.54 s [vector] +++ OK, passed 100 tests.
  11198. 152.54 s [vector] postscanr: OK
  11199. 152.55 s [vector] +++ OK, passed 100 tests.
  11200. 152.55 s [vector] postscanr': OK
  11201. 152.55 s [vector] +++ OK, passed 100 tests.
  11202. 152.55 s [vector] scanr: OK
  11203. 152.55 s [vector] +++ OK, passed 100 tests.
  11204. 152.55 s [vector] scanr': OK
  11205. 152.55 s [vector] +++ OK, passed 100 tests.
  11206. 152.55 s [vector] scanr1: OK
  11207. 152.55 s [vector] +++ OK, passed 100 tests.
  11208. 152.55 s [vector] scanr1': OK
  11209. 152.56 s [vector] +++ OK, passed 100 tests.
  11210. 152.56 s [vector] iscanr: OK
  11211. 152.56 s [vector] +++ OK, passed 100 tests.
  11212. 152.56 s [vector] iscanr': OK
  11213. 152.56 s [vector] +++ OK, passed 100 tests.
  11214. 152.56 s [vector] mut_read: OK
  11215. 152.56 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11216. 152.56 s [vector] mut_write: OK
  11217. 152.56 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11218. 152.56 s [vector] mut_modify: OK
  11219. 152.56 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11220. 152.57 s [vector] mut_generate: OK
  11221. 152.57 s [vector] +++ OK, passed 100 tests.
  11222. 152.58 s [vector] mut_generateM: OK
  11223. 152.58 s [vector] +++ OK, passed 100 tests.
  11224. 152.60 s [vector] mut_mapM_: OK (0.01s)
  11225. 152.60 s [vector] +++ OK, passed 100 tests.
  11226. 152.61 s [vector] mut_imapM_: OK (0.02s)
  11227. 152.62 s [vector] +++ OK, passed 100 tests.
  11228. 152.62 s [vector] mut_forM_: OK (0.01s)
  11229. 152.62 s [vector] +++ OK, passed 100 tests.
  11230. 152.63 s [vector] mut_iforM_: OK (0.01s)
  11231. 152.63 s [vector] +++ OK, passed 100 tests.
  11232. 152.63 s [vector] mut_foldr: OK
  11233. 152.63 s [vector] +++ OK, passed 100 tests.
  11234. 152.63 s [vector] mut_foldr': OK
  11235. 152.63 s [vector] +++ OK, passed 100 tests.
  11236. 152.63 s [vector] mut_foldl: OK
  11237. 152.63 s [vector] +++ OK, passed 100 tests.
  11238. 152.63 s [vector] mut_foldl': OK
  11239. 152.64 s [vector] +++ OK, passed 100 tests.
  11240. 152.64 s [vector] mut_ifoldr: OK
  11241. 152.64 s [vector] +++ OK, passed 100 tests.
  11242. 152.64 s [vector] mut_ifoldr': OK
  11243. 152.64 s [vector] +++ OK, passed 100 tests.
  11244. 152.64 s [vector] mut_ifoldl: OK
  11245. 152.64 s [vector] +++ OK, passed 100 tests.
  11246. 152.64 s [vector] mut_ifoldl': OK
  11247. 152.64 s [vector] +++ OK, passed 100 tests.
  11248. 152.65 s [vector] mut_foldM: OK
  11249. 152.65 s [vector] +++ OK, passed 100 tests.
  11250. 152.65 s [vector] mut_foldM': OK
  11251. 152.65 s [vector] +++ OK, passed 100 tests.
  11252. 152.65 s [vector] mut_foldrM: OK
  11253. 152.65 s [vector] +++ OK, passed 100 tests.
  11254. 152.65 s [vector] mut_foldrM': OK
  11255. 152.65 s [vector] +++ OK, passed 100 tests.
  11256. 152.66 s [vector] mut_ifoldM: OK
  11257. 152.66 s [vector] +++ OK, passed 100 tests.
  11258. 152.66 s [vector] mut_ifoldM': OK
  11259. 152.66 s [vector] +++ OK, passed 100 tests.
  11260. 152.66 s [vector] mut_ifoldrM: OK
  11261. 152.66 s [vector] +++ OK, passed 100 tests.
  11262. 152.66 s [vector] mut_ifoldrM': OK
  11263. 152.66 s [vector] +++ OK, passed 100 tests.
  11264. 152.66 s [vector] compare: OK
  11265. 152.66 s [vector] +++ OK, passed 100 tests.
  11266. 152.66 s [vector] maximum: OK
  11267. 152.66 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11268. 152.66 s [vector] minimum: OK
  11269. 152.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11270. 152.66 s [vector] minIndex: OK
  11271. 152.66 s [vector] +++ OK, passed 100 tests; 25 discarded.
  11272. 152.66 s [vector] maxIndex: OK
  11273. 152.66 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11274. 152.66 s [vector] maximumBy: OK
  11275. 152.66 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11276. 152.66 s [vector] minimumBy: OK
  11277. 152.66 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11278. 152.66 s [vector] maximumOn: OK
  11279. 152.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11280. 152.66 s [vector] minimumOn: OK
  11281. 152.66 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11282. 152.66 s [vector] maxIndexBy: OK
  11283. 152.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11284. 152.67 s [vector] minIndexBy: OK
  11285. 152.67 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11286. 152.67 s [vector] ListFirstMaxIndexWins: OK
  11287. 152.67 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11288. 152.67 s [vector] FalseListFirstMaxIndexWins: OK
  11289. 152.67 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  11290. 152.67 s [vector] []
  11291. 152.67 s [vector] zip: OK
  11292. 152.67 s [vector] +++ OK, passed 100 tests.
  11293. 152.67 s [vector] zip3: OK
  11294. 152.67 s [vector] +++ OK, passed 100 tests.
  11295. 152.67 s [vector] unzip: OK
  11296. 152.67 s [vector] +++ OK, passed 100 tests.
  11297. 152.67 s [vector] unzip3: OK
  11298. 152.67 s [vector] +++ OK, passed 100 tests.
  11299. 152.67 s [vector] indexed: OK
  11300. 152.67 s [vector] +++ OK, passed 100 tests.
  11301. 152.67 s [vector] update: OK
  11302. 152.67 s [vector] +++ OK, passed 100 tests.
  11303. 152.67 s [vector] mempty: OK
  11304. 152.67 s [vector] +++ OK, passed 100 tests.
  11305. 152.67 s [vector] mappend: OK
  11306. 152.68 s [vector] +++ OK, passed 100 tests.
  11307. 152.69 s [vector] mconcat: OK (0.01s)
  11308. 152.69 s [vector] +++ OK, passed 100 tests.
  11309. 152.69 s [vector] glength: OK
  11310. 152.69 s [vector] +++ OK, passed 100 tests.
  11311. 152.69 s [vector] sum: OK
  11312. 152.69 s [vector] +++ OK, passed 100 tests.
  11313. 152.69 s [vector] product: OK
  11314. 152.69 s [vector] +++ OK, passed 100 tests.
  11315. 152.69 s [vector] enumFromN: OK
  11316. 152.69 s [vector] +++ OK, passed 100 tests.
  11317. 152.69 s [vector] enumFromThenN: OK
  11318. 152.69 s [vector] +++ OK, passed 100 tests.
  11319. 152.69 s [vector] enumFromTo: OK
  11320. 152.69 s [vector] +++ OK, passed 100 tests.
  11321. 152.69 s [vector] enumFromThenTo: OK
  11322. 152.69 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11323. 152.69 s [vector] (Float)
  11324. 152.69 s [vector] fromList.toList == id: OK
  11325. 152.69 s [vector] +++ OK, passed 100 tests.
  11326. 152.69 s [vector] toList.fromList == id: OK
  11327. 152.69 s [vector] +++ OK, passed 100 tests.
  11328. 152.69 s [vector] unstream.stream == id: OK
  11329. 152.69 s [vector] +++ OK, passed 100 tests.
  11330. 152.69 s [vector] stream.unstream == id: OK
  11331. 152.69 s [vector] +++ OK, passed 100 tests.
  11332. 152.69 s [vector] eq: OK
  11333. 152.69 s [vector] +++ OK, passed 100 tests.
  11334. 152.69 s [vector] length: OK
  11335. 152.70 s [vector] +++ OK, passed 100 tests.
  11336. 152.70 s [vector] null: OK
  11337. 152.70 s [vector] +++ OK, passed 100 tests.
  11338. 152.70 s [vector] index: OK
  11339. 152.70 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11340. 152.70 s [vector] safeIndex: OK
  11341. 152.70 s [vector] +++ OK, passed 100 tests.
  11342. 152.70 s [vector] head: OK
  11343. 152.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11344. 152.70 s [vector] last: OK
  11345. 152.70 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11346. 152.70 s [vector] unsafeIndex: OK
  11347. 152.70 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11348. 152.70 s [vector] unsafeHead: OK
  11349. 152.70 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11350. 152.70 s [vector] unsafeLast: OK
  11351. 152.70 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11352. 152.70 s [vector] slice: OK
  11353. 152.70 s [vector] +++ OK, passed 100 tests.
  11354. 152.70 s [vector] init: OK
  11355. 152.70 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11356. 152.70 s [vector] tail: OK
  11357. 152.70 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11358. 152.70 s [vector] take: OK
  11359. 152.70 s [vector] +++ OK, passed 100 tests.
  11360. 152.70 s [vector] drop: OK
  11361. 152.70 s [vector] +++ OK, passed 100 tests.
  11362. 152.70 s [vector] splitAt: OK
  11363. 152.70 s [vector] +++ OK, passed 100 tests.
  11364. 152.70 s [vector] empty: OK
  11365. 152.70 s [vector] +++ OK, passed 100 tests.
  11366. 152.70 s [vector] singleton: OK
  11367. 152.70 s [vector] +++ OK, passed 100 tests.
  11368. 152.71 s [vector] replicate: OK
  11369. 152.72 s [vector] +++ OK, passed 100 tests.
  11370. 152.72 s [vector] generate: OK
  11371. 152.72 s [vector] +++ OK, passed 100 tests.
  11372. 152.72 s [vector] iterateN: OK
  11373. 152.72 s [vector] +++ OK, passed 100 tests.
  11374. 152.74 s [vector] iterateNM: OK (0.02s)
  11375. 152.74 s [vector] +++ OK, passed 100 tests.
  11376. 152.76 s [vector] generateM: OK (0.03s)
  11377. 152.76 s [vector] +++ OK, passed 100 tests.
  11378. 152.78 s [vector] replicateM: OK (0.02s)
  11379. 152.78 s [vector] +++ OK, passed 100 tests.
  11380. 152.78 s [vector] create: OK
  11381. 152.78 s [vector] +++ OK, passed 100 tests.
  11382. 152.78 s [vector] createT: OK
  11383. 152.78 s [vector] +++ OK, passed 100 tests.
  11384. 152.78 s [vector] unfoldr: OK
  11385. 152.78 s [vector] +++ OK, passed 100 tests.
  11386. 152.78 s [vector] unfoldrN: OK
  11387. 152.78 s [vector] +++ OK, passed 100 tests.
  11388. 152.78 s [vector] unfoldrExactN: OK
  11389. 152.78 s [vector] +++ OK, passed 100 tests.
  11390. 152.78 s [vector] unfoldrM: OK
  11391. 152.78 s [vector] +++ OK, passed 100 tests.
  11392. 152.78 s [vector] unfoldrNM: OK
  11393. 152.78 s [vector] +++ OK, passed 100 tests.
  11394. 152.81 s [vector] unfoldrExactNM: OK (0.02s)
  11395. 152.82 s [vector] +++ OK, passed 100 tests.
  11396. 152.82 s [vector] constructN: OK
  11397. 152.82 s [vector] +++ OK, passed 100 tests.
  11398. 152.82 s [vector] constructrN: OK
  11399. 152.82 s [vector] +++ OK, passed 100 tests.
  11400. 152.82 s [vector] cons: OK
  11401. 152.82 s [vector] +++ OK, passed 100 tests.
  11402. 152.82 s [vector] snoc: OK
  11403. 152.82 s [vector] +++ OK, passed 100 tests.
  11404. 152.84 s [vector] append: OK
  11405. 152.84 s [vector] +++ OK, passed 100 tests.
  11406. 152.84 s [vector] concat: OK (0.02s)
  11407. 152.84 s [vector] +++ OK, passed 100 tests.
  11408. 152.84 s [vector] force: OK
  11409. 152.84 s [vector] +++ OK, passed 100 tests.
  11410. 152.85 s [vector] upd: OK
  11411. 152.85 s [vector] +++ OK, passed 100 tests.
  11412. 152.85 s [vector] accum: OK
  11413. 152.85 s [vector] +++ OK, passed 100 tests.
  11414. 152.86 s [vector] reverse: OK
  11415. 152.86 s [vector] +++ OK, passed 100 tests.
  11416. 152.86 s [vector] backpermute: OK
  11417. 152.86 s [vector] +++ OK, passed 100 tests.
  11418. 152.86 s [vector] map: OK
  11419. 152.86 s [vector] +++ OK, passed 100 tests.
  11420. 152.87 s [vector] imap: OK
  11421. 152.87 s [vector] +++ OK, passed 100 tests.
  11422. 152.87 s [vector] concatMap: OK
  11423. 152.87 s [vector] +++ OK, passed 100 tests.
  11424. 152.88 s [vector] mapM: OK
  11425. 152.88 s [vector] +++ OK, passed 100 tests.
  11426. 152.90 s [vector] mapM_: OK (0.03s)
  11427. 152.90 s [vector] +++ OK, passed 100 tests.
  11428. 152.90 s [vector] forM: OK
  11429. 152.90 s [vector] +++ OK, passed 100 tests.
  11430. 152.94 s [vector] forM_: OK (0.03s)
  11431. 152.94 s [vector] +++ OK, passed 100 tests.
  11432. 152.94 s [vector] imapM: OK
  11433. 152.94 s [vector] +++ OK, passed 100 tests.
  11434. 152.97 s [vector] imapM_: OK (0.03s)
  11435. 152.97 s [vector] +++ OK, passed 100 tests.
  11436. 152.98 s [vector] zipWith: OK
  11437. 152.98 s [vector] +++ OK, passed 100 tests.
  11438. 152.98 s [vector] zipWith3: OK
  11439. 152.98 s [vector] +++ OK, passed 100 tests.
  11440. 152.99 s [vector] izipWith: OK
  11441. 152.99 s [vector] +++ OK, passed 100 tests.
  11442. 152.99 s [vector] izipWith3: OK
  11443. 152.99 s [vector] +++ OK, passed 100 tests.
  11444. 153.00 s [vector] izipWithM: OK
  11445. 153.00 s [vector] +++ OK, passed 100 tests.
  11446. 153.02 s [vector] izipWithM_: OK (0.02s)
  11447. 153.02 s [vector] +++ OK, passed 100 tests.
  11448. 153.04 s [vector] zipWithM: OK
  11449. 153.04 s [vector] +++ OK, passed 100 tests.
  11450. 153.05 s [vector] zipWithM_: OK (0.02s)
  11451. 153.06 s [vector] +++ OK, passed 100 tests.
  11452. 153.06 s [vector] filter: OK
  11453. 153.06 s [vector] +++ OK, passed 100 tests.
  11454. 153.06 s [vector] ifilter: OK
  11455. 153.06 s [vector] +++ OK, passed 100 tests.
  11456. 153.09 s [vector] filterM: OK (0.04s)
  11457. 153.09 s [vector] +++ OK, passed 100 tests.
  11458. 153.09 s [vector] uniq: OK
  11459. 153.09 s [vector] +++ OK, passed 100 tests.
  11460. 153.09 s [vector] mapMaybe: OK
  11461. 153.09 s [vector] +++ OK, passed 100 tests.
  11462. 153.10 s [vector] imapMaybe: OK
  11463. 153.10 s [vector] +++ OK, passed 100 tests.
  11464. 153.10 s [vector] takeWhile: OK
  11465. 153.10 s [vector] +++ OK, passed 100 tests.
  11466. 153.10 s [vector] dropWhile: OK
  11467. 153.10 s [vector] +++ OK, passed 100 tests.
  11468. 153.10 s [vector] partition: OK
  11469. 153.10 s [vector] +++ OK, passed 100 tests.
  11470. 153.11 s [vector] partitionWith: OK
  11471. 153.11 s [vector] +++ OK, passed 100 tests.
  11472. 153.11 s [vector] span: OK
  11473. 153.11 s [vector] +++ OK, passed 100 tests.
  11474. 153.11 s [vector] break: OK
  11475. 153.11 s [vector] +++ OK, passed 100 tests.
  11476. 153.11 s [vector] spanR: OK
  11477. 153.11 s [vector] +++ OK, passed 100 tests.
  11478. 153.12 s [vector] breakR: OK
  11479. 153.12 s [vector] +++ OK, passed 100 tests.
  11480. 153.12 s [vector] groupBy: OK
  11481. 153.12 s [vector] +++ OK, passed 100 tests.
  11482. 153.12 s [vector] elem: OK
  11483. 153.12 s [vector] +++ OK, passed 100 tests.
  11484. 153.12 s [vector] notElem: OK
  11485. 153.12 s [vector] +++ OK, passed 100 tests.
  11486. 153.12 s [vector] find: OK
  11487. 153.12 s [vector] +++ OK, passed 100 tests.
  11488. 153.12 s [vector] findIndex: OK
  11489. 153.12 s [vector] +++ OK, passed 100 tests.
  11490. 153.12 s [vector] findIndexR: OK
  11491. 153.12 s [vector] +++ OK, passed 100 tests.
  11492. 153.12 s [vector] findIndices: OK
  11493. 153.13 s [vector] +++ OK, passed 100 tests.
  11494. 153.14 s [vector] elemIndex: OK
  11495. 153.14 s [vector] +++ OK, passed 100 tests.
  11496. 153.14 s [vector] elemIndices: OK
  11497. 153.14 s [vector] +++ OK, passed 100 tests.
  11498. 153.15 s [vector] foldl: OK
  11499. 153.15 s [vector] +++ OK, passed 100 tests.
  11500. 153.16 s [vector] foldl1: OK
  11501. 153.17 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11502. 153.18 s [vector] foldl': OK
  11503. 153.18 s [vector] +++ OK, passed 100 tests.
  11504. 153.18 s [vector] foldl1': OK
  11505. 153.18 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11506. 153.18 s [vector] foldr: OK
  11507. 153.18 s [vector] +++ OK, passed 100 tests.
  11508. 153.18 s [vector] foldr1: OK
  11509. 153.18 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11510. 153.20 s [vector] foldr': OK
  11511. 153.20 s [vector] +++ OK, passed 100 tests.
  11512. 153.20 s [vector] foldr1': OK
  11513. 153.20 s [vector] +++ OK, passed 100 tests; 12 discarded.
  11514. 153.20 s [vector] ifoldl: OK
  11515. 153.21 s [vector] +++ OK, passed 100 tests.
  11516. 153.22 s [vector] ifoldl': OK
  11517. 153.22 s [vector] +++ OK, passed 100 tests.
  11518. 153.22 s [vector] ifoldr: OK
  11519. 153.22 s [vector] +++ OK, passed 100 tests.
  11520. 153.22 s [vector] ifoldr': OK
  11521. 153.22 s [vector] +++ OK, passed 100 tests.
  11522. 153.22 s [vector] ifoldM: OK
  11523. 153.22 s [vector] +++ OK, passed 100 tests.
  11524. 153.23 s [vector] ifoldM': OK
  11525. 153.23 s [vector] +++ OK, passed 100 tests.
  11526. 153.24 s [vector] ifoldM_: OK (0.03s)
  11527. 153.24 s [vector] +++ OK, passed 100 tests.
  11528. 153.27 s [vector] ifoldM'_: OK (0.03s)
  11529. 153.27 s [vector] +++ OK, passed 100 tests.
  11530. 153.27 s [vector] all: OK
  11531. 153.28 s [vector] +++ OK, passed 100 tests.
  11532. 153.28 s [vector] any: OK
  11533. 153.29 s [vector] +++ OK, passed 100 tests.
  11534. 153.29 s [vector] prescanl: OK
  11535. 153.30 s [vector] +++ OK, passed 100 tests.
  11536. 153.30 s [vector] prescanl': OK
  11537. 153.30 s [vector] +++ OK, passed 100 tests.
  11538. 153.30 s [vector] postscanl: OK
  11539. 153.30 s [vector] +++ OK, passed 100 tests.
  11540. 153.30 s [vector] postscanl': OK
  11541. 153.30 s [vector] +++ OK, passed 100 tests.
  11542. 153.31 s [vector] scanl: OK
  11543. 153.31 s [vector] +++ OK, passed 100 tests.
  11544. 153.31 s [vector] scanl': OK
  11545. 153.31 s [vector] +++ OK, passed 100 tests.
  11546. 153.31 s [vector] scanl1: OK
  11547. 153.32 s [vector] +++ OK, passed 100 tests.
  11548. 153.32 s [vector] scanl1': OK
  11549. 153.32 s [vector] +++ OK, passed 100 tests.
  11550. 153.33 s [vector] iscanl: OK
  11551. 153.34 s [vector] +++ OK, passed 100 tests.
  11552. 153.34 s [vector] iscanl': OK
  11553. 153.34 s [vector] +++ OK, passed 100 tests.
  11554. 153.34 s [vector] prescanr: OK
  11555. 153.34 s [vector] +++ OK, passed 100 tests.
  11556. 153.35 s [vector] prescanr': OK
  11557. 153.36 s [vector] +++ OK, passed 100 tests.
  11558. 153.36 s [vector] postscanr: OK
  11559. 153.36 s [vector] +++ OK, passed 100 tests.
  11560. 153.36 s [vector] postscanr': OK
  11561. 153.36 s [vector] +++ OK, passed 100 tests.
  11562. 153.36 s [vector] scanr: OK
  11563. 153.36 s [vector] +++ OK, passed 100 tests.
  11564. 153.37 s [vector] scanr': OK
  11565. 153.37 s [vector] +++ OK, passed 100 tests.
  11566. 153.38 s [vector] scanr1: OK
  11567. 153.38 s [vector] +++ OK, passed 100 tests.
  11568. 153.38 s [vector] scanr1': OK
  11569. 153.38 s [vector] +++ OK, passed 100 tests.
  11570. 153.39 s [vector] iscanr: OK
  11571. 153.39 s [vector] +++ OK, passed 100 tests.
  11572. 153.40 s [vector] iscanr': OK
  11573. 153.40 s [vector] +++ OK, passed 100 tests.
  11574. 153.40 s [vector] mut_read: OK
  11575. 153.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11576. 153.42 s [vector] mut_write: OK
  11577. 153.42 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11578. 153.42 s [vector] mut_modify: OK
  11579. 153.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11580. 153.42 s [vector] mut_generate: OK
  11581. 153.42 s [vector] +++ OK, passed 100 tests.
  11582. 153.42 s [vector] mut_generateM: OK (0.01s)
  11583. 153.42 s [vector] +++ OK, passed 100 tests.
  11584. 153.44 s [vector] mut_mapM_: OK (0.02s)
  11585. 153.44 s [vector] +++ OK, passed 100 tests.
  11586. 153.48 s [vector] mut_imapM_: OK (0.03s)
  11587. 153.48 s [vector] +++ OK, passed 100 tests.
  11588. 153.50 s [vector] mut_forM_: OK (0.03s)
  11589. 153.50 s [vector] +++ OK, passed 100 tests.
  11590. 153.53 s [vector] mut_iforM_: OK (0.03s)
  11591. 153.53 s [vector] +++ OK, passed 100 tests.
  11592. 153.54 s [vector] mut_foldr: OK
  11593. 153.55 s [vector] +++ OK, passed 100 tests.
  11594. 153.56 s [vector] mut_foldr': OK
  11595. 153.56 s [vector] +++ OK, passed 100 tests.
  11596. 153.56 s [vector] mut_foldl: OK
  11597. 153.57 s [vector] +++ OK, passed 100 tests.
  11598. 153.58 s [vector] mut_foldl': OK
  11599. 153.58 s [vector] +++ OK, passed 100 tests.
  11600. 153.58 s [vector] mut_ifoldr: OK (0.01s)
  11601. 153.58 s [vector] +++ OK, passed 100 tests.
  11602. 153.58 s [vector] mut_ifoldr': OK
  11603. 153.58 s [vector] +++ OK, passed 100 tests.
  11604. 153.58 s [vector] mut_ifoldl: OK
  11605. 153.58 s [vector] +++ OK, passed 100 tests.
  11606. 153.58 s [vector] mut_ifoldl': OK
  11607. 153.59 s [vector] +++ OK, passed 100 tests.
  11608. 153.59 s [vector] mut_foldM: OK
  11609. 153.59 s [vector] +++ OK, passed 100 tests.
  11610. 153.59 s [vector] mut_foldM': OK
  11611. 153.59 s [vector] +++ OK, passed 100 tests.
  11612. 153.60 s [vector] mut_foldrM: OK
  11613. 153.60 s [vector] +++ OK, passed 100 tests.
  11614. 153.60 s [vector] mut_foldrM': OK
  11615. 153.61 s [vector] +++ OK, passed 100 tests.
  11616. 153.62 s [vector] mut_ifoldM: OK
  11617. 153.62 s [vector] +++ OK, passed 100 tests.
  11618. 153.62 s [vector] mut_ifoldM': OK
  11619. 153.62 s [vector] +++ OK, passed 100 tests.
  11620. 153.62 s [vector] mut_ifoldrM: OK
  11621. 153.62 s [vector] +++ OK, passed 100 tests.
  11622. 153.62 s [vector] mut_ifoldrM': OK
  11623. 153.62 s [vector] +++ OK, passed 100 tests.
  11624. 153.63 s [vector] compare: OK
  11625. 153.63 s [vector] +++ OK, passed 100 tests.
  11626. 153.63 s [vector] maximum: OK
  11627. 153.63 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11628. 153.63 s [vector] minimum: OK
  11629. 153.63 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11630. 153.63 s [vector] minIndex: OK
  11631. 153.63 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11632. 153.63 s [vector] maxIndex: OK
  11633. 153.63 s [vector] +++ OK, passed 100 tests; 20 discarded.
  11634. 153.63 s [vector] maximumBy: OK
  11635. 153.63 s [vector] +++ OK, passed 100 tests; 21 discarded.
  11636. 153.63 s [vector] minimumBy: OK
  11637. 153.63 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11638. 153.63 s [vector] maximumOn: OK
  11639. 153.63 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11640. 153.63 s [vector] minimumOn: OK
  11641. 153.63 s [vector] +++ OK, passed 100 tests; 23 discarded.
  11642. 153.63 s [vector] maxIndexBy: OK
  11643. 153.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11644. 153.63 s [vector] minIndexBy: OK
  11645. 153.63 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11646. 153.63 s [vector] ListFirstMaxIndexWins: OK
  11647. 153.63 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11648. 153.63 s [vector] FalseListFirstMaxIndexWins: OK
  11649. 153.63 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  11650. 153.63 s [vector] []
  11651. 153.64 s [vector] zip: OK
  11652. 153.64 s [vector] +++ OK, passed 100 tests.
  11653. 153.64 s [vector] zip3: OK
  11654. 153.64 s [vector] +++ OK, passed 100 tests.
  11655. 153.64 s [vector] unzip: OK
  11656. 153.64 s [vector] +++ OK, passed 100 tests.
  11657. 153.64 s [vector] unzip3: OK
  11658. 153.64 s [vector] +++ OK, passed 100 tests.
  11659. 153.64 s [vector] indexed: OK
  11660. 153.64 s [vector] +++ OK, passed 100 tests.
  11661. 153.64 s [vector] update: OK
  11662. 153.64 s [vector] +++ OK, passed 100 tests.
  11663. 153.64 s [vector] mempty: OK
  11664. 153.64 s [vector] +++ OK, passed 100 tests.
  11665. 153.66 s [vector] mappend: OK
  11666. 153.66 s [vector] +++ OK, passed 100 tests.
  11667. 153.67 s [vector] mconcat: OK (0.02s)
  11668. 153.67 s [vector] +++ OK, passed 100 tests.
  11669. 153.67 s [vector] glength: OK
  11670. 153.67 s [vector] +++ OK, passed 100 tests.
  11671. 153.67 s [vector] sum: OK
  11672. 153.67 s [vector] +++ OK, passed 100 tests.
  11673. 153.67 s [vector] product: OK
  11674. 153.67 s [vector] +++ OK, passed 100 tests.
  11675. 153.67 s [vector] enumFromN: OK
  11676. 153.67 s [vector] +++ OK, passed 100 tests.
  11677. 153.67 s [vector] enumFromThenN: OK
  11678. 153.67 s [vector] +++ OK, passed 100 tests.
  11679. 153.67 s [vector] enumFromTo: OK
  11680. 153.67 s [vector] +++ OK, passed 100 tests.
  11681. 153.67 s [vector] enumFromThenTo: OK
  11682. 153.67 s [vector] +++ OK, passed 100 tests; 2 discarded.
  11683. 153.67 s [vector] (Double)
  11684. 153.67 s [vector] fromList.toList == id: OK
  11685. 153.67 s [vector] +++ OK, passed 100 tests.
  11686. 153.67 s [vector] toList.fromList == id: OK
  11687. 153.67 s [vector] +++ OK, passed 100 tests.
  11688. 153.67 s [vector] unstream.stream == id: OK
  11689. 153.67 s [vector] +++ OK, passed 100 tests.
  11690. 153.67 s [vector] stream.unstream == id: OK
  11691. 153.68 s [vector] +++ OK, passed 100 tests.
  11692. 153.68 s [vector] eq: OK
  11693. 153.68 s [vector] +++ OK, passed 100 tests.
  11694. 153.68 s [vector] length: OK
  11695. 153.68 s [vector] +++ OK, passed 100 tests.
  11696. 153.68 s [vector] null: OK
  11697. 153.68 s [vector] +++ OK, passed 100 tests.
  11698. 153.68 s [vector] index: OK
  11699. 153.68 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11700. 153.68 s [vector] safeIndex: OK
  11701. 153.68 s [vector] +++ OK, passed 100 tests.
  11702. 153.68 s [vector] head: OK
  11703. 153.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11704. 153.68 s [vector] last: OK
  11705. 153.68 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11706. 153.68 s [vector] unsafeIndex: OK
  11707. 153.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11708. 153.68 s [vector] unsafeHead: OK
  11709. 153.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11710. 153.68 s [vector] unsafeLast: OK
  11711. 153.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11712. 153.68 s [vector] slice: OK
  11713. 153.68 s [vector] +++ OK, passed 100 tests.
  11714. 153.68 s [vector] init: OK
  11715. 153.68 s [vector] +++ OK, passed 100 tests; 22 discarded.
  11716. 153.68 s [vector] tail: OK
  11717. 153.68 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11718. 153.68 s [vector] take: OK
  11719. 153.68 s [vector] +++ OK, passed 100 tests.
  11720. 153.69 s [vector] drop: OK
  11721. 153.69 s [vector] +++ OK, passed 100 tests.
  11722. 153.69 s [vector] splitAt: OK
  11723. 153.69 s [vector] +++ OK, passed 100 tests.
  11724. 153.69 s [vector] empty: OK
  11725. 153.69 s [vector] +++ OK, passed 100 tests.
  11726. 153.69 s [vector] singleton: OK
  11727. 153.69 s [vector] +++ OK, passed 100 tests.
  11728. 153.69 s [vector] replicate: OK
  11729. 153.69 s [vector] +++ OK, passed 100 tests.
  11730. 153.69 s [vector] generate: OK
  11731. 153.69 s [vector] +++ OK, passed 100 tests.
  11732. 153.70 s [vector] iterateN: OK
  11733. 153.70 s [vector] +++ OK, passed 100 tests.
  11734. 153.72 s [vector] iterateNM: OK (0.02s)
  11735. 153.72 s [vector] +++ OK, passed 100 tests.
  11736. 153.76 s [vector] generateM: OK (0.04s)
  11737. 153.76 s [vector] +++ OK, passed 100 tests.
  11738. 153.76 s [vector] replicateM: OK (0.01s)
  11739. 153.76 s [vector] +++ OK, passed 100 tests.
  11740. 153.76 s [vector] create: OK
  11741. 153.76 s [vector] +++ OK, passed 100 tests.
  11742. 153.76 s [vector] createT: OK
  11743. 153.76 s [vector] +++ OK, passed 100 tests.
  11744. 153.76 s [vector] unfoldr: OK
  11745. 153.77 s [vector] +++ OK, passed 100 tests.
  11746. 153.77 s [vector] unfoldrN: OK
  11747. 153.77 s [vector] +++ OK, passed 100 tests.
  11748. 153.77 s [vector] unfoldrExactN: OK
  11749. 153.77 s [vector] +++ OK, passed 100 tests.
  11750. 153.77 s [vector] unfoldrM: OK
  11751. 153.77 s [vector] +++ OK, passed 100 tests.
  11752. 153.77 s [vector] unfoldrNM: OK
  11753. 153.77 s [vector] +++ OK, passed 100 tests.
  11754. 153.80 s [vector] unfoldrExactNM: OK (0.01s)
  11755. 153.80 s [vector] +++ OK, passed 100 tests.
  11756. 153.80 s [vector] constructN: OK (0.01s)
  11757. 153.80 s [vector] +++ OK, passed 100 tests.
  11758. 153.81 s [vector] constructrN: OK
  11759. 153.81 s [vector] +++ OK, passed 100 tests.
  11760. 153.81 s [vector] cons: OK
  11761. 153.81 s [vector] +++ OK, passed 100 tests.
  11762. 153.81 s [vector] snoc: OK
  11763. 153.81 s [vector] +++ OK, passed 100 tests.
  11764. 153.81 s [vector] append: OK
  11765. 153.82 s [vector] +++ OK, passed 100 tests.
  11766. 153.83 s [vector] concat: OK (0.02s)
  11767. 153.83 s [vector] +++ OK, passed 100 tests.
  11768. 153.83 s [vector] force: OK
  11769. 153.83 s [vector] +++ OK, passed 100 tests.
  11770. 153.83 s [vector] upd: OK
  11771. 153.83 s [vector] +++ OK, passed 100 tests.
  11772. 153.85 s [vector] accum: OK (0.01s)
  11773. 153.85 s [vector] +++ OK, passed 100 tests.
  11774. 153.85 s [vector] reverse: OK
  11775. 153.85 s [vector] +++ OK, passed 100 tests.
  11776. 153.85 s [vector] backpermute: OK
  11777. 153.85 s [vector] +++ OK, passed 100 tests.
  11778. 153.85 s [vector] map: OK
  11779. 153.86 s [vector] +++ OK, passed 100 tests.
  11780. 153.87 s [vector] imap: OK
  11781. 153.87 s [vector] +++ OK, passed 100 tests.
  11782. 153.87 s [vector] concatMap: OK
  11783. 153.87 s [vector] +++ OK, passed 100 tests.
  11784. 153.87 s [vector] mapM: OK
  11785. 153.87 s [vector] +++ OK, passed 100 tests.
  11786. 153.91 s [vector] mapM_: OK (0.02s)
  11787. 153.92 s [vector] +++ OK, passed 100 tests.
  11788. 153.92 s [vector] forM: OK
  11789. 153.92 s [vector] +++ OK, passed 100 tests.
  11790. 153.94 s [vector] forM_: OK (0.03s)
  11791. 153.94 s [vector] +++ OK, passed 100 tests.
  11792. 153.96 s [vector] imapM: OK
  11793. 153.96 s [vector] +++ OK, passed 100 tests.
  11794. 153.98 s [vector] imapM_: OK (0.03s)
  11795. 153.98 s [vector] +++ OK, passed 100 tests.
  11796. 153.99 s [vector] zipWith: OK
  11797. 153.99 s [vector] +++ OK, passed 100 tests.
  11798. 153.99 s [vector] zipWith3: OK
  11799. 154.00 s [vector] +++ OK, passed 100 tests.
  11800. 154.00 s [vector] izipWith: OK
  11801. 154.00 s [vector] +++ OK, passed 100 tests.
  11802. 154.01 s [vector] izipWith3: OK
  11803. 154.02 s [vector] +++ OK, passed 100 tests.
  11804. 154.02 s [vector] izipWithM: OK
  11805. 154.02 s [vector] +++ OK, passed 100 tests.
  11806. 154.05 s [vector] izipWithM_: OK (0.03s)
  11807. 154.06 s [vector] +++ OK, passed 100 tests.
  11808. 154.06 s [vector] zipWithM: OK
  11809. 154.06 s [vector] +++ OK, passed 100 tests.
  11810. 154.08 s [vector] zipWithM_: OK (0.03s)
  11811. 154.08 s [vector] +++ OK, passed 100 tests.
  11812. 154.08 s [vector] filter: OK
  11813. 154.08 s [vector] +++ OK, passed 100 tests.
  11814. 154.08 s [vector] ifilter: OK
  11815. 154.08 s [vector] +++ OK, passed 100 tests.
  11816. 154.12 s [vector] filterM: OK (0.03s)
  11817. 154.12 s [vector] +++ OK, passed 100 tests.
  11818. 154.13 s [vector] uniq: OK
  11819. 154.13 s [vector] +++ OK, passed 100 tests.
  11820. 154.13 s [vector] mapMaybe: OK
  11821. 154.13 s [vector] +++ OK, passed 100 tests.
  11822. 154.13 s [vector] imapMaybe: OK
  11823. 154.13 s [vector] +++ OK, passed 100 tests.
  11824. 154.13 s [vector] takeWhile: OK
  11825. 154.13 s [vector] +++ OK, passed 100 tests.
  11826. 154.14 s [vector] dropWhile: OK
  11827. 154.14 s [vector] +++ OK, passed 100 tests.
  11828. 154.15 s [vector] partition: OK
  11829. 154.15 s [vector] +++ OK, passed 100 tests.
  11830. 154.15 s [vector] partitionWith: OK
  11831. 154.15 s [vector] +++ OK, passed 100 tests.
  11832. 154.15 s [vector] span: OK
  11833. 154.15 s [vector] +++ OK, passed 100 tests.
  11834. 154.15 s [vector] break: OK
  11835. 154.15 s [vector] +++ OK, passed 100 tests.
  11836. 154.15 s [vector] spanR: OK
  11837. 154.15 s [vector] +++ OK, passed 100 tests.
  11838. 154.15 s [vector] breakR: OK
  11839. 154.16 s [vector] +++ OK, passed 100 tests.
  11840. 154.16 s [vector] groupBy: OK
  11841. 154.16 s [vector] +++ OK, passed 100 tests.
  11842. 154.16 s [vector] elem: OK
  11843. 154.16 s [vector] +++ OK, passed 100 tests.
  11844. 154.16 s [vector] notElem: OK
  11845. 154.16 s [vector] +++ OK, passed 100 tests.
  11846. 154.16 s [vector] find: OK
  11847. 154.16 s [vector] +++ OK, passed 100 tests.
  11848. 154.16 s [vector] findIndex: OK
  11849. 154.16 s [vector] +++ OK, passed 100 tests.
  11850. 154.17 s [vector] findIndexR: OK
  11851. 154.17 s [vector] +++ OK, passed 100 tests.
  11852. 154.17 s [vector] findIndices: OK
  11853. 154.17 s [vector] +++ OK, passed 100 tests.
  11854. 154.17 s [vector] elemIndex: OK
  11855. 154.17 s [vector] +++ OK, passed 100 tests.
  11856. 154.18 s [vector] elemIndices: OK
  11857. 154.18 s [vector] +++ OK, passed 100 tests.
  11858. 154.18 s [vector] foldl: OK
  11859. 154.19 s [vector] +++ OK, passed 100 tests.
  11860. 154.20 s [vector] foldl1: OK
  11861. 154.20 s [vector] +++ OK, passed 100 tests; 19 discarded.
  11862. 154.20 s [vector] foldl': OK
  11863. 154.20 s [vector] +++ OK, passed 100 tests.
  11864. 154.22 s [vector] foldl1': OK (0.01s)
  11865. 154.22 s [vector] +++ OK, passed 100 tests; 25 discarded.
  11866. 154.22 s [vector] foldr: OK (0.01s)
  11867. 154.22 s [vector] +++ OK, passed 100 tests.
  11868. 154.24 s [vector] foldr1: OK (0.01s)
  11869. 154.24 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11870. 154.25 s [vector] foldr': OK (0.01s)
  11871. 154.26 s [vector] +++ OK, passed 100 tests.
  11872. 154.26 s [vector] foldr1': OK (0.01s)
  11873. 154.26 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11874. 154.28 s [vector] ifoldl: OK (0.01s)
  11875. 154.28 s [vector] +++ OK, passed 100 tests.
  11876. 154.28 s [vector] ifoldl': OK (0.01s)
  11877. 154.28 s [vector] +++ OK, passed 100 tests.
  11878. 154.29 s [vector] ifoldr: OK (0.01s)
  11879. 154.29 s [vector] +++ OK, passed 100 tests.
  11880. 154.30 s [vector] ifoldr': OK
  11881. 154.30 s [vector] +++ OK, passed 100 tests.
  11882. 154.32 s [vector] ifoldM: OK (0.01s)
  11883. 154.32 s [vector] +++ OK, passed 100 tests.
  11884. 154.34 s [vector] ifoldM': OK (0.01s)
  11885. 154.34 s [vector] +++ OK, passed 100 tests.
  11886. 154.36 s [vector] ifoldM_: OK (0.04s)
  11887. 154.36 s [vector] +++ OK, passed 100 tests.
  11888. 154.38 s [vector] ifoldM'_: OK (0.03s)
  11889. 154.38 s [vector] +++ OK, passed 100 tests.
  11890. 154.39 s [vector] all: OK
  11891. 154.39 s [vector] +++ OK, passed 100 tests.
  11892. 154.39 s [vector] any: OK
  11893. 154.39 s [vector] +++ OK, passed 100 tests.
  11894. 154.40 s [vector] prescanl: OK
  11895. 154.40 s [vector] +++ OK, passed 100 tests.
  11896. 154.42 s [vector] prescanl': OK (0.01s)
  11897. 154.42 s [vector] +++ OK, passed 100 tests.
  11898. 154.42 s [vector] postscanl: OK (0.01s)
  11899. 154.42 s [vector] +++ OK, passed 100 tests.
  11900. 154.44 s [vector] postscanl': OK (0.01s)
  11901. 154.44 s [vector] +++ OK, passed 100 tests.
  11902. 154.44 s [vector] scanl: OK (0.01s)
  11903. 154.44 s [vector] +++ OK, passed 100 tests.
  11904. 154.46 s [vector] scanl': OK (0.01s)
  11905. 154.46 s [vector] +++ OK, passed 100 tests.
  11906. 154.47 s [vector] scanl1: OK (0.01s)
  11907. 154.47 s [vector] +++ OK, passed 100 tests.
  11908. 154.48 s [vector] scanl1': OK (0.01s)
  11909. 154.48 s [vector] +++ OK, passed 100 tests.
  11910. 154.49 s [vector] iscanl: OK (0.01s)
  11911. 154.50 s [vector] +++ OK, passed 100 tests.
  11912. 154.50 s [vector] iscanl': OK (0.01s)
  11913. 154.50 s [vector] +++ OK, passed 100 tests.
  11914. 154.52 s [vector] prescanr: OK (0.01s)
  11915. 154.52 s [vector] +++ OK, passed 100 tests.
  11916. 154.52 s [vector] prescanr': OK (0.01s)
  11917. 154.52 s [vector] +++ OK, passed 100 tests.
  11918. 154.53 s [vector] postscanr: OK (0.01s)
  11919. 154.53 s [vector] +++ OK, passed 100 tests.
  11920. 154.54 s [vector] postscanr': OK
  11921. 154.54 s [vector] +++ OK, passed 100 tests.
  11922. 154.56 s [vector] scanr: OK (0.01s)
  11923. 154.56 s [vector] +++ OK, passed 100 tests.
  11924. 154.57 s [vector] scanr': OK (0.01s)
  11925. 154.57 s [vector] +++ OK, passed 100 tests.
  11926. 154.57 s [vector] scanr1: OK (0.01s)
  11927. 154.57 s [vector] +++ OK, passed 100 tests.
  11928. 154.58 s [vector] scanr1': OK
  11929. 154.58 s [vector] +++ OK, passed 100 tests.
  11930. 154.60 s [vector] iscanr: OK (0.01s)
  11931. 154.60 s [vector] +++ OK, passed 100 tests.
  11932. 154.61 s [vector] iscanr': OK (0.01s)
  11933. 154.61 s [vector] +++ OK, passed 100 tests.
  11934. 154.61 s [vector] mut_read: OK
  11935. 154.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11936. 154.61 s [vector] mut_write: OK
  11937. 154.61 s [vector] +++ OK, passed 100 tests; 18 discarded.
  11938. 154.61 s [vector] mut_modify: OK
  11939. 154.61 s [vector] +++ OK, passed 100 tests; 17 discarded.
  11940. 154.62 s [vector] mut_generate: OK
  11941. 154.62 s [vector] +++ OK, passed 100 tests.
  11942. 154.64 s [vector] mut_generateM: OK (0.01s)
  11943. 154.64 s [vector] +++ OK, passed 100 tests.
  11944. 154.66 s [vector] mut_mapM_: OK (0.03s)
  11945. 154.66 s [vector] +++ OK, passed 100 tests.
  11946. 154.70 s [vector] mut_imapM_: OK (0.03s)
  11947. 154.70 s [vector] +++ OK, passed 100 tests.
  11948. 154.72 s [vector] mut_forM_: OK (0.03s)
  11949. 154.72 s [vector] +++ OK, passed 100 tests.
  11950. 154.76 s [vector] mut_iforM_: OK (0.03s)
  11951. 154.76 s [vector] +++ OK, passed 100 tests.
  11952. 154.76 s [vector] mut_foldr: OK
  11953. 154.77 s [vector] +++ OK, passed 100 tests.
  11954. 154.78 s [vector] mut_foldr': OK
  11955. 154.79 s [vector] +++ OK, passed 100 tests.
  11956. 154.80 s [vector] mut_foldl: OK (0.01s)
  11957. 154.80 s [vector] +++ OK, passed 100 tests.
  11958. 154.80 s [vector] mut_foldl': OK (0.01s)
  11959. 154.80 s [vector] +++ OK, passed 100 tests.
  11960. 154.82 s [vector] mut_ifoldr: OK (0.01s)
  11961. 154.82 s [vector] +++ OK, passed 100 tests.
  11962. 154.82 s [vector] mut_ifoldr': OK (0.01s)
  11963. 154.82 s [vector] +++ OK, passed 100 tests.
  11964. 154.84 s [vector] mut_ifoldl: OK (0.01s)
  11965. 154.84 s [vector] +++ OK, passed 100 tests.
  11966. 154.84 s [vector] mut_ifoldl': OK (0.01s)
  11967. 154.84 s [vector] +++ OK, passed 100 tests.
  11968. 154.86 s [vector] mut_foldM: OK (0.01s)
  11969. 154.86 s [vector] +++ OK, passed 100 tests.
  11970. 154.88 s [vector] mut_foldM': OK (0.01s)
  11971. 154.88 s [vector] +++ OK, passed 100 tests.
  11972. 154.88 s [vector] mut_foldrM: OK
  11973. 154.88 s [vector] +++ OK, passed 100 tests.
  11974. 154.89 s [vector] mut_foldrM': OK (0.02s)
  11975. 154.89 s [vector] +++ OK, passed 100 tests.
  11976. 154.90 s [vector] mut_ifoldM: OK (0.01s)
  11977. 154.90 s [vector] +++ OK, passed 100 tests.
  11978. 154.92 s [vector] mut_ifoldM': OK (0.01s)
  11979. 154.92 s [vector] +++ OK, passed 100 tests.
  11980. 154.93 s [vector] mut_ifoldrM: OK (0.01s)
  11981. 154.93 s [vector] +++ OK, passed 100 tests.
  11982. 154.93 s [vector] mut_ifoldrM': OK (0.01s)
  11983. 154.93 s [vector] +++ OK, passed 100 tests.
  11984. 154.94 s [vector] compare: OK
  11985. 154.94 s [vector] +++ OK, passed 100 tests.
  11986. 154.94 s [vector] maximum: OK
  11987. 154.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11988. 154.94 s [vector] minimum: OK
  11989. 154.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  11990. 154.94 s [vector] minIndex: OK
  11991. 154.94 s [vector] +++ OK, passed 100 tests; 16 discarded.
  11992. 154.94 s [vector] maxIndex: OK
  11993. 154.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  11994. 154.94 s [vector] maximumBy: OK
  11995. 154.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11996. 154.94 s [vector] minimumBy: OK
  11997. 154.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  11998. 154.94 s [vector] maximumOn: OK
  11999. 154.94 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12000. 154.94 s [vector] minimumOn: OK
  12001. 154.94 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12002. 154.94 s [vector] maxIndexBy: OK
  12003. 154.94 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12004. 154.94 s [vector] minIndexBy: OK
  12005. 154.94 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12006. 154.94 s [vector] ListFirstMaxIndexWins: OK
  12007. 154.94 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12008. 154.94 s [vector] FalseListFirstMaxIndexWins: OK
  12009. 154.95 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  12010. 154.95 s [vector] []
  12011. 154.95 s [vector] zip: OK
  12012. 154.95 s [vector] +++ OK, passed 100 tests.
  12013. 154.95 s [vector] zip3: OK
  12014. 154.95 s [vector] +++ OK, passed 100 tests.
  12015. 154.95 s [vector] unzip: OK
  12016. 154.95 s [vector] +++ OK, passed 100 tests.
  12017. 154.95 s [vector] unzip3: OK
  12018. 154.95 s [vector] +++ OK, passed 100 tests.
  12019. 154.95 s [vector] indexed: OK
  12020. 154.95 s [vector] +++ OK, passed 100 tests.
  12021. 154.95 s [vector] update: OK
  12022. 154.95 s [vector] +++ OK, passed 100 tests.
  12023. 154.96 s [vector] mempty: OK
  12024. 154.96 s [vector] +++ OK, passed 100 tests.
  12025. 154.96 s [vector] mappend: OK
  12026. 154.96 s [vector] +++ OK, passed 100 tests.
  12027. 154.98 s [vector] mconcat: OK (0.02s)
  12028. 154.98 s [vector] +++ OK, passed 100 tests.
  12029. 154.98 s [vector] glength: OK
  12030. 154.98 s [vector] +++ OK, passed 100 tests.
  12031. 154.98 s [vector] sum: OK
  12032. 154.98 s [vector] +++ OK, passed 100 tests.
  12033. 154.98 s [vector] product: OK
  12034. 154.98 s [vector] +++ OK, passed 100 tests.
  12035. 154.98 s [vector] enumFromN: OK
  12036. 154.98 s [vector] +++ OK, passed 100 tests.
  12037. 154.98 s [vector] enumFromThenN: OK
  12038. 154.98 s [vector] +++ OK, passed 100 tests.
  12039. 154.98 s [vector] enumFromTo: OK
  12040. 154.98 s [vector] +++ OK, passed 100 tests.
  12041. 154.98 s [vector] enumFromThenTo: OK
  12042. 154.98 s [vector] +++ OK, passed 100 tests; 1 discarded.
  12043. 154.98 s [vector] (Int,Bool)
  12044. 154.98 s [vector] fromList.toList == id: OK
  12045. 154.98 s [vector] +++ OK, passed 100 tests.
  12046. 154.98 s [vector] toList.fromList == id: OK
  12047. 154.98 s [vector] +++ OK, passed 100 tests.
  12048. 154.98 s [vector] unstream.stream == id: OK
  12049. 154.98 s [vector] +++ OK, passed 100 tests.
  12050. 154.99 s [vector] stream.unstream == id: OK
  12051. 154.99 s [vector] +++ OK, passed 100 tests.
  12052. 154.99 s [vector] eq: OK
  12053. 154.99 s [vector] +++ OK, passed 100 tests.
  12054. 154.99 s [vector] length: OK
  12055. 154.99 s [vector] +++ OK, passed 100 tests.
  12056. 154.99 s [vector] null: OK
  12057. 154.99 s [vector] +++ OK, passed 100 tests.
  12058. 154.99 s [vector] index: OK
  12059. 154.99 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12060. 154.99 s [vector] safeIndex: OK
  12061. 154.99 s [vector] +++ OK, passed 100 tests.
  12062. 154.99 s [vector] head: OK
  12063. 154.99 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12064. 154.99 s [vector] last: OK
  12065. 154.99 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12066. 154.99 s [vector] unsafeIndex: OK
  12067. 154.99 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12068. 154.99 s [vector] unsafeHead: OK
  12069. 154.99 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12070. 154.99 s [vector] unsafeLast: OK
  12071. 154.99 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12072. 154.99 s [vector] slice: OK
  12073. 154.99 s [vector] +++ OK, passed 100 tests.
  12074. 155.00 s [vector] init: OK
  12075. 155.00 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12076. 155.00 s [vector] tail: OK
  12077. 155.00 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12078. 155.00 s [vector] take: OK
  12079. 155.00 s [vector] +++ OK, passed 100 tests.
  12080. 155.00 s [vector] drop: OK
  12081. 155.00 s [vector] +++ OK, passed 100 tests.
  12082. 155.00 s [vector] splitAt: OK
  12083. 155.00 s [vector] +++ OK, passed 100 tests.
  12084. 155.00 s [vector] empty: OK
  12085. 155.00 s [vector] +++ OK, passed 100 tests.
  12086. 155.00 s [vector] singleton: OK
  12087. 155.00 s [vector] +++ OK, passed 100 tests.
  12088. 155.01 s [vector] replicate: OK
  12089. 155.01 s [vector] +++ OK, passed 100 tests.
  12090. 155.01 s [vector] generate: OK
  12091. 155.01 s [vector] +++ OK, passed 100 tests.
  12092. 155.01 s [vector] iterateN: OK
  12093. 155.02 s [vector] +++ OK, passed 100 tests.
  12094. 155.04 s [vector] iterateNM: OK (0.02s)
  12095. 155.04 s [vector] +++ OK, passed 100 tests.
  12096. 155.06 s [vector] generateM: OK (0.03s)
  12097. 155.06 s [vector] +++ OK, passed 100 tests.
  12098. 155.07 s [vector] replicateM: OK (0.01s)
  12099. 155.07 s [vector] +++ OK, passed 100 tests.
  12100. 155.07 s [vector] create: OK
  12101. 155.07 s [vector] +++ OK, passed 100 tests.
  12102. 155.07 s [vector] createT: OK
  12103. 155.07 s [vector] +++ OK, passed 100 tests.
  12104. 155.07 s [vector] unfoldr: OK
  12105. 155.07 s [vector] +++ OK, passed 100 tests.
  12106. 155.07 s [vector] unfoldrN: OK
  12107. 155.07 s [vector] +++ OK, passed 100 tests.
  12108. 155.07 s [vector] unfoldrExactN: OK
  12109. 155.07 s [vector] +++ OK, passed 100 tests.
  12110. 155.07 s [vector] unfoldrM: OK
  12111. 155.07 s [vector] +++ OK, passed 100 tests.
  12112. 155.08 s [vector] unfoldrNM: OK
  12113. 155.08 s [vector] +++ OK, passed 100 tests.
  12114. 155.09 s [vector] unfoldrExactNM: OK (0.02s)
  12115. 155.09 s [vector] +++ OK, passed 100 tests.
  12116. 155.10 s [vector] constructN: OK
  12117. 155.10 s [vector] +++ OK, passed 100 tests.
  12118. 155.10 s [vector] constructrN: OK
  12119. 155.10 s [vector] +++ OK, passed 100 tests.
  12120. 155.10 s [vector] cons: OK
  12121. 155.10 s [vector] +++ OK, passed 100 tests.
  12122. 155.10 s [vector] snoc: OK
  12123. 155.11 s [vector] +++ OK, passed 100 tests.
  12124. 155.12 s [vector] append: OK
  12125. 155.12 s [vector] +++ OK, passed 100 tests.
  12126. 155.14 s [vector] concat: OK (0.03s)
  12127. 155.14 s [vector] +++ OK, passed 100 tests.
  12128. 155.14 s [vector] force: OK
  12129. 155.14 s [vector] +++ OK, passed 100 tests.
  12130. 155.14 s [vector] upd: OK
  12131. 155.14 s [vector] +++ OK, passed 100 tests.
  12132. 155.15 s [vector] accum: OK
  12133. 155.15 s [vector] +++ OK, passed 100 tests.
  12134. 155.15 s [vector] reverse: OK
  12135. 155.15 s [vector] +++ OK, passed 100 tests.
  12136. 155.15 s [vector] backpermute: OK
  12137. 155.15 s [vector] +++ OK, passed 100 tests.
  12138. 155.16 s [vector] map: OK
  12139. 155.16 s [vector] +++ OK, passed 100 tests.
  12140. 155.16 s [vector] imap: OK
  12141. 155.16 s [vector] +++ OK, passed 100 tests.
  12142. 155.16 s [vector] concatMap: OK
  12143. 155.16 s [vector] +++ OK, passed 100 tests.
  12144. 155.18 s [vector] mapM: OK
  12145. 155.18 s [vector] +++ OK, passed 100 tests.
  12146. 155.19 s [vector] mapM_: OK (0.02s)
  12147. 155.20 s [vector] +++ OK, passed 100 tests.
  12148. 155.20 s [vector] forM: OK
  12149. 155.20 s [vector] +++ OK, passed 100 tests.
  12150. 155.22 s [vector] forM_: OK (0.03s)
  12151. 155.24 s [vector] +++ OK, passed 100 tests.
  12152. 155.24 s [vector] imapM: OK
  12153. 155.24 s [vector] +++ OK, passed 100 tests.
  12154. 155.25 s [vector] imapM_: OK (0.02s)
  12155. 155.25 s [vector] +++ OK, passed 100 tests.
  12156. 155.25 s [vector] zipWith: OK
  12157. 155.25 s [vector] +++ OK, passed 100 tests.
  12158. 155.26 s [vector] zipWith3: OK
  12159. 155.26 s [vector] +++ OK, passed 100 tests.
  12160. 155.26 s [vector] izipWith: OK
  12161. 155.26 s [vector] +++ OK, passed 100 tests.
  12162. 155.26 s [vector] izipWith3: OK
  12163. 155.26 s [vector] +++ OK, passed 100 tests.
  12164. 155.28 s [vector] izipWithM: OK
  12165. 155.28 s [vector] +++ OK, passed 100 tests.
  12166. 155.29 s [vector] izipWithM_: OK (0.02s)
  12167. 155.29 s [vector] +++ OK, passed 100 tests.
  12168. 155.29 s [vector] zipWithM: OK
  12169. 155.30 s [vector] +++ OK, passed 100 tests.
  12170. 155.31 s [vector] zipWithM_: OK (0.02s)
  12171. 155.31 s [vector] +++ OK, passed 100 tests.
  12172. 155.31 s [vector] filter: OK
  12173. 155.31 s [vector] +++ OK, passed 100 tests.
  12174. 155.32 s [vector] ifilter: OK
  12175. 155.32 s [vector] +++ OK, passed 100 tests.
  12176. 155.36 s [vector] filterM: OK (0.05s)
  12177. 155.36 s [vector] +++ OK, passed 100 tests.
  12178. 155.36 s [vector] uniq: OK
  12179. 155.36 s [vector] +++ OK, passed 100 tests.
  12180. 155.36 s [vector] mapMaybe: OK
  12181. 155.36 s [vector] +++ OK, passed 100 tests.
  12182. 155.36 s [vector] imapMaybe: OK
  12183. 155.36 s [vector] +++ OK, passed 100 tests.
  12184. 155.36 s [vector] takeWhile: OK
  12185. 155.37 s [vector] +++ OK, passed 100 tests.
  12186. 155.37 s [vector] dropWhile: OK
  12187. 155.37 s [vector] +++ OK, passed 100 tests.
  12188. 155.37 s [vector] partition: OK
  12189. 155.37 s [vector] +++ OK, passed 100 tests.
  12190. 155.37 s [vector] partitionWith: OK
  12191. 155.37 s [vector] +++ OK, passed 100 tests.
  12192. 155.37 s [vector] span: OK
  12193. 155.38 s [vector] +++ OK, passed 100 tests.
  12194. 155.38 s [vector] break: OK
  12195. 155.38 s [vector] +++ OK, passed 100 tests.
  12196. 155.38 s [vector] spanR: OK
  12197. 155.38 s [vector] +++ OK, passed 100 tests.
  12198. 155.38 s [vector] breakR: OK
  12199. 155.38 s [vector] +++ OK, passed 100 tests.
  12200. 155.38 s [vector] groupBy: OK
  12201. 155.38 s [vector] +++ OK, passed 100 tests.
  12202. 155.38 s [vector] elem: OK
  12203. 155.38 s [vector] +++ OK, passed 100 tests.
  12204. 155.38 s [vector] notElem: OK
  12205. 155.38 s [vector] +++ OK, passed 100 tests.
  12206. 155.38 s [vector] find: OK
  12207. 155.38 s [vector] +++ OK, passed 100 tests.
  12208. 155.39 s [vector] findIndex: OK
  12209. 155.39 s [vector] +++ OK, passed 100 tests.
  12210. 155.39 s [vector] findIndexR: OK
  12211. 155.39 s [vector] +++ OK, passed 100 tests.
  12212. 155.39 s [vector] findIndices: OK
  12213. 155.39 s [vector] +++ OK, passed 100 tests.
  12214. 155.39 s [vector] elemIndex: OK
  12215. 155.39 s [vector] +++ OK, passed 100 tests.
  12216. 155.39 s [vector] elemIndices: OK
  12217. 155.39 s [vector] +++ OK, passed 100 tests.
  12218. 155.40 s [vector] foldl: OK
  12219. 155.40 s [vector] +++ OK, passed 100 tests.
  12220. 155.40 s [vector] foldl1: OK
  12221. 155.40 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12222. 155.40 s [vector] foldl': OK
  12223. 155.40 s [vector] +++ OK, passed 100 tests.
  12224. 155.40 s [vector] foldl1': OK
  12225. 155.40 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12226. 155.41 s [vector] foldr: OK
  12227. 155.41 s [vector] +++ OK, passed 100 tests.
  12228. 155.41 s [vector] foldr1: OK
  12229. 155.41 s [vector] +++ OK, passed 100 tests; 21 discarded.
  12230. 155.41 s [vector] foldr': OK
  12231. 155.42 s [vector] +++ OK, passed 100 tests.
  12232. 155.42 s [vector] foldr1': OK
  12233. 155.42 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12234. 155.42 s [vector] ifoldl: OK
  12235. 155.42 s [vector] +++ OK, passed 100 tests.
  12236. 155.42 s [vector] ifoldl': OK
  12237. 155.42 s [vector] +++ OK, passed 100 tests.
  12238. 155.43 s [vector] ifoldr: OK
  12239. 155.43 s [vector] +++ OK, passed 100 tests.
  12240. 155.43 s [vector] ifoldr': OK
  12241. 155.43 s [vector] +++ OK, passed 100 tests.
  12242. 155.43 s [vector] ifoldM: OK
  12243. 155.44 s [vector] +++ OK, passed 100 tests.
  12244. 155.44 s [vector] ifoldM': OK
  12245. 155.44 s [vector] +++ OK, passed 100 tests.
  12246. 155.46 s [vector] ifoldM_: OK (0.02s)
  12247. 155.46 s [vector] +++ OK, passed 100 tests.
  12248. 155.48 s [vector] ifoldM'_: OK (0.02s)
  12249. 155.48 s [vector] +++ OK, passed 100 tests.
  12250. 155.48 s [vector] all: OK
  12251. 155.48 s [vector] +++ OK, passed 100 tests.
  12252. 155.49 s [vector] any: OK
  12253. 155.49 s [vector] +++ OK, passed 100 tests.
  12254. 155.49 s [vector] prescanl: OK
  12255. 155.49 s [vector] +++ OK, passed 100 tests.
  12256. 155.49 s [vector] prescanl': OK
  12257. 155.49 s [vector] +++ OK, passed 100 tests.
  12258. 155.50 s [vector] postscanl: OK
  12259. 155.50 s [vector] +++ OK, passed 100 tests.
  12260. 155.50 s [vector] postscanl': OK
  12261. 155.50 s [vector] +++ OK, passed 100 tests.
  12262. 155.50 s [vector] scanl: OK
  12263. 155.51 s [vector] +++ OK, passed 100 tests.
  12264. 155.51 s [vector] scanl': OK
  12265. 155.51 s [vector] +++ OK, passed 100 tests.
  12266. 155.51 s [vector] scanl1: OK
  12267. 155.51 s [vector] +++ OK, passed 100 tests.
  12268. 155.52 s [vector] scanl1': OK
  12269. 155.52 s [vector] +++ OK, passed 100 tests.
  12270. 155.52 s [vector] iscanl: OK
  12271. 155.52 s [vector] +++ OK, passed 100 tests.
  12272. 155.52 s [vector] iscanl': OK
  12273. 155.52 s [vector] +++ OK, passed 100 tests.
  12274. 155.53 s [vector] prescanr: OK
  12275. 155.53 s [vector] +++ OK, passed 100 tests.
  12276. 155.53 s [vector] prescanr': OK
  12277. 155.54 s [vector] +++ OK, passed 100 tests.
  12278. 155.54 s [vector] postscanr: OK
  12279. 155.54 s [vector] +++ OK, passed 100 tests.
  12280. 155.54 s [vector] postscanr': OK
  12281. 155.54 s [vector] +++ OK, passed 100 tests.
  12282. 155.54 s [vector] scanr: OK
  12283. 155.54 s [vector] +++ OK, passed 100 tests.
  12284. 155.55 s [vector] scanr': OK
  12285. 155.55 s [vector] +++ OK, passed 100 tests.
  12286. 155.55 s [vector] scanr1: OK
  12287. 155.55 s [vector] +++ OK, passed 100 tests.
  12288. 155.56 s [vector] scanr1': OK
  12289. 155.56 s [vector] +++ OK, passed 100 tests.
  12290. 155.56 s [vector] iscanr: OK
  12291. 155.56 s [vector] +++ OK, passed 100 tests.
  12292. 155.56 s [vector] iscanr': OK
  12293. 155.56 s [vector] +++ OK, passed 100 tests.
  12294. 155.56 s [vector] mut_read: OK
  12295. 155.56 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12296. 155.57 s [vector] mut_write: OK
  12297. 155.57 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12298. 155.57 s [vector] mut_modify: OK
  12299. 155.57 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12300. 155.58 s [vector] mut_generate: OK
  12301. 155.58 s [vector] +++ OK, passed 100 tests.
  12302. 155.60 s [vector] mut_generateM: OK (0.02s)
  12303. 155.60 s [vector] +++ OK, passed 100 tests.
  12304. 155.62 s [vector] mut_mapM_: OK (0.02s)
  12305. 155.62 s [vector] +++ OK, passed 100 tests.
  12306. 155.63 s [vector] mut_imapM_: OK (0.03s)
  12307. 155.63 s [vector] +++ OK, passed 100 tests.
  12308. 155.66 s [vector] mut_forM_: OK (0.02s)
  12309. 155.66 s [vector] +++ OK, passed 100 tests.
  12310. 155.69 s [vector] mut_iforM_: OK (0.03s)
  12311. 155.69 s [vector] +++ OK, passed 100 tests.
  12312. 155.69 s [vector] mut_foldr: OK
  12313. 155.69 s [vector] +++ OK, passed 100 tests.
  12314. 155.70 s [vector] mut_foldr': OK
  12315. 155.70 s [vector] +++ OK, passed 100 tests.
  12316. 155.70 s [vector] mut_foldl: OK
  12317. 155.70 s [vector] +++ OK, passed 100 tests.
  12318. 155.70 s [vector] mut_foldl': OK
  12319. 155.70 s [vector] +++ OK, passed 100 tests.
  12320. 155.70 s [vector] mut_ifoldr: OK
  12321. 155.70 s [vector] +++ OK, passed 100 tests.
  12322. 155.71 s [vector] mut_ifoldr': OK
  12323. 155.71 s [vector] +++ OK, passed 100 tests.
  12324. 155.72 s [vector] mut_ifoldl: OK
  12325. 155.72 s [vector] +++ OK, passed 100 tests.
  12326. 155.72 s [vector] mut_ifoldl': OK
  12327. 155.72 s [vector] +++ OK, passed 100 tests.
  12328. 155.72 s [vector] mut_foldM: OK
  12329. 155.72 s [vector] +++ OK, passed 100 tests.
  12330. 155.72 s [vector] mut_foldM': OK
  12331. 155.72 s [vector] +++ OK, passed 100 tests.
  12332. 155.73 s [vector] mut_foldrM: OK
  12333. 155.73 s [vector] +++ OK, passed 100 tests.
  12334. 155.73 s [vector] mut_foldrM': OK
  12335. 155.73 s [vector] +++ OK, passed 100 tests.
  12336. 155.73 s [vector] mut_ifoldM: OK
  12337. 155.73 s [vector] +++ OK, passed 100 tests.
  12338. 155.74 s [vector] mut_ifoldM': OK
  12339. 155.74 s [vector] +++ OK, passed 100 tests.
  12340. 155.74 s [vector] mut_ifoldrM: OK
  12341. 155.74 s [vector] +++ OK, passed 100 tests.
  12342. 155.74 s [vector] mut_ifoldrM': OK
  12343. 155.74 s [vector] +++ OK, passed 100 tests.
  12344. 155.74 s [vector] compare: OK
  12345. 155.74 s [vector] +++ OK, passed 100 tests.
  12346. 155.74 s [vector] maximum: OK
  12347. 155.75 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12348. 155.75 s [vector] minimum: OK
  12349. 155.75 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12350. 155.75 s [vector] minIndex: OK
  12351. 155.75 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12352. 155.75 s [vector] maxIndex: OK
  12353. 155.75 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12354. 155.75 s [vector] maximumBy: OK
  12355. 155.75 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12356. 155.75 s [vector] minimumBy: OK
  12357. 155.75 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12358. 155.75 s [vector] maximumOn: OK
  12359. 155.75 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12360. 155.75 s [vector] minimumOn: OK
  12361. 155.75 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12362. 155.75 s [vector] maxIndexBy: OK
  12363. 155.75 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12364. 155.75 s [vector] minIndexBy: OK
  12365. 155.75 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12366. 155.75 s [vector] ListFirstMaxIndexWins: OK
  12367. 155.75 s [vector] +++ OK, passed 100 tests; 19 discarded.
  12368. 155.75 s [vector] FalseListFirstMaxIndexWins: OK
  12369. 155.75 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  12370. 155.75 s [vector] []
  12371. 155.76 s [vector] zip: OK
  12372. 155.76 s [vector] +++ OK, passed 100 tests.
  12373. 155.76 s [vector] zip3: OK
  12374. 155.76 s [vector] +++ OK, passed 100 tests.
  12375. 155.76 s [vector] unzip: OK
  12376. 155.76 s [vector] +++ OK, passed 100 tests.
  12377. 155.77 s [vector] unzip3: OK
  12378. 156.22 s [vector] +++ OK, passed 100 tests.
  12379. 156.22 s [vector] indexed: OK
  12380. 156.22 s [vector] +++ OK, passed 100 tests.
  12381. 156.22 s [vector] update: OK
  12382. 156.22 s [vector] +++ OK, passed 100 tests.
  12383. 156.22 s [vector] mempty: OK
  12384. 156.22 s [vector] +++ OK, passed 100 tests.
  12385. 156.22 s [vector] mappend: OK
  12386. 156.22 s [vector] +++ OK, passed 100 tests.
  12387. 156.22 s [vector] mconcat: OK (0.03s)
  12388. 156.22 s [vector] +++ OK, passed 100 tests.
  12389. 156.22 s [vector] glength: OK
  12390. 156.22 s [vector] +++ OK, passed 100 tests.
  12391. 156.22 s [vector] (Int,Bool,Int)
  12392. 156.22 s [vector] fromList.toList == id: OK
  12393. 156.22 s [vector] +++ OK, passed 100 tests.
  12394. 156.22 s [vector] toList.fromList == id: OK
  12395. 156.22 s [vector] +++ OK, passed 100 tests.
  12396. 156.22 s [vector] unstream.stream == id: OK
  12397. 156.22 s [vector] +++ OK, passed 100 tests.
  12398. 156.23 s [vector] stream.unstream == id: OK
  12399. 156.23 s [vector] +++ OK, passed 100 tests.
  12400. 156.23 s [vector] eq: OK
  12401. 156.23 s [vector] +++ OK, passed 100 tests.
  12402. 156.23 s [vector] length: OK
  12403. 156.23 s [vector] +++ OK, passed 100 tests.
  12404. 156.23 s [vector] null: OK
  12405. 156.23 s [vector] +++ OK, passed 100 tests.
  12406. 156.23 s [vector] index: OK
  12407. 156.23 s [vector] +++ OK, passed 100 tests; 22 discarded.
  12408. 156.23 s [vector] safeIndex: OK
  12409. 156.23 s [vector] +++ OK, passed 100 tests.
  12410. 156.23 s [vector] head: OK
  12411. 156.23 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12412. 156.23 s [vector] last: OK
  12413. 156.23 s [vector] +++ OK, passed 100 tests; 33 discarded.
  12414. 156.23 s [vector] unsafeIndex: OK
  12415. 156.23 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12416. 156.23 s [vector] unsafeHead: OK
  12417. 156.23 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12418. 156.23 s [vector] unsafeLast: OK
  12419. 156.23 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12420. 156.23 s [vector] slice: OK
  12421. 156.23 s [vector] +++ OK, passed 100 tests.
  12422. 156.23 s [vector] init: OK
  12423. 156.23 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12424. 156.23 s [vector] tail: OK
  12425. 156.23 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12426. 156.23 s [vector] take: OK
  12427. 156.23 s [vector] +++ OK, passed 100 tests.
  12428. 156.23 s [vector] drop: OK
  12429. 156.23 s [vector] +++ OK, passed 100 tests.
  12430. 156.23 s [vector] splitAt: OK
  12431. 156.23 s [vector] +++ OK, passed 100 tests.
  12432. 156.23 s [vector] empty: OK
  12433. 156.23 s [vector] +++ OK, passed 100 tests.
  12434. 156.23 s [vector] singleton: OK
  12435. 156.23 s [vector] +++ OK, passed 100 tests.
  12436. 156.23 s [vector] replicate: OK
  12437. 156.23 s [vector] +++ OK, passed 100 tests.
  12438. 156.23 s [vector] generate: OK
  12439. 156.23 s [vector] +++ OK, passed 100 tests.
  12440. 156.23 s [vector] iterateN: OK
  12441. 156.23 s [vector] +++ OK, passed 100 tests.
  12442. 156.23 s [vector] iterateNM: OK (0.02s)
  12443. 156.23 s [vector] +++ OK, passed 100 tests.
  12444. 156.23 s [vector] generateM: OK (0.03s)
  12445. 156.23 s [vector] +++ OK, passed 100 tests.
  12446. 156.23 s [vector] replicateM: OK (0.01s)
  12447. 156.23 s [vector] +++ OK, passed 100 tests.
  12448. 156.23 s [vector] create: OK
  12449. 156.23 s [vector] +++ OK, passed 100 tests.
  12450. 156.23 s [vector] createT: OK
  12451. 156.23 s [vector] +++ OK, passed 100 tests.
  12452. 156.23 s [vector] unfoldr: OK
  12453. 156.23 s [vector] +++ OK, passed 100 tests.
  12454. 156.23 s [vector] unfoldrN: OK
  12455. 156.23 s [vector] +++ OK, passed 100 tests.
  12456. 156.23 s [vector] unfoldrExactN: OK
  12457. 156.23 s [vector] +++ OK, passed 100 tests.
  12458. 156.23 s [vector] unfoldrM: OK
  12459. 156.23 s [vector] +++ OK, passed 100 tests.
  12460. 156.23 s [vector] unfoldrNM: OK
  12461. 156.23 s [vector] +++ OK, passed 100 tests.
  12462. 156.23 s [vector] unfoldrExactNM: OK (0.02s)
  12463. 156.23 s [vector] +++ OK, passed 100 tests.
  12464. 156.23 s [vector] constructN: OK
  12465. 156.23 s [vector] +++ OK, passed 100 tests.
  12466. 156.23 s [vector] constructrN: OK
  12467. 156.23 s [vector] +++ OK, passed 100 tests.
  12468. 156.23 s [vector] cons: OK
  12469. 156.23 s [vector] +++ OK, passed 100 tests.
  12470. 156.23 s [vector] snoc: OK
  12471. 156.23 s [vector] +++ OK, passed 100 tests.
  12472. 156.23 s [vector] append: OK
  12473. 156.23 s [vector] +++ OK, passed 100 tests.
  12474. 156.23 s [vector] concat: OK (0.04s)
  12475. 156.23 s [vector] +++ OK, passed 100 tests.
  12476. 156.23 s [vector] force: OK
  12477. 156.23 s [vector] +++ OK, passed 100 tests.
  12478. 156.23 s [vector] upd: OK
  12479. 156.23 s [vector] +++ OK, passed 100 tests.
  12480. 156.23 s [vector] accum: OK
  12481. 156.23 s [vector] +++ OK, passed 100 tests.
  12482. 156.23 s [vector] reverse: OK
  12483. 156.23 s [vector] +++ OK, passed 100 tests.
  12484. 156.23 s [vector] backpermute: OK
  12485. 156.23 s [vector] +++ OK, passed 100 tests.
  12486. 156.23 s [vector] map: OK
  12487. 156.23 s [vector] +++ OK, passed 100 tests.
  12488. 156.23 s [vector] imap: OK
  12489. 156.23 s [vector] +++ OK, passed 100 tests.
  12490. 156.23 s [vector] concatMap: OK
  12491. 156.23 s [vector] +++ OK, passed 100 tests.
  12492. 156.23 s [vector] mapM: OK
  12493. 156.23 s [vector] +++ OK, passed 100 tests.
  12494. 156.23 s [vector] mapM_: OK (0.04s)
  12495. 156.23 s [vector] +++ OK, passed 100 tests.
  12496. 156.23 s [vector] forM: OK
  12497. 156.23 s [vector] +++ OK, passed 100 tests.
  12498. 156.23 s [vector] forM_: OK (0.05s)
  12499. 156.23 s [vector] +++ OK, passed 100 tests.
  12500. 156.23 s [vector] imapM: OK
  12501. 156.23 s [vector] +++ OK, passed 100 tests.
  12502. 156.23 s [vector] imapM_: OK (0.04s)
  12503. 156.23 s [vector] +++ OK, passed 100 tests.
  12504. 156.23 s [vector] zipWith: OK
  12505. 156.23 s [vector] +++ OK, passed 100 tests.
  12506. 156.23 s [vector] zipWith3: OK
  12507. 156.23 s [vector] +++ OK, passed 100 tests.
  12508. 156.23 s [vector] izipWith: OK
  12509. 156.23 s [vector] +++ OK, passed 100 tests.
  12510. 156.23 s [vector] izipWith3: OK
  12511. 156.23 s [vector] +++ OK, passed 100 tests.
  12512. 156.23 s [vector] izipWithM: OK
  12513. 156.23 s [vector] +++ OK, passed 100 tests.
  12514. 156.24 s [vector] izipWithM_: OK (0.01s)
  12515. 156.24 s [vector] +++ OK, passed 100 tests.
  12516. 156.26 s [vector] zipWithM: OK
  12517. 156.26 s [vector] +++ OK, passed 100 tests.
  12518. 156.27 s [vector] zipWithM_: OK (0.03s)
  12519. 156.27 s [vector] +++ OK, passed 100 tests.
  12520. 156.28 s [vector] filter: OK
  12521. 156.28 s [vector] +++ OK, passed 100 tests.
  12522. 156.28 s [vector] ifilter: OK
  12523. 156.28 s [vector] +++ OK, passed 100 tests.
  12524. 156.33 s [vector] filterM: OK (0.05s)
  12525. 156.33 s [vector] +++ OK, passed 100 tests.
  12526. 156.33 s [vector] uniq: OK
  12527. 156.33 s [vector] +++ OK, passed 100 tests.
  12528. 156.34 s [vector] mapMaybe: OK
  12529. 156.34 s [vector] +++ OK, passed 100 tests.
  12530. 156.34 s [vector] imapMaybe: OK
  12531. 156.35 s [vector] +++ OK, passed 100 tests.
  12532. 156.35 s [vector] takeWhile: OK
  12533. 156.35 s [vector] +++ OK, passed 100 tests.
  12534. 156.35 s [vector] dropWhile: OK
  12535. 156.35 s [vector] +++ OK, passed 100 tests.
  12536. 156.36 s [vector] partition: OK
  12537. 156.36 s [vector] +++ OK, passed 100 tests.
  12538. 156.36 s [vector] partitionWith: OK
  12539. 156.36 s [vector] +++ OK, passed 100 tests.
  12540. 156.36 s [vector] span: OK
  12541. 156.36 s [vector] +++ OK, passed 100 tests.
  12542. 156.36 s [vector] break: OK
  12543. 156.36 s [vector] +++ OK, passed 100 tests.
  12544. 156.36 s [vector] spanR: OK
  12545. 156.36 s [vector] +++ OK, passed 100 tests.
  12546. 156.36 s [vector] breakR: OK
  12547. 156.37 s [vector] +++ OK, passed 100 tests.
  12548. 156.37 s [vector] groupBy: OK
  12549. 156.37 s [vector] +++ OK, passed 100 tests.
  12550. 156.37 s [vector] elem: OK
  12551. 156.37 s [vector] +++ OK, passed 100 tests.
  12552. 156.37 s [vector] notElem: OK
  12553. 156.37 s [vector] +++ OK, passed 100 tests.
  12554. 156.37 s [vector] find: OK
  12555. 156.37 s [vector] +++ OK, passed 100 tests.
  12556. 156.38 s [vector] findIndex: OK
  12557. 156.38 s [vector] +++ OK, passed 100 tests.
  12558. 156.38 s [vector] findIndexR: OK
  12559. 156.38 s [vector] +++ OK, passed 100 tests.
  12560. 156.38 s [vector] findIndices: OK
  12561. 156.38 s [vector] +++ OK, passed 100 tests.
  12562. 156.38 s [vector] elemIndex: OK
  12563. 156.38 s [vector] +++ OK, passed 100 tests.
  12564. 156.38 s [vector] elemIndices: OK
  12565. 156.38 s [vector] +++ OK, passed 100 tests.
  12566. 156.39 s [vector] foldl: OK
  12567. 156.39 s [vector] +++ OK, passed 100 tests.
  12568. 156.40 s [vector] foldl1: OK
  12569. 156.40 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12570. 156.40 s [vector] foldl': OK
  12571. 156.40 s [vector] +++ OK, passed 100 tests.
  12572. 156.41 s [vector] foldl1': OK
  12573. 156.41 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12574. 156.41 s [vector] foldr: OK
  12575. 156.41 s [vector] +++ OK, passed 100 tests.
  12576. 156.41 s [vector] foldr1: OK
  12577. 156.41 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12578. 156.41 s [vector] foldr': OK
  12579. 156.41 s [vector] +++ OK, passed 100 tests.
  12580. 156.42 s [vector] foldr1': OK
  12581. 156.43 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12582. 156.44 s [vector] ifoldl: OK
  12583. 156.44 s [vector] +++ OK, passed 100 tests.
  12584. 156.44 s [vector] ifoldl': OK
  12585. 156.44 s [vector] +++ OK, passed 100 tests.
  12586. 156.44 s [vector] ifoldr: OK
  12587. 156.45 s [vector] +++ OK, passed 100 tests.
  12588. 156.45 s [vector] ifoldr': OK
  12589. 156.45 s [vector] +++ OK, passed 100 tests.
  12590. 156.45 s [vector] ifoldM: OK
  12591. 156.45 s [vector] +++ OK, passed 100 tests.
  12592. 156.46 s [vector] ifoldM': OK
  12593. 156.46 s [vector] +++ OK, passed 100 tests.
  12594. 156.50 s [vector] ifoldM_: OK (0.03s)
  12595. 156.50 s [vector] +++ OK, passed 100 tests.
  12596. 156.52 s [vector] ifoldM'_: OK (0.03s)
  12597. 156.52 s [vector] +++ OK, passed 100 tests.
  12598. 156.52 s [vector] all: OK
  12599. 156.52 s [vector] +++ OK, passed 100 tests.
  12600. 156.52 s [vector] any: OK
  12601. 156.52 s [vector] +++ OK, passed 100 tests.
  12602. 156.53 s [vector] prescanl: OK
  12603. 156.53 s [vector] +++ OK, passed 100 tests.
  12604. 156.54 s [vector] prescanl': OK
  12605. 156.54 s [vector] +++ OK, passed 100 tests.
  12606. 156.54 s [vector] postscanl: OK
  12607. 156.54 s [vector] +++ OK, passed 100 tests.
  12608. 156.55 s [vector] postscanl': OK
  12609. 156.56 s [vector] +++ OK, passed 100 tests.
  12610. 156.56 s [vector] scanl: OK
  12611. 156.56 s [vector] +++ OK, passed 100 tests.
  12612. 156.56 s [vector] scanl': OK
  12613. 156.57 s [vector] +++ OK, passed 100 tests.
  12614. 156.58 s [vector] scanl1: OK (0.01s)
  12615. 156.58 s [vector] +++ OK, passed 100 tests.
  12616. 156.58 s [vector] scanl1': OK
  12617. 156.58 s [vector] +++ OK, passed 100 tests.
  12618. 156.59 s [vector] iscanl: OK
  12619. 156.60 s [vector] +++ OK, passed 100 tests.
  12620. 156.60 s [vector] iscanl': OK
  12621. 156.60 s [vector] +++ OK, passed 100 tests.
  12622. 156.60 s [vector] prescanr: OK
  12623. 156.60 s [vector] +++ OK, passed 100 tests.
  12624. 156.60 s [vector] prescanr': OK
  12625. 156.60 s [vector] +++ OK, passed 100 tests.
  12626. 156.62 s [vector] postscanr: OK
  12627. 156.62 s [vector] +++ OK, passed 100 tests.
  12628. 156.62 s [vector] postscanr': OK
  12629. 156.62 s [vector] +++ OK, passed 100 tests.
  12630. 156.62 s [vector] scanr: OK
  12631. 156.62 s [vector] +++ OK, passed 100 tests.
  12632. 156.63 s [vector] scanr': OK
  12633. 156.63 s [vector] +++ OK, passed 100 tests.
  12634. 156.64 s [vector] scanr1: OK
  12635. 156.64 s [vector] +++ OK, passed 100 tests.
  12636. 156.65 s [vector] scanr1': OK
  12637. 156.66 s [vector] +++ OK, passed 100 tests.
  12638. 156.66 s [vector] iscanr: OK
  12639. 156.66 s [vector] +++ OK, passed 100 tests.
  12640. 156.66 s [vector] iscanr': OK
  12641. 156.66 s [vector] +++ OK, passed 100 tests.
  12642. 156.66 s [vector] mut_read: OK
  12643. 156.66 s [vector] +++ OK, passed 100 tests; 20 discarded.
  12644. 156.67 s [vector] mut_write: OK
  12645. 156.67 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12646. 156.68 s [vector] mut_modify: OK
  12647. 156.68 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12648. 156.68 s [vector] mut_generate: OK
  12649. 156.68 s [vector] +++ OK, passed 100 tests.
  12650. 156.70 s [vector] mut_generateM: OK (0.02s)
  12651. 156.70 s [vector] +++ OK, passed 100 tests.
  12652. 156.74 s [vector] mut_mapM_: OK (0.03s)
  12653. 156.74 s [vector] +++ OK, passed 100 tests.
  12654. 156.78 s [vector] mut_imapM_: OK (0.05s)
  12655. 156.78 s [vector] +++ OK, passed 100 tests.
  12656. 156.81 s [vector] mut_forM_: OK (0.04s)
  12657. 156.81 s [vector] +++ OK, passed 100 tests.
  12658. 156.84 s [vector] mut_iforM_: OK (0.03s)
  12659. 156.84 s [vector] +++ OK, passed 100 tests.
  12660. 156.85 s [vector] mut_foldr: OK
  12661. 156.86 s [vector] +++ OK, passed 100 tests.
  12662. 156.86 s [vector] mut_foldr': OK
  12663. 156.86 s [vector] +++ OK, passed 100 tests.
  12664. 156.87 s [vector] mut_foldl: OK
  12665. 156.87 s [vector] +++ OK, passed 100 tests.
  12666. 156.87 s [vector] mut_foldl': OK
  12667. 156.87 s [vector] +++ OK, passed 100 tests.
  12668. 156.87 s [vector] mut_ifoldr: OK
  12669. 156.87 s [vector] +++ OK, passed 100 tests.
  12670. 156.88 s [vector] mut_ifoldr': OK
  12671. 156.88 s [vector] +++ OK, passed 100 tests.
  12672. 156.89 s [vector] mut_ifoldl: OK
  12673. 156.89 s [vector] +++ OK, passed 100 tests.
  12674. 156.90 s [vector] mut_ifoldl': OK
  12675. 156.90 s [vector] +++ OK, passed 100 tests.
  12676. 156.90 s [vector] mut_foldM: OK
  12677. 156.90 s [vector] +++ OK, passed 100 tests.
  12678. 156.91 s [vector] mut_foldM': OK
  12679. 156.92 s [vector] +++ OK, passed 100 tests.
  12680. 156.92 s [vector] mut_foldrM: OK
  12681. 156.92 s [vector] +++ OK, passed 100 tests.
  12682. 156.93 s [vector] mut_foldrM': OK
  12683. 156.93 s [vector] +++ OK, passed 100 tests.
  12684. 156.93 s [vector] mut_ifoldM: OK
  12685. 156.93 s [vector] +++ OK, passed 100 tests.
  12686. 156.93 s [vector] mut_ifoldM': OK
  12687. 156.93 s [vector] +++ OK, passed 100 tests.
  12688. 156.93 s [vector] mut_ifoldrM: OK
  12689. 156.93 s [vector] +++ OK, passed 100 tests.
  12690. 156.93 s [vector] mut_ifoldrM': OK
  12691. 156.93 s [vector] +++ OK, passed 100 tests.
  12692. 156.93 s [vector] compare: OK
  12693. 156.93 s [vector] +++ OK, passed 100 tests.
  12694. 156.93 s [vector] maximum: OK
  12695. 156.93 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12696. 156.93 s [vector] minimum: OK
  12697. 156.94 s [vector] +++ OK, passed 100 tests; 11 discarded.
  12698. 156.94 s [vector] minIndex: OK
  12699. 156.94 s [vector] +++ OK, passed 100 tests; 17 discarded.
  12700. 156.94 s [vector] maxIndex: OK
  12701. 156.94 s [vector] +++ OK, passed 100 tests; 14 discarded.
  12702. 156.94 s [vector] maximumBy: OK
  12703. 156.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12704. 156.94 s [vector] minimumBy: OK
  12705. 156.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12706. 156.94 s [vector] maximumOn: OK
  12707. 156.94 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12708. 156.94 s [vector] minimumOn: OK
  12709. 156.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12710. 156.94 s [vector] maxIndexBy: OK
  12711. 156.94 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12712. 156.94 s [vector] minIndexBy: OK
  12713. 156.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12714. 156.94 s [vector] ListFirstMaxIndexWins: OK
  12715. 156.94 s [vector] +++ OK, passed 100 tests; 15 discarded.
  12716. 156.94 s [vector] FalseListFirstMaxIndexWins: OK
  12717. 156.95 s [vector] +++ OK, failed as expected. Exception: 'Prelude.foldr1: empty list' (after 1 test):
  12718. 156.95 s [vector] []
  12719. 156.95 s [vector] zip: OK
  12720. 156.95 s [vector] +++ OK, passed 100 tests.
  12721. 156.95 s [vector] zip3: OK
  12722. 156.95 s [vector] +++ OK, passed 100 tests.
  12723. 156.95 s [vector] unzip: OK
  12724. 156.96 s [vector] +++ OK, passed 100 tests.
  12725. 156.96 s [vector] unzip3: OK
  12726. 156.96 s [vector] +++ OK, passed 100 tests.
  12727. 156.96 s [vector] indexed: OK
  12728. 156.96 s [vector] +++ OK, passed 100 tests.
  12729. 156.97 s [vector] update: OK
  12730. 156.97 s [vector] +++ OK, passed 100 tests.
  12731. 156.97 s [vector] mempty: OK
  12732. 156.97 s [vector] +++ OK, passed 100 tests.
  12733. 156.97 s [vector] mappend: OK
  12734. 156.97 s [vector] +++ OK, passed 100 tests.
  12735. 157.02 s [vector] mconcat: OK (0.04s)
  12736. 157.02 s [vector] +++ OK, passed 100 tests.
  12737. 157.02 s [vector] glength: OK
  12738. 157.02 s [vector] +++ OK, passed 100 tests.
  12739. 157.02 s [vector] unstream
  12740. 157.02 s [vector] unstream == vunstream (exact): OK
  12741. 157.02 s [vector] +++ OK, passed 100 tests.
  12742. 157.02 s [vector] unstream == vunstream (unknown): OK
  12743. 157.02 s [vector] +++ OK, passed 100 tests.
  12744. 157.02 s [vector] unstreamR ~= vunstream (exact): OK
  12745. 157.02 s [vector] +++ OK, passed 100 tests.
  12746. 157.02 s [vector] unstreamR ~= vunstream (unknown): OK
  12747. 157.02 s [vector] +++ OK, passed 100 tests.
  12748. 157.02 s [vector] Data.Vector.Storable.Vector Alignment
  12749. 157.02 s [vector] Aligned Double: OK
  12750. 157.02 s [vector] Aligned Int: OK
  12751. 157.02 s [vector] Regression tests
  12752. 157.02 s [vector] enumFromTo crash #188
  12753. 157.02 s [vector] Word8: OK
  12754. 157.02 s [vector] Word16: OK
  12755. 157.02 s [vector] Word32: OK
  12756. 157.02 s [vector] Word64: OK
  12757. 157.02 s [vector] Word: OK
  12758. 157.02 s [vector] Int8: OK
  12759. 157.02 s [vector] Int16: OK
  12760. 157.02 s [vector] Int32: OK
  12761. 157.02 s [vector] Int64: OK
  12762. 157.02 s [vector] Int: OK
  12763. 157.02 s [vector] Char: OK
  12764. 157.02 s [vector] Negative tests
  12765. 157.02 s [vector] slice out of bounds #257
  12766. 157.02 s [vector] Boxed
  12767. 157.02 s [vector] Negative ix: OK
  12768. 157.02 s [vector] Negative size: OK
  12769. 157.02 s [vector] Negative ix and size: OK
  12770. 157.02 s [vector] Too large ix: OK
  12771. 157.02 s [vector] Too large size: OK
  12772. 157.02 s [vector] Too large ix and size: OK
  12773. 157.02 s [vector] Overflow: OK
  12774. 157.02 s [vector] OutOfMemory: OK
  12775. 157.02 s [vector] Primitive
  12776. 157.02 s [vector] Negative ix: OK
  12777. 157.02 s [vector] Negative size: OK
  12778. 157.02 s [vector] Negative ix and size: OK
  12779. 157.02 s [vector] Too large ix: OK
  12780. 157.02 s [vector] Too large size: OK
  12781. 157.02 s [vector] Too large ix and size: OK
  12782. 157.02 s [vector] Overflow: OK
  12783. 157.02 s [vector] OutOfMemory: OK
  12784. 157.02 s [vector] Storable
  12785. 157.02 s [vector] Negative ix: OK
  12786. 157.02 s [vector] Negative size: OK
  12787. 157.02 s [vector] Negative ix and size: OK
  12788. 157.02 s [vector] Too large ix: OK
  12789. 157.02 s [vector] Too large size: OK
  12790. 157.02 s [vector] Too large ix and size: OK
  12791. 157.02 s [vector] Overflow: OK
  12792. 157.02 s [vector] OutOfMemory: OK
  12793. 157.02 s [vector] Unboxed
  12794. 157.02 s [vector] Negative ix: OK
  12795. 157.02 s [vector] Negative size: OK
  12796. 157.02 s [vector] Negative ix and size: OK
  12797. 157.02 s [vector] Too large ix: OK
  12798. 157.02 s [vector] Too large size: OK
  12799. 157.02 s [vector] Too large ix and size: OK
  12800. 157.02 s [vector] Overflow: OK
  12801. 157.02 s [vector] OutOfMemory: OK
  12802. 157.02 s [vector] take #282
  12803. 157.02 s [vector] Boxed: OK
  12804. 157.02 s [vector] Primitive: OK
  12805. 157.02 s [vector] Storable: OK
  12806. 157.02 s [vector] Unboxed: OK
  12807. 157.02 s [vector] Data.Vector
  12808. 157.02 s [vector] MonadFix: OK
  12809. 157.02 s [vector] toFromArray: OK
  12810. 157.02 s [vector] toFromArraySlice: OK
  12811. 157.02 s [vector] toFromArraySliceUnsafe: OK
  12812. 157.02 s [vector] toFromMutableArray: OK
  12813. 157.02 s [vector] Data.Vector.Mutable (Move): OK
  12814. 157.02 s [vector] +++ OK, passed 100 tests; 18 discarded.
  12815. 157.02 s [vector] Data.Vector.Primitive.Mutable (Move): OK
  12816. 157.02 s [vector] +++ OK, passed 100 tests; 12 discarded.
  12817. 157.02 s [vector] Data.Vector.Unboxed.Mutable (Move): OK
  12818. 157.02 s [vector] +++ OK, passed 100 tests; 13 discarded.
  12819. 157.02 s [vector] Data.Vector.Storable.Mutable (Move): OK
  12820. 157.03 s [vector] +++ OK, passed 100 tests; 16 discarded.
  12821. 157.03 s [vector] Data.Vector.Generic.Mutable (nextPermutation): OK
  12822. 157.03 s [vector] +++ OK, passed 100 tests.
  12823. 157.03 s [vector] Data.Vector.Generic.Mutable (prevPermutation): OK
  12824. 157.03 s [vector] +++ OK, passed 100 tests.
  12825. 157.03 s [vector] Data.Vector.Generic.Mutable (nextPermutation then prevPermutation = id): OK
  12826. 157.03 s [vector] +++ OK, passed 100 tests.
  12827. 157.03 s [vector] Data.Vector.Generic.Mutable (prevPermutation then nextPermutation = id): OK
  12828. 157.03 s [vector] +++ OK, passed 100 tests.
  12829. 157.03 s [vector]
  12830. 157.03 s [vector] All 2808 tests passed (10.62s)
  12831. 157.04 s [vector] Test suite vector-tests-O2: PASS
  12832. 157.04 s [vector] Test suite logged to: dist/test/vector-0.13.2.0-vector-tests-O2.log
  12833. 157.04 s [vector] 2 of 2 test suites (2 of 2 test cases) passed.
  12834. 157.05 s [vector] Phase: haddockPhase
  12835. 157.05 s [vector] Phase: installPhase
  12836. 157.10 s [vector] Installing library in /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  12837. 157.66 s [vector] Installing internal library benchmarks-O2 in /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/vector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2
  12838. 157.89 s [vector] Phase: fixupPhase
  12839. 157.90 s [vector] shrinking RPATHs of ELF executables and libraries in /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0
  12840. 157.92 s [vector] shrinking /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHSvector-0.13.2.0-K7RaEIChlREEqHxVuF3SH8-benchmarks-O2-ghc9.12.2.so
  12841. 157.93 s [vector] shrinking /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHSvector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH-ghc9.12.2.so
  12842. 157.94 s [vector] checking for references to /build/ in /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0...
  12843. 157.98 s [vector] patching script interpreter paths in /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0
  12844. 157.99 s [vector] stripping (with command strip and flags -S -p) in /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0/lib
  12845. 158.62 s [vector:post-build] Uploading to cachix cache "sellout": /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0
  12846. 159.08 s [vector:post-build] Pushing 1 paths (97 are already present) using zstd to cache sellout ⏳
  12847. 159.08 s [vector:post-build]
  12848. 159.43 s [vector:post-build] Pushing /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0 (54.18 MiB)
  12849. 161.89 s [vector:post-build]
  12850. 161.89 s [vector:post-build] All done.
  12851. 161.91 s [vector:post-build] Uploading to the NixCI cache: /nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0
  12852. 162.06 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  12853. 162.06 s [vector:post-build] copying 1 paths...
  12854. 162.06 s [vector:post-build] copying path '/nix/store/71ln3bc26gqnrxbky6iaic4k8npwd9d2-vector-0.13.2.0' to 'https://cache.nix-ci.com'...
  12855. 173.88 s [vector:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  12856. 174.13 s [vector:post-build] copying 1 paths...
  12857. 174.13 s [vector:post-build] copying path '/nix/store/ky0jn5rgd99f7m5053dqbc7ssfra3h61-vector-0.13.2.0.drv' to 'https://cache.nix-ci.com'...
  12858. 174.40 s Progress: 4 of 14 built, 43 of 43 downloaded from cache
  12859. 174.43 s Building /nix/store/zsswivj44k6g1mv7kqsfri8v1ghfgidx-nothunks-0.3.1.drv
  12860. 174.57 s [nothunks] Phase: setupCompilerEnvironmentPhase
  12861. 174.57 s [nothunks] Build with /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2.
  12862. 174.76 s [nothunks] Phase: unpackPhase
  12863. 174.76 s [nothunks] unpacking source archive /nix/store/y2bnhvmx2j2igw7ad1jf22kp1dlk8pg2-nothunks-0.3.1.tar.gz
  12864. 174.77 s [nothunks] source root is nothunks-0.3.1
  12865. 174.77 s [nothunks] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "nothunks-0.3.1/test/Test/NoThunks/Class.hs"
  12866. 174.78 s [nothunks] Phase: patchPhase
  12867. 174.78 s [nothunks] Replace Cabal file with edited version from mirror://hackage/nothunks-0.3.1/revision/1.cabal.
  12868. 174.79 s [nothunks] Run jailbreak-cabal to lift version restrictions on build inputs.
  12869. 174.79 s [nothunks] Phase: compileBuildDriverPhase
  12870. 174.80 s [nothunks] setupCompileFlags: -package-db=/build/tmp.02SCxZ57gG/setup-package.conf.d -threaded
  12871. 174.84 s [nothunks] [1 of 2] Compiling Main ( /nix/store/4mdp8nhyfddh7bllbi7xszz7k9955n79-Setup.hs, /build/tmp.02SCxZ57gG/Main.o )
  12872. 174.88 s [nothunks] [2 of 2] Linking Setup
  12873. 176.05 s [nothunks] Phase: updateAutotoolsGnuConfigScriptsPhase
  12874. 176.06 s [nothunks] Phase: configurePhase
  12875. 176.06 s [nothunks] configureFlags: --verbose --prefix=/nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/59pxp3k7s9gkkphzzdc2080x7vmrwpsf-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1 --with-gcc=gcc --package-db=/build/tmp.02SCxZ57gG/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  12876. 176.07 s [nothunks] Using Parsec parser
  12877. 176.07 s [nothunks] Configuring nothunks-0.3.1...
  12878. 176.10 s [nothunks] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  12879. 176.10 s [nothunks] 'ghc' version < 9.12):
  12880. 176.10 s [nothunks] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc is version
  12881. 176.10 s [nothunks] 9.12.2
  12882. 176.35 s [nothunks] Flags chosen: bytestring=True, text=True, vector=True
  12883. 176.58 s [nothunks] Dependency base: using base-4.21.0.0
  12884. 176.58 s [nothunks] Dependency bytestring >=0.10 && <0.13: using bytestring-0.12.2.0
  12885. 176.58 s [nothunks] Dependency containers: using containers-0.7
  12886. 176.58 s [nothunks] Dependency ghc-heap: using ghc-heap-9.12.2
  12887. 176.58 s [nothunks] Dependency stm: using stm-2.5.3.1
  12888. 176.58 s [nothunks] Dependency text >=1.2 && <1.3 || >=2 && <2.2: using text-2.1.2
  12889. 176.58 s [nothunks] Dependency time: using time-1.14
  12890. 176.58 s [nothunks] Dependency vector >=0.12 && <0.14: using vector-0.13.2.0
  12891. 176.58 s [nothunks] Dependency wherefrom-compat >=0.1.1 && <0.3: using wherefrom-compat-0.1.1.1
  12892. 176.58 s [nothunks] Dependency base: using base-4.21.0.0
  12893. 176.58 s [nothunks] Dependency containers: using containers-0.7
  12894. 176.58 s [nothunks] Dependency ghc-prim: using ghc-prim-0.13.0
  12895. 176.58 s [nothunks] Dependency hedgehog: using hedgehog-1.5
  12896. 176.58 s [nothunks] Dependency nothunks: using nothunks-0.3.1
  12897. 176.58 s [nothunks] Dependency random: using random-1.2.1.3
  12898. 176.58 s [nothunks] Dependency stm: using stm-2.5.3.1
  12899. 176.58 s [nothunks] Dependency tasty: using tasty-1.5.3
  12900. 176.58 s [nothunks] Dependency tasty-hedgehog: using tasty-hedgehog-1.4.0.2
  12901. 176.58 s [nothunks] Source component graph:
  12902. 176.58 s [nothunks] component lib
  12903. 176.58 s [nothunks] component test:nothunks-test dependency lib
  12904. 176.58 s [nothunks] Configured component graph:
  12905. 176.58 s [nothunks] component nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  12906. 176.58 s [nothunks] include base-4.21.0.0-b334
  12907. 176.58 s [nothunks] include bytestring-0.12.2.0-0cf8
  12908. 176.58 s [nothunks] include containers-0.7-d79e
  12909. 176.58 s [nothunks] include ghc-heap-9.12.2-832c
  12910. 176.58 s [nothunks] include stm-2.5.3.1-ef8d
  12911. 176.58 s [nothunks] include text-2.1.2-e822
  12912. 176.58 s [nothunks] include time-1.14-3dc5
  12913. 176.58 s [nothunks] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  12914. 176.58 s [nothunks] include wherefrom-compat-0.1.1.1-A92ja6MztHp7tH6ALtCvHn
  12915. 176.58 s [nothunks] component nothunks-0.3.1-3kSAicIDPyE2qJz2aIZqdd-nothunks-test
  12916. 176.58 s [nothunks] include base-4.21.0.0-b334
  12917. 176.58 s [nothunks] include containers-0.7-d79e
  12918. 176.58 s [nothunks] include ghc-prim-0.13.0-cbf2
  12919. 176.58 s [nothunks] include hedgehog-1.5-3LP1um1Ps6qGX0qFDBaPPL
  12920. 176.58 s [nothunks] include nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  12921. 176.58 s [nothunks] include random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  12922. 176.58 s [nothunks] include stm-2.5.3.1-ef8d
  12923. 176.58 s [nothunks] include tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  12924. 176.58 s [nothunks] include tasty-hedgehog-1.4.0.2-5ishr1AGQIN1gnZlV75Roe
  12925. 176.58 s [nothunks] Linked component graph:
  12926. 176.58 s [nothunks] unit nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  12927. 176.58 s [nothunks] include base-4.21.0.0-b334
  12928. 176.58 s [nothunks] include bytestring-0.12.2.0-0cf8
  12929. 176.58 s [nothunks] include containers-0.7-d79e
  12930. 176.58 s [nothunks] include ghc-heap-9.12.2-832c
  12931. 176.58 s [nothunks] include stm-2.5.3.1-ef8d
  12932. 176.58 s [nothunks] include text-2.1.2-e822
  12933. 176.58 s [nothunks] include time-1.14-3dc5
  12934. 176.58 s [nothunks] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  12935. 176.58 s [nothunks] include wherefrom-compat-0.1.1.1-A92ja6MztHp7tH6ALtCvHn
  12936. 176.58 s [nothunks] NoThunks.Class=nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl:NoThunks.Class
  12937. 176.58 s [nothunks] unit nothunks-0.3.1-3kSAicIDPyE2qJz2aIZqdd-nothunks-test
  12938. 176.58 s [nothunks] include base-4.21.0.0-b334
  12939. 176.58 s [nothunks] include containers-0.7-d79e
  12940. 176.58 s [nothunks] include ghc-prim-0.13.0-cbf2
  12941. 176.58 s [nothunks] include hedgehog-1.5-3LP1um1Ps6qGX0qFDBaPPL
  12942. 176.58 s [nothunks] include nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  12943. 176.58 s [nothunks] include random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  12944. 176.58 s [nothunks] include stm-2.5.3.1-ef8d
  12945. 176.58 s [nothunks] include tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  12946. 176.58 s [nothunks] include tasty-hedgehog-1.4.0.2-5ishr1AGQIN1gnZlV75Roe
  12947. 176.58 s [nothunks] Ready component graph:
  12948. 176.58 s [nothunks] definite nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  12949. 176.58 s [nothunks] depends base-4.21.0.0-b334
  12950. 176.58 s [nothunks] depends bytestring-0.12.2.0-0cf8
  12951. 176.58 s [nothunks] depends containers-0.7-d79e
  12952. 176.58 s [nothunks] depends ghc-heap-9.12.2-832c
  12953. 176.58 s [nothunks] depends stm-2.5.3.1-ef8d
  12954. 176.58 s [nothunks] depends text-2.1.2-e822
  12955. 176.58 s [nothunks] depends time-1.14-3dc5
  12956. 176.58 s [nothunks] depends vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  12957. 176.58 s [nothunks] depends wherefrom-compat-0.1.1.1-A92ja6MztHp7tH6ALtCvHn
  12958. 176.58 s [nothunks] definite nothunks-0.3.1-3kSAicIDPyE2qJz2aIZqdd-nothunks-test
  12959. 176.58 s [nothunks] depends base-4.21.0.0-b334
  12960. 176.58 s [nothunks] depends containers-0.7-d79e
  12961. 176.58 s [nothunks] depends ghc-prim-0.13.0-cbf2
  12962. 176.58 s [nothunks] depends hedgehog-1.5-3LP1um1Ps6qGX0qFDBaPPL
  12963. 176.58 s [nothunks] depends nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  12964. 176.58 s [nothunks] depends random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  12965. 176.58 s [nothunks] depends stm-2.5.3.1-ef8d
  12966. 176.58 s [nothunks] depends tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  12967. 176.58 s [nothunks] depends tasty-hedgehog-1.4.0.2-5ishr1AGQIN1gnZlV75Roe
  12968. 176.58 s [nothunks] Using Cabal-3.14.1.0 compiled by ghc-9.12
  12969. 176.58 s [nothunks] Using compiler: ghc-9.12.2
  12970. 176.58 s [nothunks] Using install prefix:
  12971. 176.58 s [nothunks] /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1
  12972. 176.58 s [nothunks] Executables installed in:
  12973. 176.58 s [nothunks] /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1/bin
  12974. 176.58 s [nothunks] Libraries installed in:
  12975. 176.58 s [nothunks] /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  12976. 176.58 s [nothunks] Dynamic Libraries installed in:
  12977. 176.58 s [nothunks] /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3
  12978. 176.58 s [nothunks] Private executables installed in:
  12979. 176.58 s [nothunks] /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1/libexec/x86_64-linux-ghc-9.12.2-82d3/nothunks-0.3.1
  12980. 176.58 s [nothunks] Data files installed in:
  12981. 176.58 s [nothunks] /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1/share/x86_64-linux-ghc-9.12.2-82d3/nothunks-0.3.1
  12982. 176.58 s [nothunks] Documentation installed in:
  12983. 176.58 s [nothunks] /nix/store/59pxp3k7s9gkkphzzdc2080x7vmrwpsf-nothunks-0.3.1-doc/share/doc/nothunks-0.3.1
  12984. 176.58 s [nothunks] Configuration files installed in:
  12985. 176.58 s [nothunks] /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1/etc
  12986. 176.58 s [nothunks] No alex found
  12987. 176.58 s [nothunks] Using ar found on system at:
  12988. 176.58 s [nothunks] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  12989. 176.58 s [nothunks] No c2hs found
  12990. 176.58 s [nothunks] No cpphs found
  12991. 176.58 s [nothunks] No doctest found
  12992. 176.58 s [nothunks] Using gcc version 14.3.0 given by user at:
  12993. 176.58 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  12994. 176.58 s [nothunks] Using ghc version 9.12.2 found on system at:
  12995. 176.58 s [nothunks] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc
  12996. 176.58 s [nothunks] Using ghc-pkg version 9.12.2 found on system at:
  12997. 176.58 s [nothunks] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc-pkg-9.12.2
  12998. 176.58 s [nothunks] No ghcjs found
  12999. 176.58 s [nothunks] No ghcjs-pkg found
  13000. 176.58 s [nothunks] No greencard found
  13001. 176.58 s [nothunks] Using haddock version 2.30.0 found on system at:
  13002. 176.58 s [nothunks] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/haddock-ghc-9.12.2
  13003. 176.58 s [nothunks] No happy found
  13004. 176.58 s [nothunks] No haskell-suite found
  13005. 176.58 s [nothunks] No haskell-suite-pkg found
  13006. 176.58 s [nothunks] No hmake found
  13007. 176.58 s [nothunks] Using hpc version 0.69 found on system at:
  13008. 176.58 s [nothunks] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hpc-ghc-9.12.2
  13009. 176.58 s [nothunks] Using hsc2hs version 0.68.10 found on system at:
  13010. 176.58 s [nothunks] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  13011. 176.58 s [nothunks] Using hscolour version 1.25 found on system at:
  13012. 176.58 s [nothunks] /nix/store/02s9rad0jn6nj8z96k357im73hkzqsnw-hscolour-1.25/bin/HsColour
  13013. 176.58 s [nothunks] No jhc found
  13014. 176.58 s [nothunks] Using ld found on system at:
  13015. 176.58 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  13016. 176.58 s [nothunks] No pkg-config found
  13017. 176.58 s [nothunks] Using runghc version 9.12.2 found on system at:
  13018. 176.58 s [nothunks] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/runghc-9.12.2
  13019. 176.58 s [nothunks] Using strip version 2.44 found on system at:
  13020. 176.58 s [nothunks] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  13021. 176.58 s [nothunks] Using tar found on system at:
  13022. 176.58 s [nothunks] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  13023. 176.58 s [nothunks] No uhc found
  13024. 176.79 s [nothunks] Phase: buildPhase
  13025. 176.85 s [nothunks] Preprocessing library for nothunks-0.3.1...
  13026. 176.85 s [nothunks] Building library for nothunks-0.3.1...
  13027. 176.92 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.o, dist/build/NoThunks/Class.dyn_o )
  13028. 178.87 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, dist/build/NoThunks/Class.p_o )
  13029. 181.48 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1...
  13030. 181.48 s [nothunks] Building test suite 'nothunks-test' for nothunks-0.3.1...
  13031. 181.56 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 )
  13032. 183.20 s [nothunks] [2 of 2] Compiling Main ( test/Main.hs, dist/build/nothunks-test/nothunks-test-tmp/Main.o )
  13033. 183.49 s [nothunks] [3 of 3] Linking dist/build/nothunks-test/nothunks-test
  13034. 184.37 s [nothunks] Phase: checkPhase
  13035. 184.60 s [nothunks] Running 1 test suites...
  13036. 184.60 s [nothunks] Test suite nothunks-test: RUNNING...
  13037. 184.61 s [nothunks] Tests
  13038. 184.61 s [nothunks] NoThunks.Class
  13039. 184.61 s [nothunks] Sanity
  13040. 184.61 s [nothunks] IntNotNF: OK
  13041. 184.61 s [nothunks] ✓ <interactive> passed 1 test.
  13042. 184.61 s [nothunks] IntIsNF: OK
  13043. 184.61 s [nothunks] ✓ <interactive> passed 1 test.
  13044. 184.61 s [nothunks] Pair: OK
  13045. 184.61 s [nothunks] ✓ <interactive> passed 1 test.
  13046. 184.61 s [nothunks] Sum: OK
  13047. 184.61 s [nothunks] ✓ <interactive> passed 1 test.
  13048. 184.61 s [nothunks] Fn: OK
  13049. 184.61 s [nothunks] ✓ <interactive> passed 1 test.
  13050. 184.61 s [nothunks] IO: OK
  13051. 184.61 s [nothunks] ✓ <interactive> passed 1 test.
  13052. 184.61 s [nothunks] InspectHeap
  13053. 184.63 s [nothunks] Int: OK (0.01s)
  13054. 184.63 s [nothunks] ✓ <interactive> passed 1000 tests.
  13055. 184.63 s [nothunks] Just ["Int"] 51% ██████████▏·········
  13056. 184.64 s [nothunks] Nothing 49% █████████▊··········
  13057. 184.65 s [nothunks] IntInt: OK (0.02s)
  13058. 184.65 s [nothunks] ✓ <interactive> passed 1000 tests.
  13059. 184.65 s [nothunks] Just ["Int","Tuple2"] 36% ███████▎············
  13060. 184.65 s [nothunks] Just ["Tuple2"] 51% ██████████▏·········
  13061. 184.65 s [nothunks] Nothing 13% ██▌·················
  13062. 184.65 s [nothunks] SumInt: OK (0.02s)
  13063. 184.65 s [nothunks] ✓ <interactive> passed 1000 tests.
  13064. 184.65 s [nothunks] Just ["Either"] 32% ██████▍·············
  13065. 184.65 s [nothunks] Just ["Int","Either"] 32% ██████▍·············
  13066. 184.65 s [nothunks] Nothing 35% ███████·············
  13067. 184.67 s [nothunks] ListInt: OK (0.02s)
  13068. 184.67 s [nothunks] ✓ <interactive> passed 1000 tests.
  13069. 184.67 s [nothunks] Just ["Int","List"] 22% ████▍···············
  13070. 184.67 s [nothunks] Just ["List"] 43% ████████▌···········
  13071. 184.67 s [nothunks] Nothing 35% ███████·············
  13072. 184.69 s [nothunks] IntListInt: OK (0.02s)
  13073. 184.69 s [nothunks] ✓ <interactive> passed 1000 tests.
  13074. 184.69 s [nothunks] Just ["Int","List","Tuple2"] 5% █···················
  13075. 184.69 s [nothunks] Just ["Int","Tuple2"] 26% █████▎··············
  13076. 184.69 s [nothunks] Just ["List","Tuple2"] 12% ██▍·················
  13077. 184.69 s [nothunks] Just ["Tuple2"] 48% █████████▌··········
  13078. 184.69 s [nothunks] Nothing 8% █▋··················
  13079. 184.71 s [nothunks] SeqInt: ✗ EXPECTED FAILURE failed at test/Test/NoThunks/Class.hs:179:7
  13080. 184.71 s [nothunks] after 14 tests and 2 shrinks.
  13081. 184.71 s [nothunks] shrink path: 14:b2
  13082. 184.71 s [nothunks] Just ["Int","Seq"] 50% ██████████··········
  13083. 184.71 s [nothunks] Nothing 43% ████████▌···········
  13084. 184.71 s [nothunks]
  13085. 184.71 s [nothunks] ┏━━ test/Test/NoThunks/Class.hs ━━━
  13086. 184.71 s [nothunks] 166 ┃ testWithModel :: forall a. FromModel a
  13087. 184.71 s [nothunks] 167 ┃ => (Maybe ThunkInfo -> Maybe [String] -> Bool)
  13088. 184.71 s [nothunks] 168 ┃ -> Proxy a
  13089. 184.71 s [nothunks] 169 ┃ -- ^ Compare @ThunkInfo@. When we use 'noThunks' this
  13090. 184.71 s [nothunks] 170 ┃ -- can just be @(==)@; however, when we use 'isNormalForm', the
  13091. 184.71 s [nothunks] 171 ┃ -- context we will get from the model will be too detailed.
  13092. 184.71 s [nothunks] 172 ┃ -> Property
  13093. 184.71 s [nothunks] 173 ┃ testWithModel compareInfo _proxy = withTests 1000 $ property $ do
  13094. 184.71 s [nothunks] 174 ┃ m :: Model a <- forAll genModel
  13095. 184.71 s [nothunks] ┃ │ Wrap
  13096. 184.71 s [nothunks] ┃ │ { unwrap =
  13097. 184.71 s [nothunks] ┃ │ SeqEnqueue
  13098. 184.71 s [nothunks] ┃ │ (IntValue 0)
  13099. 184.71 s [nothunks] ┃ │ (SeqEnqueue
  13100. 184.71 s [nothunks] ┃ │ (IntValue 0)
  13101. 184.71 s [nothunks] ┃ │ (SeqEnqueue
  13102. 184.71 s [nothunks] ┃ │ (IntValue 0)
  13103. 184.71 s [nothunks] ┃ │ (SeqEnqueue
  13104. 184.71 s [nothunks] ┃ │ (IntValue 0)
  13105. 184.71 s [nothunks] ┃ │ (SeqEnqueue (IntValue 0) (SeqEnqueue (IntValue 0) SeqEmpty)))))
  13106. 184.71 s [nothunks] ┃ │ }
  13107. 184.71 s [nothunks] 175 ┃ collect $ modelUnexpected [] m
  13108. 184.71 s [nothunks] 176 ┃ fromModel m $ \a -> do
  13109. 184.71 s [nothunks] 177 ┃ annotate $ show $ modelIsNF [] m
  13110. 184.71 s [nothunks] ┃ │ IsNF
  13111. 184.71 s [nothunks] 178 ┃ isNF <- liftIO $ noThunks [] a
  13112. 184.71 s [nothunks] 179 ┃ Hedgehog.diff isNF compareInfo (modelUnexpected [] m)
  13113. 184.71 s [nothunks] ┃ ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  13114. 184.71 s [nothunks] ┃ │ ━━━ Failed (- lhs) (+ rhs) ━━━
  13115. 184.71 s [nothunks] ┃ │ - Just
  13116. 184.71 s [nothunks] ┃ │ - ThunkInfo
  13117. 184.71 s [nothunks] ┃ │ - { thunkContext = [ "..." , "Seq Int" ] , thunkInfo = Nothing }
  13118. 184.71 s [nothunks] ┃ │ + Nothing
  13119. 184.71 s [nothunks]
  13120. 184.71 s [nothunks] This failure can be reproduced by running:
  13121. 184.71 s [nothunks] > recheckAt (Seed 13935198873513635300 5580946004779282297) "14:b2" EXPECTED FAILURE
  13122. 184.71 s [nothunks]
  13123. 184.71 s [nothunks] OK (0.02s)
  13124. 184.71 s [nothunks] ✓ <interactive> passed 1 test.
  13125. 184.71 s [nothunks] Model
  13126. 184.73 s [nothunks] Int: OK (0.01s)
  13127. 184.73 s [nothunks] ✓ <interactive> passed 1000 tests.
  13128. 184.73 s [nothunks] Just ["Int"] 46% █████████▎··········
  13129. 184.73 s [nothunks] Nothing 54% ██████████▋·········
  13130. 184.75 s [nothunks] IntInt: OK (0.02s)
  13131. 184.75 s [nothunks] ✓ <interactive> passed 1000 tests.
  13132. 184.75 s [nothunks] Just ["Int","Tuple2"] 38% ███████▌············
  13133. 184.75 s [nothunks] Just ["Tuple2"] 50% ██████████··········
  13134. 184.75 s [nothunks] Nothing 12% ██▎·················
  13135. 184.75 s [nothunks] SumInt: OK (0.01s)
  13136. 184.75 s [nothunks] ✓ <interactive> passed 1000 tests.
  13137. 184.75 s [nothunks] Just ["Either"] 33% ██████▌·············
  13138. 184.75 s [nothunks] Just ["Int","Either"] 33% ██████▌·············
  13139. 184.75 s [nothunks] Nothing 34% ██████▊·············
  13140. 184.77 s [nothunks] ListInt: OK (0.02s)
  13141. 184.77 s [nothunks] ✓ <interactive> passed 1000 tests.
  13142. 184.77 s [nothunks] Just ["Int","List"] 21% ████▏···············
  13143. 184.77 s [nothunks] Just ["List"] 46% █████████···········
  13144. 184.77 s [nothunks] Nothing 34% ██████▋·············
  13145. 184.79 s [nothunks] IntListInt: OK (0.01s)
  13146. 184.79 s [nothunks] ✓ <interactive> passed 1000 tests.
  13147. 184.79 s [nothunks] Just ["Int","List","Tuple2"] 4% ▉···················
  13148. 184.79 s [nothunks] Just ["Int","Tuple2"] 26% █████▏··············
  13149. 184.79 s [nothunks] Just ["List","Tuple2"] 10% ██··················
  13150. 184.79 s [nothunks] Just ["Tuple2"] 51% ██████████▏·········
  13151. 184.80 s [nothunks] Nothing 8% █▋··················
  13152. 184.87 s [nothunks] SeqInt: OK (0.07s)
  13153. 184.87 s [nothunks] ✓ <interactive> passed 1000 tests.
  13154. 184.87 s [nothunks] Just ["Int","Seq"] 46% █████████▎··········
  13155. 184.87 s [nothunks] Nothing 54% ██████████▋·········
  13156. 184.89 s [nothunks] AllowThunksIn: OK (0.02s)
  13157. 184.89 s [nothunks] ✓ <interactive> passed 1000 tests.
  13158. 184.89 s [nothunks] Just ["Int","field2","Record"] 23% ████▌···············
  13159. 184.89 s [nothunks] Just ["Record"] 52% ██████████▍·········
  13160. 184.89 s [nothunks] Nothing 25% █████···············
  13161. 184.89 s [nothunks] Fn: OK
  13162. 184.89 s [nothunks] ✓ <interactive> passed 1000 tests.
  13163. 184.89 s [nothunks] Just ["->"] 23% ████▋···············
  13164. 184.89 s [nothunks] Nothing 77% ███████████████▎····
  13165. 184.91 s [nothunks] IO: OK
  13166. 184.91 s [nothunks] ✓ <interactive> passed 1000 tests.
  13167. 184.91 s [nothunks] Just ["IO"] 24% ████▊···············
  13168. 184.91 s [nothunks] Nothing 76% ███████████████▏····
  13169. 184.91 s [nothunks] ThunkFreeFn: OK
  13170. 184.91 s [nothunks] ✓ <interactive> passed 1000 tests.
  13171. 184.91 s [nothunks] Just ["->"] 24% ████▊···············
  13172. 184.91 s [nothunks] Just ["...","->"] 40% ████████············
  13173. 184.91 s [nothunks] Nothing 36% ███████▏············
  13174. 184.92 s [nothunks] ThunkFreeIO: OK (0.01s)
  13175. 184.92 s [nothunks] ✓ <interactive> passed 1000 tests.
  13176. 184.92 s [nothunks] Just ["...","IO"] 36% ███████▏············
  13177. 184.92 s [nothunks] Just ["IO"] 24% ████▋···············
  13178. 184.92 s [nothunks] Nothing 40% ████████············
  13179. 184.92 s [nothunks] MutableVars
  13180. 184.92 s [nothunks] IORef
  13181. 184.92 s [nothunks] NotNF: OK
  13182. 184.92 s [nothunks] ✓ <interactive> passed 1 test.
  13183. 184.92 s [nothunks] NF: OK
  13184. 184.92 s [nothunks] ✓ <interactive> passed 1 test.
  13185. 184.92 s [nothunks] NotNFPure: OK
  13186. 184.92 s [nothunks] ✓ <interactive> passed 1 test.
  13187. 184.92 s [nothunks] NFPure: OK
  13188. 184.92 s [nothunks] ✓ <interactive> passed 1 test.
  13189. 184.92 s [nothunks] NotNFAtomically: OK
  13190. 184.92 s [nothunks] ✓ <interactive> passed 1 test.
  13191. 184.92 s [nothunks] NFAtomically: OK
  13192. 184.92 s [nothunks] ✓ <interactive> passed 1 test.
  13193. 184.92 s [nothunks] MVar
  13194. 184.92 s [nothunks] NotNF: OK
  13195. 184.92 s [nothunks] ✓ <interactive> passed 1 test.
  13196. 184.92 s [nothunks] NF: OK
  13197. 184.92 s [nothunks] ✓ <interactive> passed 1 test.
  13198. 184.92 s [nothunks] NotNFPure: OK
  13199. 184.92 s [nothunks] ✓ <interactive> passed 1 test.
  13200. 184.92 s [nothunks] NFPure: OK
  13201. 184.92 s [nothunks] ✓ <interactive> passed 1 test.
  13202. 184.92 s [nothunks] NotNFAtomically: OK
  13203. 184.92 s [nothunks] ✓ <interactive> passed 1 test.
  13204. 184.92 s [nothunks] NFAtomically: OK
  13205. 184.92 s [nothunks] ✓ <interactive> passed 1 test.
  13206. 184.92 s [nothunks] TVar
  13207. 184.92 s [nothunks] NotNF: OK
  13208. 184.92 s [nothunks] ✓ <interactive> passed 1 test.
  13209. 184.92 s [nothunks] NF: OK
  13210. 184.92 s [nothunks] ✓ <interactive> passed 1 test.
  13211. 184.92 s [nothunks] NotNFPure: OK
  13212. 184.92 s [nothunks] ✓ <interactive> passed 1 test.
  13213. 184.92 s [nothunks] NFPure: OK
  13214. 184.92 s [nothunks] ✓ <interactive> passed 1 test.
  13215. 184.92 s [nothunks] NotNFAtomically: OK
  13216. 184.92 s [nothunks] ✓ <interactive> passed 1 test.
  13217. 184.92 s [nothunks] NFAtomically: OK
  13218. 184.92 s [nothunks] ✓ <interactive> passed 1 test.
  13219. 184.92 s [nothunks]
  13220. 184.92 s [nothunks] All 41 tests passed (0.31s)
  13221. 184.92 s [nothunks] Test suite nothunks-test: PASS
  13222. 184.92 s [nothunks] Test suite logged to: dist/test/nothunks-0.3.1-nothunks-test.log
  13223. 184.92 s [nothunks] 1 of 1 test suites (1 of 1 test cases) passed.
  13224. 184.93 s [nothunks] Phase: haddockPhase
  13225. 185.32 s [nothunks] Preprocessing library for nothunks-0.3.1...
  13226. 185.32 s [nothunks] Running Haddock on library for nothunks-0.3.1...
  13227. 185.32 s [nothunks] Warning: The documentation for the following packages are not installed. No
  13228. 185.32 s [nothunks] links will be generated to these packages: vector-0.13.2.0
  13229. 185.50 s [nothunks] [1 of 1] Compiling NoThunks.Class ( src/NoThunks/Class.hs, nothing ) [HIE file is missing]
  13230. 185.87 s [nothunks] Haddock coverage:
  13231. 185.87 s [nothunks] Warning: 'ThunkInfo' is ambiguous. It is defined
  13232. 185.87 s [nothunks] * at src/NoThunks/Class.hs:230:18
  13233. 185.87 s [nothunks] * at src/NoThunks/Class.hs:230:1
  13234. 185.87 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13235. 185.87 s [nothunks] by specifying the type/value namespace explicitly.
  13236. 185.87 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:230:1
  13237. 185.87 s [nothunks] Warning: 'GHC' is out of scope.
  13238. 185.87 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  13239. 185.87 s [nothunks] Warning: 'a' is out of scope.
  13240. 185.87 s [nothunks] If you qualify the identifier, haddock can try to link it anyway.
  13241. 185.87 s [nothunks] Warning: 'AllowThunksIn' is ambiguous. It is defined
  13242. 185.87 s [nothunks] * at src/NoThunks/Class.hs:334:48
  13243. 185.87 s [nothunks] * at src/NoThunks/Class.hs:334:1
  13244. 185.87 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13245. 185.87 s [nothunks] by specifying the type/value namespace explicitly.
  13246. 185.87 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:334:1
  13247. 185.87 s [nothunks] Warning: 'InspectHeap' is ambiguous. It is defined
  13248. 185.87 s [nothunks] * at src/NoThunks/Class.hs:353:25
  13249. 185.87 s [nothunks] * at src/NoThunks/Class.hs:353:1
  13250. 185.87 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13251. 185.87 s [nothunks] by specifying the type/value namespace explicitly.
  13252. 185.87 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:353:1
  13253. 185.87 s [nothunks] Warning: 'InspectHeapNamed' is ambiguous. It is defined
  13254. 185.87 s [nothunks] * at src/NoThunks/Class.hs:358:47
  13255. 185.87 s [nothunks] * at src/NoThunks/Class.hs:358:1
  13256. 185.87 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13257. 185.87 s [nothunks] by specifying the type/value namespace explicitly.
  13258. 185.87 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:358:1
  13259. 185.87 s [nothunks] Warning: 'OnlyCheckWhnf' is ambiguous. It is defined
  13260. 185.87 s [nothunks] * at src/NoThunks/Class.hs:308:27
  13261. 185.87 s [nothunks] * at src/NoThunks/Class.hs:308:1
  13262. 185.87 s [nothunks] You may be able to disambiguate the identifier by qualifying it or
  13263. 185.87 s [nothunks] by specifying the type/value namespace explicitly.
  13264. 185.87 s [nothunks] Defaulting to the one defined at src/NoThunks/Class.hs:308:1
  13265. 185.92 s [nothunks] 95% ( 20 / 21) in 'NoThunks.Class'
  13266. 185.92 s [nothunks] Missing documentation for:
  13267. 185.92 s [nothunks] Module header
  13268. 186.22 s [nothunks] Warning: NoThunks.Class: could not find link destinations for:
  13269. 186.22 s [nothunks] - NoThunks.Class.Elem
  13270. 186.22 s [nothunks] - NoThunks.Class.GShowTypeOf
  13271. 186.22 s [nothunks] - NoThunks.Class.GWRecordField
  13272. 186.22 s [nothunks] - NoThunks.Class.HasFields
  13273. 186.22 s [nothunks] - Data.Vector.Unboxed.Base.Vector
  13274. 186.22 s [nothunks] - Data.Vector.Vector
  13275. 186.22 s [nothunks] - NoThunks.Class.checkContainsThunks
  13276. 189.87 s [nothunks] Documentation created: dist/doc/html/nothunks,
  13277. 189.94 s [nothunks] dist/doc/html/nothunks/nothunks.txt
  13278. 190.24 s [nothunks] Preprocessing test suite 'nothunks-test' for nothunks-0.3.1...
  13279. 190.28 s [nothunks] Phase: installPhase
  13280. 190.33 s [nothunks] Installing library in /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  13281. 190.50 s [nothunks] Phase: fixupPhase
  13282. 190.51 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1
  13283. 190.51 s [nothunks] shrinking /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHSnothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl-ghc9.12.2.so
  13284. 190.52 s [nothunks] checking for references to /build/ in /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1...
  13285. 190.53 s [nothunks] patching script interpreter paths in /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1
  13286. 190.54 s [nothunks] stripping (with command strip and flags -S -p) in /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1/lib
  13287. 190.58 s [nothunks] shrinking RPATHs of ELF executables and libraries in /nix/store/59pxp3k7s9gkkphzzdc2080x7vmrwpsf-nothunks-0.3.1-doc
  13288. 190.58 s [nothunks] checking for references to /build/ in /nix/store/59pxp3k7s9gkkphzzdc2080x7vmrwpsf-nothunks-0.3.1-doc...
  13289. 190.60 s [nothunks] patching script interpreter paths in /nix/store/59pxp3k7s9gkkphzzdc2080x7vmrwpsf-nothunks-0.3.1-doc
  13290. 190.67 s [nothunks:post-build] Uploading to cachix cache "sellout": /nix/store/59pxp3k7s9gkkphzzdc2080x7vmrwpsf-nothunks-0.3.1-doc /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1
  13291. 191.13 s [nothunks:post-build] Pushing 2 paths (100 are already present) using zstd to cache sellout ⏳
  13292. 191.13 s [nothunks:post-build]
  13293. 191.49 s [nothunks:post-build] Pushing /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1 (2.86 MiB)
  13294. 191.65 s [nothunks:post-build] Pushing /nix/store/59pxp3k7s9gkkphzzdc2080x7vmrwpsf-nothunks-0.3.1-doc (839.31 KiB)
  13295. 192.57 s [nothunks:post-build]
  13296. 192.57 s [nothunks:post-build] All done.
  13297. 192.59 s [nothunks:post-build] Uploading to the NixCI cache: /nix/store/59pxp3k7s9gkkphzzdc2080x7vmrwpsf-nothunks-0.3.1-doc /nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1
  13298. 192.62 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13299. 192.82 s [nothunks:post-build] copying 2 paths...
  13300. 192.82 s [nothunks:post-build] copying path '/nix/store/59pxp3k7s9gkkphzzdc2080x7vmrwpsf-nothunks-0.3.1-doc' to 'https://cache.nix-ci.com'...
  13301. 193.13 s [nothunks:post-build] copying path '/nix/store/wdd9466w57iwxmyg4rkgk28qpf27cpaw-nothunks-0.3.1' to 'https://cache.nix-ci.com'...
  13302. 193.93 s [nothunks:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  13303. 194.18 s [nothunks:post-build] copying 1 paths...
  13304. 194.18 s [nothunks:post-build] copying path '/nix/store/zsswivj44k6g1mv7kqsfri8v1ghfgidx-nothunks-0.3.1.drv' to 'https://cache.nix-ci.com'...
  13305. 195.14 s Progress: 5 of 14 built, 43 of 43 downloaded from cache
  13306. 195.18 s Building /nix/store/2ivbb618b8h11ny2wdx7qjywgjg4d7kb-unordered-containers-0.2.20.1.drv
  13307. 195.28 s [unordered-containers] Phase: setupCompilerEnvironmentPhase
  13308. 195.28 s [unordered-containers] Build with /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2.
  13309. 195.44 s [unordered-containers] Phase: unpackPhase
  13310. 195.45 s [unordered-containers] unpacking source archive /nix/store/3jhrx7bdq3fc4fyqvqr344f82lb9n9iv-unordered-containers-0.2.20.1.tar.gz
  13311. 195.45 s [unordered-containers] source root is unordered-containers-0.2.20.1
  13312. 195.46 s [unordered-containers] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "unordered-containers-0.2.20.1/unordered-containers.cabal"
  13313. 195.46 s [unordered-containers] Phase: patchPhase
  13314. 195.47 s [unordered-containers] Phase: compileBuildDriverPhase
  13315. 195.47 s [unordered-containers] setupCompileFlags: -package-db=/build/tmp.hwGSJkgYiV/setup-package.conf.d -threaded
  13316. 195.52 s [unordered-containers] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.hwGSJkgYiV/Main.o )
  13317. 195.56 s [unordered-containers] [2 of 2] Linking Setup
  13318. 196.73 s [unordered-containers] Phase: updateAutotoolsGnuConfigScriptsPhase
  13319. 196.74 s [unordered-containers] Phase: configurePhase
  13320. 196.74 s [unordered-containers] configureFlags: --verbose --prefix=/nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/r8fiibcxm6cb3mgmz9mrnfxcsnwnswch-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1 --with-gcc=gcc --package-db=/build/tmp.hwGSJkgYiV/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  13321. 196.75 s [unordered-containers] Using Parsec parser
  13322. 196.75 s [unordered-containers] Configuring unordered-containers-0.2.20.1...
  13323. 196.77 s [unordered-containers] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  13324. 196.77 s [unordered-containers] 'ghc' version < 9.12):
  13325. 196.77 s [unordered-containers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc is version
  13326. 196.77 s [unordered-containers] 9.12.2
  13327. 197.01 s [unordered-containers] Flags chosen: debug=False
  13328. 197.24 s [unordered-containers] Dependency base >=4.10 && <5: using base-4.21.0.0
  13329. 197.24 s [unordered-containers] Dependency deepseq >=1.4.3: using deepseq-1.5.1.0
  13330. 197.24 s [unordered-containers] Dependency hashable >=1.4 && <1.6: using hashable-1.5.0.0
  13331. 197.24 s [unordered-containers] Dependency template-haskell <2.24: using template-haskell-2.23.0.0
  13332. 197.24 s [unordered-containers] Dependency ChasingBottoms: using ChasingBottoms-1.3.1.17
  13333. 197.24 s [unordered-containers] Dependency HUnit: using HUnit-1.6.2.0
  13334. 197.24 s [unordered-containers] Dependency QuickCheck >=2.4.0.1: using QuickCheck-2.15.0.1
  13335. 197.24 s [unordered-containers] Dependency base: using base-4.21.0.0
  13336. 197.24 s [unordered-containers] Dependency containers >=0.5.8: using containers-0.7
  13337. 197.24 s [unordered-containers] Dependency hashable: using hashable-1.5.0.0
  13338. 197.24 s [unordered-containers] Dependency nothunks >=0.1.3: using nothunks-0.3.1
  13339. 197.24 s [unordered-containers] Dependency random: using random-1.2.1.3
  13340. 197.24 s [unordered-containers] Dependency tasty >=1.4.0.3: using tasty-1.5.3
  13341. 197.24 s [unordered-containers] Dependency tasty-hunit >=0.10.0.3: using tasty-hunit-0.10.2
  13342. 197.24 s [unordered-containers] Dependency tasty-quickcheck >=0.10.1.2: using tasty-quickcheck-0.11.1
  13343. 197.24 s [unordered-containers] Dependency unordered-containers: using unordered-containers-0.2.20.1
  13344. 197.24 s [unordered-containers] Source component graph:
  13345. 197.24 s [unordered-containers] component lib
  13346. 197.24 s [unordered-containers] component test:unordered-containers-tests dependency lib
  13347. 197.24 s [unordered-containers] Configured component graph:
  13348. 197.24 s [unordered-containers] component unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  13349. 197.24 s [unordered-containers] include base-4.21.0.0-b334
  13350. 197.24 s [unordered-containers] include deepseq-1.5.1.0-3c62
  13351. 197.24 s [unordered-containers] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  13352. 197.24 s [unordered-containers] include template-haskell-2.23.0.0-4ee9
  13353. 197.24 s [unordered-containers] component unordered-containers-0.2.20.1-33hNwrDDYUvDIxwoJthJjL-unordered-containers-tests
  13354. 197.24 s [unordered-containers] include ChasingBottoms-1.3.1.17-5GE1PYLkkwE5eKyEuTckWY
  13355. 197.24 s [unordered-containers] include HUnit-1.6.2.0-3ZugMwA5Fqe3c2fSrjhIxu
  13356. 197.24 s [unordered-containers] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  13357. 197.24 s [unordered-containers] include base-4.21.0.0-b334
  13358. 197.24 s [unordered-containers] include containers-0.7-d79e
  13359. 197.24 s [unordered-containers] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  13360. 197.24 s [unordered-containers] include nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  13361. 197.24 s [unordered-containers] include random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  13362. 197.24 s [unordered-containers] include tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  13363. 197.24 s [unordered-containers] include tasty-hunit-0.10.2-JRT4tyEuMHKBzpxUU6VUG8
  13364. 197.24 s [unordered-containers] include tasty-quickcheck-0.11.1-Ca4DEyt784fFBsV7HOinsy
  13365. 197.24 s [unordered-containers] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  13366. 197.24 s [unordered-containers] Linked component graph:
  13367. 197.24 s [unordered-containers] unit unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  13368. 197.24 s [unordered-containers] include base-4.21.0.0-b334
  13369. 197.24 s [unordered-containers] include deepseq-1.5.1.0-3c62
  13370. 197.24 s [unordered-containers] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  13371. 197.24 s [unordered-containers] include template-haskell-2.23.0.0-4ee9
  13372. 197.24 s [unordered-containers] Data.HashMap.Internal=unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF:Data.HashMap.Internal,Data.HashMap.Internal.Array=unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF:Data.HashMap.Internal.Array,Data.HashMap.Internal.Debug=unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF:Data.HashMap.Internal.Debug,Data.HashMap.Internal.List=unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF:Data.HashMap.Internal.List,Data.HashMap.Internal.Strict=unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF:Data.HashMap.Internal.Strict,Data.HashMap.Lazy=unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF:Data.HashMap.Lazy,Data.HashMap.Strict=unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF:Data.HashMap.Strict,Data.HashSet=unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF:Data.HashSet,Data.HashSet.Internal=unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF:Data.HashSet.Internal
  13373. 197.24 s [unordered-containers] unit unordered-containers-0.2.20.1-33hNwrDDYUvDIxwoJthJjL-unordered-containers-tests
  13374. 197.24 s [unordered-containers] include ChasingBottoms-1.3.1.17-5GE1PYLkkwE5eKyEuTckWY
  13375. 197.24 s [unordered-containers] include HUnit-1.6.2.0-3ZugMwA5Fqe3c2fSrjhIxu
  13376. 197.24 s [unordered-containers] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  13377. 197.24 s [unordered-containers] include base-4.21.0.0-b334
  13378. 197.24 s [unordered-containers] include containers-0.7-d79e
  13379. 197.24 s [unordered-containers] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  13380. 197.24 s [unordered-containers] include nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  13381. 197.24 s [unordered-containers] include random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  13382. 197.24 s [unordered-containers] include tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  13383. 197.24 s [unordered-containers] include tasty-hunit-0.10.2-JRT4tyEuMHKBzpxUU6VUG8
  13384. 197.24 s [unordered-containers] include tasty-quickcheck-0.11.1-Ca4DEyt784fFBsV7HOinsy
  13385. 197.24 s [unordered-containers] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  13386. 197.24 s [unordered-containers] Ready component graph:
  13387. 197.24 s [unordered-containers] definite unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  13388. 197.24 s [unordered-containers] depends base-4.21.0.0-b334
  13389. 197.24 s [unordered-containers] depends deepseq-1.5.1.0-3c62
  13390. 197.24 s [unordered-containers] depends hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  13391. 197.24 s [unordered-containers] depends template-haskell-2.23.0.0-4ee9
  13392. 197.24 s [unordered-containers] definite unordered-containers-0.2.20.1-33hNwrDDYUvDIxwoJthJjL-unordered-containers-tests
  13393. 197.24 s [unordered-containers] depends ChasingBottoms-1.3.1.17-5GE1PYLkkwE5eKyEuTckWY
  13394. 197.24 s [unordered-containers] depends HUnit-1.6.2.0-3ZugMwA5Fqe3c2fSrjhIxu
  13395. 197.24 s [unordered-containers] depends QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  13396. 197.24 s [unordered-containers] depends base-4.21.0.0-b334
  13397. 197.24 s [unordered-containers] depends containers-0.7-d79e
  13398. 197.24 s [unordered-containers] depends hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  13399. 197.24 s [unordered-containers] depends nothunks-0.3.1-JxOYUjJU0JmFcpQSwg5Wvl
  13400. 197.24 s [unordered-containers] depends random-1.2.1.3-JGcOiyH1u317hgRB7TWWFV
  13401. 197.24 s [unordered-containers] depends tasty-1.5.3-1P3AH5KqZrKLTVMzNZdHkm
  13402. 197.24 s [unordered-containers] depends tasty-hunit-0.10.2-JRT4tyEuMHKBzpxUU6VUG8
  13403. 197.24 s [unordered-containers] depends tasty-quickcheck-0.11.1-Ca4DEyt784fFBsV7HOinsy
  13404. 197.24 s [unordered-containers] depends unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  13405. 197.24 s [unordered-containers] Using Cabal-3.14.1.0 compiled by ghc-9.12
  13406. 197.24 s [unordered-containers] Using compiler: ghc-9.12.2
  13407. 197.24 s [unordered-containers] Using install prefix:
  13408. 197.24 s [unordered-containers] /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1
  13409. 197.24 s [unordered-containers] Executables installed in:
  13410. 197.24 s [unordered-containers] /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1/bin
  13411. 197.24 s [unordered-containers] Libraries installed in:
  13412. 197.24 s [unordered-containers] /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  13413. 197.24 s [unordered-containers] Dynamic Libraries installed in:
  13414. 197.24 s [unordered-containers] /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3
  13415. 197.24 s [unordered-containers] Private executables installed in:
  13416. 197.24 s [unordered-containers] /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1/libexec/x86_64-linux-ghc-9.12.2-82d3/unordered-containers-0.2.20.1
  13417. 197.24 s [unordered-containers] Data files installed in:
  13418. 197.24 s [unordered-containers] /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1/share/x86_64-linux-ghc-9.12.2-82d3/unordered-containers-0.2.20.1
  13419. 197.24 s [unordered-containers] Documentation installed in:
  13420. 197.24 s [unordered-containers] /nix/store/r8fiibcxm6cb3mgmz9mrnfxcsnwnswch-unordered-containers-0.2.20.1-doc/share/doc/unordered-containers-0.2.20.1
  13421. 197.24 s [unordered-containers] Configuration files installed in:
  13422. 197.24 s [unordered-containers] /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1/etc
  13423. 197.24 s [unordered-containers] No alex found
  13424. 197.24 s [unordered-containers] Using ar found on system at:
  13425. 197.24 s [unordered-containers] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  13426. 197.24 s [unordered-containers] No c2hs found
  13427. 197.24 s [unordered-containers] No cpphs found
  13428. 197.24 s [unordered-containers] No doctest found
  13429. 197.24 s [unordered-containers] Using gcc version 14.3.0 given by user at:
  13430. 197.24 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  13431. 197.24 s [unordered-containers] Using ghc version 9.12.2 found on system at:
  13432. 197.24 s [unordered-containers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc
  13433. 197.24 s [unordered-containers] Using ghc-pkg version 9.12.2 found on system at:
  13434. 197.24 s [unordered-containers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc-pkg-9.12.2
  13435. 197.24 s [unordered-containers] No ghcjs found
  13436. 197.24 s [unordered-containers] No ghcjs-pkg found
  13437. 197.24 s [unordered-containers] No greencard found
  13438. 197.24 s [unordered-containers] Using haddock version 2.30.0 found on system at:
  13439. 197.24 s [unordered-containers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/haddock-ghc-9.12.2
  13440. 197.24 s [unordered-containers] No happy found
  13441. 197.24 s [unordered-containers] No haskell-suite found
  13442. 197.24 s [unordered-containers] No haskell-suite-pkg found
  13443. 197.24 s [unordered-containers] No hmake found
  13444. 197.24 s [unordered-containers] Using hpc version 0.69 found on system at:
  13445. 197.24 s [unordered-containers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hpc-ghc-9.12.2
  13446. 197.24 s [unordered-containers] Using hsc2hs version 0.68.10 found on system at:
  13447. 197.24 s [unordered-containers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  13448. 197.24 s [unordered-containers] Using hscolour version 1.25 found on system at:
  13449. 197.24 s [unordered-containers] /nix/store/02s9rad0jn6nj8z96k357im73hkzqsnw-hscolour-1.25/bin/HsColour
  13450. 197.24 s [unordered-containers] No jhc found
  13451. 197.24 s [unordered-containers] Using ld found on system at:
  13452. 197.24 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  13453. 197.24 s [unordered-containers] No pkg-config found
  13454. 197.24 s [unordered-containers] Using runghc version 9.12.2 found on system at:
  13455. 197.24 s [unordered-containers] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/runghc-9.12.2
  13456. 197.24 s [unordered-containers] Using strip version 2.44 found on system at:
  13457. 197.24 s [unordered-containers] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  13458. 197.24 s [unordered-containers] Using tar found on system at:
  13459. 197.24 s [unordered-containers] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  13460. 197.24 s [unordered-containers] No uhc found
  13461. 197.41 s [unordered-containers] Phase: buildPhase
  13462. 197.46 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1...
  13463. 197.46 s [unordered-containers] Building library for unordered-containers-0.2.20.1...
  13464. 197.52 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  13465. 197.52 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  13466. 197.52 s [unordered-containers] |
  13467. 197.52 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  13468. 197.52 s [unordered-containers] | ^^^^^^^^^^
  13469. 197.52 s [unordered-containers]
  13470. 197.67 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 )
  13471. 197.79 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  13472. 197.79 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  13473. 197.79 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  13474. 197.79 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  13475. 197.79 s [unordered-containers] |
  13476. 197.79 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  13477. 197.79 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  13478. 197.79 s [unordered-containers]
  13479. 197.79 s [unordered-containers] Data/HashMap/Internal/Array.hs:162:20-43: warning: [GHC-68441] [-Wdeprecations]
  13480. 197.79 s [unordered-containers] In the use of ‘sizeofSmallMutableArray#’
  13481. 197.79 s [unordered-containers] (imported from GHC.Exts, but defined in GHC.Prim):
  13482. 197.79 s [unordered-containers] Deprecated: " Use 'getSizeofSmallMutableArray#' instead "
  13483. 197.79 s [unordered-containers] |
  13484. 197.79 s [unordered-containers] 162 | lengthM mary = I# (sizeofSmallMutableArray# (unMArray mary))
  13485. 197.79 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^
  13486. 197.79 s [unordered-containers]
  13487. 198.23 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 )
  13488. 198.23 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 )
  13489. 203.89 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 )
  13490. 203.93 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 )
  13491. 204.86 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 )
  13492. 204.86 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.o, dist/build/Data/HashSet.dyn_o )
  13493. 204.86 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 )
  13494. 204.88 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 )
  13495. 205.08 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  13496. 205.08 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  13497. 205.08 s [unordered-containers] |
  13498. 205.08 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  13499. 205.08 s [unordered-containers] | ^^^^^^^^^^
  13500. 205.08 s [unordered-containers]
  13501. 205.22 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, dist/build/Data/HashMap/Internal/Array.p_o )
  13502. 205.33 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  13503. 205.33 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  13504. 205.33 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  13505. 205.33 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  13506. 205.33 s [unordered-containers] |
  13507. 205.33 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  13508. 205.33 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  13509. 205.33 s [unordered-containers]
  13510. 205.33 s [unordered-containers] Data/HashMap/Internal/Array.hs:162:20-43: warning: [GHC-68441] [-Wdeprecations]
  13511. 205.33 s [unordered-containers] In the use of ‘sizeofSmallMutableArray#’
  13512. 205.33 s [unordered-containers] (imported from GHC.Exts, but defined in GHC.Prim):
  13513. 205.33 s [unordered-containers] Deprecated: " Use 'getSizeofSmallMutableArray#' instead "
  13514. 205.33 s [unordered-containers] |
  13515. 205.33 s [unordered-containers] 162 | lengthM mary = I# (sizeofSmallMutableArray# (unMArray mary))
  13516. 205.33 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^
  13517. 205.33 s [unordered-containers]
  13518. 205.87 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, dist/build/Data/HashMap/Internal/List.p_o )
  13519. 205.87 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, dist/build/Data/HashMap/Internal.p_o )
  13520. 212.17 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, dist/build/Data/HashMap/Internal/Debug.p_o )
  13521. 212.65 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, dist/build/Data/HashMap/Internal/Strict.p_o )
  13522. 214.26 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, dist/build/Data/HashSet/Internal.p_o )
  13523. 214.26 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, dist/build/Data/HashSet.p_o )
  13524. 214.26 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, dist/build/Data/HashMap/Strict.p_o )
  13525. 214.36 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, dist/build/Data/HashMap/Lazy.p_o )
  13526. 215.31 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  13527. 215.31 s [unordered-containers] Building test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  13528. 215.43 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 )
  13529. 215.60 s [unordered-containers] [2 of 9] Compiling Regressions ( tests/Regressions.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Regressions.o )
  13530. 215.60 s [unordered-containers] tests/Regressions.hs:93:16: warning: [GHC-63394] [-Wx-partial]
  13531. 215.60 s [unordered-containers] In the use of ‘head’
  13532. 215.60 s [unordered-containers] (imported from Prelude, but defined in GHC.Internal.List):
  13533. 215.60 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"."
  13534. 215.60 s [unordered-containers] |
  13535. 215.60 s [unordered-containers] 93 | k = head keys
  13536. 215.60 s [unordered-containers] | ^^^^
  13537. 215.60 s [unordered-containers]
  13538. 217.41 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 )
  13539. 217.45 s [unordered-containers] [4 of 9] Compiling Strictness ( tests/Strictness.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Strictness.o )
  13540. 217.45 s [unordered-containers] tests/Strictness.hs:7:1: warning: [GHC-66111] [-Wunused-imports]
  13541. 217.45 s [unordered-containers] The import of ‘Data.Foldable’ is redundant
  13542. 217.45 s [unordered-containers] except perhaps to import instances from ‘Data.Foldable’
  13543. 217.45 s [unordered-containers] To import instances alone, use: import Data.Foldable()
  13544. 217.45 s [unordered-containers] |
  13545. 217.45 s [unordered-containers] 7 | import Data.Foldable (foldl')
  13546. 217.45 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  13547. 217.45 s [unordered-containers]
  13548. 217.45 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 )
  13549. 217.45 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 )
  13550. 221.70 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 )
  13551. 221.70 s [unordered-containers] [8 of 9] Compiling Properties ( tests/Properties.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Properties.o )
  13552. 221.71 s [unordered-containers] [9 of 9] Compiling Main ( tests/Main.hs, dist/build/unordered-containers-tests/unordered-containers-tests-tmp/Main.o )
  13553. 222.09 s [unordered-containers] [10 of 10] Linking dist/build/unordered-containers-tests/unordered-containers-tests
  13554. 222.92 s [unordered-containers] Phase: checkPhase
  13555. 223.13 s [unordered-containers] Running 1 test suites...
  13556. 223.13 s [unordered-containers] Test suite unordered-containers-tests: RUNNING...
  13557. 223.14 s [unordered-containers] All
  13558. 223.14 s [unordered-containers] Properties
  13559. 223.14 s [unordered-containers] Data.HashMap.Lazy
  13560. 223.14 s [unordered-containers] instances
  13561. 223.14 s [unordered-containers] Eq
  13562. 223.17 s [unordered-containers] ==: OK (0.02s)
  13563. 223.17 s [unordered-containers] +++ OK, passed 100 tests.
  13564. 223.17 s [unordered-containers] /=: OK
  13565. 223.17 s [unordered-containers] +++ OK, passed 100 tests.
  13566. 223.17 s [unordered-containers] Ord
  13567. 223.17 s [unordered-containers] compare reflexive: OK
  13568. 223.17 s [unordered-containers] +++ OK, passed 100 tests.
  13569. 223.17 s [unordered-containers] compare transitive: OK (0.01s)
  13570. 223.17 s [unordered-containers] +++ OK, passed 100 tests.
  13571. 223.17 s [unordered-containers] compare antisymmetric: OK
  13572. 223.17 s [unordered-containers] +++ OK, passed 100 tests.
  13573. 223.17 s [unordered-containers] Ord => Eq: OK
  13574. 223.17 s [unordered-containers] +++ OK, passed 100 tests.
  13575. 223.21 s [unordered-containers] Read/Show: OK (0.07s)
  13576. 223.21 s [unordered-containers] +++ OK, passed 100 tests.
  13577. 223.21 s [unordered-containers] Functor: OK (0.01s)
  13578. 223.21 s [unordered-containers] +++ OK, passed 100 tests.
  13579. 223.21 s [unordered-containers] Foldable: OK
  13580. 223.21 s [unordered-containers] +++ OK, passed 100 tests.
  13581. 223.21 s [unordered-containers] Bifoldable
  13582. 223.21 s [unordered-containers] bifoldMap: OK
  13583. 223.21 s [unordered-containers] +++ OK, passed 100 tests.
  13584. 223.21 s [unordered-containers] bifoldr: OK (0.01s)
  13585. 223.21 s [unordered-containers] +++ OK, passed 100 tests.
  13586. 223.21 s [unordered-containers] bifoldl: OK
  13587. 223.21 s [unordered-containers] +++ OK, passed 100 tests.
  13588. 223.21 s [unordered-containers] Hashable: OK
  13589. 223.21 s [unordered-containers] +++ OK, passed 100 tests.
  13590. 223.21 s [unordered-containers] empty
  13591. 223.21 s [unordered-containers] valid: OK
  13592. 223.21 s [unordered-containers] +++ OK, passed 1 test.
  13593. 223.21 s [unordered-containers] singleton
  13594. 223.21 s [unordered-containers] valid: OK
  13595. 223.21 s [unordered-containers] +++ OK, passed 100 tests.
  13596. 223.21 s [unordered-containers] size: OK
  13597. 223.21 s [unordered-containers] +++ OK, passed 100 tests.
  13598. 223.21 s [unordered-containers] member: OK
  13599. 223.21 s [unordered-containers] +++ OK, passed 100 tests.
  13600. 223.21 s [unordered-containers] lookup: OK (0.01s)
  13601. 223.21 s [unordered-containers] +++ OK, passed 100 tests.
  13602. 223.21 s [unordered-containers] !?: OK
  13603. 223.21 s [unordered-containers] +++ OK, passed 100 tests.
  13604. 223.21 s [unordered-containers] insert
  13605. 223.21 s [unordered-containers] model: OK
  13606. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13607. 223.22 s [unordered-containers] valid: OK
  13608. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13609. 223.22 s [unordered-containers] insertWith
  13610. 223.22 s [unordered-containers] insertWith: OK
  13611. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13612. 223.22 s [unordered-containers] valid: OK
  13613. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13614. 223.22 s [unordered-containers] delete
  13615. 223.22 s [unordered-containers] model: OK
  13616. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13617. 223.22 s [unordered-containers] valid: OK
  13618. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13619. 223.22 s [unordered-containers] adjust
  13620. 223.22 s [unordered-containers] model: OK
  13621. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13622. 223.22 s [unordered-containers] valid: OK
  13623. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13624. 223.22 s [unordered-containers] update
  13625. 223.22 s [unordered-containers] model: OK
  13626. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13627. 223.22 s [unordered-containers] valid: OK
  13628. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13629. 223.22 s [unordered-containers] alter
  13630. 223.22 s [unordered-containers] model: OK
  13631. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13632. 223.22 s [unordered-containers] valid: OK
  13633. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13634. 223.22 s [unordered-containers] alterF
  13635. 223.22 s [unordered-containers] model
  13636. 223.22 s [unordered-containers] []: OK (0.02s)
  13637. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13638. 223.22 s [unordered-containers] adjust: OK
  13639. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13640. 223.22 s [unordered-containers] insert: OK
  13641. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13642. 223.22 s [unordered-containers] insertWith: OK
  13643. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13644. 223.22 s [unordered-containers] delete: OK
  13645. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13646. 223.22 s [unordered-containers] lookup: OK
  13647. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13648. 223.22 s [unordered-containers] valid: OK
  13649. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13650. 223.22 s [unordered-containers] isSubmapOf
  13651. 223.22 s [unordered-containers] model: OK
  13652. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13653. 223.22 s [unordered-containers] m ⊆ m: OK
  13654. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13655. 223.22 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK
  13656. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13657. 223.22 s [unordered-containers] m1\m2 ⊆ m1: OK
  13658. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13659. 223.22 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK
  13660. 223.22 s [unordered-containers] +++ OK, passed 100 tests; 202 discarded.
  13661. 223.22 s [unordered-containers] delete k m ⊆ m: OK
  13662. 223.22 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  13663. 223.22 s [unordered-containers] m ⊈ delete k m : OK
  13664. 223.22 s [unordered-containers] +++ OK, passed 100 tests; 16 discarded.
  13665. 223.22 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK
  13666. 223.22 s [unordered-containers] +++ OK, passed 100 tests; 12 discarded.
  13667. 223.22 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK
  13668. 223.22 s [unordered-containers] +++ OK, passed 100 tests; 8 discarded.
  13669. 223.22 s [unordered-containers] union
  13670. 223.22 s [unordered-containers] model: OK
  13671. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13672. 223.22 s [unordered-containers] valid: OK
  13673. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13674. 223.22 s [unordered-containers] unionWith
  13675. 223.22 s [unordered-containers] model: OK (0.02s)
  13676. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13677. 223.22 s [unordered-containers] valid: OK
  13678. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13679. 223.22 s [unordered-containers] unionWithKey
  13680. 223.22 s [unordered-containers] model: OK (0.03s)
  13681. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13682. 223.22 s [unordered-containers] valid: OK
  13683. 223.22 s [unordered-containers] +++ OK, passed 100 tests.
  13684. 223.22 s [unordered-containers] unions
  13685. 223.46 s [unordered-containers] model: OK (0.31s)
  13686. 223.46 s [unordered-containers] +++ OK, passed 100 tests.
  13687. 223.46 s [unordered-containers] valid: OK (0.21s)
  13688. 223.46 s [unordered-containers] +++ OK, passed 100 tests.
  13689. 223.46 s [unordered-containers] difference
  13690. 223.46 s [unordered-containers] model: OK
  13691. 223.46 s [unordered-containers] +++ OK, passed 100 tests.
  13692. 223.46 s [unordered-containers] valid: OK
  13693. 223.46 s [unordered-containers] +++ OK, passed 100 tests.
  13694. 223.46 s [unordered-containers] differenceWith
  13695. 223.46 s [unordered-containers] model: OK (0.01s)
  13696. 223.46 s [unordered-containers] +++ OK, passed 100 tests.
  13697. 223.46 s [unordered-containers] valid: OK
  13698. 223.46 s [unordered-containers] +++ OK, passed 100 tests.
  13699. 223.46 s [unordered-containers] intersection
  13700. 223.46 s [unordered-containers] model: OK
  13701. 223.46 s [unordered-containers] +++ OK, passed 100 tests.
  13702. 223.46 s [unordered-containers] valid: OK
  13703. 223.46 s [unordered-containers] +++ OK, passed 100 tests.
  13704. 223.46 s [unordered-containers] intersectionWith
  13705. 223.46 s [unordered-containers] model: OK
  13706. 223.46 s [unordered-containers] +++ OK, passed 100 tests.
  13707. 223.46 s [unordered-containers] valid: OK
  13708. 223.46 s [unordered-containers] +++ OK, passed 100 tests.
  13709. 223.46 s [unordered-containers] intersectionWithKey
  13710. 223.46 s [unordered-containers] model: OK (0.02s)
  13711. 223.46 s [unordered-containers] +++ OK, passed 100 tests.
  13712. 223.46 s [unordered-containers] valid: OK
  13713. 223.46 s [unordered-containers] +++ OK, passed 100 tests.
  13714. 223.46 s [unordered-containers] compose
  13715. 223.46 s [unordered-containers] valid: OK
  13716. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13717. 223.47 s [unordered-containers] map
  13718. 223.47 s [unordered-containers] model: OK (0.01s)
  13719. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13720. 223.47 s [unordered-containers] valid: OK
  13721. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13722. 223.47 s [unordered-containers] traverseWithKey
  13723. 223.47 s [unordered-containers] model: OK (0.15s)
  13724. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13725. 223.47 s [unordered-containers] valid: OK
  13726. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13727. 223.47 s [unordered-containers] mapKeys
  13728. 223.47 s [unordered-containers] model: OK
  13729. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13730. 223.47 s [unordered-containers] valid: OK (0.10s)
  13731. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13732. 223.47 s [unordered-containers] foldr: OK
  13733. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13734. 223.47 s [unordered-containers] foldl: OK
  13735. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13736. 223.47 s [unordered-containers] foldrWithKey: OK
  13737. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13738. 223.47 s [unordered-containers] foldlWithKey: OK
  13739. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13740. 223.47 s [unordered-containers] foldrWithKey': OK
  13741. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13742. 223.47 s [unordered-containers] foldlWithKey': OK
  13743. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13744. 223.47 s [unordered-containers] foldl': OK
  13745. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13746. 223.47 s [unordered-containers] foldr': OK
  13747. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13748. 223.47 s [unordered-containers] foldMapWithKey: OK
  13749. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13750. 223.47 s [unordered-containers] filter
  13751. 223.47 s [unordered-containers] model: OK (0.02s)
  13752. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13753. 223.47 s [unordered-containers] valid: OK (0.01s)
  13754. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13755. 223.47 s [unordered-containers] filterWithKey
  13756. 223.47 s [unordered-containers] model: OK (0.28s)
  13757. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13758. 223.47 s [unordered-containers] valid: OK (0.12s)
  13759. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13760. 223.47 s [unordered-containers] mapMaybe
  13761. 223.47 s [unordered-containers] model: OK (0.03s)
  13762. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13763. 223.47 s [unordered-containers] valid: OK
  13764. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13765. 223.47 s [unordered-containers] mapMaybeWithKey
  13766. 223.47 s [unordered-containers] model: OK (0.30s)
  13767. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13768. 223.47 s [unordered-containers] valid: OK (0.13s)
  13769. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13770. 223.47 s [unordered-containers] elems: OK (0.01s)
  13771. 223.47 s [unordered-containers] +++ OK, passed 100 tests.
  13772. 223.48 s [unordered-containers] keys: OK (0.02s)
  13773. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13774. 223.48 s [unordered-containers] fromList
  13775. 223.48 s [unordered-containers] model: OK
  13776. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13777. 223.48 s [unordered-containers] valid: OK
  13778. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13779. 223.48 s [unordered-containers] fromListWith
  13780. 223.48 s [unordered-containers] model: OK
  13781. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13782. 223.48 s [unordered-containers] valid: OK
  13783. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13784. 223.48 s [unordered-containers] fromListWithKey
  13785. 223.48 s [unordered-containers] model: OK (0.01s)
  13786. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13787. 223.48 s [unordered-containers] valid: OK
  13788. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13789. 223.48 s [unordered-containers] toList: OK
  13790. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13791. 223.48 s [unordered-containers] Data.HashMap.Strict
  13792. 223.48 s [unordered-containers] instances
  13793. 223.48 s [unordered-containers] Eq
  13794. 223.48 s [unordered-containers] ==: OK (0.02s)
  13795. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13796. 223.48 s [unordered-containers] /=: OK (0.01s)
  13797. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13798. 223.48 s [unordered-containers] Ord
  13799. 223.48 s [unordered-containers] compare reflexive: OK
  13800. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13801. 223.48 s [unordered-containers] compare transitive: OK (0.01s)
  13802. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13803. 223.48 s [unordered-containers] compare antisymmetric: OK
  13804. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13805. 223.48 s [unordered-containers] Ord => Eq: OK
  13806. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13807. 223.48 s [unordered-containers] Read/Show: OK (0.11s)
  13808. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13809. 223.48 s [unordered-containers] Functor: OK (0.03s)
  13810. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13811. 223.48 s [unordered-containers] Foldable: OK (0.01s)
  13812. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13813. 223.48 s [unordered-containers] Bifoldable
  13814. 223.48 s [unordered-containers] bifoldMap: OK (0.01s)
  13815. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13816. 223.48 s [unordered-containers] bifoldr: OK
  13817. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13818. 223.48 s [unordered-containers] bifoldl: OK (0.02s)
  13819. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13820. 223.48 s [unordered-containers] Hashable: OK (0.01s)
  13821. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13822. 223.48 s [unordered-containers] empty
  13823. 223.48 s [unordered-containers] valid: OK
  13824. 223.48 s [unordered-containers] +++ OK, passed 1 test.
  13825. 223.48 s [unordered-containers] singleton
  13826. 223.48 s [unordered-containers] valid: OK
  13827. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13828. 223.48 s [unordered-containers] size: OK
  13829. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13830. 223.48 s [unordered-containers] member: OK
  13831. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13832. 223.48 s [unordered-containers] lookup: OK
  13833. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13834. 223.48 s [unordered-containers] !?: OK
  13835. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13836. 223.48 s [unordered-containers] insert
  13837. 223.48 s [unordered-containers] model: OK
  13838. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13839. 223.48 s [unordered-containers] valid: OK
  13840. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13841. 223.48 s [unordered-containers] insertWith
  13842. 223.48 s [unordered-containers] insertWith: OK (0.01s)
  13843. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13844. 223.48 s [unordered-containers] valid: OK
  13845. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13846. 223.48 s [unordered-containers] delete
  13847. 223.48 s [unordered-containers] model: OK (0.01s)
  13848. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13849. 223.48 s [unordered-containers] valid: OK
  13850. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13851. 223.48 s [unordered-containers] adjust
  13852. 223.48 s [unordered-containers] model: OK (0.01s)
  13853. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13854. 223.48 s [unordered-containers] valid: OK
  13855. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13856. 223.48 s [unordered-containers] update
  13857. 223.48 s [unordered-containers] model: OK (0.01s)
  13858. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13859. 223.48 s [unordered-containers] valid: OK
  13860. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13861. 223.48 s [unordered-containers] alter
  13862. 223.48 s [unordered-containers] model: OK (0.01s)
  13863. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13864. 223.48 s [unordered-containers] valid: OK
  13865. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13866. 223.48 s [unordered-containers] alterF
  13867. 223.48 s [unordered-containers] model
  13868. 223.48 s [unordered-containers] []: OK (0.06s)
  13869. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13870. 223.48 s [unordered-containers] adjust: OK
  13871. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13872. 223.48 s [unordered-containers] insert: OK (0.01s)
  13873. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13874. 223.48 s [unordered-containers] insertWith: OK (0.01s)
  13875. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13876. 223.48 s [unordered-containers] delete: OK
  13877. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13878. 223.48 s [unordered-containers] lookup: OK (0.01s)
  13879. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13880. 223.48 s [unordered-containers] valid: OK (0.02s)
  13881. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13882. 223.48 s [unordered-containers] isSubmapOf
  13883. 223.48 s [unordered-containers] model: OK (0.02s)
  13884. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13885. 223.48 s [unordered-containers] m ⊆ m: OK
  13886. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13887. 223.48 s [unordered-containers] m1 ⊆ m1 ∪ m2: OK
  13888. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13889. 223.48 s [unordered-containers] m1\m2 ⊆ m1: OK (0.01s)
  13890. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13891. 223.48 s [unordered-containers] m1 ∩ m2 ≠ ∅ ⇒ m1 ⊈ m1\m2 : OK (0.02s)
  13892. 223.48 s [unordered-containers] +++ OK, passed 100 tests; 131 discarded.
  13893. 223.48 s [unordered-containers] delete k m ⊆ m: OK
  13894. 223.48 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  13895. 223.48 s [unordered-containers] m ⊈ delete k m : OK
  13896. 223.48 s [unordered-containers] +++ OK, passed 100 tests; 14 discarded.
  13897. 223.48 s [unordered-containers] k ∉ m ⇒ m ⊆ insert k v m: OK
  13898. 223.48 s [unordered-containers] +++ OK, passed 100 tests; 9 discarded.
  13899. 223.48 s [unordered-containers] k ∉ m ⇒ insert k v m ⊈ m: OK
  13900. 223.48 s [unordered-containers] +++ OK, passed 100 tests; 17 discarded.
  13901. 223.48 s [unordered-containers] union
  13902. 223.48 s [unordered-containers] model: OK (0.02s)
  13903. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13904. 223.48 s [unordered-containers] valid: OK (0.01s)
  13905. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13906. 223.48 s [unordered-containers] unionWith
  13907. 223.48 s [unordered-containers] model: OK (0.03s)
  13908. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13909. 223.48 s [unordered-containers] valid: OK (0.02s)
  13910. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13911. 223.48 s [unordered-containers] unionWithKey
  13912. 223.48 s [unordered-containers] model: OK (0.04s)
  13913. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13914. 223.48 s [unordered-containers] valid: OK (0.03s)
  13915. 223.48 s [unordered-containers] +++ OK, passed 100 tests.
  13916. 223.48 s [unordered-containers] unions
  13917. 223.62 s [unordered-containers] model: OK (0.34s)
  13918. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13919. 223.62 s [unordered-containers] valid: OK (0.25s)
  13920. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13921. 223.62 s [unordered-containers] difference
  13922. 223.62 s [unordered-containers] model: OK
  13923. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13924. 223.62 s [unordered-containers] valid: OK (0.01s)
  13925. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13926. 223.62 s [unordered-containers] differenceWith
  13927. 223.62 s [unordered-containers] model: OK (0.02s)
  13928. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13929. 223.62 s [unordered-containers] valid: OK (0.02s)
  13930. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13931. 223.62 s [unordered-containers] intersection
  13932. 223.62 s [unordered-containers] model: OK (0.01s)
  13933. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13934. 223.62 s [unordered-containers] valid: OK (0.02s)
  13935. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13936. 223.62 s [unordered-containers] intersectionWith
  13937. 223.62 s [unordered-containers] model: OK (0.02s)
  13938. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13939. 223.62 s [unordered-containers] valid: OK (0.02s)
  13940. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13941. 223.62 s [unordered-containers] intersectionWithKey
  13942. 223.62 s [unordered-containers] model: OK (0.04s)
  13943. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13944. 223.62 s [unordered-containers] valid: OK (0.02s)
  13945. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13946. 223.62 s [unordered-containers] compose
  13947. 223.62 s [unordered-containers] valid: OK (0.01s)
  13948. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13949. 223.62 s [unordered-containers] map
  13950. 223.62 s [unordered-containers] model: OK (0.03s)
  13951. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13952. 223.62 s [unordered-containers] valid: OK (0.01s)
  13953. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13954. 223.62 s [unordered-containers] traverseWithKey
  13955. 223.62 s [unordered-containers] model: OK (0.04s)
  13956. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13957. 223.62 s [unordered-containers] valid: OK
  13958. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13959. 223.62 s [unordered-containers] mapKeys
  13960. 223.62 s [unordered-containers] model: OK (0.01s)
  13961. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13962. 223.62 s [unordered-containers] valid: OK (0.12s)
  13963. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13964. 223.62 s [unordered-containers] foldr: OK
  13965. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13966. 223.62 s [unordered-containers] foldl: OK
  13967. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13968. 223.62 s [unordered-containers] foldrWithKey: OK
  13969. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13970. 223.62 s [unordered-containers] foldlWithKey: OK
  13971. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13972. 223.62 s [unordered-containers] foldrWithKey': OK
  13973. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13974. 223.62 s [unordered-containers] foldlWithKey': OK
  13975. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13976. 223.62 s [unordered-containers] foldl': OK (0.01s)
  13977. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13978. 223.62 s [unordered-containers] foldr': OK (0.01s)
  13979. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13980. 223.62 s [unordered-containers] foldMapWithKey: OK (0.01s)
  13981. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13982. 223.62 s [unordered-containers] filter
  13983. 223.62 s [unordered-containers] model: OK (0.02s)
  13984. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13985. 223.62 s [unordered-containers] valid: OK (0.03s)
  13986. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13987. 223.62 s [unordered-containers] filterWithKey
  13988. 223.62 s [unordered-containers] model: OK (0.26s)
  13989. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13990. 223.62 s [unordered-containers] valid: OK (0.17s)
  13991. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13992. 223.62 s [unordered-containers] mapMaybe
  13993. 223.62 s [unordered-containers] model: OK (0.03s)
  13994. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13995. 223.62 s [unordered-containers] valid: OK (0.02s)
  13996. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  13997. 223.62 s [unordered-containers] mapMaybeWithKey
  13998. 223.62 s [unordered-containers] model: OK (0.27s)
  13999. 223.62 s [unordered-containers] +++ OK, passed 100 tests.
  14000. 223.62 s [unordered-containers] valid: OK (0.21s)
  14001. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14002. 223.63 s [unordered-containers] elems: OK (0.01s)
  14003. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14004. 223.63 s [unordered-containers] keys: OK
  14005. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14006. 223.63 s [unordered-containers] fromList
  14007. 223.63 s [unordered-containers] model: OK
  14008. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14009. 223.63 s [unordered-containers] valid: OK
  14010. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14011. 223.63 s [unordered-containers] fromListWith
  14012. 223.63 s [unordered-containers] model: OK (0.01s)
  14013. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14014. 223.63 s [unordered-containers] valid: OK (0.01s)
  14015. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14016. 223.63 s [unordered-containers] fromListWithKey
  14017. 223.63 s [unordered-containers] model: OK (0.01s)
  14018. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14019. 223.63 s [unordered-containers] valid: OK (0.02s)
  14020. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14021. 223.63 s [unordered-containers] toList: OK
  14022. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14023. 223.63 s [unordered-containers] Data.HashSet
  14024. 223.63 s [unordered-containers] instances
  14025. 223.63 s [unordered-containers] Eq
  14026. 223.63 s [unordered-containers] ==: OK (0.01s)
  14027. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14028. 223.63 s [unordered-containers] == permutations: OK
  14029. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14030. 223.63 s [unordered-containers] /=: OK
  14031. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14032. 223.63 s [unordered-containers] Ord
  14033. 223.63 s [unordered-containers] compare reflexive: OK
  14034. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14035. 223.63 s [unordered-containers] compare transitive: OK (0.02s)
  14036. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14037. 223.63 s [unordered-containers] compare antisymmetric: OK
  14038. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14039. 223.63 s [unordered-containers] Ord => Eq: OK (0.02s)
  14040. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14041. 223.63 s [unordered-containers] Read/Show: OK (0.13s)
  14042. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14043. 223.63 s [unordered-containers] Foldable: OK
  14044. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14045. 223.63 s [unordered-containers] Hashable: OK (0.01s)
  14046. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14047. 223.63 s [unordered-containers] size: OK
  14048. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14049. 223.63 s [unordered-containers] member: OK (0.01s)
  14050. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14051. 223.63 s [unordered-containers] insert: OK
  14052. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14053. 223.63 s [unordered-containers] delete: OK
  14054. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14055. 223.63 s [unordered-containers] union: OK (0.02s)
  14056. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14057. 223.63 s [unordered-containers] map: OK (0.18s)
  14058. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14059. 223.63 s [unordered-containers] foldr: OK
  14060. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14061. 223.63 s [unordered-containers] foldl': OK
  14062. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14063. 223.63 s [unordered-containers] filter: OK (0.20s)
  14064. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14065. 223.63 s [unordered-containers] toList: OK
  14066. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14067. 223.63 s [unordered-containers] Data.HashMap.Internal.List
  14068. 223.63 s [unordered-containers] isPermutationBy: OK
  14069. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14070. 223.63 s [unordered-containers] isPermutationBy of different length: OK
  14071. 223.63 s [unordered-containers] +++ OK, passed 100 tests; 17 discarded.
  14072. 223.63 s [unordered-containers] pUnorderedCompare: OK (0.04s)
  14073. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14074. 223.63 s [unordered-containers] modelUnorderedCompare
  14075. 223.63 s [unordered-containers] reflexive: OK
  14076. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14077. 223.63 s [unordered-containers] anti-symmetric: OK
  14078. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14079. 223.63 s [unordered-containers] transitive: OK
  14080. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14081. 223.63 s [unordered-containers] Regression tests
  14082. 223.63 s [unordered-containers] issue32: OK
  14083. 223.63 s [unordered-containers] issue39a: OK
  14084. 223.63 s [unordered-containers] issue39b: OK (0.01s)
  14085. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14086. 223.63 s [unordered-containers] issue254 lazy: OK
  14087. 223.63 s [unordered-containers] issue254 strict: OK
  14088. 223.63 s [unordered-containers] issue379
  14089. 223.63 s [unordered-containers] Lazy.unionWith: OK
  14090. 223.63 s [unordered-containers] union: OK
  14091. 223.63 s [unordered-containers] Strict.unionWith: OK
  14092. 223.63 s [unordered-containers] Strict.unionWithKey: OK
  14093. 223.63 s [unordered-containers] issue381
  14094. 223.63 s [unordered-containers] mapMaybe: OK
  14095. 223.63 s [unordered-containers] mapMaybeWithKey: OK
  14096. 223.63 s [unordered-containers] issue382: OK
  14097. 223.63 s [unordered-containers] issue383: OK
  14098. 223.63 s [unordered-containers] issue420: OK
  14099. 223.63 s [unordered-containers] issue491
  14100. 223.63 s [unordered-containers] 1: OK
  14101. 223.63 s [unordered-containers] 2: OK
  14102. 223.63 s [unordered-containers] 3: OK
  14103. 223.63 s [unordered-containers] Strictness
  14104. 223.63 s [unordered-containers] HashMap.Strict
  14105. 223.63 s [unordered-containers] singleton is key-strict: OK
  14106. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14107. 223.63 s [unordered-containers] singleton is value-strict: OK
  14108. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14109. 223.63 s [unordered-containers] member is key-strict: OK
  14110. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14111. 223.63 s [unordered-containers] lookup is key-strict: OK
  14112. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14113. 223.63 s [unordered-containers] lookupDefault is key-strict: OK
  14114. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14115. 223.63 s [unordered-containers] findWithDefault is key-strict: OK
  14116. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14117. 223.63 s [unordered-containers] ! is key-strict: OK
  14118. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14119. 223.63 s [unordered-containers] delete is key-strict: OK
  14120. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14121. 223.63 s [unordered-containers] adjust is key-strict: OK
  14122. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14123. 223.63 s [unordered-containers] adjust is value-strict: OK (0.01s)
  14124. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14125. 223.63 s [unordered-containers] insert is key-strict: OK
  14126. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14127. 223.63 s [unordered-containers] insert is value-strict: OK
  14128. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14129. 223.63 s [unordered-containers] insertWith is key-strict: OK
  14130. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14131. 223.63 s [unordered-containers] insertWith is value-strict: OK
  14132. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14133. 223.63 s [unordered-containers] fromList is key-strict: OK
  14134. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14135. 223.63 s [unordered-containers] fromList is value-strict: OK
  14136. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14137. 223.63 s [unordered-containers] fromListWith is key-strict: OK
  14138. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14139. 223.63 s [unordered-containers] fromListWith is value-strict: OK
  14140. 223.63 s [unordered-containers] +++ OK, passed 100 tests.
  14141. 223.63 s [unordered-containers]
  14142. 223.63 s [unordered-containers] All 257 tests passed (0.48s)
  14143. 223.63 s [unordered-containers] Test suite unordered-containers-tests: PASS
  14144. 223.63 s [unordered-containers] Test suite logged to:
  14145. 223.63 s [unordered-containers] dist/test/unordered-containers-0.2.20.1-unordered-containers-tests.log
  14146. 223.63 s [unordered-containers] 1 of 1 test suites (1 of 1 test cases) passed.
  14147. 223.64 s [unordered-containers] Phase: haddockPhase
  14148. 224.04 s [unordered-containers] Preprocessing library for unordered-containers-0.2.20.1...
  14149. 224.05 s [unordered-containers] Running Haddock on library for unordered-containers-0.2.20.1...
  14150. 224.21 s [unordered-containers] Data/HashMap/Internal.hs:12:14-23: warning: [GHC-53692] [-Wdeprecated-flags]
  14151. 224.21 s [unordered-containers] -XTypeInType is deprecated: use -XDataKinds and -XPolyKinds instead
  14152. 224.21 s [unordered-containers] |
  14153. 224.21 s [unordered-containers] 12 | {-# LANGUAGE TypeInType #-}
  14154. 224.21 s [unordered-containers] | ^^^^^^^^^^
  14155. 224.21 s [unordered-containers]
  14156. 224.31 s [unordered-containers] [1 of 9] Compiling Data.HashMap.Internal.Array ( Data/HashMap/Internal/Array.hs, nothing ) [Flags changed]
  14157. 224.48 s [unordered-containers] Data/HashMap/Internal/Array.hs:83:1-35: warning: [GHC-66111] [-Wunused-imports]
  14158. 224.48 s [unordered-containers] The import of ‘Control.Applicative’ is redundant
  14159. 224.48 s [unordered-containers] except perhaps to import instances from ‘Control.Applicative’
  14160. 224.48 s [unordered-containers] To import instances alone, use: import Control.Applicative()
  14161. 224.48 s [unordered-containers] |
  14162. 224.48 s [unordered-containers] 83 | import Control.Applicative (liftA2)
  14163. 224.48 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  14164. 224.48 s [unordered-containers]
  14165. 224.48 s [unordered-containers] Data/HashMap/Internal/Array.hs:162:20-43: warning: [GHC-68441] [-Wdeprecations]
  14166. 224.48 s [unordered-containers] In the use of ‘sizeofSmallMutableArray#’
  14167. 224.48 s [unordered-containers] (imported from GHC.Exts, but defined in GHC.Prim):
  14168. 224.48 s [unordered-containers] Deprecated: " Use 'getSizeofSmallMutableArray#' instead "
  14169. 224.48 s [unordered-containers] |
  14170. 224.48 s [unordered-containers] 162 | lengthM mary = I# (sizeofSmallMutableArray# (unMArray mary))
  14171. 224.48 s [unordered-containers] | ^^^^^^^^^^^^^^^^^^^^^^^^
  14172. 224.48 s [unordered-containers]
  14173. 224.48 s [unordered-containers] [2 of 9] Compiling Data.HashMap.Internal.List ( Data/HashMap/Internal/List.hs, nothing ) [Flags changed]
  14174. 224.49 s [unordered-containers] [3 of 9] Compiling Data.HashMap.Internal ( Data/HashMap/Internal.hs, nothing ) [Flags changed]
  14175. 225.20 s [unordered-containers] [4 of 9] Compiling Data.HashMap.Internal.Debug ( Data/HashMap/Internal/Debug.hs, nothing ) [Flags changed]
  14176. 225.23 s [unordered-containers] [5 of 9] Compiling Data.HashMap.Internal.Strict ( Data/HashMap/Internal/Strict.hs, nothing ) [Flags changed]
  14177. 225.31 s [unordered-containers] [6 of 9] Compiling Data.HashSet.Internal ( Data/HashSet/Internal.hs, nothing ) [Flags changed]
  14178. 225.36 s [unordered-containers] [7 of 9] Compiling Data.HashSet ( Data/HashSet.hs, nothing ) [Flags changed]
  14179. 225.40 s [unordered-containers] [8 of 9] Compiling Data.HashMap.Strict ( Data/HashMap/Strict.hs, nothing ) [Flags changed]
  14180. 225.40 s [unordered-containers] [9 of 9] Compiling Data.HashMap.Lazy ( Data/HashMap/Lazy.hs, nothing ) [Flags changed]
  14181. 225.40 s [unordered-containers] Haddock coverage:
  14182. 225.45 s [unordered-containers] 33% ( 16 / 48) in 'Data.HashMap.Internal.Array'
  14183. 225.45 s [unordered-containers] Missing documentation for:
  14184. 225.45 s [unordered-containers] Array (Data/HashMap/Internal/Array.hs:125)
  14185. 225.45 s [unordered-containers] MArray (Data/HashMap/Internal/Array.hs:157)
  14186. 225.45 s [unordered-containers] new_ (Data/HashMap/Internal/Array.hs:208)
  14187. 225.45 s [unordered-containers] singleton (Data/HashMap/Internal/Array.hs:225)
  14188. 225.45 s [unordered-containers] singletonM (Data/HashMap/Internal/Array.hs:229)
  14189. 225.45 s [unordered-containers] snoc (Data/HashMap/Internal/Array.hs:233)
  14190. 225.45 s [unordered-containers] pair (Data/HashMap/Internal/Array.hs:242)
  14191. 225.45 s [unordered-containers] length (Data/HashMap/Internal/Array.hs:154)
  14192. 225.45 s [unordered-containers] lengthM (Data/HashMap/Internal/Array.hs:162)
  14193. 225.45 s [unordered-containers] read (Data/HashMap/Internal/Array.hs:249)
  14194. 225.45 s [unordered-containers] write (Data/HashMap/Internal/Array.hs:255)
  14195. 225.45 s [unordered-containers] index (Data/HashMap/Internal/Array.hs:262)
  14196. 225.45 s [unordered-containers] indexM (Data/HashMap/Internal/Array.hs:274)
  14197. 225.45 s [unordered-containers] index# (Data/HashMap/Internal/Array.hs:268)
  14198. 225.45 s [unordered-containers] sameArray1 (Data/HashMap/Internal/Array.hs:140)
  14199. 225.45 s [unordered-containers] unsafeFreeze (Data/HashMap/Internal/Array.hs:280)
  14200. 225.45 s [unordered-containers] unsafeThaw (Data/HashMap/Internal/Array.hs:286)
  14201. 225.45 s [unordered-containers] unsafeSameArray (Data/HashMap/Internal/Array.hs:136)
  14202. 225.45 s [unordered-containers] run (Data/HashMap/Internal/Array.hs:292)
  14203. 225.45 s [unordered-containers] cloneM (Data/HashMap/Internal/Array.hs:314)
  14204. 225.45 s [unordered-containers] foldl (Data/HashMap/Internal/Array.hs:404)
  14205. 225.45 s [unordered-containers] foldl' (Data/HashMap/Internal/Array.hs:375)
  14206. 225.45 s [unordered-containers] foldr (Data/HashMap/Internal/Array.hs:394)
  14207. 225.45 s [unordered-containers] foldr' (Data/HashMap/Internal/Array.hs:385)
  14208. 225.45 s [unordered-containers] foldMap (Data/HashMap/Internal/Array.hs:417)
  14209. 225.45 s [unordered-containers] thaw (Data/HashMap/Internal/Array.hs:436)
  14210. 225.45 s [unordered-containers] map (Data/HashMap/Internal/Array.hs:461)
  14211. 225.45 s [unordered-containers] traverse (Data/HashMap/Internal/Array.hs:537)
  14212. 225.45 s [unordered-containers] traverse' (Data/HashMap/Internal/Array.hs:553)
  14213. 225.45 s [unordered-containers] toList (Data/HashMap/Internal/Array.hs:529)
  14214. 225.45 s [unordered-containers] fromList (Data/HashMap/Internal/Array.hs:494)
  14215. 225.45 s [unordered-containers] fromList' (Data/HashMap/Internal/Array.hs:506)
  14216. 225.45 s [unordered-containers] 25% ( 1 / 4) in 'Data.HashMap.Internal.List'
  14217. 225.45 s [unordered-containers] Missing documentation for:
  14218. 225.45 s [unordered-containers] isPermutationBy (Data/HashMap/Internal/List.hs:40)
  14219. 225.45 s [unordered-containers] deleteBy (Data/HashMap/Internal/List.hs:83)
  14220. 225.45 s [unordered-containers] unorderedCompare (Data/HashMap/Internal/List.hs:68)
  14221. 225.45 s [unordered-containers] Warning: 'at' is out of scope.
  14222. 225.45 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  14223. 225.45 s [unordered-containers] Warning: 'Leaf' is ambiguous. It is defined
  14224. 225.45 s [unordered-containers] * at Data/HashMap/Internal.hs:227:7
  14225. 225.45 s [unordered-containers] * at Data/HashMap/Internal.hs:187:1
  14226. 225.45 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14227. 225.45 s [unordered-containers] by specifying the type/value namespace explicitly.
  14228. 225.45 s [unordered-containers] Defaulting to the one defined at Data/HashMap/Internal.hs:187:1
  14229. 225.46 s [unordered-containers] 88% ( 93 /105) in 'Data.HashMap.Internal'
  14230. 225.46 s [unordered-containers] Missing documentation for:
  14231. 225.46 s [unordered-containers] Leaf (Data/HashMap/Internal.hs:187)
  14232. 225.46 s [unordered-containers] intersectionWithKey# (Data/HashMap/Internal.hs:1859)
  14233. 225.46 s [unordered-containers] updateOrConcatWithKey (Data/HashMap/Internal.hs:2373)
  14234. 225.46 s [unordered-containers] equalKeys (Data/HashMap/Internal.hs:513)
  14235. 225.46 s [unordered-containers] equalKeys1 (Data/HashMap/Internal.hs:497)
  14236. 225.46 s [unordered-containers] lookupRecordCollision (Data/HashMap/Internal.hs:680)
  14237. 225.46 s [unordered-containers] LookupRes (Data/HashMap/Internal.hs:659)
  14238. 225.46 s [unordered-containers] lookupResToMaybe (Data/HashMap/Internal.hs:662)
  14239. 225.46 s [unordered-containers] insert' (Data/HashMap/Internal.hs:808)
  14240. 225.46 s [unordered-containers] delete' (Data/HashMap/Internal.hs:1126)
  14241. 225.46 s [unordered-containers] insertNewKey (Data/HashMap/Internal.hs:850)
  14242. 225.46 s [unordered-containers] insertKeyExists (Data/HashMap/Internal.hs:885)
  14243. 225.46 s [unordered-containers] 50% ( 3 / 6) in 'Data.HashMap.Internal.Debug'
  14244. 225.46 s [unordered-containers] Missing documentation for:
  14245. 225.46 s [unordered-containers] valid (Data/HashMap/Internal/Debug.hs:98)
  14246. 225.46 s [unordered-containers] Validity (Data/HashMap/Internal/Debug.hs:43)
  14247. 225.47 s [unordered-containers] SubHashPath (Data/HashMap/Internal/Debug.hs:75)
  14248. 225.47 s [unordered-containers] Warning: 'lookup' is out of scope.
  14249. 225.47 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  14250. 225.47 s [unordered-containers] Warning: 'at' is out of scope.
  14251. 225.47 s [unordered-containers] If you qualify the identifier, haddock can try to link it anyway.
  14252. 225.47 s [unordered-containers] 100% ( 67 / 67) in 'Data.HashMap.Internal.Strict'
  14253. 225.47 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  14254. 225.47 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  14255. 225.47 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  14256. 225.47 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14257. 225.47 s [unordered-containers] by specifying the type/value namespace explicitly.
  14258. 225.47 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  14259. 225.47 s [unordered-containers] 100% ( 35 / 35) in 'Data.HashSet.Internal'
  14260. 225.47 s [unordered-containers] Warning: 'HashSet' is ambiguous. It is defined
  14261. 225.47 s [unordered-containers] * at Data/HashSet/Internal.hs:112:21
  14262. 225.47 s [unordered-containers] * at Data/HashSet/Internal.hs:112:1
  14263. 225.47 s [unordered-containers] You may be able to disambiguate the identifier by qualifying it or
  14264. 225.47 s [unordered-containers] by specifying the type/value namespace explicitly.
  14265. 225.47 s [unordered-containers] Defaulting to the one defined at Data/HashSet/Internal.hs:112:1
  14266. 225.47 s [unordered-containers] 100% ( 32 / 32) in 'Data.HashSet'
  14267. 225.48 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Strict'
  14268. 225.48 s [unordered-containers] 100% ( 69 / 69) in 'Data.HashMap.Lazy'
  14269. 225.66 s [unordered-containers] Warning: Data.HashMap.Internal: could not find link destinations for:
  14270. 225.66 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14271. 225.66 s [unordered-containers] Warning: Data.HashMap.Internal.Strict: could not find link destinations for:
  14272. 225.66 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14273. 225.66 s [unordered-containers] Warning: Data.HashSet.Internal: could not find link destinations for:
  14274. 225.66 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  14275. 225.67 s [unordered-containers] Warning: Data.HashSet: could not find link destinations for:
  14276. 225.67 s [unordered-containers] - Data.HashSet.Internal.D:R:ItemHashSet
  14277. 225.67 s [unordered-containers] Warning: Data.HashMap.Strict: could not find link destinations for:
  14278. 225.67 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14279. 225.67 s [unordered-containers] Warning: Data.HashMap.Lazy: could not find link destinations for:
  14280. 225.67 s [unordered-containers] - Data.HashMap.Internal.D:R:ItemHashMap
  14281. 229.70 s [unordered-containers] Documentation created: dist/doc/html/unordered-containers,
  14282. 229.70 s [unordered-containers] dist/doc/html/unordered-containers/unordered-containers.txt
  14283. 230.09 s [unordered-containers] Preprocessing test suite 'unordered-containers-tests' for unordered-containers-0.2.20.1...
  14284. 230.13 s [unordered-containers] Phase: installPhase
  14285. 230.18 s [unordered-containers] Installing library in /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  14286. 230.46 s [unordered-containers] Phase: fixupPhase
  14287. 230.47 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1
  14288. 230.48 s [unordered-containers] shrinking /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHSunordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF-ghc9.12.2.so
  14289. 230.49 s [unordered-containers] checking for references to /build/ in /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1...
  14290. 230.51 s [unordered-containers] patching script interpreter paths in /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1
  14291. 230.51 s [unordered-containers] stripping (with command strip and flags -S -p) in /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1/lib
  14292. 230.61 s [unordered-containers] shrinking RPATHs of ELF executables and libraries in /nix/store/r8fiibcxm6cb3mgmz9mrnfxcsnwnswch-unordered-containers-0.2.20.1-doc
  14293. 230.62 s [unordered-containers] checking for references to /build/ in /nix/store/r8fiibcxm6cb3mgmz9mrnfxcsnwnswch-unordered-containers-0.2.20.1-doc...
  14294. 230.64 s [unordered-containers] patching script interpreter paths in /nix/store/r8fiibcxm6cb3mgmz9mrnfxcsnwnswch-unordered-containers-0.2.20.1-doc
  14295. 230.73 s [unordered-containers:post-build] Uploading to cachix cache "sellout": /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1 /nix/store/r8fiibcxm6cb3mgmz9mrnfxcsnwnswch-unordered-containers-0.2.20.1-doc
  14296. 231.30 s [unordered-containers:post-build] Pushing 2 paths (72 are already present) using zstd to cache sellout ⏳
  14297. 231.30 s [unordered-containers:post-build]
  14298. 231.66 s [unordered-containers:post-build] Pushing /nix/store/r8fiibcxm6cb3mgmz9mrnfxcsnwnswch-unordered-containers-0.2.20.1-doc (4.47 MiB)
  14299. 231.82 s [unordered-containers:post-build] Pushing /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1 (9.81 MiB)
  14300. 232.86 s [unordered-containers:post-build]
  14301. 232.86 s [unordered-containers:post-build] All done.
  14302. 232.87 s [unordered-containers:post-build] Uploading to the NixCI cache: /nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1 /nix/store/r8fiibcxm6cb3mgmz9mrnfxcsnwnswch-unordered-containers-0.2.20.1-doc
  14303. 232.91 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14304. 233.12 s [unordered-containers:post-build] copying 2 paths...
  14305. 233.12 s [unordered-containers:post-build] copying path '/nix/store/r8fiibcxm6cb3mgmz9mrnfxcsnwnswch-unordered-containers-0.2.20.1-doc' to 'https://cache.nix-ci.com'...
  14306. 233.68 s [unordered-containers:post-build] copying path '/nix/store/ni8p0nj55465mk1q3xc74b2h4vy41182-unordered-containers-0.2.20.1' to 'https://cache.nix-ci.com'...
  14307. 235.85 s [unordered-containers:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14308. 236.09 s [unordered-containers:post-build] copying 1 paths...
  14309. 236.13 s [unordered-containers:post-build] copying path '/nix/store/2ivbb618b8h11ny2wdx7qjywgjg4d7kb-unordered-containers-0.2.20.1.drv' to 'https://cache.nix-ci.com'...
  14310. 236.32 s Progress: 6 of 14 built, 43 of 43 downloaded from cache
  14311. 236.35 s Building /nix/store/hfkq61j8kik6qx530limn8vwv0l9ch00-quickcheck-instances-0.3.33.drv
  14312. 236.48 s [quickcheck-instances] Phase: setupCompilerEnvironmentPhase
  14313. 236.48 s [quickcheck-instances] Build with /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2.
  14314. 236.66 s [quickcheck-instances] Phase: unpackPhase
  14315. 236.67 s [quickcheck-instances] unpacking source archive /nix/store/ix9xgbag8470whifn4mzlsji4yz8vrc1-quickcheck-instances-0.3.33.tar.gz
  14316. 236.67 s [quickcheck-instances] source root is quickcheck-instances-0.3.33
  14317. 236.68 s [quickcheck-instances] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "quickcheck-instances-0.3.33/test/Tests.hs"
  14318. 236.68 s [quickcheck-instances] Phase: patchPhase
  14319. 236.68 s [quickcheck-instances] Replace Cabal file with edited version from mirror://hackage/quickcheck-instances-0.3.33/revision/1.cabal.
  14320. 236.69 s [quickcheck-instances] Phase: compileBuildDriverPhase
  14321. 236.69 s [quickcheck-instances] setupCompileFlags: -package-db=/build/tmp.EYbvXgwUsr/setup-package.conf.d -threaded
  14322. 236.74 s [quickcheck-instances] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.EYbvXgwUsr/Main.o )
  14323. 236.78 s [quickcheck-instances] [2 of 2] Linking Setup
  14324. 237.95 s [quickcheck-instances] Phase: updateAutotoolsGnuConfigScriptsPhase
  14325. 237.96 s [quickcheck-instances] Phase: configurePhase
  14326. 237.96 s [quickcheck-instances] configureFlags: --verbose --prefix=/nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/xndiwna5pq7grxcwmyk3l3p0a00lj8d3-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33 --with-gcc=gcc --package-db=/build/tmp.EYbvXgwUsr/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  14327. 237.97 s [quickcheck-instances] Using Parsec parser
  14328. 237.97 s [quickcheck-instances] Configuring quickcheck-instances-0.3.33...
  14329. 238.00 s [quickcheck-instances] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  14330. 238.00 s [quickcheck-instances] 'ghc' version < 9.12):
  14331. 238.00 s [quickcheck-instances] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc is version
  14332. 238.00 s [quickcheck-instances] 9.12.2
  14333. 238.46 s [quickcheck-instances] Dependency OneTuple >=0.4.2 && <0.5: using OneTuple-0.4.2
  14334. 238.46 s [quickcheck-instances] Dependency QuickCheck >=2.14.2 && <2.16.1: using QuickCheck-2.15.0.1
  14335. 238.46 s [quickcheck-instances] Dependency array >=0.5.3.0 && <0.6: using array-0.5.8.0
  14336. 238.46 s [quickcheck-instances] Dependency base >=4.12.0.0 && <4.22: using base-4.21.0.0
  14337. 238.46 s [quickcheck-instances] Dependency bytestring >=0.10.8.2 && <0.13: using bytestring-0.12.2.0
  14338. 238.46 s [quickcheck-instances] Dependency case-insensitive >=1.2.0.11 && <1.3: using case-insensitive-1.2.1.0
  14339. 238.46 s [quickcheck-instances] Dependency containers >=0.6.0.1 && <0.8: using containers-0.7
  14340. 238.46 s [quickcheck-instances] Dependency data-fix >=0.3 && <0.4: using data-fix-0.3.4
  14341. 238.46 s [quickcheck-instances] Dependency hashable >=1.4.4.0 && <1.6: using hashable-1.5.0.0
  14342. 238.46 s [quickcheck-instances] Dependency integer-logarithms >=1.0.3.1 && <1.1: using
  14343. 238.46 s [quickcheck-instances] integer-logarithms-1.0.4
  14344. 238.46 s [quickcheck-instances] Dependency old-time >=1.1.0.0 && <1.2: using old-time-1.1.0.4
  14345. 238.46 s [quickcheck-instances] Dependency primitive >=0.9.0.0 && <0.10: using primitive-0.9.1.0
  14346. 238.46 s [quickcheck-instances] Dependency scientific >=0.3.8.0 && <0.4: using scientific-0.3.8.0
  14347. 238.46 s [quickcheck-instances] Dependency splitmix >=0.1.0.5 && <0.2: using splitmix-0.1.3.1
  14348. 238.46 s [quickcheck-instances] Dependency strict >=0.5 && <0.6: using strict-0.5.1
  14349. 238.46 s [quickcheck-instances] Dependency tagged >=0.8.8 && <0.9: using tagged-0.8.9
  14350. 238.46 s [quickcheck-instances] Dependency text >=1.2.3.0 && <1.3 || >=2.0 && <2.2: using text-2.1.2
  14351. 238.46 s [quickcheck-instances] Dependency text-short >=0.1.4 && <0.2: using text-short-0.1.6
  14352. 238.46 s [quickcheck-instances] Dependency these >=1.2.1 && <1.3: using these-1.2.1
  14353. 238.46 s [quickcheck-instances] Dependency time-compat >=1.9.4 && <1.10: using time-compat-1.9.8
  14354. 238.46 s [quickcheck-instances] Dependency transformers >=0.5.6.2 && <0.7: using transformers-0.6.1.2
  14355. 238.46 s [quickcheck-instances] Dependency unordered-containers >=0.2.20 && <0.3: using
  14356. 238.46 s [quickcheck-instances] unordered-containers-0.2.20.1
  14357. 238.46 s [quickcheck-instances] Dependency uuid-types >=1.0.6 && <1.1: using uuid-types-1.0.6
  14358. 238.46 s [quickcheck-instances] Dependency vector >=0.13.2.0 && <0.14: using vector-0.13.2.0
  14359. 238.46 s [quickcheck-instances] Dependency QuickCheck: using QuickCheck-2.15.0.1
  14360. 238.46 s [quickcheck-instances] Dependency base: using base-4.21.0.0
  14361. 238.46 s [quickcheck-instances] Dependency containers: using containers-0.7
  14362. 238.46 s [quickcheck-instances] Dependency primitive: using primitive-0.9.1.0
  14363. 238.46 s [quickcheck-instances] Dependency quickcheck-instances: using quickcheck-instances-0.3.33
  14364. 238.46 s [quickcheck-instances] Dependency tagged: using tagged-0.8.9
  14365. 238.46 s [quickcheck-instances] Dependency uuid-types: using uuid-types-1.0.6
  14366. 238.46 s [quickcheck-instances] Source component graph:
  14367. 238.46 s [quickcheck-instances] component lib
  14368. 238.46 s [quickcheck-instances] component test:self-test dependency lib
  14369. 238.46 s [quickcheck-instances] Configured component graph:
  14370. 238.46 s [quickcheck-instances] component quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  14371. 238.46 s [quickcheck-instances] include OneTuple-0.4.2-9yUF7jGnYxaAECoDfDC9gZ
  14372. 238.46 s [quickcheck-instances] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  14373. 238.46 s [quickcheck-instances] include array-0.5.8.0-d6d4
  14374. 238.46 s [quickcheck-instances] include base-4.21.0.0-b334
  14375. 238.46 s [quickcheck-instances] include bytestring-0.12.2.0-0cf8
  14376. 238.46 s [quickcheck-instances] include case-insensitive-1.2.1.0-D0PevEiW49I9bqJrOtUHkS
  14377. 238.46 s [quickcheck-instances] include containers-0.7-d79e
  14378. 238.46 s [quickcheck-instances] include data-fix-0.3.4-LXjketSEK22HJBNry0yp7m
  14379. 238.46 s [quickcheck-instances] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  14380. 238.46 s [quickcheck-instances] include integer-logarithms-1.0.4-CGEBnVdocb1FsiJy43VXnU
  14381. 238.46 s [quickcheck-instances] include old-time-1.1.0.4-4mhjMFh8CF1AsdPcX1m5yD
  14382. 238.46 s [quickcheck-instances] include primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  14383. 238.46 s [quickcheck-instances] include scientific-0.3.8.0-Hj5LPtVmr86Dete6DVIqoE
  14384. 238.46 s [quickcheck-instances] include splitmix-0.1.3.1-7dKiUNzaWtvEJHSk7DLUx
  14385. 238.46 s [quickcheck-instances] include strict-0.5.1-FibWDv1dbC3CqfeTsaTydO
  14386. 238.46 s [quickcheck-instances] include tagged-0.8.9-ATKtHawvD517H9kbujx1cx
  14387. 238.46 s [quickcheck-instances] include text-2.1.2-e822
  14388. 238.46 s [quickcheck-instances] include text-short-0.1.6-A5U4MHwbAcn3oDMToCfxcX
  14389. 238.46 s [quickcheck-instances] include these-1.2.1-75zmMVeYMwmCe5t578HOX6
  14390. 238.46 s [quickcheck-instances] include time-compat-1.9.8-586fbicX6a7IyVf7sZmFEK
  14391. 238.46 s [quickcheck-instances] include transformers-0.6.1.2-2558
  14392. 238.46 s [quickcheck-instances] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  14393. 238.46 s [quickcheck-instances] include uuid-types-1.0.6-3rbqfPylLliGtuVkIKa2od
  14394. 238.46 s [quickcheck-instances] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  14395. 238.46 s [quickcheck-instances] component quickcheck-instances-0.3.33-AnqMYWA5uZpHQqiCilE1uL-self-test
  14396. 238.46 s [quickcheck-instances] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  14397. 238.46 s [quickcheck-instances] include base-4.21.0.0-b334
  14398. 238.46 s [quickcheck-instances] include containers-0.7-d79e
  14399. 238.46 s [quickcheck-instances] include primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  14400. 238.46 s [quickcheck-instances] include quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  14401. 238.46 s [quickcheck-instances] include tagged-0.8.9-ATKtHawvD517H9kbujx1cx
  14402. 238.46 s [quickcheck-instances] include uuid-types-1.0.6-3rbqfPylLliGtuVkIKa2od
  14403. 238.46 s [quickcheck-instances] Linked component graph:
  14404. 238.46 s [quickcheck-instances] unit quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  14405. 238.46 s [quickcheck-instances] include OneTuple-0.4.2-9yUF7jGnYxaAECoDfDC9gZ
  14406. 238.46 s [quickcheck-instances] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  14407. 238.46 s [quickcheck-instances] include array-0.5.8.0-d6d4
  14408. 238.46 s [quickcheck-instances] include base-4.21.0.0-b334
  14409. 238.46 s [quickcheck-instances] include bytestring-0.12.2.0-0cf8
  14410. 238.46 s [quickcheck-instances] include case-insensitive-1.2.1.0-D0PevEiW49I9bqJrOtUHkS
  14411. 238.46 s [quickcheck-instances] include containers-0.7-d79e
  14412. 238.46 s [quickcheck-instances] include data-fix-0.3.4-LXjketSEK22HJBNry0yp7m
  14413. 238.46 s [quickcheck-instances] include hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  14414. 238.46 s [quickcheck-instances] include integer-logarithms-1.0.4-CGEBnVdocb1FsiJy43VXnU
  14415. 238.46 s [quickcheck-instances] include old-time-1.1.0.4-4mhjMFh8CF1AsdPcX1m5yD
  14416. 238.46 s [quickcheck-instances] include primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  14417. 238.46 s [quickcheck-instances] include scientific-0.3.8.0-Hj5LPtVmr86Dete6DVIqoE
  14418. 238.46 s [quickcheck-instances] include splitmix-0.1.3.1-7dKiUNzaWtvEJHSk7DLUx
  14419. 238.46 s [quickcheck-instances] include strict-0.5.1-FibWDv1dbC3CqfeTsaTydO
  14420. 238.46 s [quickcheck-instances] include tagged-0.8.9-ATKtHawvD517H9kbujx1cx
  14421. 238.46 s [quickcheck-instances] include text-2.1.2-e822
  14422. 238.46 s [quickcheck-instances] include text-short-0.1.6-A5U4MHwbAcn3oDMToCfxcX
  14423. 238.46 s [quickcheck-instances] include these-1.2.1-75zmMVeYMwmCe5t578HOX6
  14424. 238.46 s [quickcheck-instances] include time-compat-1.9.8-586fbicX6a7IyVf7sZmFEK
  14425. 238.46 s [quickcheck-instances] include transformers-0.6.1.2-2558
  14426. 238.46 s [quickcheck-instances] include unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  14427. 238.46 s [quickcheck-instances] include uuid-types-1.0.6-3rbqfPylLliGtuVkIKa2od
  14428. 238.46 s [quickcheck-instances] include vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  14429. 238.46 s [quickcheck-instances] Test.QuickCheck.Instances=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances,Test.QuickCheck.Instances.Array=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Array,Test.QuickCheck.Instances.Array.Byte=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Array.Byte,Test.QuickCheck.Instances.ByteString=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.ByteString,Test.QuickCheck.Instances.CaseInsensitive=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.CaseInsensitive,Test.QuickCheck.Instances.Containers=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Containers,Test.QuickCheck.Instances.DataFix=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.DataFix,Test.QuickCheck.Instances.Hashable=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Hashable,Test.QuickCheck.Instances.Natural=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Natural,Test.QuickCheck.Instances.OldTime=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.OldTime,Test.QuickCheck.Instances.Primitive=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Primitive,Test.QuickCheck.Instances.Scientific=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Scientific,Test.QuickCheck.Instances.Semigroup=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Semigroup,Test.QuickCheck.Instances.Solo=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Solo,Test.QuickCheck.Instances.Strict=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Strict,Test.QuickCheck.Instances.Tagged=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Tagged,Test.QuickCheck.Instances.Text=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Text,Test.QuickCheck.Instances.Text.Short=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Text.Short,Test.QuickCheck.Instances.These=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.These,Test.QuickCheck.Instances.Time=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Time,Test.QuickCheck.Instances.Transformer=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Transformer,Test.QuickCheck.Instances.UUID=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.UUID,Test.QuickCheck.Instances.UnorderedContainers=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.UnorderedContainers,Test.QuickCheck.Instances.Vector=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Vector,Test.QuickCheck.Instances.Void=quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw:Test.QuickCheck.Instances.Void
  14430. 238.46 s [quickcheck-instances] unit quickcheck-instances-0.3.33-AnqMYWA5uZpHQqiCilE1uL-self-test
  14431. 238.46 s [quickcheck-instances] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  14432. 238.47 s [quickcheck-instances] include base-4.21.0.0-b334
  14433. 238.47 s [quickcheck-instances] include containers-0.7-d79e
  14434. 238.47 s [quickcheck-instances] include primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  14435. 238.47 s [quickcheck-instances] include quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  14436. 238.47 s [quickcheck-instances] include tagged-0.8.9-ATKtHawvD517H9kbujx1cx
  14437. 238.47 s [quickcheck-instances] include uuid-types-1.0.6-3rbqfPylLliGtuVkIKa2od
  14438. 238.47 s [quickcheck-instances] Ready component graph:
  14439. 238.47 s [quickcheck-instances] definite quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  14440. 238.47 s [quickcheck-instances] depends OneTuple-0.4.2-9yUF7jGnYxaAECoDfDC9gZ
  14441. 238.47 s [quickcheck-instances] depends QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  14442. 238.47 s [quickcheck-instances] depends array-0.5.8.0-d6d4
  14443. 238.47 s [quickcheck-instances] depends base-4.21.0.0-b334
  14444. 238.47 s [quickcheck-instances] depends bytestring-0.12.2.0-0cf8
  14445. 238.47 s [quickcheck-instances] depends case-insensitive-1.2.1.0-D0PevEiW49I9bqJrOtUHkS
  14446. 238.47 s [quickcheck-instances] depends containers-0.7-d79e
  14447. 238.47 s [quickcheck-instances] depends data-fix-0.3.4-LXjketSEK22HJBNry0yp7m
  14448. 238.47 s [quickcheck-instances] depends hashable-1.5.0.0-LjYCr2INJa96D1zV0qVgRV
  14449. 238.47 s [quickcheck-instances] depends integer-logarithms-1.0.4-CGEBnVdocb1FsiJy43VXnU
  14450. 238.47 s [quickcheck-instances] depends old-time-1.1.0.4-4mhjMFh8CF1AsdPcX1m5yD
  14451. 238.47 s [quickcheck-instances] depends primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  14452. 238.47 s [quickcheck-instances] depends scientific-0.3.8.0-Hj5LPtVmr86Dete6DVIqoE
  14453. 238.47 s [quickcheck-instances] depends splitmix-0.1.3.1-7dKiUNzaWtvEJHSk7DLUx
  14454. 238.47 s [quickcheck-instances] depends strict-0.5.1-FibWDv1dbC3CqfeTsaTydO
  14455. 238.47 s [quickcheck-instances] depends tagged-0.8.9-ATKtHawvD517H9kbujx1cx
  14456. 238.47 s [quickcheck-instances] depends text-2.1.2-e822
  14457. 238.47 s [quickcheck-instances] depends text-short-0.1.6-A5U4MHwbAcn3oDMToCfxcX
  14458. 238.47 s [quickcheck-instances] depends these-1.2.1-75zmMVeYMwmCe5t578HOX6
  14459. 238.47 s [quickcheck-instances] depends time-compat-1.9.8-586fbicX6a7IyVf7sZmFEK
  14460. 238.47 s [quickcheck-instances] depends transformers-0.6.1.2-2558
  14461. 238.47 s [quickcheck-instances] depends unordered-containers-0.2.20.1-3ZsWQAs3PjGLjwQKK8XWLF
  14462. 238.47 s [quickcheck-instances] depends uuid-types-1.0.6-3rbqfPylLliGtuVkIKa2od
  14463. 238.47 s [quickcheck-instances] depends vector-0.13.2.0-3c84fuk6GiA8DWmjwoyPqH
  14464. 238.47 s [quickcheck-instances] definite quickcheck-instances-0.3.33-AnqMYWA5uZpHQqiCilE1uL-self-test
  14465. 238.47 s [quickcheck-instances] depends QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  14466. 238.47 s [quickcheck-instances] depends base-4.21.0.0-b334
  14467. 238.47 s [quickcheck-instances] depends containers-0.7-d79e
  14468. 238.47 s [quickcheck-instances] depends primitive-0.9.1.0-GUZ9pmn8oTWdoWsH4TBO0
  14469. 238.47 s [quickcheck-instances] depends quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  14470. 238.47 s [quickcheck-instances] depends tagged-0.8.9-ATKtHawvD517H9kbujx1cx
  14471. 238.47 s [quickcheck-instances] depends uuid-types-1.0.6-3rbqfPylLliGtuVkIKa2od
  14472. 238.47 s [quickcheck-instances] Using Cabal-3.14.1.0 compiled by ghc-9.12
  14473. 238.47 s [quickcheck-instances] Using compiler: ghc-9.12.2
  14474. 238.47 s [quickcheck-instances] Using install prefix:
  14475. 238.47 s [quickcheck-instances] /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33
  14476. 238.47 s [quickcheck-instances] Executables installed in:
  14477. 238.47 s [quickcheck-instances] /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33/bin
  14478. 238.47 s [quickcheck-instances] Libraries installed in:
  14479. 238.47 s [quickcheck-instances] /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  14480. 238.47 s [quickcheck-instances] Dynamic Libraries installed in:
  14481. 238.47 s [quickcheck-instances] /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3
  14482. 238.47 s [quickcheck-instances] Private executables installed in:
  14483. 238.47 s [quickcheck-instances] /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33/libexec/x86_64-linux-ghc-9.12.2-82d3/quickcheck-instances-0.3.33
  14484. 238.47 s [quickcheck-instances] Data files installed in:
  14485. 238.47 s [quickcheck-instances] /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33/share/x86_64-linux-ghc-9.12.2-82d3/quickcheck-instances-0.3.33
  14486. 238.47 s [quickcheck-instances] Documentation installed in:
  14487. 238.47 s [quickcheck-instances] /nix/store/xndiwna5pq7grxcwmyk3l3p0a00lj8d3-quickcheck-instances-0.3.33-doc/share/doc/quickcheck-instances-0.3.33
  14488. 238.47 s [quickcheck-instances] Configuration files installed in:
  14489. 238.47 s [quickcheck-instances] /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33/etc
  14490. 238.47 s [quickcheck-instances] No alex found
  14491. 238.47 s [quickcheck-instances] Using ar found on system at:
  14492. 238.47 s [quickcheck-instances] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  14493. 238.47 s [quickcheck-instances] No c2hs found
  14494. 238.47 s [quickcheck-instances] No cpphs found
  14495. 238.47 s [quickcheck-instances] No doctest found
  14496. 238.47 s [quickcheck-instances] Using gcc version 14.3.0 given by user at:
  14497. 238.47 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  14498. 238.47 s [quickcheck-instances] Using ghc version 9.12.2 found on system at:
  14499. 238.47 s [quickcheck-instances] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc
  14500. 238.47 s [quickcheck-instances] Using ghc-pkg version 9.12.2 found on system at:
  14501. 238.47 s [quickcheck-instances] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc-pkg-9.12.2
  14502. 238.47 s [quickcheck-instances] No ghcjs found
  14503. 238.47 s [quickcheck-instances] No ghcjs-pkg found
  14504. 238.47 s [quickcheck-instances] No greencard found
  14505. 238.47 s [quickcheck-instances] Using haddock version 2.30.0 found on system at:
  14506. 238.47 s [quickcheck-instances] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/haddock-ghc-9.12.2
  14507. 238.47 s [quickcheck-instances] No happy found
  14508. 238.47 s [quickcheck-instances] No haskell-suite found
  14509. 238.47 s [quickcheck-instances] No haskell-suite-pkg found
  14510. 238.47 s [quickcheck-instances] No hmake found
  14511. 238.47 s [quickcheck-instances] Using hpc version 0.69 found on system at:
  14512. 238.47 s [quickcheck-instances] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hpc-ghc-9.12.2
  14513. 238.47 s [quickcheck-instances] Using hsc2hs version 0.68.10 found on system at:
  14514. 238.47 s [quickcheck-instances] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  14515. 238.47 s [quickcheck-instances] Using hscolour version 1.25 found on system at:
  14516. 238.47 s [quickcheck-instances] /nix/store/02s9rad0jn6nj8z96k357im73hkzqsnw-hscolour-1.25/bin/HsColour
  14517. 238.47 s [quickcheck-instances] No jhc found
  14518. 238.47 s [quickcheck-instances] Using ld found on system at:
  14519. 238.47 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  14520. 238.47 s [quickcheck-instances] No pkg-config found
  14521. 238.47 s [quickcheck-instances] Using runghc version 9.12.2 found on system at:
  14522. 238.47 s [quickcheck-instances] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/runghc-9.12.2
  14523. 238.47 s [quickcheck-instances] Using strip version 2.44 found on system at:
  14524. 238.47 s [quickcheck-instances] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  14525. 238.47 s [quickcheck-instances] Using tar found on system at:
  14526. 238.47 s [quickcheck-instances] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  14527. 238.47 s [quickcheck-instances] No uhc found
  14528. 238.63 s [quickcheck-instances] Phase: buildPhase
  14529. 238.68 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33...
  14530. 238.68 s [quickcheck-instances] Building library for quickcheck-instances-0.3.33...
  14531. 238.78 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 )
  14532. 238.81 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 )
  14533. 238.84 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 )
  14534. 239.05 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 )
  14535. 239.19 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 )
  14536. 239.24 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 )
  14537. 239.24 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 )
  14538. 239.24 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 )
  14539. 239.24 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 )
  14540. 239.24 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 )
  14541. 239.24 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 )
  14542. 239.24 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 )
  14543. 239.24 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 )
  14544. 239.24 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 )
  14545. 239.24 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 )
  14546. 239.32 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 )
  14547. 239.32 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 )
  14548. 239.32 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 )
  14549. 239.32 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 )
  14550. 239.32 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 )
  14551. 239.56 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 )
  14552. 239.56 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 )
  14553. 239.56 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 )
  14554. 239.56 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 )
  14555. 239.56 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 )
  14556. 239.56 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 )
  14557. 239.84 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 )
  14558. 239.97 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 )
  14559. 239.97 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 )
  14560. 240.28 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 )
  14561. 240.46 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 )
  14562. 240.46 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 )
  14563. 240.46 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 )
  14564. 240.46 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 )
  14565. 240.46 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 )
  14566. 240.46 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 )
  14567. 240.47 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 )
  14568. 240.58 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 )
  14569. 240.58 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 )
  14570. 240.58 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 )
  14571. 240.58 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 )
  14572. 240.58 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 )
  14573. 240.58 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 )
  14574. 240.58 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 )
  14575. 240.58 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 )
  14576. 240.58 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 )
  14577. 240.76 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 )
  14578. 240.76 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 )
  14579. 240.76 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 )
  14580. 240.76 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 )
  14581. 240.76 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 )
  14582. 240.76 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, dist/build/Test/QuickCheck/Instances.p_o )
  14583. 242.09 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33...
  14584. 242.09 s [quickcheck-instances] Building test suite 'self-test' for quickcheck-instances-0.3.33...
  14585. 242.21 s [quickcheck-instances] [1 of 1] Compiling Main ( test/Tests.hs, dist/build/self-test/self-test-tmp/Main.o )
  14586. 242.35 s [quickcheck-instances] [2 of 2] Linking dist/build/self-test/self-test
  14587. 242.99 s [quickcheck-instances] Phase: checkPhase
  14588. 243.22 s [quickcheck-instances] Running 1 test suites...
  14589. 243.22 s [quickcheck-instances] Test suite self-test: RUNNING...
  14590. 243.22 s [quickcheck-instances] +++ OK, passed 100 tests.
  14591. 243.23 s [quickcheck-instances] +++ OK, passed 100 tests.
  14592. 243.23 s [quickcheck-instances] +++ OK, passed 100 tests.
  14593. 243.23 s [quickcheck-instances] +++ OK, passed 100 tests.
  14594. 243.23 s [quickcheck-instances] +++ OK, passed 100 tests.
  14595. 243.23 s [quickcheck-instances] Test suite self-test: PASS
  14596. 243.23 s [quickcheck-instances] Test suite logged to: dist/test/quickcheck-instances-0.3.33-self-test.log
  14597. 243.23 s [quickcheck-instances] 1 of 1 test suites (1 of 1 test cases) passed.
  14598. 243.23 s [quickcheck-instances] Phase: haddockPhase
  14599. 243.68 s [quickcheck-instances] Preprocessing library for quickcheck-instances-0.3.33...
  14600. 243.69 s [quickcheck-instances] Running Haddock on library for quickcheck-instances-0.3.33...
  14601. 243.69 s [quickcheck-instances] Warning: The documentation for the following packages are not installed. No
  14602. 243.69 s [quickcheck-instances] links will be generated to these packages: vector-0.13.2.0
  14603. 243.87 s [quickcheck-instances] [ 1 of 26] Compiling Test.QuickCheck.Instances.Containers ( src/Test/QuickCheck/Instances/Containers.hs, nothing ) [HIE file is missing]
  14604. 243.88 s [quickcheck-instances] [ 2 of 26] Compiling Test.QuickCheck.Instances.CustomPrelude ( src/Test/QuickCheck/Instances/CustomPrelude.hs, nothing ) [HIE file is missing]
  14605. 243.93 s [quickcheck-instances] [ 3 of 26] Compiling Test.QuickCheck.Instances.CaseInsensitive ( src/Test/QuickCheck/Instances/CaseInsensitive.hs, nothing ) [HIE file is missing]
  14606. 243.96 s [quickcheck-instances] [ 4 of 26] Compiling Test.QuickCheck.Instances.ByteString ( src/Test/QuickCheck/Instances/ByteString.hs, nothing ) [HIE file is missing]
  14607. 243.98 s [quickcheck-instances] [ 5 of 26] Compiling Test.QuickCheck.Instances.Array ( src/Test/QuickCheck/Instances/Array.hs, nothing ) [HIE file is missing]
  14608. 244.00 s [quickcheck-instances] [ 6 of 26] Compiling Test.QuickCheck.Instances.DataFix ( src/Test/QuickCheck/Instances/DataFix.hs, nothing ) [HIE file is missing]
  14609. 244.01 s [quickcheck-instances] [ 7 of 26] Compiling Test.QuickCheck.Instances.Hashable ( src/Test/QuickCheck/Instances/Hashable.hs, nothing ) [HIE file is missing]
  14610. 244.02 s [quickcheck-instances] [ 8 of 26] Compiling Test.QuickCheck.Instances.Natural ( src/Test/QuickCheck/Instances/Natural.hs, nothing ) [HIE file is missing]
  14611. 244.02 s [quickcheck-instances] [ 9 of 26] Compiling Test.QuickCheck.Instances.OldTime ( src/Test/QuickCheck/Instances/OldTime.hs, nothing ) [HIE file is missing]
  14612. 244.09 s [quickcheck-instances] [10 of 26] Compiling Test.QuickCheck.Instances.Primitive ( src/Test/QuickCheck/Instances/Primitive.hs, nothing ) [HIE file is missing]
  14613. 244.12 s [quickcheck-instances] [11 of 26] Compiling Test.QuickCheck.Instances.Array.Byte ( src/Test/QuickCheck/Instances/Array/Byte.hs, nothing ) [HIE file is missing]
  14614. 244.12 s [quickcheck-instances] [12 of 26] Compiling Test.QuickCheck.Instances.Scientific ( src/Test/QuickCheck/Instances/Scientific.hs, nothing ) [HIE file is missing]
  14615. 244.12 s [quickcheck-instances] [13 of 26] Compiling Test.QuickCheck.Instances.Semigroup ( src/Test/QuickCheck/Instances/Semigroup.hs, nothing ) [HIE file is missing]
  14616. 244.14 s [quickcheck-instances] [14 of 26] Compiling Test.QuickCheck.Instances.Solo ( src/Test/QuickCheck/Instances/Solo.hs, nothing ) [HIE file is missing]
  14617. 244.14 s [quickcheck-instances] [15 of 26] Compiling Test.QuickCheck.Instances.Strict ( src/Test/QuickCheck/Instances/Strict.hs, nothing ) [HIE file is missing]
  14618. 244.17 s [quickcheck-instances] [16 of 26] Compiling Test.QuickCheck.Instances.Tagged ( src/Test/QuickCheck/Instances/Tagged.hs, nothing ) [HIE file is missing]
  14619. 244.18 s [quickcheck-instances] [17 of 26] Compiling Test.QuickCheck.Instances.Text ( src/Test/QuickCheck/Instances/Text.hs, nothing ) [HIE file is missing]
  14620. 244.19 s [quickcheck-instances] [18 of 26] Compiling Test.QuickCheck.Instances.Text.Short ( src/Test/QuickCheck/Instances/Text/Short.hs, nothing ) [HIE file is missing]
  14621. 244.19 s [quickcheck-instances] [19 of 26] Compiling Test.QuickCheck.Instances.These ( src/Test/QuickCheck/Instances/These.hs, nothing ) [HIE file is missing]
  14622. 244.20 s [quickcheck-instances] [20 of 26] Compiling Test.QuickCheck.Instances.Time ( src/Test/QuickCheck/Instances/Time.hs, nothing ) [HIE file is missing]
  14623. 244.26 s [quickcheck-instances] [21 of 26] Compiling Test.QuickCheck.Instances.Transformer ( src/Test/QuickCheck/Instances/Transformer.hs, nothing ) [HIE file is missing]
  14624. 244.37 s [quickcheck-instances] [22 of 26] Compiling Test.QuickCheck.Instances.UUID ( src/Test/QuickCheck/Instances/UUID.hs, nothing ) [HIE file is missing]
  14625. 244.37 s [quickcheck-instances] [23 of 26] Compiling Test.QuickCheck.Instances.UnorderedContainers ( src/Test/QuickCheck/Instances/UnorderedContainers.hs, nothing ) [HIE file is missing]
  14626. 244.38 s [quickcheck-instances] [24 of 26] Compiling Test.QuickCheck.Instances.Vector ( src/Test/QuickCheck/Instances/Vector.hs, nothing ) [HIE file is missing]
  14627. 244.42 s [quickcheck-instances] [25 of 26] Compiling Test.QuickCheck.Instances.Void ( src/Test/QuickCheck/Instances/Void.hs, nothing ) [HIE file is missing]
  14628. 244.42 s [quickcheck-instances] [26 of 26] Compiling Test.QuickCheck.Instances ( src/Test/QuickCheck/Instances.hs, nothing ) [HIE file is missing]
  14629. 244.42 s [quickcheck-instances] Haddock coverage:
  14630. 244.42 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Containers'
  14631. 244.42 s [quickcheck-instances] Missing documentation for:
  14632. 244.42 s [quickcheck-instances] Module header
  14633. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.CaseInsensitive'
  14634. 244.60 s [quickcheck-instances] Missing documentation for:
  14635. 244.60 s [quickcheck-instances] Module header
  14636. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.ByteString'
  14637. 244.60 s [quickcheck-instances] Missing documentation for:
  14638. 244.60 s [quickcheck-instances] Module header
  14639. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array'
  14640. 244.60 s [quickcheck-instances] Missing documentation for:
  14641. 244.60 s [quickcheck-instances] Module header
  14642. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.DataFix'
  14643. 244.60 s [quickcheck-instances] Missing documentation for:
  14644. 244.60 s [quickcheck-instances] Module header
  14645. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Hashable'
  14646. 244.60 s [quickcheck-instances] Missing documentation for:
  14647. 244.60 s [quickcheck-instances] Module header
  14648. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Natural'
  14649. 244.60 s [quickcheck-instances] Missing documentation for:
  14650. 244.60 s [quickcheck-instances] Module header
  14651. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.OldTime'
  14652. 244.60 s [quickcheck-instances] Missing documentation for:
  14653. 244.60 s [quickcheck-instances] Module header
  14654. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Primitive'
  14655. 244.60 s [quickcheck-instances] Missing documentation for:
  14656. 244.60 s [quickcheck-instances] Module header
  14657. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Array.Byte'
  14658. 244.60 s [quickcheck-instances] Missing documentation for:
  14659. 244.60 s [quickcheck-instances] Module header
  14660. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Scientific'
  14661. 244.60 s [quickcheck-instances] Missing documentation for:
  14662. 244.60 s [quickcheck-instances] Module header
  14663. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Semigroup'
  14664. 244.60 s [quickcheck-instances] Missing documentation for:
  14665. 244.60 s [quickcheck-instances] Module header
  14666. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Solo'
  14667. 244.60 s [quickcheck-instances] Missing documentation for:
  14668. 244.60 s [quickcheck-instances] Module header
  14669. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Strict'
  14670. 244.60 s [quickcheck-instances] Missing documentation for:
  14671. 244.60 s [quickcheck-instances] Module header
  14672. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Tagged'
  14673. 244.60 s [quickcheck-instances] Missing documentation for:
  14674. 244.60 s [quickcheck-instances] Module header
  14675. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text'
  14676. 244.60 s [quickcheck-instances] Missing documentation for:
  14677. 244.60 s [quickcheck-instances] Module header
  14678. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Text.Short'
  14679. 244.60 s [quickcheck-instances] Missing documentation for:
  14680. 244.60 s [quickcheck-instances] Module header
  14681. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.These'
  14682. 244.60 s [quickcheck-instances] Missing documentation for:
  14683. 244.60 s [quickcheck-instances] Module header
  14684. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Time'
  14685. 244.60 s [quickcheck-instances] Missing documentation for:
  14686. 244.60 s [quickcheck-instances] Module header
  14687. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Transformer'
  14688. 244.60 s [quickcheck-instances] Missing documentation for:
  14689. 244.60 s [quickcheck-instances] Module header
  14690. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UUID'
  14691. 244.60 s [quickcheck-instances] Missing documentation for:
  14692. 244.60 s [quickcheck-instances] Module header
  14693. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.UnorderedContainers'
  14694. 244.60 s [quickcheck-instances] Missing documentation for:
  14695. 244.60 s [quickcheck-instances] Module header
  14696. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Vector'
  14697. 244.60 s [quickcheck-instances] Missing documentation for:
  14698. 244.60 s [quickcheck-instances] Module header
  14699. 244.60 s [quickcheck-instances] 0% ( 0 / 1) in 'Test.QuickCheck.Instances.Void'
  14700. 244.60 s [quickcheck-instances] Missing documentation for:
  14701. 244.60 s [quickcheck-instances] Module header
  14702. 244.60 s [quickcheck-instances] 100% ( 1 / 1) in 'Test.QuickCheck.Instances'
  14703. 244.86 s [quickcheck-instances] Warning: Test.QuickCheck.Instances.Vector: could not find link destinations for:
  14704. 244.86 s [quickcheck-instances] - Data.Vector.Vector
  14705. 244.86 s [quickcheck-instances] - Data.Vector.Strict.Vector
  14706. 244.86 s [quickcheck-instances] - Data.Vector.Primitive.Vector
  14707. 244.86 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Vector
  14708. 244.86 s [quickcheck-instances] - Data.Vector.Storable.Vector
  14709. 244.86 s [quickcheck-instances] - Data.Vector.Unboxed.Base.Unbox
  14710. 249.06 s [quickcheck-instances] Documentation created: dist/doc/html/quickcheck-instances,
  14711. 249.06 s [quickcheck-instances] dist/doc/html/quickcheck-instances/quickcheck-instances.txt
  14712. 249.50 s [quickcheck-instances] Preprocessing test suite 'self-test' for quickcheck-instances-0.3.33...
  14713. 249.55 s [quickcheck-instances] Phase: installPhase
  14714. 249.60 s [quickcheck-instances] Installing library in /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  14715. 249.96 s [quickcheck-instances] Phase: fixupPhase
  14716. 249.97 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33
  14717. 249.97 s [quickcheck-instances] shrinking /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHSquickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw-ghc9.12.2.so
  14718. 250.00 s [quickcheck-instances] checking for references to /build/ in /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33...
  14719. 250.03 s [quickcheck-instances] patching script interpreter paths in /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33
  14720. 250.04 s [quickcheck-instances] stripping (with command strip and flags -S -p) in /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33/lib
  14721. 250.15 s [quickcheck-instances] shrinking RPATHs of ELF executables and libraries in /nix/store/xndiwna5pq7grxcwmyk3l3p0a00lj8d3-quickcheck-instances-0.3.33-doc
  14722. 250.16 s [quickcheck-instances] checking for references to /build/ in /nix/store/xndiwna5pq7grxcwmyk3l3p0a00lj8d3-quickcheck-instances-0.3.33-doc...
  14723. 250.18 s [quickcheck-instances] patching script interpreter paths in /nix/store/xndiwna5pq7grxcwmyk3l3p0a00lj8d3-quickcheck-instances-0.3.33-doc
  14724. 250.27 s [quickcheck-instances:post-build] Uploading to cachix cache "sellout": /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33 /nix/store/xndiwna5pq7grxcwmyk3l3p0a00lj8d3-quickcheck-instances-0.3.33-doc
  14725. 250.88 s [quickcheck-instances:post-build] Pushing 2 paths (132 are already present) using zstd to cache sellout ⏳
  14726. 250.88 s [quickcheck-instances:post-build]
  14727. 251.25 s [quickcheck-instances:post-build] Pushing /nix/store/xndiwna5pq7grxcwmyk3l3p0a00lj8d3-quickcheck-instances-0.3.33-doc (1.51 MiB)
  14728. 251.47 s [quickcheck-instances:post-build] Pushing /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33 (5.62 MiB)
  14729. 252.50 s [quickcheck-instances:post-build]
  14730. 252.50 s [quickcheck-instances:post-build] All done.
  14731. 252.52 s [quickcheck-instances:post-build] Uploading to the NixCI cache: /nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33 /nix/store/xndiwna5pq7grxcwmyk3l3p0a00lj8d3-quickcheck-instances-0.3.33-doc
  14732. 252.55 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14733. 252.79 s [quickcheck-instances:post-build] copying 2 paths...
  14734. 252.79 s [quickcheck-instances:post-build] copying path '/nix/store/xndiwna5pq7grxcwmyk3l3p0a00lj8d3-quickcheck-instances-0.3.33-doc' to 'https://cache.nix-ci.com'...
  14735. 253.20 s [quickcheck-instances:post-build] copying path '/nix/store/a9s4vyzamw9gnq0np45rdkkns7az0wv9-quickcheck-instances-0.3.33' to 'https://cache.nix-ci.com'...
  14736. 254.50 s [quickcheck-instances:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  14737. 254.75 s [quickcheck-instances:post-build] copying 1 paths...
  14738. 254.79 s [quickcheck-instances:post-build] copying path '/nix/store/hfkq61j8kik6qx530limn8vwv0l9ch00-quickcheck-instances-0.3.33.drv' to 'https://cache.nix-ci.com'...
  14739. 254.97 s Progress: 7 of 14 built, 43 of 43 downloaded from cache
  14740. 255.00 s Building /nix/store/klkin8nnnnj5ykgmlz1f26r6s2ffp1hd-extra-1.8.1.drv
  14741. 255.13 s [extra] Phase: setupCompilerEnvironmentPhase
  14742. 255.13 s [extra] Build with /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2.
  14743. 255.31 s [extra] Phase: unpackPhase
  14744. 255.31 s [extra] unpacking source archive /nix/store/3nprda3kdyhj8zkmv2z32yi6n0gwc966-extra-1.8.1.tar.gz
  14745. 255.32 s [extra] source root is extra-1.8.1
  14746. 255.32 s [extra] setting SOURCE_DATE_EPOCH to timestamp 1000000000 of file "extra-1.8.1/test/TestUtil.hs"
  14747. 255.33 s [extra] Phase: patchPhase
  14748. 255.33 s [extra] Phase: compileBuildDriverPhase
  14749. 255.34 s [extra] setupCompileFlags: -package-db=/build/tmp.bjkyo5yKpl/setup-package.conf.d -threaded
  14750. 255.38 s [extra] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.bjkyo5yKpl/Main.o )
  14751. 255.42 s [extra] [2 of 2] Linking Setup
  14752. 256.59 s [extra] Phase: updateAutotoolsGnuConfigScriptsPhase
  14753. 256.59 s [extra] Phase: configurePhase
  14754. 256.60 s [extra] configureFlags: --verbose --prefix=/nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/m5mmb1c6pvbi67xmynqgcdzf30cb71fn-extra-1.8.1-doc/share/doc/extra-1.8.1 --with-gcc=gcc --package-db=/build/tmp.bjkyo5yKpl/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib
  14755. 256.60 s [extra] Using Parsec parser
  14756. 256.60 s [extra] Configuring extra-1.8.1...
  14757. 256.63 s [extra] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  14758. 256.63 s [extra] 'ghc' version < 9.12):
  14759. 256.63 s [extra] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc is version
  14760. 256.63 s [extra] 9.12.2
  14761. 257.10 s [extra] Dependency base >=4.9 && <5: using base-4.21.0.0
  14762. 257.10 s [extra] Dependency clock >=0.7: using clock-0.8.4
  14763. 257.10 s [extra] Dependency directory: using directory-1.3.9.0
  14764. 257.10 s [extra] Dependency filepath: using filepath-1.5.4.0
  14765. 257.10 s [extra] Dependency process: using process-1.6.25.0
  14766. 257.10 s [extra] Dependency time: using time-1.14
  14767. 257.10 s [extra] Dependency unix: using unix-2.8.6.0
  14768. 257.10 s [extra] Dependency QuickCheck >=2.10: using QuickCheck-2.15.0.1
  14769. 257.11 s [extra] Dependency base >=4 && <5: using base-4.21.0.0
  14770. 257.11 s [extra] Dependency directory: using directory-1.3.9.0
  14771. 257.11 s [extra] Dependency extra: using extra-1.8.1
  14772. 257.11 s [extra] Dependency filepath: using filepath-1.5.4.0
  14773. 257.11 s [extra] Dependency quickcheck-instances >=0.3.17: using quickcheck-instances-0.3.33
  14774. 257.11 s [extra] Dependency unix: using unix-2.8.6.0
  14775. 257.11 s [extra] Source component graph:
  14776. 257.11 s [extra] component lib
  14777. 257.11 s [extra] component test:extra-test dependency lib
  14778. 257.11 s [extra] Configured component graph:
  14779. 257.11 s [extra] component extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  14780. 257.11 s [extra] include base-4.21.0.0-b334
  14781. 257.11 s [extra] include clock-0.8.4-ID3ZHKSe7qB9bOrwwoeq20
  14782. 257.11 s [extra] include directory-1.3.9.0-d362
  14783. 257.11 s [extra] include filepath-1.5.4.0-7227
  14784. 257.11 s [extra] include process-1.6.25.0-bd82
  14785. 257.11 s [extra] include time-1.14-3dc5
  14786. 257.11 s [extra] include unix-2.8.6.0-935f
  14787. 257.11 s [extra] component extra-1.8.1-FcxSS1akaIPKLupWFutujD-extra-test
  14788. 257.11 s [extra] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  14789. 257.11 s [extra] include base-4.21.0.0-b334
  14790. 257.11 s [extra] include directory-1.3.9.0-d362
  14791. 257.11 s [extra] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  14792. 257.11 s [extra] include filepath-1.5.4.0-7227
  14793. 257.11 s [extra] include quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  14794. 257.11 s [extra] include unix-2.8.6.0-935f
  14795. 257.11 s [extra] Linked component graph:
  14796. 257.11 s [extra] unit extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  14797. 257.11 s [extra] include base-4.21.0.0-b334
  14798. 257.11 s [extra] include clock-0.8.4-ID3ZHKSe7qB9bOrwwoeq20
  14799. 257.11 s [extra] include directory-1.3.9.0-d362
  14800. 257.11 s [extra] include filepath-1.5.4.0-7227
  14801. 257.11 s [extra] include process-1.6.25.0-bd82
  14802. 257.11 s [extra] include time-1.14-3dc5
  14803. 257.11 s [extra] include unix-2.8.6.0-935f
  14804. 257.11 s [extra] Control.Concurrent.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Control.Concurrent.Extra,Control.Exception.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Control.Exception.Extra,Control.Monad.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Control.Monad.Extra,Data.Either.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Data.Either.Extra,Data.Foldable.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Data.Foldable.Extra,Data.IORef.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Data.IORef.Extra,Data.List.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Data.List.Extra,Data.List.NonEmpty.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Data.List.NonEmpty.Extra,Data.Monoid.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Data.Monoid.Extra,Data.Tuple.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Data.Tuple.Extra,Data.Typeable.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Data.Typeable.Extra,Data.Version.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Data.Version.Extra,Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Extra,Numeric.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Numeric.Extra,System.Directory.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:System.Directory.Extra,System.Environment.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:System.Environment.Extra,System.IO.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:System.IO.Extra,System.Info.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:System.Info.Extra,System.Process.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:System.Process.Extra,System.Time.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:System.Time.Extra,Text.Read.Extra=extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX:Text.Read.Extra
  14805. 257.11 s [extra] unit extra-1.8.1-FcxSS1akaIPKLupWFutujD-extra-test
  14806. 257.11 s [extra] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  14807. 257.11 s [extra] include base-4.21.0.0-b334
  14808. 257.11 s [extra] include directory-1.3.9.0-d362
  14809. 257.11 s [extra] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  14810. 257.11 s [extra] include filepath-1.5.4.0-7227
  14811. 257.11 s [extra] include quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  14812. 257.11 s [extra] include unix-2.8.6.0-935f
  14813. 257.11 s [extra] Ready component graph:
  14814. 257.11 s [extra] definite extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  14815. 257.11 s [extra] depends base-4.21.0.0-b334
  14816. 257.11 s [extra] depends clock-0.8.4-ID3ZHKSe7qB9bOrwwoeq20
  14817. 257.11 s [extra] depends directory-1.3.9.0-d362
  14818. 257.11 s [extra] depends filepath-1.5.4.0-7227
  14819. 257.11 s [extra] depends process-1.6.25.0-bd82
  14820. 257.11 s [extra] depends time-1.14-3dc5
  14821. 257.11 s [extra] depends unix-2.8.6.0-935f
  14822. 257.11 s [extra] definite extra-1.8.1-FcxSS1akaIPKLupWFutujD-extra-test
  14823. 257.11 s [extra] depends QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  14824. 257.11 s [extra] depends base-4.21.0.0-b334
  14825. 257.11 s [extra] depends directory-1.3.9.0-d362
  14826. 257.11 s [extra] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  14827. 257.11 s [extra] depends filepath-1.5.4.0-7227
  14828. 257.11 s [extra] depends quickcheck-instances-0.3.33-2bomMBz3eEd29bGzKOGSvw
  14829. 257.11 s [extra] depends unix-2.8.6.0-935f
  14830. 257.11 s [extra] Using Cabal-3.14.1.0 compiled by ghc-9.12
  14831. 257.11 s [extra] Using compiler: ghc-9.12.2
  14832. 257.11 s [extra] Using install prefix: /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1
  14833. 257.11 s [extra] Executables installed in:
  14834. 257.11 s [extra] /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1/bin
  14835. 257.11 s [extra] Libraries installed in:
  14836. 257.11 s [extra] /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  14837. 257.11 s [extra] Dynamic Libraries installed in:
  14838. 257.11 s [extra] /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3
  14839. 257.11 s [extra] Private executables installed in:
  14840. 257.11 s [extra] /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1/libexec/x86_64-linux-ghc-9.12.2-82d3/extra-1.8.1
  14841. 257.11 s [extra] Data files installed in:
  14842. 257.11 s [extra] /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1/share/x86_64-linux-ghc-9.12.2-82d3/extra-1.8.1
  14843. 257.11 s [extra] Documentation installed in:
  14844. 257.11 s [extra] /nix/store/m5mmb1c6pvbi67xmynqgcdzf30cb71fn-extra-1.8.1-doc/share/doc/extra-1.8.1
  14845. 257.11 s [extra] Configuration files installed in:
  14846. 257.11 s [extra] /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1/etc
  14847. 257.11 s [extra] No alex found
  14848. 257.11 s [extra] Using ar found on system at:
  14849. 257.11 s [extra] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  14850. 257.11 s [extra] No c2hs found
  14851. 257.11 s [extra] No cpphs found
  14852. 257.11 s [extra] No doctest found
  14853. 257.11 s [extra] Using gcc version 14.3.0 given by user at:
  14854. 257.11 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  14855. 257.11 s [extra] Using ghc version 9.12.2 found on system at:
  14856. 257.11 s [extra] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc
  14857. 257.11 s [extra] Using ghc-pkg version 9.12.2 found on system at:
  14858. 257.11 s [extra] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc-pkg-9.12.2
  14859. 257.11 s [extra] No ghcjs found
  14860. 257.11 s [extra] No ghcjs-pkg found
  14861. 257.11 s [extra] No greencard found
  14862. 257.11 s [extra] Using haddock version 2.30.0 found on system at:
  14863. 257.11 s [extra] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/haddock-ghc-9.12.2
  14864. 257.11 s [extra] No happy found
  14865. 257.11 s [extra] No haskell-suite found
  14866. 257.11 s [extra] No haskell-suite-pkg found
  14867. 257.11 s [extra] No hmake found
  14868. 257.11 s [extra] Using hpc version 0.69 found on system at:
  14869. 257.11 s [extra] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hpc-ghc-9.12.2
  14870. 257.11 s [extra] Using hsc2hs version 0.68.10 found on system at:
  14871. 257.11 s [extra] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  14872. 257.11 s [extra] Using hscolour version 1.25 found on system at:
  14873. 257.11 s [extra] /nix/store/02s9rad0jn6nj8z96k357im73hkzqsnw-hscolour-1.25/bin/HsColour
  14874. 257.11 s [extra] No jhc found
  14875. 257.11 s [extra] Using ld found on system at:
  14876. 257.11 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  14877. 257.11 s [extra] No pkg-config found
  14878. 257.11 s [extra] Using runghc version 9.12.2 found on system at:
  14879. 257.11 s [extra] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/runghc-9.12.2
  14880. 257.11 s [extra] Using strip version 2.44 found on system at:
  14881. 257.11 s [extra] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  14882. 257.11 s [extra] Using tar found on system at:
  14883. 257.11 s [extra] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  14884. 257.11 s [extra] No uhc found
  14885. 257.29 s [extra] Phase: buildPhase
  14886. 257.33 s [extra] Preprocessing library for extra-1.8.1...
  14887. 257.34 s [extra] Building library for extra-1.8.1...
  14888. 257.55 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 )
  14889. 257.64 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 )
  14890. 257.64 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 )
  14891. 257.65 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 )
  14892. 257.65 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.o, dist/build/Numeric/Extra.dyn_o )
  14893. 257.65 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.o, dist/build/Partial.dyn_o )
  14894. 257.65 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 )
  14895. 258.36 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 )
  14896. 258.40 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 )
  14897. 258.46 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 )
  14898. 258.46 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 )
  14899. 258.46 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 )
  14900. 258.62 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 )
  14901. 258.68 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 )
  14902. 258.82 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 )
  14903. 258.82 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 )
  14904. 258.82 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 )
  14905. 258.96 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 )
  14906. 258.96 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 )
  14907. 259.00 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 )
  14908. 259.00 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.o, dist/build/Extra.dyn_o )
  14909. 259.05 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 )
  14910. 259.39 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, dist/build/Data/IORef/Extra.p_o )
  14911. 259.57 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, dist/build/Data/Monoid/Extra.p_o )
  14912. 259.57 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, dist/build/Data/Tuple/Extra.p_o )
  14913. 259.60 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, dist/build/Data/Typeable/Extra.p_o )
  14914. 259.60 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, dist/build/Numeric/Extra.p_o )
  14915. 259.60 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, dist/build/Partial.p_o )
  14916. 259.60 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, dist/build/Data/List/Extra.p_o )
  14917. 260.44 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, dist/build/Data/Version/Extra.p_o )
  14918. 260.57 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, dist/build/Data/List/NonEmpty/Extra.p_o )
  14919. 260.64 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, dist/build/Data/Either/Extra.p_o )
  14920. 260.64 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, dist/build/Control/Exception/Extra.p_o )
  14921. 260.64 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, dist/build/Control/Monad/Extra.p_o )
  14922. 260.89 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, dist/build/Data/Foldable/Extra.p_o )
  14923. 261.03 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, dist/build/Control/Concurrent/Extra.p_o )
  14924. 261.14 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, dist/build/System/Directory/Extra.p_o )
  14925. 261.14 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, dist/build/System/Environment/Extra.p_o )
  14926. 261.14 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, dist/build/System/IO/Extra.p_o )
  14927. 261.36 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, dist/build/System/Info/Extra.p_o )
  14928. 261.36 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, dist/build/System/Process/Extra.p_o )
  14929. 261.49 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, dist/build/System/Time/Extra.p_o )
  14930. 261.49 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, dist/build/Extra.p_o )
  14931. 261.61 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, dist/build/Text/Read/Extra.p_o )
  14932. 262.52 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1...
  14933. 262.52 s [extra] Building test suite 'extra-test' for extra-1.8.1...
  14934. 262.58 s [extra] [1 of 4] Compiling TestUtil ( test/TestUtil.hs, dist/build/extra-test/extra-test-tmp/TestUtil.o )
  14935. 262.86 s [extra] [2 of 4] Compiling TestGen ( test/TestGen.hs, dist/build/extra-test/extra-test-tmp/TestGen.o )
  14936. 266.09 s [extra] [3 of 4] Compiling TestCustom ( test/TestCustom.hs, dist/build/extra-test/extra-test-tmp/TestCustom.o )
  14937. 266.13 s [extra] [4 of 4] Compiling Test ( test/Test.hs, dist/build/extra-test/extra-test-tmp/Test.o )
  14938. 266.36 s [extra] [5 of 5] Linking dist/build/extra-test/extra-test
  14939. 267.05 s [extra] Phase: checkPhase
  14940. 267.28 s [extra] Running 1 test suites...
  14941. 267.28 s [extra] Test suite extra-test: RUNNING...
  14942. 267.29 s [extra] withTempFile
  14943. 267.29 s [extra] +++ OK, passed 100 tests.
  14944. 267.29 s [extra] captureOutput
  14945. 267.29 s [extra] +++ OK, passed 100 tests.
  14946. 267.29 s [extra] \(x :: IO Int) -> void (once x) == pure ()
  14947. 267.31 s [extra] +++ OK, passed 100 tests.
  14948. 267.31 s [extra] \(x :: IO Int) -> join (once x) == x
  14949. 267.33 s [extra] +++ OK, passed 100 tests.
  14950. 267.33 s [extra] \(x :: IO Int) -> (do y <- once x; y; y) == x
  14951. 267.36 s [extra] +++ OK, passed 100 tests.
  14952. 267.36 s [extra] \(x :: IO Int) -> (do y <- once x; y ||| y) == x
  14953. 267.39 s [extra] +++ OK, passed 100 tests.
  14954. 267.39 s [extra] \(x :: IO Int) -> join (onceFork x) == x
  14955. 267.42 s [extra] +++ OK, passed 100 tests.
  14956. 267.42 s [extra] \(x :: IO Int) -> (do a <- onceFork x; a; a) == x
  14957. 267.44 s [extra] +++ OK, passed 100 tests.
  14958. 267.44 s [extra] stringException "test" == pure "test"
  14959. 267.44 s [extra] +++ OK, passed 100 tests.
  14960. 267.44 s [extra] stringException ("test" ++ undefined) == pure "test<Exception>"
  14961. 267.44 s [extra] +++ OK, passed 100 tests.
  14962. 267.44 s [extra] stringException ("test" ++ undefined ++ "hello") == pure "test<Exception>"
  14963. 267.44 s [extra] +++ OK, passed 100 tests.
  14964. 267.44 s [extra] stringException ['t','e','s','t',undefined] == pure "test<Exception>"
  14965. 267.44 s [extra] +++ OK, passed 100 tests.
  14966. 267.44 s [extra] ignore (print 1) == print 1
  14967. 267.45 s [extra] +++ OK, passed 100 tests.
  14968. 267.45 s [extra] ignore (fail "die") == pure ()
  14969. 267.45 s [extra] +++ OK, passed 100 tests.
  14970. 267.45 s [extra] catch (errorIO "Hello") (\(ErrorCall x) -> pure x) == pure "Hello"
  14971. 267.45 s [extra] +++ OK, passed 100 tests.
  14972. 267.45 s [extra] seq (errorIO "foo") (print 1) == print 1
  14973. 267.45 s [extra] +++ OK, passed 100 tests.
  14974. 267.45 s [extra] catch (assertIO True >> pure 1) (\(x :: AssertionFailed) -> pure 2) == pure 1
  14975. 267.45 s [extra] +++ OK, passed 100 tests.
  14976. 267.45 s [extra] seq (assertIO False) (print 1) == print 1
  14977. 267.45 s [extra] +++ OK, passed 100 tests.
  14978. 267.45 s [extra] retry 1 (print "x") == print "x"
  14979. 267.45 s [extra] +++ OK, passed 100 tests.
  14980. 267.45 s [extra] retry 3 (fail "die") == fail "die"
  14981. 267.45 s [extra] +++ OK, passed 100 tests.
  14982. 267.45 s [extra] whenJust Nothing print == pure ()
  14983. 267.45 s [extra] +++ OK, passed 100 tests.
  14984. 267.45 s [extra] whenJust (Just 1) print == print 1
  14985. 267.45 s [extra] +++ OK, passed 100 tests.
  14986. 267.45 s [extra] pureIf @Maybe True 5 == Just 5
  14987. 267.45 s [extra] +++ OK, passed 100 tests.
  14988. 267.45 s [extra] pureIf @Maybe False 5 == Nothing
  14989. 267.45 s [extra] +++ OK, passed 100 tests.
  14990. 267.45 s [extra] pureIf @[] True 5 == [5]
  14991. 267.45 s [extra] +++ OK, passed 100 tests.
  14992. 267.45 s [extra] pureIf @[] False 5 == []
  14993. 267.45 s [extra] +++ OK, passed 100 tests.
  14994. 267.45 s [extra] whenMaybe True (print 1) == fmap Just (print 1)
  14995. 267.45 s [extra] +++ OK, passed 100 tests.
  14996. 267.45 s [extra] whenMaybe False (print 1) == pure Nothing
  14997. 267.45 s [extra] +++ OK, passed 100 tests.
  14998. 267.45 s [extra] \(x :: Maybe ()) -> unit x == x
  14999. 267.45 s [extra] +++ OK, passed 100 tests.
  15000. 267.45 s [extra] guarded even 2 == [2]
  15001. 267.45 s [extra] +++ OK, passed 100 tests.
  15002. 267.45 s [extra] guarded odd 2 == Nothing
  15003. 267.45 s [extra] +++ OK, passed 100 tests.
  15004. 267.45 s [extra] guarded (not.null) "My Name" == Just "My Name"
  15005. 267.45 s [extra] +++ OK, passed 100 tests.
  15006. 267.45 s [extra] guardedA (return . even) 42 == Just [42]
  15007. 267.45 s [extra] +++ OK, passed 100 tests.
  15008. 267.45 s [extra] guardedA (return . odd) 42 == Just []
  15009. 267.45 s [extra] +++ OK, passed 100 tests.
  15010. 267.45 s [extra] guardedA (const Nothing) 42 == (Nothing :: Maybe [Int])
  15011. 267.45 s [extra] +++ OK, passed 100 tests.
  15012. 267.45 s [extra] fold1M (\x y -> Just x) [] == undefined
  15013. 267.45 s [extra] +++ OK, passed 100 tests.
  15014. 267.45 s [extra] fold1M (\x y -> Just $ x + y) [1, 2, 3] == Just 6
  15015. 267.45 s [extra] +++ OK, passed 100 tests.
  15016. 267.45 s [extra] partitionM (Just . even) [1,2,3] == Just ([2], [1,3])
  15017. 267.45 s [extra] +++ OK, passed 100 tests.
  15018. 267.45 s [extra] partitionM (const Nothing) [1,2,3] == Nothing
  15019. 267.45 s [extra] +++ OK, passed 100 tests.
  15020. 267.45 s [extra] loop (\x -> if x < 10 then Left $ x * 2 else Right $ show x) 1 == "16"
  15021. 267.45 s [extra] +++ OK, passed 100 tests.
  15022. 267.45 s [extra] Just True ||^ undefined == Just True
  15023. 267.45 s [extra] +++ OK, passed 100 tests.
  15024. 267.45 s [extra] Just False ||^ Just True == Just True
  15025. 267.45 s [extra] +++ OK, passed 100 tests.
  15026. 267.45 s [extra] Just False ||^ Just False == Just False
  15027. 267.45 s [extra] +++ OK, passed 100 tests.
  15028. 267.45 s [extra] Just False &&^ undefined == Just False
  15029. 267.45 s [extra] +++ OK, passed 100 tests.
  15030. 267.45 s [extra] Just True &&^ Just True == Just True
  15031. 267.45 s [extra] +++ OK, passed 100 tests.
  15032. 267.45 s [extra] Just True &&^ Just False == Just False
  15033. 267.45 s [extra] +++ OK, passed 100 tests.
  15034. 267.45 s [extra] anyM Just [False,True ,undefined] == Just True
  15035. 267.45 s [extra] +++ OK, passed 100 tests.
  15036. 267.46 s [extra] anyM Just [False,False,undefined] == undefined
  15037. 267.46 s [extra] +++ OK, passed 100 tests.
  15038. 267.46 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  15039. 267.46 s [extra] +++ OK, passed 100 tests.
  15040. 267.46 s [extra] allM Just [True,False,undefined] == Just False
  15041. 267.46 s [extra] +++ OK, passed 100 tests.
  15042. 267.46 s [extra] allM Just [True,True ,undefined] == undefined
  15043. 267.46 s [extra] +++ OK, passed 100 tests.
  15044. 267.46 s [extra] \(f :: Int -> Maybe Bool) xs -> anyM f xs == orM (map f xs)
  15045. 267.46 s [extra] +++ OK, passed 100 tests.
  15046. 267.46 s [extra] orM [Just False,Just True ,undefined] == Just True
  15047. 267.46 s [extra] +++ OK, passed 100 tests.
  15048. 267.46 s [extra] orM [Just False,Just False,undefined] == undefined
  15049. 267.46 s [extra] +++ OK, passed 100 tests.
  15050. 267.46 s [extra] \xs -> Just (or xs) == orM (map Just xs)
  15051. 267.46 s [extra] +++ OK, passed 100 tests.
  15052. 267.46 s [extra] andM [Just True,Just False,undefined] == Just False
  15053. 267.46 s [extra] +++ OK, passed 100 tests.
  15054. 267.46 s [extra] andM [Just True,Just True ,undefined] == undefined
  15055. 267.46 s [extra] +++ OK, passed 100 tests.
  15056. 267.46 s [extra] \xs -> Just (and xs) == andM (map Just xs)
  15057. 267.46 s [extra] +++ OK, passed 100 tests.
  15058. 267.46 s [extra] findM (Just . isUpper) "teST" == Just (Just 'S')
  15059. 267.46 s [extra] +++ OK, passed 100 tests.
  15060. 267.46 s [extra] findM (Just . isUpper) "test" == Just Nothing
  15061. 267.46 s [extra] +++ OK, passed 100 tests.
  15062. 267.46 s [extra] findM (Just . const True) ["x",undefined] == Just (Just "x")
  15063. 267.46 s [extra] +++ OK, passed 100 tests.
  15064. 267.46 s [extra] fromLeft 1 (Left 3) == 3
  15065. 267.46 s [extra] +++ OK, passed 100 tests.
  15066. 267.46 s [extra] fromLeft 1 (Right "foo") == 1
  15067. 267.46 s [extra] +++ OK, passed 100 tests.
  15068. 267.46 s [extra] fromRight 1 (Right 3) == 3
  15069. 267.46 s [extra] +++ OK, passed 100 tests.
  15070. 267.46 s [extra] fromRight 1 (Left "foo") == 1
  15071. 267.46 s [extra] +++ OK, passed 100 tests.
  15072. 267.46 s [extra] \x -> fromLeft' (Left x) == x
  15073. 267.46 s [extra] +++ OK, passed 100 tests.
  15074. 267.46 s [extra] \x -> fromLeft' (Right x) == undefined
  15075. 267.46 s [extra] +++ OK, passed 100 tests.
  15076. 267.46 s [extra] \x -> fromRight' (Right x) == x
  15077. 267.46 s [extra] +++ OK, passed 100 tests.
  15078. 267.46 s [extra] \x -> fromRight' (Left x) == undefined
  15079. 267.46 s [extra] +++ OK, passed 100 tests.
  15080. 267.46 s [extra] \x -> fromEither (Left x ) == x
  15081. 267.46 s [extra] +++ OK, passed 100 tests.
  15082. 267.47 s [extra] \x -> fromEither (Right x) == x
  15083. 267.47 s [extra] +++ OK, passed 100 tests.
  15084. 267.47 s [extra] \a b -> maybeToEither a (Just b) == Right b
  15085. 267.47 s [extra] +++ OK, passed 100 tests.
  15086. 267.47 s [extra] \a -> maybeToEither a Nothing == Left a
  15087. 267.47 s [extra] +++ OK, passed 100 tests.
  15088. 267.47 s [extra] \x -> eitherToMaybe (Left x) == Nothing
  15089. 267.47 s [extra] +++ OK, passed 100 tests.
  15090. 267.47 s [extra] \x -> eitherToMaybe (Right x) == Just x
  15091. 267.47 s [extra] +++ OK, passed 100 tests.
  15092. 267.47 s [extra] mapLeft show (Left 1) == Left "1"
  15093. 267.47 s [extra] +++ OK, passed 100 tests.
  15094. 267.47 s [extra] mapLeft show (Right True) == Right True
  15095. 267.47 s [extra] +++ OK, passed 100 tests.
  15096. 267.47 s [extra] mapRight show (Left 1) == Left 1
  15097. 267.47 s [extra] +++ OK, passed 100 tests.
  15098. 267.47 s [extra] mapRight show (Right True) == Right "True"
  15099. 267.47 s [extra] +++ OK, passed 100 tests.
  15100. 267.47 s [extra] \xs -> repeatedly (splitAt 3) xs == chunksOf 3 xs
  15101. 267.47 s [extra] +++ OK, passed 100 tests.
  15102. 267.47 s [extra] \xs -> repeatedly word1 (trim xs) == words xs
  15103. 267.47 s [extra] +++ OK, passed 100 tests.
  15104. 267.47 s [extra] \xs -> repeatedly line1 xs == lines xs
  15105. 267.47 s [extra] +++ OK, passed 100 tests.
  15106. 267.47 s [extra] disjoint [1,2,3] [4,5] == True
  15107. 267.47 s [extra] +++ OK, passed 100 tests.
  15108. 267.47 s [extra] disjoint [1,2,3] [4,1] == False
  15109. 267.47 s [extra] +++ OK, passed 100 tests.
  15110. 267.47 s [extra] disjointOrd [1,2,3] [4,5] == True
  15111. 267.47 s [extra] +++ OK, passed 100 tests.
  15112. 267.47 s [extra] disjointOrd [1,2,3] [4,1] == False
  15113. 267.47 s [extra] +++ OK, passed 100 tests.
  15114. 267.47 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,5] == True
  15115. 267.47 s [extra] +++ OK, passed 100 tests.
  15116. 267.47 s [extra] disjointOrdBy (compare `on` (`mod` 7)) [1,2,3] [4,8] == False
  15117. 267.47 s [extra] +++ OK, passed 100 tests.
  15118. 267.47 s [extra] anySame [1,1,2] == True
  15119. 267.47 s [extra] +++ OK, passed 100 tests.
  15120. 267.47 s [extra] anySame [1,2,3] == False
  15121. 267.47 s [extra] +++ OK, passed 100 tests.
  15122. 267.47 s [extra] anySame (1:2:1:undefined) == True
  15123. 267.47 s [extra] +++ OK, passed 100 tests.
  15124. 267.47 s [extra] anySame [] == False
  15125. 267.47 s [extra] +++ OK, passed 100 tests.
  15126. 267.47 s [extra] \xs -> anySame xs == (length (nub xs) < length xs)
  15127. 267.47 s [extra] +++ OK, passed 100 tests.
  15128. 267.47 s [extra] allSame [1,1,2] == False
  15129. 267.47 s [extra] +++ OK, passed 100 tests.
  15130. 267.47 s [extra] allSame [1,1,1] == True
  15131. 267.47 s [extra] +++ OK, passed 100 tests.
  15132. 267.47 s [extra] allSame [1] == True
  15133. 267.47 s [extra] +++ OK, passed 100 tests.
  15134. 267.47 s [extra] allSame [] == True
  15135. 267.47 s [extra] +++ OK, passed 100 tests.
  15136. 267.47 s [extra] allSame (1:1:2:undefined) == False
  15137. 267.47 s [extra] +++ OK, passed 100 tests.
  15138. 267.47 s [extra] \xs -> allSame xs == (length (nub xs) <= 1)
  15139. 267.47 s [extra] +++ OK, passed 100 tests.
  15140. 267.47 s [extra] headDef 1 [] == 1
  15141. 267.47 s [extra] +++ OK, passed 100 tests.
  15142. 267.47 s [extra] headDef 1 [2,3,4] == 2
  15143. 267.47 s [extra] +++ OK, passed 100 tests.
  15144. 267.47 s [extra] \x xs -> headDef x xs == fromMaybe x (listToMaybe xs)
  15145. 267.47 s [extra] +++ OK, passed 100 tests.
  15146. 267.47 s [extra] lastDef 1 [] == 1
  15147. 267.47 s [extra] +++ OK, passed 100 tests.
  15148. 267.47 s [extra] lastDef 1 [2,3,4] == 4
  15149. 267.47 s [extra] +++ OK, passed 100 tests.
  15150. 267.47 s [extra] \x xs -> lastDef x xs == last (x:xs)
  15151. 267.47 s [extra] +++ OK, passed 100 tests.
  15152. 267.47 s [extra] [2,3,4] !? 1 == Just 3
  15153. 267.47 s [extra] +++ OK, passed 100 tests.
  15154. 267.47 s [extra] [2,3,4] !? (-1) == Nothing
  15155. 267.47 s [extra] +++ OK, passed 100 tests.
  15156. 267.47 s [extra] [] !? 0 == Nothing
  15157. 267.47 s [extra] +++ OK, passed 100 tests.
  15158. 267.47 s [extra] notNull [] == False
  15159. 267.47 s [extra] +++ OK, passed 100 tests.
  15160. 267.47 s [extra] notNull [1] == True
  15161. 267.47 s [extra] +++ OK, passed 100 tests.
  15162. 267.47 s [extra] \xs -> notNull xs == not (null xs)
  15163. 267.47 s [extra] +++ OK, passed 100 tests.
  15164. 267.47 s [extra] list 1 (\v _ -> v - 2) [5,6,7] == 3
  15165. 267.47 s [extra] +++ OK, passed 100 tests.
  15166. 267.47 s [extra] list 1 (\v _ -> v - 2) [] == 1
  15167. 267.47 s [extra] +++ OK, passed 100 tests.
  15168. 267.47 s [extra] \nil cons xs -> maybe nil (uncurry cons) (uncons xs) == list nil cons xs
  15169. 267.48 s [extra] +++ OK, passed 100 tests.
  15170. 267.48 s [extra] unsnoc "test" == Just ("tes",'t')
  15171. 267.48 s [extra] +++ OK, passed 100 tests.
  15172. 267.48 s [extra] unsnoc "" == Nothing
  15173. 267.48 s [extra] +++ OK, passed 100 tests.
  15174. 267.48 s [extra] \xs -> unsnoc xs == if null xs then Nothing else Just (init xs, last xs)
  15175. 267.48 s [extra] +++ OK, passed 100 tests.
  15176. 267.48 s [extra] cons 't' "est" == "test"
  15177. 267.48 s [extra] +++ OK, passed 100 tests.
  15178. 267.48 s [extra] \x xs -> uncons (cons x xs) == Just (x,xs)
  15179. 267.48 s [extra] +++ OK, passed 100 tests.
  15180. 267.48 s [extra] snoc "tes" 't' == "test"
  15181. 267.48 s [extra] +++ OK, passed 100 tests.
  15182. 267.48 s [extra] \xs x -> unsnoc (snoc xs x) == Just (xs,x)
  15183. 267.48 s [extra] +++ OK, passed 100 tests.
  15184. 267.48 s [extra] enumerate == [False, True]
  15185. 267.48 s [extra] +++ OK, passed 100 tests.
  15186. 267.48 s [extra] takeEnd 3 "hello" == "llo"
  15187. 267.48 s [extra] +++ OK, passed 100 tests.
  15188. 267.48 s [extra] takeEnd 5 "bye" == "bye"
  15189. 267.48 s [extra] +++ OK, passed 100 tests.
  15190. 267.48 s [extra] takeEnd (-1) "bye" == ""
  15191. 267.48 s [extra] +++ OK, passed 100 tests.
  15192. 267.48 s [extra] \i xs -> takeEnd i xs `isSuffixOf` xs
  15193. 267.48 s [extra] +++ OK, passed 100 tests.
  15194. 267.48 s [extra] \i xs -> length (takeEnd i xs) == min (max 0 i) (length xs)
  15195. 267.48 s [extra] +++ OK, passed 100 tests.
  15196. 267.48 s [extra] dropEnd 3 "hello" == "he"
  15197. 267.48 s [extra] +++ OK, passed 100 tests.
  15198. 267.48 s [extra] dropEnd 5 "bye" == ""
  15199. 267.48 s [extra] +++ OK, passed 100 tests.
  15200. 267.48 s [extra] dropEnd (-1) "bye" == "bye"
  15201. 267.48 s [extra] +++ OK, passed 100 tests.
  15202. 267.48 s [extra] \i xs -> dropEnd i xs `isPrefixOf` xs
  15203. 267.48 s [extra] +++ OK, passed 100 tests.
  15204. 267.48 s [extra] \i xs -> length (dropEnd i xs) == max 0 (length xs - max 0 i)
  15205. 267.48 s [extra] +++ OK, passed 100 tests.
  15206. 267.48 s [extra] \i -> take 3 (dropEnd 5 [i..]) == take 3 [i..]
  15207. 267.48 s [extra] +++ OK, passed 100 tests.
  15208. 267.48 s [extra] splitAtEnd 3 "hello" == ("he","llo")
  15209. 267.48 s [extra] +++ OK, passed 100 tests.
  15210. 267.48 s [extra] splitAtEnd 3 "he" == ("", "he")
  15211. 267.48 s [extra] +++ OK, passed 100 tests.
  15212. 267.48 s [extra] \i xs -> uncurry (++) (splitAt i xs) == xs
  15213. 267.48 s [extra] +++ OK, passed 100 tests.
  15214. 267.48 s [extra] \i xs -> splitAtEnd i xs == (dropEnd i xs, takeEnd i xs)
  15215. 267.48 s [extra] +++ OK, passed 100 tests.
  15216. 267.48 s [extra] \i xs -> zip [i..] xs == zipFrom i xs
  15217. 267.48 s [extra] +++ OK, passed 100 tests.
  15218. 267.48 s [extra] zipFrom False [1..3] == [(False,1),(True, 2)]
  15219. 267.48 s [extra] +++ OK, passed 100 tests.
  15220. 267.48 s [extra] \i xs -> zipWithFrom (,) i xs == zipFrom i xs
  15221. 267.48 s [extra] +++ OK, passed 100 tests.
  15222. 267.48 s [extra] concatUnzip [("a","AB"),("bc","C")] == ("abc","ABC")
  15223. 267.48 s [extra] +++ OK, passed 100 tests.
  15224. 267.48 s [extra] concatUnzip3 [("a","AB",""),("bc","C","123")] == ("abc","ABC","123")
  15225. 267.48 s [extra] +++ OK, passed 100 tests.
  15226. 267.48 s [extra] takeWhileEnd even [2,3,4,6] == [4,6]
  15227. 267.48 s [extra] +++ OK, passed 100 tests.
  15228. 267.48 s [extra] trim " hello " == "hello"
  15229. 267.48 s [extra] +++ OK, passed 100 tests.
  15230. 267.48 s [extra] trimStart " hello " == "hello "
  15231. 267.48 s [extra] +++ OK, passed 100 tests.
  15232. 267.48 s [extra] trimEnd " hello " == " hello"
  15233. 267.48 s [extra] +++ OK, passed 100 tests.
  15234. 267.48 s [extra] \s -> trim s == trimEnd (trimStart s)
  15235. 267.48 s [extra] +++ OK, passed 100 tests.
  15236. 267.48 s [extra] lower "This is A TEST" == "this is a test"
  15237. 267.48 s [extra] +++ OK, passed 100 tests.
  15238. 267.48 s [extra] lower "" == ""
  15239. 267.48 s [extra] +++ OK, passed 100 tests.
  15240. 267.48 s [extra] upper "This is A TEST" == "THIS IS A TEST"
  15241. 267.48 s [extra] +++ OK, passed 100 tests.
  15242. 267.48 s [extra] upper "" == ""
  15243. 267.48 s [extra] +++ OK, passed 100 tests.
  15244. 267.48 s [extra] word1 "" == ("", "")
  15245. 267.48 s [extra] +++ OK, passed 100 tests.
  15246. 267.48 s [extra] word1 "keyword rest of string" == ("keyword","rest of string")
  15247. 267.48 s [extra] +++ OK, passed 100 tests.
  15248. 267.48 s [extra] word1 " keyword\n rest of string" == ("keyword","rest of string")
  15249. 267.49 s [extra] +++ OK, passed 100 tests.
  15250. 267.49 s [extra] \s -> fst (word1 s) == concat (take 1 $ words s)
  15251. 267.49 s [extra] +++ OK, passed 100 tests.
  15252. 267.49 s [extra] \s -> words (snd $ word1 s) == drop 1 (words s)
  15253. 267.49 s [extra] +++ OK, passed 100 tests.
  15254. 267.49 s [extra] line1 "" == ("", "")
  15255. 267.49 s [extra] +++ OK, passed 100 tests.
  15256. 267.49 s [extra] line1 "test" == ("test","")
  15257. 267.49 s [extra] +++ OK, passed 100 tests.
  15258. 267.49 s [extra] line1 "test\n" == ("test","")
  15259. 267.49 s [extra] +++ OK, passed 100 tests.
  15260. 267.49 s [extra] line1 "test\nrest" == ("test","rest")
  15261. 267.49 s [extra] +++ OK, passed 100 tests.
  15262. 267.49 s [extra] line1 "test\nrest\nmore" == ("test","rest\nmore")
  15263. 267.49 s [extra] +++ OK, passed 100 tests.
  15264. 267.49 s [extra] escapeHTML "this is a test" == "this is a test"
  15265. 267.49 s [extra] +++ OK, passed 100 tests.
  15266. 267.49 s [extra] escapeHTML "<b>\"g&t\"</n>" == "&lt;b&gt;&quot;g&amp;t&quot;&lt;/n&gt;"
  15267. 267.49 s [extra] +++ OK, passed 100 tests.
  15268. 267.49 s [extra] escapeHTML "t'was another test" == "t&#39;was another test"
  15269. 267.49 s [extra] +++ OK, passed 100 tests.
  15270. 267.49 s [extra] \xs -> unescapeHTML (escapeHTML xs) == xs
  15271. 267.49 s [extra] +++ OK, passed 100 tests.
  15272. 267.49 s [extra] escapeJSON "this is a test" == "this is a test"
  15273. 267.49 s [extra] +++ OK, passed 100 tests.
  15274. 267.49 s [extra] escapeJSON "\ttab\nnewline\\" == "\\ttab\\nnewline\\\\"
  15275. 267.49 s [extra] +++ OK, passed 100 tests.
  15276. 267.49 s [extra] escapeJSON "\ESC[0mHello" == "\\u001b[0mHello"
  15277. 267.49 s [extra] +++ OK, passed 100 tests.
  15278. 267.49 s [extra] \xs -> unescapeJSON (escapeJSON xs) == xs
  15279. 267.49 s [extra] +++ OK, passed 100 tests.
  15280. 267.49 s [extra] groupOn abs [1,-1,2] == [[1,-1], [2]]
  15281. 267.49 s [extra] +++ OK, passed 100 tests.
  15282. 267.49 s [extra] groupOnKey abs [1,-1,2] == [(1, [1,-1]), (2, [2])]
  15283. 267.49 s [extra] +++ OK, passed 100 tests.
  15284. 267.49 s [extra] maximumOn id [] == undefined
  15285. 267.49 s [extra] +++ OK, passed 100 tests.
  15286. 267.49 s [extra] maximumOn length ["test","extra","a"] == "extra"
  15287. 267.49 s [extra] +++ OK, passed 100 tests.
  15288. 267.49 s [extra] minimumOn id [] == undefined
  15289. 267.49 s [extra] +++ OK, passed 100 tests.
  15290. 267.49 s [extra] minimumOn length ["test","extra","a"] == "a"
  15291. 267.49 s [extra] +++ OK, passed 100 tests.
  15292. 267.49 s [extra] groupSort [(1,'t'),(3,'t'),(2,'e'),(2,'s')] == [(1,"t"),(2,"es"),(3,"t")]
  15293. 267.49 s [extra] +++ OK, passed 100 tests.
  15294. 267.49 s [extra] \xs -> map fst (groupSort xs) == sort (nub (map fst xs))
  15295. 267.49 s [extra] +++ OK, passed 100 tests.
  15296. 267.49 s [extra] \xs -> concatMap snd (groupSort xs) == map snd (sortOn fst xs)
  15297. 267.49 s [extra] +++ OK, passed 100 tests.
  15298. 267.50 s [extra] groupSortOn length ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  15299. 267.50 s [extra] +++ OK, passed 100 tests.
  15300. 267.50 s [extra] groupSortBy (compare `on` length) ["test","of","sized","item"] == [["of"],["test","item"],["sized"]]
  15301. 267.50 s [extra] +++ OK, passed 100 tests.
  15302. 267.50 s [extra] sum' [1, 2, 3] == 6
  15303. 267.50 s [extra] +++ OK, passed 100 tests.
  15304. 267.50 s [extra] sumOn' read ["1", "2", "3"] == 6
  15305. 267.50 s [extra] +++ OK, passed 100 tests.
  15306. 267.50 s [extra] product' [1, 2, 4] == 8
  15307. 267.50 s [extra] +++ OK, passed 100 tests.
  15308. 267.50 s [extra] productOn' read ["1", "2", "4"] == 8
  15309. 267.50 s [extra] +++ OK, passed 100 tests.
  15310. 267.50 s [extra] merge "ace" "bd" == "abcde"
  15311. 267.50 s [extra] +++ OK, passed 100 tests.
  15312. 267.50 s [extra] \xs ys -> merge (sort xs) (sort ys) == sort (xs ++ ys)
  15313. 267.50 s [extra] +++ OK, passed 100 tests.
  15314. 267.50 s [extra] replace "el" "_" "Hello Bella" == "H_lo B_la"
  15315. 267.50 s [extra] +++ OK, passed 100 tests.
  15316. 267.50 s [extra] replace "el" "e" "Hello" == "Helo"
  15317. 267.50 s [extra] +++ OK, passed 100 tests.
  15318. 267.50 s [extra] replace "" "x" "Hello" == "xHxexlxlxox"
  15319. 267.50 s [extra] +++ OK, passed 100 tests.
  15320. 267.50 s [extra] replace "" "x" "" == "x"
  15321. 267.50 s [extra] +++ OK, passed 100 tests.
  15322. 267.50 s [extra] \xs ys -> replace xs xs ys == ys
  15323. 267.50 s [extra] +++ OK, passed 100 tests.
  15324. 267.50 s [extra] breakEnd isLower "youRE" == ("you","RE")
  15325. 267.50 s [extra] +++ OK, passed 100 tests.
  15326. 267.50 s [extra] breakEnd isLower "youre" == ("youre","")
  15327. 267.50 s [extra] +++ OK, passed 100 tests.
  15328. 267.50 s [extra] breakEnd isLower "YOURE" == ("","YOURE")
  15329. 267.50 s [extra] +++ OK, passed 100 tests.
  15330. 267.50 s [extra] \f xs -> breakEnd (not . f) xs == spanEnd f xs
  15331. 267.50 s [extra] +++ OK, passed 100 tests.
  15332. 267.50 s [extra] spanEnd isUpper "youRE" == ("you","RE")
  15333. 267.50 s [extra] +++ OK, passed 100 tests.
  15334. 267.50 s [extra] spanEnd (not . isSpace) "x y z" == ("x y ","z")
  15335. 267.50 s [extra] +++ OK, passed 100 tests.
  15336. 267.50 s [extra] \f xs -> uncurry (++) (spanEnd f xs) == xs
  15337. 267.50 s [extra] +++ OK, passed 100 tests.
  15338. 267.50 s [extra] \f xs -> spanEnd f xs == swap (both reverse (span f (reverse xs)))
  15339. 267.50 s [extra] +++ OK, passed 100 tests.
  15340. 267.50 s [extra] wordsBy (== ':') "::xyz:abc::123::" == ["xyz","abc","123"]
  15341. 267.50 s [extra] +++ OK, passed 100 tests.
  15342. 267.50 s [extra] \s -> wordsBy isSpace s == words s
  15343. 267.50 s [extra] +++ OK, passed 100 tests.
  15344. 267.50 s [extra] linesBy (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123",""]
  15345. 267.50 s [extra] +++ OK, passed 100 tests.
  15346. 267.50 s [extra] \s -> linesBy (== '\n') s == lines s
  15347. 267.50 s [extra] +++ OK, passed 100 tests.
  15348. 267.50 s [extra] linesBy (== ';') "my;list;here;" == ["my","list","here"]
  15349. 267.50 s [extra] +++ OK, passed 100 tests.
  15350. 267.50 s [extra] firstJust id [Nothing,Just 3] == Just 3
  15351. 267.50 s [extra] +++ OK, passed 100 tests.
  15352. 267.50 s [extra] firstJust id [Nothing,Nothing] == Nothing
  15353. 267.50 s [extra] +++ OK, passed 100 tests.
  15354. 267.50 s [extra] drop1 "" == ""
  15355. 267.50 s [extra] +++ OK, passed 100 tests.
  15356. 267.50 s [extra] drop1 "test" == "est"
  15357. 267.50 s [extra] +++ OK, passed 100 tests.
  15358. 267.50 s [extra] \xs -> drop 1 xs == drop1 xs
  15359. 267.50 s [extra] +++ OK, passed 100 tests.
  15360. 267.50 s [extra] dropEnd1 "" == ""
  15361. 267.50 s [extra] +++ OK, passed 100 tests.
  15362. 267.50 s [extra] dropEnd1 "test" == "tes"
  15363. 267.50 s [extra] +++ OK, passed 100 tests.
  15364. 267.50 s [extra] \xs -> dropEnd 1 xs == dropEnd1 xs
  15365. 267.50 s [extra] +++ OK, passed 100 tests.
  15366. 267.50 s [extra] mconcatMap Sum [1,2,3] == Sum 6
  15367. 267.50 s [extra] +++ OK, passed 100 tests.
  15368. 267.50 s [extra] \f xs -> mconcatMap f xs == concatMap f xs
  15369. 267.52 s [extra] +++ OK, passed 100 tests.
  15370. 267.52 s [extra] breakOn "::" "a::b::c" == ("a", "::b::c")
  15371. 267.52 s [extra] +++ OK, passed 100 tests.
  15372. 267.52 s [extra] breakOn "/" "foobar" == ("foobar", "")
  15373. 267.52 s [extra] +++ OK, passed 100 tests.
  15374. 267.52 s [extra] \needle haystack -> let (prefix,match) = breakOn needle haystack in prefix ++ match == haystack
  15375. 267.52 s [extra] +++ OK, passed 100 tests.
  15376. 267.52 s [extra] breakOnEnd "::" "a::b::c" == ("a::b::", "c")
  15377. 267.52 s [extra] +++ OK, passed 100 tests.
  15378. 267.52 s [extra] splitOn "\r\n" "a\r\nb\r\nd\r\ne" == ["a","b","d","e"]
  15379. 267.52 s [extra] +++ OK, passed 100 tests.
  15380. 267.52 s [extra] splitOn "aaa" "aaaXaaaXaaaXaaa" == ["","X","X","X",""]
  15381. 267.52 s [extra] +++ OK, passed 100 tests.
  15382. 267.52 s [extra] splitOn "x" "x" == ["",""]
  15383. 267.52 s [extra] +++ OK, passed 100 tests.
  15384. 267.52 s [extra] splitOn "x" "" == [""]
  15385. 267.52 s [extra] +++ OK, passed 100 tests.
  15386. 267.52 s [extra] \s x -> s /= "" ==> intercalate s (splitOn s x) == x
  15387. 267.52 s [extra] +++ OK, passed 100 tests; 12 discarded.
  15388. 267.52 s [extra] \c x -> splitOn [c] x == split (==c) x
  15389. 267.52 s [extra] +++ OK, passed 100 tests.
  15390. 267.52 s [extra] split (== 'a') "aabbaca" == ["","","bb","c",""]
  15391. 267.52 s [extra] +++ OK, passed 100 tests.
  15392. 267.52 s [extra] split (== 'a') "" == [""]
  15393. 267.52 s [extra] +++ OK, passed 100 tests.
  15394. 267.52 s [extra] split (== ':') "::xyz:abc::123::" == ["","","xyz","abc","","123","",""]
  15395. 267.52 s [extra] +++ OK, passed 100 tests.
  15396. 267.52 s [extra] split (== ',') "my,list,here" == ["my","list","here"]
  15397. 267.52 s [extra] +++ OK, passed 100 tests.
  15398. 267.52 s [extra] dropWhileEnd isSpace "ab cde " == "ab cde"
  15399. 267.52 s [extra] +++ OK, passed 100 tests.
  15400. 267.52 s [extra] dropWhileEnd' isSpace "ab cde " == "ab cde"
  15401. 267.52 s [extra] +++ OK, passed 100 tests.
  15402. 267.52 s [extra] last (dropWhileEnd even [undefined,3]) == undefined
  15403. 267.52 s [extra] +++ OK, passed 100 tests.
  15404. 267.52 s [extra] last (dropWhileEnd' even [undefined,3]) == 3
  15405. 267.52 s [extra] +++ OK, passed 100 tests.
  15406. 267.52 s [extra] head (dropWhileEnd even (3:undefined)) == 3
  15407. 267.52 s [extra] +++ OK, passed 100 tests.
  15408. 267.52 s [extra] head (dropWhileEnd' even (3:undefined)) == undefined
  15409. 267.52 s [extra] +++ OK, passed 100 tests.
  15410. 267.52 s [extra] dropPrefix "Mr. " "Mr. Men" == "Men"
  15411. 267.52 s [extra] +++ OK, passed 100 tests.
  15412. 267.52 s [extra] dropPrefix "Mr. " "Dr. Men" == "Dr. Men"
  15413. 267.52 s [extra] +++ OK, passed 100 tests.
  15414. 267.52 s [extra] dropSuffix "!" "Hello World!" == "Hello World"
  15415. 267.52 s [extra] +++ OK, passed 100 tests.
  15416. 267.52 s [extra] dropSuffix "!" "Hello World!!" == "Hello World!"
  15417. 267.52 s [extra] +++ OK, passed 100 tests.
  15418. 267.52 s [extra] dropSuffix "!" "Hello World." == "Hello World."
  15419. 267.52 s [extra] +++ OK, passed 100 tests.
  15420. 267.52 s [extra] stripSuffix "bar" "foobar" == Just "foo"
  15421. 267.52 s [extra] +++ OK, passed 100 tests.
  15422. 267.52 s [extra] stripSuffix "" "baz" == Just "baz"
  15423. 267.52 s [extra] +++ OK, passed 100 tests.
  15424. 267.52 s [extra] stripSuffix "foo" "quux" == Nothing
  15425. 267.52 s [extra] +++ OK, passed 100 tests.
  15426. 267.52 s [extra] stripInfix "::" "a::b::c" == Just ("a", "b::c")
  15427. 267.52 s [extra] +++ OK, passed 100 tests.
  15428. 267.52 s [extra] stripInfix "/" "foobar" == Nothing
  15429. 267.52 s [extra] +++ OK, passed 100 tests.
  15430. 267.52 s [extra] stripInfixEnd "::" "a::b::c" == Just ("a::b", "c")
  15431. 267.52 s [extra] +++ OK, passed 100 tests.
  15432. 267.52 s [extra] chunksOf 3 "my test" == ["my ","tes","t"]
  15433. 267.52 s [extra] +++ OK, passed 100 tests.
  15434. 267.52 s [extra] chunksOf 3 "mytest" == ["myt","est"]
  15435. 267.52 s [extra] +++ OK, passed 100 tests.
  15436. 267.52 s [extra] chunksOf 8 "" == []
  15437. 267.52 s [extra] +++ OK, passed 100 tests.
  15438. 267.52 s [extra] chunksOf 0 "test" == undefined
  15439. 267.52 s [extra] +++ OK, passed 100 tests.
  15440. 267.52 s [extra] nubSort "this is a test" == " aehist"
  15441. 267.52 s [extra] +++ OK, passed 100 tests.
  15442. 267.52 s [extra] \xs -> nubSort xs == nub (sort xs)
  15443. 267.52 s [extra] +++ OK, passed 100 tests.
  15444. 267.52 s [extra] nubSortOn length ["a","test","of","this"] == ["a","of","test"]
  15445. 267.52 s [extra] +++ OK, passed 100 tests.
  15446. 267.52 s [extra] nubSortBy (compare `on` length) ["a","test","of","this"] == ["a","of","test"]
  15447. 267.52 s [extra] +++ OK, passed 100 tests.
  15448. 267.52 s [extra] nubOrd "this is a test" == "this ae"
  15449. 267.52 s [extra] +++ OK, passed 100 tests.
  15450. 267.52 s [extra] nubOrd (take 4 ("this" ++ undefined)) == "this"
  15451. 267.52 s [extra] +++ OK, passed 100 tests.
  15452. 267.52 s [extra] \xs -> nubOrd xs == nub xs
  15453. 267.52 s [extra] +++ OK, passed 100 tests.
  15454. 267.52 s [extra] nubOrdOn length ["a","test","of","this"] == ["a","test","of"]
  15455. 267.52 s [extra] +++ OK, passed 100 tests.
  15456. 267.52 s [extra] nubOrdBy (compare `on` length) ["a","test","of","this"] == ["a","test","of"]
  15457. 267.52 s [extra] +++ OK, passed 100 tests.
  15458. 267.52 s [extra] zipWithLongest (,) "a" "xyz" == [(Just 'a', Just 'x'), (Nothing, Just 'y'), (Nothing, Just 'z')]
  15459. 267.52 s [extra] +++ OK, passed 100 tests.
  15460. 267.52 s [extra] zipWithLongest (,) "a" "x" == [(Just 'a', Just 'x')]
  15461. 267.52 s [extra] +++ OK, passed 100 tests.
  15462. 267.52 s [extra] zipWithLongest (,) "" "x" == [(Nothing, Just 'x')]
  15463. 267.52 s [extra] +++ OK, passed 100 tests.
  15464. 267.52 s [extra] comparingLength [1,2,3] [False] == GT
  15465. 267.52 s [extra] +++ OK, passed 100 tests.
  15466. 267.52 s [extra] comparingLength [1,2] "ab" == EQ
  15467. 267.52 s [extra] +++ OK, passed 100 tests.
  15468. 267.53 s [extra] \(xs :: [Int]) (ys :: [Int]) -> comparingLength xs ys == Data.Ord.comparing length xs ys
  15469. 267.53 s [extra] +++ OK, passed 100 tests.
  15470. 267.53 s [extra] comparingLength [1,2] (1:2:3:undefined) == LT
  15471. 267.53 s [extra] +++ OK, passed 100 tests.
  15472. 267.53 s [extra] comparingLength (1:2:3:undefined) [1,2] == GT
  15473. 267.53 s [extra] +++ OK, passed 100 tests.
  15474. 267.53 s [extra] mwhen True "test" == "test"
  15475. 267.53 s [extra] +++ OK, passed 100 tests.
  15476. 267.53 s [extra] mwhen False "test" == ""
  15477. 267.53 s [extra] +++ OK, passed 100 tests.
  15478. 267.53 s [extra] first succ (1,"test") == (2,"test")
  15479. 267.53 s [extra] +++ OK, passed 100 tests.
  15480. 267.53 s [extra] second reverse (1,"test") == (1,"tset")
  15481. 267.53 s [extra] +++ OK, passed 100 tests.
  15482. 267.53 s [extra] firstM (\x -> [x-1, x+1]) (1,"test") == [(0,"test"),(2,"test")]
  15483. 267.53 s [extra] +++ OK, passed 100 tests.
  15484. 267.53 s [extra] secondM (\x -> [reverse x, x]) (1,"test") == [(1,"tset"),(1,"test")]
  15485. 267.53 s [extra] +++ OK, passed 100 tests.
  15486. 267.53 s [extra] (succ *** reverse) (1,"test") == (2,"tset")
  15487. 267.53 s [extra] +++ OK, passed 100 tests.
  15488. 267.53 s [extra] (succ &&& pred) 1 == (2,0)
  15489. 267.53 s [extra] +++ OK, passed 100 tests.
  15490. 267.53 s [extra] dupe 12 == (12, 12)
  15491. 267.53 s [extra] +++ OK, passed 100 tests.
  15492. 267.53 s [extra] both succ (1,2) == (2,3)
  15493. 267.53 s [extra] +++ OK, passed 100 tests.
  15494. 267.53 s [extra] first3 succ (1,1,1) == (2,1,1)
  15495. 267.53 s [extra] +++ OK, passed 100 tests.
  15496. 267.53 s [extra] second3 succ (1,1,1) == (1,2,1)
  15497. 267.53 s [extra] +++ OK, passed 100 tests.
  15498. 267.53 s [extra] third3 succ (1,1,1) == (1,1,2)
  15499. 267.53 s [extra] +++ OK, passed 100 tests.
  15500. 267.53 s [extra] \x -> readVersion (showVersion x) == x
  15501. 267.53 s [extra] +++ OK, passed 100 tests.
  15502. 267.53 s [extra] readVersion "hello" == undefined
  15503. 267.53 s [extra] +++ OK, passed 100 tests.
  15504. 267.53 s [extra] showDP 4 pi == "3.1416"
  15505. 267.53 s [extra] +++ OK, passed 100 tests.
  15506. 267.53 s [extra] showDP 0 pi == "3"
  15507. 267.53 s [extra] +++ OK, passed 100 tests.
  15508. 267.53 s [extra] showDP 2 3 == "3.00"
  15509. 267.53 s [extra] +++ OK, passed 100 tests.
  15510. 267.53 s [extra] withTempDir $ \dir -> do writeFile (dir </> "foo.txt") ""; withCurrentDirectory dir $ doesFileExist "foo.txt"
  15511. 267.53 s [extra] +++ OK, passed 100 tests.
  15512. 267.53 s [extra] withTempDir $ \dir -> do writeFile (dir </> "test.txt") ""; (== [dir </> "test.txt"]) <$> listContents dir
  15513. 267.53 s [extra] +++ OK, passed 100 tests.
  15514. 267.53 s [extra] listTest listContents ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","foo","zoo"]
  15515. 267.53 s [extra] +++ OK, passed 100 tests.
  15516. 267.53 s [extra] listTest listDirectories ["bar.txt","foo/baz.txt","zoo"] ["foo"]
  15517. 267.53 s [extra] +++ OK, passed 100 tests.
  15518. 267.53 s [extra] listTest listFiles ["bar.txt","foo/baz.txt","zoo"] ["bar.txt","zoo"]
  15519. 267.53 s [extra] +++ OK, passed 100 tests.
  15520. 267.53 s [extra] listTest listFilesRecursive ["bar.txt","zoo","foo" </> "baz.txt"] ["bar.txt","zoo","foo" </> "baz.txt"]
  15521. 267.53 s [extra] +++ OK, passed 100 tests.
  15522. 267.53 s [extra] listTest (listFilesInside $ pure . not . isPrefixOf "." . takeFileName) ["bar.txt","foo" </> "baz.txt",".foo" </> "baz2.txt", "zoo"] ["bar.txt","zoo","foo" </> "baz.txt"]
  15523. 267.53 s [extra] +++ OK, passed 100 tests.
  15524. 267.53 s [extra] listTest (listFilesInside $ const $ pure False) ["bar.txt"] []
  15525. 267.53 s [extra] +++ OK, passed 100 tests.
  15526. 267.53 s [extra] isWindows == (os == "mingw32")
  15527. 267.53 s [extra] +++ OK, passed 100 tests.
  15528. 267.53 s [extra] \(filter isHexDigit -> s) -> fmap (== s) $ withTempFile $ \file -> do writeFile file s; readFile' file
  15529. 267.54 s [extra] +++ OK, passed 100 tests.
  15530. 267.55 s [extra] \s -> withTempFile $ \file -> do writeFileUTF8 file s; fmap (== s) $ readFileUTF8' file
  15531. 267.56 s [extra] +++ OK, passed 100 tests.
  15532. 267.56 s [extra] \(ASCIIString s) -> withTempFile $ \file -> do writeFileBinary file s; fmap (== s) $ readFileBinary' file
  15533. 267.57 s [extra] +++ OK, passed 100 tests.
  15534. 267.57 s [extra] captureOutput (print 1) == pure ("1\n",())
  15535. 267.57 s [extra] +++ OK, passed 100 tests.
  15536. 267.57 s [extra] withTempFile doesFileExist == pure True
  15537. 267.57 s [extra] +++ OK, passed 100 tests.
  15538. 267.57 s [extra] (doesFileExist =<< withTempFile pure) == pure False
  15539. 267.57 s [extra] +++ OK, passed 100 tests.
  15540. 267.57 s [extra] withTempFile readFile' == pure ""
  15541. 267.57 s [extra] +++ OK, passed 100 tests.
  15542. 267.57 s [extra] withTempDir doesDirectoryExist == pure True
  15543. 267.57 s [extra] +++ OK, passed 100 tests.
  15544. 267.57 s [extra] (doesDirectoryExist =<< withTempDir pure) == pure False
  15545. 267.57 s [extra] +++ OK, passed 100 tests.
  15546. 267.57 s [extra] withTempDir listFiles == pure []
  15547. 267.57 s [extra] +++ OK, passed 100 tests.
  15548. 267.57 s [extra] fileEq "does_not_exist1" "does_not_exist2" == undefined
  15549. 267.57 s [extra] +++ OK, passed 100 tests.
  15550. 267.57 s [extra] fileEq "does_not_exist" "does_not_exist" == undefined
  15551. 267.57 s [extra] +++ OK, passed 100 tests.
  15552. 267.57 s [extra] withTempFile $ \f1 -> fileEq "does_not_exist" f1 == undefined
  15553. 267.57 s [extra] +++ OK, passed 100 tests.
  15554. 267.57 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> fileEq f1 f2
  15555. 267.58 s [extra] +++ OK, passed 100 tests.
  15556. 267.58 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "a" >> fileEq f1 f2
  15557. 267.58 s [extra] +++ OK, passed 100 tests.
  15558. 267.58 s [extra] withTempFile $ \f1 -> withTempFile $ \f2 -> writeFile f1 "a" >> writeFile f2 "b" >> notM (fileEq f1 f2)
  15559. 267.58 s [extra] +++ OK, passed 100 tests.
  15560. 267.58 s [extra] fmap (round . fst) (duration $ sleep 1) == pure 1
  15561. 268.58 s [extra] +++ OK, passed 100 tests.
  15562. 268.58 s [extra] timeout (-3) (print 1) == pure Nothing
  15563. 268.58 s [extra] +++ OK, passed 100 tests.
  15564. 268.58 s [extra] timeout 0.1 (print 1) == fmap Just (print 1)
  15565. 268.58 s [extra] +++ OK, passed 100 tests.
  15566. 268.58 s [extra] do (t, _) <- duration $ timeout 0.1 $ sleep 1000; print t; pure $ t < 1
  15567. 268.68 s [extra] 0.100271118
  15568. 268.68 s [extra] +++ OK, passed 100 tests.
  15569. 268.68 s [extra] timeout 0.1 (sleep 2 >> print 1) == pure Nothing
  15570. 268.78 s [extra] +++ OK, passed 100 tests.
  15571. 268.78 s [extra] showDuration 3.435 == "3.44s"
  15572. 268.78 s [extra] +++ OK, passed 100 tests.
  15573. 268.78 s [extra] showDuration 623.8 == "10m24s"
  15574. 268.78 s [extra] +++ OK, passed 100 tests.
  15575. 268.78 s [extra] showDuration 62003.8 == "17h13m"
  15576. 268.78 s [extra] +++ OK, passed 100 tests.
  15577. 268.78 s [extra] showDuration 1e8 == "27777h47m"
  15578. 268.78 s [extra] +++ OK, passed 100 tests.
  15579. 268.78 s [extra] do f <- offsetTime; xs <- replicateM 10 f; pure $ xs == sort xs
  15580. 268.78 s [extra] +++ OK, passed 100 tests.
  15581. 268.78 s [extra] do (a,_) <- duration $ sleep 1; pure $ a >= 1 && a <= 1.5
  15582. 269.78 s [extra] +++ OK, passed 100 tests.
  15583. 269.78 s [extra] Extra export
  15584. 269.78 s [extra] +++ OK, passed 100 tests.
  15585. 269.78 s [extra] withTempFile
  15586. 269.79 s [extra] ....done
  15587. 269.79 s [extra] withTempDir
  15588. 269.80 s [extra] ....done
  15589. 269.80 s [extra] retry
  15590. 269.80 s [extra] +++ OK, passed 100 tests.
  15591. 269.80 s [extra] barrier
  15592. 269.80 s [extra] Success (325 tests)
  15593. 269.82 s [extra] Test suite extra-test: PASS
  15594. 269.82 s [extra] Test suite logged to: dist/test/extra-1.8.1-extra-test.log
  15595. 269.82 s [extra] 1 of 1 test suites (1 of 1 test cases) passed.
  15596. 269.82 s [extra] Phase: haddockPhase
  15597. 270.19 s [extra] Preprocessing library for extra-1.8.1...
  15598. 270.19 s [extra] Running Haddock on library for extra-1.8.1...
  15599. 270.47 s [extra] [ 1 of 22] Compiling Data.IORef.Extra ( src/Data/IORef/Extra.hs, nothing ) [HIE file is missing]
  15600. 270.48 s [extra] [ 2 of 22] Compiling Data.Monoid.Extra ( src/Data/Monoid/Extra.hs, nothing ) [HIE file is missing]
  15601. 270.49 s [extra] [ 3 of 22] Compiling Data.Tuple.Extra ( src/Data/Tuple/Extra.hs, nothing ) [HIE file is missing]
  15602. 270.50 s [extra] [ 4 of 22] Compiling Data.Typeable.Extra ( src/Data/Typeable/Extra.hs, nothing ) [HIE file is missing]
  15603. 270.51 s [extra] [ 5 of 22] Compiling Numeric.Extra ( src/Numeric/Extra.hs, nothing ) [HIE file is missing]
  15604. 270.52 s [extra] [ 6 of 22] Compiling Partial ( src/Partial.hs, nothing ) [HIE file is missing]
  15605. 270.52 s [extra] [ 7 of 22] Compiling Data.List.Extra ( src/Data/List/Extra.hs, nothing ) [HIE file is missing]
  15606. 270.67 s [extra] [ 8 of 22] Compiling Data.Version.Extra ( src/Data/Version/Extra.hs, nothing ) [HIE file is missing]
  15607. 270.68 s [extra] [ 9 of 22] Compiling Data.List.NonEmpty.Extra ( src/Data/List/NonEmpty/Extra.hs, nothing ) [HIE file is missing]
  15608. 270.69 s [extra] [10 of 22] Compiling Data.Either.Extra ( src/Data/Either/Extra.hs, nothing ) [HIE file is missing]
  15609. 270.70 s [extra] [11 of 22] Compiling Control.Exception.Extra ( src/Control/Exception/Extra.hs, nothing ) [HIE file is missing]
  15610. 270.76 s [extra] [12 of 22] Compiling Control.Monad.Extra ( src/Control/Monad/Extra.hs, nothing ) [HIE file is missing]
  15611. 270.80 s [extra] [13 of 22] Compiling Data.Foldable.Extra ( src/Data/Foldable/Extra.hs, nothing ) [HIE file is missing]
  15612. 270.81 s [extra] [14 of 22] Compiling Control.Concurrent.Extra ( src/Control/Concurrent/Extra.hs, nothing ) [HIE file is missing]
  15613. 270.83 s [extra] [15 of 22] Compiling System.Directory.Extra ( src/System/Directory/Extra.hs, nothing ) [HIE file is missing]
  15614. 270.85 s [extra] [16 of 22] Compiling System.Environment.Extra ( src/System/Environment/Extra.hs, nothing ) [HIE file is missing]
  15615. 270.85 s [extra] [17 of 22] Compiling System.IO.Extra ( src/System/IO/Extra.hs, nothing ) [HIE file is missing]
  15616. 270.93 s [extra] [18 of 22] Compiling System.Info.Extra ( src/System/Info/Extra.hs, nothing ) [HIE file is missing]
  15617. 270.93 s [extra] [19 of 22] Compiling System.Process.Extra ( src/System/Process/Extra.hs, nothing ) [HIE file is missing]
  15618. 270.94 s [extra] [20 of 22] Compiling System.Time.Extra ( src/System/Time/Extra.hs, nothing ) [HIE file is missing]
  15619. 270.96 s [extra] [21 of 22] Compiling Extra ( src/Extra.hs, nothing ) [HIE file is missing]
  15620. 271.01 s [extra] [22 of 22] Compiling Text.Read.Extra ( src/Text/Read/Extra.hs, nothing ) [HIE file is missing]
  15621. 271.01 s [extra] Haddock coverage:
  15622. 271.13 s [extra] 100% ( 6 / 6) in 'Data.IORef.Extra'
  15623. 271.13 s [extra] 100% ( 4 / 4) in 'Data.Monoid.Extra'
  15624. 271.13 s [extra] Warning: 'Arrow' is out of scope.
  15625. 271.28 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  15626. 271.28 s [extra] 100% ( 28 / 28) in 'Data.Tuple.Extra'
  15627. 271.28 s [extra] 100% ( 2 / 2) in 'Data.Typeable.Extra'
  15628. 271.28 s [extra] 100% ( 7 / 7) in 'Numeric.Extra'
  15629. 271.28 s [extra] Warning: 'unzip' is ambiguous. It is defined
  15630. 271.28 s [extra] * in ‘GHC.Internal.Data.Functor’
  15631. 271.28 s [extra] * in ‘GHC.Internal.List’
  15632. 271.28 s [extra] You may be able to disambiguate the identifier by qualifying it or
  15633. 271.28 s [extra] by specifying the type/value namespace explicitly.
  15634. 271.28 s [extra] Defaulting to the one defined in ‘GHC.Internal.List’
  15635. 271.28 s [extra] Warning: '(:)' is out of scope.
  15636. 271.28 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  15637. 271.28 s [extra] Warning: 'firstJustM' is out of scope.
  15638. 271.28 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  15639. 271.28 s [extra] 100% ( 85 / 85) in 'Data.List.Extra'
  15640. 271.28 s [extra] Warning: 'Version' is ambiguous. It is defined
  15641. 271.28 s [extra] * in ‘GHC.Internal.Data.Version’
  15642. 271.28 s [extra] * in ‘GHC.Internal.Data.Version’
  15643. 271.28 s [extra] You may be able to disambiguate the identifier by qualifying it or
  15644. 271.28 s [extra] by specifying the type/value namespace explicitly.
  15645. 271.28 s [extra] Defaulting to the one defined in ‘GHC.Internal.Data.Version’
  15646. 271.28 s [extra] 100% ( 3 / 3) in 'Data.Version.Extra'
  15647. 271.28 s [extra] 100% ( 23 / 23) in 'Data.List.NonEmpty.Extra'
  15648. 271.28 s [extra] Warning: 'fromJust' is out of scope.
  15649. 271.28 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  15650. 271.28 s [extra] 100% ( 11 / 11) in 'Data.Either.Extra'
  15651. 271.28 s [extra] Warning: 'AssertionFailed' is ambiguous. It is defined
  15652. 271.28 s [extra] * in ‘GHC.Internal.IO.Exception’
  15653. 271.28 s [extra] * in ‘GHC.Internal.IO.Exception’
  15654. 271.28 s [extra] You may be able to disambiguate the identifier by qualifying it or
  15655. 271.28 s [extra] by specifying the type/value namespace explicitly.
  15656. 271.28 s [extra] Defaulting to the one defined in ‘GHC.Internal.IO.Exception’
  15657. 271.28 s [extra] Warning: 'SomeException' is ambiguous. It is defined
  15658. 271.28 s [extra] * in ‘GHC.Internal.Exception.Type’
  15659. 271.28 s [extra] * in ‘GHC.Internal.Exception.Type’
  15660. 271.28 s [extra] You may be able to disambiguate the identifier by qualifying it or
  15661. 271.28 s [extra] by specifying the type/value namespace explicitly.
  15662. 271.28 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception.Type’
  15663. 271.28 s [extra] Warning: 'ErrorCall' is ambiguous. It is defined
  15664. 271.28 s [extra] * in ‘GHC.Internal.Exception’
  15665. 271.28 s [extra] * in ‘GHC.Internal.Exception’
  15666. 271.28 s [extra] You may be able to disambiguate the identifier by qualifying it or
  15667. 271.28 s [extra] by specifying the type/value namespace explicitly.
  15668. 271.28 s [extra] Defaulting to the one defined in ‘GHC.Internal.Exception’
  15669. 271.28 s [extra] 100% ( 21 / 21) in 'Control.Exception.Extra'
  15670. 271.28 s [extra] Warning: 'find' is out of scope.
  15671. 271.28 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  15672. 271.28 s [extra] Warning: 'mconcatMap' is out of scope.
  15673. 271.28 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  15674. 271.28 s [extra] Warning: 'partition' is out of scope.
  15675. 271.28 s [extra] If you qualify the identifier, haddock can try to link it anyway.
  15676. 271.28 s [extra] 100% ( 40 / 40) in 'Control.Monad.Extra'
  15677. 271.28 s [extra] 92% ( 13 / 14) in 'Data.Foldable.Extra'
  15678. 271.28 s [extra] Missing documentation for:
  15679. 271.28 s [extra] Module header
  15680. 271.28 s [extra] Warning: 'Lock' is ambiguous. It is defined
  15681. 271.28 s [extra] * at src/Control/Concurrent/Extra.hs:106:16
  15682. 271.28 s [extra] * at src/Control/Concurrent/Extra.hs:106:1
  15683. 271.28 s [extra] You may be able to disambiguate the identifier by qualifying it or
  15684. 271.28 s [extra] by specifying the type/value namespace explicitly.
  15685. 271.28 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:106:1
  15686. 271.28 s [extra] Warning: 'Var' is ambiguous. It is defined
  15687. 271.28 s [extra] * at src/Control/Concurrent/Extra.hs:146:17
  15688. 271.28 s [extra] * at src/Control/Concurrent/Extra.hs:146:1
  15689. 271.28 s [extra] You may be able to disambiguate the identifier by qualifying it or
  15690. 271.28 s [extra] by specifying the type/value namespace explicitly.
  15691. 271.28 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:146:1
  15692. 271.28 s [extra] Warning: 'Barrier' is ambiguous. It is defined
  15693. 271.28 s [extra] * at src/Control/Concurrent/Extra.hs:210:21
  15694. 271.28 s [extra] * at src/Control/Concurrent/Extra.hs:210:1
  15695. 271.28 s [extra] You may be able to disambiguate the identifier by qualifying it or
  15696. 271.28 s [extra] by specifying the type/value namespace explicitly.
  15697. 271.28 s [extra] Defaulting to the one defined at src/Control/Concurrent/Extra.hs:210:1
  15698. 271.28 s [extra] 100% ( 27 / 27) in 'Control.Concurrent.Extra'
  15699. 271.28 s [extra] 100% ( 8 / 8) in 'System.Directory.Extra'
  15700. 271.28 s [extra] 100% ( 2 / 2) in 'System.Environment.Extra'
  15701. 271.28 s [extra] 100% ( 26 / 26) in 'System.IO.Extra'
  15702. 271.28 s [extra] 100% ( 4 / 4) in 'System.Info.Extra'
  15703. 271.28 s [extra] 100% ( 5 / 5) in 'System.Process.Extra'
  15704. 271.28 s [extra] 100% ( 8 / 8) in 'System.Time.Extra'
  15705. 271.28 s [extra] 100% (270 /270) in 'Extra'
  15706. 271.28 s [extra] 100% ( 2 / 2) in 'Text.Read.Extra'
  15707. 271.31 s [extra] Warning: Data.Tuple.Extra: could not find link destinations for:
  15708. 271.31 s [extra] - GHC.Internal.Generics.Rep1_Solo
  15709. 271.31 s [extra] - GHC.Internal.Generics.Rep_Solo
  15710. 275.15 s [extra] Documentation created: dist/doc/html/extra, dist/doc/html/extra/extra.txt
  15711. 275.50 s [extra] Preprocessing test suite 'extra-test' for extra-1.8.1...
  15712. 275.55 s [extra] Phase: installPhase
  15713. 275.60 s [extra] Installing library in /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  15714. 275.92 s [extra] Phase: fixupPhase
  15715. 275.94 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1
  15716. 275.94 s [extra] shrinking /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHSextra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX-ghc9.12.2.so
  15717. 275.96 s [extra] checking for references to /build/ in /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1...
  15718. 275.99 s [extra] patching script interpreter paths in /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1
  15719. 275.99 s [extra] stripping (with command strip and flags -S -p) in /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1/lib
  15720. 276.11 s [extra] shrinking RPATHs of ELF executables and libraries in /nix/store/m5mmb1c6pvbi67xmynqgcdzf30cb71fn-extra-1.8.1-doc
  15721. 276.12 s [extra] checking for references to /build/ in /nix/store/m5mmb1c6pvbi67xmynqgcdzf30cb71fn-extra-1.8.1-doc...
  15722. 276.15 s [extra] patching script interpreter paths in /nix/store/m5mmb1c6pvbi67xmynqgcdzf30cb71fn-extra-1.8.1-doc
  15723. 276.25 s [extra:post-build] Uploading to cachix cache "sellout": /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1 /nix/store/m5mmb1c6pvbi67xmynqgcdzf30cb71fn-extra-1.8.1-doc
  15724. 276.78 s [extra:post-build] Pushing 2 paths (72 are already present) using zstd to cache sellout ⏳
  15725. 276.78 s [extra:post-build]
  15726. 277.16 s [extra:post-build] Pushing /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1 (4.50 MiB)
  15727. 277.19 s [extra:post-build] Pushing /nix/store/m5mmb1c6pvbi67xmynqgcdzf30cb71fn-extra-1.8.1-doc (3.08 MiB)
  15728. 278.39 s [extra:post-build]
  15729. 278.39 s [extra:post-build] All done.
  15730. 278.41 s [extra:post-build] Uploading to the NixCI cache: /nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1 /nix/store/m5mmb1c6pvbi67xmynqgcdzf30cb71fn-extra-1.8.1-doc
  15731. 278.44 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15732. 278.65 s [extra:post-build] copying 2 paths...
  15733. 278.65 s [extra:post-build] copying path '/nix/store/m5mmb1c6pvbi67xmynqgcdzf30cb71fn-extra-1.8.1-doc' to 'https://cache.nix-ci.com'...
  15734. 279.02 s [extra:post-build] copying path '/nix/store/5d4m1b23mmx9drqa6klrxqixywylkvzc-extra-1.8.1' to 'https://cache.nix-ci.com'...
  15735. 280.23 s [extra:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  15736. 280.50 s [extra:post-build] copying 1 paths...
  15737. 280.50 s [extra:post-build] copying path '/nix/store/klkin8nnnnj5ykgmlz1f26r6s2ffp1hd-extra-1.8.1.drv' to 'https://cache.nix-ci.com'...
  15738. 280.73 s Progress: 8 of 14 built, 43 of 43 downloaded from cache
  15739. 280.76 s Building /nix/store/wcyb838h79fi5fk0y7w8jznhlnsczw6s-algebraic-graphs-0.7.drv
  15740. 280.83 s [algebraic-graphs] Phase: setupCompilerEnvironmentPhase
  15741. 280.84 s [algebraic-graphs] Build with /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2.
  15742. 280.96 s [algebraic-graphs] Phase: unpackPhase
  15743. 280.96 s [algebraic-graphs] unpacking source archive /nix/store/gfjyfw1hcshbfclk91difmkphwib8nbd-algebraic-graphs-0.7.tar.gz
  15744. 280.97 s [algebraic-graphs] source root is algebraic-graphs-0.7
  15745. 280.97 s [algebraic-graphs] setting SOURCE_DATE_EPOCH to timestamp 1655769405 of file "algebraic-graphs-0.7/test/Data/Graph/Test/Typed.hs"
  15746. 280.98 s [algebraic-graphs] Phase: patchPhase
  15747. 280.98 s [algebraic-graphs] Replace Cabal file with edited version from mirror://hackage/algebraic-graphs-0.7/revision/3.cabal.
  15748. 280.98 s [algebraic-graphs] applying patch /nix/store/fgaciccwb2z0jmfhs30a1vq03azpd9qd-algebraic-graphs-0.7-allow-inspection-testing-0.6.patch
  15749. 280.99 s [algebraic-graphs] patching file algebraic-graphs.cabal
  15750. 280.99 s [algebraic-graphs] Phase: compileBuildDriverPhase
  15751. 280.99 s [algebraic-graphs] setupCompileFlags: -package-db=/build/tmp.iJYf2ewEpb/setup-package.conf.d -threaded
  15752. 281.03 s [algebraic-graphs] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.iJYf2ewEpb/Main.o )
  15753. 281.07 s [algebraic-graphs] [2 of 2] Linking Setup
  15754. 282.23 s [algebraic-graphs] Phase: updateAutotoolsGnuConfigScriptsPhase
  15755. 282.24 s [algebraic-graphs] Phase: configurePhase
  15756. 282.25 s [algebraic-graphs] configureFlags: --verbose --prefix=/nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/4syljhmgi93jzr8cdmlar9dpmjsd53nv-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7 --with-gcc=gcc --package-db=/build/tmp.iJYf2ewEpb/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/lib
  15757. 282.29 s [algebraic-graphs] Using Parsec parser
  15758. 282.29 s [algebraic-graphs] Configuring algebraic-graphs-0.7...
  15759. 282.29 s [algebraic-graphs] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  15760. 282.29 s [algebraic-graphs] 'ghc' version < 9.12):
  15761. 282.29 s [algebraic-graphs] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc is version
  15762. 282.29 s [algebraic-graphs] 9.12.2
  15763. 282.70 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  15764. 282.70 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.21.0.0
  15765. 282.70 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  15766. 282.70 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
  15767. 282.70 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.2
  15768. 282.70 s [algebraic-graphs] Dependency QuickCheck >=2.14 && <2.16: using QuickCheck-2.15.0.1
  15769. 282.70 s [algebraic-graphs] Dependency algebraic-graphs: using algebraic-graphs-0.7
  15770. 282.70 s [algebraic-graphs] Dependency array >=0.4 && <0.6: using array-0.5.8.0
  15771. 282.70 s [algebraic-graphs] Dependency base >=4.11 && <5: using base-4.21.0.0
  15772. 282.70 s [algebraic-graphs] Dependency containers >=0.5.5.1 && <0.8: using containers-0.7
  15773. 282.70 s [algebraic-graphs] Dependency deepseq >=1.3.0.1 && <1.6: using deepseq-1.5.1.0
  15774. 282.70 s [algebraic-graphs] Dependency extra >=1.4 && <2: using extra-1.8.1
  15775. 282.70 s [algebraic-graphs] Dependency inspection-testing >=0.4.2.2 && <0.7: using
  15776. 282.70 s [algebraic-graphs] inspection-testing-0.6.2
  15777. 282.70 s [algebraic-graphs] Dependency transformers >=0.4 && <0.7: using transformers-0.6.1.2
  15778. 282.70 s [algebraic-graphs] Source component graph:
  15779. 282.70 s [algebraic-graphs] component lib
  15780. 282.70 s [algebraic-graphs] component test:main dependency lib
  15781. 282.70 s [algebraic-graphs] Configured component graph:
  15782. 282.70 s [algebraic-graphs] component algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  15783. 282.70 s [algebraic-graphs] include array-0.5.8.0-d6d4
  15784. 282.70 s [algebraic-graphs] include base-4.21.0.0-b334
  15785. 282.70 s [algebraic-graphs] include containers-0.7-d79e
  15786. 282.70 s [algebraic-graphs] include deepseq-1.5.1.0-3c62
  15787. 282.70 s [algebraic-graphs] include transformers-0.6.1.2-2558
  15788. 282.70 s [algebraic-graphs] component algebraic-graphs-0.7-FKZbJT4N7FF2rJCgZTt0Vb-main
  15789. 282.70 s [algebraic-graphs] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  15790. 282.70 s [algebraic-graphs] include algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  15791. 282.70 s [algebraic-graphs] include array-0.5.8.0-d6d4
  15792. 282.70 s [algebraic-graphs] include base-4.21.0.0-b334
  15793. 282.70 s [algebraic-graphs] include containers-0.7-d79e
  15794. 282.70 s [algebraic-graphs] include deepseq-1.5.1.0-3c62
  15795. 282.70 s [algebraic-graphs] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  15796. 282.70 s [algebraic-graphs] include inspection-testing-0.6.2-BXrtKPpIYmk3oPkvyBHJek
  15797. 282.70 s [algebraic-graphs] include transformers-0.6.1.2-2558
  15798. 282.70 s [algebraic-graphs] Linked component graph:
  15799. 282.70 s [algebraic-graphs] unit algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  15800. 282.70 s [algebraic-graphs] include array-0.5.8.0-d6d4
  15801. 282.70 s [algebraic-graphs] include base-4.21.0.0-b334
  15802. 282.70 s [algebraic-graphs] include containers-0.7-d79e
  15803. 282.70 s [algebraic-graphs] include deepseq-1.5.1.0-3c62
  15804. 282.70 s [algebraic-graphs] include transformers-0.6.1.2-2558
  15805. 282.70 s [algebraic-graphs] Algebra.Graph=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph,Algebra.Graph.Acyclic.AdjacencyMap=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Acyclic.AdjacencyMap,Algebra.Graph.AdjacencyIntMap=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.AdjacencyIntMap,Algebra.Graph.AdjacencyIntMap.Algorithm=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.AdjacencyIntMap.Algorithm,Algebra.Graph.AdjacencyMap=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.AdjacencyMap,Algebra.Graph.AdjacencyMap.Algorithm=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.AdjacencyMap.Algorithm,Algebra.Graph.Bipartite.AdjacencyMap=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Bipartite.AdjacencyMap,Algebra.Graph.Bipartite.AdjacencyMap.Algorithm=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Bipartite.AdjacencyMap.Algorithm,Algebra.Graph.Class=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Class,Algebra.Graph.Example.Todo=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Example.Todo,Algebra.Graph.Export=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Export,Algebra.Graph.Export.Dot=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Export.Dot,Algebra.Graph.HigherKinded.Class=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.HigherKinded.Class,Algebra.Graph.Internal=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Internal,Algebra.Graph.Label=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Label,Algebra.Graph.Labelled=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Labelled,Algebra.Graph.Labelled.AdjacencyMap=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Labelled.AdjacencyMap,Algebra.Graph.Labelled.Example.Automaton=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Labelled.Example.Automaton,Algebra.Graph.Labelled.Example.Network=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Labelled.Example.Network,Algebra.Graph.NonEmpty=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.NonEmpty,Algebra.Graph.NonEmpty.AdjacencyMap=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.NonEmpty.AdjacencyMap,Algebra.Graph.Relation=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Relation,Algebra.Graph.Relation.Preorder=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Relation.Preorder,Algebra.Graph.Relation.Reflexive=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Relation.Reflexive,Algebra.Graph.Relation.Symmetric=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Relation.Symmetric,Algebra.Graph.Relation.Transitive=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Relation.Transitive,Algebra.Graph.ToGraph=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.ToGraph,Algebra.Graph.Undirected=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Algebra.Graph.Undirected,Data.Graph.Typed=algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a:Data.Graph.Typed
  15806. 282.70 s [algebraic-graphs] unit algebraic-graphs-0.7-FKZbJT4N7FF2rJCgZTt0Vb-main
  15807. 282.70 s [algebraic-graphs] include QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  15808. 282.71 s [algebraic-graphs] include algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  15809. 282.71 s [algebraic-graphs] include array-0.5.8.0-d6d4
  15810. 282.71 s [algebraic-graphs] include base-4.21.0.0-b334
  15811. 282.71 s [algebraic-graphs] include containers-0.7-d79e
  15812. 282.71 s [algebraic-graphs] include deepseq-1.5.1.0-3c62
  15813. 282.71 s [algebraic-graphs] include extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  15814. 282.71 s [algebraic-graphs] include inspection-testing-0.6.2-BXrtKPpIYmk3oPkvyBHJek
  15815. 282.71 s [algebraic-graphs] include transformers-0.6.1.2-2558
  15816. 282.71 s [algebraic-graphs] Ready component graph:
  15817. 282.71 s [algebraic-graphs] definite algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  15818. 282.71 s [algebraic-graphs] depends array-0.5.8.0-d6d4
  15819. 282.71 s [algebraic-graphs] depends base-4.21.0.0-b334
  15820. 282.71 s [algebraic-graphs] depends containers-0.7-d79e
  15821. 282.71 s [algebraic-graphs] depends deepseq-1.5.1.0-3c62
  15822. 282.71 s [algebraic-graphs] depends transformers-0.6.1.2-2558
  15823. 282.71 s [algebraic-graphs] definite algebraic-graphs-0.7-FKZbJT4N7FF2rJCgZTt0Vb-main
  15824. 282.71 s [algebraic-graphs] depends QuickCheck-2.15.0.1-4a6QuHFK3EgHKorV6DzjdR
  15825. 282.71 s [algebraic-graphs] depends algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  15826. 282.71 s [algebraic-graphs] depends array-0.5.8.0-d6d4
  15827. 282.71 s [algebraic-graphs] depends base-4.21.0.0-b334
  15828. 282.71 s [algebraic-graphs] depends containers-0.7-d79e
  15829. 282.71 s [algebraic-graphs] depends deepseq-1.5.1.0-3c62
  15830. 282.71 s [algebraic-graphs] depends extra-1.8.1-Cv3JP6hZJ5o6wgM112jJGX
  15831. 282.71 s [algebraic-graphs] depends inspection-testing-0.6.2-BXrtKPpIYmk3oPkvyBHJek
  15832. 282.71 s [algebraic-graphs] depends transformers-0.6.1.2-2558
  15833. 282.71 s [algebraic-graphs] Using Cabal-3.14.1.0 compiled by ghc-9.12
  15834. 282.71 s [algebraic-graphs] Using compiler: ghc-9.12.2
  15835. 282.71 s [algebraic-graphs] Using install prefix:
  15836. 282.71 s [algebraic-graphs] /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7
  15837. 282.71 s [algebraic-graphs] Executables installed in:
  15838. 282.71 s [algebraic-graphs] /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/bin
  15839. 282.71 s [algebraic-graphs] Libraries installed in:
  15840. 282.71 s [algebraic-graphs] /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  15841. 282.71 s [algebraic-graphs] Dynamic Libraries installed in:
  15842. 282.71 s [algebraic-graphs] /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3
  15843. 282.71 s [algebraic-graphs] Private executables installed in:
  15844. 282.71 s [algebraic-graphs] /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/libexec/x86_64-linux-ghc-9.12.2-82d3/algebraic-graphs-0.7
  15845. 282.71 s [algebraic-graphs] Data files installed in:
  15846. 282.71 s [algebraic-graphs] /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/share/x86_64-linux-ghc-9.12.2-82d3/algebraic-graphs-0.7
  15847. 282.71 s [algebraic-graphs] Documentation installed in:
  15848. 282.71 s [algebraic-graphs] /nix/store/4syljhmgi93jzr8cdmlar9dpmjsd53nv-algebraic-graphs-0.7-doc/share/doc/algebraic-graphs-0.7
  15849. 282.71 s [algebraic-graphs] Configuration files installed in:
  15850. 282.71 s [algebraic-graphs] /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/etc
  15851. 282.71 s [algebraic-graphs] No alex found
  15852. 282.71 s [algebraic-graphs] Using ar found on system at:
  15853. 282.71 s [algebraic-graphs] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  15854. 282.71 s [algebraic-graphs] No c2hs found
  15855. 282.71 s [algebraic-graphs] No cpphs found
  15856. 282.71 s [algebraic-graphs] No doctest found
  15857. 282.71 s [algebraic-graphs] Using gcc version 14.3.0 given by user at:
  15858. 282.71 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  15859. 282.71 s [algebraic-graphs] Using ghc version 9.12.2 found on system at:
  15860. 282.71 s [algebraic-graphs] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc
  15861. 282.71 s [algebraic-graphs] Using ghc-pkg version 9.12.2 found on system at:
  15862. 282.71 s [algebraic-graphs] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc-pkg-9.12.2
  15863. 282.71 s [algebraic-graphs] No ghcjs found
  15864. 282.71 s [algebraic-graphs] No ghcjs-pkg found
  15865. 282.71 s [algebraic-graphs] No greencard found
  15866. 282.71 s [algebraic-graphs] Using haddock version 2.30.0 found on system at:
  15867. 282.71 s [algebraic-graphs] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/haddock-ghc-9.12.2
  15868. 282.71 s [algebraic-graphs] No happy found
  15869. 282.71 s [algebraic-graphs] No haskell-suite found
  15870. 282.71 s [algebraic-graphs] No haskell-suite-pkg found
  15871. 282.71 s [algebraic-graphs] No hmake found
  15872. 282.71 s [algebraic-graphs] Using hpc version 0.69 found on system at:
  15873. 282.71 s [algebraic-graphs] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hpc-ghc-9.12.2
  15874. 282.71 s [algebraic-graphs] Using hsc2hs version 0.68.10 found on system at:
  15875. 282.71 s [algebraic-graphs] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  15876. 282.71 s [algebraic-graphs] Using hscolour version 1.25 found on system at:
  15877. 282.71 s [algebraic-graphs] /nix/store/02s9rad0jn6nj8z96k357im73hkzqsnw-hscolour-1.25/bin/HsColour
  15878. 282.71 s [algebraic-graphs] No jhc found
  15879. 282.71 s [algebraic-graphs] Using ld found on system at:
  15880. 282.71 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  15881. 282.71 s [algebraic-graphs] No pkg-config found
  15882. 282.71 s [algebraic-graphs] Using runghc version 9.12.2 found on system at:
  15883. 282.71 s [algebraic-graphs] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/runghc-9.12.2
  15884. 282.71 s [algebraic-graphs] Using strip version 2.44 found on system at:
  15885. 282.71 s [algebraic-graphs] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  15886. 282.71 s [algebraic-graphs] Using tar found on system at:
  15887. 282.71 s [algebraic-graphs] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  15888. 282.71 s [algebraic-graphs] No uhc found
  15889. 282.87 s [algebraic-graphs] Phase: buildPhase
  15890. 282.91 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  15891. 282.91 s [algebraic-graphs] Building library for algebraic-graphs-0.7...
  15892. 283.00 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 )
  15893. 283.71 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 )
  15894. 284.21 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 )
  15895. 284.46 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 )
  15896. 284.46 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.o, dist/build/Algebra/Graph.dyn_o )
  15897. 285.34 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 )
  15898. 285.54 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 )
  15899. 285.92 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 )
  15900. 286.48 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 )
  15901. 286.48 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 )
  15902. 286.48 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 )
  15903. 286.48 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  15904. 286.48 s [algebraic-graphs] In the use of ‘head’
  15905. 286.48 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  15906. 286.48 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"."
  15907. 286.48 s [algebraic-graphs] |
  15908. 286.48 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  15909. 286.48 s [algebraic-graphs] | ^^^^
  15910. 286.48 s [algebraic-graphs]
  15911. 286.48 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  15912. 286.48 s [algebraic-graphs] In the use of ‘tail’
  15913. 286.48 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  15914. 286.48 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"."
  15915. 286.48 s [algebraic-graphs] |
  15916. 286.48 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  15917. 286.48 s [algebraic-graphs] | ^^^^
  15918. 286.48 s [algebraic-graphs]
  15919. 286.48 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  15920. 286.48 s [algebraic-graphs] In the use of ‘head’
  15921. 286.48 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  15922. 286.48 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"."
  15923. 286.48 s [algebraic-graphs] |
  15924. 286.48 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  15925. 286.48 s [algebraic-graphs] | ^^^^
  15926. 286.48 s [algebraic-graphs]
  15927. 286.48 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  15928. 286.48 s [algebraic-graphs] In the use of ‘tail’
  15929. 286.48 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  15930. 286.48 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"."
  15931. 286.48 s [algebraic-graphs] |
  15932. 286.48 s [algebraic-graphs] 397 | bnd' = tail bnd
  15933. 286.48 s [algebraic-graphs] | ^^^^
  15934. 286.48 s [algebraic-graphs]
  15935. 286.48 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 )
  15936. 286.48 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 )
  15937. 286.48 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  15938. 286.48 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15939. 286.48 s [algebraic-graphs] will become an error in a future GHC release.
  15940. 286.48 s [algebraic-graphs] Suggested fix:
  15941. 286.48 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  15942. 286.48 s [algebraic-graphs] |
  15943. 286.48 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  15944. 286.48 s [algebraic-graphs] | ^
  15945. 286.48 s [algebraic-graphs]
  15946. 286.48 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  15947. 286.48 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15948. 286.48 s [algebraic-graphs] will become an error in a future GHC release.
  15949. 286.48 s [algebraic-graphs] Suggested fix:
  15950. 286.48 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  15951. 286.48 s [algebraic-graphs] |
  15952. 286.48 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  15953. 286.48 s [algebraic-graphs] | ^
  15954. 286.48 s [algebraic-graphs]
  15955. 286.48 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  15956. 286.48 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15957. 286.48 s [algebraic-graphs] will become an error in a future GHC release.
  15958. 286.48 s [algebraic-graphs] Suggested fix:
  15959. 286.48 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  15960. 286.48 s [algebraic-graphs] |
  15961. 286.48 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  15962. 286.48 s [algebraic-graphs] | ^
  15963. 286.48 s [algebraic-graphs]
  15964. 286.48 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  15965. 286.48 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15966. 286.48 s [algebraic-graphs] will become an error in a future GHC release.
  15967. 286.48 s [algebraic-graphs] Suggested fix:
  15968. 286.48 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  15969. 286.48 s [algebraic-graphs] |
  15970. 286.48 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  15971. 286.48 s [algebraic-graphs] | ^
  15972. 286.48 s [algebraic-graphs]
  15973. 286.48 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  15974. 286.48 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15975. 286.48 s [algebraic-graphs] will become an error in a future GHC release.
  15976. 286.48 s [algebraic-graphs] Suggested fix:
  15977. 286.48 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  15978. 286.48 s [algebraic-graphs] |
  15979. 286.48 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  15980. 286.48 s [algebraic-graphs] | ^
  15981. 286.48 s [algebraic-graphs]
  15982. 286.48 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  15983. 286.48 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15984. 286.48 s [algebraic-graphs] will become an error in a future GHC release.
  15985. 286.48 s [algebraic-graphs] Suggested fix:
  15986. 286.48 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  15987. 286.48 s [algebraic-graphs] |
  15988. 286.48 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  15989. 286.48 s [algebraic-graphs] | ^
  15990. 286.48 s [algebraic-graphs]
  15991. 286.48 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  15992. 286.48 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  15993. 286.48 s [algebraic-graphs] will become an error in a future GHC release.
  15994. 286.48 s [algebraic-graphs] Suggested fix:
  15995. 286.48 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  15996. 286.48 s [algebraic-graphs] |
  15997. 286.48 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  15998. 286.48 s [algebraic-graphs] | ^
  15999. 286.48 s [algebraic-graphs]
  16000. 286.48 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 )
  16001. 286.50 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 )
  16002. 286.76 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 )
  16003. 286.78 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 )
  16004. 286.78 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 )
  16005. 287.10 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 )
  16006. 287.21 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, dist/build/Algebra/Graph/Labelled/Example/Automaton.o, dist/build/Algebra/Graph/Labelled/Example/Automaton.dyn_o )
  16007. 287.35 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 )
  16008. 287.45 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16009. 287.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16010. 287.45 s [algebraic-graphs] will become an error in a future GHC release.
  16011. 287.45 s [algebraic-graphs] Suggested fix:
  16012. 287.45 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16013. 287.45 s [algebraic-graphs] |
  16014. 287.45 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  16015. 287.45 s [algebraic-graphs] | ^
  16016. 287.45 s [algebraic-graphs]
  16017. 287.45 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 )
  16018. 287.45 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16019. 287.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16020. 287.45 s [algebraic-graphs] will become an error in a future GHC release.
  16021. 287.45 s [algebraic-graphs] Suggested fix:
  16022. 287.45 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16023. 287.45 s [algebraic-graphs] |
  16024. 287.45 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  16025. 287.45 s [algebraic-graphs] | ^
  16026. 287.45 s [algebraic-graphs]
  16027. 287.45 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16028. 287.45 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16029. 287.45 s [algebraic-graphs] will become an error in a future GHC release.
  16030. 287.45 s [algebraic-graphs] Suggested fix:
  16031. 287.45 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16032. 287.45 s [algebraic-graphs] |
  16033. 287.45 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  16034. 287.45 s [algebraic-graphs] | ^
  16035. 287.45 s [algebraic-graphs]
  16036. 287.45 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 )
  16037. 287.45 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 )
  16038. 287.45 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 )
  16039. 287.45 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 )
  16040. 287.45 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 )
  16041. 287.45 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 )
  16042. 287.45 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.o, dist/build/Data/Graph/Typed.dyn_o )
  16043. 287.63 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, dist/build/Algebra/Graph/AdjacencyMap.p_o )
  16044. 288.37 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, dist/build/Algebra/Graph/AdjacencyIntMap.p_o )
  16045. 288.83 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 )
  16046. 289.13 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, dist/build/Algebra/Graph/Internal.p_o )
  16047. 289.13 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, dist/build/Algebra/Graph.p_o )
  16048. 289.99 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 )
  16049. 290.26 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 )
  16050. 290.62 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 )
  16051. 291.22 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, dist/build/Algebra/Graph/Label.p_o )
  16052. 291.22 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 )
  16053. 291.22 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 )
  16054. 291.22 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  16055. 291.22 s [algebraic-graphs] In the use of ‘head’
  16056. 291.22 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16057. 291.22 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"."
  16058. 291.22 s [algebraic-graphs] |
  16059. 291.22 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  16060. 291.22 s [algebraic-graphs] | ^^^^
  16061. 291.22 s [algebraic-graphs]
  16062. 291.22 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  16063. 291.22 s [algebraic-graphs] In the use of ‘tail’
  16064. 291.22 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16065. 291.22 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"."
  16066. 291.22 s [algebraic-graphs] |
  16067. 291.22 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  16068. 291.22 s [algebraic-graphs] | ^^^^
  16069. 291.22 s [algebraic-graphs]
  16070. 291.22 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  16071. 291.22 s [algebraic-graphs] In the use of ‘head’
  16072. 291.22 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16073. 291.22 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"."
  16074. 291.22 s [algebraic-graphs] |
  16075. 291.22 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  16076. 291.22 s [algebraic-graphs] | ^^^^
  16077. 291.22 s [algebraic-graphs]
  16078. 291.22 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  16079. 291.22 s [algebraic-graphs] In the use of ‘tail’
  16080. 291.22 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  16081. 291.22 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"."
  16082. 291.22 s [algebraic-graphs] |
  16083. 291.22 s [algebraic-graphs] 397 | bnd' = tail bnd
  16084. 291.22 s [algebraic-graphs] | ^^^^
  16085. 291.22 s [algebraic-graphs]
  16086. 291.22 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 )
  16087. 291.22 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, dist/build/Algebra/Graph/ToGraph.p_o )
  16088. 291.22 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16089. 291.22 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16090. 291.22 s [algebraic-graphs] will become an error in a future GHC release.
  16091. 291.22 s [algebraic-graphs] Suggested fix:
  16092. 291.22 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16093. 291.22 s [algebraic-graphs] |
  16094. 291.22 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  16095. 291.22 s [algebraic-graphs] | ^
  16096. 291.22 s [algebraic-graphs]
  16097. 291.22 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16098. 291.22 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16099. 291.22 s [algebraic-graphs] will become an error in a future GHC release.
  16100. 291.22 s [algebraic-graphs] Suggested fix:
  16101. 291.22 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16102. 291.22 s [algebraic-graphs] |
  16103. 291.22 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16104. 291.22 s [algebraic-graphs] | ^
  16105. 291.22 s [algebraic-graphs]
  16106. 291.22 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16107. 291.22 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16108. 291.22 s [algebraic-graphs] will become an error in a future GHC release.
  16109. 291.22 s [algebraic-graphs] Suggested fix:
  16110. 291.22 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16111. 291.22 s [algebraic-graphs] |
  16112. 291.22 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  16113. 291.22 s [algebraic-graphs] | ^
  16114. 291.22 s [algebraic-graphs]
  16115. 291.22 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16116. 291.22 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16117. 291.22 s [algebraic-graphs] will become an error in a future GHC release.
  16118. 291.22 s [algebraic-graphs] Suggested fix:
  16119. 291.22 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16120. 291.22 s [algebraic-graphs] |
  16121. 291.22 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16122. 291.22 s [algebraic-graphs] | ^
  16123. 291.22 s [algebraic-graphs]
  16124. 291.22 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16125. 291.22 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16126. 291.22 s [algebraic-graphs] will become an error in a future GHC release.
  16127. 291.22 s [algebraic-graphs] Suggested fix:
  16128. 291.22 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16129. 291.22 s [algebraic-graphs] |
  16130. 291.22 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  16131. 291.22 s [algebraic-graphs] | ^
  16132. 291.22 s [algebraic-graphs]
  16133. 291.22 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16134. 291.22 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16135. 291.22 s [algebraic-graphs] will become an error in a future GHC release.
  16136. 291.22 s [algebraic-graphs] Suggested fix:
  16137. 291.22 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16138. 291.22 s [algebraic-graphs] |
  16139. 291.22 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16140. 291.22 s [algebraic-graphs] | ^
  16141. 291.22 s [algebraic-graphs]
  16142. 291.22 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16143. 291.22 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16144. 291.22 s [algebraic-graphs] will become an error in a future GHC release.
  16145. 291.22 s [algebraic-graphs] Suggested fix:
  16146. 291.22 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16147. 291.22 s [algebraic-graphs] |
  16148. 291.22 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  16149. 291.22 s [algebraic-graphs] | ^
  16150. 291.22 s [algebraic-graphs]
  16151. 291.22 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, dist/build/Algebra/Graph/Relation.p_o )
  16152. 291.22 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 )
  16153. 291.57 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, dist/build/Algebra/Graph/NonEmpty.p_o )
  16154. 291.57 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 )
  16155. 291.57 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, dist/build/Algebra/Graph/Labelled.p_o )
  16156. 291.93 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 )
  16157. 292.13 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 )
  16158. 292.24 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, dist/build/Algebra/Graph/Export.p_o )
  16159. 292.24 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16160. 292.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16161. 292.24 s [algebraic-graphs] will become an error in a future GHC release.
  16162. 292.24 s [algebraic-graphs] Suggested fix:
  16163. 292.24 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16164. 292.24 s [algebraic-graphs] |
  16165. 292.24 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  16166. 292.24 s [algebraic-graphs] | ^
  16167. 292.24 s [algebraic-graphs]
  16168. 292.24 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 )
  16169. 292.24 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16170. 292.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16171. 292.24 s [algebraic-graphs] will become an error in a future GHC release.
  16172. 292.24 s [algebraic-graphs] Suggested fix:
  16173. 292.24 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16174. 292.24 s [algebraic-graphs] |
  16175. 292.24 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  16176. 292.24 s [algebraic-graphs] | ^
  16177. 292.24 s [algebraic-graphs]
  16178. 292.24 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  16179. 292.24 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  16180. 292.24 s [algebraic-graphs] will become an error in a future GHC release.
  16181. 292.24 s [algebraic-graphs] Suggested fix:
  16182. 292.24 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  16183. 292.24 s [algebraic-graphs] |
  16184. 292.24 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  16185. 292.24 s [algebraic-graphs] | ^
  16186. 292.24 s [algebraic-graphs]
  16187. 292.24 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, dist/build/Algebra/Graph/Undirected.p_o )
  16188. 292.24 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, dist/build/Algebra/Graph/Class.p_o )
  16189. 292.24 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 )
  16190. 292.39 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 )
  16191. 292.47 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 )
  16192. 292.47 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 )
  16193. 292.47 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, dist/build/Data/Graph/Typed.p_o )
  16194. 293.38 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  16195. 293.38 s [algebraic-graphs] Building test suite 'main' for algebraic-graphs-0.7...
  16196. 293.48 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 )
  16197. 294.42 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 )
  16198. 296.34 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 )
  16199. 296.34 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 )
  16200. 296.34 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 )
  16201. 296.34 s [algebraic-graphs] test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:71: warning: [GHC-00834] [-Wview-pattern-signatures]
  16202. 296.34 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  16203. 296.34 s [algebraic-graphs] • This code might stop working in a future GHC release
  16204. 296.34 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  16205. 296.34 s [algebraic-graphs] unless the view function is an endofunction.
  16206. 296.34 s [algebraic-graphs] • Current parse: ‘apply -> (f1 :: Int -> Int)’
  16207. 296.34 s [algebraic-graphs] Future parse: ‘(apply -> f1) :: Int -> Int’
  16208. 296.34 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  16209. 296.34 s [algebraic-graphs] |
  16210. 296.34 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 ->
  16211. 296.35 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  16212. 296.35 s [algebraic-graphs]
  16213. 296.35 s [algebraic-graphs] test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:99: warning: [GHC-00834] [-Wview-pattern-signatures]
  16214. 296.35 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  16215. 296.35 s [algebraic-graphs] • This code might stop working in a future GHC release
  16216. 296.35 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  16217. 296.35 s [algebraic-graphs] unless the view function is an endofunction.
  16218. 296.35 s [algebraic-graphs] • Current parse: ‘apply -> (g1 :: Int -> Int)’
  16219. 296.35 s [algebraic-graphs] Future parse: ‘(apply -> g1) :: Int -> Int’
  16220. 296.35 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  16221. 296.35 s [algebraic-graphs] |
  16222. 296.35 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 ->
  16223. 296.35 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  16224. 296.35 s [algebraic-graphs]
  16225. 296.35 s [algebraic-graphs] test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:127: warning: [GHC-00834] [-Wview-pattern-signatures]
  16226. 296.35 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  16227. 296.35 s [algebraic-graphs] • This code might stop working in a future GHC release
  16228. 296.35 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  16229. 296.35 s [algebraic-graphs] unless the view function is an endofunction.
  16230. 296.35 s [algebraic-graphs] • Current parse: ‘apply -> (f2 :: Int -> Int)’
  16231. 296.35 s [algebraic-graphs] Future parse: ‘(apply -> f2) :: Int -> Int’
  16232. 296.35 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  16233. 296.35 s [algebraic-graphs] |
  16234. 296.35 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 ->
  16235. 296.35 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  16236. 296.35 s [algebraic-graphs]
  16237. 296.35 s [algebraic-graphs] test/Algebra/Graph/Test/Bipartite/AdjacencyMap.hs:725:155: warning: [GHC-00834] [-Wview-pattern-signatures]
  16238. 296.35 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  16239. 296.35 s [algebraic-graphs] • This code might stop working in a future GHC release
  16240. 296.35 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  16241. 296.35 s [algebraic-graphs] unless the view function is an endofunction.
  16242. 296.35 s [algebraic-graphs] • Current parse: ‘apply -> (g2 :: Int -> Int)’
  16243. 296.35 s [algebraic-graphs] Future parse: ‘(apply -> g2) :: Int -> Int’
  16244. 296.35 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  16245. 296.35 s [algebraic-graphs] |
  16246. 296.35 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 ->
  16247. 296.35 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^^
  16248. 296.35 s [algebraic-graphs]
  16249. 297.77 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 )
  16250. 297.82 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 )
  16251. 297.82 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 )
  16252. 297.82 s [algebraic-graphs] test/Algebra/Graph/Test/Generic.hs:1501:50: warning: [GHC-00834] [-Wview-pattern-signatures]
  16253. 297.82 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  16254. 297.82 s [algebraic-graphs] • This code might stop working in a future GHC release
  16255. 297.82 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  16256. 297.82 s [algebraic-graphs] unless the view function is an endofunction.
  16257. 297.82 s [algebraic-graphs] • Current parse: ‘apply -> (f :: Int -> Int)’
  16258. 297.82 s [algebraic-graphs] Future parse: ‘(apply -> f) :: Int -> Int’
  16259. 297.82 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  16260. 297.82 s [algebraic-graphs] |
  16261. 297.82 s [algebraic-graphs] 1501 | test "gmap f . gmap g == gmap (f . g)" $ \(apply -> f :: Int -> Int) (apply -> g :: Int -> Int) x ->
  16262. 297.82 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^
  16263. 297.82 s [algebraic-graphs]
  16264. 297.82 s [algebraic-graphs] test/Algebra/Graph/Test/Generic.hs:1501:77: warning: [GHC-00834] [-Wview-pattern-signatures]
  16265. 297.82 s [algebraic-graphs] • Found an unparenthesized pattern signature on the RHS of a view pattern.
  16266. 297.82 s [algebraic-graphs] • This code might stop working in a future GHC release
  16267. 297.82 s [algebraic-graphs] due to a planned change to the precedence of view patterns,
  16268. 297.82 s [algebraic-graphs] unless the view function is an endofunction.
  16269. 297.82 s [algebraic-graphs] • Current parse: ‘apply -> (g :: Int -> Int)’
  16270. 297.82 s [algebraic-graphs] Future parse: ‘(apply -> g) :: Int -> Int’
  16271. 297.82 s [algebraic-graphs] Suggested fix: Parenthesize the RHS of the view pattern
  16272. 297.82 s [algebraic-graphs] |
  16273. 297.82 s [algebraic-graphs] 1501 | test "gmap f . gmap g == gmap (f . g)" $ \(apply -> f :: Int -> Int) (apply -> g :: Int -> Int) x ->
  16274. 297.82 s [algebraic-graphs] | ^^^^^^^^^^^^^^^^^^^^^^^^
  16275. 297.82 s [algebraic-graphs]
  16276. 300.64 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 )
  16277. 300.76 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 )
  16278. 300.76 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 )
  16279. 301.17 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 )
  16280. 301.17 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 )
  16281. 301.17 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 )
  16282. 301.86 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 )
  16283. 301.86 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 )
  16284. 301.86 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 )
  16285. 301.86 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 )
  16286. 301.86 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 )
  16287. 301.86 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 )
  16288. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:43:1: emptyI === emptyIR passed.
  16289. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:49:1: vertexI === vertexIR passed.
  16290. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:56:1: overlayI === overlayIR passed.
  16291. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:63:1: connectI === connectIR passed.
  16292. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:69:1: overlaysC `hasNoType` GHC.Types.List passed.
  16293. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:76:1: overlaysP === overlaysPR passed.
  16294. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:82:1: verticesCP `hasNoType` GHC.Types.List passed.
  16295. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:83:1: verticesCP `hasNoType` Algebra.Graph.Graph passed.
  16296. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:89:1: connectsC `hasNoType` GHC.Types.List passed.
  16297. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:96:1: connectsP === connectsPR passed.
  16298. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:102:1: isSubgraphOfC `hasNoType` Algebra.Graph.Graph passed.
  16299. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:108:1: cliqueCP `hasNoType` GHC.Types.List passed.
  16300. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:109:1: cliqueCP `hasNoType` Algebra.Graph.Graph passed.
  16301. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:115:1: edgesCP `hasNoType` GHC.Types.List passed.
  16302. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:116:1: edgesCP `hasNoType` Algebra.Graph.Graph passed.
  16303. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:122:1: starCP `hasNoType` GHC.Types.List passed.
  16304. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:123:1: starCP `hasNoType` Algebra.Graph.Graph passed.
  16305. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:130:1: fmapCP `hasNoType` Algebra.Graph.Graph passed.
  16306. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:137:1: bindC === bindCR passed.
  16307. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:144:1: bindP === bindPR passed.
  16308. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:151:1: apC === apCR passed.
  16309. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:159:1: apP === apPR passed.
  16310. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:165:1: eqC `hasNoType` Algebra.Graph.Graph passed.
  16311. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:170:1: eqT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16312. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:176:1: ordC `hasNoType` Algebra.Graph.Graph passed.
  16313. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:181:1: ordT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16314. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:187:1: isEmptyC `hasNoType` Algebra.Graph.Graph passed.
  16315. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:193:1: sizeC `hasNoType` Algebra.Graph.Graph passed.
  16316. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:199:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  16317. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:205:1: vertexSetC `hasNoType` Algebra.Graph.Graph passed.
  16318. 301.86 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:210:1: vertexCountT `hasNoType` Data.Set.Internal.Set passed.
  16319. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:216:1: edgeCountC `hasNoType` Algebra.Graph.Graph passed.
  16320. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:221:1: edgeCountT `hasNoType` Data.Set.Internal.Set passed.
  16321. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:227:1: vertexListCP `hasNoType` Algebra.Graph.Graph passed.
  16322. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:228:1: vertexListCP `hasNoType` GHC.Types.List passed.
  16323. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:233:1: vertexListT `hasNoType` Data.Set.Internal.Set passed.
  16324. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:239:1: edgeSetC `hasNoType` Algebra.Graph.Graph passed.
  16325. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:244:1: vertexListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16326. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:250:1: edgeListCP `hasNoType` Algebra.Graph.Graph passed.
  16327. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:251:1: edgeListCP `hasNoType` GHC.Types.List passed.
  16328. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:256:1: edgeListT `hasNoType` Algebra.Graph.AdjacencyMap.AdjacencyMap passed.
  16329. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:262:1: hasVertexC `hasNoType` Algebra.Graph.Graph passed.
  16330. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:268:1: hasEdgeC `hasNoType` Algebra.Graph.Graph passed.
  16331. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:274:1: adjacencyListC `hasNoType` Algebra.Graph.Graph passed.
  16332. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:280:1: pathP `hasNoType` Algebra.Graph.Graph passed.
  16333. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:286:1: circuitP `hasNoType` Algebra.Graph.Graph passed.
  16334. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:292:1: bicliqueCP `hasNoType` GHC.Types.List passed.
  16335. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:293:1: bicliqueCP `hasNoType` Algebra.Graph.Graph passed.
  16336. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:301:1: replaceVertexCP `hasNoType` Algebra.Graph.Graph passed.
  16337. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:309:1: mergeVerticesCP `hasNoType` Algebra.Graph.Graph passed.
  16338. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:316:1: splitVertexCP `hasNoType` GHC.Types.List passed.
  16339. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:317:1: splitVertexCP `hasNoType` Algebra.Graph.Graph passed.
  16340. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:324:1: transposeCP `hasNoType` Algebra.Graph.Graph passed.
  16341. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:339:1: simplifyC === simplifyCR passed.
  16342. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:345:1: composeCP `hasNoType` Algebra.Graph.Graph passed.
  16343. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:352:1: induceCP `hasNoType` Algebra.Graph.Graph passed.
  16344. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:359:1: induceJustCP `hasNoType` Algebra.Graph.Graph passed.
  16345. 301.87 s [algebraic-graphs] test/Algebra/Graph/Test/RewriteRules.hs:365:1: contextC `hasNoType` Algebra.Graph.Graph passed.
  16346. 301.87 s [algebraic-graphs] inspection testing successful
  16347. 301.87 s [algebraic-graphs] expected successes: 58
  16348. 301.87 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 )
  16349. 301.87 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 )
  16350. 301.87 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 )
  16351. 302.53 s [algebraic-graphs] [24 of 24] Linking dist/build/main/main
  16352. 303.29 s [algebraic-graphs] Phase: checkPhase
  16353. 303.47 s [algebraic-graphs] Running 1 test suites...
  16354. 303.54 s [algebraic-graphs] Test suite main: RUNNING...
  16355. 308.75 s [algebraic-graphs]
  16356. 308.75 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.Show ============
  16357. 308.78 s [algebraic-graphs] OK: show empty == "empty"
  16358. 308.78 s [algebraic-graphs] OK: show (shrink 1) == "vertex 1"
  16359. 308.78 s [algebraic-graphs] OK: show (shrink $ 1 + 2) == "vertices [1,2]"
  16360. 308.78 s [algebraic-graphs] OK: show (shrink $ 1 * 2) == "(fromJust . toAcyclic) (edge 1 2)"
  16361. 308.78 s [algebraic-graphs] OK: show (shrink $ 1 * 2 * 3) == "(fromJust . toAcyclic) (edges [(1,2),(1,3),(2,3)])"
  16362. 308.78 s [algebraic-graphs] OK: show (shrink $ 1 * 2 + 3) == "(fromJust . toAcyclic) (overlay (vertex 3) (edge 1 2))"
  16363. 308.78 s [algebraic-graphs]
  16364. 308.78 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.fromAcyclic ============
  16365. 308.78 s [algebraic-graphs] OK: fromAcyclic empty == empty
  16366. 308.78 s [algebraic-graphs] OK: fromAcyclic . vertex == vertex
  16367. 308.78 s [algebraic-graphs] OK: fromAcyclic (shrink $ 1 * 3 * 2) == star 1 [2,3]
  16368. 308.78 s [algebraic-graphs] OK: vertexCount . fromAcyclic == vertexCount
  16369. 308.78 s [algebraic-graphs] OK: edgeCount . fromAcyclic == edgeCount
  16370. 308.78 s [algebraic-graphs] OK: isAcyclic . fromAcyclic == const True
  16371. 308.78 s [algebraic-graphs]
  16372. 308.78 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.empty ============
  16373. 308.78 s [algebraic-graphs] OK: isEmpty empty == True
  16374. 308.78 s [algebraic-graphs] OK: hasVertex x empty == False
  16375. 308.78 s [algebraic-graphs] OK: vertexCount empty == 0
  16376. 308.78 s [algebraic-graphs] OK: edgeCount empty == 0
  16377. 308.78 s [algebraic-graphs]
  16378. 308.78 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertex ============
  16379. 308.78 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  16380. 308.78 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  16381. 308.78 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  16382. 308.78 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  16383. 308.78 s [algebraic-graphs]
  16384. 308.78 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertices ============
  16385. 308.78 s [algebraic-graphs] OK: vertices [] == empty
  16386. 308.79 s [algebraic-graphs] OK: vertices [x] == vertex x
  16387. 308.79 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  16388. 308.79 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  16389. 308.79 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  16390. 308.79 s [algebraic-graphs]
  16391. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.union ============
  16392. 308.79 s [algebraic-graphs] OK: vertexSet (union x y) == <correct result>
  16393. 308.79 s [algebraic-graphs] OK: edgeSet (union x y) == <correct result>
  16394. 308.79 s [algebraic-graphs]
  16395. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.join ============
  16396. 308.79 s [algebraic-graphs] OK: vertexSet (join x y) == <correct result>
  16397. 308.79 s [algebraic-graphs] OK: edgeSet (join x y) == <correct result>
  16398. 308.79 s [algebraic-graphs]
  16399. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isSubgraphOf ============
  16400. 308.79 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  16401. 308.79 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  16402. 308.79 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  16403. 308.79 s [algebraic-graphs] OK: isSubgraphOf x (transitiveClosure x) == True
  16404. 308.79 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  16405. 308.79 s [algebraic-graphs]
  16406. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.isEmpty ============
  16407. 308.79 s [algebraic-graphs] OK: isEmpty empty == True
  16408. 308.79 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  16409. 308.79 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  16410. 308.79 s [algebraic-graphs] OK: isEmpty (removeEdge 1 2 $ shrink $ 1 * 2) == False
  16411. 308.79 s [algebraic-graphs]
  16412. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasVertex ============
  16413. 308.79 s [algebraic-graphs] OK: hasVertex x empty == False
  16414. 308.79 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  16415. 308.79 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  16416. 308.79 s [algebraic-graphs]
  16417. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.hasEdge ============
  16418. 308.79 s [algebraic-graphs] OK: hasEdge x y empty == False
  16419. 308.79 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  16420. 308.79 s [algebraic-graphs] OK: hasEdge 1 2 (shrink $ 1 * 2) == True
  16421. 308.79 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  16422. 308.79 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  16423. 308.79 s [algebraic-graphs]
  16424. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexCount ============
  16425. 308.79 s [algebraic-graphs] OK: vertexCount empty == 0
  16426. 308.79 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  16427. 308.79 s [algebraic-graphs] OK: vertexCount == length . vertexList
  16428. 308.79 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  16429. 308.79 s [algebraic-graphs]
  16430. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeCount ============
  16431. 308.79 s [algebraic-graphs] OK: edgeCount empty == 0
  16432. 308.79 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  16433. 308.79 s [algebraic-graphs] OK: edgeCount (shrink $ 1 * 2) == 1
  16434. 308.79 s [algebraic-graphs] OK: edgeCount == length . edgeList
  16435. 308.79 s [algebraic-graphs]
  16436. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexList ============
  16437. 308.79 s [algebraic-graphs] OK: vertexList empty == []
  16438. 308.79 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  16439. 308.79 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  16440. 308.79 s [algebraic-graphs]
  16441. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeList ============
  16442. 308.79 s [algebraic-graphs] OK: edgeList empty == []
  16443. 308.79 s [algebraic-graphs] OK: edgeList (vertex x) == []
  16444. 308.79 s [algebraic-graphs] OK: edgeList (shrink $ 2 * 1) == [(2,1)]
  16445. 308.79 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  16446. 308.79 s [algebraic-graphs]
  16447. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.adjacencyList ============
  16448. 308.79 s [algebraic-graphs] OK: adjacencyList empty == []
  16449. 308.79 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  16450. 308.79 s [algebraic-graphs] OK: adjacencyList (shrink $ 1 * 2) == [(1, [2]), (2, [])]
  16451. 308.79 s [algebraic-graphs]
  16452. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.vertexSet ============
  16453. 308.79 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  16454. 308.79 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  16455. 308.79 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  16456. 308.79 s [algebraic-graphs]
  16457. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.edgeSet ============
  16458. 308.79 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  16459. 308.79 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  16460. 308.79 s [algebraic-graphs] OK: edgeSet (shrink $ 1 * 2) == Set.singleton (1,2)
  16461. 308.79 s [algebraic-graphs]
  16462. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.preSet ============
  16463. 308.79 s [algebraic-graphs] OK: preSet x empty == Set.empty
  16464. 308.79 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  16465. 308.79 s [algebraic-graphs] OK: preSet 1 (shrink $ 1 * 2) == Set.empty
  16466. 308.79 s [algebraic-graphs] OK: preSet 2 (shrink $ 1 * 2) == Set.fromList [1]
  16467. 308.79 s [algebraic-graphs] OK: Set.member x . preSet x == const False
  16468. 308.79 s [algebraic-graphs]
  16469. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.postSet ============
  16470. 308.79 s [algebraic-graphs] OK: postSet x empty == Set.empty
  16471. 308.79 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  16472. 308.79 s [algebraic-graphs] OK: postSet 1 (shrink $ 1 * 2) == Set.fromList [2]
  16473. 308.79 s [algebraic-graphs] OK: postSet 2 (shrink $ 1 * 2) == Set.empty
  16474. 308.79 s [algebraic-graphs] OK: Set.member x . postSet x == const False
  16475. 308.79 s [algebraic-graphs]
  16476. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeVertex ============
  16477. 308.79 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  16478. 308.79 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  16479. 308.79 s [algebraic-graphs] OK: removeVertex 1 (shrink $ 1 * 2) == vertex 2
  16480. 308.79 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  16481. 308.79 s [algebraic-graphs]
  16482. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.removeEdge ============
  16483. 308.79 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2) == vertices [1,2]
  16484. 308.79 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  16485. 308.79 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  16486. 308.79 s [algebraic-graphs] OK: removeEdge 1 2 (shrink $ 1 * 2 * 3) == shrink ((1 + 2) * 3)
  16487. 308.79 s [algebraic-graphs]
  16488. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transpose ============
  16489. 308.79 s [algebraic-graphs] OK: transpose empty == empty
  16490. 308.79 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  16491. 308.79 s [algebraic-graphs] OK: transpose . transpose == id
  16492. 308.79 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  16493. 308.79 s [algebraic-graphs]
  16494. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induce ============
  16495. 308.79 s [algebraic-graphs] OK: induce (const True ) x == x
  16496. 308.79 s [algebraic-graphs] OK: induce (const False) x == empty
  16497. 308.79 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  16498. 308.79 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  16499. 308.79 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  16500. 308.79 s [algebraic-graphs]
  16501. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.induceJust ============
  16502. 308.79 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  16503. 308.79 s [algebraic-graphs] OK: induceJust . vertex . Just == vertex
  16504. 308.79 s [algebraic-graphs]
  16505. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.box ============
  16506. 308.79 s [algebraic-graphs] OK: edgeList (box (shrink $ 1 * 2) (shrink $ 10 * 20)) == <correct result>
  16507. 308.79 s [algebraic-graphs]
  16508. 308.79 s [algebraic-graphs] OK: box x y ~~ box y x
  16509. 308.79 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  16510. 308.79 s [algebraic-graphs] OK: box x empty ~~ empty
  16511. 308.79 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  16512. 308.79 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  16513. 308.79 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  16514. 308.79 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  16515. 308.79 s [algebraic-graphs]
  16516. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.transitiveClosure ============
  16517. 308.79 s [algebraic-graphs] OK: transitiveClosure empty == empty
  16518. 308.79 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  16519. 308.79 s [algebraic-graphs] OK: transitiveClosure (shrink $ 1 * 2 + 2 * 3) == shrink (1 * 2 + 1 * 3 + 2 * 3)
  16520. 308.79 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  16521. 308.79 s [algebraic-graphs]
  16522. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.topSort ============
  16523. 308.79 s [algebraic-graphs] OK: topSort empty == []
  16524. 308.79 s [algebraic-graphs] OK: topSort (vertex x) == [x]
  16525. 308.79 s [algebraic-graphs] OK: topSort (shrink $ 1 * (2 + 4) + 3 * 4) == [1, 2, 3, 4]
  16526. 308.79 s [algebraic-graphs] OK: topSort (join x y) == fmap Left (topSort x) ++ fmap Right (topSort y)
  16527. 308.79 s [algebraic-graphs] OK: Right . topSort == AM.topSort . fromAcyclic
  16528. 308.79 s [algebraic-graphs]
  16529. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.scc ============
  16530. 308.79 s [algebraic-graphs] OK: scc empty == empty
  16531. 308.79 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  16532. 308.79 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  16533. 308.79 s [algebraic-graphs] OK: edgeList $ scc (edge 1 2) == [ (NonEmpty.vertex 1, NonEmpty.vertex 2) ]
  16534. 308.79 s [algebraic-graphs] OK: edgeList $ scc (3 * 1 * 4 * 1 * 5) == <correct result>
  16535. 308.79 s [algebraic-graphs]
  16536. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclic ============
  16537. 308.79 s [algebraic-graphs] OK: toAcyclic (path [1,2,3]) == Just (shrink $ 1 * 2 + 2 * 3)
  16538. 308.79 s [algebraic-graphs] OK: toAcyclic (clique [3,2,1]) == Just (transpose (shrink $ 1 * 2 * 3))
  16539. 308.79 s [algebraic-graphs] OK: toAcyclic (circuit [1,2,3]) == Nothing
  16540. 308.79 s [algebraic-graphs] OK: toAcyclic . fromAcyclic == Just
  16541. 308.79 s [algebraic-graphs]
  16542. 308.79 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.toAcyclicOrd ============
  16543. 308.79 s [algebraic-graphs] OK: toAcyclicOrd empty == empty
  16544. 308.79 s [algebraic-graphs] OK: toAcyclicOrd . vertex == vertex
  16545. 308.79 s [algebraic-graphs] OK: toAcyclicOrd (1 + 2) == shrink (1 + 2)
  16546. 308.79 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2) == shrink (1 * 2)
  16547. 308.79 s [algebraic-graphs] OK: toAcyclicOrd (2 * 1) == shrink (1 + 2)
  16548. 308.79 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 1) == shrink (1 * 2)
  16549. 311.45 s [algebraic-graphs] OK: toAcyclicOrd (1 * 2 * 3) == shrink (1 * 2 * 3)
  16550. 311.45 s [algebraic-graphs]
  16551. 311.45 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.shrink ============
  16552. 311.45 s [algebraic-graphs] OK: shrink . AM.vertex == vertex
  16553. 311.45 s [algebraic-graphs] OK: shrink . AM.vertices == vertices
  16554. 311.45 s [algebraic-graphs] OK: shrink . fromAcyclic == id
  16555. 311.45 s [algebraic-graphs]
  16556. 311.45 s [algebraic-graphs] ============ Acyclic.AdjacencyMap.consistent ============
  16557. 311.45 s [algebraic-graphs] OK: Arbitrary
  16558. 311.45 s [algebraic-graphs] OK: empty
  16559. 311.45 s [algebraic-graphs] OK: vertex
  16560. 311.45 s [algebraic-graphs] OK: vertices
  16561. 311.45 s [algebraic-graphs] OK: union
  16562. 311.45 s [algebraic-graphs] OK: join
  16563. 311.45 s [algebraic-graphs] OK: transpose
  16564. 311.45 s [algebraic-graphs] OK: box
  16565. 311.45 s [algebraic-graphs] OK: transitiveClosure
  16566. 311.45 s [algebraic-graphs] OK: scc
  16567. 311.45 s [algebraic-graphs] OK: toAcyclic
  16568. 311.45 s [algebraic-graphs] OK: toAcyclicOrd
  16569. 311.45 s [algebraic-graphs]
  16570. 311.45 s [algebraic-graphs] ============ AdjacencyIntMap ============
  16571. 311.45 s [algebraic-graphs] OK: Axioms of graphs
  16572. 311.45 s [algebraic-graphs]
  16573. 311.45 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyMap ============
  16574. 311.45 s [algebraic-graphs] OK: fromAdjacencyMap == stars . AdjacencyMap.adjacencyList
  16575. 311.45 s [algebraic-graphs]
  16576. 311.45 s [algebraic-graphs] ============ AdjacencyIntMap.consistent ============
  16577. 311.45 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  16578. 311.45 s [algebraic-graphs]
  16579. 311.45 s [algebraic-graphs] OK: consistent empty == True
  16580. 311.45 s [algebraic-graphs] OK: consistent (vertex x) == True
  16581. 311.45 s [algebraic-graphs] OK: consistent (overlay x y) == True
  16582. 311.45 s [algebraic-graphs] OK: consistent (connect x y) == True
  16583. 311.45 s [algebraic-graphs] OK: consistent (edge x y) == True
  16584. 311.45 s [algebraic-graphs] OK: consistent (edges xs) == True
  16585. 311.45 s [algebraic-graphs] OK: consistent (stars xs) == True
  16586. 311.45 s [algebraic-graphs]
  16587. 311.45 s [algebraic-graphs] ============ AdjacencyIntMap.Show ============
  16588. 311.45 s [algebraic-graphs] OK: show (empty ) == "empty"
  16589. 311.45 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  16590. 311.45 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  16591. 311.45 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  16592. 311.45 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  16593. 311.45 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  16594. 311.45 s [algebraic-graphs]
  16595. 311.45 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  16596. 311.45 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  16597. 311.45 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  16598. 311.45 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  16599. 311.45 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  16600. 311.45 s [algebraic-graphs]
  16601. 311.45 s [algebraic-graphs] ============ AdjacencyIntMap.Ord ============
  16602. 311.45 s [algebraic-graphs] OK: vertex 1 < vertex 2
  16603. 311.45 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  16604. 311.45 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  16605. 311.45 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  16606. 311.45 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  16607. 311.45 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  16608. 311.45 s [algebraic-graphs] OK: x <= x + y
  16609. 311.45 s [algebraic-graphs] OK: x + y <= x * y
  16610. 311.45 s [algebraic-graphs]
  16611. 311.45 s [algebraic-graphs] ============ AdjacencyIntMap.empty ============
  16612. 311.45 s [algebraic-graphs] OK: isEmpty empty == True
  16613. 311.45 s [algebraic-graphs] OK: hasVertex x empty == False
  16614. 311.45 s [algebraic-graphs] OK: vertexCount empty == 0
  16615. 311.45 s [algebraic-graphs] OK: edgeCount empty == 0
  16616. 311.45 s [algebraic-graphs]
  16617. 311.45 s [algebraic-graphs] ============ AdjacencyIntMap.vertex ============
  16618. 311.45 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  16619. 311.45 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  16620. 311.45 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  16621. 311.45 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  16622. 311.45 s [algebraic-graphs]
  16623. 311.45 s [algebraic-graphs] ============ AdjacencyIntMap.edge ============
  16624. 311.45 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  16625. 311.45 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  16626. 311.45 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  16627. 311.45 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  16628. 311.45 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  16629. 311.45 s [algebraic-graphs]
  16630. 311.45 s [algebraic-graphs] ============ AdjacencyIntMap.overlay ============
  16631. 311.45 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  16632. 311.45 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  16633. 311.45 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  16634. 311.45 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  16635. 311.45 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  16636. 311.45 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  16637. 311.45 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  16638. 311.45 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  16639. 311.45 s [algebraic-graphs]
  16640. 311.45 s [algebraic-graphs] ============ AdjacencyIntMap.connect ============
  16641. 311.45 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  16642. 311.45 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  16643. 311.45 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  16644. 311.45 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  16645. 311.45 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  16646. 311.45 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  16647. 311.45 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  16648. 311.45 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  16649. 311.45 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  16650. 311.45 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  16651. 311.45 s [algebraic-graphs]
  16652. 311.45 s [algebraic-graphs] ============ AdjacencyIntMap.vertices ============
  16653. 311.45 s [algebraic-graphs] OK: vertices [] == empty
  16654. 311.45 s [algebraic-graphs] OK: vertices [x] == vertex x
  16655. 311.45 s [algebraic-graphs] OK: vertices == overlays . map vertex
  16656. 311.45 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  16657. 311.45 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  16658. 311.45 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  16659. 311.45 s [algebraic-graphs]
  16660. 311.45 s [algebraic-graphs] ============ AdjacencyIntMap.edges ============
  16661. 311.45 s [algebraic-graphs] OK: edges [] == empty
  16662. 311.45 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  16663. 311.45 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  16664. 311.45 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  16665. 311.45 s [algebraic-graphs]
  16666. 311.45 s [algebraic-graphs] ============ AdjacencyIntMap.overlays ============
  16667. 311.45 s [algebraic-graphs] OK: overlays [] == empty
  16668. 311.45 s [algebraic-graphs] OK: overlays [x] == x
  16669. 311.45 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  16670. 311.45 s [algebraic-graphs] OK: overlays == foldr overlay empty
  16671. 311.45 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  16672. 311.45 s [algebraic-graphs]
  16673. 311.45 s [algebraic-graphs] ============ AdjacencyIntMap.connects ============
  16674. 311.45 s [algebraic-graphs] OK: connects [] == empty
  16675. 311.45 s [algebraic-graphs] OK: connects [x] == x
  16676. 311.45 s [algebraic-graphs] OK: connects [x,y] == connect x y
  16677. 311.45 s [algebraic-graphs] OK: connects == foldr connect empty
  16678. 311.45 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  16679. 311.45 s [algebraic-graphs]
  16680. 311.45 s [algebraic-graphs] ============ AdjacencyIntMap.fromAdjacencyIntSets ============
  16681. 311.45 s [algebraic-graphs] OK: fromAdjacencyIntSets [] == empty
  16682. 311.45 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.empty)] == vertex x
  16683. 311.45 s [algebraic-graphs] OK: fromAdjacencyIntSets [(x, IntSet.singleton y)] == edge x y
  16684. 311.45 s [algebraic-graphs] OK: fromAdjacencyIntSets . map (fmap IntSet.fromList) == stars
  16685. 311.45 s [algebraic-graphs] OK: overlay (fromAdjacencyIntSets xs) (fromAdjacencyIntSets ys) == fromAdjacencyIntSets (xs ++ ys)
  16686. 311.45 s [algebraic-graphs]
  16687. 311.45 s [algebraic-graphs] ============ AdjacencyIntMap.isSubgraphOf ============
  16688. 311.45 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  16689. 311.45 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  16690. 311.45 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  16691. 311.45 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  16692. 311.45 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  16693. 311.45 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  16694. 311.45 s [algebraic-graphs]
  16695. 311.45 s [algebraic-graphs] ============ AdjacencyIntMap.toGraph et al. ============
  16696. 311.45 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  16697. 311.45 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  16698. 311.45 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  16699. 311.45 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  16700. 311.45 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  16701. 311.45 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  16702. 311.45 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  16703. 311.45 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  16704. 311.45 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  16705. 311.45 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  16706. 311.45 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  16707. 311.45 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  16708. 311.45 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  16709. 311.45 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  16710. 311.45 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  16711. 311.45 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  16712. 311.45 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  16713. 311.45 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  16714. 311.45 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  16715. 311.45 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  16716. 311.45 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  16717. 311.45 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  16718. 311.45 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  16719. 311.45 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  16720. 311.45 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  16721. 311.45 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  16722. 311.45 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  16723. 311.45 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  16724. 311.45 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  16725. 311.45 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  16726. 311.45 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  16727. 311.45 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  16728. 311.45 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  16729. 311.45 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  16730. 312.08 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  16731. 312.08 s [algebraic-graphs]
  16732. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.foldg ============
  16733. 312.08 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  16734. 312.08 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  16735. 312.08 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  16736. 312.08 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  16737. 312.08 s [algebraic-graphs]
  16738. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.isEmpty ============
  16739. 312.08 s [algebraic-graphs] OK: isEmpty empty == True
  16740. 312.08 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  16741. 312.08 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  16742. 312.08 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  16743. 312.08 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  16744. 312.08 s [algebraic-graphs]
  16745. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.hasVertex ============
  16746. 312.08 s [algebraic-graphs] OK: hasVertex x empty == False
  16747. 312.08 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  16748. 312.08 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  16749. 312.08 s [algebraic-graphs]
  16750. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.hasEdge ============
  16751. 312.08 s [algebraic-graphs] OK: hasEdge x y empty == False
  16752. 312.08 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  16753. 312.08 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  16754. 312.08 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  16755. 312.08 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  16756. 312.08 s [algebraic-graphs]
  16757. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.vertexCount ============
  16758. 312.08 s [algebraic-graphs] OK: vertexCount empty == 0
  16759. 312.08 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  16760. 312.08 s [algebraic-graphs] OK: vertexCount == length . vertexList
  16761. 312.08 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  16762. 312.08 s [algebraic-graphs]
  16763. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.edgeCount ============
  16764. 312.08 s [algebraic-graphs] OK: edgeCount empty == 0
  16765. 312.08 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  16766. 312.08 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  16767. 312.08 s [algebraic-graphs] OK: edgeCount == length . edgeList
  16768. 312.08 s [algebraic-graphs]
  16769. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.vertexList ============
  16770. 312.08 s [algebraic-graphs] OK: vertexList empty == []
  16771. 312.08 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  16772. 312.08 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  16773. 312.08 s [algebraic-graphs]
  16774. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.vertexSet ============
  16775. 312.08 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  16776. 312.08 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  16777. 312.08 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  16778. 312.08 s [algebraic-graphs]
  16779. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.vertexIntSet ============
  16780. 312.08 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  16781. 312.08 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  16782. 312.08 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  16783. 312.08 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  16784. 312.08 s [algebraic-graphs]
  16785. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.edgeList ============
  16786. 312.08 s [algebraic-graphs] OK: edgeList empty == []
  16787. 312.08 s [algebraic-graphs] OK: edgeList (vertex x) == []
  16788. 312.08 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  16789. 312.08 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  16790. 312.08 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  16791. 312.08 s [algebraic-graphs]
  16792. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.edgeSet ============
  16793. 312.08 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  16794. 312.08 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  16795. 312.08 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  16796. 312.08 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  16797. 312.08 s [algebraic-graphs]
  16798. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.adjacencyList ============
  16799. 312.08 s [algebraic-graphs] OK: adjacencyList empty == []
  16800. 312.08 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  16801. 312.08 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  16802. 312.08 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  16803. 312.08 s [algebraic-graphs]
  16804. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.preSet ============
  16805. 312.08 s [algebraic-graphs] OK: preSet x empty == Set.empty
  16806. 312.08 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  16807. 312.08 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  16808. 312.08 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  16809. 312.08 s [algebraic-graphs]
  16810. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.preIntSet ============
  16811. 312.08 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  16812. 312.08 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  16813. 312.08 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  16814. 312.08 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  16815. 312.08 s [algebraic-graphs]
  16816. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.postSet ============
  16817. 312.08 s [algebraic-graphs] OK: postSet x empty == Set.empty
  16818. 312.08 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  16819. 312.08 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  16820. 312.08 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  16821. 312.08 s [algebraic-graphs]
  16822. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.postIntSet ============
  16823. 312.08 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  16824. 312.08 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  16825. 312.08 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  16826. 312.08 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  16827. 312.08 s [algebraic-graphs]
  16828. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.path ============
  16829. 312.08 s [algebraic-graphs] OK: path [] == empty
  16830. 312.08 s [algebraic-graphs] OK: path [x] == vertex x
  16831. 312.08 s [algebraic-graphs] OK: path [x,y] == edge x y
  16832. 312.08 s [algebraic-graphs]
  16833. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.circuit ============
  16834. 312.08 s [algebraic-graphs] OK: circuit [] == empty
  16835. 312.08 s [algebraic-graphs] OK: circuit [x] == edge x x
  16836. 312.08 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  16837. 312.08 s [algebraic-graphs]
  16838. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.clique ============
  16839. 312.08 s [algebraic-graphs] OK: clique [] == empty
  16840. 312.08 s [algebraic-graphs] OK: clique [x] == vertex x
  16841. 312.08 s [algebraic-graphs] OK: clique [x,y] == edge x y
  16842. 312.08 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  16843. 312.08 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  16844. 312.08 s [algebraic-graphs]
  16845. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.biclique ============
  16846. 312.08 s [algebraic-graphs] OK: biclique [] [] == empty
  16847. 312.08 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  16848. 312.08 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  16849. 312.08 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  16850. 312.08 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  16851. 312.08 s [algebraic-graphs]
  16852. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.star ============
  16853. 312.08 s [algebraic-graphs] OK: star x [] == vertex x
  16854. 312.08 s [algebraic-graphs] OK: star x [y] == edge x y
  16855. 312.08 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  16856. 312.08 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  16857. 312.08 s [algebraic-graphs]
  16858. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.stars ============
  16859. 312.08 s [algebraic-graphs] OK: stars [] == empty
  16860. 312.08 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  16861. 312.08 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  16862. 312.08 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  16863. 312.08 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  16864. 312.08 s [algebraic-graphs] OK: stars . adjacencyList == id
  16865. 312.08 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  16866. 312.08 s [algebraic-graphs]
  16867. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.tree ============
  16868. 312.08 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  16869. 312.08 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  16870. 312.08 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  16871. 312.08 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  16872. 312.08 s [algebraic-graphs]
  16873. 312.08 s [algebraic-graphs] ============ AdjacencyIntMap.forest ============
  16874. 312.08 s [algebraic-graphs] OK: forest [] == empty
  16875. 312.08 s [algebraic-graphs] OK: forest [x] == tree x
  16876. 312.08 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  16877. 312.08 s [algebraic-graphs] OK: forest == overlays . map tree
  16878. 312.08 s [algebraic-graphs]
  16879. 312.09 s [algebraic-graphs] ============ AdjacencyIntMap.removeVertex ============
  16880. 312.09 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  16881. 312.09 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  16882. 312.09 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  16883. 312.09 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  16884. 312.09 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  16885. 312.09 s [algebraic-graphs]
  16886. 312.09 s [algebraic-graphs] ============ AdjacencyIntMap.removeEdge ============
  16887. 312.09 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  16888. 312.09 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  16889. 312.09 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  16890. 312.09 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  16891. 312.09 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  16892. 312.09 s [algebraic-graphs]
  16893. 312.09 s [algebraic-graphs] ============ AdjacencyIntMap.replaceVertex ============
  16894. 312.09 s [algebraic-graphs] OK: replaceVertex x x == id
  16895. 312.09 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  16896. 312.09 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  16897. 312.09 s [algebraic-graphs]
  16898. 312.09 s [algebraic-graphs] ============ AdjacencyIntMap.mergeVertices ============
  16899. 312.09 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  16900. 312.09 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  16901. 312.09 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  16902. 312.09 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  16903. 312.09 s [algebraic-graphs]
  16904. 312.09 s [algebraic-graphs] ============ AdjacencyIntMap.transpose ============
  16905. 312.09 s [algebraic-graphs] OK: transpose empty == empty
  16906. 312.09 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  16907. 312.09 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  16908. 312.09 s [algebraic-graphs] OK: transpose . transpose == id
  16909. 312.09 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  16910. 312.09 s [algebraic-graphs]
  16911. 312.09 s [algebraic-graphs] ============ AdjacencyIntMap.gmap ============
  16912. 312.09 s [algebraic-graphs] OK: gmap f empty == empty
  16913. 312.09 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  16914. 312.09 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  16915. 312.09 s [algebraic-graphs] OK: gmap id == id
  16916. 312.09 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  16917. 312.09 s [algebraic-graphs]
  16918. 312.09 s [algebraic-graphs] ============ AdjacencyIntMap.induce ============
  16919. 312.09 s [algebraic-graphs] OK: induce (const True ) x == x
  16920. 312.09 s [algebraic-graphs] OK: induce (const False) x == empty
  16921. 312.09 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  16922. 312.09 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  16923. 312.09 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  16924. 312.09 s [algebraic-graphs]
  16925. 312.09 s [algebraic-graphs] ============ AdjacencyIntMap.compose ============
  16926. 312.09 s [algebraic-graphs] OK: compose empty x == empty
  16927. 312.09 s [algebraic-graphs] OK: compose x empty == empty
  16928. 312.09 s [algebraic-graphs] OK: compose (vertex x) y == empty
  16929. 312.09 s [algebraic-graphs] OK: compose x (vertex y) == empty
  16930. 312.09 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  16931. 312.09 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  16932. 312.29 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  16933. 312.29 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  16934. 312.29 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  16935. 312.29 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  16936. 312.29 s [algebraic-graphs]
  16937. 312.29 s [algebraic-graphs] ============ AdjacencyIntMap.closure ============
  16938. 312.29 s [algebraic-graphs] OK: closure empty == empty
  16939. 312.29 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  16940. 312.29 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  16941. 312.29 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  16942. 312.29 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  16943. 312.29 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  16944. 312.29 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  16945. 312.29 s [algebraic-graphs] OK: closure . closure == closure
  16946. 312.29 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  16947. 312.29 s [algebraic-graphs]
  16948. 312.29 s [algebraic-graphs] ============ AdjacencyIntMap.reflexiveClosure ============
  16949. 312.29 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  16950. 312.29 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  16951. 312.29 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  16952. 312.29 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  16953. 312.29 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  16954. 312.29 s [algebraic-graphs]
  16955. 312.29 s [algebraic-graphs] ============ AdjacencyIntMap.symmetricClosure ============
  16956. 312.29 s [algebraic-graphs] OK: symmetricClosure empty == empty
  16957. 312.29 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  16958. 312.29 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  16959. 312.29 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  16960. 312.29 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  16961. 312.29 s [algebraic-graphs]
  16962. 312.29 s [algebraic-graphs] ============ AdjacencyIntMap.transitiveClosure ============
  16963. 312.29 s [algebraic-graphs] OK: transitiveClosure empty == empty
  16964. 312.29 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  16965. 312.29 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  16966. 312.29 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  16967. 312.29 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  16968. 312.29 s [algebraic-graphs]
  16969. 312.29 s [algebraic-graphs] ============ AdjacencyIntMap.bfsForest ============
  16970. 312.29 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  16971. 312.29 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  16972. 312.29 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  16973. 312.29 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  16974. 312.29 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  16975. 312.29 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  16976. 312.29 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  16977. 312.29 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  16978. 312.29 s [algebraic-graphs] OK: bfsForest x [] == []
  16979. 312.29 s [algebraic-graphs] OK: bfsForest empty vs == []
  16980. 312.29 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  16981. 312.29 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  16982. 312.29 s [algebraic-graphs]
  16983. 312.29 s [algebraic-graphs] ============ AdjacencyIntMap.bfs ============
  16984. 312.29 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  16985. 312.29 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  16986. 312.29 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  16987. 312.29 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  16988. 312.29 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  16989. 312.29 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  16990. 312.29 s [algebraic-graphs] OK: bfs empty vs == []
  16991. 312.29 s [algebraic-graphs] OK: bfs x [] == []
  16992. 312.29 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  16993. 312.29 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  16994. 312.29 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  16995. 312.29 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  16996. 312.29 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  16997. 312.29 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  16998. 312.29 s [algebraic-graphs]
  16999. 312.29 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForest ============
  17000. 312.29 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  17001. 312.29 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  17002. 312.29 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  17003. 312.29 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  17004. 312.29 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  17005. 312.29 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  17006. 312.29 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  17007. 312.29 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  17008. 312.29 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  17009. 312.29 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  17010. 312.29 s [algebraic-graphs]
  17011. 312.29 s [algebraic-graphs] ============ AdjacencyIntMap.dfsForestFrom ============
  17012. 312.29 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  17013. 312.29 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  17014. 312.29 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  17015. 312.29 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  17016. 312.29 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  17017. 312.29 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  17018. 312.29 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  17019. 312.29 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  17020. 312.29 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  17021. 312.29 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  17022. 312.29 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  17023. 312.29 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  17024. 312.29 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  17025. 312.29 s [algebraic-graphs]
  17026. 312.29 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  17027. 312.29 s [algebraic-graphs] OK: dfs empty vs == []
  17028. 312.29 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  17029. 312.29 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  17030. 312.29 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  17031. 312.29 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  17032. 312.29 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  17033. 312.29 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  17034. 312.29 s [algebraic-graphs] OK: dfs x [] == []
  17035. 312.29 s [algebraic-graphs]
  17036. 312.29 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  17037. 312.29 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  17038. 312.29 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  17039. 312.29 s [algebraic-graphs]
  17040. 312.29 s [algebraic-graphs] ============ AdjacencyIntMap.dfs ============
  17041. 312.29 s [algebraic-graphs] OK: reachable empty x == []
  17042. 312.29 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  17043. 312.29 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  17044. 312.29 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  17045. 312.29 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  17046. 312.29 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  17047. 312.29 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  17048. 312.29 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  17049. 312.29 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  17050. 312.29 s [algebraic-graphs]
  17051. 312.29 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  17052. 312.29 s [algebraic-graphs]
  17053. 312.29 s [algebraic-graphs] ============ AdjacencyIntMap.topSort ============
  17054. 312.29 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  17055. 312.29 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  17056. 312.29 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  17057. 312.29 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  17058. 312.29 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  17059. 312.29 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  17060. 312.29 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  17061. 312.29 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  17062. 312.29 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  17063. 312.29 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  17064. 312.29 s [algebraic-graphs]
  17065. 312.29 s [algebraic-graphs] ============ AdjacencyIntMap.testIsAcyclic ============
  17066. 312.29 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  17067. 312.29 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  17068. 312.29 s [algebraic-graphs] OK: isAcyclic . circuit == null
  17069. 312.29 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  17070. 312.29 s [algebraic-graphs]
  17071. 312.29 s [algebraic-graphs] ============ AdjacencyIntMap.isDfsForestOf ============
  17072. 312.29 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  17073. 312.29 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  17074. 312.29 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  17075. 312.29 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  17076. 312.29 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  17077. 312.29 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  17078. 312.29 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  17079. 312.29 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  17080. 312.29 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  17081. 312.29 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  17082. 312.29 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  17083. 312.29 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  17084. 312.29 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  17085. 316.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  17086. 316.10 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  17087. 316.24 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  17088. 316.24 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  17089. 316.24 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  17090. 316.24 s [algebraic-graphs]
  17091. 316.24 s [algebraic-graphs] ============ AdjacencyIntMap.isTopSortOf ============
  17092. 316.24 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  17093. 316.24 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  17094. 316.24 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  17095. 316.24 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  17096. 316.24 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  17097. 316.24 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  17098. 316.24 s [algebraic-graphs]
  17099. 316.24 s [algebraic-graphs] ============ AdjacencyMap ============
  17100. 316.24 s [algebraic-graphs] OK: Axioms of graphs
  17101. 316.24 s [algebraic-graphs]
  17102. 316.24 s [algebraic-graphs] ============ AdjacencyMap.consistent ============
  17103. 316.24 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  17104. 316.24 s [algebraic-graphs]
  17105. 316.24 s [algebraic-graphs] OK: consistent empty == True
  17106. 316.24 s [algebraic-graphs] OK: consistent (vertex x) == True
  17107. 316.24 s [algebraic-graphs] OK: consistent (overlay x y) == True
  17108. 316.24 s [algebraic-graphs] OK: consistent (connect x y) == True
  17109. 316.24 s [algebraic-graphs] OK: consistent (edge x y) == True
  17110. 316.24 s [algebraic-graphs] OK: consistent (edges xs) == True
  17111. 316.24 s [algebraic-graphs] OK: consistent (stars xs) == True
  17112. 316.24 s [algebraic-graphs]
  17113. 316.24 s [algebraic-graphs] ============ AdjacencyMap.Show ============
  17114. 316.24 s [algebraic-graphs] OK: show (empty ) == "empty"
  17115. 316.24 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  17116. 316.24 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  17117. 316.24 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  17118. 316.24 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  17119. 316.24 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  17120. 316.24 s [algebraic-graphs]
  17121. 316.24 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  17122. 316.24 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  17123. 316.24 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  17124. 316.24 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  17125. 316.24 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  17126. 316.24 s [algebraic-graphs]
  17127. 316.24 s [algebraic-graphs] ============ AdjacencyMap.Ord ============
  17128. 316.24 s [algebraic-graphs] OK: vertex 1 < vertex 2
  17129. 316.24 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  17130. 316.24 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  17131. 316.24 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  17132. 316.24 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  17133. 316.24 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  17134. 316.24 s [algebraic-graphs] OK: x <= x + y
  17135. 316.24 s [algebraic-graphs] OK: x + y <= x * y
  17136. 316.24 s [algebraic-graphs]
  17137. 316.24 s [algebraic-graphs] ============ AdjacencyMap.empty ============
  17138. 316.24 s [algebraic-graphs] OK: isEmpty empty == True
  17139. 316.24 s [algebraic-graphs] OK: hasVertex x empty == False
  17140. 316.24 s [algebraic-graphs] OK: vertexCount empty == 0
  17141. 316.24 s [algebraic-graphs] OK: edgeCount empty == 0
  17142. 316.24 s [algebraic-graphs]
  17143. 316.24 s [algebraic-graphs] ============ AdjacencyMap.vertex ============
  17144. 316.24 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17145. 316.24 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17146. 316.24 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17147. 316.24 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17148. 316.24 s [algebraic-graphs]
  17149. 316.24 s [algebraic-graphs] ============ AdjacencyMap.edge ============
  17150. 316.24 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  17151. 316.24 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17152. 316.24 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17153. 316.24 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  17154. 316.24 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  17155. 316.24 s [algebraic-graphs]
  17156. 316.24 s [algebraic-graphs] ============ AdjacencyMap.overlay ============
  17157. 316.24 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  17158. 316.24 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  17159. 316.24 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  17160. 316.24 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  17161. 316.24 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  17162. 316.24 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  17163. 316.24 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  17164. 316.24 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  17165. 316.24 s [algebraic-graphs]
  17166. 316.24 s [algebraic-graphs] ============ AdjacencyMap.connect ============
  17167. 316.24 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  17168. 316.24 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  17169. 316.24 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  17170. 316.24 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  17171. 316.24 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  17172. 316.24 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  17173. 316.24 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  17174. 316.24 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  17175. 316.24 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  17176. 316.24 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  17177. 316.24 s [algebraic-graphs]
  17178. 316.24 s [algebraic-graphs] ============ AdjacencyMap.vertices ============
  17179. 316.24 s [algebraic-graphs] OK: vertices [] == empty
  17180. 316.24 s [algebraic-graphs] OK: vertices [x] == vertex x
  17181. 316.24 s [algebraic-graphs] OK: vertices == overlays . map vertex
  17182. 316.24 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  17183. 316.24 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  17184. 316.24 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17185. 316.24 s [algebraic-graphs]
  17186. 316.24 s [algebraic-graphs] ============ AdjacencyMap.edges ============
  17187. 316.24 s [algebraic-graphs] OK: edges [] == empty
  17188. 316.24 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  17189. 316.24 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  17190. 316.24 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  17191. 316.24 s [algebraic-graphs]
  17192. 316.24 s [algebraic-graphs] ============ AdjacencyMap.overlays ============
  17193. 316.24 s [algebraic-graphs] OK: overlays [] == empty
  17194. 316.24 s [algebraic-graphs] OK: overlays [x] == x
  17195. 316.24 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  17196. 316.24 s [algebraic-graphs] OK: overlays == foldr overlay empty
  17197. 316.24 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  17198. 316.24 s [algebraic-graphs]
  17199. 316.25 s [algebraic-graphs] ============ AdjacencyMap.connects ============
  17200. 316.25 s [algebraic-graphs] OK: connects [] == empty
  17201. 316.25 s [algebraic-graphs] OK: connects [x] == x
  17202. 316.25 s [algebraic-graphs] OK: connects [x,y] == connect x y
  17203. 316.25 s [algebraic-graphs] OK: connects == foldr connect empty
  17204. 316.25 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  17205. 316.25 s [algebraic-graphs]
  17206. 316.25 s [algebraic-graphs] ============ AdjacencyMap.fromAdjacencySets ============
  17207. 316.25 s [algebraic-graphs] OK: fromAdjacencySets [] == empty
  17208. 316.25 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.empty)] == vertex x
  17209. 316.25 s [algebraic-graphs] OK: fromAdjacencySets [(x, Set.singleton y)] == edge x y
  17210. 316.25 s [algebraic-graphs] OK: fromAdjacencySets . map (fmap Set.fromList) == stars
  17211. 316.25 s [algebraic-graphs] OK: overlay (fromAdjacencySets xs) (fromAdjacencySets ys) == fromAdjacencySets (xs ++ ys)
  17212. 316.25 s [algebraic-graphs]
  17213. 316.25 s [algebraic-graphs] ============ AdjacencyMap.isSubgraphOf ============
  17214. 316.25 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  17215. 316.25 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  17216. 316.25 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  17217. 316.25 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  17218. 316.25 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  17219. 316.25 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  17220. 316.25 s [algebraic-graphs]
  17221. 316.25 s [algebraic-graphs] ============ AdjacencyMap.toGraph et al. ============
  17222. 316.25 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  17223. 316.25 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  17224. 316.25 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  17225. 316.25 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  17226. 316.25 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  17227. 316.25 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  17228. 316.25 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  17229. 316.25 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  17230. 316.25 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  17231. 316.25 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  17232. 316.25 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  17233. 316.25 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  17234. 316.25 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  17235. 316.25 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  17236. 316.25 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  17237. 316.25 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  17238. 316.25 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  17239. 316.25 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  17240. 316.25 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  17241. 316.25 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  17242. 316.25 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  17243. 316.25 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  17244. 316.25 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  17245. 316.25 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  17246. 316.25 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  17247. 316.25 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  17248. 316.25 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  17249. 316.25 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  17250. 316.25 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17251. 316.25 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  17252. 316.25 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  17253. 316.25 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  17254. 316.25 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  17255. 317.56 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  17256. 317.56 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  17257. 317.56 s [algebraic-graphs]
  17258. 317.56 s [algebraic-graphs] ============ AdjacencyMap.foldg ============
  17259. 317.56 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  17260. 317.56 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  17261. 317.56 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  17262. 317.56 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  17263. 317.56 s [algebraic-graphs]
  17264. 317.56 s [algebraic-graphs] ============ AdjacencyMap.isEmpty ============
  17265. 317.56 s [algebraic-graphs] OK: isEmpty empty == True
  17266. 317.56 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  17267. 317.56 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17268. 317.56 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  17269. 317.56 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  17270. 317.56 s [algebraic-graphs]
  17271. 317.56 s [algebraic-graphs] ============ AdjacencyMap.hasVertex ============
  17272. 317.56 s [algebraic-graphs] OK: hasVertex x empty == False
  17273. 317.56 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  17274. 317.56 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  17275. 317.56 s [algebraic-graphs]
  17276. 317.56 s [algebraic-graphs] ============ AdjacencyMap.hasEdge ============
  17277. 317.56 s [algebraic-graphs] OK: hasEdge x y empty == False
  17278. 317.56 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17279. 317.56 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17280. 317.56 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  17281. 317.56 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17282. 317.56 s [algebraic-graphs]
  17283. 317.56 s [algebraic-graphs] ============ AdjacencyMap.vertexCount ============
  17284. 317.56 s [algebraic-graphs] OK: vertexCount empty == 0
  17285. 317.56 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17286. 317.56 s [algebraic-graphs] OK: vertexCount == length . vertexList
  17287. 317.56 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  17288. 317.56 s [algebraic-graphs]
  17289. 317.56 s [algebraic-graphs] ============ AdjacencyMap.edgeCount ============
  17290. 317.56 s [algebraic-graphs] OK: edgeCount empty == 0
  17291. 317.56 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17292. 317.56 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17293. 317.56 s [algebraic-graphs] OK: edgeCount == length . edgeList
  17294. 317.56 s [algebraic-graphs]
  17295. 317.56 s [algebraic-graphs] ============ AdjacencyMap.vertexList ============
  17296. 317.56 s [algebraic-graphs] OK: vertexList empty == []
  17297. 317.56 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17298. 317.56 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  17299. 317.56 s [algebraic-graphs]
  17300. 317.56 s [algebraic-graphs] ============ AdjacencyMap.vertexSet ============
  17301. 317.56 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17302. 317.56 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17303. 317.56 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  17304. 317.56 s [algebraic-graphs]
  17305. 317.56 s [algebraic-graphs] ============ AdjacencyMap.vertexIntSet ============
  17306. 317.56 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  17307. 317.56 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  17308. 317.56 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  17309. 317.56 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  17310. 317.56 s [algebraic-graphs]
  17311. 317.56 s [algebraic-graphs] ============ AdjacencyMap.edgeList ============
  17312. 317.56 s [algebraic-graphs] OK: edgeList empty == []
  17313. 317.56 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17314. 317.56 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  17315. 317.56 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  17316. 317.56 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  17317. 317.56 s [algebraic-graphs]
  17318. 317.56 s [algebraic-graphs] ============ AdjacencyMap.edgeSet ============
  17319. 317.56 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17320. 317.56 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17321. 317.56 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  17322. 317.56 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  17323. 317.56 s [algebraic-graphs]
  17324. 317.56 s [algebraic-graphs] ============ AdjacencyMap.adjacencyList ============
  17325. 317.56 s [algebraic-graphs] OK: adjacencyList empty == []
  17326. 317.56 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  17327. 317.56 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  17328. 317.56 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  17329. 317.56 s [algebraic-graphs]
  17330. 317.56 s [algebraic-graphs] ============ AdjacencyMap.preSet ============
  17331. 317.56 s [algebraic-graphs] OK: preSet x empty == Set.empty
  17332. 317.56 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  17333. 317.56 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  17334. 317.56 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  17335. 317.56 s [algebraic-graphs]
  17336. 317.56 s [algebraic-graphs] ============ AdjacencyMap.preIntSet ============
  17337. 317.56 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  17338. 317.56 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  17339. 317.56 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  17340. 317.56 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  17341. 317.56 s [algebraic-graphs]
  17342. 317.56 s [algebraic-graphs] ============ AdjacencyMap.postSet ============
  17343. 317.56 s [algebraic-graphs] OK: postSet x empty == Set.empty
  17344. 317.56 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  17345. 317.56 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  17346. 317.56 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  17347. 317.56 s [algebraic-graphs]
  17348. 317.56 s [algebraic-graphs] ============ AdjacencyMap.postIntSet ============
  17349. 317.56 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  17350. 317.56 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  17351. 317.56 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  17352. 317.56 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  17353. 317.56 s [algebraic-graphs]
  17354. 317.56 s [algebraic-graphs] ============ AdjacencyMap.path ============
  17355. 317.56 s [algebraic-graphs] OK: path [] == empty
  17356. 317.56 s [algebraic-graphs] OK: path [x] == vertex x
  17357. 317.56 s [algebraic-graphs] OK: path [x,y] == edge x y
  17358. 317.56 s [algebraic-graphs]
  17359. 317.56 s [algebraic-graphs] ============ AdjacencyMap.circuit ============
  17360. 317.56 s [algebraic-graphs] OK: circuit [] == empty
  17361. 317.56 s [algebraic-graphs] OK: circuit [x] == edge x x
  17362. 317.56 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  17363. 317.56 s [algebraic-graphs]
  17364. 317.56 s [algebraic-graphs] ============ AdjacencyMap.clique ============
  17365. 317.56 s [algebraic-graphs] OK: clique [] == empty
  17366. 317.56 s [algebraic-graphs] OK: clique [x] == vertex x
  17367. 317.56 s [algebraic-graphs] OK: clique [x,y] == edge x y
  17368. 317.56 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  17369. 317.56 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  17370. 317.56 s [algebraic-graphs]
  17371. 317.56 s [algebraic-graphs] ============ AdjacencyMap.biclique ============
  17372. 317.56 s [algebraic-graphs] OK: biclique [] [] == empty
  17373. 317.56 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  17374. 317.56 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  17375. 317.56 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  17376. 317.56 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  17377. 317.56 s [algebraic-graphs]
  17378. 317.56 s [algebraic-graphs] ============ AdjacencyMap.star ============
  17379. 317.56 s [algebraic-graphs] OK: star x [] == vertex x
  17380. 317.56 s [algebraic-graphs] OK: star x [y] == edge x y
  17381. 317.56 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  17382. 317.56 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  17383. 317.56 s [algebraic-graphs]
  17384. 317.56 s [algebraic-graphs] ============ AdjacencyMap.stars ============
  17385. 317.56 s [algebraic-graphs] OK: stars [] == empty
  17386. 317.56 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  17387. 317.56 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  17388. 317.56 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  17389. 317.56 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  17390. 317.56 s [algebraic-graphs] OK: stars . adjacencyList == id
  17391. 317.56 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  17392. 317.56 s [algebraic-graphs]
  17393. 317.56 s [algebraic-graphs] ============ AdjacencyMap.tree ============
  17394. 317.56 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  17395. 317.56 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  17396. 317.56 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  17397. 317.56 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  17398. 317.56 s [algebraic-graphs]
  17399. 317.56 s [algebraic-graphs] ============ AdjacencyMap.forest ============
  17400. 317.56 s [algebraic-graphs] OK: forest [] == empty
  17401. 317.56 s [algebraic-graphs] OK: forest [x] == tree x
  17402. 317.56 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  17403. 317.56 s [algebraic-graphs] OK: forest == overlays . map tree
  17404. 317.56 s [algebraic-graphs]
  17405. 317.56 s [algebraic-graphs] ============ AdjacencyMap.removeVertex ============
  17406. 317.56 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  17407. 317.56 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  17408. 317.56 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  17409. 317.56 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  17410. 317.56 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  17411. 317.56 s [algebraic-graphs]
  17412. 317.56 s [algebraic-graphs] ============ AdjacencyMap.removeEdge ============
  17413. 317.56 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  17414. 317.56 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  17415. 317.56 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  17416. 317.56 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  17417. 317.56 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  17418. 317.56 s [algebraic-graphs]
  17419. 317.56 s [algebraic-graphs] ============ AdjacencyMap.replaceVertex ============
  17420. 317.56 s [algebraic-graphs] OK: replaceVertex x x == id
  17421. 317.56 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  17422. 317.56 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  17423. 317.56 s [algebraic-graphs]
  17424. 317.56 s [algebraic-graphs] ============ AdjacencyMap.mergeVertices ============
  17425. 317.56 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  17426. 317.56 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  17427. 317.56 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  17428. 317.56 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  17429. 317.56 s [algebraic-graphs]
  17430. 317.56 s [algebraic-graphs] ============ AdjacencyMap.transpose ============
  17431. 317.56 s [algebraic-graphs] OK: transpose empty == empty
  17432. 317.56 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  17433. 317.56 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  17434. 317.56 s [algebraic-graphs] OK: transpose . transpose == id
  17435. 317.56 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  17436. 317.56 s [algebraic-graphs]
  17437. 317.56 s [algebraic-graphs] ============ AdjacencyMap.gmap ============
  17438. 317.56 s [algebraic-graphs] OK: gmap f empty == empty
  17439. 317.56 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  17440. 317.56 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  17441. 317.56 s [algebraic-graphs] OK: gmap id == id
  17442. 317.56 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  17443. 317.56 s [algebraic-graphs]
  17444. 317.56 s [algebraic-graphs] ============ AdjacencyMap.induce ============
  17445. 317.56 s [algebraic-graphs] OK: induce (const True ) x == x
  17446. 317.56 s [algebraic-graphs] OK: induce (const False) x == empty
  17447. 317.56 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  17448. 317.56 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  17449. 317.56 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  17450. 317.56 s [algebraic-graphs]
  17451. 317.56 s [algebraic-graphs] ============ AdjacencyMap.compose ============
  17452. 317.56 s [algebraic-graphs] OK: compose empty x == empty
  17453. 317.56 s [algebraic-graphs] OK: compose x empty == empty
  17454. 317.56 s [algebraic-graphs] OK: compose (vertex x) y == empty
  17455. 317.56 s [algebraic-graphs] OK: compose x (vertex y) == empty
  17456. 317.56 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  17457. 317.56 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  17458. 319.24 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  17459. 319.24 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  17460. 319.24 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  17461. 319.24 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  17462. 319.24 s [algebraic-graphs]
  17463. 319.24 s [algebraic-graphs] ============ AdjacencyMap.closure ============
  17464. 319.24 s [algebraic-graphs] OK: closure empty == empty
  17465. 319.24 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  17466. 319.24 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  17467. 319.24 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  17468. 319.24 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  17469. 319.24 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  17470. 319.24 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  17471. 319.24 s [algebraic-graphs] OK: closure . closure == closure
  17472. 319.24 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  17473. 319.24 s [algebraic-graphs]
  17474. 319.24 s [algebraic-graphs] ============ AdjacencyMap.reflexiveClosure ============
  17475. 319.24 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  17476. 319.24 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  17477. 319.24 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  17478. 319.24 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  17479. 319.24 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  17480. 319.24 s [algebraic-graphs]
  17481. 319.24 s [algebraic-graphs] ============ AdjacencyMap.symmetricClosure ============
  17482. 319.24 s [algebraic-graphs] OK: symmetricClosure empty == empty
  17483. 319.24 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  17484. 319.24 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  17485. 319.24 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  17486. 319.24 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  17487. 319.24 s [algebraic-graphs]
  17488. 319.24 s [algebraic-graphs] ============ AdjacencyMap.transitiveClosure ============
  17489. 319.24 s [algebraic-graphs] OK: transitiveClosure empty == empty
  17490. 319.24 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  17491. 319.24 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  17492. 319.24 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  17493. 319.24 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  17494. 319.24 s [algebraic-graphs]
  17495. 319.24 s [algebraic-graphs] ============ AdjacencyMap.box ============
  17496. 319.24 s [algebraic-graphs] OK: box x y ~~ box y x
  17497. 319.24 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  17498. 319.24 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  17499. 319.24 s [algebraic-graphs] OK: box x empty ~~ empty
  17500. 319.24 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  17501. 319.24 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  17502. 319.24 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  17503. 319.24 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  17504. 319.24 s [algebraic-graphs]
  17505. 319.24 s [algebraic-graphs] ============ AdjacencyMap.bfsForest ============
  17506. 319.24 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0] == empty
  17507. 319.24 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [1] == edge 1 2
  17508. 319.24 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2] == vertex 2
  17509. 319.24 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [0,1,2] == vertices [1,2]
  17510. 319.24 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 2) [2,1,0] == vertices [1,2]
  17511. 319.24 s [algebraic-graphs] OK: forest $ bfsForest (edge 1 1) [1] == vertex 1
  17512. 319.24 s [algebraic-graphs] OK: isSubgraphOf (forest $ bfsForest x vs) x == True
  17513. 319.24 s [algebraic-graphs] OK: bfsForest x (vertexList x) == map ( -> Node v []) (nub $ vertexList x)
  17514. 319.24 s [algebraic-graphs] OK: bfsForest x [] == []
  17515. 319.24 s [algebraic-graphs] OK: bfsForest empty vs == []
  17516. 319.24 s [algebraic-graphs] OK: bfsForest (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  17517. 319.24 s [algebraic-graphs] OK: forest $ bfsForest (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1] + path [3,4,5]
  17518. 319.24 s [algebraic-graphs]
  17519. 319.24 s [algebraic-graphs] ============ AdjacencyMap.bfs ============
  17520. 319.24 s [algebraic-graphs] OK: bfs (edge 1 2) [0] == []
  17521. 319.24 s [algebraic-graphs] OK: bfs (edge 1 2) [1] == [[1], [2]]
  17522. 319.24 s [algebraic-graphs] OK: bfs (edge 1 2) [2] == [[2]]
  17523. 319.24 s [algebraic-graphs] OK: bfs (edge 1 2) [1,2] == [[1,2]]
  17524. 319.24 s [algebraic-graphs] OK: bfs (edge 1 2) [2,1] == [[2,1]]
  17525. 319.24 s [algebraic-graphs] OK: bfs (edge 1 1) [1] == [[1]]
  17526. 319.24 s [algebraic-graphs] OK: bfs empty vs == []
  17527. 319.24 s [algebraic-graphs] OK: bfs x [] == []
  17528. 319.24 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,2] == [[1,2]]
  17529. 319.24 s [algebraic-graphs] OK: bfs (1 * 2 + 3 * 4 + 5 * 6) [1,3] == [[1,3], [2,4]]
  17530. 319.24 s [algebraic-graphs] OK: bfs (3 * (1 + 4) * (1 + 5)) [3] == [[3], [1,4,5]]
  17531. 319.24 s [algebraic-graphs] OK: bfs (circuit [1..5] + circuit [5,4..1]) [2] == [[2], [1,3], [5,4]]
  17532. 319.24 s [algebraic-graphs] OK: concat $ bfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,4,1,5]
  17533. 319.24 s [algebraic-graphs] OK: map concat . transpose . map levels . bfsForest x == bfs x
  17534. 319.24 s [algebraic-graphs]
  17535. 319.24 s [algebraic-graphs] ============ AdjacencyMap.dfsForest ============
  17536. 319.24 s [algebraic-graphs] OK: forest $ dfsForest empty == empty
  17537. 319.24 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 1) == vertex 1
  17538. 319.24 s [algebraic-graphs] OK: forest $ dfsForest (edge 1 2) == edge 1 2
  17539. 319.24 s [algebraic-graphs] OK: forest $ dfsForest (edge 2 1) == vertices [1,2]
  17540. 319.24 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest x) x == True
  17541. 319.24 s [algebraic-graphs] OK: isDfsForestOf (dfsForest x) x == True
  17542. 319.24 s [algebraic-graphs] OK: dfsForest . forest . dfsForest == dfsForest
  17543. 319.24 s [algebraic-graphs] OK: dfsForest (vertices vs) == map (\v -> Node v []) (nub $ sort vs)
  17544. 319.24 s [algebraic-graphs] OK: dfsForest $ 3 * (1 + 4) * (1 + 5) == <correct result>
  17545. 319.24 s [algebraic-graphs] OK: forest (dfsForest $ circuit [1..5] + circuit [5,4..1]) == path [1,2,3,4,5]
  17546. 319.24 s [algebraic-graphs]
  17547. 319.24 s [algebraic-graphs] ============ AdjacencyMap.dfsForestFrom ============
  17548. 319.24 s [algebraic-graphs] OK: forest $ dfsForestFrom empty vs == empty
  17549. 319.24 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 1) [1] == vertex 1
  17550. 319.24 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [0] == empty
  17551. 319.24 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1] == edge 1 2
  17552. 319.24 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2] == vertex 2
  17553. 319.24 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [1,2] == edge 1 2
  17554. 319.24 s [algebraic-graphs] OK: forest $ dfsForestFrom (edge 1 2) [2,1] == vertices [1,2]
  17555. 319.24 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom x vs) x == True
  17556. 319.24 s [algebraic-graphs] OK: isDfsForestOf (dfsForestFrom x (vertexList x)) x == True
  17557. 319.24 s [algebraic-graphs] OK: dfsForestFrom x (vertexList x) == dfsForest x
  17558. 319.24 s [algebraic-graphs] OK: dfsForestFrom x [] == []
  17559. 319.24 s [algebraic-graphs] OK: dfsForestFrom (3 * (1 + 4) * (1 + 5)) [1,4] == <correct result>
  17560. 319.24 s [algebraic-graphs] OK: forest $ dfsForestFrom (circuit [1..5] + circuit [5,4..1]) [3] == path [3,2,1,5,4]
  17561. 319.24 s [algebraic-graphs]
  17562. 319.24 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  17563. 319.24 s [algebraic-graphs] OK: dfs empty vs == []
  17564. 319.24 s [algebraic-graphs] OK: dfs (edge 1 1) [1] == [1]
  17565. 319.24 s [algebraic-graphs] OK: dfs (edge 1 2) [0] == []
  17566. 319.24 s [algebraic-graphs] OK: dfs (edge 1 2) [1] == [1,2]
  17567. 319.24 s [algebraic-graphs] OK: dfs (edge 1 2) [2] == [2]
  17568. 319.24 s [algebraic-graphs] OK: dfs (edge 1 2) [1,2] == [1,2]
  17569. 319.24 s [algebraic-graphs] OK: dfs (edge 1 2) [2,1] == [2,1]
  17570. 319.24 s [algebraic-graphs] OK: dfs x [] == []
  17571. 319.24 s [algebraic-graphs]
  17572. 319.24 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs x vs ] == True
  17573. 319.24 s [algebraic-graphs] OK: dfs (3 * (1 + 4) * (1 + 5)) [1,4] == [1,5,4]
  17574. 319.24 s [algebraic-graphs] OK: dfs (circuit [1..5] + circuit [5,4..1]) [3] == [3,2,1,5,4]
  17575. 319.24 s [algebraic-graphs]
  17576. 319.24 s [algebraic-graphs] ============ AdjacencyMap.dfs ============
  17577. 319.24 s [algebraic-graphs] OK: reachable empty x == []
  17578. 319.24 s [algebraic-graphs] OK: reachable (vertex 1) 1 == [1]
  17579. 319.24 s [algebraic-graphs] OK: reachable (edge 1 1) 1 == [1]
  17580. 319.24 s [algebraic-graphs] OK: reachable (edge 1 2) 0 == []
  17581. 319.24 s [algebraic-graphs] OK: reachable (edge 1 2) 1 == [1,2]
  17582. 319.24 s [algebraic-graphs] OK: reachable (edge 1 2) 2 == [2]
  17583. 319.24 s [algebraic-graphs] OK: reachable (path [1..8] ) 4 == [4..8]
  17584. 319.24 s [algebraic-graphs] OK: reachable (circuit [1..8] ) 4 == [4..8] ++ [1..3]
  17585. 319.24 s [algebraic-graphs] OK: reachable (clique [8,7..1]) 8 == [8] ++ [1..7]
  17586. 319.24 s [algebraic-graphs]
  17587. 319.24 s [algebraic-graphs] OK: and [ hasVertex v x | v <- reachable x y ] == True
  17588. 319.24 s [algebraic-graphs]
  17589. 319.24 s [algebraic-graphs] ============ AdjacencyMap.topSort ============
  17590. 319.24 s [algebraic-graphs] OK: topSort (1 * 2 + 3 * 1) == Right [3,1,2]
  17591. 319.24 s [algebraic-graphs] OK: topSort (path [1..5]) == Right [1..5]
  17592. 319.24 s [algebraic-graphs] OK: topSort (3 * (1 * 4 + 2 * 5)) == Right [3,1,2,4,5]
  17593. 319.24 s [algebraic-graphs] OK: topSort (1 * 2 + 2 * 1) == Left (2 :| [1])
  17594. 319.24 s [algebraic-graphs] OK: topSort (path [5,4..1] + edge 2 4) == Left (4 :| [3,2])
  17595. 319.24 s [algebraic-graphs] OK: topSort (circuit [1..5]) == Left (3 :| [1,2])
  17596. 319.24 s [algebraic-graphs] OK: topSort (circuit [1..3] + circuit [3,2,1]) == Left (3 :| [2])
  17597. 319.24 s [algebraic-graphs] OK: topSort (1 * 2 + (5 + 2) * 1 + 3 * 4 * 3) == Left (1 :| [2])
  17598. 319.24 s [algebraic-graphs] OK: fmap (flip isTopSortOf x) (topSort x) /= Right False
  17599. 319.24 s [algebraic-graphs] OK: topSort . vertices == Right . nub . sort
  17600. 319.24 s [algebraic-graphs]
  17601. 319.24 s [algebraic-graphs] ============ AdjacencyMap.testIsAcyclic ============
  17602. 319.24 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 3 * 1) == True
  17603. 319.24 s [algebraic-graphs] OK: isAcyclic (1 * 2 + 2 * 1) == False
  17604. 319.24 s [algebraic-graphs] OK: isAcyclic . circuit == null
  17605. 319.24 s [algebraic-graphs] OK: isAcyclic == isRight . topSort
  17606. 319.24 s [algebraic-graphs]
  17607. 319.24 s [algebraic-graphs] ============ AdjacencyMap.isDfsForestOf ============
  17608. 319.24 s [algebraic-graphs] OK: isDfsForestOf [] empty == True
  17609. 319.24 s [algebraic-graphs] OK: isDfsForestOf [] (vertex 1) == False
  17610. 319.24 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 1) == True
  17611. 319.24 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (vertex 2) == False
  17612. 319.24 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 1 []] (vertex 1) == False
  17613. 319.24 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 1) == True
  17614. 319.24 s [algebraic-graphs] OK: isDfsForestOf [Node 1 []] (edge 1 2) == False
  17615. 323.73 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (edge 1 2) == False
  17616. 323.73 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (edge 1 2) == True
  17617. 324.22 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (edge 1 2) == True
  17618. 324.22 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 []] (vertices [1,2]) == True
  17619. 324.22 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [], Node 1 []] (vertices [1,2]) == True
  17620. 324.22 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 []]] (vertices [1,2]) == False
  17621. 324.22 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 2 [Node 3 []]]] (path [1,2,3]) == True
  17622. 324.22 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [Node 3 [Node 2 []]]] (path [1,2,3]) == False
  17623. 324.22 s [algebraic-graphs] OK: isDfsForestOf [Node 3 [], Node 1 [Node 2 []]] (path [1,2,3]) == True
  17624. 324.22 s [algebraic-graphs] OK: isDfsForestOf [Node 2 [Node 3 []], Node 1 []] (path [1,2,3]) == True
  17625. 324.22 s [algebraic-graphs] OK: isDfsForestOf [Node 1 [], Node 2 [Node 3 []]] (path [1,2,3]) == False
  17626. 324.22 s [algebraic-graphs]
  17627. 324.22 s [algebraic-graphs] ============ AdjacencyMap.isTopSortOf ============
  17628. 324.22 s [algebraic-graphs] OK: isTopSortOf [3,1,2] (1 * 2 + 3 * 1) == True
  17629. 324.22 s [algebraic-graphs] OK: isTopSortOf [1,2,3] (1 * 2 + 3 * 1) == False
  17630. 324.22 s [algebraic-graphs] OK: isTopSortOf [] (1 * 2 + 3 * 1) == False
  17631. 324.22 s [algebraic-graphs] OK: isTopSortOf [] empty == True
  17632. 324.22 s [algebraic-graphs] OK: isTopSortOf [x] (vertex x) == True
  17633. 324.22 s [algebraic-graphs] OK: isTopSortOf [x] (edge x x) == False
  17634. 324.22 s [algebraic-graphs]
  17635. 324.22 s [algebraic-graphs] ============ AdjacencyMap.induceJust ============
  17636. 324.22 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  17637. 324.22 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  17638. 324.22 s [algebraic-graphs] OK: induceJust . gmap Just == id
  17639. 324.22 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  17640. 324.22 s [algebraic-graphs]
  17641. 324.22 s [algebraic-graphs] ============ AdjacencyMap.scc ============
  17642. 324.22 s [algebraic-graphs] OK: scc empty == empty
  17643. 324.22 s [algebraic-graphs] OK: scc (vertex x) == vertex (NonEmpty.vertex x)
  17644. 324.22 s [algebraic-graphs] OK: scc (vertices xs) == vertices (map NonEmpty.vertex xs)
  17645. 324.22 s [algebraic-graphs] OK: scc (edge 1 1) == vertex (NonEmpty.edge 1 1)
  17646. 324.22 s [algebraic-graphs] OK: scc (edge 1 2) == edge (NonEmpty.vertex 1) (NonEmpty.vertex 2)
  17647. 324.22 s [algebraic-graphs] OK: scc (circuit (1:xs)) == vertex (NonEmpty.circuit1 (1 :| xs))
  17648. 324.22 s [algebraic-graphs] OK: scc (3 * 1 * 4 * 1 * 5) == <correct result>
  17649. 324.22 s [algebraic-graphs] OK: isAcyclic . scc == const True
  17650. 324.22 s [algebraic-graphs] OK: isAcyclic x == (scc x == gmap NonEmpty.vertex x)
  17651. 324.22 s [algebraic-graphs] OK: scc g == KL.scc g
  17652. 324.22 s [algebraic-graphs]
  17653. 324.22 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Num ============
  17654. 324.22 s [algebraic-graphs] OK: 0 == rightVertex 0
  17655. 324.22 s [algebraic-graphs] OK: swap 1 == leftVertex 1
  17656. 324.22 s [algebraic-graphs] OK: swap 1 + 2 == vertices [1] [2]
  17657. 324.22 s [algebraic-graphs] OK: swap 1 * 2 == edge 1 2
  17658. 324.22 s [algebraic-graphs] OK: swap 1 + 2 * swap 3 == overlay (leftVertex 1) (edge 3 2)
  17659. 324.22 s [algebraic-graphs] OK: swap 1 * (2 + swap 3) == connect (leftVertex 1) (vertices [3] [2])
  17660. 324.22 s [algebraic-graphs]
  17661. 324.22 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Show ============
  17662. 324.22 s [algebraic-graphs] OK: show empty == "empty"
  17663. 324.22 s [algebraic-graphs] OK: show 1 == "rightVertex 1"
  17664. 324.22 s [algebraic-graphs] OK: show (swap 2) == "leftVertex 2"
  17665. 324.22 s [algebraic-graphs] OK: show 1 + 2 == "vertices [] [1,2]"
  17666. 324.22 s [algebraic-graphs] OK: show (swap (1 + 2)) == "vertices [1,2] []"
  17667. 324.22 s [algebraic-graphs] OK: show (swap 1 * 2) == "edge 1 2"
  17668. 324.22 s [algebraic-graphs] OK: show (swap 1 * 2 * swap 3) == "edges [(1,2),(3,2)]"
  17669. 324.22 s [algebraic-graphs] OK: show (swap 1 * 2 + swap 3) == "overlay (leftVertex 3) (edge 1 2)"
  17670. 324.22 s [algebraic-graphs]
  17671. 324.22 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Eq ============
  17672. 324.22 s [algebraic-graphs] OK: (x == y) == (leftAdjacencyMap x == leftAdjacencyMap y && rightAdjacencyMap x == rightAdjacencyMap y)
  17673. 324.22 s [algebraic-graphs]
  17674. 324.22 s [algebraic-graphs] OK: x + y == y + x
  17675. 324.22 s [algebraic-graphs] OK: x + (y + z) == (x + y) + z
  17676. 324.22 s [algebraic-graphs] OK: x * empty == x
  17677. 324.22 s [algebraic-graphs] OK: empty * x == x
  17678. 324.22 s [algebraic-graphs] OK: x * y == y * x
  17679. 324.22 s [algebraic-graphs] OK: x * (y * z) == (x * y) * z
  17680. 324.22 s [algebraic-graphs] OK: x * (y + z) == x * y + x * z
  17681. 324.22 s [algebraic-graphs] OK: (x + y) * z == x * z + y * z
  17682. 324.22 s [algebraic-graphs] OK: x * y * z == x * y + x * z + y * z
  17683. 324.22 s [algebraic-graphs] OK: x + empty == x
  17684. 324.22 s [algebraic-graphs] OK: empty + x == x
  17685. 324.22 s [algebraic-graphs] OK: x + x == x
  17686. 324.22 s [algebraic-graphs] OK: x * y + x + y == x * y
  17687. 324.22 s [algebraic-graphs] OK: x * x * x == x * x
  17688. 324.22 s [algebraic-graphs]
  17689. 324.22 s [algebraic-graphs] OK: leftVertex x * leftVertex y == leftVertex x + leftVertex y
  17690. 324.22 s [algebraic-graphs] OK: rightVertex x * rightVertex y == rightVertex x + rightVertex y
  17691. 324.22 s [algebraic-graphs]
  17692. 324.22 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyMap ============
  17693. 324.22 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  17694. 324.22 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  17695. 324.22 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  17696. 324.22 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  17697. 324.22 s [algebraic-graphs]
  17698. 324.22 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyMap ============
  17699. 324.22 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  17700. 324.22 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  17701. 324.22 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  17702. 324.22 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  17703. 324.22 s [algebraic-graphs]
  17704. 324.22 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.empty ============
  17705. 324.22 s [algebraic-graphs] OK: isEmpty empty == True
  17706. 324.22 s [algebraic-graphs] OK: leftAdjacencyMap empty == Map.empty
  17707. 324.22 s [algebraic-graphs] OK: rightAdjacencyMap empty == Map.empty
  17708. 324.22 s [algebraic-graphs] OK: hasVertex x empty == False
  17709. 324.22 s [algebraic-graphs]
  17710. 324.22 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertex ============
  17711. 324.22 s [algebraic-graphs] OK: leftAdjacencyMap (leftVertex x) == Map.singleton x Set.empty
  17712. 324.22 s [algebraic-graphs] OK: rightAdjacencyMap (leftVertex x) == Map.empty
  17713. 324.22 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  17714. 324.22 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  17715. 324.22 s [algebraic-graphs] OK: hasEdge x y (leftVertex z) == False
  17716. 324.22 s [algebraic-graphs]
  17717. 324.22 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertex ============
  17718. 324.22 s [algebraic-graphs] OK: leftAdjacencyMap (rightVertex x) == Map.empty
  17719. 324.22 s [algebraic-graphs] OK: rightAdjacencyMap (rightVertex x) == Map.singleton x Set.empty
  17720. 324.22 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  17721. 324.22 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  17722. 324.22 s [algebraic-graphs] OK: hasEdge x y (rightVertex z) == False
  17723. 324.22 s [algebraic-graphs]
  17724. 324.22 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertex ============
  17725. 324.22 s [algebraic-graphs] OK: vertex . Left == leftVertex
  17726. 324.22 s [algebraic-graphs] OK: vertex . Right == rightVertex
  17727. 324.22 s [algebraic-graphs]
  17728. 324.22 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edge ============
  17729. 324.22 s [algebraic-graphs] OK: edge x y == connect (leftVertex x) (rightVertex y)
  17730. 324.22 s [algebraic-graphs] OK: leftAdjacencyMap (edge x y) == Map.singleton x (Set.singleton y)
  17731. 324.22 s [algebraic-graphs] OK: rightAdjacencyMap (edge x y) == Map.singleton y (Set.singleton x)
  17732. 324.22 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17733. 324.22 s [algebraic-graphs] OK: hasEdge 1 2 (edge 2 1) == False
  17734. 324.22 s [algebraic-graphs]
  17735. 324.22 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlay ============
  17736. 324.22 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  17737. 324.22 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  17738. 324.22 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  17739. 324.22 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  17740. 324.22 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  17741. 324.22 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  17742. 324.23 s [algebraic-graphs]
  17743. 324.23 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connect ============
  17744. 324.23 s [algebraic-graphs] OK: connect (leftVertex x) (leftVertex y) == vertices [x,y] []
  17745. 324.23 s [algebraic-graphs] OK: connect (leftVertex x) (rightVertex y) == edge x y
  17746. 324.23 s [algebraic-graphs] OK: connect (rightVertex x) (leftVertex y) == edge y x
  17747. 324.23 s [algebraic-graphs] OK: connect (rightVertex x) (rightVertex y) == vertices [] [x,y]
  17748. 324.23 s [algebraic-graphs] OK: connect (vertices xs1 ys1) (vertices xs2 ys2) == overlay (biclique xs1 ys2) (biclique xs2 ys1)
  17749. 324.23 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  17750. 324.23 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  17751. 324.23 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  17752. 324.23 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  17753. 324.23 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  17754. 324.23 s [algebraic-graphs] OK: edgeCount (connect x y) >= leftVertexCount x * rightVertexCount y
  17755. 324.23 s [algebraic-graphs] OK: edgeCount (connect x y) <= leftVertexCount x * rightVertexCount y + rightVertexCount x * leftVertexCount y + edgeCount x + edgeCount y
  17756. 324.23 s [algebraic-graphs]
  17757. 324.23 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertices ============
  17758. 324.23 s [algebraic-graphs] OK: vertices [] [] == empty
  17759. 324.23 s [algebraic-graphs] OK: vertices [x] [] == leftVertex x
  17760. 324.23 s [algebraic-graphs] OK: vertices [] [x] == rightVertex x
  17761. 324.23 s [algebraic-graphs] OK: vertices xs ys == overlays (map leftVertex xs ++ map rightVertex ys)
  17762. 324.23 s [algebraic-graphs] OK: hasLeftVertex x (vertices xs ys) == elem x xs
  17763. 324.23 s [algebraic-graphs] OK: hasRightVertex y (vertices xs ys) == elem y ys
  17764. 324.23 s [algebraic-graphs]
  17765. 324.23 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edges ============
  17766. 324.23 s [algebraic-graphs] OK: edges [] == empty
  17767. 324.23 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  17768. 324.23 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  17769. 324.23 s [algebraic-graphs] OK: hasEdge x y . edges == elem (x,y)
  17770. 324.23 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  17771. 324.23 s [algebraic-graphs]
  17772. 324.23 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.overlays ============
  17773. 324.23 s [algebraic-graphs] OK: overlays [] == empty
  17774. 324.23 s [algebraic-graphs] OK: overlays [x] == x
  17775. 324.23 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  17776. 324.23 s [algebraic-graphs] OK: overlays == foldr overlay empty
  17777. 324.23 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  17778. 324.23 s [algebraic-graphs]
  17779. 324.23 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.connects ============
  17780. 324.23 s [algebraic-graphs] OK: connects [] == empty
  17781. 324.23 s [algebraic-graphs] OK: connects [x] == x
  17782. 324.23 s [algebraic-graphs] OK: connects [x,y] == connect x y
  17783. 324.23 s [algebraic-graphs] OK: connects == foldr connect empty
  17784. 324.23 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  17785. 324.23 s [algebraic-graphs]
  17786. 324.23 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.swap ============
  17787. 324.80 s [algebraic-graphs] OK: swap empty == empty
  17788. 324.80 s [algebraic-graphs] OK: swap . leftVertex == rightVertex
  17789. 324.80 s [algebraic-graphs] OK: swap (vertices xs ys) == vertices ys xs
  17790. 324.80 s [algebraic-graphs] OK: swap (edge x y) == edge y x
  17791. 324.80 s [algebraic-graphs] OK: swap . edges == edges . map Data.Tuple.swap
  17792. 324.80 s [algebraic-graphs] OK: swap . swap == id
  17793. 324.80 s [algebraic-graphs]
  17794. 324.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartite ============
  17795. 324.80 s [algebraic-graphs] OK: toBipartite empty == empty
  17796. 324.80 s [algebraic-graphs] OK: toBipartite (vertex (Left x)) == leftVertex x
  17797. 324.80 s [algebraic-graphs] OK: toBipartite (vertex (Right x)) == rightVertex x
  17798. 324.80 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Left y)) == vertices [x,y] []
  17799. 324.80 s [algebraic-graphs] OK: toBipartite (edge (Left x) (Right y)) == edge x y
  17800. 324.80 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Left y)) == edge y x
  17801. 324.80 s [algebraic-graphs] OK: toBipartite (edge (Right x) (Right y)) == vertices [] [x,y]
  17802. 324.80 s [algebraic-graphs] OK: toBipartite . clique == uncurry biclique . partitionEithers
  17803. 324.80 s [algebraic-graphs] OK: toBipartite . fromBipartite == id
  17804. 324.80 s [algebraic-graphs]
  17805. 324.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.toBipartiteWith ============
  17806. 324.80 s [algebraic-graphs] OK: toBipartiteWith f empty == empty
  17807. 324.80 s [algebraic-graphs] OK: toBipartiteWith Left x == vertices (vertexList x) []
  17808. 324.80 s [algebraic-graphs] OK: toBipartiteWith Right x == vertices [] (vertexList x)
  17809. 324.80 s [algebraic-graphs] OK: toBipartiteWith f == toBipartite . gmap f
  17810. 324.80 s [algebraic-graphs] OK: toBipartiteWith id == toBipartite
  17811. 324.80 s [algebraic-graphs]
  17812. 324.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartite ============
  17813. 324.80 s [algebraic-graphs] OK: fromBipartite empty == empty
  17814. 324.80 s [algebraic-graphs] OK: fromBipartite (leftVertex x) == vertex (Left x)
  17815. 324.80 s [algebraic-graphs] OK: fromBipartite (edge x y) == edges [(Left x, Right y), (Right y, Left x)]
  17816. 324.80 s [algebraic-graphs]
  17817. 324.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.fromBipartiteWith ============
  17818. 324.80 s [algebraic-graphs] OK: fromBipartiteWith Left Right == fromBipartite
  17819. 324.80 s [algebraic-graphs] OK: fromBipartiteWith id id (vertices xs ys) == vertices (xs ++ ys)
  17820. 324.80 s [algebraic-graphs] OK: fromBipartiteWith id id . edges == symmetricClosure . edges
  17821. 324.80 s [algebraic-graphs]
  17822. 324.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.isEmpty ============
  17823. 324.80 s [algebraic-graphs] OK: isEmpty empty == True
  17824. 324.80 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  17825. 324.80 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  17826. 324.80 s [algebraic-graphs] OK: isEmpty == (==) empty
  17827. 324.80 s [algebraic-graphs]
  17828. 324.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasLeftVertex ============
  17829. 324.80 s [algebraic-graphs] OK: hasLeftVertex x empty == False
  17830. 324.80 s [algebraic-graphs] OK: hasLeftVertex x (leftVertex y) == (x == y)
  17831. 324.80 s [algebraic-graphs] OK: hasLeftVertex x (rightVertex y) == False
  17832. 324.80 s [algebraic-graphs]
  17833. 324.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasRightVertex ============
  17834. 324.80 s [algebraic-graphs] OK: hasRightVertex x empty == False
  17835. 324.80 s [algebraic-graphs] OK: hasRightVertex x (leftVertex y) == False
  17836. 324.80 s [algebraic-graphs] OK: hasRightVertex x (rightVertex y) == (x == y)
  17837. 324.80 s [algebraic-graphs]
  17838. 324.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasVertex ============
  17839. 324.80 s [algebraic-graphs] OK: hasVertex . Left == hasLeftVertex
  17840. 324.80 s [algebraic-graphs] OK: hasVertex . Right == hasRightVertex
  17841. 324.80 s [algebraic-graphs]
  17842. 324.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.hasEdge ============
  17843. 324.80 s [algebraic-graphs] OK: hasEdge x y empty == False
  17844. 324.80 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  17845. 324.80 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  17846. 324.80 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  17847. 324.80 s [algebraic-graphs]
  17848. 324.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexCount ============
  17849. 324.80 s [algebraic-graphs] OK: leftVertexCount empty == 0
  17850. 324.80 s [algebraic-graphs] OK: leftVertexCount (leftVertex x) == 1
  17851. 324.80 s [algebraic-graphs] OK: leftVertexCount (rightVertex x) == 0
  17852. 324.80 s [algebraic-graphs] OK: leftVertexCount (edge x y) == 1
  17853. 324.80 s [algebraic-graphs] OK: leftVertexCount . edges == length . nub . map fst
  17854. 324.80 s [algebraic-graphs]
  17855. 324.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexCount ============
  17856. 324.80 s [algebraic-graphs] OK: rightVertexCount empty == 0
  17857. 324.80 s [algebraic-graphs] OK: rightVertexCount (leftVertex x) == 0
  17858. 324.80 s [algebraic-graphs] OK: rightVertexCount (rightVertex x) == 1
  17859. 324.80 s [algebraic-graphs] OK: rightVertexCount (edge x y) == 1
  17860. 324.80 s [algebraic-graphs] OK: rightVertexCount . edges == length . nub . map snd
  17861. 324.80 s [algebraic-graphs]
  17862. 324.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexCount ============
  17863. 324.80 s [algebraic-graphs] OK: vertexCount empty == 0
  17864. 324.80 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  17865. 324.80 s [algebraic-graphs] OK: vertexCount (edge x y) == 2
  17866. 324.80 s [algebraic-graphs] OK: vertexCount x == leftVertexCount x + rightVertexCount x
  17867. 324.80 s [algebraic-graphs]
  17868. 324.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeCount ============
  17869. 324.80 s [algebraic-graphs] OK: edgeCount empty == 0
  17870. 324.80 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  17871. 324.80 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  17872. 324.80 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  17873. 324.80 s [algebraic-graphs]
  17874. 324.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexList ============
  17875. 324.80 s [algebraic-graphs] OK: leftVertexList empty == []
  17876. 324.80 s [algebraic-graphs] OK: leftVertexList (leftVertex x) == [x]
  17877. 324.80 s [algebraic-graphs] OK: leftVertexList (rightVertex x) == []
  17878. 324.80 s [algebraic-graphs] OK: leftVertexList . flip vertices [] == nub . sort
  17879. 324.80 s [algebraic-graphs]
  17880. 324.80 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexList ============
  17881. 324.80 s [algebraic-graphs] OK: rightVertexList empty == []
  17882. 324.80 s [algebraic-graphs] OK: rightVertexList (leftVertex x) == []
  17883. 324.80 s [algebraic-graphs] OK: rightVertexList (rightVertex x) == [x]
  17884. 324.80 s [algebraic-graphs] OK: rightVertexList . vertices [] == nub . sort
  17885. 324.80 s [algebraic-graphs]
  17886. 324.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexList ============
  17887. 324.81 s [algebraic-graphs] OK: vertexList empty == []
  17888. 324.81 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  17889. 324.81 s [algebraic-graphs] OK: vertexList (edge x y) == [Left x, Right y]
  17890. 324.81 s [algebraic-graphs] OK: vertexList (vertices (lefts xs) (rights xs)) == nub (sort xs)
  17891. 324.81 s [algebraic-graphs]
  17892. 324.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeList ============
  17893. 324.81 s [algebraic-graphs] OK: edgeList empty == []
  17894. 324.81 s [algebraic-graphs] OK: edgeList (vertex x) == []
  17895. 324.81 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  17896. 324.81 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  17897. 324.81 s [algebraic-graphs]
  17898. 324.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftVertexSet ============
  17899. 324.81 s [algebraic-graphs] OK: leftVertexSet empty == Set.empty
  17900. 324.81 s [algebraic-graphs] OK: leftVertexSet . leftVertex == Set.singleton
  17901. 324.81 s [algebraic-graphs] OK: leftVertexSet . rightVertex == const Set.empty
  17902. 324.81 s [algebraic-graphs] OK: leftVertexSet . flip vertices [] == Set.fromList
  17903. 324.81 s [algebraic-graphs]
  17904. 324.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightVertexSet ============
  17905. 324.81 s [algebraic-graphs] OK: rightVertexSet empty == Set.empty
  17906. 324.81 s [algebraic-graphs] OK: rightVertexSet . leftVertex == const Set.empty
  17907. 324.81 s [algebraic-graphs] OK: rightVertexSet . rightVertex == Set.singleton
  17908. 324.81 s [algebraic-graphs] OK: rightVertexSet . vertices [] == Set.fromList
  17909. 324.81 s [algebraic-graphs]
  17910. 324.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.vertexSet ============
  17911. 324.81 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  17912. 324.81 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  17913. 324.81 s [algebraic-graphs] OK: vertexSet (edge x y) == Set.fromList [Left x, Right y]
  17914. 324.81 s [algebraic-graphs] OK: vertexSet (vertices (lefts xs) (rights xs)) == Set.fromList xs
  17915. 324.81 s [algebraic-graphs]
  17916. 324.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.edgeSet ============
  17917. 324.81 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  17918. 324.81 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  17919. 324.81 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  17920. 324.81 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  17921. 324.81 s [algebraic-graphs]
  17922. 324.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.leftAdjacencyList ============
  17923. 324.81 s [algebraic-graphs] OK: leftAdjacencyList empty == []
  17924. 324.81 s [algebraic-graphs] OK: leftAdjacencyList (vertices [] xs) == []
  17925. 324.81 s [algebraic-graphs] OK: leftAdjacencyList (vertices xs []) == []
  17926. 324.81 s [algebraic-graphs] OK: leftAdjacencyList (edge x y) == [(x, [y])]
  17927. 324.81 s [algebraic-graphs] OK: leftAdjacencyList (star x ys) == [(x, nub (sort ys))]
  17928. 324.81 s [algebraic-graphs]
  17929. 324.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.rightAdjacencyList ============
  17930. 324.81 s [algebraic-graphs] OK: rightAdjacencyList empty == []
  17931. 324.81 s [algebraic-graphs] OK: rightAdjacencyList (vertices [] xs) == [(x, []) | x <- nub (sort xs)]
  17932. 324.81 s [algebraic-graphs] OK: rightAdjacencyList (vertices xs []) == []
  17933. 324.81 s [algebraic-graphs] OK: rightAdjacencyList (edge x y) == [(y, [x])]
  17934. 324.81 s [algebraic-graphs] OK: rightAdjacencyList (star x ys) == [(y, [x]) | y <- nub (sort ys)]
  17935. 324.81 s [algebraic-graphs]
  17936. 324.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.evenList ============
  17937. 324.81 s [algebraic-graphs] OK: evenList [] == Nil
  17938. 324.81 s [algebraic-graphs] OK: evenList [(1,2), (3,4)] == [1, 2, 3, 4] :: List Int Int
  17939. 324.81 s [algebraic-graphs] OK: evenList [(1,'a'), (2,'b')] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' Nil)))
  17940. 324.81 s [algebraic-graphs]
  17941. 324.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.oddList ============
  17942. 324.81 s [algebraic-graphs] OK: oddList 1 [] == Cons 1 Nil
  17943. 324.81 s [algebraic-graphs] OK: oddList 1 [(2,3), (4,5)] == [1, 2, 3, 4, 5] :: List Int Int
  17944. 324.81 s [algebraic-graphs] OK: oddList 1 [('a',2), ('b',3)] == Cons 1 (Cons 'a' (Cons 2 (Cons 'b' (Cons 3 Nil))))
  17945. 324.81 s [algebraic-graphs]
  17946. 324.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.path ============
  17947. 324.81 s [algebraic-graphs] OK: path Nil == empty
  17948. 324.81 s [algebraic-graphs] OK: path (Cons x Nil) == leftVertex x
  17949. 324.81 s [algebraic-graphs] OK: path (Cons x (Cons y Nil)) == edge x y
  17950. 324.81 s [algebraic-graphs] OK: path [1, 2, 3, 4, 5] == edges [(1,2), (3,2), (3,4), (5,4)]
  17951. 324.81 s [algebraic-graphs]
  17952. 324.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.circuit ============
  17953. 324.81 s [algebraic-graphs] OK: circuit [] == empty
  17954. 324.81 s [algebraic-graphs] OK: circuit [(x,y)] == edge x y
  17955. 324.81 s [algebraic-graphs] OK: circuit [(1,2), (3,4), (5,6)] == edges [(1,2), (3,2), (3,4), (5,4), (5,6), (1,6)]
  17956. 324.81 s [algebraic-graphs] OK: circuit . reverse == swap . circuit . map Data.Tuple.swap
  17957. 324.81 s [algebraic-graphs]
  17958. 324.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.biclique ============
  17959. 324.81 s [algebraic-graphs] OK: biclique [] [] == empty
  17960. 324.81 s [algebraic-graphs] OK: biclique xs [] == vertices xs []
  17961. 324.81 s [algebraic-graphs] OK: biclique [] ys == vertices [] ys
  17962. 324.81 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs []) (vertices [] ys)
  17963. 324.81 s [algebraic-graphs]
  17964. 324.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.star ============
  17965. 324.81 s [algebraic-graphs] OK: star x [] == leftVertex x
  17966. 324.81 s [algebraic-graphs] OK: star x [y] == edge x y
  17967. 324.81 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  17968. 324.81 s [algebraic-graphs] OK: star x ys == connect (leftVertex x) (vertices [] ys)
  17969. 324.81 s [algebraic-graphs]
  17970. 324.81 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.stars ============
  17971. 324.81 s [algebraic-graphs] OK: stars [] == empty
  17972. 324.81 s [algebraic-graphs] OK: stars [(x, [])] == leftVertex x
  17973. 324.81 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  17974. 324.81 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  17975. 334.16 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  17976. 334.19 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  17977. 334.19 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  17978. 334.19 s [algebraic-graphs]
  17979. 334.19 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.mesh ============
  17980. 334.19 s [algebraic-graphs] OK: mesh xs [] == empty
  17981. 334.19 s [algebraic-graphs] OK: mesh [] ys == empty
  17982. 334.19 s [algebraic-graphs] OK: mesh [x] [y] == leftVertex (x,y)
  17983. 334.19 s [algebraic-graphs] OK: mesh [1,1] ['a','b'] == biclique [(1,'a'), (1,'b')] [(1,'a'), (1,'b')]
  17984. 334.19 s [algebraic-graphs] OK: mesh [1,2] ['a','b'] == biclique [(1,'a'), (2,'b')] [(1,'b'), (2,'a')]
  17985. 334.19 s [algebraic-graphs]
  17986. 334.19 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeLeftVertex ============
  17987. 334.19 s [algebraic-graphs] OK: removeLeftVertex x (leftVertex x) == empty
  17988. 334.19 s [algebraic-graphs] OK: removeLeftVertex 1 (leftVertex 2) == leftVertex 2
  17989. 334.19 s [algebraic-graphs] OK: removeLeftVertex x (rightVertex y) == rightVertex y
  17990. 334.19 s [algebraic-graphs] OK: removeLeftVertex x (edge x y) == rightVertex y
  17991. 334.19 s [algebraic-graphs] OK: removeLeftVertex x . removeLeftVertex x == removeLeftVertex x
  17992. 334.19 s [algebraic-graphs]
  17993. 334.19 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeRightVertex ============
  17994. 334.19 s [algebraic-graphs] OK: removeRightVertex x (rightVertex x) == empty
  17995. 334.19 s [algebraic-graphs] OK: removeRightVertex 1 (rightVertex 2) == rightVertex 2
  17996. 334.19 s [algebraic-graphs] OK: removeRightVertex x (leftVertex y) == leftVertex y
  17997. 334.19 s [algebraic-graphs] OK: removeRightVertex y (edge x y) == leftVertex x
  17998. 334.19 s [algebraic-graphs] OK: removeRightVertex x . removeRightVertex x == removeRightVertex x
  17999. 334.19 s [algebraic-graphs]
  18000. 334.19 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.removeEdge ============
  18001. 334.19 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x] [y]
  18002. 334.19 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18003. 334.19 s [algebraic-graphs] OK: removeEdge x y . removeLeftVertex x == removeLeftVertex x
  18004. 334.19 s [algebraic-graphs] OK: removeEdge x y . removeRightVertex y == removeRightVertex y
  18005. 334.19 s [algebraic-graphs]
  18006. 334.19 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.bimap ============
  18007. 334.19 s [algebraic-graphs] OK: bimap f g empty == empty
  18008. 334.19 s [algebraic-graphs] OK: bimap f g . vertex == vertex . Data.Bifunctor.bimap f g
  18009. 334.19 s [algebraic-graphs] OK: bimap f g (edge x y) == edge (f x) (g y)
  18010. 334.19 s [algebraic-graphs] OK: bimap id id == id
  18011. 334.19 s [algebraic-graphs] OK: bimap f1 g1 . bimap f2 g2 == bimap (f1 . f2) (g1 . g2)
  18012. 334.19 s [algebraic-graphs]
  18013. 334.19 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.box ============
  18014. 334.19 s [algebraic-graphs] OK: box (path [0,1]) (path ['a','b']) == <correct result>
  18015. 334.19 s [algebraic-graphs]
  18016. 334.19 s [algebraic-graphs] OK: box x y ~~ box y x
  18017. 334.19 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18018. 334.19 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18019. 334.19 s [algebraic-graphs] OK: box x (leftVertex ()) ~~ x
  18020. 334.19 s [algebraic-graphs] OK: box x (rightVertex ()) ~~ swap x
  18021. 334.19 s [algebraic-graphs] OK: box x empty ~~ empty
  18022. 334.19 s [algebraic-graphs] OK: vertexCount (box x y) <= vertexCount x * vertexCount y
  18023. 334.19 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  18024. 334.19 s [algebraic-graphs]
  18025. 334.19 s [algebraic-graphs] OK: box == boxWith (,) (,) (,) (,)
  18026. 334.19 s [algebraic-graphs]
  18027. 334.19 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.consistent ============
  18028. 334.19 s [algebraic-graphs] OK: consistent empty == True
  18029. 334.19 s [algebraic-graphs] OK: consistent (vertex x) == True
  18030. 334.19 s [algebraic-graphs] OK: consistent (edge x y) == True
  18031. 334.19 s [algebraic-graphs] OK: consistent (edges x) == True
  18032. 334.19 s [algebraic-graphs] OK: consistent (toBipartite x) == True
  18033. 334.19 s [algebraic-graphs] OK: consistent (swap x) == True
  18034. 334.19 s [algebraic-graphs] OK: consistent (circuit xs) == True
  18035. 334.19 s [algebraic-graphs] OK: consistent (biclique xs ys) == True
  18036. 334.19 s [algebraic-graphs]
  18037. 334.19 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.detectParts ============
  18038. 334.19 s [algebraic-graphs] OK: detectParts empty == Right empty
  18039. 334.19 s [algebraic-graphs] OK: detectParts (vertex 1) == Right (leftVertex 1)
  18040. 334.19 s [algebraic-graphs] OK: detectParts (edge 1 1) == Left [1]
  18041. 334.19 s [algebraic-graphs] OK: detectParts (edge 1 2) == Right (edge 1 2)
  18042. 334.19 s [algebraic-graphs] OK: detectParts (edge 0 (-1)) == Right (edge (-1) 0)
  18043. 334.19 s [algebraic-graphs] OK: detectParts (1 * (2 + 3)) == Right (edges [(1, 2), (1, 3)])
  18044. 334.19 s [algebraic-graphs] OK: detectParts ((1 + 3) * (2 + 4) + 6 * 5) == Right (swap (1 + 3) * (2 + 4) + swap 5 * 6
  18045. 334.19 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) * (5 + 6)) == Left [1, 3, 2, 4, 5]
  18046. 334.19 s [algebraic-graphs] OK: detectParts ((1 + 2) * (3 + 4) + (3 + 4) * 5) == Right (swap (1 + 2) * (3 + 4) + swap 5 * (3 + 4))
  18047. 334.19 s [algebraic-graphs] OK: detectParts (1 * 2 * 3) == Left [2, 3, 1]
  18048. 334.19 s [algebraic-graphs] OK: detectParts ((1 * 3 * 4) + 2 * (1 + 2)) == Left [2]
  18049. 334.19 s [algebraic-graphs] OK: detectParts (clique [1..10]) == Left [1, 2, 3]
  18050. 334.19 s [algebraic-graphs] OK: detectParts (circuit [1..11]) == Left [1..11]
  18051. 334.19 s [algebraic-graphs] OK: detectParts (circuit [1..10]) == Right (circuit [(2 * x - 1, 2 * x) | x <- [1..5]])
  18052. 334.19 s [algebraic-graphs] OK: detectParts (biclique [] xs) == Right (vertices xs [])
  18053. 334.19 s [algebraic-graphs] OK: detectParts (biclique (map Left (x:xs)) (map Right ys)) == Right (biclique (map Left (x:xs)) (map Right ys))
  18054. 334.19 s [algebraic-graphs] OK: isRight (detectParts (star x ys)) == not (elem x ys)
  18055. 334.19 s [algebraic-graphs] OK: isRight (detectParts (fromBipartite (toBipartite x))) == True
  18056. 334.19 s [algebraic-graphs]
  18057. 334.19 s [algebraic-graphs] OK: ((all ((flip Set.member) $ edgeSet $ symmetricClosure x) . edgeSet) <$> detectParts x) /= Right False
  18058. 334.19 s [algebraic-graphs] OK: (Set.map $ fromEither) <$> (vertexSet <$> (detectParts (fromBipartite (toBipartite x)))) == Right (vertexSet x)
  18059. 334.19 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (vertexSet x) . Set.fromList) (const True) (detectParts x)) == True
  18060. 334.19 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap ((flip Set.isSubsetOf) (edgeSet (symmetricClosure x)) . AM.edgeSet . circuit) (const True) (detectParts x)) == True
  18061. 334.19 s [algebraic-graphs] OK: fromEither (Bifunctor.bimap (((==) 1) . ((flip mod) 2) . length) (const True) (detectParts x)) == True
  18062. 334.19 s [algebraic-graphs]
  18063. 334.19 s [algebraic-graphs] ============ Show (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  18064. 334.19 s [algebraic-graphs] OK: show (matching []) == "matching []"
  18065. 334.19 s [algebraic-graphs] OK: show (matching [(2,'a'),(1,'b')]) == "matching [(1,'b'),(2,'a')]"
  18066. 334.19 s [algebraic-graphs]
  18067. 334.19 s [algebraic-graphs] ============ Eq (Bipartite.AdjacencyMap.Algorithm.Matching a b) ============
  18068. 334.19 s [algebraic-graphs] OK: (x == y) == ((pairOfLeft x == pairOfLeft y) && (pairOfRight x == pairOfRight y))
  18069. 334.19 s [algebraic-graphs]
  18070. 334.19 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfLeft ============
  18071. 334.19 s [algebraic-graphs] OK: pairOfLeft (matching []) == Map.empty
  18072. 334.19 s [algebraic-graphs] OK: pairOfLeft (matching [(2,'a'), (1,'b')]) == Map.fromList [(2,'a'), (1,'b')]
  18073. 334.19 s [algebraic-graphs] OK: Map.size . pairOfLeft == Map.size . pairOfRight
  18074. 334.19 s [algebraic-graphs]
  18075. 334.19 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.pairOfRight ============
  18076. 334.19 s [algebraic-graphs] OK: pairOfRight (matching []) == Map.empty
  18077. 334.19 s [algebraic-graphs] OK: pairOfRight (matching [(2,'a'), (1,'b')]) == Map.fromList [('a',2), ('b',1)]
  18078. 334.19 s [algebraic-graphs] OK: Map.size . pairOfRight == Map.size . pairOfLeft
  18079. 334.19 s [algebraic-graphs]
  18080. 334.19 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matching ============
  18081. 334.19 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b')] == matching [(1,'b')]
  18082. 334.19 s [algebraic-graphs] OK: matching [(1,'a'), (1,'b'), (2,'b'), (2,'a')] == matching [(2,'a')]
  18083. 334.19 s [algebraic-graphs]
  18084. 334.19 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isMatchingOf ============
  18085. 334.19 s [algebraic-graphs] OK: isMatchingOf (matching []) x == True
  18086. 334.19 s [algebraic-graphs] OK: isMatchingOf (matching xs) empty == null xs
  18087. 334.19 s [algebraic-graphs] OK: isMatchingOf (matching [(x,y)]) (edge x y) == True
  18088. 334.19 s [algebraic-graphs] OK: isMatchingOf (matching [(1,2)]) (edge 2 1) == False
  18089. 334.19 s [algebraic-graphs]
  18090. 334.19 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.matchingSize ============
  18091. 334.19 s [algebraic-graphs] OK: matchingSize (matching []) == 0
  18092. 334.19 s [algebraic-graphs] OK: matchingSize (matching [(2,'a'), (1,'b')]) == 2
  18093. 334.19 s [algebraic-graphs] OK: matchingSize (matching [(1,'a'), (1,'b')]) == 1
  18094. 334.19 s [algebraic-graphs] OK: matchingSize (matching xs) <= length xs
  18095. 334.19 s [algebraic-graphs] OK: matchingSize x == Map.size . pairOfLeft
  18096. 334.19 s [algebraic-graphs]
  18097. 334.19 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxMatching ============
  18098. 334.19 s [algebraic-graphs] OK: maxMatching empty == matching []
  18099. 334.19 s [algebraic-graphs] OK: maxMatching (vertices xs ys) == matching []
  18100. 334.19 s [algebraic-graphs] OK: maxMatching (path [1,2,3,4]) == matching [(1,2), (3,4)]
  18101. 334.19 s [algebraic-graphs] OK: matchingSize (maxMatching (circuit [(1,2), (3,4), (5,6)])) == 3
  18102. 334.19 s [algebraic-graphs] OK: matchingSize (maxMatching (star x (y:ys))) == 1
  18103. 334.19 s [algebraic-graphs] OK: matchingSize (maxMatching (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  18104. 334.19 s [algebraic-graphs] OK: isMatchingOf (maxMatching x) x == True
  18105. 334.19 s [algebraic-graphs]
  18106. 334.19 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isVertexCoverOf ============
  18107. 334.19 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) empty == Set.null xs && Set.null ys
  18108. 334.19 s [algebraic-graphs] OK: isVertexCoverOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  18109. 334.19 s [algebraic-graphs] OK: isVertexCoverOf (Set.empty , Set.empty ) (edge x y) == False
  18110. 334.19 s [algebraic-graphs] OK: isVertexCoverOf (Set.singleton x, ys ) (edge x y) == Set.isSubsetOf ys (Set.singleton y)
  18111. 334.19 s [algebraic-graphs] OK: isVertexCoverOf (xs , Set.singleton y) (edge x y) == Set.isSubsetOf xs (Set.singleton x)
  18112. 334.19 s [algebraic-graphs]
  18113. 334.19 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.minVertexCover ============
  18114. 334.19 s [algebraic-graphs] OK: minVertexCover empty == (Set.empty, Set.empty)
  18115. 336.17 s [algebraic-graphs] OK: minVertexCover (vertices xs ys) == (Set.empty, Set.empty)
  18116. 336.17 s [algebraic-graphs] OK: minVertexCover (path [1,2,3]) == (Set.empty, Set.singleton 2)
  18117. 336.17 s [algebraic-graphs] OK: minVertexCover (star x (1:2:ys)) == (Set.singleton x, Set.empty)
  18118. 336.17 s [algebraic-graphs] OK: vertexCoverSize (minVertexCover (biclique xs ys)) == min (length (nub xs)) (length (nub ys))
  18119. 336.17 s [algebraic-graphs] OK: vertexCoverSize . minVertexCover == matchingSize . maxMatching
  18120. 336.17 s [algebraic-graphs] OK: isVertexCoverOf (minVertexCover x) x == True
  18121. 336.17 s [algebraic-graphs]
  18122. 336.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.isIndependentSetOf ============
  18123. 336.17 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) empty == Set.null xs && Set.null ys
  18124. 336.17 s [algebraic-graphs] OK: isIndependentSetOf (xs , ys ) (leftVertex x) == Set.isSubsetOf xs (Set.singleton x) && Set.null ys
  18125. 336.17 s [algebraic-graphs] OK: isIndependentSetOf (Set.empty , Set.empty ) (edge x y) == True
  18126. 336.17 s [algebraic-graphs] OK: isIndependentSetOf (Set.singleton x, ys ) (edge x y) == Set.null ys
  18127. 336.17 s [algebraic-graphs] OK: isIndependentSetOf (xs , Set.singleton y) (edge x y) == Set.null xs
  18128. 336.17 s [algebraic-graphs]
  18129. 336.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.maxIndependentSet ============
  18130. 336.17 s [algebraic-graphs] OK: maxIndependentSet empty == (Set.empty, Set.empty)
  18131. 336.17 s [algebraic-graphs] OK: maxIndependentSet (vertices xs ys) == (Set.fromList xs, Set.fromList ys)
  18132. 336.17 s [algebraic-graphs] OK: maxIndependentSet (path [1,2,3]) == (Set.fromList [1,3], Set.empty)
  18133. 336.17 s [algebraic-graphs] OK: maxIndependentSet (star x (1:2:ys)) == (Set.empty, Set.fromList (1:2:ys))
  18134. 336.17 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet (biclique xs ys)) == max (length (nub xs)) (length (nub ys))
  18135. 336.17 s [algebraic-graphs] OK: independentSetSize (maxIndependentSet x) == vertexCount x - vertexCoverSize (minVertexCover x)
  18136. 336.17 s [algebraic-graphs] OK: isIndependentSetOf (maxIndependentSet x) x == True
  18137. 336.17 s [algebraic-graphs]
  18138. 336.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.augmentingPath ============
  18139. 336.17 s [algebraic-graphs] OK: augmentingPath (matching []) empty == Left (Set.empty, Set.empty)
  18140. 336.17 s [algebraic-graphs] OK: augmentingPath (matching []) (edge 1 2) == Right [1,2]
  18141. 336.17 s [algebraic-graphs] OK: augmentingPath (matching [(1,2)]) (path [1,2,3]) == Left (Set.empty, Set.singleton 2)
  18142. 336.17 s [algebraic-graphs] OK: augmentingPath (matching [(3,2)]) (path [1,2,3,4]) == Right [1,2,3,4]
  18143. 336.17 s [algebraic-graphs] OK: isLeft (augmentingPath (maxMatching x) x) == True
  18144. 336.17 s [algebraic-graphs]
  18145. 336.17 s [algebraic-graphs] ============ Bipartite.AdjacencyMap.Algorithm.consistentMatching ============
  18146. 336.17 s [algebraic-graphs] OK: consistentMatching (matching xs) == True
  18147. 336.17 s [algebraic-graphs] OK: consistentMatching (maxMatching x) == True
  18148. 336.17 s [algebraic-graphs]
  18149. 336.17 s [algebraic-graphs] ============ Export.Eq ============
  18150. 336.17 s [algebraic-graphs] OK: mempty /= literal ""
  18151. 336.17 s [algebraic-graphs]
  18152. 336.17 s [algebraic-graphs] ============ Export.Ord ============
  18153. 336.17 s [algebraic-graphs] OK: mempty < literal ""
  18154. 336.17 s [algebraic-graphs]
  18155. 336.17 s [algebraic-graphs] ============ Export.isEmpty ============
  18156. 336.17 s [algebraic-graphs] OK: isEmpty mempty == True
  18157. 336.17 s [algebraic-graphs] OK: isEmpty (literal "") == False
  18158. 336.17 s [algebraic-graphs] OK: isEmpty x == (x == mempty)
  18159. 336.17 s [algebraic-graphs]
  18160. 336.17 s [algebraic-graphs] ============ Export.literal ============
  18161. 336.17 s [algebraic-graphs] OK: literal "Hello, " <> literal "World!" == literal "Hello, World!"
  18162. 336.17 s [algebraic-graphs] OK: literal "I am just a string literal" == "I am just a string literal"
  18163. 336.17 s [algebraic-graphs] OK: render . literal == id
  18164. 336.17 s [algebraic-graphs]
  18165. 336.17 s [algebraic-graphs] ============ Export.render ============
  18166. 336.17 s [algebraic-graphs] OK: render (literal "al" <> literal "ga") == "alga"
  18167. 336.17 s [algebraic-graphs] OK: render mempty == mempty
  18168. 336.17 s [algebraic-graphs]
  18169. 336.17 s [algebraic-graphs] ============ Export.<+> ============
  18170. 336.17 s [algebraic-graphs] OK: x <+> mempty == x
  18171. 336.17 s [algebraic-graphs] OK: mempty <+> x == x
  18172. 336.17 s [algebraic-graphs] OK: x <+> (y <+> z) == (x <+> y) <+> z
  18173. 336.17 s [algebraic-graphs] OK: "name" <+> "surname" == "name surname"
  18174. 336.17 s [algebraic-graphs]
  18175. 336.17 s [algebraic-graphs] ============ Export.brackets ============
  18176. 336.17 s [algebraic-graphs] OK: brackets "i" == "[i]"
  18177. 336.17 s [algebraic-graphs] OK: brackets mempty == "[]"
  18178. 336.17 s [algebraic-graphs]
  18179. 336.17 s [algebraic-graphs] ============ Export.doubleQuotes ============
  18180. 336.17 s [algebraic-graphs] OK: doubleQuotes "/path/with spaces" == "\"/path/with spaces\""
  18181. 336.17 s [algebraic-graphs] OK: doubleQuotes (doubleQuotes mempty) == "\"\"\"\""
  18182. 336.17 s [algebraic-graphs]
  18183. 336.17 s [algebraic-graphs] ============ Export.indent ============
  18184. 336.17 s [algebraic-graphs] OK: indent 0 == id
  18185. 336.17 s [algebraic-graphs] OK: indent 1 mempty == " "
  18186. 336.17 s [algebraic-graphs]
  18187. 336.17 s [algebraic-graphs] ============ Export.unlines ============
  18188. 336.17 s [algebraic-graphs] OK: unlines [] == mempty
  18189. 336.17 s [algebraic-graphs] OK: unlines [mempty] == "\n"
  18190. 336.17 s [algebraic-graphs] OK: unlines ["title", "subtitle"] == "title\nsubtitle\n"
  18191. 336.17 s [algebraic-graphs]
  18192. 336.17 s [algebraic-graphs] ============ Export.export ============
  18193. 336.17 s [algebraic-graphs] OK: render $ export vDoc eDoc (1 + 2 * (3 + 4) :: Graph Int)
  18194. 336.17 s [algebraic-graphs]
  18195. 336.17 s [algebraic-graphs] ============ Export.Dot.export ============
  18196. 336.17 s [algebraic-graphs] OK: export style (1 * 2 + 3 * 4 * 5 :: Graph Int)
  18197. 336.17 s [algebraic-graphs]
  18198. 336.17 s [algebraic-graphs] =========== Export.Dot.attributeQuoting ============
  18199. 336.17 s [algebraic-graphs] OK: export style' (1 * 2 + 3 * 4 * 5 :: Graph Int)
  18200. 336.17 s [algebraic-graphs]
  18201. 336.17 s [algebraic-graphs] ============ Export.Dot.exportAsIs ============
  18202. 336.17 s [algebraic-graphs] OK: exportAsIs (circuit ["a", "b", "c"] :: Graph String)
  18203. 336.17 s [algebraic-graphs]
  18204. 336.17 s [algebraic-graphs] ============ Export.Dot.exportViaShow ============
  18205. 336.17 s [algebraic-graphs] OK: exportViaShow (1 + 2 * (3 + 4) :: Graph Int)
  18206. 336.17 s [algebraic-graphs]
  18207. 336.17 s [algebraic-graphs] ============ Graph ============
  18208. 336.17 s [algebraic-graphs] OK: Axioms of graphs
  18209. 336.17 s [algebraic-graphs] OK: Theorems of graphs
  18210. 336.17 s [algebraic-graphs]
  18211. 336.17 s [algebraic-graphs] ============ Graph.Ord ============
  18212. 336.17 s [algebraic-graphs] OK: vertex 1 < vertex 2
  18213. 336.17 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  18214. 336.17 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  18215. 336.17 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  18216. 336.17 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  18217. 336.17 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  18218. 336.17 s [algebraic-graphs] OK: x <= x + y
  18219. 336.17 s [algebraic-graphs] OK: x + y <= x * y
  18220. 336.17 s [algebraic-graphs]
  18221. 336.17 s [algebraic-graphs] ============ Graph.empty ============
  18222. 336.17 s [algebraic-graphs] OK: isEmpty empty == True
  18223. 336.17 s [algebraic-graphs] OK: hasVertex x empty == False
  18224. 336.17 s [algebraic-graphs] OK: vertexCount empty == 0
  18225. 336.17 s [algebraic-graphs] OK: edgeCount empty == 0
  18226. 336.17 s [algebraic-graphs]
  18227. 336.17 s [algebraic-graphs] ============ Graph.vertex ============
  18228. 336.17 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18229. 336.17 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18230. 336.17 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18231. 336.17 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18232. 336.17 s [algebraic-graphs]
  18233. 336.17 s [algebraic-graphs] ============ Graph.edge ============
  18234. 336.18 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  18235. 336.18 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18236. 336.18 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18237. 336.18 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  18238. 336.18 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  18239. 336.18 s [algebraic-graphs]
  18240. 336.18 s [algebraic-graphs] ============ Graph.overlay ============
  18241. 336.18 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  18242. 336.18 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18243. 336.18 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18244. 336.18 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18245. 336.18 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18246. 336.18 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18247. 336.18 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  18248. 336.18 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  18249. 336.18 s [algebraic-graphs]
  18250. 336.18 s [algebraic-graphs] ============ Graph.connect ============
  18251. 336.18 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  18252. 336.18 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  18253. 336.18 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  18254. 336.18 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  18255. 336.18 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  18256. 336.18 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  18257. 336.18 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  18258. 336.18 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  18259. 336.18 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  18260. 336.18 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  18261. 336.18 s [algebraic-graphs]
  18262. 336.18 s [algebraic-graphs] ============ Graph.vertices ============
  18263. 336.18 s [algebraic-graphs] OK: vertices [] == empty
  18264. 336.18 s [algebraic-graphs] OK: vertices [x] == vertex x
  18265. 336.18 s [algebraic-graphs] OK: vertices == overlays . map vertex
  18266. 336.18 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  18267. 336.18 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  18268. 336.18 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18269. 336.18 s [algebraic-graphs]
  18270. 336.18 s [algebraic-graphs] ============ Graph.edges ============
  18271. 336.18 s [algebraic-graphs] OK: edges [] == empty
  18272. 336.18 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  18273. 336.18 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  18274. 336.18 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  18275. 336.18 s [algebraic-graphs]
  18276. 336.18 s [algebraic-graphs] ============ Graph.overlays ============
  18277. 336.18 s [algebraic-graphs] OK: overlays [] == empty
  18278. 336.18 s [algebraic-graphs] OK: overlays [x] == x
  18279. 336.18 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  18280. 336.18 s [algebraic-graphs] OK: overlays == foldr overlay empty
  18281. 336.18 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  18282. 336.18 s [algebraic-graphs]
  18283. 336.18 s [algebraic-graphs] ============ Graph.connects ============
  18284. 336.18 s [algebraic-graphs] OK: connects [] == empty
  18285. 336.18 s [algebraic-graphs] OK: connects [x] == x
  18286. 336.18 s [algebraic-graphs] OK: connects [x,y] == connect x y
  18287. 336.18 s [algebraic-graphs] OK: connects == foldr connect empty
  18288. 336.18 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  18289. 336.18 s [algebraic-graphs]
  18290. 336.18 s [algebraic-graphs] ============ Graph.isSubgraphOf ============
  18291. 336.18 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  18292. 336.18 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  18293. 336.18 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  18294. 336.18 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  18295. 336.18 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  18296. 336.18 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  18297. 336.18 s [algebraic-graphs]
  18298. 336.18 s [algebraic-graphs] ============ Graph.toGraph et al. ============
  18299. 336.18 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  18300. 336.18 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  18301. 336.18 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  18302. 336.18 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  18303. 336.18 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  18304. 336.18 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  18305. 336.18 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  18306. 336.18 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  18307. 336.18 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  18308. 336.78 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  18309. 336.78 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  18310. 336.78 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  18311. 336.78 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  18312. 336.78 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  18313. 336.78 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  18314. 336.78 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  18315. 336.78 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  18316. 336.78 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  18317. 336.78 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  18318. 336.78 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  18319. 336.78 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  18320. 336.78 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  18321. 336.78 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  18322. 336.78 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  18323. 336.78 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  18324. 336.78 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  18325. 336.78 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  18326. 336.78 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  18327. 336.78 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  18328. 336.78 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  18329. 336.78 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  18330. 336.79 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  18331. 336.79 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  18332. 336.79 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  18333. 336.79 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  18334. 336.79 s [algebraic-graphs]
  18335. 336.79 s [algebraic-graphs] ============ Graph.foldg ============
  18336. 336.79 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  18337. 336.79 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  18338. 336.79 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  18339. 336.79 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  18340. 336.79 s [algebraic-graphs]
  18341. 336.79 s [algebraic-graphs] ============ Graph.isEmpty ============
  18342. 336.79 s [algebraic-graphs] OK: isEmpty empty == True
  18343. 336.79 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  18344. 336.79 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18345. 336.79 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  18346. 336.79 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  18347. 336.79 s [algebraic-graphs]
  18348. 336.79 s [algebraic-graphs] ============ Graph.hasVertex ============
  18349. 336.79 s [algebraic-graphs] OK: hasVertex x empty == False
  18350. 336.79 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18351. 336.79 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  18352. 336.79 s [algebraic-graphs]
  18353. 336.79 s [algebraic-graphs] ============ Graph.hasEdge ============
  18354. 336.79 s [algebraic-graphs] OK: hasEdge x y empty == False
  18355. 336.79 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  18356. 336.79 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  18357. 336.79 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  18358. 336.79 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  18359. 336.79 s [algebraic-graphs]
  18360. 336.79 s [algebraic-graphs] ============ Graph.vertexCount ============
  18361. 336.79 s [algebraic-graphs] OK: vertexCount empty == 0
  18362. 336.79 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18363. 336.79 s [algebraic-graphs] OK: vertexCount == length . vertexList
  18364. 336.79 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  18365. 336.79 s [algebraic-graphs]
  18366. 336.79 s [algebraic-graphs] ============ Graph.edgeCount ============
  18367. 336.79 s [algebraic-graphs] OK: edgeCount empty == 0
  18368. 336.79 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18369. 336.79 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  18370. 336.79 s [algebraic-graphs] OK: edgeCount == length . edgeList
  18371. 336.79 s [algebraic-graphs]
  18372. 336.79 s [algebraic-graphs] ============ Graph.vertexList ============
  18373. 336.79 s [algebraic-graphs] OK: vertexList empty == []
  18374. 336.79 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  18375. 336.79 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  18376. 336.79 s [algebraic-graphs]
  18377. 336.79 s [algebraic-graphs] ============ Graph.vertexSet ============
  18378. 336.79 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  18379. 336.79 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  18380. 336.79 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18381. 336.79 s [algebraic-graphs]
  18382. 336.79 s [algebraic-graphs] ============ Graph.vertexIntSet ============
  18383. 336.79 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  18384. 336.79 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  18385. 336.79 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  18386. 336.79 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  18387. 336.79 s [algebraic-graphs]
  18388. 336.79 s [algebraic-graphs] ============ Graph.edgeList ============
  18389. 336.79 s [algebraic-graphs] OK: edgeList empty == []
  18390. 336.79 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18391. 336.79 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  18392. 336.79 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  18393. 336.79 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  18394. 336.79 s [algebraic-graphs]
  18395. 336.79 s [algebraic-graphs] ============ Graph.edgeSet ============
  18396. 336.79 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  18397. 336.79 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18398. 336.79 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  18399. 336.79 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  18400. 336.79 s [algebraic-graphs]
  18401. 336.79 s [algebraic-graphs] ============ Graph.adjacencyList ============
  18402. 336.79 s [algebraic-graphs] OK: adjacencyList empty == []
  18403. 336.79 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  18404. 336.79 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  18405. 336.79 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  18406. 336.79 s [algebraic-graphs]
  18407. 336.79 s [algebraic-graphs] ============ Graph.preSet ============
  18408. 336.79 s [algebraic-graphs] OK: preSet x empty == Set.empty
  18409. 336.79 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  18410. 336.79 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  18411. 336.79 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  18412. 336.79 s [algebraic-graphs]
  18413. 336.79 s [algebraic-graphs] ============ Graph.preIntSet ============
  18414. 336.79 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  18415. 336.79 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  18416. 336.79 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  18417. 336.79 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  18418. 336.79 s [algebraic-graphs]
  18419. 336.79 s [algebraic-graphs] ============ Graph.postSet ============
  18420. 336.79 s [algebraic-graphs] OK: postSet x empty == Set.empty
  18421. 336.79 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  18422. 336.79 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  18423. 336.79 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  18424. 336.79 s [algebraic-graphs]
  18425. 336.79 s [algebraic-graphs] ============ Graph.postIntSet ============
  18426. 336.79 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  18427. 336.79 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  18428. 336.79 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  18429. 336.79 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  18430. 336.79 s [algebraic-graphs]
  18431. 336.79 s [algebraic-graphs] ============ Graph.size ============
  18432. 336.79 s [algebraic-graphs] OK: size empty == 1
  18433. 336.79 s [algebraic-graphs] OK: size (vertex x) == 1
  18434. 336.79 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  18435. 336.79 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  18436. 336.79 s [algebraic-graphs] OK: size x >= 1
  18437. 336.79 s [algebraic-graphs] OK: size x >= vertexCount x
  18438. 336.79 s [algebraic-graphs]
  18439. 336.79 s [algebraic-graphs] ============ Graph.path ============
  18440. 336.79 s [algebraic-graphs] OK: path [] == empty
  18441. 336.79 s [algebraic-graphs] OK: path [x] == vertex x
  18442. 336.79 s [algebraic-graphs] OK: path [x,y] == edge x y
  18443. 336.79 s [algebraic-graphs]
  18444. 336.79 s [algebraic-graphs] ============ Graph.circuit ============
  18445. 336.79 s [algebraic-graphs] OK: circuit [] == empty
  18446. 336.79 s [algebraic-graphs] OK: circuit [x] == edge x x
  18447. 336.79 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  18448. 336.79 s [algebraic-graphs]
  18449. 336.79 s [algebraic-graphs] ============ Graph.clique ============
  18450. 336.79 s [algebraic-graphs] OK: clique [] == empty
  18451. 336.79 s [algebraic-graphs] OK: clique [x] == vertex x
  18452. 336.79 s [algebraic-graphs] OK: clique [x,y] == edge x y
  18453. 336.79 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  18454. 336.79 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  18455. 336.79 s [algebraic-graphs]
  18456. 336.79 s [algebraic-graphs] ============ Graph.biclique ============
  18457. 336.79 s [algebraic-graphs] OK: biclique [] [] == empty
  18458. 336.79 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  18459. 336.79 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  18460. 336.79 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  18461. 336.79 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  18462. 336.79 s [algebraic-graphs]
  18463. 336.79 s [algebraic-graphs] ============ Graph.star ============
  18464. 336.79 s [algebraic-graphs] OK: star x [] == vertex x
  18465. 336.79 s [algebraic-graphs] OK: star x [y] == edge x y
  18466. 336.79 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  18467. 336.79 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  18468. 336.79 s [algebraic-graphs]
  18469. 336.79 s [algebraic-graphs] ============ Graph.stars ============
  18470. 336.79 s [algebraic-graphs] OK: stars [] == empty
  18471. 336.79 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  18472. 336.79 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  18473. 336.79 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  18474. 336.79 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  18475. 336.79 s [algebraic-graphs] OK: stars . adjacencyList == id
  18476. 336.79 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  18477. 336.79 s [algebraic-graphs]
  18478. 336.79 s [algebraic-graphs] ============ Graph.tree ============
  18479. 336.79 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  18480. 336.79 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  18481. 336.79 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  18482. 336.79 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  18483. 336.79 s [algebraic-graphs]
  18484. 336.79 s [algebraic-graphs] ============ Graph.forest ============
  18485. 336.79 s [algebraic-graphs] OK: forest [] == empty
  18486. 336.79 s [algebraic-graphs] OK: forest [x] == tree x
  18487. 336.79 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  18488. 336.79 s [algebraic-graphs] OK: forest == overlays . map tree
  18489. 336.79 s [algebraic-graphs]
  18490. 336.79 s [algebraic-graphs] ============ Graph.removeVertex ============
  18491. 339.74 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  18492. 339.74 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  18493. 339.74 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  18494. 339.86 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  18495. 339.86 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  18496. 339.86 s [algebraic-graphs]
  18497. 339.86 s [algebraic-graphs] ============ Graph.removeEdge ============
  18498. 339.86 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  18499. 339.86 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18500. 339.86 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  18501. 339.86 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  18502. 339.86 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  18503. 339.86 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  18504. 339.86 s [algebraic-graphs]
  18505. 339.86 s [algebraic-graphs] ============ Graph.replaceVertex ============
  18506. 339.86 s [algebraic-graphs] OK: replaceVertex x x == id
  18507. 339.86 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  18508. 339.86 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  18509. 339.86 s [algebraic-graphs]
  18510. 339.86 s [algebraic-graphs] ============ Graph.mergeVertices ============
  18511. 339.86 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  18512. 339.86 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  18513. 339.86 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  18514. 339.86 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  18515. 339.86 s [algebraic-graphs]
  18516. 339.86 s [algebraic-graphs] ============ Graph.transpose ============
  18517. 339.86 s [algebraic-graphs] OK: transpose empty == empty
  18518. 339.86 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  18519. 339.86 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  18520. 339.86 s [algebraic-graphs] OK: transpose . transpose == id
  18521. 339.86 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  18522. 339.86 s [algebraic-graphs]
  18523. 339.86 s [algebraic-graphs] ============ Graph.gmap ============
  18524. 339.86 s [algebraic-graphs] OK: gmap f empty == empty
  18525. 339.86 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  18526. 339.86 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  18527. 339.86 s [algebraic-graphs] OK: gmap id == id
  18528. 339.86 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  18529. 339.86 s [algebraic-graphs]
  18530. 339.86 s [algebraic-graphs] ============ Graph.induce ============
  18531. 339.86 s [algebraic-graphs] OK: induce (const True ) x == x
  18532. 339.86 s [algebraic-graphs] OK: induce (const False) x == empty
  18533. 339.86 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  18534. 339.86 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  18535. 339.86 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  18536. 339.86 s [algebraic-graphs]
  18537. 339.86 s [algebraic-graphs] ============ Graph.induceJust ============
  18538. 339.86 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  18539. 339.86 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  18540. 339.86 s [algebraic-graphs] OK: induceJust . gmap Just == id
  18541. 339.86 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  18542. 339.86 s [algebraic-graphs]
  18543. 339.86 s [algebraic-graphs] ============ Graph.compose ============
  18544. 339.86 s [algebraic-graphs] OK: compose empty x == empty
  18545. 339.86 s [algebraic-graphs] OK: compose x empty == empty
  18546. 339.86 s [algebraic-graphs] OK: compose (vertex x) y == empty
  18547. 339.86 s [algebraic-graphs] OK: compose x (vertex y) == empty
  18548. 339.86 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  18549. 339.86 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  18550. 339.86 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  18551. 339.86 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  18552. 339.86 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  18553. 339.86 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  18554. 339.86 s [algebraic-graphs] OK: size (compose x y) <= edgeCount x + edgeCount y + 1
  18555. 339.86 s [algebraic-graphs]
  18556. 339.86 s [algebraic-graphs] ============ Graph.(===) ============
  18557. 339.86 s [algebraic-graphs] OK: x === x == True
  18558. 339.86 s [algebraic-graphs] OK: x === x + empty == False
  18559. 339.86 s [algebraic-graphs] OK: x + y === x + y == True
  18560. 339.86 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  18561. 339.86 s [algebraic-graphs] OK: x + y === x * y == False
  18562. 339.86 s [algebraic-graphs]
  18563. 339.86 s [algebraic-graphs] ============ Graph.mesh ============
  18564. 339.86 s [algebraic-graphs] OK: mesh xs [] == empty
  18565. 339.86 s [algebraic-graphs] OK: mesh [] ys == empty
  18566. 339.86 s [algebraic-graphs] OK: mesh [x] [y] == vertex (x, y)
  18567. 339.86 s [algebraic-graphs] OK: mesh xs ys == box (path xs) (path ys)
  18568. 339.86 s [algebraic-graphs] OK: mesh [1..3] "ab" == <correct result>
  18569. 339.86 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  18570. 339.86 s [algebraic-graphs]
  18571. 339.86 s [algebraic-graphs] ============ Graph.torus ============
  18572. 339.86 s [algebraic-graphs] OK: torus xs [] == empty
  18573. 339.86 s [algebraic-graphs] OK: torus [] ys == empty
  18574. 339.86 s [algebraic-graphs] OK: torus [x] [y] == edge (x,y) (x,y)
  18575. 339.86 s [algebraic-graphs] OK: torus xs ys == box (circuit xs) (circuit ys)
  18576. 339.86 s [algebraic-graphs] OK: torus [1,2] "ab" == <correct result>
  18577. 339.86 s [algebraic-graphs] OK: size (torus xs ys) == max 1 (3 * length xs * length ys)
  18578. 339.86 s [algebraic-graphs]
  18579. 339.86 s [algebraic-graphs] ============ Graph.deBruijn ============
  18580. 339.86 s [algebraic-graphs] OK: deBruijn 0 xs == edge [] []
  18581. 339.86 s [algebraic-graphs] OK: n > 0 ==> deBruijn n [] == empty
  18582. 339.86 s [algebraic-graphs] OK: deBruijn 1 [0,1] == edges [ ([0],[0]), ([0],[1]), ([1],[0]), ([1],[1]) ]
  18583. 339.86 s [algebraic-graphs] OK: deBruijn 2 "0" == edge "00" "00"
  18584. 339.86 s [algebraic-graphs] OK: deBruijn 2 "01" == <correct result>
  18585. 339.86 s [algebraic-graphs] OK: transpose (deBruijn n xs) == gmap reverse $ deBruijn n xs
  18586. 339.86 s [algebraic-graphs] OK: vertexCount (deBruijn n xs) == (length $ nub xs)^n
  18587. 339.86 s [algebraic-graphs] OK: n > 0 ==> edgeCount (deBruijn n xs) == (length $ nub xs)^(n + 1)
  18588. 339.86 s [algebraic-graphs]
  18589. 339.86 s [algebraic-graphs] ============ Graph.splitVertex ============
  18590. 339.86 s [algebraic-graphs] OK: splitVertex x [] == removeVertex x
  18591. 339.86 s [algebraic-graphs] OK: splitVertex x [x] == id
  18592. 339.86 s [algebraic-graphs] OK: splitVertex x [y] == replaceVertex x y
  18593. 339.86 s [algebraic-graphs] OK: splitVertex 1 [0, 1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  18594. 339.86 s [algebraic-graphs]
  18595. 339.86 s [algebraic-graphs] ============ Graph.bind ============
  18596. 339.86 s [algebraic-graphs] OK: bind empty f == empty
  18597. 339.86 s [algebraic-graphs] OK: bind (vertex x) f == f x
  18598. 339.86 s [algebraic-graphs] OK: bind (edge x y) f == connect (f x) (f y)
  18599. 339.86 s [algebraic-graphs] OK: bind (vertices xs) f == overlays (map f xs)
  18600. 339.86 s [algebraic-graphs] OK: bind x (const empty) == empty
  18601. 339.86 s [algebraic-graphs] OK: bind x vertex == x
  18602. 339.86 s [algebraic-graphs] OK: bind (bind x f) g == bind x (\y -> bind (f y) g)
  18603. 339.86 s [algebraic-graphs]
  18604. 339.86 s [algebraic-graphs] ============ Graph.simplify ============
  18605. 339.86 s [algebraic-graphs] OK: simplify == id
  18606. 339.86 s [algebraic-graphs] OK: size (simplify x) <= size x
  18607. 339.86 s [algebraic-graphs]
  18608. 339.86 s [algebraic-graphs] ============ Graph.box ============
  18609. 339.86 s [algebraic-graphs] OK: box x y ~~ box y x
  18610. 339.86 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  18611. 339.86 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  18612. 339.86 s [algebraic-graphs] OK: box x empty ~~ empty
  18613. 339.86 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  18614. 339.86 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  18615. 339.86 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  18616. 339.86 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  18617. 339.86 s [algebraic-graphs]
  18618. 339.86 s [algebraic-graphs] ============ Graph.sparsify ============
  18619. 339.86 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  18620. 339.86 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  18621. 339.86 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  18622. 339.86 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  18623. 339.86 s [algebraic-graphs]
  18624. 339.86 s [algebraic-graphs] ============ Graph.sparsifyKL ============
  18625. 339.86 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  18626. 339.86 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  18627. 339.87 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  18628. 339.87 s [algebraic-graphs]
  18629. 339.87 s [algebraic-graphs] ============ Graph.context ============
  18630. 339.87 s [algebraic-graphs] OK: context (const False) x == Nothing
  18631. 339.87 s [algebraic-graphs] OK: context (== 1) (edge 1 2) == Just (Context [ ] [2 ])
  18632. 339.87 s [algebraic-graphs] OK: context (== 2) (edge 1 2) == Just (Context [1 ] [ ])
  18633. 339.87 s [algebraic-graphs] OK: context (const True ) (edge 1 2) == Just (Context [1 ] [2 ])
  18634. 339.87 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [3,1] [1,5])
  18635. 339.87 s [algebraic-graphs]
  18636. 339.87 s [algebraic-graphs] ============ Graph.buildg ============
  18637. 339.87 s [algebraic-graphs] OK: buildg (\e _ _ _ -> e) == empty
  18638. 339.87 s [algebraic-graphs] OK: buildg (\_ v _ _ -> v x) == vertex x
  18639. 339.87 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
  18640. 339.87 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
  18641. 339.87 s [algebraic-graphs] OK: buildg (\e v o _ -> foldr o e (map v xs)) == vertices xs
  18642. 339.87 s [algebraic-graphs] OK: buildg (\e v o c -> foldg e v o (flip c) g) == transpose g
  18643. 339.87 s [algebraic-graphs]
  18644. 339.87 s [algebraic-graphs] ============ Internal.List ============
  18645. 339.87 s [algebraic-graphs] OK: pure 1 <> pure 4 == [1, 4]
  18646. 339.87 s [algebraic-graphs]
  18647. 339.87 s [algebraic-graphs] ============ Graph.Label ============
  18648. 339.87 s [algebraic-graphs]
  18649. 339.87 s [algebraic-graphs] ============ Any: instances ============
  18650. 339.87 s [algebraic-graphs] OK: Semiring
  18651. 339.87 s [algebraic-graphs] OK: StarSemiring
  18652. 339.87 s [algebraic-graphs] OK: Dioid
  18653. 339.87 s [algebraic-graphs]
  18654. 339.87 s [algebraic-graphs] ============ Distance Int: instances ============
  18655. 339.87 s [algebraic-graphs] OK: Semiring
  18656. 339.87 s [algebraic-graphs] OK: StarSemiring
  18657. 339.87 s [algebraic-graphs] OK: Dioid
  18658. 339.87 s [algebraic-graphs]
  18659. 339.87 s [algebraic-graphs] ============ Capacity Int: instances ============
  18660. 339.87 s [algebraic-graphs] OK: Semiring
  18661. 339.87 s [algebraic-graphs] OK: StarSemiring
  18662. 339.87 s [algebraic-graphs] OK: Dioid
  18663. 339.87 s [algebraic-graphs]
  18664. 339.87 s [algebraic-graphs] ============ Minimum (Path Int): instances ============
  18665. 339.87 s [algebraic-graphs] OK: LeftNearRing
  18666. 339.87 s [algebraic-graphs]
  18667. 339.87 s [algebraic-graphs] ============ PowerSet (Path Int): instances ============
  18668. 339.87 s [algebraic-graphs] OK: Semiring
  18669. 339.87 s [algebraic-graphs] OK: Dioid
  18670. 339.87 s [algebraic-graphs]
  18671. 339.87 s [algebraic-graphs] ============ Count Int: instances ============
  18672. 339.87 s [algebraic-graphs] OK: Semiring
  18673. 339.87 s [algebraic-graphs] OK: StarSemiring
  18674. 339.87 s [algebraic-graphs]
  18675. 339.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.consistent ============
  18676. 339.87 s [algebraic-graphs] OK: arbitraryLabelledAdjacencyMap
  18677. 339.87 s [algebraic-graphs] OK: empty
  18678. 339.87 s [algebraic-graphs] OK: vertex
  18679. 339.87 s [algebraic-graphs] OK: edge
  18680. 339.87 s [algebraic-graphs] OK: overlay
  18681. 339.87 s [algebraic-graphs] OK: connect
  18682. 339.87 s [algebraic-graphs] OK: vertices
  18683. 339.87 s [algebraic-graphs] OK: edges
  18684. 339.87 s [algebraic-graphs] OK: overlays
  18685. 339.87 s [algebraic-graphs] OK: fromAdjacencyMaps
  18686. 339.87 s [algebraic-graphs] OK: removeVertex
  18687. 339.87 s [algebraic-graphs] OK: removeEdge
  18688. 339.87 s [algebraic-graphs] OK: replaceVertex
  18689. 339.87 s [algebraic-graphs] OK: replaceEdge
  18690. 339.87 s [algebraic-graphs] OK: transpose
  18691. 339.87 s [algebraic-graphs] OK: gmap
  18692. 339.87 s [algebraic-graphs] OK: emap
  18693. 339.87 s [algebraic-graphs] OK: induce
  18694. 339.87 s [algebraic-graphs] OK: closure
  18695. 339.87 s [algebraic-graphs] OK: reflexiveClosure
  18696. 339.87 s [algebraic-graphs] OK: symmetricClosure
  18697. 339.87 s [algebraic-graphs] OK: transitiveClosure
  18698. 339.87 s [algebraic-graphs]
  18699. 339.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.empty ============
  18700. 339.87 s [algebraic-graphs] OK: isEmpty empty == True
  18701. 339.87 s [algebraic-graphs] OK: hasVertex x empty == False
  18702. 339.87 s [algebraic-graphs] OK: vertexCount empty == 0
  18703. 339.87 s [algebraic-graphs] OK: edgeCount empty == 0
  18704. 339.87 s [algebraic-graphs]
  18705. 339.87 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertex ============
  18706. 339.87 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18707. 339.87 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18708. 339.87 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18709. 339.87 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18710. 339.87 s [algebraic-graphs]
  18711. 341.92 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edge ============
  18712. 341.92 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  18713. 341.92 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  18714. 341.92 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  18715. 341.92 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  18716. 341.92 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  18717. 341.92 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  18718. 341.92 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  18719. 341.92 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  18720. 341.92 s [algebraic-graphs]
  18721. 341.92 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlay ============
  18722. 341.92 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  18723. 341.92 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18724. 341.92 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18725. 341.92 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18726. 341.92 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18727. 341.92 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18728. 341.92 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  18729. 341.92 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  18730. 341.92 s [algebraic-graphs]
  18731. 341.92 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  18732. 341.92 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  18733. 341.92 s [algebraic-graphs]
  18734. 341.92 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  18735. 341.92 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  18736. 341.92 s [algebraic-graphs]
  18737. 341.92 s [algebraic-graphs] ============ Labelled.AdjacencyMap.connect ============
  18738. 341.92 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  18739. 341.92 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  18740. 341.92 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  18741. 341.92 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  18742. 341.92 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  18743. 341.92 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  18744. 341.92 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  18745. 341.92 s [algebraic-graphs]
  18746. 341.92 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertices ============
  18747. 341.92 s [algebraic-graphs] OK: vertices [] == empty
  18748. 341.92 s [algebraic-graphs] OK: vertices [x] == vertex x
  18749. 341.92 s [algebraic-graphs] OK: vertices == overlays . map vertex
  18750. 341.92 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  18751. 341.92 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  18752. 341.92 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18753. 341.92 s [algebraic-graphs]
  18754. 341.92 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edges ============
  18755. 341.92 s [algebraic-graphs] OK: edges [] == empty
  18756. 341.92 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  18757. 341.92 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  18758. 341.92 s [algebraic-graphs]
  18759. 341.92 s [algebraic-graphs] ============ Labelled.AdjacencyMap.overlays ============
  18760. 341.92 s [algebraic-graphs] OK: overlays [] == empty
  18761. 341.92 s [algebraic-graphs] OK: overlays [x] == x
  18762. 341.92 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  18763. 341.92 s [algebraic-graphs] OK: overlays == foldr overlay empty
  18764. 341.92 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  18765. 341.92 s [algebraic-graphs]
  18766. 341.92 s [algebraic-graphs] ============ Labelled.AdjacencyMap.fromAdjacencyMaps ============
  18767. 341.92 s [algebraic-graphs] OK: fromAdjacencyMaps [] == empty
  18768. 341.92 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.empty)] == vertex x
  18769. 341.92 s [algebraic-graphs] OK: fromAdjacencyMaps [(x, Map.singleton y e)] == if e == zero then vertices [x,y] else edge e x y
  18770. 341.92 s [algebraic-graphs] OK: overlay (fromAdjacencyMaps xs) (fromAdjacencyMaps ys) == fromAdjacencyMaps (xs ++ ys)
  18771. 341.92 s [algebraic-graphs]
  18772. 341.92 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isSubgraphOf ============
  18773. 341.92 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  18774. 341.92 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  18775. 341.92 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  18776. 341.93 s [algebraic-graphs]
  18777. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.isEmpty ============
  18778. 341.93 s [algebraic-graphs] OK: isEmpty empty == True
  18779. 341.93 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  18780. 341.93 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18781. 341.93 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  18782. 341.93 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  18783. 341.93 s [algebraic-graphs]
  18784. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasVertex ============
  18785. 341.93 s [algebraic-graphs] OK: hasVertex x empty == False
  18786. 341.93 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18787. 341.93 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  18788. 341.93 s [algebraic-graphs]
  18789. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.hasEdge ============
  18790. 341.93 s [algebraic-graphs] OK: hasEdge x y empty == False
  18791. 341.93 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  18792. 341.93 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  18793. 341.93 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  18794. 341.93 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  18795. 341.93 s [algebraic-graphs]
  18796. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeLabel ============
  18797. 341.93 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  18798. 341.93 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  18799. 341.93 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  18800. 341.93 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  18801. 341.93 s [algebraic-graphs]
  18802. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexCount ============
  18803. 341.93 s [algebraic-graphs] OK: vertexCount empty == 0
  18804. 341.93 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18805. 341.93 s [algebraic-graphs] OK: vertexCount == length . vertexList
  18806. 341.93 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  18807. 341.93 s [algebraic-graphs]
  18808. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeCount ============
  18809. 341.93 s [algebraic-graphs] OK: edgeCount empty == 0
  18810. 341.93 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18811. 341.93 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  18812. 341.93 s [algebraic-graphs] OK: edgeCount == length . edgeList
  18813. 341.93 s [algebraic-graphs]
  18814. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexList ============
  18815. 341.93 s [algebraic-graphs] OK: vertexList empty == []
  18816. 341.93 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  18817. 341.93 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  18818. 341.93 s [algebraic-graphs]
  18819. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeList ============
  18820. 341.93 s [algebraic-graphs] OK: edgeList empty == []
  18821. 341.93 s [algebraic-graphs] OK: edgeList (vertex x) == []
  18822. 341.93 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  18823. 341.93 s [algebraic-graphs]
  18824. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.vertexSet ============
  18825. 341.93 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  18826. 341.93 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  18827. 341.93 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18828. 341.93 s [algebraic-graphs]
  18829. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.edgeSet ============
  18830. 341.93 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  18831. 341.93 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  18832. 341.93 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  18833. 341.93 s [algebraic-graphs]
  18834. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.preSet ============
  18835. 341.93 s [algebraic-graphs] OK: preSet x empty == Set.empty
  18836. 341.93 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  18837. 341.93 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  18838. 341.93 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  18839. 341.93 s [algebraic-graphs]
  18840. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.postSet ============
  18841. 341.93 s [algebraic-graphs] OK: postSet x empty == Set.empty
  18842. 341.93 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  18843. 341.93 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  18844. 341.93 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  18845. 341.93 s [algebraic-graphs]
  18846. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.skeleton ============
  18847. 341.93 s [algebraic-graphs] OK: hasEdge x y == hasEdge x y . skeleton
  18848. 341.93 s [algebraic-graphs]
  18849. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeVertex ============
  18850. 341.93 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  18851. 341.93 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  18852. 341.93 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  18853. 341.93 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  18854. 341.93 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  18855. 341.93 s [algebraic-graphs]
  18856. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.removeEdge ============
  18857. 341.93 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  18858. 341.93 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  18859. 341.93 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  18860. 341.93 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  18861. 341.93 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  18862. 341.93 s [algebraic-graphs]
  18863. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceVertex ============
  18864. 341.93 s [algebraic-graphs] OK: replaceVertex x x == id
  18865. 341.93 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  18866. 341.93 s [algebraic-graphs] OK: replaceVertex x y == gmap (\v -> if v == x then y else v)
  18867. 341.93 s [algebraic-graphs]
  18868. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.replaceEdge ============
  18869. 341.93 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  18870. 341.93 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  18871. 341.93 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  18872. 341.93 s [algebraic-graphs]
  18873. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transpose ============
  18874. 341.93 s [algebraic-graphs] OK: transpose empty == empty
  18875. 341.93 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  18876. 341.93 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  18877. 341.93 s [algebraic-graphs] OK: transpose . transpose == id
  18878. 341.93 s [algebraic-graphs]
  18879. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.gmap ============
  18880. 341.93 s [algebraic-graphs] OK: gmap f empty == empty
  18881. 341.93 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  18882. 341.93 s [algebraic-graphs] OK: gmap f (edge e x y) == edge e (f x) (f y)
  18883. 341.93 s [algebraic-graphs] OK: gmap id == id
  18884. 341.93 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  18885. 341.93 s [algebraic-graphs]
  18886. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.emap ============
  18887. 341.93 s [algebraic-graphs] OK: emap h empty == empty
  18888. 341.93 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  18889. 341.93 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  18890. 341.93 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  18891. 341.93 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  18892. 341.93 s [algebraic-graphs] OK: emap id == id
  18893. 341.93 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  18894. 341.93 s [algebraic-graphs]
  18895. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induce ============
  18896. 341.93 s [algebraic-graphs] OK: induce (const True ) x == x
  18897. 341.93 s [algebraic-graphs] OK: induce (const False) x == empty
  18898. 341.93 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  18899. 341.93 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  18900. 341.93 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  18901. 341.93 s [algebraic-graphs]
  18902. 341.93 s [algebraic-graphs] ============ Labelled.AdjacencyMap.induceJust ============
  18903. 343.01 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  18904. 343.01 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  18905. 343.01 s [algebraic-graphs] OK: induceJust . gmap Just == id
  18906. 343.01 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  18907. 343.01 s [algebraic-graphs]
  18908. 343.01 s [algebraic-graphs] ============ Labelled.AdjacencyMap.closure ============
  18909. 343.01 s [algebraic-graphs] OK: closure empty == empty
  18910. 343.01 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  18911. 343.01 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  18912. 343.01 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  18913. 343.01 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  18914. 343.01 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  18915. 343.01 s [algebraic-graphs] OK: closure . closure == closure
  18916. 343.01 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  18917. 343.01 s [algebraic-graphs]
  18918. 343.01 s [algebraic-graphs] ============ Labelled.AdjacencyMap.reflexiveClosure ============
  18919. 343.01 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  18920. 343.01 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  18921. 343.01 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  18922. 343.01 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  18923. 343.01 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  18924. 343.01 s [algebraic-graphs]
  18925. 343.01 s [algebraic-graphs] ============ Labelled.AdjacencyMap.symmetricClosure ============
  18926. 343.01 s [algebraic-graphs] OK: symmetricClosure empty == empty
  18927. 343.01 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  18928. 343.01 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  18929. 343.01 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  18930. 343.01 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  18931. 343.01 s [algebraic-graphs]
  18932. 343.01 s [algebraic-graphs] ============ Labelled.AdjacencyMap.transitiveClosure ============
  18933. 343.01 s [algebraic-graphs] OK: transitiveClosure empty == empty
  18934. 343.01 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  18935. 343.01 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  18936. 343.01 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  18937. 343.01 s [algebraic-graphs]
  18938. 343.01 s [algebraic-graphs] ============ Labelled.Graph.empty ============
  18939. 343.01 s [algebraic-graphs] OK: isEmpty empty == True
  18940. 343.01 s [algebraic-graphs] OK: hasVertex x empty == False
  18941. 343.01 s [algebraic-graphs] OK: vertexCount empty == 0
  18942. 343.01 s [algebraic-graphs] OK: edgeCount empty == 0
  18943. 343.01 s [algebraic-graphs]
  18944. 343.01 s [algebraic-graphs] ============ Labelled.Graph.vertex ============
  18945. 343.01 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  18946. 343.01 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  18947. 343.01 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  18948. 343.01 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  18949. 343.01 s [algebraic-graphs]
  18950. 343.01 s [algebraic-graphs] ============ Labelled.Graph.edge ============
  18951. 343.01 s [algebraic-graphs] OK: edge e x y == connect e (vertex x) (vertex y)
  18952. 343.01 s [algebraic-graphs] OK: edge zero x y == vertices [x,y]
  18953. 343.01 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= mempty)
  18954. 343.01 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  18955. 343.01 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == mempty then 0 else 1
  18956. 343.01 s [algebraic-graphs] OK: vertexCount (edge e 1 1) == 1
  18957. 343.01 s [algebraic-graphs] OK: vertexCount (edge e 1 2) == 2
  18958. 343.01 s [algebraic-graphs] OK: x -<e>- y == edge e x y
  18959. 343.01 s [algebraic-graphs]
  18960. 343.01 s [algebraic-graphs] ============ Labelled.Graph.overlay ============
  18961. 343.01 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  18962. 343.01 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  18963. 343.01 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  18964. 343.01 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  18965. 343.01 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  18966. 343.01 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  18967. 343.01 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  18968. 343.01 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  18969. 343.01 s [algebraic-graphs]
  18970. 343.01 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge zero x y) == e
  18971. 343.01 s [algebraic-graphs] OK: edgeLabel x y $ overlay (edge e x y) (edge f x y) == e <+> f
  18972. 343.01 s [algebraic-graphs]
  18973. 343.01 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge one 2 3)) == e
  18974. 343.01 s [algebraic-graphs] OK: edgeLabel 1 3 $ transitiveClosure (overlay (edge e 1 2) (edge f 2 3)) == e <.> f
  18975. 343.01 s [algebraic-graphs]
  18976. 343.01 s [algebraic-graphs] ============ Labelled.Graph.connect ============
  18977. 343.01 s [algebraic-graphs] OK: isEmpty (connect e x y) == isEmpty x && isEmpty y
  18978. 343.01 s [algebraic-graphs] OK: hasVertex z (connect e x y) == hasVertex z x || hasVertex z y
  18979. 343.01 s [algebraic-graphs] OK: vertexCount (connect e x y) >= vertexCount x
  18980. 343.01 s [algebraic-graphs] OK: vertexCount (connect e x y) <= vertexCount x + vertexCount y
  18981. 343.01 s [algebraic-graphs] OK: edgeCount (connect e x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  18982. 343.01 s [algebraic-graphs] OK: vertexCount (connect e 1 2) == 2
  18983. 343.01 s [algebraic-graphs] OK: edgeCount (connect e 1 2) == if e == zero then 0 else 1
  18984. 343.01 s [algebraic-graphs]
  18985. 343.01 s [algebraic-graphs] ============ Labelled.Graph.vertices ============
  18986. 343.01 s [algebraic-graphs] OK: vertices [] == empty
  18987. 343.01 s [algebraic-graphs] OK: vertices [x] == vertex x
  18988. 343.01 s [algebraic-graphs] OK: vertices == overlays . map vertex
  18989. 343.01 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  18990. 343.01 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  18991. 343.01 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  18992. 343.01 s [algebraic-graphs]
  18993. 343.01 s [algebraic-graphs] ============ Labelled.Graph.edges ============
  18994. 343.01 s [algebraic-graphs] OK: edges [] == empty
  18995. 343.01 s [algebraic-graphs] OK: edges [(e,x,y)] == edge e x y
  18996. 343.01 s [algebraic-graphs] OK: edges == overlays . map (\(e, x, y) -> edge e x y)
  18997. 343.01 s [algebraic-graphs]
  18998. 343.01 s [algebraic-graphs] ============ Labelled.Graph.overlays ============
  18999. 343.01 s [algebraic-graphs] OK: overlays [] == empty
  19000. 343.01 s [algebraic-graphs] OK: overlays [x] == x
  19001. 343.01 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19002. 343.01 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19003. 343.01 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19004. 343.01 s [algebraic-graphs]
  19005. 343.01 s [algebraic-graphs] ============ Labelled.Graph.foldg ============
  19006. 343.01 s [algebraic-graphs] OK: foldg empty vertex connect == id
  19007. 343.01 s [algebraic-graphs] OK: foldg empty vertex (fmap flip connect) == transpose
  19008. 343.01 s [algebraic-graphs] OK: foldg 1 (const 1) (const (+)) == size
  19009. 343.01 s [algebraic-graphs] OK: foldg True (const False) (const (&&)) == isEmpty
  19010. 343.01 s [algebraic-graphs] OK: foldg False (== x) (const (||)) == hasVertex x
  19011. 343.01 s [algebraic-graphs] OK: foldg Set.empty Set.singleton (const Set.union) == vertexSet
  19012. 343.01 s [algebraic-graphs]
  19013. 343.01 s [algebraic-graphs] ============ Labelled.Graph.buildg ============
  19014. 343.01 s [algebraic-graphs] OK: buildg (\e _ _ -> e) == empty
  19015. 343.01 s [algebraic-graphs] OK: buildg (\_ v _ -> v x) == vertex x
  19016. 343.01 s [algebraic-graphs] OK: buildg (\e v c -> c l (foldg e v c x) (foldg e v c y)) == connect l x y
  19017. 343.01 s [algebraic-graphs] OK: buildg (\e v c -> foldr (c zero) e (map v xs)) == vertices xs
  19018. 343.01 s [algebraic-graphs] OK: buildg (\e v c -> foldg e v (flip c) g) == transpose g
  19019. 343.01 s [algebraic-graphs]
  19020. 343.01 s [algebraic-graphs] ============ Labelled.Graph.isSubgraphOf ============
  19021. 343.01 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19022. 343.01 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19023. 343.01 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19024. 343.01 s [algebraic-graphs]
  19025. 343.01 s [algebraic-graphs] ============ Labelled.Graph.isEmpty ============
  19026. 343.01 s [algebraic-graphs] OK: isEmpty empty == True
  19027. 343.01 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19028. 343.01 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19029. 343.01 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19030. 343.01 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge e x y) == False
  19031. 343.01 s [algebraic-graphs]
  19032. 343.01 s [algebraic-graphs] ============ Labelled.Graph.size ============
  19033. 343.01 s [algebraic-graphs] OK: size empty == 1
  19034. 343.01 s [algebraic-graphs] OK: size (vertex x) == 1
  19035. 343.01 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  19036. 343.01 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  19037. 343.01 s [algebraic-graphs] OK: size x >= 1
  19038. 343.01 s [algebraic-graphs] OK: size x >= vertexCount x
  19039. 343.01 s [algebraic-graphs]
  19040. 343.01 s [algebraic-graphs] ============ Labelled.Graph.hasVertex ============
  19041. 343.01 s [algebraic-graphs] OK: hasVertex x empty == False
  19042. 343.01 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19043. 343.01 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19044. 343.01 s [algebraic-graphs]
  19045. 343.01 s [algebraic-graphs] ============ Labelled.Graph.hasEdge ============
  19046. 343.01 s [algebraic-graphs] OK: hasEdge x y empty == False
  19047. 343.01 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19048. 343.01 s [algebraic-graphs] OK: hasEdge x y (edge e x y) == (e /= zero)
  19049. 343.01 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19050. 343.01 s [algebraic-graphs] OK: hasEdge x y == not . null . filter (\(_,ex,ey) -> ex == x && ey == y) . edgeList
  19051. 343.01 s [algebraic-graphs]
  19052. 343.01 s [algebraic-graphs] ============ Labelled.Graph.edgeLabel ============
  19053. 343.01 s [algebraic-graphs] OK: edgeLabel x y empty == zero
  19054. 343.01 s [algebraic-graphs] OK: edgeLabel x y (vertex z) == zero
  19055. 343.01 s [algebraic-graphs] OK: edgeLabel x y (edge e x y) == e
  19056. 343.01 s [algebraic-graphs] OK: edgeLabel s t (overlay x y) == edgeLabel s t x + edgeLabel s t y
  19057. 343.01 s [algebraic-graphs]
  19058. 343.01 s [algebraic-graphs] ============ Labelled.Graph.vertexCount ============
  19059. 343.01 s [algebraic-graphs] OK: vertexCount empty == 0
  19060. 343.01 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19061. 343.01 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19062. 343.01 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19063. 343.01 s [algebraic-graphs]
  19064. 343.01 s [algebraic-graphs] ============ Labelled.Graph.edgeCount ============
  19065. 343.01 s [algebraic-graphs] OK: edgeCount empty == 0
  19066. 343.01 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19067. 343.01 s [algebraic-graphs] OK: edgeCount (edge e x y) == if e == zero then 0 else 1
  19068. 343.01 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19069. 343.01 s [algebraic-graphs]
  19070. 343.01 s [algebraic-graphs] ============ Labelled.Graph.vertexList ============
  19071. 343.01 s [algebraic-graphs] OK: vertexList empty == []
  19072. 343.01 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19073. 343.01 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19074. 343.01 s [algebraic-graphs]
  19075. 343.01 s [algebraic-graphs] ============ Labelled.Graph.edgeList ============
  19076. 343.01 s [algebraic-graphs] OK: edgeList empty == []
  19077. 343.01 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19078. 343.01 s [algebraic-graphs] OK: edgeList (edge e x y) == if e == zero then [] else [(e,x,y)]
  19079. 343.01 s [algebraic-graphs]
  19080. 343.01 s [algebraic-graphs] ============ Labelled.Graph.vertexSet ============
  19081. 343.01 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19082. 343.01 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19083. 343.01 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19084. 343.01 s [algebraic-graphs]
  19085. 343.01 s [algebraic-graphs] ============ Labelled.Graph.edgeSet ============
  19086. 343.01 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19087. 343.01 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19088. 343.01 s [algebraic-graphs] OK: edgeSet (edge e x y) == if e == zero then Set.empty else Set.singleton (e,x,y)
  19089. 343.01 s [algebraic-graphs]
  19090. 343.01 s [algebraic-graphs] ============ Labelled.Graph.preSet ============
  19091. 343.01 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19092. 343.01 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19093. 345.43 s [algebraic-graphs] OK: preSet 1 (edge e 1 2) == Set.empty
  19094. 345.85 s [algebraic-graphs] OK: preSet y (edge e x y) == if e == zero then Set.empty else Set.fromList [x]
  19095. 345.85 s [algebraic-graphs]
  19096. 345.85 s [algebraic-graphs] ============ Labelled.Graph.postSet ============
  19097. 345.85 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19098. 345.85 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19099. 345.85 s [algebraic-graphs] OK: postSet x (edge e x y) == if e == zero then Set.empty else Set.fromList [y]
  19100. 345.85 s [algebraic-graphs] OK: postSet 2 (edge e 1 2) == Set.empty
  19101. 345.85 s [algebraic-graphs]
  19102. 345.85 s [algebraic-graphs] ============ Labelled.Graph.removeVertex ============
  19103. 345.85 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  19104. 345.85 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  19105. 345.85 s [algebraic-graphs] OK: removeVertex x (edge e x x) == empty
  19106. 345.85 s [algebraic-graphs] OK: removeVertex 1 (edge e 1 2) == vertex 2
  19107. 345.85 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  19108. 345.85 s [algebraic-graphs]
  19109. 345.85 s [algebraic-graphs] ============ Labelled.Graph.removeEdge ============
  19110. 345.85 s [algebraic-graphs] OK: removeEdge x y (edge e x y) == vertices [x,y]
  19111. 345.85 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19112. 345.85 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  19113. 345.85 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19114. 345.85 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19115. 345.85 s [algebraic-graphs]
  19116. 345.85 s [algebraic-graphs] ============ Labelled.Graph.replaceVertex ============
  19117. 345.85 s [algebraic-graphs] OK: replaceVertex x x == id
  19118. 345.85 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19119. 345.85 s [algebraic-graphs] OK: replaceVertex x y == fmap (\v -> if v == x then y else v)
  19120. 345.85 s [algebraic-graphs]
  19121. 345.85 s [algebraic-graphs] ============ Labelled.Graph.replaceEdge ============
  19122. 345.85 s [algebraic-graphs] OK: replaceEdge e x y z == overlay (removeEdge x y z) (edge e x y)
  19123. 345.85 s [algebraic-graphs] OK: replaceEdge e x y (edge f x y) == edge e x y
  19124. 345.85 s [algebraic-graphs] OK: edgeLabel x y (replaceEdge e x y z) == e
  19125. 345.85 s [algebraic-graphs]
  19126. 345.85 s [algebraic-graphs] ============ Labelled.Graph.transpose ============
  19127. 345.85 s [algebraic-graphs] OK: transpose empty == empty
  19128. 345.85 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19129. 345.85 s [algebraic-graphs] OK: transpose (edge e x y) == edge e y x
  19130. 345.85 s [algebraic-graphs] OK: transpose . transpose == id
  19131. 345.85 s [algebraic-graphs]
  19132. 345.85 s [algebraic-graphs] ============ Labelled.Graph.fmap ============
  19133. 345.85 s [algebraic-graphs] OK: fmap f empty == empty
  19134. 345.85 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  19135. 345.85 s [algebraic-graphs] OK: fmap f (edge e x y) == edge e (f x) (f y)
  19136. 345.85 s [algebraic-graphs] OK: fmap id == id
  19137. 345.85 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  19138. 345.85 s [algebraic-graphs]
  19139. 345.85 s [algebraic-graphs] ============ Labelled.Graph.emap ============
  19140. 345.85 s [algebraic-graphs] OK: emap h empty == empty
  19141. 345.85 s [algebraic-graphs] OK: emap h (vertex x) == vertex x
  19142. 345.85 s [algebraic-graphs] OK: emap h (edge e x y) == edge (h e) x y
  19143. 345.85 s [algebraic-graphs] OK: emap h (overlay x y) == overlay (emap h x) (emap h y)
  19144. 345.85 s [algebraic-graphs] OK: emap h (connect e x y) == connect (h e) (emap h x) (emap h y)
  19145. 345.85 s [algebraic-graphs] OK: emap id == id
  19146. 345.85 s [algebraic-graphs] OK: emap g . emap h == emap (g . h)
  19147. 345.85 s [algebraic-graphs]
  19148. 345.85 s [algebraic-graphs] ============ Labelled.Graph.induce ============
  19149. 345.85 s [algebraic-graphs] OK: induce (const True ) x == x
  19150. 345.85 s [algebraic-graphs] OK: induce (const False) x == empty
  19151. 345.85 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  19152. 345.85 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  19153. 345.85 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  19154. 345.85 s [algebraic-graphs]
  19155. 345.85 s [algebraic-graphs] ============ Labelled.Graph.induceJust ============
  19156. 345.85 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  19157. 345.85 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  19158. 345.85 s [algebraic-graphs] OK: induceJust . gmap Just == id
  19159. 345.85 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  19160. 345.85 s [algebraic-graphs]
  19161. 345.85 s [algebraic-graphs] ============ Labelled.Graph.closure ============
  19162. 345.85 s [algebraic-graphs] OK: closure empty == empty
  19163. 345.85 s [algebraic-graphs] OK: closure (vertex x) == edge one x x
  19164. 345.85 s [algebraic-graphs] OK: closure (edge e x x) == edge one x x
  19165. 345.85 s [algebraic-graphs] OK: closure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19166. 345.85 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  19167. 345.85 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  19168. 345.85 s [algebraic-graphs] OK: closure . closure == closure
  19169. 345.85 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  19170. 345.85 s [algebraic-graphs]
  19171. 345.85 s [algebraic-graphs] ============ Labelled.Graph.reflexiveClosure ============
  19172. 345.85 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  19173. 345.85 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge one x x
  19174. 345.85 s [algebraic-graphs] OK: reflexiveClosure (edge e x x) == edge one x x
  19175. 345.85 s [algebraic-graphs] OK: reflexiveClosure (edge e x y) == edges [(one,x,x), (e,x,y), (one,y,y)]
  19176. 345.85 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  19177. 345.85 s [algebraic-graphs]
  19178. 345.85 s [algebraic-graphs] ============ Labelled.Graph.symmetricClosure ============
  19179. 345.85 s [algebraic-graphs] OK: symmetricClosure empty == empty
  19180. 345.85 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  19181. 345.85 s [algebraic-graphs] OK: symmetricClosure (edge e x y) == edges [(e,x,y), (e,y,x)]
  19182. 345.85 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  19183. 345.85 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  19184. 345.85 s [algebraic-graphs]
  19185. 345.85 s [algebraic-graphs] ============ Labelled.Graph.transitiveClosure ============
  19186. 345.85 s [algebraic-graphs] OK: transitiveClosure empty == empty
  19187. 345.85 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19188. 345.85 s [algebraic-graphs] OK: transitiveClosure (edge e x y) == edge e x y
  19189. 345.85 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19190. 345.85 s [algebraic-graphs]
  19191. 345.85 s [algebraic-graphs] ============ Labelled.Graph.context ============
  19192. 345.85 s [algebraic-graphs] OK: context (const False) x == Nothing
  19193. 345.85 s [algebraic-graphs] OK: context (== 1) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [] [(e,2)])
  19194. 345.85 s [algebraic-graphs] OK: context (== 2) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [] )
  19195. 345.85 s [algebraic-graphs] OK: context (const True ) (edge e 1 2) == if e == zero then Just (Context [] []) else Just (Context [(e,1)] [(e,2)])
  19196. 345.85 s [algebraic-graphs] OK: context (== 4) (3 * 1 * 4 * 1 * 5) == Just (Context [(one,3), (one,1)] [(one,1), (one,5)])
  19197. 345.85 s [algebraic-graphs]
  19198. 345.85 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap ============
  19199. 345.85 s [algebraic-graphs] OK: Axioms of non-empty graphs
  19200. 345.85 s [algebraic-graphs] OK: Theorems of non-empty graphs
  19201. 345.85 s [algebraic-graphs]
  19202. 345.85 s [algebraic-graphs] ============ Ord (NonEmpty.AdjacencyMap a) ============
  19203. 345.85 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19204. 345.85 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19205. 345.85 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19206. 345.85 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19207. 345.85 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19208. 345.85 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  19209. 345.85 s [algebraic-graphs] OK: x <= x + y
  19210. 345.85 s [algebraic-graphs] OK: x + y <= x * y
  19211. 345.85 s [algebraic-graphs]
  19212. 345.85 s [algebraic-graphs] ============ Show (NonEmpty.AdjacencyMap a) ============
  19213. 345.85 s [algebraic-graphs] OK: show (1 :: AdjacencyMap Int) == "vertex 1"
  19214. 345.85 s [algebraic-graphs] OK: show (1 + 2 :: AdjacencyMap Int) == "vertices1 [1,2]"
  19215. 345.85 s [algebraic-graphs] OK: show (1 * 2 :: AdjacencyMap Int) == "edge 1 2"
  19216. 345.85 s [algebraic-graphs] OK: show (1 * 2 * 3 :: AdjacencyMap Int) == "edges1 [(1,2),(1,3),(2,3)]"
  19217. 345.85 s [algebraic-graphs] OK: show (1 * 2 + 3 :: AdjacencyMap Int) == "overlay (vertex 3) (edge 1 2)"
  19218. 345.85 s [algebraic-graphs] OK: show (vertex (-1) :: AdjacencyMap Int) == "vertex (-1)"
  19219. 345.85 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) :: AdjacencyMap Int) == "vertices1 [-2,-1]"
  19220. 345.85 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) :: AdjacencyMap Int) == "edge (-1) (-2)"
  19221. 345.85 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) * vertex (-3) :: AdjacencyMap Int) == "edges1 [(-2,-3),(-1,-3),(-1,-2)]"
  19222. 345.85 s [algebraic-graphs] OK: show (vertex (-1) * vertex (-2) + vertex (-3) :: AdjacencyMap Int) == "overlay (vertex (-3)) (edge (-1) (-2))"
  19223. 345.85 s [algebraic-graphs]
  19224. 345.85 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.toNonEmpty ============
  19225. 345.85 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  19226. 345.85 s [algebraic-graphs] OK: toNonEmpty . fromNonEmpty == Just
  19227. 345.85 s [algebraic-graphs]
  19228. 345.85 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.fromNonEmpty ============
  19229. 345.85 s [algebraic-graphs] OK: isEmpty . fromNonEmpty == const False
  19230. 345.85 s [algebraic-graphs]
  19231. 345.85 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertex ============
  19232. 345.85 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19233. 345.85 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19234. 345.85 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19235. 345.85 s [algebraic-graphs]
  19236. 345.85 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edge ============
  19237. 345.85 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  19238. 345.85 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19239. 345.85 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19240. 345.85 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  19241. 345.85 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  19242. 345.85 s [algebraic-graphs]
  19243. 345.85 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlay ============
  19244. 345.85 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19245. 345.85 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19246. 345.85 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19247. 345.85 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19248. 345.85 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19249. 345.85 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19250. 345.85 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19251. 345.85 s [algebraic-graphs]
  19252. 345.85 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connect ============
  19253. 345.85 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  19254. 345.85 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  19255. 345.85 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  19256. 345.85 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  19257. 345.85 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  19258. 345.85 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  19259. 345.85 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19260. 345.85 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  19261. 345.85 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  19262. 345.85 s [algebraic-graphs]
  19263. 345.85 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertices1 ============
  19264. 345.85 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  19265. 345.85 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  19266. 345.85 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  19267. 345.85 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  19268. 345.85 s [algebraic-graphs]
  19269. 345.85 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edges1 ============
  19270. 345.85 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  19271. 345.85 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  19272. 345.85 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  19273. 345.85 s [algebraic-graphs]
  19274. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.overlays1 ============
  19275. 348.17 s [algebraic-graphs] OK: overlays1 [x] == x
  19276. 348.17 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  19277. 348.17 s [algebraic-graphs]
  19278. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.connects1 ============
  19279. 348.17 s [algebraic-graphs] OK: connects1 [x] == x
  19280. 348.17 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  19281. 348.17 s [algebraic-graphs]
  19282. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.isSubgraphOf ============
  19283. 348.17 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  19284. 348.17 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  19285. 348.17 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  19286. 348.17 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19287. 348.17 s [algebraic-graphs]
  19288. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasVertex ============
  19289. 348.17 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19290. 348.17 s [algebraic-graphs]
  19291. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.hasEdge ============
  19292. 348.17 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19293. 348.17 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19294. 348.17 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19295. 348.17 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19296. 348.17 s [algebraic-graphs]
  19297. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexCount ============
  19298. 348.17 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19299. 348.17 s [algebraic-graphs] OK: vertexCount x >= 1
  19300. 348.17 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  19301. 348.17 s [algebraic-graphs]
  19302. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeCount ============
  19303. 348.17 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19304. 348.17 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19305. 348.17 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19306. 348.17 s [algebraic-graphs]
  19307. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexList1 ============
  19308. 348.17 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  19309. 348.17 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  19310. 348.17 s [algebraic-graphs]
  19311. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeList ============
  19312. 348.17 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19313. 348.17 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  19314. 348.17 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  19315. 348.17 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  19316. 348.17 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19317. 348.17 s [algebraic-graphs]
  19318. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.vertexSet ============
  19319. 348.17 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19320. 348.17 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  19321. 348.17 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  19322. 348.17 s [algebraic-graphs]
  19323. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.edgeSet ============
  19324. 348.17 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19325. 348.17 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  19326. 348.17 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  19327. 348.17 s [algebraic-graphs]
  19328. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.preSet ============
  19329. 348.17 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19330. 348.17 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  19331. 348.17 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  19332. 348.17 s [algebraic-graphs]
  19333. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.postSet ============
  19334. 348.17 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19335. 348.17 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  19336. 348.17 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  19337. 348.17 s [algebraic-graphs]
  19338. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.path1 ============
  19339. 348.17 s [algebraic-graphs] OK: path1 [x] == vertex x
  19340. 348.17 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  19341. 348.17 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  19342. 348.17 s [algebraic-graphs]
  19343. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.circuit1 ============
  19344. 348.17 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  19345. 348.17 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  19346. 348.17 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  19347. 348.17 s [algebraic-graphs]
  19348. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.clique1 ============
  19349. 348.17 s [algebraic-graphs] OK: clique1 [x] == vertex x
  19350. 348.17 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  19351. 348.17 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  19352. 348.17 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  19353. 348.17 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  19354. 348.17 s [algebraic-graphs]
  19355. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.biclique1 ============
  19356. 348.17 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  19357. 348.17 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  19358. 348.17 s [algebraic-graphs]
  19359. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.star ============
  19360. 348.17 s [algebraic-graphs] OK: star x [] == vertex x
  19361. 348.17 s [algebraic-graphs] OK: star x [y] == edge x y
  19362. 348.17 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  19363. 348.17 s [algebraic-graphs]
  19364. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.stars1 ============
  19365. 348.17 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  19366. 348.17 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  19367. 348.17 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  19368. 348.17 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  19369. 348.17 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  19370. 348.17 s [algebraic-graphs]
  19371. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.tree ============
  19372. 348.17 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  19373. 348.17 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  19374. 348.17 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  19375. 348.17 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  19376. 348.17 s [algebraic-graphs]
  19377. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeVertex1 ============
  19378. 348.17 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  19379. 348.17 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  19380. 348.17 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  19381. 348.17 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  19382. 348.17 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  19383. 348.17 s [algebraic-graphs]
  19384. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.removeEdge ============
  19385. 348.17 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  19386. 348.17 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19387. 348.17 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19388. 348.17 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19389. 348.17 s [algebraic-graphs]
  19390. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.replaceVertex ============
  19391. 348.17 s [algebraic-graphs] OK: replaceVertex x x == id
  19392. 348.17 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19393. 348.17 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  19394. 348.17 s [algebraic-graphs]
  19395. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.mergeVertices ============
  19396. 348.17 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  19397. 348.17 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  19398. 348.17 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  19399. 348.17 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  19400. 348.17 s [algebraic-graphs]
  19401. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transpose ============
  19402. 348.17 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19403. 348.17 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  19404. 348.17 s [algebraic-graphs] OK: transpose . transpose == id
  19405. 348.17 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19406. 348.17 s [algebraic-graphs]
  19407. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.gmap ============
  19408. 348.17 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  19409. 348.17 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  19410. 348.17 s [algebraic-graphs] OK: gmap id == id
  19411. 348.17 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  19412. 348.17 s [algebraic-graphs]
  19413. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induce1 ============
  19414. 348.17 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  19415. 348.17 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  19416. 348.17 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  19417. 348.17 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  19418. 348.17 s [algebraic-graphs]
  19419. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.induceJust1 ============
  19420. 348.17 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  19421. 348.17 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  19422. 348.17 s [algebraic-graphs] OK: induceJust1 . gmap Just == Just
  19423. 348.17 s [algebraic-graphs] OK: induceJust1 . gmap (\x -> if p x then Just x else Nothing) == induce1 p
  19424. 348.17 s [algebraic-graphs]
  19425. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.closure ============
  19426. 348.17 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  19427. 348.17 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  19428. 348.17 s [algebraic-graphs] OK: closure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  19429. 348.17 s [algebraic-graphs] OK: closure (path1 $ nub xs) == reflexiveClosure (clique1 $ nub xs)
  19430. 348.17 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  19431. 348.17 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  19432. 348.17 s [algebraic-graphs] OK: closure . closure == closure
  19433. 348.17 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  19434. 348.17 s [algebraic-graphs]
  19435. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.reflexiveClosure ============
  19436. 348.17 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  19437. 348.17 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  19438. 348.17 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges1 [(x,x), (x,y), (y,y)]
  19439. 348.17 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  19440. 348.17 s [algebraic-graphs]
  19441. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.symmetricClosure ============
  19442. 348.17 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  19443. 348.17 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges1 [(x,y), (y,x)]
  19444. 348.17 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  19445. 348.17 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  19446. 348.17 s [algebraic-graphs]
  19447. 348.17 s [algebraic-graphs] ============ NonEmpty.AdjacencyMap.transitiveClosure ============
  19448. 348.17 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  19449. 348.17 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  19450. 348.17 s [algebraic-graphs] OK: transitiveClosure (path1 $ nub xs) == clique1 (nub $ xs)
  19451. 348.17 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  19452. 348.17 s [algebraic-graphs]
  19453. 348.17 s [algebraic-graphs] ============ NonEmpty.Graph.============
  19454. 348.17 s [algebraic-graphs] OK: Axioms of non-empty graphs
  19455. 348.17 s [algebraic-graphs] OK: Theorems of non-empty graphs
  19456. 348.17 s [algebraic-graphs]
  19457. 348.17 s [algebraic-graphs] ============ Ord (NonEmpty.Graph a) ============
  19458. 348.17 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19459. 348.17 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19460. 348.17 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19461. 348.17 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19462. 348.17 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19463. 348.17 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  19464. 348.17 s [algebraic-graphs] OK: x <= x + y
  19465. 348.17 s [algebraic-graphs] OK: x + y <= x * y
  19466. 348.17 s [algebraic-graphs]
  19467. 348.17 s [algebraic-graphs] ============ Functor (NonEmpty.Graph a) ============
  19468. 348.17 s [algebraic-graphs] OK: fmap f (vertex x) == vertex (f x)
  19469. 348.17 s [algebraic-graphs] OK: fmap f (edge x y) == edge (f x) (f y)
  19470. 348.17 s [algebraic-graphs] OK: fmap id == id
  19471. 348.17 s [algebraic-graphs] OK: fmap f . fmap g == fmap (f . g)
  19472. 348.17 s [algebraic-graphs]
  19473. 348.17 s [algebraic-graphs] ============ Monad (NonEmpty.Graph a) ============
  19474. 348.17 s [algebraic-graphs] OK: (vertex x >>= f) == f x
  19475. 349.38 s [algebraic-graphs] OK: (edge x y >>= f) == connect (f x) (f y)
  19476. 349.38 s [algebraic-graphs] OK: (vertices1 xs >>= f) == overlays1 (fmap f xs)
  19477. 349.38 s [algebraic-graphs] OK: (x >>= vertex) == x
  19478. 349.38 s [algebraic-graphs] OK: ((x >>= f) >>= g) == (x >>= (\y -> (f y) >>= g))
  19479. 349.38 s [algebraic-graphs]
  19480. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.toNonEmpty ============
  19481. 349.38 s [algebraic-graphs] OK: toNonEmpty empty == Nothing
  19482. 349.38 s [algebraic-graphs] OK: toNonEmpty (toGraph x) == Just (x :: NonEmpty.Graph a)
  19483. 349.38 s [algebraic-graphs]
  19484. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.vertex ============
  19485. 349.38 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19486. 349.38 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19487. 349.38 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19488. 349.38 s [algebraic-graphs] OK: size (vertex x) == 1
  19489. 349.38 s [algebraic-graphs]
  19490. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.edge ============
  19491. 349.38 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  19492. 349.38 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19493. 349.38 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19494. 349.38 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  19495. 349.38 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  19496. 349.38 s [algebraic-graphs]
  19497. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.overlay ============
  19498. 349.38 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19499. 349.38 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19500. 349.38 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19501. 349.38 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19502. 349.38 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19503. 349.38 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  19504. 349.38 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19505. 349.38 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19506. 349.38 s [algebraic-graphs]
  19507. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.overlay1 ============
  19508. 349.38 s [algebraic-graphs] OK: overlay1 empty x == x
  19509. 349.38 s [algebraic-graphs] OK: x /= empty ==> overlay1 x y == overlay (fromJust $ toNonEmpty x) y
  19510. 349.38 s [algebraic-graphs]
  19511. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.connect ============
  19512. 349.38 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  19513. 349.38 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  19514. 349.38 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  19515. 349.38 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  19516. 349.38 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  19517. 349.38 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  19518. 349.38 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19519. 349.38 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  19520. 349.38 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  19521. 349.38 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  19522. 349.38 s [algebraic-graphs]
  19523. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.vertices1 ============
  19524. 349.38 s [algebraic-graphs] OK: vertices1 [x] == vertex x
  19525. 349.38 s [algebraic-graphs] OK: hasVertex x . vertices1 == elem x
  19526. 349.38 s [algebraic-graphs] OK: vertexCount . vertices1 == length . nub
  19527. 349.38 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  19528. 349.38 s [algebraic-graphs]
  19529. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.edges1 ============
  19530. 349.38 s [algebraic-graphs] OK: edges1 [(x,y)] == edge x y
  19531. 349.38 s [algebraic-graphs] OK: edges1 == overlays1 . fmap (uncurry edge)
  19532. 349.38 s [algebraic-graphs] OK: edgeCount . edges1 == length . nub
  19533. 349.38 s [algebraic-graphs]
  19534. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.overlays1 ============
  19535. 349.38 s [algebraic-graphs] OK: overlays1 [x] == x
  19536. 349.38 s [algebraic-graphs] OK: overlays1 [x,y] == overlay x y
  19537. 349.38 s [algebraic-graphs]
  19538. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.connects1 ============
  19539. 349.38 s [algebraic-graphs] OK: connects1 [x] == x
  19540. 349.38 s [algebraic-graphs] OK: connects1 [x,y] == connect x y
  19541. 349.38 s [algebraic-graphs]
  19542. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.foldg1 ============
  19543. 349.38 s [algebraic-graphs] OK: foldg1 vertex overlay connect == id
  19544. 349.38 s [algebraic-graphs] OK: foldg1 vertex overlay (flip connect) == transpose
  19545. 349.38 s [algebraic-graphs] OK: foldg1 (const 1) (+) (+) == size
  19546. 349.38 s [algebraic-graphs] OK: foldg1 (== x) (||) (||) == hasVertex x
  19547. 349.38 s [algebraic-graphs]
  19548. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.isSubgraphOf ============
  19549. 349.38 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  19550. 349.38 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  19551. 349.38 s [algebraic-graphs] OK: isSubgraphOf (path1 xs) (circuit1 xs) == True
  19552. 349.38 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19553. 349.38 s [algebraic-graphs]
  19554. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.(===) ============
  19555. 349.38 s [algebraic-graphs] OK: x === x == True
  19556. 349.38 s [algebraic-graphs] OK: x + y === x + y == True
  19557. 349.38 s [algebraic-graphs] OK: 1 + 2 === 2 + 1 == False
  19558. 349.38 s [algebraic-graphs] OK: x + y === x * y == False
  19559. 349.38 s [algebraic-graphs]
  19560. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.size ============
  19561. 349.38 s [algebraic-graphs] OK: size (vertex x) == 1
  19562. 349.38 s [algebraic-graphs] OK: size (overlay x y) == size x + size y
  19563. 349.38 s [algebraic-graphs] OK: size (connect x y) == size x + size y
  19564. 349.38 s [algebraic-graphs] OK: size x >= 1
  19565. 349.38 s [algebraic-graphs] OK: size x >= vertexCount x
  19566. 349.38 s [algebraic-graphs]
  19567. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.hasVertex ============
  19568. 349.38 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19569. 349.38 s [algebraic-graphs]
  19570. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.hasEdge ============
  19571. 349.38 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19572. 349.38 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19573. 349.38 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19574. 349.38 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19575. 349.38 s [algebraic-graphs]
  19576. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.vertexCount ============
  19577. 349.38 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19578. 349.38 s [algebraic-graphs] OK: vertexCount x >= 1
  19579. 349.38 s [algebraic-graphs] OK: vertexCount == length . vertexList1
  19580. 349.38 s [algebraic-graphs]
  19581. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.edgeCount ============
  19582. 349.38 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19583. 349.38 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19584. 349.38 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19585. 349.38 s [algebraic-graphs]
  19586. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.vertexList1 ============
  19587. 349.38 s [algebraic-graphs] OK: vertexList1 (vertex x) == [x]
  19588. 349.38 s [algebraic-graphs] OK: vertexList1 . vertices1 == nub . sort
  19589. 349.38 s [algebraic-graphs]
  19590. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.edgeList ============
  19591. 349.38 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19592. 349.38 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  19593. 349.38 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  19594. 349.38 s [algebraic-graphs] OK: edgeList . edges1 == nub . sort . toList
  19595. 349.38 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19596. 349.38 s [algebraic-graphs]
  19597. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.vertexSet ============
  19598. 349.38 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19599. 349.38 s [algebraic-graphs] OK: vertexSet . vertices1 == Set.fromList . toList
  19600. 349.38 s [algebraic-graphs] OK: vertexSet . clique1 == Set.fromList . toList
  19601. 349.38 s [algebraic-graphs]
  19602. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.edgeSet ============
  19603. 349.38 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19604. 349.38 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  19605. 349.38 s [algebraic-graphs] OK: edgeSet . edges1 == Set.fromList . toList
  19606. 349.38 s [algebraic-graphs]
  19607. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.path1 ============
  19608. 349.38 s [algebraic-graphs] OK: path1 [x] == vertex x
  19609. 349.38 s [algebraic-graphs] OK: path1 [x,y] == edge x y
  19610. 349.38 s [algebraic-graphs] OK: path1 . reverse == transpose . path1
  19611. 349.38 s [algebraic-graphs]
  19612. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.circuit1 ============
  19613. 349.38 s [algebraic-graphs] OK: circuit1 [x] == edge x x
  19614. 349.38 s [algebraic-graphs] OK: circuit1 [x,y] == edges1 [(x,y), (y,x)]
  19615. 349.38 s [algebraic-graphs] OK: circuit1 . reverse == transpose . circuit1
  19616. 349.38 s [algebraic-graphs]
  19617. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.clique1 ============
  19618. 349.38 s [algebraic-graphs] OK: clique1 [x] == vertex x
  19619. 349.38 s [algebraic-graphs] OK: clique1 [x,y] == edge x y
  19620. 349.38 s [algebraic-graphs] OK: clique1 [x,y,z] == edges1 [(x,y), (x,z), (y,z)]
  19621. 349.38 s [algebraic-graphs] OK: clique1 (xs <> ys) == connect (clique1 xs) (clique1 ys)
  19622. 349.38 s [algebraic-graphs] OK: clique1 . reverse == transpose . clique1
  19623. 349.38 s [algebraic-graphs]
  19624. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.biclique1 ============
  19625. 349.38 s [algebraic-graphs] OK: biclique1 [x1,x2] [y1,y2] == edges1 [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  19626. 349.38 s [algebraic-graphs] OK: biclique1 xs ys == connect (vertices1 xs) (vertices1 ys)
  19627. 349.38 s [algebraic-graphs]
  19628. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.star ============
  19629. 349.38 s [algebraic-graphs] OK: star x [] == vertex x
  19630. 349.38 s [algebraic-graphs] OK: star x [y] == edge x y
  19631. 349.38 s [algebraic-graphs] OK: star x [y,z] == edges1 [(x,y), (x,z)]
  19632. 349.38 s [algebraic-graphs]
  19633. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.stars1 ============
  19634. 349.38 s [algebraic-graphs] OK: stars1 [(x, [] )] == vertex x
  19635. 349.38 s [algebraic-graphs] OK: stars1 [(x, [y])] == edge x y
  19636. 349.38 s [algebraic-graphs] OK: stars1 [(x, ys )] == star x ys
  19637. 349.38 s [algebraic-graphs] OK: stars1 == overlays1 . fmap (uncurry star)
  19638. 349.38 s [algebraic-graphs] OK: overlay (stars1 xs) (stars1 ys) == stars1 (xs <> ys)
  19639. 349.38 s [algebraic-graphs]
  19640. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.tree ============
  19641. 349.38 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  19642. 349.38 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path1 [x,y,z]
  19643. 349.38 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  19644. 349.38 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges1 [(1,2), (1,3), (3,4), (3,5)]
  19645. 349.38 s [algebraic-graphs]
  19646. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.mesh1 ============
  19647. 349.38 s [algebraic-graphs] OK: mesh1 [x] [y] == vertex (x, y)
  19648. 349.38 s [algebraic-graphs] OK: mesh1 xs ys == box (path1 xs) (path1 ys)
  19649. 349.38 s [algebraic-graphs] OK: mesh1 [1,2,3] ['a', 'b'] == <correct result>
  19650. 349.38 s [algebraic-graphs] OK: size (mesh xs ys) == max 1 (3 * length xs * length ys - length xs - length ys -1)
  19651. 349.38 s [algebraic-graphs]
  19652. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.torus1 ============
  19653. 349.38 s [algebraic-graphs] OK: torus1 [x] [y] == edge (x,y) (x,y)
  19654. 349.38 s [algebraic-graphs] OK: torus1 xs ys == box (circuit1 xs) (circuit1 ys)
  19655. 349.38 s [algebraic-graphs] OK: torus1 [1,2] ['a', 'b'] == <correct result>
  19656. 349.38 s [algebraic-graphs] OK: size (torus1 xs ys) == max 1 (3 * length xs * length ys)
  19657. 349.38 s [algebraic-graphs]
  19658. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.removeVertex1 ============
  19659. 349.38 s [algebraic-graphs] OK: removeVertex1 x (vertex x) == Nothing
  19660. 349.38 s [algebraic-graphs] OK: removeVertex1 1 (vertex 2) == Just (vertex 2)
  19661. 349.38 s [algebraic-graphs] OK: removeVertex1 x (edge x x) == Nothing
  19662. 349.38 s [algebraic-graphs] OK: removeVertex1 1 (edge 1 2) == Just (vertex 2)
  19663. 349.38 s [algebraic-graphs] OK: removeVertex1 x >=> removeVertex1 x == removeVertex1 x
  19664. 349.38 s [algebraic-graphs]
  19665. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.removeEdge ============
  19666. 349.38 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices1 [x,y]
  19667. 349.38 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  19668. 349.38 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  19669. 349.38 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  19670. 349.38 s [algebraic-graphs] OK: size (removeEdge x y z) <= 3 * size z
  19671. 349.38 s [algebraic-graphs]
  19672. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.replaceVertex ============
  19673. 349.38 s [algebraic-graphs] OK: replaceVertex x x == id
  19674. 349.38 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  19675. 349.38 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  19676. 349.38 s [algebraic-graphs]
  19677. 349.38 s [algebraic-graphs] ============ NonEmpty.Graph.mergeVertices ============
  19678. 349.38 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  19679. 354.82 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  19680. 354.82 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  19681. 354.87 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  19682. 354.87 s [algebraic-graphs]
  19683. 354.87 s [algebraic-graphs] ============ NonEmpty.Graph.splitVertex1 ============
  19684. 354.87 s [algebraic-graphs] OK: splitVertex1 x [x] == id
  19685. 354.87 s [algebraic-graphs] OK: splitVertex1 x [y] == replaceVertex x y
  19686. 354.87 s [algebraic-graphs] OK: splitVertex1 1 [0,1] $ 1 * (2 + 3) == (0 + 1) * (2 + 3)
  19687. 354.87 s [algebraic-graphs]
  19688. 354.87 s [algebraic-graphs] ============ NonEmpty.Graph.transpose ============
  19689. 354.87 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  19690. 354.87 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  19691. 354.87 s [algebraic-graphs] OK: transpose . transpose == id
  19692. 354.87 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  19693. 354.87 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  19694. 354.87 s [algebraic-graphs]
  19695. 354.87 s [algebraic-graphs] ============ NonEmpty.Graph.induce1 ============
  19696. 354.87 s [algebraic-graphs] OK: induce1 (const True ) x == Just x
  19697. 354.87 s [algebraic-graphs] OK: induce1 (const False) x == Nothing
  19698. 354.87 s [algebraic-graphs] OK: induce1 (/= x) == removeVertex1 x
  19699. 354.87 s [algebraic-graphs] OK: induce1 p >=> induce1 q == induce1 (\x -> p x && q x)
  19700. 354.87 s [algebraic-graphs]
  19701. 354.87 s [algebraic-graphs] ============ NonEmpty.Graph.induceJust1 ============
  19702. 354.87 s [algebraic-graphs] OK: induceJust1 (vertex Nothing) == Nothing
  19703. 354.87 s [algebraic-graphs] OK: induceJust1 (edge (Just x) Nothing) == Just (vertex x)
  19704. 354.87 s [algebraic-graphs] OK: induceJust1 . fmap Just == Just
  19705. 354.87 s [algebraic-graphs] OK: induceJust1 . fmap (\x -> if p x then Just x else Nothing) == induce1 p
  19706. 354.87 s [algebraic-graphs]
  19707. 354.87 s [algebraic-graphs] ============ NonEmpty.Graph.simplify ============
  19708. 354.87 s [algebraic-graphs] OK: simplify == id
  19709. 354.87 s [algebraic-graphs] OK: size (simplify x) <= size x
  19710. 354.87 s [algebraic-graphs] OK: simplify 1 === 1
  19711. 354.87 s [algebraic-graphs] OK: simplify (1 + 1) === 1
  19712. 354.87 s [algebraic-graphs] OK: simplify (1 + 2 + 1) === 1 + 2
  19713. 354.87 s [algebraic-graphs] OK: simplify (1 * 1 * 1) === 1 * 1
  19714. 354.87 s [algebraic-graphs]
  19715. 354.87 s [algebraic-graphs] ============ NonEmpty.Graph.sparsify ============
  19716. 354.87 s [algebraic-graphs] OK: sort . reachable x == sort . rights . reachable (sparsify x) . Right
  19717. 354.87 s [algebraic-graphs] OK: vertexCount (sparsify x) <= vertexCount x + size x + 1
  19718. 354.87 s [algebraic-graphs] OK: edgeCount (sparsify x) <= 3 * size x
  19719. 354.87 s [algebraic-graphs] OK: size (sparsify x) <= 3 * size x
  19720. 354.87 s [algebraic-graphs]
  19721. 354.87 s [algebraic-graphs] ============ NonEmpty.Graph.sparsifyKL ============
  19722. 354.87 s [algebraic-graphs] OK: sort . reachable x == sort . filter (<= n) . reachable (sparsifyKL n x)
  19723. 354.87 s [algebraic-graphs] OK: length (vertices $ sparsifyKL n x) <= vertexCount x + size x + 1
  19724. 354.87 s [algebraic-graphs] OK: length (edges $ sparsifyKL n x) <= 3 * size x
  19725. 354.87 s [algebraic-graphs]
  19726. 354.87 s [algebraic-graphs] ============ NonEmpty.Graph.box ============
  19727. 354.87 s [algebraic-graphs] OK: box (path1 [0,1]) (path1 ['a','b']) == <correct result>
  19728. 354.87 s [algebraic-graphs] OK: box x y ~~ box y x
  19729. 354.87 s [algebraic-graphs] OK: box x (overlay y z) == overlay (box x y) (box x z)
  19730. 354.87 s [algebraic-graphs] OK: box x (vertex ()) ~~ x
  19731. 354.87 s [algebraic-graphs] OK: box x (box y z) ~~ box (box x y) z
  19732. 354.87 s [algebraic-graphs] OK: transpose (box x y) == box (transpose x) (transpose y)
  19733. 354.87 s [algebraic-graphs] OK: vertexCount (box x y) == vertexCount x * vertexCount y
  19734. 354.87 s [algebraic-graphs] OK: edgeCount (box x y) <= vertexCount x * edgeCount y + edgeCount x * vertexCount y
  19735. 354.87 s [algebraic-graphs]
  19736. 354.87 s [algebraic-graphs] ============ Relation ============
  19737. 354.87 s [algebraic-graphs] OK: Axioms of graphs
  19738. 354.87 s [algebraic-graphs]
  19739. 354.87 s [algebraic-graphs] ============ Relation.consistent ============
  19740. 354.87 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  19741. 354.87 s [algebraic-graphs]
  19742. 354.87 s [algebraic-graphs] OK: consistent empty == True
  19743. 354.87 s [algebraic-graphs] OK: consistent (vertex x) == True
  19744. 354.87 s [algebraic-graphs] OK: consistent (overlay x y) == True
  19745. 354.87 s [algebraic-graphs] OK: consistent (connect x y) == True
  19746. 354.87 s [algebraic-graphs] OK: consistent (edge x y) == True
  19747. 354.87 s [algebraic-graphs] OK: consistent (edges xs) == True
  19748. 354.87 s [algebraic-graphs] OK: consistent (stars xs) == True
  19749. 354.87 s [algebraic-graphs]
  19750. 354.87 s [algebraic-graphs] ============ Relation.Show ============
  19751. 354.87 s [algebraic-graphs] OK: show (empty ) == "empty"
  19752. 354.87 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  19753. 354.87 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  19754. 354.87 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  19755. 354.87 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  19756. 354.87 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  19757. 354.87 s [algebraic-graphs]
  19758. 354.87 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  19759. 354.87 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  19760. 354.87 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  19761. 354.87 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  19762. 354.87 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  19763. 354.87 s [algebraic-graphs]
  19764. 354.87 s [algebraic-graphs] ============ Relation.Ord ============
  19765. 354.87 s [algebraic-graphs] OK: vertex 1 < vertex 2
  19766. 354.87 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  19767. 354.87 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  19768. 354.87 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  19769. 354.87 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  19770. 354.87 s [algebraic-graphs] OK: edge 1 2 < edge 1 3
  19771. 354.87 s [algebraic-graphs] OK: x <= x + y
  19772. 354.87 s [algebraic-graphs] OK: x + y <= x * y
  19773. 354.87 s [algebraic-graphs]
  19774. 354.87 s [algebraic-graphs] ============ Relation.empty ============
  19775. 354.87 s [algebraic-graphs] OK: isEmpty empty == True
  19776. 354.87 s [algebraic-graphs] OK: hasVertex x empty == False
  19777. 354.87 s [algebraic-graphs] OK: vertexCount empty == 0
  19778. 354.87 s [algebraic-graphs] OK: edgeCount empty == 0
  19779. 354.87 s [algebraic-graphs]
  19780. 354.87 s [algebraic-graphs] ============ Relation.vertex ============
  19781. 354.87 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19782. 354.87 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19783. 354.87 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19784. 354.87 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19785. 354.87 s [algebraic-graphs]
  19786. 354.87 s [algebraic-graphs] ============ Relation.edge ============
  19787. 354.87 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  19788. 354.87 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19789. 354.87 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19790. 354.87 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  19791. 354.87 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  19792. 354.87 s [algebraic-graphs]
  19793. 354.87 s [algebraic-graphs] ============ Relation.overlay ============
  19794. 354.87 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  19795. 354.87 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  19796. 354.87 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  19797. 354.87 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  19798. 354.87 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  19799. 354.87 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  19800. 354.87 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  19801. 354.87 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  19802. 354.87 s [algebraic-graphs]
  19803. 354.87 s [algebraic-graphs] ============ Relation.connect ============
  19804. 354.87 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  19805. 354.87 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  19806. 354.87 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  19807. 354.87 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  19808. 354.87 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  19809. 354.87 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  19810. 354.87 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y
  19811. 354.87 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  19812. 354.87 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  19813. 354.87 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  19814. 354.87 s [algebraic-graphs]
  19815. 354.87 s [algebraic-graphs] ============ Relation.vertices ============
  19816. 354.87 s [algebraic-graphs] OK: vertices [] == empty
  19817. 354.87 s [algebraic-graphs] OK: vertices [x] == vertex x
  19818. 354.87 s [algebraic-graphs] OK: vertices == overlays . map vertex
  19819. 354.87 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  19820. 354.87 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  19821. 354.87 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19822. 354.87 s [algebraic-graphs]
  19823. 354.87 s [algebraic-graphs] ============ Relation.edges ============
  19824. 354.87 s [algebraic-graphs] OK: edges [] == empty
  19825. 354.87 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  19826. 354.87 s [algebraic-graphs] OK: edges == overlays . map (uncurry edge)
  19827. 354.87 s [algebraic-graphs] OK: edgeCount . edges == length . nub
  19828. 354.87 s [algebraic-graphs]
  19829. 354.87 s [algebraic-graphs] ============ Relation.overlays ============
  19830. 354.87 s [algebraic-graphs] OK: overlays [] == empty
  19831. 354.87 s [algebraic-graphs] OK: overlays [x] == x
  19832. 354.87 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  19833. 354.87 s [algebraic-graphs] OK: overlays == foldr overlay empty
  19834. 354.87 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  19835. 354.87 s [algebraic-graphs]
  19836. 354.87 s [algebraic-graphs] ============ Relation.connects ============
  19837. 354.87 s [algebraic-graphs] OK: connects [] == empty
  19838. 354.87 s [algebraic-graphs] OK: connects [x] == x
  19839. 354.87 s [algebraic-graphs] OK: connects [x,y] == connect x y
  19840. 354.87 s [algebraic-graphs] OK: connects == foldr connect empty
  19841. 354.87 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  19842. 354.87 s [algebraic-graphs]
  19843. 354.87 s [algebraic-graphs] ============ Relation.isSubgraphOf ============
  19844. 354.87 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  19845. 354.87 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  19846. 354.87 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  19847. 354.87 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  19848. 354.87 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  19849. 354.87 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  19850. 354.87 s [algebraic-graphs]
  19851. 354.87 s [algebraic-graphs] ============ Relation.toGraph et al. ============
  19852. 354.87 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  19853. 354.87 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  19854. 354.87 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  19855. 354.87 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  19856. 354.87 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  19857. 354.87 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  19858. 354.87 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  19859. 354.87 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  19860. 354.87 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  19861. 354.87 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  19862. 354.87 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  19863. 354.87 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  19864. 354.87 s [algebraic-graphs] OK: edgeSet == Algebra.Graph.AdjacencyMap.edgeSet . foldg empty vertex overlay connect
  19865. 354.87 s [algebraic-graphs] OK: preSet x == Algebra.Graph.AdjacencyMap.preSet x . toAdjacencyMap
  19866. 354.87 s [algebraic-graphs] OK: preIntSet x == Algebra.Graph.AdjacencyIntMap.preIntSet x . toAdjacencyIntMap
  19867. 354.87 s [algebraic-graphs] OK: postSet x == Algebra.Graph.AdjacencyMap.postSet x . toAdjacencyMap
  19868. 354.87 s [algebraic-graphs] OK: postIntSet x == Algebra.Graph.AdjacencyIntMap.postIntSet x . toAdjacencyIntMap
  19869. 357.81 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  19870. 357.81 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  19871. 357.81 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  19872. 357.81 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  19873. 357.81 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  19874. 357.81 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  19875. 357.81 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  19876. 357.81 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  19877. 357.81 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  19878. 357.81 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  19879. 357.81 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  19880. 357.81 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19881. 357.81 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  19882. 357.81 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  19883. 357.81 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  19884. 357.81 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  19885. 357.81 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  19886. 357.81 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  19887. 357.81 s [algebraic-graphs]
  19888. 357.81 s [algebraic-graphs] ============ Relation.foldg ============
  19889. 357.81 s [algebraic-graphs] OK: foldg empty vertex overlay connect == id
  19890. 357.81 s [algebraic-graphs] OK: foldg empty vertex overlay (flip connect) == transpose
  19891. 357.81 s [algebraic-graphs] OK: foldg 1 (const 1) (+) (+) == size
  19892. 357.81 s [algebraic-graphs] OK: foldg True (const False) (&&) (&&) == isEmpty
  19893. 357.81 s [algebraic-graphs]
  19894. 357.81 s [algebraic-graphs] ============ Relation.isEmpty ============
  19895. 357.81 s [algebraic-graphs] OK: isEmpty empty == True
  19896. 357.81 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  19897. 357.81 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  19898. 357.81 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  19899. 357.81 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  19900. 357.81 s [algebraic-graphs]
  19901. 357.81 s [algebraic-graphs] ============ Relation.hasVertex ============
  19902. 357.81 s [algebraic-graphs] OK: hasVertex x empty == False
  19903. 357.81 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  19904. 357.81 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  19905. 357.81 s [algebraic-graphs]
  19906. 357.81 s [algebraic-graphs] ============ Relation.hasEdge ============
  19907. 357.81 s [algebraic-graphs] OK: hasEdge x y empty == False
  19908. 357.81 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  19909. 357.81 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  19910. 357.81 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  19911. 357.81 s [algebraic-graphs] OK: hasEdge x y == elem (x,y) . edgeList
  19912. 357.81 s [algebraic-graphs]
  19913. 357.81 s [algebraic-graphs] ============ Relation.vertexCount ============
  19914. 357.81 s [algebraic-graphs] OK: vertexCount empty == 0
  19915. 357.82 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  19916. 357.82 s [algebraic-graphs] OK: vertexCount == length . vertexList
  19917. 357.82 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  19918. 357.82 s [algebraic-graphs]
  19919. 357.82 s [algebraic-graphs] ============ Relation.edgeCount ============
  19920. 357.82 s [algebraic-graphs] OK: edgeCount empty == 0
  19921. 357.82 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  19922. 357.82 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  19923. 357.82 s [algebraic-graphs] OK: edgeCount == length . edgeList
  19924. 357.82 s [algebraic-graphs]
  19925. 357.82 s [algebraic-graphs] ============ Relation.vertexList ============
  19926. 357.82 s [algebraic-graphs] OK: vertexList empty == []
  19927. 357.82 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  19928. 357.82 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  19929. 357.82 s [algebraic-graphs]
  19930. 357.82 s [algebraic-graphs] ============ Relation.vertexSet ============
  19931. 357.82 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  19932. 357.82 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  19933. 357.82 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  19934. 357.82 s [algebraic-graphs]
  19935. 357.82 s [algebraic-graphs] ============ Relation.vertexIntSet ============
  19936. 357.82 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  19937. 357.82 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  19938. 357.82 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  19939. 357.82 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  19940. 357.82 s [algebraic-graphs]
  19941. 357.82 s [algebraic-graphs] ============ Relation.edgeList ============
  19942. 357.82 s [algebraic-graphs] OK: edgeList empty == []
  19943. 357.82 s [algebraic-graphs] OK: edgeList (vertex x) == []
  19944. 357.82 s [algebraic-graphs] OK: edgeList (edge x y) == [(x,y)]
  19945. 357.82 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(2,1), (2,3)]
  19946. 357.82 s [algebraic-graphs] OK: edgeList . edges == nub . sort
  19947. 357.82 s [algebraic-graphs]
  19948. 357.82 s [algebraic-graphs] ============ Relation.edgeSet ============
  19949. 357.82 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  19950. 357.82 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  19951. 357.82 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (x,y)
  19952. 357.82 s [algebraic-graphs] OK: edgeSet . edges == Set.fromList
  19953. 357.82 s [algebraic-graphs]
  19954. 357.82 s [algebraic-graphs] ============ Relation.adjacencyList ============
  19955. 357.82 s [algebraic-graphs] OK: adjacencyList empty == []
  19956. 357.82 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  19957. 357.82 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [])]
  19958. 357.82 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, []), (2, [1,3]), (3, [])]
  19959. 357.82 s [algebraic-graphs]
  19960. 357.82 s [algebraic-graphs] ============ Relation.preSet ============
  19961. 357.82 s [algebraic-graphs] OK: preSet x empty == Set.empty
  19962. 357.82 s [algebraic-graphs] OK: preSet x (vertex x) == Set.empty
  19963. 357.82 s [algebraic-graphs] OK: preSet 1 (edge 1 2) == Set.empty
  19964. 357.82 s [algebraic-graphs] OK: preSet y (edge x y) == Set.fromList [x]
  19965. 357.82 s [algebraic-graphs]
  19966. 357.82 s [algebraic-graphs] ============ Relation.preIntSet ============
  19967. 357.82 s [algebraic-graphs] OK: preIntSet x empty == IntSet.empty
  19968. 357.82 s [algebraic-graphs] OK: preIntSet x (vertex x) == IntSet.empty
  19969. 357.82 s [algebraic-graphs] OK: preIntSet 1 (edge 1 2) == IntSet.empty
  19970. 357.82 s [algebraic-graphs] OK: preIntSet y (edge x y) == IntSet.fromList [x]
  19971. 357.82 s [algebraic-graphs]
  19972. 357.82 s [algebraic-graphs] ============ Relation.postSet ============
  19973. 357.82 s [algebraic-graphs] OK: postSet x empty == Set.empty
  19974. 357.82 s [algebraic-graphs] OK: postSet x (vertex x) == Set.empty
  19975. 357.82 s [algebraic-graphs] OK: postSet x (edge x y) == Set.fromList [y]
  19976. 357.82 s [algebraic-graphs] OK: postSet 2 (edge 1 2) == Set.empty
  19977. 357.82 s [algebraic-graphs]
  19978. 357.82 s [algebraic-graphs] ============ Relation.postIntSet ============
  19979. 357.82 s [algebraic-graphs] OK: postIntSet x empty == IntSet.empty
  19980. 357.82 s [algebraic-graphs] OK: postIntSet x (vertex x) == IntSet.empty
  19981. 357.82 s [algebraic-graphs] OK: postIntSet 2 (edge 1 2) == IntSet.empty
  19982. 357.82 s [algebraic-graphs] OK: postIntSet x (edge x y) == IntSet.fromList [y]
  19983. 357.82 s [algebraic-graphs]
  19984. 357.82 s [algebraic-graphs] ============ Relation.path ============
  19985. 357.82 s [algebraic-graphs] OK: path [] == empty
  19986. 357.82 s [algebraic-graphs] OK: path [x] == vertex x
  19987. 357.82 s [algebraic-graphs] OK: path [x,y] == edge x y
  19988. 357.82 s [algebraic-graphs]
  19989. 357.82 s [algebraic-graphs] ============ Relation.circuit ============
  19990. 357.82 s [algebraic-graphs] OK: circuit [] == empty
  19991. 357.82 s [algebraic-graphs] OK: circuit [x] == edge x x
  19992. 357.82 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  19993. 357.82 s [algebraic-graphs]
  19994. 357.82 s [algebraic-graphs] ============ Relation.clique ============
  19995. 357.82 s [algebraic-graphs] OK: clique [] == empty
  19996. 357.82 s [algebraic-graphs] OK: clique [x] == vertex x
  19997. 357.82 s [algebraic-graphs] OK: clique [x,y] == edge x y
  19998. 357.82 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  19999. 357.82 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20000. 357.82 s [algebraic-graphs]
  20001. 357.82 s [algebraic-graphs] ============ Relation.biclique ============
  20002. 357.82 s [algebraic-graphs] OK: biclique [] [] == empty
  20003. 357.82 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20004. 357.82 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20005. 357.82 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20006. 357.82 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20007. 357.82 s [algebraic-graphs]
  20008. 357.82 s [algebraic-graphs] ============ Relation.star ============
  20009. 357.82 s [algebraic-graphs] OK: star x [] == vertex x
  20010. 357.82 s [algebraic-graphs] OK: star x [y] == edge x y
  20011. 357.82 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20012. 357.82 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20013. 357.82 s [algebraic-graphs]
  20014. 357.82 s [algebraic-graphs] ============ Relation.stars ============
  20015. 357.82 s [algebraic-graphs] OK: stars [] == empty
  20016. 357.82 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20017. 357.82 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20018. 357.82 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20019. 357.82 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20020. 357.82 s [algebraic-graphs] OK: stars . adjacencyList == id
  20021. 357.82 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20022. 357.82 s [algebraic-graphs]
  20023. 357.82 s [algebraic-graphs] ============ Relation.tree ============
  20024. 357.82 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20025. 357.82 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20026. 357.82 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20027. 357.82 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20028. 357.82 s [algebraic-graphs]
  20029. 357.82 s [algebraic-graphs] ============ Relation.forest ============
  20030. 357.82 s [algebraic-graphs] OK: forest [] == empty
  20031. 357.82 s [algebraic-graphs] OK: forest [x] == tree x
  20032. 357.82 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20033. 357.82 s [algebraic-graphs] OK: forest == overlays . map tree
  20034. 357.82 s [algebraic-graphs]
  20035. 357.82 s [algebraic-graphs] ============ Relation.removeVertex ============
  20036. 357.82 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20037. 357.82 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20038. 357.82 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20039. 357.82 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20040. 357.82 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20041. 357.82 s [algebraic-graphs]
  20042. 357.82 s [algebraic-graphs] ============ Relation.removeEdge ============
  20043. 357.82 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20044. 357.82 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20045. 357.82 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20046. 357.82 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20047. 357.82 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20048. 357.82 s [algebraic-graphs]
  20049. 357.82 s [algebraic-graphs] ============ Relation.replaceVertex ============
  20050. 357.82 s [algebraic-graphs] OK: replaceVertex x x == id
  20051. 357.82 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20052. 357.82 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20053. 357.82 s [algebraic-graphs]
  20054. 357.82 s [algebraic-graphs] ============ Relation.mergeVertices ============
  20055. 357.82 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20056. 376.99 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20057. 376.99 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20058. 377.03 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20059. 377.03 s [algebraic-graphs]
  20060. 377.03 s [algebraic-graphs] ============ Relation.transpose ============
  20061. 377.03 s [algebraic-graphs] OK: transpose empty == empty
  20062. 377.03 s [algebraic-graphs] OK: transpose (vertex x) == vertex x
  20063. 377.03 s [algebraic-graphs] OK: transpose (edge x y) == edge y x
  20064. 377.03 s [algebraic-graphs] OK: transpose . transpose == id
  20065. 377.03 s [algebraic-graphs] OK: edgeList . transpose == sort . map swap . edgeList
  20066. 377.03 s [algebraic-graphs]
  20067. 377.03 s [algebraic-graphs] ============ Relation.gmap ============
  20068. 377.03 s [algebraic-graphs] OK: gmap f empty == empty
  20069. 377.03 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20070. 377.03 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20071. 377.03 s [algebraic-graphs] OK: gmap id == id
  20072. 377.03 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20073. 377.03 s [algebraic-graphs]
  20074. 377.03 s [algebraic-graphs] ============ Relation.induce ============
  20075. 377.03 s [algebraic-graphs] OK: induce (const True ) x == x
  20076. 377.03 s [algebraic-graphs] OK: induce (const False) x == empty
  20077. 377.03 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20078. 377.03 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20079. 377.03 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20080. 377.03 s [algebraic-graphs]
  20081. 377.03 s [algebraic-graphs] ============ Relation.compose ============
  20082. 377.03 s [algebraic-graphs] OK: compose empty x == empty
  20083. 377.03 s [algebraic-graphs] OK: compose x empty == empty
  20084. 377.03 s [algebraic-graphs] OK: compose (vertex x) y == empty
  20085. 377.03 s [algebraic-graphs] OK: compose x (vertex y) == empty
  20086. 377.03 s [algebraic-graphs] OK: compose x (compose y z) == compose (compose x y) z
  20087. 377.03 s [algebraic-graphs] OK: compose x (overlay y z) == overlay (compose x y) (compose x z)
  20088. 377.03 s [algebraic-graphs] OK: compose (overlay x y) z == overlay (compose x z) (compose y z)
  20089. 377.03 s [algebraic-graphs] OK: compose (edge x y) (edge y z) == edge x z
  20090. 377.03 s [algebraic-graphs] OK: compose (path [1..5]) (path [1..5]) == edges [(1,3),(2,4),(3,5)]
  20091. 377.03 s [algebraic-graphs] OK: compose (circuit [1..5]) (circuit [1..5]) == circuit [1,3,5,2,4]
  20092. 377.03 s [algebraic-graphs]
  20093. 377.03 s [algebraic-graphs] ============ Relation.closure ============
  20094. 377.03 s [algebraic-graphs] OK: closure empty == empty
  20095. 377.03 s [algebraic-graphs] OK: closure (vertex x) == edge x x
  20096. 377.03 s [algebraic-graphs] OK: closure (edge x x) == edge x x
  20097. 377.03 s [algebraic-graphs] OK: closure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20098. 377.03 s [algebraic-graphs] OK: closure (path $ nub xs) == reflexiveClosure (clique $ nub xs)
  20099. 377.03 s [algebraic-graphs] OK: closure == reflexiveClosure . transitiveClosure
  20100. 377.03 s [algebraic-graphs] OK: closure == transitiveClosure . reflexiveClosure
  20101. 377.03 s [algebraic-graphs] OK: closure . closure == closure
  20102. 377.03 s [algebraic-graphs] OK: postSet x (closure y) == Set.fromList (reachable y x)
  20103. 377.03 s [algebraic-graphs]
  20104. 377.03 s [algebraic-graphs] ============ Relation.reflexiveClosure ============
  20105. 377.03 s [algebraic-graphs] OK: reflexiveClosure empty == empty
  20106. 377.03 s [algebraic-graphs] OK: reflexiveClosure (vertex x) == edge x x
  20107. 377.03 s [algebraic-graphs] OK: reflexiveClosure (edge x x) == edge x x
  20108. 377.03 s [algebraic-graphs] OK: reflexiveClosure (edge x y) == edges [(x,x), (x,y), (y,y)]
  20109. 377.03 s [algebraic-graphs] OK: reflexiveClosure . reflexiveClosure == reflexiveClosure
  20110. 377.03 s [algebraic-graphs]
  20111. 377.03 s [algebraic-graphs] ============ Relation.symmetricClosure ============
  20112. 377.03 s [algebraic-graphs] OK: symmetricClosure empty == empty
  20113. 377.03 s [algebraic-graphs] OK: symmetricClosure (vertex x) == vertex x
  20114. 377.03 s [algebraic-graphs] OK: symmetricClosure (edge x y) == edges [(x,y), (y,x)]
  20115. 377.03 s [algebraic-graphs] OK: symmetricClosure x == overlay x (transpose x)
  20116. 377.03 s [algebraic-graphs] OK: symmetricClosure . symmetricClosure == symmetricClosure
  20117. 377.03 s [algebraic-graphs]
  20118. 377.03 s [algebraic-graphs] ============ Relation.transitiveClosure ============
  20119. 377.03 s [algebraic-graphs] OK: transitiveClosure empty == empty
  20120. 377.03 s [algebraic-graphs] OK: transitiveClosure (vertex x) == vertex x
  20121. 377.03 s [algebraic-graphs] OK: transitiveClosure (edge x y) == edge x y
  20122. 377.03 s [algebraic-graphs] OK: transitiveClosure (path $ nub xs) == clique (nub $ xs)
  20123. 377.03 s [algebraic-graphs] OK: transitiveClosure . transitiveClosure == transitiveClosure
  20124. 377.03 s [algebraic-graphs]
  20125. 377.03 s [algebraic-graphs] ============ Relation.induceJust ============
  20126. 377.03 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20127. 377.03 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20128. 377.03 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20129. 377.03 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20130. 377.03 s [algebraic-graphs]
  20131. 377.03 s [algebraic-graphs] ============ ReflexiveRelation ============
  20132. 377.03 s [algebraic-graphs] OK: Axioms of reflexive graphs
  20133. 377.03 s [algebraic-graphs]
  20134. 377.03 s [algebraic-graphs] ============ TransitiveRelation ============
  20135. 377.03 s [algebraic-graphs] OK: Axioms of transitive graphs
  20136. 377.03 s [algebraic-graphs] OK: path xs == (clique xs :: TransitiveRelation Int)
  20137. 377.03 s [algebraic-graphs]
  20138. 377.03 s [algebraic-graphs] ============ PreorderRelation ============
  20139. 377.03 s [algebraic-graphs] OK: Axioms of preorder graphs
  20140. 377.03 s [algebraic-graphs] OK: path xs == (clique xs :: PreorderRelation Int)
  20141. 377.03 s [algebraic-graphs]
  20142. 377.03 s [algebraic-graphs] ============ Symmetric.Relation ============
  20143. 377.03 s [algebraic-graphs] OK: Axioms of undirected graphs
  20144. 377.03 s [algebraic-graphs]
  20145. 377.03 s [algebraic-graphs] ============ Symmetric.Relation.consistent ============
  20146. 377.03 s [algebraic-graphs] OK: Consistency of the Arbitrary instance
  20147. 377.03 s [algebraic-graphs]
  20148. 377.03 s [algebraic-graphs] OK: consistent empty == True
  20149. 377.03 s [algebraic-graphs] OK: consistent (vertex x) == True
  20150. 377.03 s [algebraic-graphs] OK: consistent (overlay x y) == True
  20151. 377.03 s [algebraic-graphs] OK: consistent (connect x y) == True
  20152. 377.03 s [algebraic-graphs] OK: consistent (edge x y) == True
  20153. 377.03 s [algebraic-graphs] OK: consistent (edges xs) == True
  20154. 377.03 s [algebraic-graphs] OK: consistent (stars xs) == True
  20155. 377.03 s [algebraic-graphs]
  20156. 377.03 s [algebraic-graphs] ============ Symmetric.Relation.Show ============
  20157. 377.03 s [algebraic-graphs] OK: show (empty ) == "empty"
  20158. 377.03 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20159. 377.03 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20160. 377.03 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20161. 377.03 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20162. 377.03 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20163. 377.03 s [algebraic-graphs]
  20164. 377.03 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20165. 377.03 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20166. 377.03 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20167. 377.03 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20168. 377.03 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20169. 377.03 s [algebraic-graphs]
  20170. 377.03 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  20171. 377.03 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  20172. 377.03 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  20173. 377.03 s [algebraic-graphs]
  20174. 377.03 s [algebraic-graphs] ============ Symmetric.Relation.toSymmetric ============
  20175. 377.03 s [algebraic-graphs] OK: toSymmetric (edge 1 2) == edge 1 2
  20176. 377.03 s [algebraic-graphs] OK: toSymmetric . fromSymmetric == id
  20177. 377.03 s [algebraic-graphs] OK: fromSymmetric . toSymmetric == symmetricClosure
  20178. 377.03 s [algebraic-graphs] OK: vertexCount . toSymmetric == vertexCount
  20179. 377.03 s [algebraic-graphs] OK: (*2) . edgeCount . toSymmetric >= edgeCount
  20180. 377.03 s [algebraic-graphs]
  20181. 377.03 s [algebraic-graphs] ============ Symmetric.Relation.fromSymmetric ============
  20182. 377.03 s [algebraic-graphs] OK: fromSymmetric (edge 1 2) == edges [(1,2), (2,1)]
  20183. 377.03 s [algebraic-graphs] OK: vertexCount . fromSymmetric == vertexCount
  20184. 377.03 s [algebraic-graphs] OK: edgeCount . fromSymmetric <= (*2) . edgeCount
  20185. 377.03 s [algebraic-graphs]
  20186. 377.03 s [algebraic-graphs] ============ Symmetric.Relation.Ord ============
  20187. 377.03 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20188. 377.03 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20189. 377.03 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20190. 377.03 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20191. 377.03 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20192. 377.03 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  20193. 377.03 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  20194. 377.03 s [algebraic-graphs] OK: x <= x + y
  20195. 377.03 s [algebraic-graphs] OK: x + y <= x * y
  20196. 377.03 s [algebraic-graphs]
  20197. 377.03 s [algebraic-graphs] ============ Symmetric.Relation.empty ============
  20198. 377.03 s [algebraic-graphs] OK: isEmpty empty == True
  20199. 377.03 s [algebraic-graphs] OK: hasVertex x empty == False
  20200. 377.03 s [algebraic-graphs] OK: vertexCount empty == 0
  20201. 377.03 s [algebraic-graphs] OK: edgeCount empty == 0
  20202. 377.03 s [algebraic-graphs]
  20203. 377.03 s [algebraic-graphs] ============ Symmetric.Relation.vertex ============
  20204. 377.03 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20205. 377.03 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20206. 377.03 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20207. 377.03 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20208. 377.03 s [algebraic-graphs]
  20209. 377.03 s [algebraic-graphs] ============ Symmetric.Relation.edge ============
  20210. 377.03 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20211. 377.03 s [algebraic-graphs] OK: edge x y == edge y x
  20212. 377.03 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  20213. 377.03 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20214. 377.03 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20215. 377.03 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20216. 377.03 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20217. 377.03 s [algebraic-graphs]
  20218. 377.03 s [algebraic-graphs] ============ Symmetric.Relation.overlay ============
  20219. 377.03 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20220. 377.03 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20221. 377.03 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20222. 377.03 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20223. 377.03 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20224. 377.03 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20225. 377.03 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20226. 377.03 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20227. 377.03 s [algebraic-graphs]
  20228. 377.03 s [algebraic-graphs] ============ Symmetric.Relation.connect ============
  20229. 377.03 s [algebraic-graphs] OK: connect x y == connect y x
  20230. 377.03 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20231. 377.03 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20232. 377.03 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20233. 377.03 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20234. 377.03 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20235. 377.03 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20236. 377.03 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  20237. 377.03 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20238. 377.03 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20239. 377.03 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20240. 377.03 s [algebraic-graphs]
  20241. 377.03 s [algebraic-graphs] ============ Symmetric.Relation.vertices ============
  20242. 377.03 s [algebraic-graphs] OK: vertices [] == empty
  20243. 377.03 s [algebraic-graphs] OK: vertices [x] == vertex x
  20244. 377.03 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20245. 377.03 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20246. 377.03 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20247. 377.03 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20248. 377.03 s [algebraic-graphs]
  20249. 377.03 s [algebraic-graphs] ============ Symmetric.Relation.edges ============
  20250. 377.03 s [algebraic-graphs] OK: edges [] == empty
  20251. 377.03 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20252. 377.03 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  20253. 377.03 s [algebraic-graphs]
  20254. 377.03 s [algebraic-graphs] ============ Symmetric.Relation.overlays ============
  20255. 377.03 s [algebraic-graphs] OK: overlays [] == empty
  20256. 387.96 s [algebraic-graphs] OK: overlays [x] == x
  20257. 388.00 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20258. 388.00 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20259. 388.00 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20260. 388.00 s [algebraic-graphs]
  20261. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.connects ============
  20262. 388.00 s [algebraic-graphs] OK: connects [] == empty
  20263. 388.00 s [algebraic-graphs] OK: connects [x] == x
  20264. 388.00 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20265. 388.00 s [algebraic-graphs] OK: connects == foldr connect empty
  20266. 388.00 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20267. 388.00 s [algebraic-graphs] OK: connects == connects . reverse
  20268. 388.00 s [algebraic-graphs]
  20269. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.isSubgraphOf ============
  20270. 388.00 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20271. 388.00 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20272. 388.00 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20273. 388.00 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20274. 388.00 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20275. 388.00 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20276. 388.00 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  20277. 388.00 s [algebraic-graphs]
  20278. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.toGraph et al. ============
  20279. 388.00 s [algebraic-graphs] OK: toGraph == foldg Empty Vertex Overlay Connect
  20280. 388.00 s [algebraic-graphs] OK: foldg == Algebra.Graph.foldg . toGraph
  20281. 388.00 s [algebraic-graphs] OK: isEmpty == foldg True (const False) (&&) (&&)
  20282. 388.00 s [algebraic-graphs] OK: size == foldg 1 (const 1) (+) (+)
  20283. 388.00 s [algebraic-graphs] OK: hasVertex x == foldg False (==x) (||) (||)
  20284. 388.00 s [algebraic-graphs] OK: hasEdge x y == Algebra.Graph.hasEdge x y . toGraph
  20285. 388.00 s [algebraic-graphs] OK: vertexCount == Set.size . vertexSet
  20286. 388.00 s [algebraic-graphs] OK: edgeCount == Set.size . edgeSet
  20287. 388.00 s [algebraic-graphs] OK: vertexList == Set.toAscList . vertexSet
  20288. 388.00 s [algebraic-graphs] OK: edgeList == Set.toAscList . edgeSet
  20289. 388.00 s [algebraic-graphs] OK: vertexSet == foldg Set.empty Set.singleton Set.union Set.union
  20290. 388.00 s [algebraic-graphs] OK: vertexIntSet == foldg IntSet.empty IntSet.singleton IntSet.union IntSet.union
  20291. 388.00 s [algebraic-graphs] OK: adjacencyList == Algebra.Graph.AdjacencyMap.adjacencyList . toAdjacencyMap
  20292. 388.00 s [algebraic-graphs] OK: adjacencyMap == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMap
  20293. 388.00 s [algebraic-graphs] OK: adjacencyIntMap == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMap
  20294. 388.00 s [algebraic-graphs] OK: adjacencyMapTranspose == Algebra.Graph.AdjacencyMap.adjacencyMap . toAdjacencyMapTranspose
  20295. 388.00 s [algebraic-graphs] OK: adjacencyIntMapTranspose == Algebra.Graph.AdjacencyIntMap.adjacencyIntMap . toAdjacencyIntMapTranspose
  20296. 388.00 s [algebraic-graphs] OK: dfsForest == Algebra.Graph.AdjacencyMap.dfsForest . toAdjacencyMap
  20297. 388.00 s [algebraic-graphs] OK: dfsForestFrom == Algebra.Graph.AdjacencyMap.dfsForestFrom . toAdjacencyMap
  20298. 388.00 s [algebraic-graphs] OK: dfs == Algebra.Graph.AdjacencyMap.dfs . toAdjacencyMap
  20299. 388.00 s [algebraic-graphs] OK: reachable == Algebra.Graph.AdjacencyMap.reachable . toAdjacencyMap
  20300. 388.00 s [algebraic-graphs] OK: topSort == Algebra.Graph.AdjacencyMap.topSort . toAdjacencyMap
  20301. 388.00 s [algebraic-graphs] OK: isAcyclic == Algebra.Graph.AdjacencyMap.isAcyclic . toAdjacencyMap
  20302. 388.00 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20303. 388.00 s [algebraic-graphs] OK: toAdjacencyMap == foldg empty vertex overlay connect
  20304. 388.00 s [algebraic-graphs] OK: toAdjacencyMapTranspose == foldg empty vertex overlay (flip connect)
  20305. 388.00 s [algebraic-graphs] OK: toAdjacencyIntMap == foldg empty vertex overlay connect
  20306. 388.00 s [algebraic-graphs] OK: toAdjacencyIntMapTranspose == foldg empty vertex overlay (flip connect)
  20307. 388.00 s [algebraic-graphs] OK: isDfsForestOf f == Algebra.Graph.AdjacencyMap.isDfsForestOf f . toAdjacencyMap
  20308. 388.00 s [algebraic-graphs] OK: isTopSortOf vs == Algebra.Graph.AdjacencyMap.isTopSortOf vs . toAdjacencyMap
  20309. 388.00 s [algebraic-graphs]
  20310. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.isEmpty ============
  20311. 388.00 s [algebraic-graphs] OK: isEmpty empty == True
  20312. 388.00 s [algebraic-graphs] OK: isEmpty (overlay empty empty) == True
  20313. 388.00 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20314. 388.00 s [algebraic-graphs] OK: isEmpty (removeVertex x $ vertex x) == True
  20315. 388.00 s [algebraic-graphs] OK: isEmpty (removeEdge x y $ edge x y) == False
  20316. 388.00 s [algebraic-graphs]
  20317. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.hasVertex ============
  20318. 388.00 s [algebraic-graphs] OK: hasVertex x empty == False
  20319. 388.00 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20320. 388.00 s [algebraic-graphs] OK: hasVertex x . removeVertex x == const False
  20321. 388.00 s [algebraic-graphs]
  20322. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.hasEdge ============
  20323. 388.00 s [algebraic-graphs] OK: hasEdge x y empty == False
  20324. 388.00 s [algebraic-graphs] OK: hasEdge x y (vertex z) == False
  20325. 388.00 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20326. 388.00 s [algebraic-graphs] OK: hasEdge x y (edge y x) == True
  20327. 388.00 s [algebraic-graphs] OK: hasEdge x y . removeEdge x y == const False
  20328. 388.00 s [algebraic-graphs] OK: hasEdge x y == elem (min x y, max x y) . edgeList
  20329. 388.00 s [algebraic-graphs]
  20330. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.vertexCount ============
  20331. 388.00 s [algebraic-graphs] OK: vertexCount empty == 0
  20332. 388.00 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20333. 388.00 s [algebraic-graphs] OK: vertexCount == length . vertexList
  20334. 388.00 s [algebraic-graphs] OK: vertexCount x < vertexCount y ==> x < y
  20335. 388.00 s [algebraic-graphs]
  20336. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.edgeCount ============
  20337. 388.00 s [algebraic-graphs] OK: edgeCount empty == 0
  20338. 388.00 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20339. 388.00 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20340. 388.00 s [algebraic-graphs] OK: edgeCount == length . edgeList
  20341. 388.00 s [algebraic-graphs]
  20342. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.vertexList ============
  20343. 388.00 s [algebraic-graphs] OK: vertexList empty == []
  20344. 388.00 s [algebraic-graphs] OK: vertexList (vertex x) == [x]
  20345. 388.00 s [algebraic-graphs] OK: vertexList . vertices == nub . sort
  20346. 388.00 s [algebraic-graphs]
  20347. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.vertexSet ============
  20348. 388.00 s [algebraic-graphs] OK: vertexSet empty == Set.empty
  20349. 388.00 s [algebraic-graphs] OK: vertexSet . vertex == Set.singleton
  20350. 388.00 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20351. 388.00 s [algebraic-graphs]
  20352. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.vertexIntSet ============
  20353. 388.00 s [algebraic-graphs] OK: vertexIntSet empty == IntSet.empty
  20354. 388.00 s [algebraic-graphs] OK: vertexIntSet . vertex == IntSet.singleton
  20355. 388.00 s [algebraic-graphs] OK: vertexIntSet . vertices == IntSet.fromList
  20356. 388.00 s [algebraic-graphs] OK: vertexIntSet . clique == IntSet.fromList
  20357. 388.00 s [algebraic-graphs]
  20358. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.edgeList ============
  20359. 388.00 s [algebraic-graphs] OK: edgeList empty == []
  20360. 388.00 s [algebraic-graphs] OK: edgeList (vertex x) == []
  20361. 388.00 s [algebraic-graphs] OK: edgeList (edge x y) == [(min x y, max y x)]
  20362. 388.00 s [algebraic-graphs] OK: edgeList (star 2 [3,1]) == [(1,2), (2,3)]
  20363. 388.00 s [algebraic-graphs]
  20364. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.edgeSet ============
  20365. 388.00 s [algebraic-graphs] OK: edgeSet empty == Set.empty
  20366. 388.00 s [algebraic-graphs] OK: edgeSet (vertex x) == Set.empty
  20367. 388.00 s [algebraic-graphs] OK: edgeSet (edge x y) == Set.singleton (min x y, max x y)
  20368. 388.00 s [algebraic-graphs]
  20369. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.adjacencyList ============
  20370. 388.00 s [algebraic-graphs] OK: adjacencyList empty == []
  20371. 388.00 s [algebraic-graphs] OK: adjacencyList (vertex x) == [(x, [])]
  20372. 388.00 s [algebraic-graphs] OK: adjacencyList (edge 1 2) == [(1, [2]), (2, [1])]
  20373. 388.00 s [algebraic-graphs] OK: adjacencyList (star 2 [3,1]) == [(1, [2]), (2, [1,3]), (3, [2])]
  20374. 388.00 s [algebraic-graphs]
  20375. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.neighbours ============
  20376. 388.00 s [algebraic-graphs] OK: neighbours x empty == Set.empty
  20377. 388.00 s [algebraic-graphs] OK: neighbours x (vertex x) == Set.empty
  20378. 388.00 s [algebraic-graphs] OK: neighbours x (edge x y) == Set.fromList [y]
  20379. 388.00 s [algebraic-graphs] OK: neighbours y (edge x y) == Set.fromList [x]
  20380. 388.00 s [algebraic-graphs]
  20381. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.path ============
  20382. 388.00 s [algebraic-graphs] OK: path [] == empty
  20383. 388.00 s [algebraic-graphs] OK: path [x] == vertex x
  20384. 388.00 s [algebraic-graphs] OK: path [x,y] == edge x y
  20385. 388.00 s [algebraic-graphs] OK: path == path . reverse
  20386. 388.00 s [algebraic-graphs]
  20387. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.circuit ============
  20388. 388.00 s [algebraic-graphs] OK: circuit [] == empty
  20389. 388.00 s [algebraic-graphs] OK: circuit [x] == edge x x
  20390. 388.00 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20391. 388.00 s [algebraic-graphs] OK: circuit == circuit . reverse
  20392. 388.00 s [algebraic-graphs]
  20393. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.clique ============
  20394. 388.00 s [algebraic-graphs] OK: clique [] == empty
  20395. 388.00 s [algebraic-graphs] OK: clique [x] == vertex x
  20396. 388.00 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20397. 388.00 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20398. 388.00 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20399. 388.00 s [algebraic-graphs] OK: clique == clique . reverse
  20400. 388.00 s [algebraic-graphs]
  20401. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.biclique ============
  20402. 388.00 s [algebraic-graphs] OK: biclique [] [] == empty
  20403. 388.00 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20404. 388.00 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20405. 388.00 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20406. 388.00 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20407. 388.00 s [algebraic-graphs]
  20408. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.star ============
  20409. 388.00 s [algebraic-graphs] OK: star x [] == vertex x
  20410. 388.00 s [algebraic-graphs] OK: star x [y] == edge x y
  20411. 388.00 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20412. 388.00 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20413. 388.00 s [algebraic-graphs]
  20414. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.stars ============
  20415. 388.00 s [algebraic-graphs] OK: stars [] == empty
  20416. 388.00 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20417. 388.00 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20418. 388.00 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20419. 388.00 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20420. 388.00 s [algebraic-graphs] OK: stars . adjacencyList == id
  20421. 388.00 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20422. 388.00 s [algebraic-graphs]
  20423. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.tree ============
  20424. 388.00 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20425. 388.00 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20426. 388.00 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20427. 388.00 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20428. 388.00 s [algebraic-graphs]
  20429. 388.00 s [algebraic-graphs] ============ Symmetric.Relation.forest ============
  20430. 388.00 s [algebraic-graphs] OK: forest [] == empty
  20431. 393.81 s [algebraic-graphs] OK: forest [x] == tree x
  20432. 393.81 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20433. 393.85 s [algebraic-graphs] OK: forest == overlays . map tree
  20434. 393.85 s [algebraic-graphs]
  20435. 393.85 s [algebraic-graphs] ============ Symmetric.Relation.removeVertex ============
  20436. 393.85 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20437. 393.85 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20438. 393.85 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20439. 393.85 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20440. 393.85 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20441. 393.85 s [algebraic-graphs]
  20442. 393.85 s [algebraic-graphs] ============ Symmetric.Relation.removeEdge ============
  20443. 393.85 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20444. 393.85 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20445. 393.85 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20446. 393.85 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20447. 393.85 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20448. 393.85 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  20449. 393.85 s [algebraic-graphs]
  20450. 393.85 s [algebraic-graphs] ============ Symmetric.Relation.replaceVertex ============
  20451. 393.85 s [algebraic-graphs] OK: replaceVertex x x == id
  20452. 393.85 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20453. 393.85 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20454. 393.85 s [algebraic-graphs]
  20455. 393.85 s [algebraic-graphs] ============ Symmetric.Relation.mergeVertices ============
  20456. 393.85 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20457. 393.85 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20458. 393.85 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20459. 393.85 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20460. 393.85 s [algebraic-graphs]
  20461. 393.85 s [algebraic-graphs] ============ Symmetric.Relation.gmap ============
  20462. 393.85 s [algebraic-graphs] OK: gmap f empty == empty
  20463. 393.85 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20464. 393.85 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20465. 393.85 s [algebraic-graphs] OK: gmap id == id
  20466. 393.85 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20467. 393.85 s [algebraic-graphs]
  20468. 393.85 s [algebraic-graphs] ============ Symmetric.Relation.induce ============
  20469. 393.85 s [algebraic-graphs] OK: induce (const True ) x == x
  20470. 393.85 s [algebraic-graphs] OK: induce (const False) x == empty
  20471. 393.85 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20472. 393.85 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20473. 393.85 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20474. 393.85 s [algebraic-graphs]
  20475. 393.85 s [algebraic-graphs] ============ Symmetric.Relation.induceJust ============
  20476. 393.85 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20477. 393.85 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20478. 393.85 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20479. 393.85 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20480. 393.85 s [algebraic-graphs]
  20481. 393.85 s [algebraic-graphs] ============ Example.Todo (Holiday) ============
  20482. 393.85 s [algebraic-graphs] OK: A todo list is semantically Maybe [a]
  20483. 393.85 s [algebraic-graphs] OK: The overlay operator (+) adds non-dependent items to the todo list
  20484. 393.85 s [algebraic-graphs] OK: The connect operator (*) adds dependency between items
  20485. 393.85 s [algebraic-graphs] OK: Contradictory constraints make the todo list impossible to schedule
  20486. 393.85 s [algebraic-graphs] OK: Introduce item priority to schedule the todo list
  20487. 393.85 s [algebraic-graphs] OK: Custom connect operators pull/repel arguments during scheduling
  20488. 393.85 s [algebraic-graphs]
  20489. 393.85 s [algebraic-graphs] ============ Example.Todo (Commandline) ============
  20490. 393.85 s [algebraic-graphs] OK: The pull connect operator maintains command line semantics
  20491. 393.85 s [algebraic-graphs] OK: Swapping flags are allowed by the commutative overlay opeartor
  20492. 393.85 s [algebraic-graphs] OK: The usual connect operator breaks semantics
  20493. 393.85 s [algebraic-graphs] OK: Transform command lines by adding optimisation flag
  20494. 393.85 s [algebraic-graphs]
  20495. 393.85 s [algebraic-graphs] ============ Typed ============
  20496. 393.85 s [algebraic-graphs]
  20497. 393.85 s [algebraic-graphs] ============ Typed.fromAdjacencyMap ============
  20498. 393.85 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  20499. 393.85 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  20500. 393.85 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == vertexList g
  20501. 393.85 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  20502. 393.85 s [algebraic-graphs]
  20503. 393.85 s [algebraic-graphs] ============ Typed.fromAdjacencyIntMap ============
  20504. 393.85 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 3 * 1)) == array (0,2) [(0,[1]), (1,[]), (2,[0])]
  20505. 393.85 s [algebraic-graphs] OK: toGraphKL (fromAdjacencyIntMap (1 * 2 + 2 * 1)) == array (0,1) [(0,[1]), (1,[0])]
  20506. 393.85 s [algebraic-graphs] OK: map (fromVertexKL h) (vertices $ toGraphKL h) == IntSet.toAscList (vertexIntSet g)
  20507. 393.85 s [algebraic-graphs] OK: map (\(x, y) -> (fromVertexKL h x, fromVertexKL h y)) (edges $ toGraphKL h) == edgeList g
  20508. 393.85 s [algebraic-graphs]
  20509. 393.85 s [algebraic-graphs] ============ Typed.dfsForest ============
  20510. 393.85 s [algebraic-graphs] OK: forest (dfsForest % edge 1 1) == vertex 1
  20511. 393.85 s [algebraic-graphs] OK: forest (dfsForest % edge 1 2) == edge 1 2
  20512. 393.85 s [algebraic-graphs] OK: forest (dfsForest % edge 2 1) == vertices [1, 2]
  20513. 393.85 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForest % x) x == True
  20514. 393.85 s [algebraic-graphs] OK: dfsForest % forest (dfsForest % x) == dfsForest % x
  20515. 393.85 s [algebraic-graphs] OK: dfsForest % vertices vs == map (\v -> Node v []) (nub $ sort vs)
  20516. 393.85 s [algebraic-graphs] OK: dfsForest % (3 * (1 + 4) * (1 + 5)) == <correct result>
  20517. 393.85 s [algebraic-graphs]
  20518. 393.85 s [algebraic-graphs] ============ Typed.dfsForestFrom ============
  20519. 393.85 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 1) [1] == vertex 1
  20520. 393.85 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [0] == empty
  20521. 393.85 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [1] == edge 1 2
  20522. 393.85 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2] == vertex 2
  20523. 393.85 s [algebraic-graphs] OK: forest $ (dfsForestFrom % edge 1 2) [2,1] == vertices [1,2]
  20524. 393.85 s [algebraic-graphs] OK: isSubgraphOf (forest $ dfsForestFrom % x $ vs) x == True
  20525. 393.85 s [algebraic-graphs] OK: dfsForestFrom % x $ vertexList x == dfsForest % x
  20526. 393.85 s [algebraic-graphs] OK: dfsForestFrom % vertices vs $ vs == map (\v -> Node v []) (nub vs)
  20527. 393.85 s [algebraic-graphs] OK: dfsForestFrom % x $ [] == []
  20528. 393.85 s [algebraic-graphs] OK: dfsForestFrom % (3 * (1 + 4) * (1 + 5)) $ [1,4] == <correct result>
  20529. 393.85 s [algebraic-graphs]
  20530. 393.85 s [algebraic-graphs] ============ Typed.dfs ============
  20531. 393.85 s [algebraic-graphs] OK: dfs % edge 1 1 $ [1] == [1]
  20532. 393.85 s [algebraic-graphs] OK: dfs % edge 1 2 $ [0] == []
  20533. 393.85 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1] == [1,2]
  20534. 393.85 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2] == [2]
  20535. 393.85 s [algebraic-graphs] OK: dfs % edge 1 2 $ [1,2] == [1,2]
  20536. 393.85 s [algebraic-graphs] OK: dfs % edge 1 2 $ [2,1] == [2,1]
  20537. 393.85 s [algebraic-graphs] OK: dfs % x $ [] == []
  20538. 393.86 s [algebraic-graphs]
  20539. 393.86 s [algebraic-graphs] OK: dfs % (3 * (1 + 4) * (1 + 5)) $ [1,4] == [1,5,4]
  20540. 393.86 s [algebraic-graphs] OK: and [ hasVertex v x | v <- dfs % x $ vs ] == True
  20541. 393.86 s [algebraic-graphs]
  20542. 393.86 s [algebraic-graphs] ============ Typed.topSort ============
  20543. 393.86 s [algebraic-graphs] OK: topSort % (1 * 2 + 3 * 1) == [3,1,2]
  20544. 393.86 s [algebraic-graphs] OK: topSort % (1 * 2 + 2 * 1) == [1,2]
  20545. 393.86 s [algebraic-graphs]
  20546. 393.86 s [algebraic-graphs] ============ Graph.Undirected ============
  20547. 393.86 s [algebraic-graphs] OK: Axioms of undirected graphs
  20548. 393.86 s [algebraic-graphs]
  20549. 393.86 s [algebraic-graphs] ============ Graph.Undirected.Show ============
  20550. 393.86 s [algebraic-graphs] OK: show (empty ) == "empty"
  20551. 393.86 s [algebraic-graphs] OK: show (1 ) == "vertex 1"
  20552. 393.86 s [algebraic-graphs] OK: show (1 + 2 ) == "vertices [1,2]"
  20553. 393.86 s [algebraic-graphs] OK: show (1 * 2 ) == "edge 1 2"
  20554. 393.86 s [algebraic-graphs] OK: show (1 * 2 * 3) == "edges [(1,2),(1,3),(2,3)]"
  20555. 393.86 s [algebraic-graphs] OK: show (1 * 2 + 3) == "overlay (vertex 3) (edge 1 2)"
  20556. 393.86 s [algebraic-graphs]
  20557. 393.86 s [algebraic-graphs] OK: show (vertex (-1) ) == "vertex (-1)"
  20558. 393.86 s [algebraic-graphs] OK: show (vertex (-1) + vertex (-2) ) == "vertices [-2,-1]"
  20559. 393.86 s [algebraic-graphs] OK: show (vertex (-2) * vertex (-1) ) == "edge (-2) (-1)"
  20560. 393.86 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) * vertex (-1)) == "edges [(-3,-2),(-3,-1),(-2,-1)]"
  20561. 393.86 s [algebraic-graphs] OK: show (vertex (-3) * vertex (-2) + vertex (-1)) == "overlay (vertex (-1)) (edge (-3) (-2))"
  20562. 393.86 s [algebraic-graphs]
  20563. 393.86 s [algebraic-graphs] OK: show (2 * 1 ) == "edge 1 2"
  20564. 393.86 s [algebraic-graphs] OK: show (1 * 2 * 1) == "edges [(1,1),(1,2)]"
  20565. 393.86 s [algebraic-graphs] OK: show (3 * 2 * 1) == "edges [(1,2),(1,3),(2,3)]"
  20566. 393.86 s [algebraic-graphs]
  20567. 393.86 s [algebraic-graphs] ============ Graph.Undirected.toUndirected ============
  20568. 393.86 s [algebraic-graphs] OK: toUndirected (edge 1 2) == edge 1 2
  20569. 393.86 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  20570. 393.86 s [algebraic-graphs] OK: vertexCount . toUndirected == vertexCount
  20571. 393.86 s [algebraic-graphs] OK: (*2) . edgeCount . toUndirected >= edgeCount
  20572. 393.86 s [algebraic-graphs]
  20573. 393.86 s [algebraic-graphs] ============ Graph.Undirected.fromUndirected ============
  20574. 393.86 s [algebraic-graphs] OK: fromUndirected (edge 1 2) == edges [(1,2),(2,1)]
  20575. 393.86 s [algebraic-graphs] OK: toUndirected . fromUndirected == id
  20576. 393.86 s [algebraic-graphs] OK: vertexCount . fromUndirected == vertexCount
  20577. 393.86 s [algebraic-graphs] OK: edgeCount . fromUndirected <= (*2) . edgeCount
  20578. 393.86 s [algebraic-graphs]
  20579. 393.86 s [algebraic-graphs] ============ Graph.Undirected.complement ================
  20580. 393.86 s [algebraic-graphs] OK: complement empty == empty
  20581. 393.86 s [algebraic-graphs] OK: complement (vertex x) == vertex x
  20582. 393.86 s [algebraic-graphs] OK: complement (edge 1 1) == edge 1 1
  20583. 393.86 s [algebraic-graphs] OK: complement (edge 1 2) == vertices [1, 2]
  20584. 393.86 s [algebraic-graphs] OK: complement (star 1 [2, 3]) == overlay (vertex 1) (edge 2 3)
  20585. 393.86 s [algebraic-graphs] OK: complement . complement == id
  20586. 393.86 s [algebraic-graphs]
  20587. 393.86 s [algebraic-graphs] ============ Graph.Undirected.Ord ============
  20588. 393.86 s [algebraic-graphs] OK: vertex 1 < vertex 2
  20589. 393.86 s [algebraic-graphs] OK: vertex 3 < edge 1 2
  20590. 393.86 s [algebraic-graphs] OK: vertex 1 < edge 1 1
  20591. 393.86 s [algebraic-graphs] OK: edge 1 1 < edge 1 2
  20592. 393.86 s [algebraic-graphs] OK: edge 1 2 < edge 1 1 + edge 2 2
  20593. 393.86 s [algebraic-graphs] OK: edge 2 1 < edge 1 3
  20594. 393.86 s [algebraic-graphs] OK: edge 1 2 == edge 2 1
  20595. 393.86 s [algebraic-graphs] OK: x <= x + y
  20596. 393.86 s [algebraic-graphs] OK: x + y <= x * y
  20597. 393.86 s [algebraic-graphs]
  20598. 393.86 s [algebraic-graphs] ============ Graph.Undirected.empty ============
  20599. 393.86 s [algebraic-graphs] OK: isEmpty empty == True
  20600. 393.86 s [algebraic-graphs] OK: hasVertex x empty == False
  20601. 393.86 s [algebraic-graphs] OK: vertexCount empty == 0
  20602. 393.86 s [algebraic-graphs] OK: edgeCount empty == 0
  20603. 393.86 s [algebraic-graphs]
  20604. 393.86 s [algebraic-graphs] ============ Graph.Undirected.vertex ============
  20605. 393.86 s [algebraic-graphs] OK: isEmpty (vertex x) == False
  20606. 393.86 s [algebraic-graphs] OK: hasVertex x (vertex y) == (x == y)
  20607. 393.86 s [algebraic-graphs] OK: vertexCount (vertex x) == 1
  20608. 393.86 s [algebraic-graphs] OK: edgeCount (vertex x) == 0
  20609. 393.86 s [algebraic-graphs]
  20610. 393.86 s [algebraic-graphs] ============ Graph.Undirected.edge ============
  20611. 393.86 s [algebraic-graphs] OK: edge x y == connect (vertex x) (vertex y)
  20612. 393.86 s [algebraic-graphs] OK: edge x y == edge y x
  20613. 401.21 s [algebraic-graphs] OK: edge x y == edges [(x,y), (y,x)]
  20614. 401.21 s [algebraic-graphs] OK: hasEdge x y (edge x y) == True
  20615. 401.21 s [algebraic-graphs] OK: edgeCount (edge x y) == 1
  20616. 401.25 s [algebraic-graphs] OK: vertexCount (edge 1 1) == 1
  20617. 401.25 s [algebraic-graphs] OK: vertexCount (edge 1 2) == 2
  20618. 401.25 s [algebraic-graphs]
  20619. 401.25 s [algebraic-graphs] ============ Graph.Undirected.overlay ============
  20620. 401.25 s [algebraic-graphs] OK: isEmpty (overlay x y) == isEmpty x && isEmpty y
  20621. 401.25 s [algebraic-graphs] OK: hasVertex z (overlay x y) == hasVertex z x || hasVertex z y
  20622. 401.25 s [algebraic-graphs] OK: vertexCount (overlay x y) >= vertexCount x
  20623. 401.25 s [algebraic-graphs] OK: vertexCount (overlay x y) <= vertexCount x + vertexCount y
  20624. 401.25 s [algebraic-graphs] OK: edgeCount (overlay x y) >= edgeCount x
  20625. 401.25 s [algebraic-graphs] OK: edgeCount (overlay x y) <= edgeCount x + edgeCount y
  20626. 401.25 s [algebraic-graphs] OK: vertexCount (overlay 1 2) == 2
  20627. 401.25 s [algebraic-graphs] OK: edgeCount (overlay 1 2) == 0
  20628. 401.25 s [algebraic-graphs]
  20629. 401.25 s [algebraic-graphs] ============ Graph.Undirected.connect ============
  20630. 401.25 s [algebraic-graphs] OK: connect x y == connect y x
  20631. 401.25 s [algebraic-graphs] OK: isEmpty (connect x y) == isEmpty x && isEmpty y
  20632. 401.25 s [algebraic-graphs] OK: hasVertex z (connect x y) == hasVertex z x || hasVertex z y
  20633. 401.25 s [algebraic-graphs] OK: vertexCount (connect x y) >= vertexCount x
  20634. 401.25 s [algebraic-graphs] OK: vertexCount (connect x y) <= vertexCount x + vertexCount y
  20635. 401.25 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount x
  20636. 401.25 s [algebraic-graphs] OK: edgeCount (connect x y) >= edgeCount y
  20637. 401.25 s [algebraic-graphs] OK: edgeCount (connect x y) >= vertexCount x * vertexCount y `div` 2
  20638. 401.25 s [algebraic-graphs] OK: edgeCount (connect x y) <= vertexCount x * vertexCount y + edgeCount x + edgeCount y
  20639. 401.25 s [algebraic-graphs] OK: vertexCount (connect 1 2) == 2
  20640. 401.25 s [algebraic-graphs] OK: edgeCount (connect 1 2) == 1
  20641. 401.25 s [algebraic-graphs]
  20642. 401.25 s [algebraic-graphs] ============ Graph.Undirected.vertices ============
  20643. 401.25 s [algebraic-graphs] OK: vertices [] == empty
  20644. 401.25 s [algebraic-graphs] OK: vertices [x] == vertex x
  20645. 401.25 s [algebraic-graphs] OK: vertices == overlays . map vertex
  20646. 401.25 s [algebraic-graphs] OK: hasVertex x . vertices == elem x
  20647. 401.25 s [algebraic-graphs] OK: vertexCount . vertices == length . nub
  20648. 401.25 s [algebraic-graphs] OK: vertexSet . vertices == Set.fromList
  20649. 401.25 s [algebraic-graphs]
  20650. 401.25 s [algebraic-graphs] ============ Graph.Undirected.edges ============
  20651. 401.25 s [algebraic-graphs] OK: edges [] == empty
  20652. 401.25 s [algebraic-graphs] OK: edges [(x,y)] == edge x y
  20653. 401.25 s [algebraic-graphs] OK: edges [(x,y), (y,x)] == edge x y
  20654. 401.25 s [algebraic-graphs]
  20655. 401.25 s [algebraic-graphs] ============ Graph.Undirected.overlays ============
  20656. 401.25 s [algebraic-graphs] OK: overlays [] == empty
  20657. 401.25 s [algebraic-graphs] OK: overlays [x] == x
  20658. 401.25 s [algebraic-graphs] OK: overlays [x,y] == overlay x y
  20659. 401.25 s [algebraic-graphs] OK: overlays == foldr overlay empty
  20660. 401.25 s [algebraic-graphs] OK: isEmpty . overlays == all isEmpty
  20661. 401.25 s [algebraic-graphs]
  20662. 401.25 s [algebraic-graphs] ============ Graph.Undirected.connects ============
  20663. 401.25 s [algebraic-graphs] OK: connects [] == empty
  20664. 401.25 s [algebraic-graphs] OK: connects [x] == x
  20665. 401.25 s [algebraic-graphs] OK: connects [x,y] == connect x y
  20666. 401.25 s [algebraic-graphs] OK: connects == foldr connect empty
  20667. 401.25 s [algebraic-graphs] OK: isEmpty . connects == all isEmpty
  20668. 401.25 s [algebraic-graphs] OK: connects == connects . reverse
  20669. 401.25 s [algebraic-graphs]
  20670. 401.25 s [algebraic-graphs] ============ Graph.Undirected.isSubgraphOf ============
  20671. 401.25 s [algebraic-graphs] OK: isSubgraphOf empty x == True
  20672. 401.25 s [algebraic-graphs] OK: isSubgraphOf (vertex x) empty == False
  20673. 401.25 s [algebraic-graphs] OK: isSubgraphOf x (overlay x y) == True
  20674. 401.25 s [algebraic-graphs] OK: isSubgraphOf (overlay x y) (connect x y) == True
  20675. 401.25 s [algebraic-graphs] OK: isSubgraphOf (path xs) (circuit xs) == True
  20676. 401.25 s [algebraic-graphs] OK: isSubgraphOf x y ==> x <= y
  20677. 401.25 s [algebraic-graphs] OK: isSubgraphOf (edge x y) (edge y x) == True
  20678. 401.25 s [algebraic-graphs]
  20679. 401.25 s [algebraic-graphs] ============ Graph.Undirected.path ============
  20680. 401.25 s [algebraic-graphs] OK: path [] == empty
  20681. 401.25 s [algebraic-graphs] OK: path [x] == vertex x
  20682. 401.25 s [algebraic-graphs] OK: path [x,y] == edge x y
  20683. 401.25 s [algebraic-graphs] OK: path == path . reverse
  20684. 401.25 s [algebraic-graphs]
  20685. 401.25 s [algebraic-graphs] ============ Graph.Undirected.circuit ============
  20686. 401.25 s [algebraic-graphs] OK: circuit [] == empty
  20687. 401.25 s [algebraic-graphs] OK: circuit [x] == edge x x
  20688. 401.25 s [algebraic-graphs] OK: circuit [x,y] == edges [(x,y), (y,x)]
  20689. 401.25 s [algebraic-graphs] OK: circuit == circuit . reverse
  20690. 401.25 s [algebraic-graphs]
  20691. 401.25 s [algebraic-graphs] ============ Graph.Undirected.clique ============
  20692. 401.26 s [algebraic-graphs] OK: clique [] == empty
  20693. 401.26 s [algebraic-graphs] OK: clique [x] == vertex x
  20694. 401.26 s [algebraic-graphs] OK: clique [x,y] == edge x y
  20695. 401.26 s [algebraic-graphs] OK: clique [x,y,z] == edges [(x,y), (x,z), (y,z)]
  20696. 401.26 s [algebraic-graphs] OK: clique (xs ++ ys) == connect (clique xs) (clique ys)
  20697. 401.26 s [algebraic-graphs] OK: clique == clique . reverse
  20698. 401.26 s [algebraic-graphs]
  20699. 401.26 s [algebraic-graphs] ============ Graph.Undirected.biclique ============
  20700. 401.26 s [algebraic-graphs] OK: biclique [] [] == empty
  20701. 401.26 s [algebraic-graphs] OK: biclique [x] [] == vertex x
  20702. 401.26 s [algebraic-graphs] OK: biclique [] [y] == vertex y
  20703. 401.26 s [algebraic-graphs] OK: biclique [x1,x2] [y1,y2] == edges [(x1,y1), (x1,y2), (x2,y1), (x2,y2)]
  20704. 401.26 s [algebraic-graphs] OK: biclique xs ys == connect (vertices xs) (vertices ys)
  20705. 401.26 s [algebraic-graphs]
  20706. 401.26 s [algebraic-graphs] ============ Graph.Undirected.star ============
  20707. 401.26 s [algebraic-graphs] OK: star x [] == vertex x
  20708. 401.26 s [algebraic-graphs] OK: star x [y] == edge x y
  20709. 401.26 s [algebraic-graphs] OK: star x [y,z] == edges [(x,y), (x,z)]
  20710. 401.26 s [algebraic-graphs] OK: star x ys == connect (vertex x) (vertices ys)
  20711. 401.26 s [algebraic-graphs]
  20712. 401.26 s [algebraic-graphs] ============ Graph.Undirected.stars ============
  20713. 401.26 s [algebraic-graphs] OK: stars [] == empty
  20714. 401.26 s [algebraic-graphs] OK: stars [(x, [])] == vertex x
  20715. 401.26 s [algebraic-graphs] OK: stars [(x, [y])] == edge x y
  20716. 401.26 s [algebraic-graphs] OK: stars [(x, ys)] == star x ys
  20717. 401.26 s [algebraic-graphs] OK: stars == overlays . map (uncurry star)
  20718. 401.26 s [algebraic-graphs] OK: stars . adjacencyList == id
  20719. 401.26 s [algebraic-graphs] OK: overlay (stars xs) (stars ys) == stars (xs ++ ys)
  20720. 401.26 s [algebraic-graphs]
  20721. 401.26 s [algebraic-graphs] ============ Graph.Undirected.tree ============
  20722. 401.26 s [algebraic-graphs] OK: tree (Node x []) == vertex x
  20723. 401.26 s [algebraic-graphs] OK: tree (Node x [Node y [Node z []]]) == path [x,y,z]
  20724. 401.26 s [algebraic-graphs] OK: tree (Node x [Node y [], Node z []]) == star x [y,z]
  20725. 401.26 s [algebraic-graphs] OK: tree (Node 1 [Node 2 [], Node 3 [Node 4 [], Node 5 []]]) == edges [(1,2), (1,3), (3,4), (3,5)]
  20726. 401.26 s [algebraic-graphs]
  20727. 401.26 s [algebraic-graphs] ============ Graph.Undirected.forest ============
  20728. 401.26 s [algebraic-graphs] OK: forest [] == empty
  20729. 401.26 s [algebraic-graphs] OK: forest [x] == tree x
  20730. 401.26 s [algebraic-graphs] OK: forest [Node 1 [Node 2 [], Node 3 []], Node 4 [Node 5 []]] == edges [(1,2), (1,3), (4,5)]
  20731. 401.26 s [algebraic-graphs] OK: forest == overlays . map tree
  20732. 401.26 s [algebraic-graphs]
  20733. 401.26 s [algebraic-graphs] ============ Graph.Undirected.removeVertex ============
  20734. 401.26 s [algebraic-graphs] OK: removeVertex x (vertex x) == empty
  20735. 401.26 s [algebraic-graphs] OK: removeVertex 1 (vertex 2) == vertex 2
  20736. 401.26 s [algebraic-graphs] OK: removeVertex x (edge x x) == empty
  20737. 401.26 s [algebraic-graphs] OK: removeVertex 1 (edge 1 2) == vertex 2
  20738. 401.26 s [algebraic-graphs] OK: removeVertex x . removeVertex x == removeVertex x
  20739. 401.26 s [algebraic-graphs]
  20740. 401.26 s [algebraic-graphs] ============ Graph.Undirected.removeEdge ============
  20741. 401.26 s [algebraic-graphs] OK: removeEdge x y (edge x y) == vertices [x,y]
  20742. 401.26 s [algebraic-graphs] OK: removeEdge x y . removeEdge x y == removeEdge x y
  20743. 401.26 s [algebraic-graphs] OK: removeEdge x y . removeVertex x == removeVertex x
  20744. 401.26 s [algebraic-graphs] OK: removeEdge 1 1 (1 * 1 * 2 * 2) == 1 * 2 * 2
  20745. 401.26 s [algebraic-graphs] OK: removeEdge 1 2 (1 * 1 * 2 * 2) == 1 * 1 + 2 * 2
  20746. 401.26 s [algebraic-graphs] OK: removeEdge x y == removeEdge y x
  20747. 401.26 s [algebraic-graphs]
  20748. 401.26 s [algebraic-graphs] ============ Graph.Undirected.replaceVertex ============
  20749. 401.26 s [algebraic-graphs] OK: replaceVertex x x == id
  20750. 401.26 s [algebraic-graphs] OK: replaceVertex x y (vertex x) == vertex y
  20751. 401.26 s [algebraic-graphs] OK: replaceVertex x y == mergeVertices (== x) y
  20752. 401.26 s [algebraic-graphs]
  20753. 401.26 s [algebraic-graphs] ============ Graph.Undirected.mergeVertices ============
  20754. 401.26 s [algebraic-graphs] OK: mergeVertices (const False) x == id
  20755. 401.26 s [algebraic-graphs] OK: mergeVertices (== x) y == replaceVertex x y
  20756. 401.26 s [algebraic-graphs] OK: mergeVertices even 1 (0 * 2) == 1 * 1
  20757. 401.26 s [algebraic-graphs] OK: mergeVertices odd 1 (3 + 4 * 5) == 4 * 1
  20758. 401.26 s [algebraic-graphs]
  20759. 401.26 s [algebraic-graphs] ============ Graph.Undirected.gmap ============
  20760. 401.26 s [algebraic-graphs] OK: gmap f empty == empty
  20761. 401.26 s [algebraic-graphs] OK: gmap f (vertex x) == vertex (f x)
  20762. 401.26 s [algebraic-graphs] OK: gmap f (edge x y) == edge (f x) (f y)
  20763. 401.26 s [algebraic-graphs] OK: gmap id == id
  20764. 401.26 s [algebraic-graphs] OK: gmap f . gmap g == gmap (f . g)
  20765. 401.26 s [algebraic-graphs]
  20766. 401.26 s [algebraic-graphs] ============ Graph.Undirected.induce ============
  20767. 401.26 s [algebraic-graphs] OK: induce (const True ) x == x
  20768. 401.26 s [algebraic-graphs] OK: induce (const False) x == empty
  20769. 401.26 s [algebraic-graphs] OK: induce (/= x) == removeVertex x
  20770. 401.26 s [algebraic-graphs] OK: induce p . induce q == induce (\x -> p x && q x)
  20771. 401.26 s [algebraic-graphs] OK: isSubgraphOf (induce p x) x == True
  20772. 401.26 s [algebraic-graphs]
  20773. 401.26 s [algebraic-graphs] ============ Graph.Undirected.induceJust ============
  20774. 401.26 s [algebraic-graphs] OK: induceJust (vertex Nothing) == empty
  20775. 401.26 s [algebraic-graphs] OK: induceJust (edge (Just x) Nothing) == vertex x
  20776. 401.26 s [algebraic-graphs] OK: induceJust . gmap Just == id
  20777. 401.26 s [algebraic-graphs] OK: induceJust . gmap (\x -> if p x then Just x else Nothing) == induce p
  20778. 401.26 s [algebraic-graphs] Test suite main: PASS
  20779. 401.26 s [algebraic-graphs] Test suite logged to: dist/test/algebraic-graphs-0.7-main.log
  20780. 401.26 s [algebraic-graphs] 1 of 1 test suites (1 of 1 test cases) passed.
  20781. 401.26 s [algebraic-graphs] checkPhase completed in 1 minutes 38 seconds
  20782. 401.26 s [algebraic-graphs] Phase: haddockPhase
  20783. 401.71 s [algebraic-graphs] Preprocessing library for algebraic-graphs-0.7...
  20784. 401.71 s [algebraic-graphs] Running Haddock on library for algebraic-graphs-0.7...
  20785. 401.84 s [algebraic-graphs] [ 1 of 29] Compiling Algebra.Graph.AdjacencyMap ( src/Algebra/Graph/AdjacencyMap.hs, nothing ) [HIE file is missing]
  20786. 402.06 s [algebraic-graphs] [ 2 of 29] Compiling Algebra.Graph.AdjacencyIntMap ( src/Algebra/Graph/AdjacencyIntMap.hs, nothing ) [HIE file is missing]
  20787. 402.12 s [algebraic-graphs] [ 3 of 29] Compiling Algebra.Graph.AdjacencyIntMap.Algorithm ( src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs, nothing ) [HIE file is missing]
  20788. 402.15 s [algebraic-graphs] [ 4 of 29] Compiling Algebra.Graph.Internal ( src/Algebra/Graph/Internal.hs, nothing ) [HIE file is missing]
  20789. 402.23 s [algebraic-graphs] [ 5 of 29] Compiling Algebra.Graph ( src/Algebra/Graph.hs, nothing ) [HIE file is missing]
  20790. 402.39 s [algebraic-graphs] [ 6 of 29] Compiling Algebra.Graph.HigherKinded.Class ( src/Algebra/Graph/HigherKinded/Class.hs, nothing ) [HIE file is missing]
  20791. 402.42 s [algebraic-graphs] [ 7 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap ( src/Algebra/Graph/Bipartite/AdjacencyMap.hs, nothing ) [HIE file is missing]
  20792. 402.51 s [algebraic-graphs] [ 8 of 29] Compiling Algebra.Graph.Bipartite.AdjacencyMap.Algorithm ( src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs, nothing ) [HIE file is missing]
  20793. 402.62 s [algebraic-graphs] [ 9 of 29] Compiling Algebra.Graph.Label ( src/Algebra/Graph/Label.hs, nothing ) [HIE file is missing]
  20794. 402.76 s [algebraic-graphs] [10 of 29] Compiling Algebra.Graph.NonEmpty.AdjacencyMap ( src/Algebra/Graph/NonEmpty/AdjacencyMap.hs, nothing ) [HIE file is missing]
  20795. 402.84 s [algebraic-graphs] [11 of 29] Compiling Algebra.Graph.AdjacencyMap.Algorithm ( src/Algebra/Graph/AdjacencyMap/Algorithm.hs, nothing ) [HIE file is missing]
  20796. 402.91 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:384:43: warning: [GHC-63394] [-Wx-partial]
  20797. 402.91 s [algebraic-graphs] In the use of ‘head’
  20798. 402.91 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  20799. 402.91 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"."
  20800. 402.91 s [algebraic-graphs] |
  20801. 402.91 s [algebraic-graphs] 384 | exit v = do newComponent <- (v==).snd.head <$> gets boundaryStack
  20802. 402.91 s [algebraic-graphs] | ^^^^
  20803. 402.91 s [algebraic-graphs]
  20804. 402.91 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:391:21: warning: [GHC-63394] [-Wx-partial]
  20805. 402.91 s [algebraic-graphs] In the use of ‘tail’
  20806. 402.91 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  20807. 402.91 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"."
  20808. 402.91 s [algebraic-graphs] |
  20809. 402.91 s [algebraic-graphs] 391 | pth' = tail v_pth' -- Here we know that v_pth' starts with v
  20810. 402.91 s [algebraic-graphs] | ^^^^
  20811. 402.91 s [algebraic-graphs]
  20812. 402.91 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:395:26: warning: [GHC-63394] [-Wx-partial]
  20813. 402.91 s [algebraic-graphs] In the use of ‘head’
  20814. 402.91 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  20815. 402.91 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"."
  20816. 402.91 s [algebraic-graphs] |
  20817. 402.91 s [algebraic-graphs] 395 | p_v = fst $ head bnd
  20818. 402.91 s [algebraic-graphs] | ^^^^
  20819. 402.91 s [algebraic-graphs]
  20820. 402.92 s [algebraic-graphs] src/Algebra/Graph/AdjacencyMap/Algorithm.hs:397:21: warning: [GHC-63394] [-Wx-partial]
  20821. 402.92 s [algebraic-graphs] In the use of ‘tail’
  20822. 402.92 s [algebraic-graphs] (imported from Prelude, but defined in GHC.Internal.List):
  20823. 402.92 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"."
  20824. 402.92 s [algebraic-graphs] |
  20825. 402.92 s [algebraic-graphs] 397 | bnd' = tail bnd
  20826. 402.92 s [algebraic-graphs] | ^^^^
  20827. 402.92 s [algebraic-graphs]
  20828. 402.92 s [algebraic-graphs] [12 of 29] Compiling Algebra.Graph.Acyclic.AdjacencyMap ( src/Algebra/Graph/Acyclic/AdjacencyMap.hs, nothing ) [HIE file is missing]
  20829. 402.95 s [algebraic-graphs] [13 of 29] Compiling Algebra.Graph.ToGraph ( src/Algebra/Graph/ToGraph.hs, nothing ) [HIE file is missing]
  20830. 403.04 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:171:32: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  20831. 403.04 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  20832. 403.04 s [algebraic-graphs] will become an error in a future GHC release.
  20833. 403.04 s [algebraic-graphs] Suggested fix:
  20834. 403.04 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  20835. 403.04 s [algebraic-graphs] |
  20836. 403.04 s [algebraic-graphs] 171 | vertexIntSet :: ToVertex t ~ Int => t -> IntSet
  20837. 403.04 s [algebraic-graphs] | ^
  20838. 403.04 s [algebraic-graphs]
  20839. 403.04 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:197:29: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  20840. 403.04 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  20841. 403.04 s [algebraic-graphs] will become an error in a future GHC release.
  20842. 403.04 s [algebraic-graphs] Suggested fix:
  20843. 403.04 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  20844. 403.04 s [algebraic-graphs] |
  20845. 403.04 s [algebraic-graphs] 197 | preIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  20846. 403.04 s [algebraic-graphs] | ^
  20847. 403.04 s [algebraic-graphs]
  20848. 403.04 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:215:30: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  20849. 403.04 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  20850. 403.04 s [algebraic-graphs] will become an error in a future GHC release.
  20851. 403.04 s [algebraic-graphs] Suggested fix:
  20852. 403.04 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  20853. 403.04 s [algebraic-graphs] |
  20854. 403.04 s [algebraic-graphs] 215 | postIntSet :: ToVertex t ~ Int => Int -> t -> IntSet
  20855. 403.04 s [algebraic-graphs] | ^
  20856. 403.04 s [algebraic-graphs]
  20857. 403.05 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:303:37: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  20858. 403.05 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  20859. 403.05 s [algebraic-graphs] will become an error in a future GHC release.
  20860. 403.05 s [algebraic-graphs] Suggested fix:
  20861. 403.05 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  20862. 403.05 s [algebraic-graphs] |
  20863. 403.05 s [algebraic-graphs] 303 | toAdjacencyIntMap :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  20864. 403.05 s [algebraic-graphs] | ^
  20865. 403.05 s [algebraic-graphs]
  20866. 403.05 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:312:46: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  20867. 403.05 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  20868. 403.05 s [algebraic-graphs] will become an error in a future GHC release.
  20869. 403.05 s [algebraic-graphs] Suggested fix:
  20870. 403.05 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  20871. 403.05 s [algebraic-graphs] |
  20872. 403.05 s [algebraic-graphs] 312 | toAdjacencyIntMapTranspose :: ToVertex t ~ Int => t -> AIM.AdjacencyIntMap
  20873. 403.05 s [algebraic-graphs] | ^
  20874. 403.05 s [algebraic-graphs]
  20875. 403.05 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:452:43: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  20876. 403.05 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  20877. 403.05 s [algebraic-graphs] will become an error in a future GHC release.
  20878. 403.05 s [algebraic-graphs] Suggested fix:
  20879. 403.05 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  20880. 403.05 s [algebraic-graphs] |
  20881. 403.05 s [algebraic-graphs] 452 | adjacencyIntMap :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  20882. 403.05 s [algebraic-graphs] | ^
  20883. 403.05 s [algebraic-graphs]
  20884. 403.05 s [algebraic-graphs] src/Algebra/Graph/ToGraph.hs:471:52: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  20885. 403.05 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  20886. 403.05 s [algebraic-graphs] will become an error in a future GHC release.
  20887. 403.05 s [algebraic-graphs] Suggested fix:
  20888. 403.05 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  20889. 403.05 s [algebraic-graphs] |
  20890. 403.05 s [algebraic-graphs] 471 | adjacencyIntMapTranspose :: (ToGraph t, ToVertex t ~ Int) => t -> IntMap IntSet
  20891. 403.05 s [algebraic-graphs] | ^
  20892. 403.05 s [algebraic-graphs]
  20893. 403.05 s [algebraic-graphs] [14 of 29] Compiling Algebra.Graph.Relation ( src/Algebra/Graph/Relation.hs, nothing ) [HIE file is missing]
  20894. 403.12 s [algebraic-graphs] [15 of 29] Compiling Algebra.Graph.Relation.Symmetric ( src/Algebra/Graph/Relation/Symmetric.hs, nothing ) [HIE file is missing]
  20895. 403.17 s [algebraic-graphs] [16 of 29] Compiling Algebra.Graph.NonEmpty ( src/Algebra/Graph/NonEmpty.hs, nothing ) [HIE file is missing]
  20896. 403.30 s [algebraic-graphs] [17 of 29] Compiling Algebra.Graph.Labelled.AdjacencyMap ( src/Algebra/Graph/Labelled/AdjacencyMap.hs, nothing ) [HIE file is missing]
  20897. 403.38 s [algebraic-graphs] [18 of 29] Compiling Algebra.Graph.Labelled ( src/Algebra/Graph/Labelled.hs, nothing ) [HIE file is missing]
  20898. 403.50 s [algebraic-graphs] [19 of 29] Compiling Algebra.Graph.Labelled.Example.Network ( src/Algebra/Graph/Labelled/Example/Network.hs, nothing ) [HIE file is missing]
  20899. 403.51 s [algebraic-graphs] [20 of 29] Compiling Algebra.Graph.Labelled.Example.Automaton ( src/Algebra/Graph/Labelled/Example/Automaton.hs, nothing ) [HIE file is missing]
  20900. 403.52 s [algebraic-graphs] [21 of 29] Compiling Algebra.Graph.Export ( src/Algebra/Graph/Export.hs, nothing ) [HIE file is missing]
  20901. 403.53 s [algebraic-graphs] src/Algebra/Graph/Export.hs:185:41: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  20902. 403.53 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  20903. 403.53 s [algebraic-graphs] will become an error in a future GHC release.
  20904. 403.53 s [algebraic-graphs] Suggested fix:
  20905. 403.53 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  20906. 403.53 s [algebraic-graphs] |
  20907. 403.53 s [algebraic-graphs] 185 | export :: (Ord a, ToGraph g, ToVertex g ~ a) => (a -> Doc s) -> (a -> a -> Doc s) -> g -> Doc s
  20908. 403.54 s [algebraic-graphs] | ^
  20909. 403.54 s [algebraic-graphs]
  20910. 403.54 s [algebraic-graphs] [22 of 29] Compiling Algebra.Graph.Export.Dot ( src/Algebra/Graph/Export/Dot.hs, nothing ) [HIE file is missing]
  20911. 403.55 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:121:63: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  20912. 403.55 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  20913. 403.55 s [algebraic-graphs] will become an error in a future GHC release.
  20914. 403.55 s [algebraic-graphs] Suggested fix:
  20915. 403.55 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  20916. 403.55 s [algebraic-graphs] |
  20917. 403.55 s [algebraic-graphs] 121 | export :: (IsString s, Monoid s, Ord a, ToGraph g, ToVertex g ~ a) => Style a s -> g -> s
  20918. 403.55 s [algebraic-graphs] | ^
  20919. 403.55 s [algebraic-graphs]
  20920. 403.55 s [algebraic-graphs] src/Algebra/Graph/Export/Dot.hs:165:78: warning: [GHC-58520] [-Wtype-equality-requires-operators]
  20921. 403.55 s [algebraic-graphs] The use of ‘~’ without TypeOperators
  20922. 403.55 s [algebraic-graphs] will become an error in a future GHC release.
  20923. 403.55 s [algebraic-graphs] Suggested fix:
  20924. 403.55 s [algebraic-graphs] Perhaps you intended to use the ‘TypeOperators’ extension
  20925. 403.55 s [algebraic-graphs] |
  20926. 403.55 s [algebraic-graphs] 165 | exportAsIs :: (IsString s, Monoid s, Ord (ToVertex g), ToGraph g, ToVertex g ~ s) => g -> s
  20927. 403.55 s [algebraic-graphs] | ^
  20928. 403.55 s [algebraic-graphs]
  20929. 403.56 s [algebraic-graphs] [23 of 29] Compiling Algebra.Graph.Undirected ( src/Algebra/Graph/Undirected.hs, nothing ) [HIE file is missing]
  20930. 403.60 s [algebraic-graphs] [24 of 29] Compiling Algebra.Graph.Class ( src/Algebra/Graph/Class.hs, nothing ) [HIE file is missing]
  20931. 403.68 s [algebraic-graphs] [25 of 29] Compiling Algebra.Graph.Relation.Transitive ( src/Algebra/Graph/Relation/Transitive.hs, nothing ) [HIE file is missing]
  20932. 403.69 s [algebraic-graphs] [26 of 29] Compiling Algebra.Graph.Relation.Reflexive ( src/Algebra/Graph/Relation/Reflexive.hs, nothing ) [HIE file is missing]
  20933. 403.70 s [algebraic-graphs] [27 of 29] Compiling Algebra.Graph.Relation.Preorder ( src/Algebra/Graph/Relation/Preorder.hs, nothing ) [HIE file is missing]
  20934. 403.71 s [algebraic-graphs] [28 of 29] Compiling Algebra.Graph.Example.Todo ( src/Algebra/Graph/Example/Todo.hs, nothing ) [HIE file is missing]
  20935. 403.73 s [algebraic-graphs] [29 of 29] Compiling Data.Graph.Typed ( src/Data/Graph/Typed.hs, nothing ) [HIE file is missing]
  20936. 403.74 s [algebraic-graphs] Haddock coverage:
  20937. 403.74 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  20938. 403.74 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:227:1
  20939. 403.74 s [algebraic-graphs] * in ‘Data.Set.Internal’
  20940. 403.74 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  20941. 403.74 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  20942. 403.74 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:227:1
  20943. 403.79 s [algebraic-graphs] 100% ( 58 / 58) in 'Algebra.Graph.AdjacencyMap'
  20944. 403.79 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  20945. 403.79 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  20946. 403.79 s [algebraic-graphs] * in ‘Data.Set.Internal’
  20947. 403.79 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  20948. 403.79 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  20949. 403.79 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyIntMap.hs:237:1
  20950. 403.80 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.AdjacencyIntMap'
  20951. 403.81 s [algebraic-graphs] Warning: 'nub' is out of scope.
  20952. 403.81 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  20953. 403.81 s [algebraic-graphs] Warning: 'sort' is out of scope.
  20954. 403.81 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  20955. 403.81 s [algebraic-graphs] 93% ( 14 / 15) in 'Algebra.Graph.AdjacencyIntMap.Algorithm'
  20956. 403.81 s [algebraic-graphs] Missing documentation for:
  20957. 403.81 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyIntMap/Algorithm.hs:227)
  20958. 403.81 s [algebraic-graphs] Warning: 'List' is ambiguous. It is defined
  20959. 403.81 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:18
  20960. 403.81 s [algebraic-graphs] * at src/Algebra/Graph/Internal.hs:50:1
  20961. 403.81 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  20962. 403.81 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  20963. 403.81 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Internal.hs:50:1
  20964. 403.81 s [algebraic-graphs] Warning: 'IsList' is out of scope.
  20965. 403.81 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  20966. 403.81 s [algebraic-graphs] 100% ( 19 / 19) in 'Algebra.Graph.Internal'
  20967. 403.82 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  20968. 403.82 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:18
  20969. 403.82 s [algebraic-graphs] * at src/Algebra/Graph.hs:1400:1
  20970. 403.82 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  20971. 403.82 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  20972. 403.82 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:1400:1
  20973. 403.82 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  20974. 403.82 s [algebraic-graphs] * at src/Algebra/Graph.hs:316:1
  20975. 403.82 s [algebraic-graphs] * in ‘Data.Set.Internal’
  20976. 403.82 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  20977. 403.82 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  20978. 403.82 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph.hs:316:1
  20979. 403.91 s [algebraic-graphs] 100% ( 61 / 61) in 'Algebra.Graph'
  20980. 403.91 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  20981. 403.91 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  20982. 403.91 s [algebraic-graphs] Warning: 'vertexCount' is out of scope.
  20983. 403.91 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  20984. 403.91 s [algebraic-graphs] Warning: 'edgeCount' is out of scope.
  20985. 403.91 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  20986. 403.91 s [algebraic-graphs] Warning: 'edgeList' is out of scope.
  20987. 403.91 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  20988. 403.91 s [algebraic-graphs] Warning: 'box' is out of scope.
  20989. 403.91 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  20990. 403.91 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  20991. 403.91 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  20992. 403.92 s [algebraic-graphs] Warning: 'hasVertex' is out of scope.
  20993. 403.92 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  20994. 403.92 s [algebraic-graphs] Warning: 'vertexSet' is out of scope.
  20995. 403.92 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  20996. 403.92 s [algebraic-graphs] Warning: 'mplus' is out of scope.
  20997. 403.92 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  20998. 403.92 s [algebraic-graphs] 100% ( 42 / 42) in 'Algebra.Graph.HigherKinded.Class'
  20999. 403.92 s [algebraic-graphs] Warning: 'swap' is ambiguous. It is defined
  21000. 403.92 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  21001. 403.92 s [algebraic-graphs] * in ‘GHC.Internal.Data.Tuple’
  21002. 403.92 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21003. 403.92 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21004. 403.92 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:418:1
  21005. 403.92 s [algebraic-graphs] Warning: 'nub' is out of scope.
  21006. 403.92 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21007. 403.93 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21008. 403.93 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21009. 403.93 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21010. 403.93 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21011. 403.93 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21012. 403.93 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21013. 403.94 s [algebraic-graphs] 100% ( 63 / 63) in 'Algebra.Graph.Bipartite.AdjacencyMap'
  21014. 403.94 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21015. 403.94 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21016. 403.94 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21017. 403.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21018. 403.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21019. 403.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap.hs:250:1
  21020. 403.94 s [algebraic-graphs] Warning: 'isRight' is out of scope.
  21021. 403.94 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21022. 403.94 s [algebraic-graphs] Warning: 'Matching' is ambiguous. It is defined
  21023. 403.94 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:21
  21024. 403.94 s [algebraic-graphs] * at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  21025. 403.94 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21026. 403.94 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21027. 403.94 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Bipartite/AdjacencyMap/Algorithm.hs:169:1
  21028. 403.94 s [algebraic-graphs] 100% ( 25 / 25) in 'Algebra.Graph.Bipartite.AdjacencyMap.Algorithm'
  21029. 403.94 s [algebraic-graphs] Warning: 'Optimum' is ambiguous. It is defined
  21030. 403.95 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:20
  21031. 403.95 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:442:1
  21032. 403.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21033. 403.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21034. 403.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:442:1
  21035. 403.95 s [algebraic-graphs] Warning: 'Minimum' is ambiguous. It is defined
  21036. 403.95 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:21
  21037. 403.95 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:314:1
  21038. 403.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21039. 403.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21040. 403.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:314:1
  21041. 403.95 s [algebraic-graphs] Warning: 'Distance' is ambiguous. It is defined
  21042. 403.95 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:22
  21043. 403.95 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:241:1
  21044. 403.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21045. 403.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21046. 403.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:241:1
  21047. 403.95 s [algebraic-graphs] Warning: 'Capacity' is ambiguous. It is defined
  21048. 403.95 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:22
  21049. 403.95 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:176:1
  21050. 403.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21051. 403.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21052. 403.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:176:1
  21053. 403.95 s [algebraic-graphs] Warning: 'Count' is ambiguous. It is defined
  21054. 403.95 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:19
  21055. 403.95 s [algebraic-graphs] * at src/Algebra/Graph/Label.hs:209:1
  21056. 403.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21057. 403.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21058. 403.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Label.hs:209:1
  21059. 403.95 s [algebraic-graphs] 100% ( 37 / 37) in 'Algebra.Graph.Label'
  21060. 403.95 s [algebraic-graphs] Warning: 'empty' is out of scope.
  21061. 403.95 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21062. 403.95 s [algebraic-graphs] Warning: 'edges' is out of scope.
  21063. 403.95 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21064. 403.95 s [algebraic-graphs] Warning: 'stars' is out of scope.
  21065. 403.95 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21066. 403.95 s [algebraic-graphs] Warning: 'AdjacencyMap' is ambiguous. It is defined
  21067. 403.95 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:157:1
  21068. 403.95 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  21069. 403.95 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21070. 403.95 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21071. 403.95 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:152:1
  21072. 403.95 s [algebraic-graphs] Warning: 'isEmpty' is out of scope.
  21073. 403.95 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21074. 403.96 s [algebraic-graphs] Warning: 'adjacencyList' is out of scope.
  21075. 403.96 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21076. 403.96 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  21077. 403.96 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21078. 403.96 s [algebraic-graphs] 100% ( 51 / 51) in 'Algebra.Graph.NonEmpty.AdjacencyMap'
  21079. 403.97 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  21080. 403.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21081. 403.97 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  21082. 403.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21083. 403.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21084. 403.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:224:1
  21085. 403.97 s [algebraic-graphs] Warning: 'edge' is ambiguous. It is defined
  21086. 403.97 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:252:1
  21087. 403.97 s [algebraic-graphs] * at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  21088. 403.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21089. 403.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21090. 403.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/NonEmpty/AdjacencyMap.hs:237:1
  21091. 403.97 s [algebraic-graphs] Warning: 'nub' is out of scope.
  21092. 403.97 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21093. 403.97 s [algebraic-graphs] Warning: 'sort' is out of scope.
  21094. 403.97 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21095. 403.97 s [algebraic-graphs] 93% ( 15 / 16) in 'Algebra.Graph.AdjacencyMap.Algorithm'
  21096. 403.97 s [algebraic-graphs] Missing documentation for:
  21097. 403.97 s [algebraic-graphs] Cycle (src/Algebra/Graph/AdjacencyMap/Algorithm.hs:228)
  21098. 403.97 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21099. 403.97 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  21100. 403.97 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21101. 403.97 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21102. 403.97 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21103. 403.97 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:132:1
  21104. 403.98 s [algebraic-graphs] Warning: 'vertex' is ambiguous. It is defined
  21105. 403.98 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:143:1
  21106. 403.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21107. 403.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21108. 403.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21109. 403.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:239:1
  21110. 403.98 s [algebraic-graphs] Warning: 'vertices' is ambiguous. It is defined
  21111. 403.98 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:157:1
  21112. 403.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:309:1
  21113. 403.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21114. 403.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21115. 403.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:309:1
  21116. 403.98 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  21117. 403.98 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:246:1
  21118. 403.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:417:1
  21119. 403.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21120. 403.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21121. 403.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:417:1
  21122. 403.98 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  21123. 403.98 s [algebraic-graphs] * at src/Algebra/Graph/Acyclic/AdjacencyMap.hs:258:1
  21124. 403.98 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:429:1
  21125. 403.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21126. 403.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21127. 403.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/AdjacencyMap.hs:429:1
  21128. 403.98 s [algebraic-graphs] 100% ( 44 / 44) in 'Algebra.Graph.Acyclic.AdjacencyMap'
  21129. 403.98 s [algebraic-graphs] Warning: 'foldg' is ambiguous. It is defined
  21130. 403.98 s [algebraic-graphs] * at src/Algebra/Graph.hs:482:1
  21131. 403.98 s [algebraic-graphs] * at src/Algebra/Graph/ToGraph.hs:98:5
  21132. 403.98 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21133. 403.98 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21134. 403.98 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/ToGraph.hs:98:5
  21135. 403.99 s [algebraic-graphs] 100% ( 8 / 8) in 'Algebra.Graph.ToGraph'
  21136. 403.99 s [algebraic-graphs] Warning: 'Relation' is ambiguous. It is defined
  21137. 403.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:19
  21138. 403.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:157:1
  21139. 403.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21140. 403.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21141. 403.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:157:1
  21142. 403.99 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21143. 403.99 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:243:1
  21144. 403.99 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21145. 403.99 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21146. 403.99 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21147. 403.99 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation.hs:243:1
  21148. 404.00 s [algebraic-graphs] Warning: 'AdjacencyMap' is out of scope.
  21149. 404.00 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21150. 404.00 s [algebraic-graphs] 100% ( 56 / 56) in 'Algebra.Graph.Relation'
  21151. 404.01 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21152. 404.01 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  21153. 404.01 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21154. 404.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21155. 404.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21156. 404.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:188:1
  21157. 404.01 s [algebraic-graphs] Warning: 'vertexCount' is ambiguous. It is defined
  21158. 404.01 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:423:1
  21159. 404.01 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  21160. 404.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21161. 404.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21162. 404.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:372:1
  21163. 404.01 s [algebraic-graphs] Warning: 'edgeCount' is ambiguous. It is defined
  21164. 404.01 s [algebraic-graphs] * at src/Algebra/Graph/Relation.hs:435:1
  21165. 404.01 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  21166. 404.01 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21167. 404.01 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21168. 404.01 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Symmetric.hs:384:1
  21169. 404.01 s [algebraic-graphs] 100% ( 48 / 48) in 'Algebra.Graph.Relation.Symmetric'
  21170. 404.03 s [algebraic-graphs] Warning: 'vertexList' is out of scope.
  21171. 404.03 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21172. 404.03 s [algebraic-graphs] 100% ( 53 / 53) in 'Algebra.Graph.NonEmpty'
  21173. 404.03 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21174. 404.03 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  21175. 404.03 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21176. 404.03 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21177. 404.03 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21178. 404.03 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:160:1
  21179. 404.04 s [algebraic-graphs] Warning: 'hasEdge' is ambiguous. It is defined
  21180. 404.04 s [algebraic-graphs] * at src/Algebra/Graph/AdjacencyMap.hs:403:1
  21181. 404.04 s [algebraic-graphs] * at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  21182. 404.04 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21183. 404.04 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21184. 404.04 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled/AdjacencyMap.hs:379:1
  21185. 404.04 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled.AdjacencyMap'
  21186. 404.05 s [algebraic-graphs] Warning: 'Context' is ambiguous. It is defined
  21187. 404.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:20
  21188. 404.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:675:1
  21189. 404.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21190. 404.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21191. 404.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:675:1
  21192. 404.05 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21193. 404.05 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:191:1
  21194. 404.05 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21195. 404.05 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21196. 404.05 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21197. 404.05 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:191:1
  21198. 404.06 s [algebraic-graphs] Warning: 'Focus' is ambiguous. It is defined
  21199. 404.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:18
  21200. 404.06 s [algebraic-graphs] * at src/Algebra/Graph/Labelled.hs:642:1
  21201. 404.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21202. 404.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21203. 404.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Labelled.hs:642:1
  21204. 404.06 s [algebraic-graphs] 100% ( 49 / 49) in 'Algebra.Graph.Labelled'
  21205. 404.06 s [algebraic-graphs] 100% ( 6 / 6) in 'Algebra.Graph.Labelled.Example.Network'
  21206. 404.06 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Labelled.Example.Automaton'
  21207. 404.06 s [algebraic-graphs] Warning: 'Doc' is ambiguous. It is defined
  21208. 404.06 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:17
  21209. 404.06 s [algebraic-graphs] * at src/Algebra/Graph/Export.hs:57:1
  21210. 404.06 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21211. 404.06 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21212. 404.06 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export.hs:57:1
  21213. 404.06 s [algebraic-graphs] 100% ( 14 / 14) in 'Algebra.Graph.Export'
  21214. 404.07 s [algebraic-graphs] Warning: 'Style' is ambiguous. It is defined
  21215. 404.07 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:18
  21216. 404.07 s [algebraic-graphs] * at src/Algebra/Graph/Export/Dot.hs:49:1
  21217. 404.07 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21218. 404.07 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21219. 404.07 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Export/Dot.hs:49:1
  21220. 404.07 s [algebraic-graphs] Warning: 'Graph' is out of scope.
  21221. 404.07 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21222. 404.07 s [algebraic-graphs] 100% ( 11 / 11) in 'Algebra.Graph.Export.Dot'
  21223. 404.07 s [algebraic-graphs] Warning: 'empty' is ambiguous. It is defined
  21224. 404.07 s [algebraic-graphs] * at src/Algebra/Graph/Undirected.hs:253:1
  21225. 404.07 s [algebraic-graphs] * in ‘Data.Set.Internal’
  21226. 404.07 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21227. 404.07 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21228. 404.07 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Undirected.hs:253:1
  21229. 404.08 s [algebraic-graphs] 100% ( 50 / 50) in 'Algebra.Graph.Undirected'
  21230. 404.09 s [algebraic-graphs] 100% ( 27 / 27) in 'Algebra.Graph.Class'
  21231. 404.09 s [algebraic-graphs] Warning: 'TransitiveRelation' is ambiguous. It is defined
  21232. 404.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:32
  21233. 404.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Transitive.hs:39:1
  21234. 404.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21235. 404.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21236. 404.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Transitive.hs:39:1
  21237. 404.09 s [algebraic-graphs] Warning: 'Transitive' is out of scope.
  21238. 404.09 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21239. 404.09 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Transitive'
  21240. 404.09 s [algebraic-graphs] Warning: 'ReflexiveRelation' is ambiguous. It is defined
  21241. 404.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:31
  21242. 404.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  21243. 404.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21244. 404.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21245. 404.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Reflexive.hs:34:1
  21246. 404.09 s [algebraic-graphs] Warning: 'Reflexive' is out of scope.
  21247. 404.09 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21248. 404.09 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Reflexive'
  21249. 404.09 s [algebraic-graphs] Warning: 'PreorderRelation' is ambiguous. It is defined
  21250. 404.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:30
  21251. 404.09 s [algebraic-graphs] * at src/Algebra/Graph/Relation/Preorder.hs:44:1
  21252. 404.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21253. 404.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21254. 404.09 s [algebraic-graphs] Defaulting to the one defined at src/Algebra/Graph/Relation/Preorder.hs:44:1
  21255. 404.09 s [algebraic-graphs] Warning: 'Preorder' is out of scope.
  21256. 404.09 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21257. 404.09 s [algebraic-graphs] 100% ( 5 / 5) in 'Algebra.Graph.Relation.Preorder'
  21258. 404.09 s [algebraic-graphs] 0% ( 0 / 8) in 'Algebra.Graph.Example.Todo'
  21259. 404.09 s [algebraic-graphs] Missing documentation for:
  21260. 404.09 s [algebraic-graphs] Module header
  21261. 404.09 s [algebraic-graphs] Todo (src/Algebra/Graph/Example/Todo.hs:13)
  21262. 404.09 s [algebraic-graphs] todo (src/Algebra/Graph/Example/Todo.hs:42)
  21263. 404.09 s [algebraic-graphs] low (src/Algebra/Graph/Example/Todo.hs:23)
  21264. 404.09 s [algebraic-graphs] high (src/Algebra/Graph/Example/Todo.hs:27)
  21265. 404.09 s [algebraic-graphs] ~*~ (src/Algebra/Graph/Example/Todo.hs:35)
  21266. 404.09 s [algebraic-graphs] >*< (src/Algebra/Graph/Example/Todo.hs:39)
  21267. 404.09 s [algebraic-graphs] priority (src/Algebra/Graph/Example/Todo.hs:31)
  21268. 404.09 s [algebraic-graphs] Warning: 'GraphKL' is ambiguous. It is defined
  21269. 404.09 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:18
  21270. 404.09 s [algebraic-graphs] * at src/Data/Graph/Typed.hs:40:1
  21271. 404.09 s [algebraic-graphs] You may be able to disambiguate the identifier by qualifying it or
  21272. 404.09 s [algebraic-graphs] by specifying the type/value namespace explicitly.
  21273. 404.09 s [algebraic-graphs] Defaulting to the one defined at src/Data/Graph/Typed.hs:40:1
  21274. 404.10 s [algebraic-graphs] Warning: 'array' is out of scope.
  21275. 404.10 s [algebraic-graphs] If you qualify the identifier, haddock can try to link it anyway.
  21276. 404.10 s [algebraic-graphs] 90% ( 10 / 11) in 'Data.Graph.Typed'
  21277. 404.10 s [algebraic-graphs] Missing documentation for:
  21278. 404.10 s [algebraic-graphs] scc (src/Data/Graph/Typed.hs:192)
  21279. 404.22 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyMap: could not find link destinations for:
  21280. 404.22 s [algebraic-graphs] - Algebra.Graph.AdjacencyMap.Rep_AdjacencyMap
  21281. 404.22 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  21282. 404.22 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  21283. 404.22 s [algebraic-graphs] Warning: Algebra.Graph.AdjacencyIntMap: could not find link destinations for:
  21284. 404.22 s [algebraic-graphs] - Algebra.Graph.AdjacencyIntMap.Rep_AdjacencyIntMap
  21285. 404.22 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  21286. 404.22 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  21287. 404.22 s [algebraic-graphs] Warning: Algebra.Graph.Internal: could not find link destinations for:
  21288. 404.22 s [algebraic-graphs] - Algebra.Graph.Internal.D:R:ItemList
  21289. 404.23 s [algebraic-graphs] Warning: Algebra.Graph: could not find link destinations for:
  21290. 404.23 s [algebraic-graphs] - Algebra.Graph.Rep_Graph
  21291. 404.23 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  21292. 404.23 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  21293. 404.24 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap: could not find link destinations for:
  21294. 404.24 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_AdjacencyMap
  21295. 404.24 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Rep_List
  21296. 404.24 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.D:R:ItemList
  21297. 404.24 s [algebraic-graphs] Warning: Algebra.Graph.Bipartite.AdjacencyMap.Algorithm: could not find link destinations for:
  21298. 404.24 s [algebraic-graphs] - Algebra.Graph.Bipartite.AdjacencyMap.Algorithm.Rep_Matching
  21299. 404.25 s [algebraic-graphs] Warning: Algebra.Graph.Label: could not find link destinations for:
  21300. 404.25 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemLabel
  21301. 404.25 s [algebraic-graphs] - Algebra.Graph.Label.D:R:ItemMinimum
  21302. 404.25 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty.AdjacencyMap: could not find link destinations for:
  21303. 404.25 s [algebraic-graphs] - Algebra.Graph.NonEmpty.AdjacencyMap.Rep_AdjacencyMap
  21304. 404.25 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  21305. 404.26 s [algebraic-graphs] Warning: Algebra.Graph.ToGraph: could not find link destinations for:
  21306. 404.26 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyIntMap
  21307. 404.26 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap
  21308. 404.26 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexAdjacencyMap0
  21309. 404.26 s [algebraic-graphs] - Algebra.Graph.ToGraph.D:R:ToVertexGraph
  21310. 404.26 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  21311. 404.26 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  21312. 404.26 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  21313. 404.26 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  21314. 404.26 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  21315. 404.26 s [algebraic-graphs] Warning: Algebra.Graph.Relation: could not find link destinations for:
  21316. 404.26 s [algebraic-graphs] - Algebra.Graph.Relation.D:R:ToVertexRelation
  21317. 404.26 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  21318. 404.27 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Symmetric: could not find link destinations for:
  21319. 404.27 s [algebraic-graphs] - Algebra.Graph.Relation.Symmetric.D:R:ToVertexRelation
  21320. 404.27 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  21321. 404.27 s [algebraic-graphs] Warning: Algebra.Graph.NonEmpty: could not find link destinations for:
  21322. 404.27 s [algebraic-graphs] - Algebra.Graph.NonEmpty.D:R:ToVertexGraph
  21323. 404.28 s [algebraic-graphs] Warning: Algebra.Graph.Labelled.AdjacencyMap: could not find link destinations for:
  21324. 404.28 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.Rep_AdjacencyMap
  21325. 404.28 s [algebraic-graphs] - Algebra.Graph.Labelled.AdjacencyMap.D:R:ToVertexAdjacencyMap
  21326. 404.28 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  21327. 404.28 s [algebraic-graphs] Warning: Algebra.Graph.Labelled: could not find link destinations for:
  21328. 404.28 s [algebraic-graphs] - Algebra.Graph.Labelled.Rep_Graph
  21329. 404.28 s [algebraic-graphs] - Algebra.Graph.Labelled.D:R:ToVertexGraph
  21330. 404.28 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  21331. 404.29 s [algebraic-graphs] Warning: Algebra.Graph.Undirected: could not find link destinations for:
  21332. 404.29 s [algebraic-graphs] - Algebra.Graph.Undirected.Rep_Graph
  21333. 404.29 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  21334. 404.29 s [algebraic-graphs] Warning: Algebra.Graph.Class: could not find link destinations for:
  21335. 404.29 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyIntMap
  21336. 404.29 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap
  21337. 404.29 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexAdjacencyMap0
  21338. 404.29 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexFUN
  21339. 404.29 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph
  21340. 404.29 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph0
  21341. 404.29 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexGraph1
  21342. 404.29 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexMaybe
  21343. 404.29 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation
  21344. 404.29 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexRelation0
  21345. 404.29 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple2
  21346. 404.29 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexTuple3
  21347. 404.29 s [algebraic-graphs] - Algebra.Graph.Class.D:R:VertexUnit
  21348. 404.29 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  21349. 404.29 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  21350. 404.29 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  21351. 404.29 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  21352. 404.29 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Transitive: could not find link destinations for:
  21353. 404.29 s [algebraic-graphs] - Algebra.Graph.Relation.Transitive.D:R:VertexTransitiveRelation
  21354. 404.29 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Reflexive: could not find link destinations for:
  21355. 404.29 s [algebraic-graphs] - Algebra.Graph.Relation.Reflexive.D:R:VertexReflexiveRelation
  21356. 404.29 s [algebraic-graphs] Warning: Algebra.Graph.Relation.Preorder: could not find link destinations for:
  21357. 404.29 s [algebraic-graphs] - Algebra.Graph.Relation.Preorder.D:R:VertexPreorderRelation
  21358. 404.29 s [algebraic-graphs] Warning: Algebra.Graph.Example.Todo: could not find link destinations for:
  21359. 404.29 s [algebraic-graphs] - Algebra.Graph.Example.Todo.D:R:VertexTodo
  21360. 408.67 s [algebraic-graphs] Documentation created: dist/doc/html/algebraic-graphs,
  21361. 408.83 s [algebraic-graphs] dist/doc/html/algebraic-graphs/algebraic-graphs.txt
  21362. 409.17 s [algebraic-graphs] Preprocessing test suite 'main' for algebraic-graphs-0.7...
  21363. 409.23 s [algebraic-graphs] Phase: installPhase
  21364. 409.28 s [algebraic-graphs] Installing library in /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  21365. 409.86 s [algebraic-graphs] Phase: fixupPhase
  21366. 409.88 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7
  21367. 409.88 s [algebraic-graphs] shrinking /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHSalgebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a-ghc9.12.2.so
  21368. 409.91 s [algebraic-graphs] checking for references to /build/ in /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7...
  21369. 409.94 s [algebraic-graphs] patching script interpreter paths in /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7
  21370. 409.95 s [algebraic-graphs] stripping (with command strip and flags -S -p) in /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/lib
  21371. 410.18 s [algebraic-graphs] shrinking RPATHs of ELF executables and libraries in /nix/store/4syljhmgi93jzr8cdmlar9dpmjsd53nv-algebraic-graphs-0.7-doc
  21372. 410.20 s [algebraic-graphs] checking for references to /build/ in /nix/store/4syljhmgi93jzr8cdmlar9dpmjsd53nv-algebraic-graphs-0.7-doc...
  21373. 410.23 s [algebraic-graphs] patching script interpreter paths in /nix/store/4syljhmgi93jzr8cdmlar9dpmjsd53nv-algebraic-graphs-0.7-doc
  21374. 410.37 s [algebraic-graphs:post-build] Uploading to cachix cache "sellout": /nix/store/4syljhmgi93jzr8cdmlar9dpmjsd53nv-algebraic-graphs-0.7-doc /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7
  21375. 410.90 s [algebraic-graphs:post-build] Pushing 2 paths (70 are already present) using zstd to cache sellout ⏳
  21376. 410.90 s [algebraic-graphs:post-build]
  21377. 411.25 s [algebraic-graphs:post-build] Pushing /nix/store/4syljhmgi93jzr8cdmlar9dpmjsd53nv-algebraic-graphs-0.7-doc (10.41 MiB)
  21378. 411.40 s [algebraic-graphs:post-build] Pushing /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7 (25.73 MiB)
  21379. 413.09 s [algebraic-graphs:post-build]
  21380. 413.09 s [algebraic-graphs:post-build] All done.
  21381. 413.11 s [algebraic-graphs:post-build] Uploading to the NixCI cache: /nix/store/4syljhmgi93jzr8cdmlar9dpmjsd53nv-algebraic-graphs-0.7-doc /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7
  21382. 413.15 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21383. 413.40 s [algebraic-graphs:post-build] copying 2 paths...
  21384. 413.40 s [algebraic-graphs:post-build] copying path '/nix/store/4syljhmgi93jzr8cdmlar9dpmjsd53nv-algebraic-graphs-0.7-doc' to 'https://cache.nix-ci.com'...
  21385. 414.52 s [algebraic-graphs:post-build] copying path '/nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7' to 'https://cache.nix-ci.com'...
  21386. 420.52 s [algebraic-graphs:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21387. 420.78 s [algebraic-graphs:post-build] copying 1 paths...
  21388. 420.82 s [algebraic-graphs:post-build] copying path '/nix/store/wcyb838h79fi5fk0y7w8jznhlnsczw6s-algebraic-graphs-0.7.drv' to 'https://cache.nix-ci.com'...
  21389. 421.05 s Progress: 9 of 14 built, 43 of 43 downloaded from cache
  21390. 421.09 s Building /nix/store/75ihv4bmf46fckrl91pbn7449akgjmz2-algebraic-graph-duoids-0.0.1.0.drv
  21391. 421.24 s [algebraic-graph-duoids] Phase: setupCompilerEnvironmentPhase
  21392. 421.24 s [algebraic-graph-duoids] Build with /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2.
  21393. 421.45 s [algebraic-graph-duoids] Phase: unpackPhase
  21394. 421.45 s [algebraic-graph-duoids] unpacking source archive /nix/store/j3nhvvhbp8d5l29mqdaf8f513lxyga6r-z8smrhvl4j2a1x1vb5nv502a87a6wsx7-source/./algebraic-graphs
  21395. 421.46 s [algebraic-graph-duoids] source root is algebraic-graphs
  21396. 421.46 s [algebraic-graph-duoids] Phase: patchPhase
  21397. 421.47 s [algebraic-graph-duoids] Phase: compileBuildDriverPhase
  21398. 421.48 s [algebraic-graph-duoids] setupCompileFlags: -package-db=/build/tmp.hIn77obTa3/setup-package.conf.d -threaded
  21399. 421.52 s [algebraic-graph-duoids] [1 of 2] Compiling Main ( Setup.hs, /build/tmp.hIn77obTa3/Main.o )
  21400. 421.57 s [algebraic-graph-duoids] [2 of 2] Linking Setup
  21401. 422.77 s [algebraic-graph-duoids] Phase: updateAutotoolsGnuConfigScriptsPhase
  21402. 422.78 s [algebraic-graph-duoids] Phase: configurePhase
  21403. 422.78 s [algebraic-graph-duoids] configureFlags: --verbose --prefix=/nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0 --libdir=$prefix/lib/$compiler/lib --libsubdir=$abi/$libname --docdir=/nix/store/kqis4bsgc73hs0kshbl2dpy6s520dkmi-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0 --with-gcc=gcc --package-db=/build/tmp.hIn77obTa3/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/ffyzkisqs4vc4mg28bwwlyqjf8i9ph6b-ncurses-6.5/lib --extra-lib-dirs=/nix/store/n28qgdj8c1q41kf7n4y1jxa6ckp85m3c-libffi-3.5.2/lib --extra-lib-dirs=/nix/store/1b6h99dw7bk4wbn77kbalih42zbc67m1-elfutils-0.194/lib --extra-lib-dirs=/nix/store/hi0ar880110k6jsmmili7dh1gq3cg2a9-gmp-with-cxx-6.3.0/lib --extra-lib-dirs=/nix/store/g09cflpnp4g80q56sj9dng1qzv4v4ybc-numactl-2.0.18/lib --extra-lib-dirs=/nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/lib
  21404. 422.79 s [algebraic-graph-duoids] Using Parsec parser
  21405. 422.79 s [algebraic-graph-duoids] Configuring algebraic-graph-duoids-0.0.1.0...
  21406. 422.82 s [algebraic-graph-duoids] Warning: Unknown/unsupported 'ghc' version detected (Cabal 3.14.1.0 supports
  21407. 422.82 s [algebraic-graph-duoids] 'ghc' version < 9.12):
  21408. 422.82 s [algebraic-graph-duoids] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc is version
  21409. 422.82 s [algebraic-graph-duoids] 9.12.2
  21410. 423.07 s [algebraic-graph-duoids] Flags chosen: lint=False, noisy-deprecations=True
  21411. 423.31 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.5 && <0.6 || >=0.6.1 && <0.9: using
  21412. 423.31 s [algebraic-graph-duoids] algebraic-graphs-0.7
  21413. 423.31 s [algebraic-graph-duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  21414. 423.31 s [algebraic-graph-duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  21415. 423.31 s [algebraic-graph-duoids] <4.23: using base-4.21.0.0
  21416. 423.31 s [algebraic-graph-duoids] Dependency duoids >=0.0.1 && <0.1: using duoids-0.0.1.0
  21417. 423.31 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  21418. 423.31 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  21419. 423.31 s [algebraic-graph-duoids] Dependency algebraic-graphs >=0.5 && <0.6 || >=0.6.1 && <0.9: using
  21420. 423.31 s [algebraic-graph-duoids] algebraic-graphs-0.7
  21421. 423.31 s [algebraic-graph-duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  21422. 423.31 s [algebraic-graph-duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  21423. 423.31 s [algebraic-graph-duoids] <4.23: using base-4.21.0.0
  21424. 423.31 s [algebraic-graph-duoids] Dependency duoids-hedgehog >=0.0.1 && <0.1: using duoids-hedgehog-0.0.1.0
  21425. 423.31 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  21426. 423.31 s [algebraic-graph-duoids] Dependency hedgehog >=1.1 && <1.3 || >=1.4 && <1.6 || >=1.7 && <1.8: using
  21427. 423.31 s [algebraic-graph-duoids] hedgehog-1.5
  21428. 423.31 s [algebraic-graph-duoids] Dependency algebraic-graph-duoids: using algebraic-graph-duoids-0.0.1.0
  21429. 423.31 s [algebraic-graph-duoids] Dependency base >=4.16.0 && <4.17 || >=4.17.0 && <4.18 || >=4.18.0 && <4.19 ||
  21430. 423.31 s [algebraic-graph-duoids] >=4.19.0 && <4.20 || >=4.20.0 && <4.21 || >=4.21.0 && <4.22 || >=4.22.0 &&
  21431. 423.31 s [algebraic-graph-duoids] <4.23: using base-4.21.0.0
  21432. 423.31 s [algebraic-graph-duoids] Dependency doctest >=0.18.2 && <0.19 || >=0.20.1 && <0.21 || >=0.21.1 && <0.22
  21433. 423.31 s [algebraic-graph-duoids] || >=0.22.6 && <0.23 || >=0.24.0 && <0.25 || >=0.25.0 && <0.26: using
  21434. 423.31 s [algebraic-graph-duoids] doctest-0.24.2
  21435. 423.31 s [algebraic-graph-duoids] Dependency ghc-compat-plugin >=0.1.0 && <0.2: using ghc-compat-plugin-0.1.0.1
  21436. 423.31 s [algebraic-graph-duoids] Source component graph:
  21437. 423.31 s [algebraic-graph-duoids] component lib
  21438. 423.31 s [algebraic-graph-duoids] component test:doctests dependency lib
  21439. 423.31 s [algebraic-graph-duoids] component test:laws dependency lib
  21440. 423.31 s [algebraic-graph-duoids] Configured component graph:
  21441. 423.31 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-LVYR75RwDMA4rgV1xNnsfQ
  21442. 423.31 s [algebraic-graph-duoids] include algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  21443. 423.31 s [algebraic-graph-duoids] include base-4.21.0.0-b334
  21444. 423.31 s [algebraic-graph-duoids] include duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm
  21445. 423.31 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  21446. 423.32 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-Evx0ap0K7yoGNApluEWKN0-doctests
  21447. 423.32 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-LVYR75RwDMA4rgV1xNnsfQ
  21448. 423.32 s [algebraic-graph-duoids] include base-4.21.0.0-b334
  21449. 423.32 s [algebraic-graph-duoids] include doctest-0.24.2-7dcRhyR7fwsJGtJTyCZo6u
  21450. 423.32 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  21451. 423.32 s [algebraic-graph-duoids] component algebraic-graph-duoids-0.0.1.0-7V2NvdwbC19B2n8GOOG15z-laws
  21452. 423.32 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-LVYR75RwDMA4rgV1xNnsfQ
  21453. 423.32 s [algebraic-graph-duoids] include algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  21454. 423.32 s [algebraic-graph-duoids] include base-4.21.0.0-b334
  21455. 423.32 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-4PBiwjtwbFHLQ9OHdta2tZ
  21456. 423.32 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  21457. 423.32 s [algebraic-graph-duoids] include hedgehog-1.5-3LP1um1Ps6qGX0qFDBaPPL
  21458. 423.32 s [algebraic-graph-duoids] Linked component graph:
  21459. 423.32 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-LVYR75RwDMA4rgV1xNnsfQ
  21460. 423.32 s [algebraic-graph-duoids] include algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  21461. 423.32 s [algebraic-graph-duoids] include base-4.21.0.0-b334
  21462. 423.32 s [algebraic-graph-duoids] include duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm
  21463. 423.32 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  21464. 423.32 s [algebraic-graph-duoids] Algebra.Graph.Duoid=algebraic-graph-duoids-0.0.1.0-LVYR75RwDMA4rgV1xNnsfQ:Algebra.Graph.Duoid,Algebra.Graph.Duoid.Orphans=algebraic-graph-duoids-0.0.1.0-LVYR75RwDMA4rgV1xNnsfQ:Algebra.Graph.Duoid.Orphans
  21465. 423.32 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-Evx0ap0K7yoGNApluEWKN0-doctests
  21466. 423.32 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-LVYR75RwDMA4rgV1xNnsfQ
  21467. 423.32 s [algebraic-graph-duoids] include base-4.21.0.0-b334
  21468. 423.32 s [algebraic-graph-duoids] include doctest-0.24.2-7dcRhyR7fwsJGtJTyCZo6u
  21469. 423.32 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  21470. 423.32 s [algebraic-graph-duoids] unit algebraic-graph-duoids-0.0.1.0-7V2NvdwbC19B2n8GOOG15z-laws
  21471. 423.32 s [algebraic-graph-duoids] include algebraic-graph-duoids-0.0.1.0-LVYR75RwDMA4rgV1xNnsfQ
  21472. 423.32 s [algebraic-graph-duoids] include algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  21473. 423.32 s [algebraic-graph-duoids] include base-4.21.0.0-b334
  21474. 423.32 s [algebraic-graph-duoids] include duoids-hedgehog-0.0.1.0-4PBiwjtwbFHLQ9OHdta2tZ
  21475. 423.32 s [algebraic-graph-duoids] include ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  21476. 423.32 s [algebraic-graph-duoids] include hedgehog-1.5-3LP1um1Ps6qGX0qFDBaPPL
  21477. 423.32 s [algebraic-graph-duoids] Ready component graph:
  21478. 423.32 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-LVYR75RwDMA4rgV1xNnsfQ
  21479. 423.32 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  21480. 423.32 s [algebraic-graph-duoids] depends base-4.21.0.0-b334
  21481. 423.32 s [algebraic-graph-duoids] depends duoids-0.0.1.0-Jzc4b5W36dXEvfr963zxkm
  21482. 423.32 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  21483. 423.32 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-Evx0ap0K7yoGNApluEWKN0-doctests
  21484. 423.32 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-LVYR75RwDMA4rgV1xNnsfQ
  21485. 423.32 s [algebraic-graph-duoids] depends base-4.21.0.0-b334
  21486. 423.32 s [algebraic-graph-duoids] depends doctest-0.24.2-7dcRhyR7fwsJGtJTyCZo6u
  21487. 423.32 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  21488. 423.32 s [algebraic-graph-duoids] definite algebraic-graph-duoids-0.0.1.0-7V2NvdwbC19B2n8GOOG15z-laws
  21489. 423.32 s [algebraic-graph-duoids] depends algebraic-graph-duoids-0.0.1.0-LVYR75RwDMA4rgV1xNnsfQ
  21490. 423.32 s [algebraic-graph-duoids] depends algebraic-graphs-0.7-6hsd2h1oLWFHy0uebcfo9a
  21491. 423.32 s [algebraic-graph-duoids] depends base-4.21.0.0-b334
  21492. 423.32 s [algebraic-graph-duoids] depends duoids-hedgehog-0.0.1.0-4PBiwjtwbFHLQ9OHdta2tZ
  21493. 423.32 s [algebraic-graph-duoids] depends ghc-compat-plugin-0.1.0.1-mnLYDeGCx98PfHRNXIt5d
  21494. 423.32 s [algebraic-graph-duoids] depends hedgehog-1.5-3LP1um1Ps6qGX0qFDBaPPL
  21495. 423.32 s [algebraic-graph-duoids] Using Cabal-3.14.1.0 compiled by ghc-9.12
  21496. 423.32 s [algebraic-graph-duoids] Using compiler: ghc-9.12.2
  21497. 423.32 s [algebraic-graph-duoids] Using install prefix:
  21498. 423.32 s [algebraic-graph-duoids] /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0
  21499. 423.32 s [algebraic-graph-duoids] Executables installed in:
  21500. 423.32 s [algebraic-graph-duoids] /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/bin
  21501. 423.32 s [algebraic-graph-duoids] Libraries installed in:
  21502. 423.32 s [algebraic-graph-duoids] /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/algebraic-graph-duoids-0.0.1.0-LVYR75RwDMA4rgV1xNnsfQ
  21503. 423.32 s [algebraic-graph-duoids] Dynamic Libraries installed in:
  21504. 423.32 s [algebraic-graph-duoids] /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3
  21505. 423.32 s [algebraic-graph-duoids] Private executables installed in:
  21506. 423.32 s [algebraic-graph-duoids] /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/libexec/x86_64-linux-ghc-9.12.2-82d3/algebraic-graph-duoids-0.0.1.0
  21507. 423.32 s [algebraic-graph-duoids] Data files installed in:
  21508. 423.32 s [algebraic-graph-duoids] /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/share/x86_64-linux-ghc-9.12.2-82d3/algebraic-graph-duoids-0.0.1.0
  21509. 423.32 s [algebraic-graph-duoids] Documentation installed in:
  21510. 423.32 s [algebraic-graph-duoids] /nix/store/kqis4bsgc73hs0kshbl2dpy6s520dkmi-algebraic-graph-duoids-0.0.1.0-doc/share/doc/algebraic-graph-duoids-0.0.1.0
  21511. 423.32 s [algebraic-graph-duoids] Configuration files installed in:
  21512. 423.32 s [algebraic-graph-duoids] /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/etc
  21513. 423.32 s [algebraic-graph-duoids] No alex found
  21514. 423.32 s [algebraic-graph-duoids] Using ar found on system at:
  21515. 423.32 s [algebraic-graph-duoids] /nix/store/iz5lckcsg66r223si2gck7csk2hihj0m-binutils-wrapper-2.44/bin/ar
  21516. 423.32 s [algebraic-graph-duoids] No c2hs found
  21517. 423.32 s [algebraic-graph-duoids] No cpphs found
  21518. 423.32 s [algebraic-graph-duoids] Using doctest version 0.24.2 found on system at:
  21519. 423.32 s [algebraic-graph-duoids] /nix/store/39gb85lds43f7spl5690pdk8d65fpr5l-doctest-0.24.2/bin/doctest
  21520. 423.32 s [algebraic-graph-duoids] Using gcc version 14.3.0 given by user at:
  21521. 423.32 s [algebraic-graph-duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/gcc
  21522. 423.32 s [algebraic-graph-duoids] Using ghc version 9.12.2 found on system at:
  21523. 423.32 s [algebraic-graph-duoids] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc
  21524. 423.32 s [algebraic-graph-duoids] Using ghc-pkg version 9.12.2 found on system at:
  21525. 423.32 s [algebraic-graph-duoids] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/ghc-pkg-9.12.2
  21526. 423.32 s [algebraic-graph-duoids] No ghcjs found
  21527. 423.32 s [algebraic-graph-duoids] No ghcjs-pkg found
  21528. 423.32 s [algebraic-graph-duoids] No greencard found
  21529. 423.32 s [algebraic-graph-duoids] Using haddock version 2.30.0 found on system at:
  21530. 423.32 s [algebraic-graph-duoids] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/haddock-ghc-9.12.2
  21531. 423.32 s [algebraic-graph-duoids] No happy found
  21532. 423.32 s [algebraic-graph-duoids] No haskell-suite found
  21533. 423.32 s [algebraic-graph-duoids] No haskell-suite-pkg found
  21534. 423.32 s [algebraic-graph-duoids] No hmake found
  21535. 423.32 s [algebraic-graph-duoids] Using hpc version 0.69 found on system at:
  21536. 423.32 s [algebraic-graph-duoids] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hpc-ghc-9.12.2
  21537. 423.32 s [algebraic-graph-duoids] Using hsc2hs version 0.68.10 found on system at:
  21538. 423.32 s [algebraic-graph-duoids] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/hsc2hs-ghc-9.12.2
  21539. 423.32 s [algebraic-graph-duoids] Using hscolour version 1.25 found on system at:
  21540. 423.32 s [algebraic-graph-duoids] /nix/store/02s9rad0jn6nj8z96k357im73hkzqsnw-hscolour-1.25/bin/HsColour
  21541. 423.32 s [algebraic-graph-duoids] No jhc found
  21542. 423.32 s [algebraic-graph-duoids] Using ld found on system at:
  21543. 423.32 s [algebraic-graph-duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/ld
  21544. 423.32 s [algebraic-graph-duoids] No pkg-config found
  21545. 423.32 s [algebraic-graph-duoids] Using runghc version 9.12.2 found on system at:
  21546. 423.32 s [algebraic-graph-duoids] /nix/store/qb40z3a8ldgckx61vjsi26j7c07ji66f-ghc-9.12.2/bin/runghc-9.12.2
  21547. 423.32 s [algebraic-graph-duoids] Using strip version 2.44 found on system at:
  21548. 423.32 s [algebraic-graph-duoids] /nix/store/8v97ngkcpfzgghwnnr7fsz33p2x22gy9-gcc-wrapper-14.3.0/bin/strip
  21549. 423.32 s [algebraic-graph-duoids] Using tar found on system at:
  21550. 423.32 s [algebraic-graph-duoids] /nix/store/xl6pd2spjajwcpq09fnmnjv5psqmlmma-gnutar-1.35/bin/tar
  21551. 423.32 s [algebraic-graph-duoids] No uhc found
  21552. 423.55 s [algebraic-graph-duoids] Phase: buildPhase
  21553. 423.60 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  21554. 423.60 s [algebraic-graph-duoids] Building library for algebraic-graph-duoids-0.0.1.0...
  21555. 423.71 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 )
  21556. 424.11 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 )
  21557. 424.88 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, dist/build/Algebra/Graph/Duoid.p_o )
  21558. 425.34 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 )
  21559. 428.43 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  21560. 428.43 s [algebraic-graph-duoids] Building test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  21561. 428.52 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 )
  21562. 428.95 s [algebraic-graph-duoids] [2 of 2] Compiling Main ( tests/doctests.hs, dist/build/doctests/doctests-tmp/Main.o )
  21563. 429.57 s [algebraic-graph-duoids] [3 of 3] Linking dist/build/doctests/doctests
  21564. 432.83 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  21565. 432.83 s [algebraic-graph-duoids] Building test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  21566. 432.94 s [algebraic-graph-duoids] [1 of 1] Compiling Main ( tests/laws.hs, dist/build/laws/laws-tmp/Main.o )
  21567. 433.85 s [algebraic-graph-duoids] [2 of 2] Linking dist/build/laws/laws
  21568. 434.73 s [algebraic-graph-duoids] Phase: checkPhase
  21569. 434.97 s [algebraic-graph-duoids] Running 2 test suites...
  21570. 434.97 s [algebraic-graph-duoids] Test suite doctests: RUNNING...
  21571. 435.40 s [algebraic-graph-duoids] Examples: 0 Tried: 0 Errors: 0 Failures: 0
  21572. 435.43 s [algebraic-graph-duoids] NameLib Nothing
  21573. 435.43 s [algebraic-graph-duoids] ----------------------------------------
  21574. 435.44 s [algebraic-graph-duoids] Test suite doctests: PASS
  21575. 435.44 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-doctests.log
  21576. 435.44 s [algebraic-graph-duoids] Test suite laws: RUNNING...
  21577. 435.44 s [algebraic-graph-duoids] ━━━ Duoid.Normal (Graph Word8) ━━━
  21578. 435.45 s [algebraic-graph-duoids] ✓ unswapUnit passed 100 tests.
  21579. 435.45 s [algebraic-graph-duoids] ✓ interchange passed 100 tests.
  21580. 435.45 s [algebraic-graph-duoids] ✓ splitUnit passed 100 tests.
  21581. 435.45 s [algebraic-graph-duoids] ✓ joinUnit passed 100 tests.
  21582. 435.45 s [algebraic-graph-duoids] ✓ swapUnit passed 100 tests.
  21583. 435.45 s [algebraic-graph-duoids] ✓ 5 succeeded.
  21584. 435.45 s [algebraic-graph-duoids] Test suite laws: PASS
  21585. 435.45 s [algebraic-graph-duoids] Test suite logged to: dist/test/algebraic-graph-duoids-0.0.1.0-laws.log
  21586. 435.45 s [algebraic-graph-duoids] 2 of 2 test suites (2 of 2 test cases) passed.
  21587. 435.46 s [algebraic-graph-duoids] Phase: haddockPhase
  21588. 436.69 s [algebraic-graph-duoids] Preprocessing library for algebraic-graph-duoids-0.0.1.0...
  21589. 436.69 s [algebraic-graph-duoids] Running Haddock on library for algebraic-graph-duoids-0.0.1.0...
  21590. 436.97 s [algebraic-graph-duoids] [1 of 2] Compiling Algebra.Graph.Duoid ( src/Algebra/Graph/Duoid.hs, nothing ) [HIE file is missing]
  21591. 437.33 s [algebraic-graph-duoids] [2 of 2] Compiling Algebra.Graph.Duoid.Orphans ( src/Algebra/Graph/Duoid/Orphans.hs, nothing ) [HIE file is missing]
  21592. 437.48 s [algebraic-graph-duoids] Haddock coverage:
  21593. 437.74 s [algebraic-graph-duoids] 100% ( 5 / 5) in 'Algebra.Graph.Duoid'
  21594. 437.74 s [algebraic-graph-duoids] 100% ( 1 / 1) in 'Algebra.Graph.Duoid.Orphans'
  21595. 445.34 s [algebraic-graph-duoids] Documentation created: dist/doc/html/algebraic-graph-duoids,
  21596. 445.34 s [algebraic-graph-duoids] dist/doc/html/algebraic-graph-duoids/algebraic-graph-duoids.txt
  21597. 446.64 s [algebraic-graph-duoids] Preprocessing test suite 'doctests' for algebraic-graph-duoids-0.0.1.0...
  21598. 447.88 s [algebraic-graph-duoids] Preprocessing test suite 'laws' for algebraic-graph-duoids-0.0.1.0...
  21599. 448.02 s [algebraic-graph-duoids] Phase: installPhase
  21600. 448.08 s [algebraic-graph-duoids] Installing library in /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/algebraic-graph-duoids-0.0.1.0-LVYR75RwDMA4rgV1xNnsfQ
  21601. 448.28 s [algebraic-graph-duoids] Phase: fixupPhase
  21602. 448.29 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0
  21603. 448.29 s [algebraic-graph-duoids] shrinking /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/lib/ghc-9.12.2/lib/x86_64-linux-ghc-9.12.2-82d3/libHSalgebraic-graph-duoids-0.0.1.0-LVYR75RwDMA4rgV1xNnsfQ-ghc9.12.2.so
  21604. 448.30 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0...
  21605. 448.31 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0
  21606. 448.32 s [algebraic-graph-duoids] stripping (with command strip and flags -S -p) in /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/lib
  21607. 448.35 s [algebraic-graph-duoids] shrinking RPATHs of ELF executables and libraries in /nix/store/kqis4bsgc73hs0kshbl2dpy6s520dkmi-algebraic-graph-duoids-0.0.1.0-doc
  21608. 448.36 s [algebraic-graph-duoids] checking for references to /build/ in /nix/store/kqis4bsgc73hs0kshbl2dpy6s520dkmi-algebraic-graph-duoids-0.0.1.0-doc...
  21609. 448.37 s [algebraic-graph-duoids] patching script interpreter paths in /nix/store/kqis4bsgc73hs0kshbl2dpy6s520dkmi-algebraic-graph-duoids-0.0.1.0-doc
  21610. 448.48 s [algebraic-graph-duoids:post-build] Uploading to cachix cache "sellout": /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0 /nix/store/kqis4bsgc73hs0kshbl2dpy6s520dkmi-algebraic-graph-duoids-0.0.1.0-doc
  21611. 449.05 s [algebraic-graph-duoids:post-build] Pushing 2 paths (76 are already present) using zstd to cache sellout ⏳
  21612. 449.05 s [algebraic-graph-duoids:post-build]
  21613. 449.42 s [algebraic-graph-duoids:post-build] Pushing /nix/store/kqis4bsgc73hs0kshbl2dpy6s520dkmi-algebraic-graph-duoids-0.0.1.0-doc (540.14 KiB)
  21614. 449.57 s [algebraic-graph-duoids:post-build] Pushing /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0 (1.24 MiB)
  21615. 450.51 s [algebraic-graph-duoids:post-build]
  21616. 450.55 s [algebraic-graph-duoids:post-build] All done.
  21617. 450.55 s [algebraic-graph-duoids:post-build] Uploading to the NixCI cache: /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0 /nix/store/kqis4bsgc73hs0kshbl2dpy6s520dkmi-algebraic-graph-duoids-0.0.1.0-doc
  21618. 450.56 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21619. 450.57 s [algebraic-graph-duoids:post-build] copying 2 paths...
  21620. 450.57 s [algebraic-graph-duoids:post-build] copying path '/nix/store/kqis4bsgc73hs0kshbl2dpy6s520dkmi-algebraic-graph-duoids-0.0.1.0-doc' to 'https://cache.nix-ci.com'...
  21621. 450.94 s [algebraic-graph-duoids:post-build] copying path '/nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0' to 'https://cache.nix-ci.com'...
  21622. 451.44 s [algebraic-graph-duoids:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21623. 451.67 s [algebraic-graph-duoids:post-build] copying 1 paths...
  21624. 451.67 s [algebraic-graph-duoids:post-build] copying path '/nix/store/75ihv4bmf46fckrl91pbn7449akgjmz2-algebraic-graph-duoids-0.0.1.0.drv' to 'https://cache.nix-ci.com'...
  21625. 451.92 s Progress: 10 of 14 built, 43 of 43 downloaded from cache
  21626. 451.95 s Building /nix/store/bl2k01s2lgvm5wllc6f9q1mr7cv4wagp-ghc-9.12.2-with-packages.drv
  21627. 451.99 s [ghc-9.12.2-with-packages] /nix/store/scmby30dka4njfxm1w6njdavhbdi3dv6-duoidal-transformers-0.0.1.0/nix-support:
  21628. 451.99 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21629. 451.99 s [ghc-9.12.2-with-packages] /nix/store/dxchzkr03dgfn7fwrd25dnkc7dzwhcka-duoids-0.0.1.0/nix-support:
  21630. 451.99 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21631. 452.00 s [ghc-9.12.2-with-packages] /nix/store/b23lx4bcxv7k9d65q88921y71rbk250l-duoids-hedgehog-0.0.1.0/nix-support:
  21632. 452.00 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21633. 452.00 s [ghc-9.12.2-with-packages] /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support:
  21634. 452.00 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21635. 452.01 s [ghc-9.12.2-with-packages] /nix/store/fs2iyc6c2n6f5z2x54nny3fsi996p3m1-algebraic-graphs-0.7/nix-support:
  21636. 452.01 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21637. 452.01 s [ghc-9.12.2-with-packages] /nix/store/7g5rhcln9b5xc36jq2vizcngpyp61vgv-ghc-compat-plugin-0.1.0.1/nix-support:
  21638. 452.01 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21639. 452.01 s [ghc-9.12.2-with-packages] /nix/store/7g5rhcln9b5xc36jq2vizcngpyp61vgv-ghc-compat-plugin-0.1.0.1/nix-support:
  21640. 452.01 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21641. 452.01 s [ghc-9.12.2-with-packages] /nix/store/q6v155i381w7bwwybxw7j6n48zi29a0r-hedgehog-1.5/nix-support:
  21642. 452.01 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21643. 452.02 s [ghc-9.12.2-with-packages] /nix/store/q6v155i381w7bwwybxw7j6n48zi29a0r-hedgehog-1.5/nix-support:
  21644. 452.02 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21645. 452.02 s [ghc-9.12.2-with-packages] /nix/store/xg51g5848hpl9mps77x2gh0kqp5vpy1v-ansi-terminal-1.1.3/nix-support:
  21646. 452.02 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21647. 452.02 s [ghc-9.12.2-with-packages] /nix/store/xg51g5848hpl9mps77x2gh0kqp5vpy1v-ansi-terminal-1.1.3/nix-support:
  21648. 452.02 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21649. 452.02 s [ghc-9.12.2-with-packages] /nix/store/ipgap254wlcl0bxhd0637mn5k6dhijrs-async-2.2.5/nix-support:
  21650. 452.02 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21651. 452.02 s [ghc-9.12.2-with-packages] /nix/store/ipgap254wlcl0bxhd0637mn5k6dhijrs-async-2.2.5/nix-support:
  21652. 452.03 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21653. 452.03 s [ghc-9.12.2-with-packages] /nix/store/9yp7zgnf5ldsswrcn24lr4wmk6gjs95f-barbies-2.1.1.0/nix-support:
  21654. 452.03 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21655. 452.03 s [ghc-9.12.2-with-packages] /nix/store/9yp7zgnf5ldsswrcn24lr4wmk6gjs95f-barbies-2.1.1.0/nix-support:
  21656. 452.03 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21657. 452.04 s [ghc-9.12.2-with-packages] /nix/store/zag06nyx3hrgh9q0ng1pxjc7fhl02qf6-concurrent-output-1.10.21/nix-support:
  21658. 452.04 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21659. 452.04 s [ghc-9.12.2-with-packages] /nix/store/zag06nyx3hrgh9q0ng1pxjc7fhl02qf6-concurrent-output-1.10.21/nix-support:
  21660. 452.04 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21661. 452.04 s [ghc-9.12.2-with-packages] /nix/store/14hg9mg5gjcfm6mv57msj2gfrhczbfgb-lifted-async-0.10.2.7/nix-support:
  21662. 452.04 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21663. 452.04 s [ghc-9.12.2-with-packages] /nix/store/14hg9mg5gjcfm6mv57msj2gfrhczbfgb-lifted-async-0.10.2.7/nix-support:
  21664. 452.04 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21665. 452.05 s [ghc-9.12.2-with-packages] /nix/store/s67l7qhsmagm8rqynpp5rb3sgbc9a5kf-mmorph-1.2.1/nix-support:
  21666. 452.05 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21667. 452.05 s [ghc-9.12.2-with-packages] /nix/store/s67l7qhsmagm8rqynpp5rb3sgbc9a5kf-mmorph-1.2.1/nix-support:
  21668. 452.05 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21669. 452.05 s [ghc-9.12.2-with-packages] /nix/store/7l39g9km1nh2psckx2x38mmri14fvc9l-monad-control-1.0.3.1/nix-support:
  21670. 452.05 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21671. 452.05 s [ghc-9.12.2-with-packages] /nix/store/7l39g9km1nh2psckx2x38mmri14fvc9l-monad-control-1.0.3.1/nix-support:
  21672. 452.05 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21673. 452.05 s [ghc-9.12.2-with-packages] /nix/store/423avffd1cpailh8mv3fwln1fiiyb6ap-pretty-show-1.10/nix-support:
  21674. 452.05 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21675. 452.05 s [ghc-9.12.2-with-packages] /nix/store/423avffd1cpailh8mv3fwln1fiiyb6ap-pretty-show-1.10/nix-support:
  21676. 452.05 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21677. 452.06 s [ghc-9.12.2-with-packages] /nix/store/wfq9yc6in1kk2934d7f3djrknzf52wlh-primitive-0.9.1.0/nix-support:
  21678. 452.06 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21679. 452.06 s [ghc-9.12.2-with-packages] /nix/store/wfq9yc6in1kk2934d7f3djrknzf52wlh-primitive-0.9.1.0/nix-support:
  21680. 452.06 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21681. 452.06 s [ghc-9.12.2-with-packages] /nix/store/d5vb2zs15rh4k0dhiprx92v727nsb9kh-random-1.2.1.3/nix-support:
  21682. 452.06 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21683. 452.06 s [ghc-9.12.2-with-packages] /nix/store/d5vb2zs15rh4k0dhiprx92v727nsb9kh-random-1.2.1.3/nix-support:
  21684. 452.06 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21685. 452.06 s [ghc-9.12.2-with-packages] /nix/store/2jwii2l1zjhs98x4vj0w8r35bmybwxdg-resourcet-1.3.0/nix-support:
  21686. 452.06 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21687. 452.07 s [ghc-9.12.2-with-packages] /nix/store/2jwii2l1zjhs98x4vj0w8r35bmybwxdg-resourcet-1.3.0/nix-support:
  21688. 452.07 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21689. 452.07 s [ghc-9.12.2-with-packages] /nix/store/vjd636z43wwk701gmwlbgy4nlq4d1xz4-safe-exceptions-0.1.7.4/nix-support:
  21690. 452.07 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21691. 452.07 s [ghc-9.12.2-with-packages] /nix/store/vjd636z43wwk701gmwlbgy4nlq4d1xz4-safe-exceptions-0.1.7.4/nix-support:
  21692. 452.07 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21693. 452.07 s [ghc-9.12.2-with-packages] /nix/store/z9sdjmgzn83ri3hfzhfg8dn7yrl9jhps-transformers-base-0.4.6/nix-support:
  21694. 452.07 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21695. 452.07 s [ghc-9.12.2-with-packages] /nix/store/z9sdjmgzn83ri3hfzhfg8dn7yrl9jhps-transformers-base-0.4.6/nix-support:
  21696. 452.07 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21697. 452.07 s [ghc-9.12.2-with-packages] /nix/store/96nf4ff4shj7yg3r6knm3jws42gxp33r-wl-pprint-annotated-0.1.0.1/nix-support:
  21698. 452.07 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21699. 452.08 s [ghc-9.12.2-with-packages] /nix/store/96nf4ff4shj7yg3r6knm3jws42gxp33r-wl-pprint-annotated-0.1.0.1/nix-support:
  21700. 452.08 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21701. 452.08 s [ghc-9.12.2-with-packages] /nix/store/m0142z9fsakrn9yyicrnqdndww3vgd64-ansi-terminal-types-1.1.3/nix-support:
  21702. 452.08 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21703. 452.08 s [ghc-9.12.2-with-packages] /nix/store/m0142z9fsakrn9yyicrnqdndww3vgd64-ansi-terminal-types-1.1.3/nix-support:
  21704. 452.08 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21705. 452.09 s [ghc-9.12.2-with-packages] /nix/store/n9m44dbds9vzw5xmgficydgzk7hhbmc8-hashable-1.5.0.0/nix-support:
  21706. 452.09 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21707. 452.09 s [ghc-9.12.2-with-packages] /nix/store/n9m44dbds9vzw5xmgficydgzk7hhbmc8-hashable-1.5.0.0/nix-support:
  21708. 452.09 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21709. 452.09 s [ghc-9.12.2-with-packages] /nix/store/8vgq4w4m05fwqyp1lf1xpdw21cwm4vbb-distributive-0.6.2.1/nix-support:
  21710. 452.09 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21711. 452.09 s [ghc-9.12.2-with-packages] /nix/store/8vgq4w4m05fwqyp1lf1xpdw21cwm4vbb-distributive-0.6.2.1/nix-support:
  21712. 452.09 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21713. 452.10 s [ghc-9.12.2-with-packages] /nix/store/2bw7j5ycplznsly2rvppqnp62is235sh-constraints-0.14.2/nix-support:
  21714. 452.10 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21715. 452.10 s [ghc-9.12.2-with-packages] /nix/store/2bw7j5ycplznsly2rvppqnp62is235sh-constraints-0.14.2/nix-support:
  21716. 452.10 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21717. 452.10 s [ghc-9.12.2-with-packages] /nix/store/4gfdxa8hl1w74n5yp3ck2wbj7mzj1cmd-lifted-base-0.2.3.12/nix-support:
  21718. 452.10 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21719. 452.11 s [ghc-9.12.2-with-packages] /nix/store/4gfdxa8hl1w74n5yp3ck2wbj7mzj1cmd-lifted-base-0.2.3.12/nix-support:
  21720. 452.11 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21721. 452.11 s [ghc-9.12.2-with-packages] /nix/store/5jinlayffmmgvsr8m7105q1cjj4gfpz2-transformers-compat-0.7.2/nix-support:
  21722. 452.11 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21723. 452.11 s [ghc-9.12.2-with-packages] /nix/store/5jinlayffmmgvsr8m7105q1cjj4gfpz2-transformers-compat-0.7.2/nix-support:
  21724. 452.11 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21725. 452.12 s [ghc-9.12.2-with-packages] /nix/store/bdc1bdwqz4x1ssfrqwpa5m42s1r0k0xh-splitmix-0.1.3.1/nix-support:
  21726. 452.12 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21727. 452.12 s [ghc-9.12.2-with-packages] /nix/store/bdc1bdwqz4x1ssfrqwpa5m42s1r0k0xh-splitmix-0.1.3.1/nix-support:
  21728. 452.12 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21729. 452.12 s [ghc-9.12.2-with-packages] /nix/store/k62bxh5mp5jkx6fz6p0g2pql3p6axf1x-unliftio-core-0.2.1.0/nix-support:
  21730. 452.12 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21731. 452.12 s [ghc-9.12.2-with-packages] /nix/store/k62bxh5mp5jkx6fz6p0g2pql3p6axf1x-unliftio-core-0.2.1.0/nix-support:
  21732. 452.12 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21733. 452.12 s [ghc-9.12.2-with-packages] /nix/store/kvbnnrw3p2rqry9n0xfr84j9mlhvkkw0-base-orphans-0.9.3/nix-support:
  21734. 452.12 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21735. 452.12 s [ghc-9.12.2-with-packages] /nix/store/kvbnnrw3p2rqry9n0xfr84j9mlhvkkw0-base-orphans-0.9.3/nix-support:
  21736. 452.12 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21737. 452.13 s [ghc-9.12.2-with-packages] /nix/store/sxjk0703g3jy7l7afnyys0xy2hq87vkg-tagged-0.8.9/nix-support:
  21738. 452.13 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21739. 452.13 s [ghc-9.12.2-with-packages] /nix/store/sxjk0703g3jy7l7afnyys0xy2hq87vkg-tagged-0.8.9/nix-support:
  21740. 452.13 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21741. 452.13 s [ghc-9.12.2-with-packages] /nix/store/cfx4qsi8c39l5ayzgx5hw30wpfnncql7-boring-0.2.2/nix-support:
  21742. 452.13 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21743. 452.13 s [ghc-9.12.2-with-packages] /nix/store/cfx4qsi8c39l5ayzgx5hw30wpfnncql7-boring-0.2.2/nix-support:
  21744. 452.13 s [ghc-9.12.2-with-packages] propagated-build-inputs: Keeping existing link to /nix/store/8jb6v9x178hpmc4bl96i290fby1wvxcg-algebraic-graph-duoids-0.0.1.0/nix-support/propagated-build-inputs
  21745. 454.14 s [ghc-9.12.2-with-packages:post-build] Uploading to cachix cache "sellout": /nix/store/43zkx04kdsy2ij33xrmwg9bv6k4m8f3k-ghc-9.12.2-with-packages
  21746. 454.61 s [ghc-9.12.2-with-packages:post-build] Pushing 1 paths (144 are already present) using zstd to cache sellout ⏳
  21747. 454.61 s [ghc-9.12.2-with-packages:post-build]
  21748. 454.96 s [ghc-9.12.2-with-packages:post-build] Pushing /nix/store/43zkx04kdsy2ij33xrmwg9bv6k4m8f3k-ghc-9.12.2-with-packages (6.04 MiB)
  21749. 456.57 s [ghc-9.12.2-with-packages:post-build]
  21750. 456.65 s [ghc-9.12.2-with-packages:post-build] All done.
  21751. 456.65 s [ghc-9.12.2-with-packages:post-build] Uploading to the NixCI cache: /nix/store/43zkx04kdsy2ij33xrmwg9bv6k4m8f3k-ghc-9.12.2-with-packages
  21752. 456.65 s [ghc-9.12.2-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21753. 456.85 s [ghc-9.12.2-with-packages:post-build] copying 1 paths...
  21754. 456.85 s [ghc-9.12.2-with-packages:post-build] copying path '/nix/store/43zkx04kdsy2ij33xrmwg9bv6k4m8f3k-ghc-9.12.2-with-packages' to 'https://cache.nix-ci.com'...
  21755. 458.06 s [ghc-9.12.2-with-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21756. 458.30 s [ghc-9.12.2-with-packages:post-build] copying 1 paths...
  21757. 458.30 s [ghc-9.12.2-with-packages:post-build] copying path '/nix/store/bl2k01s2lgvm5wllc6f9q1mr7cv4wagp-ghc-9.12.2-with-packages.drv' to 'https://cache.nix-ci.com'...
  21758. 458.53 s Progress: 11 of 13 built, 43 of 43 downloaded from cache
  21759. 458.56 s Building /nix/store/5hxczgcm7i45wdk287vp8zr3pszx72xi-all-packages.drv
  21760. 458.62 s [all-packages] created 3 symlinks in user environment
  21761. 458.64 s [all-packages:post-build] Uploading to cachix cache "sellout": /nix/store/d23qaa0mwfi16xpawjyvx46ckdp93p2x-all-packages
  21762. 459.12 s [all-packages:post-build] Pushing 1 paths (145 are already present) using zstd to cache sellout ⏳
  21763. 459.12 s [all-packages:post-build]
  21764. 459.51 s [all-packages:post-build] Pushing /nix/store/d23qaa0mwfi16xpawjyvx46ckdp93p2x-all-packages (872.00 B)
  21765. 460.49 s [all-packages:post-build]
  21766. 460.49 s [all-packages:post-build] All done.
  21767. 460.51 s [all-packages:post-build] Uploading to the NixCI cache: /nix/store/d23qaa0mwfi16xpawjyvx46ckdp93p2x-all-packages
  21768. 460.55 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21769. 460.77 s [all-packages:post-build] copying 1 paths...
  21770. 460.77 s [all-packages:post-build] copying path '/nix/store/d23qaa0mwfi16xpawjyvx46ckdp93p2x-all-packages' to 'https://cache.nix-ci.com'...
  21771. 461.13 s [all-packages:post-build] warning: 'warn-short-path-literals' is deprecated, use 'lint-short-path-literals = ignore' instead
  21772. 461.37 s [all-packages:post-build] copying 1 paths...
  21773. 461.37 s [all-packages:post-build] copying path '/nix/store/5hxczgcm7i45wdk287vp8zr3pszx72xi-all-packages.drv' to 'https://cache.nix-ci.com'...
  21774. 461.60 s Progress: 12 of 13 built, 43 of 43 downloaded from cache
  21775. 461.60 s Progress: 13 of 13 built, 43 of 43 downloaded from cache
  21776. 461.60 s /nix/store/d23qaa0mwfi16xpawjyvx46ckdp93p2x-all-packages
  21777. 461.63 s Build succeeded.
Tail Raw Logs